Questions by srestha / GATE Overflow for GATE CSE

3 votes

5 answers

21

Made Easy Test Series:Binary Trees
Consider the following function height, to which pointer to the root node of a binary tree shown below is passed Note that max(a,b) defined by #define max(a,b) (a>b)?a:b. int height(Node *root) The output of the above code will be _________________

Consider the following function height, to which pointer to the root node of a binary tree shown below is passedNote that max(a,b) defined by #define max(a,b) (a>b)?a:b.i...

1.9k views

asked May 22, 2019

1 votes

0 answers

22

Made Easy Test Series:Databases-Tables
Number of tables required in above ER diagram will be _____________ Is $R_{1}$ create separate table or not?? and $R_{2}$ look like if we remove loop from it?? Answer given for table $E_{1}R_{1}$ Key will be $AC$ , with ... Entities. So, it will add one extra table. I already read https://gateoverflow.in/229580/madeeasy-test-series-number-of-tables-required

Number of tables required in above ER diagram will be _____________Is $R_{1}$ create separate table or not?? and $R_{2}$ look like if we remove loop from it??Answer given...

801 views

asked May 22, 2019

0 votes

1 answer

23

Made Easy Test Series:Aptitude
Chandan and Falguni work on alternet days. Chandan working on 1st day, Falguni on 2nd , then Chandan again by 3rd , followed by Falguni on 4th and so on. They can finish the work in $25$ days. The work done by chandan varies everyday. On a ... by Chandan on 1st day to done by Falguni on 2nd day$=1:4.$ The time require Falguni alone finish the work ____________ days

Chandan and Falguni work on alternet days. Chandan working on 1st day, Falguni on 2nd , then Chandan again by 3rd , followed by Falguni on 4th and so on. They can finis...

500 views

asked May 22, 2019

1 votes

1 answer

24

Made Easy Test Series: Stack Address
A stack based CPU executes the instruction. Memory location $500$ contain $0X 88$ and memory location $700$ contain $0X37$. The stack pointer is at $0X003F$ The instruction are as follows: $I_{1}:PUSH$ $500$ $I_{2}:PUSH$. $700$ ... execution of instruction. $C)$ Memory location $600$ contain $0XBF$ after execution of instruction. $D)$ Both $a)$ and $c)$

A stack based CPU executes the instruction. Memory location $500$ contain $0X 88$ and memory location $700$ contain $0X37$. The stack pointer is at $0X003F$The instructio...

777 views

asked May 22, 2019

0 votes

1 answer

25

Made Easy Test Series:General Aptitude-Circle
In a right angle triangle $ABC$ with vertex $B$ being the right angle, the mutually perpendicular sides $AB$ and $BC$ are $p$ cm. and $q$ cm. long respectively. If the length of hypotenuse is $\left ( p+q-6 \right )$ cm., then the radius of the largest possible circle that can be inscribe in the triangle is ____________

In a right angle triangle $ABC$ with vertex $B$ being the right angle, the mutually perpendicular sides $AB$ and $BC$ are $p$ cm. and $q$ cm. long respectively. If the le...

1.2k views

asked May 21, 2019

5 votes

2 answers

26

Made Easy Test Series:Microprogramming
A hypothetical cpu supports $300$ instructions.each instruction takes $5$ cycle to accomplish the execution. the control unit is designed using vertical programming which has $130$ control signals $,64$ flags and $12$ branch conditions .$X$ and ... register$(CDR)$ respectively.value of $X+Y$ is ______? How to work with branch condition in micro programming :(

A hypothetical cpu supports $300$ instructions.each instruction takes $5$ cycle to accomplish the execution. the control unit is designed using vertical programming which...

2.8k views

asked May 20, 2019

4 votes

3 answers

27

Made Easy Test Series:Programming(FLT4)
#include<stdio.h> #include<iostream> int bar(int m, int n){ if(m==0)return n; if(n==0)return m; return bar(n%m,m); } int foo(int m,int n){ return(m*n/bar(m,n)); } int main(){ int x=foo(1000,1500); printf("%d",x); return 0; } Output of the program is ___________

#include<stdio.h #include<iostream int bar(int m, int n){ if(m==0)return n; if(n==0)return m; return bar(n%m,m); } int foo(int m,int n){ return(m*n/bar(m,n)); } int main(...

1.0k views

asked May 20, 2019

1 votes

2 answers

28

Made Easy Test Series: Synchronization
Consider the two processes need to access $P_{i}$ and $P_{j}$ need to access the C.S. The following synchronization construct used by both the processes. Process Pi While(true){ j=false; i=true; while(j==true); CRITICAL SECTION i=false; } ... true); CRITICAL SECTION j=false; } I got it is not satisfying M.E., but will it satisfying deadlock too?? Plz explain-

Consider the two processes need to access $P_{i}$ and $P_{j}$ need to access the C.S. The following synchronization construct used by both the processes.Process Pi While...

1.5k views

asked May 20, 2019

2 votes

1 answer

29

Made Easy Test Series:Programming in C
Consider the following $C$ implementation which when given $3$ numbers a,b,c as input, find the maximum of $3$ numbers $a,b,c.$ int kickstart(int a,int b,int c) { if(B1) return a; if(a>=b) return B2; return kickstart(c,a,b); } How the boxes filled up ... $a\geq c, B2:kickstart\left ( b,c,a \right );$ Is it $I) and II)$ or $I) and IV)$

Consider the following $C$ implementation which when given $3$ numbers a,b,c as input, find the maximum of $3$ numbers $a,b,c.$int kickstart(int a,int b,int c) { if(B1) r...

1.0k views

asked May 19, 2019

1 votes

0 answers

30

Recurrence Relation-Self Doubt(Discrete Math+Algo)
Let $A(n)$ denotes the number of $n$ bit binary strings which have no pair of consecutive $1’s.$ what will be recurrence relation for it and what will be it’s Time Complexity??

Let $A(n)$ denotes the number of $n$ bit binary strings which have no pair of consecutive $1’s.$ what will be recurrence relation for it and what will be it’s Time Co...

638 views

asked May 19, 2019

0 votes

0 answers

31

Self Doubt:Operating System-Threads
User level threads doesnot require context switching- This is a true statement (Because OS cannot recognize user level threads) Can somebody elaborate more on it?? This given answer is wrong I think:https://gateoverflow.in/290648/made_easy_test_series Plz check

User level threads doesnot require context switching- This is a true statement (Because OS cannot recognize user level threads)Can somebody elaborate more on it??This giv...

675 views

asked May 19, 2019

2 votes

2 answers

32

Made Easy Test Series: Database-Normalization
Consider the relation $R\left ( A,B,C,D,E \right )$ with functional dependencies $F=${ $A\rightarrow B$ $BC\rightarrow E$ $ED\rightarrow A$ } Number of additional relation required to convert it into lossless , dependency preserving $3NF$ decomposition is _____________ What is meaning of additional relation (Here no table mentioned previously)??

Consider the relation $R\left ( A,B,C,D,E \right )$ with functional dependencies$F=${$A\rightarrow B$$BC\rightarrow E$$ED\rightarrow A$}Number of additional relation requ...

1.3k views

asked May 19, 2019

2 votes

1 answer

33

Made Easy Test Series:Algorithm-Dijkstra
Which of the following procedure results same output as Dijkstra’s Algo. on unweighted graph on $'n'$ verices? $A)$ BFS $B)$ DFS $C)$Kruskal $D)$ Prims As far I know Dijkstra and Prims both have $T.C.=O(E+VlogV)$ But ans given BFS. How this ans possible??

Which of the following procedure results same output as Dijkstra’s Algo. on unweighted graph on $'n'$ verices?$A)$ BFS $B)$ DFS $C)$Kruskal $D)$ PrimsAs far I know ...

847 views

asked May 18, 2019

0 votes

2 answers

34

Made Easy Test Series:Discrete Mathematics-Poset
Consider the following Posets: $I)\left ( \left \{ 1,2,5,7,10,14,35,70 \right \},\leq \right )$ $II)\left ( \left \{ 1,2,3,6,14,21,42 \right \},/ \right )$ $III)\left ( \left \{ 1,2,3,6,11,22,33,66 \right \},/ \right )$ Which of the above poset are isomorphic to $\left ( P\left ( S \right ),\subseteq \right )$ where $S=\left \{ a,b,c \right \}?$

Consider the following Posets:$I)\left ( \left \{ 1,2,5,7,10,14,35,70 \right \},\leq \right )$$II)\left ( \left \{ 1,2,3,6,14,21,42 \right \},/ \right )$$III)\left ( \lef...

1.1k views

asked May 18, 2019

6 votes

1 answer

35

Made Easy Test Series:Algorithm-Time Complexity
Consider a procedure $find()$ which take array of $n$ integers as input, and produce pair of element of array whose difference is not greater than the difference of any other pair of element of that array. Which of the following represent ... Here we need to sort first and then need to compare adjacent element right?? Then what will be complexity??

Consider a procedure $find()$ which take array of $n$ integers as input, and produce pair of element of array whose difference is not greater than the difference of any o...

2.1k views

asked May 18, 2019

1 votes

0 answers

36

Self Doubt:Mathematical Logic
Represent these two statement in first order logic: $A)$ Only Alligators eat humans $B)$ Every Alligator eats humans Is Every represents $\equiv \exists$ and Only represents $\equiv \forall$ ?? Can we differentiate it with verb ‘eat’ and ‘eats’??

Represent these two statement in first order logic:$A)$ Only Alligators eat humans$B)$ Every Alligator eats humansIs Every represents $\equiv \exists$and Only represents ...

559 views

asked May 18, 2019

3 votes

2 answers

37

Made Easy Test Series:Database-Indexing
The minimum number of nodes (both leaf and non-leaf) of $B^{+}$ tree index required for storing $5500$ keys and order of $B^{+}$ tree is $8$________________(order is max pointers a node can have) See here first level should be divide by $7$ ... pointer of 1st level has $8$ pointer in 2nd level. Am I missing something?? But in ans they divided by only $8$ :(

The minimum number of nodes (both leaf and non-leaf) of $B^{+}$ tree index required for storing $5500$ keys and order of $B^{+}$ tree is $8$________________(order is max ...

1.5k views

asked May 17, 2019

1 votes

0 answers

38

Made Easy Test Series: Algorithm-Reverse Polish Notation
Consider the new-order strategy for traversing a binary tree: Visit the root Visit the right subtree using new-order Visit the left subtree using new-order The new-order traversal of expression tree corresponding to the reverse polish expression 3 4 * 5 – 2 ^ 6 7 * 1 + – What will be expression, any procedure for it??

Consider the new-order strategy for traversing a binary tree:Visit the rootVisit the right subtree using new-orderVisit the left subtree using new-orderThe new-order trav...

587 views

asked May 16, 2019

1 votes

1 answer

39

Made Easy Test Series:Flip-Flop
A Finite State Machine(FSM) is implemented using the D-FFs A and B with logic gates as shown below. The four possible states of FSM are $Q_{A}Q_{B}=00,01,10,11$. Assume that $X_{in}$ is held at constant logic level throughout the operation of FSM. ... states if $X_{in}=0$ How do we check $X_{in}$ here? Can we check it arbitrarily, or checked with prev states??

A Finite State Machine(FSM) is implemented using the D-FFs A and B with logic gates as shown below. The four possible states of FSM are $Q_{A}Q_{B}=00,01,10,11$.Assume th...

1.3k views

asked May 16, 2019

2 votes

0 answers

40

Made Easy Test Series:Compiler Design-CLR parser
$S\rightarrow aA|bAc|dc$ $A\rightarrow d$ Number of states in $CLR\left ( 1 \right )$ parser construction _______________ Is $S\rightarrow d.c|$ $A\rightarrow d.,a$ will be in $1$ state or in $2$ different states??

$S\rightarrow aA|bAc|dc$$A\rightarrow d$Number of states in $CLR\left ( 1 \right )$ parser construction _______________Is$S\rightarrow d.c|$$$A\rightarrow d.,a$will be in...

2.0k views

asked May 15, 2019

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