Recent questions without answers / GATE Overflow for GATE CSE

0 votes

0 answers

9541

ME TEST SERIES QUESTION Compiler Design.
I am getting 5 as answer. I am not getting the solution approach? How did sign of A of production 5 get 0?

I am getting 5 as answer.I am not getting the solution approach? How did sign of A of production 5 get 0?

aoao

188 views

aoao asked Sep 6, 2018

0 votes

0 answers

9542

Test pipleine
The 4 stage pipeline has stage reliability of .8,.9,.7,.8 The maximum reliability of pipeline system is

The 4 stage pipeline has stage reliability of .8,.9,.7,.8The maximum reliability of pipeline system is

priyanka manwani

125 views

priyanka manwani asked Sep 6, 2018

0 votes

0 answers

9543

Operating System Multilevel Paging
In a 32-bit machine we subdivide the virtual address into 4 segments as follows: 10-bi 8-bit 6-bit 8 bit We use a 3-level page table, such that the first 10-bit are for the first level and so on. Page Table Entry Size is 2B 10-bit 8- ... page size which is 2^8 so outer most page cannot fit in one page table But outermost page table should fit in one page ?? ref:

In a 32-bit machine we subdivide the virtual address into 4 segments as follows: 10-bi 8-bit 6-bit 8 bit We use a 3-level page table, such that the first 10-bit ar...

jatin khachane 1

951 views

jatin khachane 1 asked Sep 6, 2018

0 votes

0 answers

9544

Limit

abhishekmehta4u

227 views

abhishekmehta4u asked Sep 6, 2018

0 votes

0 answers

9545

Normalization
If Relation R is in 3NF but not BCNF then R must contain prime attribute- > prime attribute True or false

If Relation R is in 3NF but not BCNF then R must contain prime attribute- prime attribute True or false

Priyanka Agarwal

307 views

Priyanka Agarwal asked Sep 6, 2018

0 votes

0 answers

9546

compiler
Arjun sir will there be any gate overflow practice tests uploaded this year for gate 19 students?

Arjun sir will there be any gate overflow practice tests uploaded this year for gate 19 students?

suyash sayankar

178 views

suyash sayankar asked Sep 5, 2018

0 votes

0 answers

9547

Context free grammar

Deepalitrapti

510 views

Deepalitrapti asked Sep 5, 2018

0 votes

0 answers

9548

#self doubt
is anyone can describe the difference between BASIC TIMESTAMP (BTS) , THOMAS WRITE RULE, & MULTIVERSON TIMESTAMP ?

is anyone can describe the difference between BASIC TIMESTAMP (BTS) , THOMAS WRITE RULE, & MULTIVERSON TIMESTAMP ?

Shubham Aggarwal

108 views

Shubham Aggarwal asked Sep 5, 2018

0 votes

0 answers

9549

lexical analysis
Is both Compiler and Interpreter are offline process ??

Is both Compiler and Interpreter are offline process ??

turendar

820 views

turendar asked Sep 5, 2018

0 votes

0 answers

9550

lexical analysis

turendar

347 views

turendar asked Sep 5, 2018

0 votes

0 answers

9551

#self doubt
https://gateoverflow.in/3828/gate2005-it-66 Plz explain ??

https://gateoverflow.in/3828/gate2005-it-66Plz explain ??

Shubham Aggarwal

179 views

Shubham Aggarwal asked Sep 5, 2018

0 votes

0 answers

9552

SELF DOUBT??
https://gateoverflow.in/47848/isi2012-cs-2a IN THIS QUESTION IS THERE ANY EFFECT OF SAYING BEFORE STAGE X OR ANY OTHER STAGE??

https://gateoverflow.in/47848/isi2012-cs-2aIN THIS QUESTION IS THERE ANY EFFECT OF SAYING BEFORE STAGE X OR ANY OTHER STAGE??

eyeamgj

301 views

eyeamgj asked Sep 5, 2018

0 votes

0 answers

9553

transaction and concurrency control protocol
Consider th following schedule r1(A)r2(B)r3(C)w1(B)w2(C)w3(D) Find the schedule which are possible to execute by strict 2PL protocol? consider commit operation as immediate last operation of each transaction

Consider th following scheduler1(A)r2(B)r3(C)w1(B)w2(C)w3(D)Find the schedule which are possible to execute by strict 2PL protocol? consider commit operation as immediate...

gatecrack

393 views

gatecrack asked Sep 5, 2018

0 votes

0 answers

9554

#testbook_testseries

Anil Ji

113 views

Anil Ji asked Sep 5, 2018

0 votes

0 answers

9555

#testbook_testseries

Anil Ji

148 views

Anil Ji asked Sep 5, 2018

0 votes

0 answers

9556

#made_Easy_workbook

Anil Ji

237 views

Anil Ji asked Sep 5, 2018

0 votes

0 answers

9557

#made_easy_workbook

Anil Ji

290 views

Anil Ji asked Sep 5, 2018

0 votes

0 answers

9558

#Made_Easy_workbook

Anil Ji

154 views

Anil Ji asked Sep 5, 2018

0 votes

0 answers

9559

#Made_Easy_Workbook

Anil Ji

90 views

Anil Ji asked Sep 5, 2018

0 votes

0 answers

9560

General
Are Fibonacci heap and binomial heap important for gate??

Are Fibonacci heap and binomial heap important for gate??

himanshu19

497 views

himanshu19 asked Sep 5, 2018

2 votes

0 answers

9561

Difference between Characteristic table , Excitation table , State table, Truth table
In flip flops which of the following specifies the next state given the present state and inputs ? (A) Characteristic table B) Excitation table (C) Truth table D) State table

In flip flops which of the following specifies the nextstate given the present state and inputs ?(A) Characteristic table B) Excitation table(C) Truth table D...

Sanjay Sharma

4.3k views

Sanjay Sharma asked Sep 5, 2018

0 votes

0 answers

9562

Push Down Automata
Consider A given PDA as following Qo is the start state here. What is the language accepted by the given PDA ? 1. { ( bn a bn a )m | m,n ≥ 0 } 2. { ( bn a bn a )m | m,n ≥ 0 } U { bn | n ≥ 1} 3. { ( bn a bn )m . a | m,n ≥ 0 } 4. None

Consider A given PDA as following Qo is the start state here. What is the language accepted by the given PDA ?1. { ( bn a bn a )m | m,n ≥ 0 }2. { ( bn a bn a )m | m,n ...

Na462

995 views

Na462 asked Sep 5, 2018

0 votes

0 answers

9563

Ace Test Series: Theory Of Computation - Decidablity
Can someone explain this problem?

Can someone explain this problem?

Kalpataru Bose

605 views

Kalpataru Bose asked Sep 4, 2018

0 votes

0 answers

9564

LAN & WAN
Why LAN is broadcast channel and WAN is point to point channel?

Why LAN is broadcast channel and WAN is point to point channel?

saumya mishra

167 views

saumya mishra asked Sep 4, 2018

0 votes

0 answers

9565

Asymptotic

Deepalitrapti

630 views

Deepalitrapti asked Sep 4, 2018

1 votes

0 answers

9566

Stanford Network Lagunita
Your packet has two bit errors, spaced 16 bits apart (for instance, bits 1 and 17), and no other errors. Which of the following schemes will detect the error at least 99.99% of the time? Choose all correct answers. 8-bit checksum 16-bit checksum 8-bit CRC 16-bit CRC 16-bit MAC 32-bit MAC

Your packet has two bit errors, spaced 16 bits apart (for instance, bits 1 and 17), and no other errors. Which of the following schemes will detect the error at least 99....

Mk Utkarsh

705 views

Mk Utkarsh asked Sep 4, 2018

1 votes

0 answers

9567

programing
what will be the output of the code please elaborate the scopes ? #include<stdio.h> int a=10,b=20; C(){ a=23; printf("%d %d\n",a,b); D(); a=6,b=7; } D(){ b=44; E(); printf("%d %d\n",a,b); } E(){ printf("%d %d\n",a,b); a=1,b=2; } int main() { int a=5,b=6; C(); a=2,b=3; E(); printf("%d %d\n",a,b); return 0; }

what will be the output of the code please elaborate the scopes ?#include<stdio.h>int a=10,b=20;C(){ a=23; printf("%d %d\n",a,b); D(); a=6,b=7; }D(){ b...

hitendra singh

589 views

hitendra singh asked Sep 4, 2018

0 votes

0 answers

9568

#Self doubt
https://gateoverflow.in/204076/gate2018-2 Why the answer is A,Why not D?

https://gateoverflow.in/204076/gate2018-2Why the answer is A,Why not D?

himgta

413 views

himgta asked Sep 4, 2018

0 votes

0 answers

9569

Programming (Recursive)
How will this code work? Which output will give? Any error? #include <stdio.h> double recurCutting(int *p,int n){ int i,max,tmp; if(n<1) return 0; max=p[n]; for(i=1;i<n;i++){ tmp=p[i]+recurCutting(p,n-i); if(tmp>max){ max=tmp; } } printf(" ... ; return max; } int main(void) { int prices[]={0,1,3,3,5,5,7,8,3,10,10}; recurCutting(&prices,10); return 0; }

How will this code work? Which output will give? Any error?#include <stdio.h double recurCutting(int *p,int n){ int i,max,tmp; if(n<1) return 0; max=p[n]; for(i=1;i<n;i++...

srestha

288 views

srestha asked Sep 4, 2018

0 votes

0 answers

9570

Greedy Techniques
hello everyone, I think that that the worst case time complexity of the dijkstra's algorithm is O(Elog(V)) and for the situation when a complete graph is considered, this will change to O(V^2(log(V))). ..( i am following the heap , extract min, and decrease ... +V(logV)), which for the complete graph changed to O(n^2 + V(logV)). Please let me know if my reasoning is wrong.

hello everyone, I think that that the worst case time complexity of the dijkstra's algorithm is O(Elog(V)) and for the situation when a complete graph is considered, this...

hrcule

207 views

hrcule asked Sep 4, 2018

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true