Recent activity by chat28 / GATE Overflow for GATE CSE

0 answers

1

Preparing for GATE after taking admission in NITs/IIITs ?
For those of you who have taken admission into NITs/IIITs and prepared for GATE, I would like to ask you a few questions : A) How would you estimate the work load from the colleges in case of NITs ? Roughly how ... for GATE while simultaneously doing Masters from some colleges, might help many of us to make better and informed decision .

For those of you who have taken admission into NITs/IIITs and prepared for GATE, I would like to ask you a few questions :A) How would you estimate the work load from the...

2.9k views

commented Mar 25, 2016

1 answer

2

Regarding cutoffs in IITB
The admission session has not yet started for IITB , but going through previous year's cutoff announcement on their webpage , we can make some idea. Here is the link :- http://www1.iitb.ac.in/newacadhome/Cutofffiles/DeptMtechCutoff.jsp So my ... getting a call then that would be a waste. So can someone please clarify , when they publish their cutoff score? Thanks

The admission session has not yet started for IITB , but going through previous year's cutoff announcement on their webpage , we can make some idea. Here is the link :- h...

1.2k views

commented Mar 8, 2016

1 answer

3

Regarding admissions in IITD
This is a screenshot from the IITD information brochure. Here it is written that the GATE cutoff is >300 for MTECH admisison. How is that possible with such a low score? Here is the link , Go to page 7. https://drive.google.com/file/d/0B8_aYGBndW4HdXk5d0tsSWxtWTQ/view

This is a screenshot from the IITD information brochure. Here it is written that the GATE cutoff is >300 for MTECH admisison. How is that possible with such a low score?H...

1.5k views

commented Mar 6, 2016

0 answers

4

Regarding PHD at IITs
In the cutoff list presented by gateoverflow , for direct PHD at IITs the criteria written is mostly x% in btech+gate score.In some of the places its specified that gate score is above 600 etc. So how do we know the exact cutoff for PHDs at IITs. Upto what gate score do they usually call. Please confirm. Thanks.

In the cutoff list presented by gateoverflow , for direct PHD at IITs the criteria written is mostly x% in btech+gate score.In some of the places its specified that gate ...

6.4k views

commented Mar 1, 2016

6 answers

5

GATE CSE 2016 Set 2 | Question: 15
$N$ items are stored in a sorted doubly linked list. For a delete operation, a pointer is provided to the record to be deleted. For a decrease-key operation, a pointer is provided to the record on which the operation is to be performed. An algorithm performs the following operations ... together? $O(\log^{2} N)$ $O(N)$ $O(N^{2})$ $\Theta\left(N^{2}\log N\right)$

$N$ items are stored in a sorted doubly linked list. For a delete operation, a pointer is provided to the record to be deleted. For a decrease-key operation, a pointer is...

34.4k views

commented Feb 20, 2016

8 answers

6

GATE CSE 2016 Set 2 | Question: 26
A binary relation $R$ on $\mathbb{N} \times \mathbb{N}$ is defined as follows: $(a, b) R(c, d)$ if $a \leq c$ or $b \leq d$. Consider the following propositions: $P:$ $R$ is reflexive. $Q:$ $R$ is transitive. Which one of the following statements is TRUE? ... and $Q$ are true. $P$ is true and $Q$ is false. $P$ is false and $Q$ is true. Both $P$ and $Q$ are false.

A binary relation $R$ on $\mathbb{N} \times \mathbb{N}$ is defined as follows: $(a, b) R(c, d)$ if $a \leq c$ or $b \leq d$. Consider the following propositions:$P:$ $R$ ...

14.7k views

answered Feb 18, 2016

17 answers

7

GATE CSE 2016 Set 1 | Question: 26
The coefficient of $x^{12}$ in $\left(x^{3}+x^{4}+x^{5}+x^{6}+\dots \right)^{3}$ is ___________.

The coefficient of $x^{12}$ in $\left(x^{3}+x^{4}+x^{5}+x^{6}+\dots \right)^{3}$ is ___________.

26.0k views

commented Feb 17, 2016

1 answer

8

Rank estimation for GATE 2016
Can someone give some estimate of rank distribution according to marks based on the difficulty of the question paper set-1?

Can someone give some estimate of rank distribution according to marks based on the difficulty of the question paper set-1?

4.1k views

commented Feb 17, 2016

2 answers

9

GATE CS set1 2016 answer key based on chat discussions
189 views GATE CS Set-1 Answer key based on chat discussions for CS section: 1. best cpu scheduling algo - srtf 2. no.of jk flipflops for a counter - 1 3. min no.of temporary registers - 6 4. worst case time complexities of mergesort, insertion, ... of Min Weight Spanning Tree of 6 distinct edges 1,2,3,4,5,6 - 7 52. missing while loop .. b!=a

189 viewsGATE CS Set-1 Answer key based on chat discussions for CS section:1. best cpu scheduling algo - srtf2. no.of jk flipflops for a counter - 13. min no.of temporary...

2.9k views

commented Feb 10, 2016

4 answers

10

output of this program is
int main(){ int n=1,sum =0; while(n<=10){ sum += n++*n++; } printf("Sum = %d\n",sum); return 0 } ans is 165 . i got 190.please explain??

int main(){ int n=1,sum =0; while(n<=10){ sum += n++*n++; } printf("Sum = %d\n",sum); return 0 }ans is 165 . i got 190.please explain??

1.0k views

commented Feb 3, 2016

1 answer

11

functions
1 int main() { int b; b = f(20,30); printf("%d",b); return 0; } int f(int a,int b){ int z; z= a + b; return z; } this program compile fine and o/p is 50 2 int main() { int b; b = f(20,'a'); printf("%d",b); return 0; } int f(int a,char b){ int z; z= a + b; return z; } this give compilation error. I don't know why??Please explain

1 int main() { int b; b = f(20,30); printf("%d",b); return 0;}int f(int a,int b){ int z; z= a + b; return z;}this program compile fine and o/p is 502 i...

583 views

commented Feb 3, 2016

2 answers

12

projection
The Project operation $(\prod)$ in relational algebra: (i) Is used for eliminating duplicate rows automatically from the output. (ii). Is used to filter columns. (iii). Is a unary operator. (iv). has degree of output relation same as input relation. (A). (i). and (iii) (B). (ii) and (v) (C). (i) and (ii) (D). (iv) only

The Project operation $(\prod)$ in relational algebra:(i) Is used for eliminating duplicate rows automatically from the output.(ii). Is used to filter columns.(iii). Is a...

1.8k views

commented Jan 27, 2016

2 answers

13

What will be the output of right shift?
Consider the C function func shown below: int func(int num) { int count = 0; while (num) { count++; num>>= 1; } return (count); } The value returned by func(0235) is ________

Consider the C function func shown below: int func(int num) { int count = 0; while (num) { count++; num>>= 1; } return (count); }The value returned by func(0235) is _____...

867 views

commented Jan 23, 2016

1 answer

14

MadeEasy Test Series: Programming & DS - Linked Lists
Here, what will be the Head->Next , I am confused is it first element 50 or second element 29.

Here, what will be the Head->Next , I am confused is it first element 50 or second element 29.

751 views

answered Jan 22, 2016

1 answer

15

linked list
What does the following function do for a given Linked List with first node as head? void fun1(struct node* head) { if(head == NULL) return; fun1(head->next); printf("%d ", head->data); } will it print 5-4-3-2-1 or 4-3-2-1 if i/p is 1-2-3-4-5?Will the last 5 get printed or not , due to return;

What does the following function do for a given Linked List with first node as head?void fun1(struct node* head){ if(head == NULL) return; fun1(head->next); prin...

5.4k views

asked Jan 21, 2016

3 answers

16

Let f(n) = Ω(n), and g(n) = O(f(n)). Then g(n) = _______ [Assume n > 0] 1. Ω(n) 2. O(n) 3. θ(n) 4. Ω(1)

1.5k views

commented Jan 20, 2016

4 answers

17

Minimal FA
What is the number of states in a minimal FA which accepts all strings over (0,1)* where every string starts with 100 and the length of the string is congruent to 1(mod4) I am getting 11 states. Ans given is 8. While doing the cross product , is it ensured that , I will get the minimal DFA ? or do I have to minimise after the cross product ?

What is the number of states in a minimal FA which accepts all strings over (0,1)* where every string starts with 100 and the length of the string is congruent to 1(mod4)...

747 views

asked Jan 17, 2016

0 answers

18

NFA intersection
How do I construct the intersection of two NFAs? Do I need to follow the same cross product method like the DFAs? If so, then how do I handle the epsilon transitions? Please support your answer with an example Thanks in advance!

How do I construct the intersection of two NFAs? Do I need to follow the same cross product method like the DFAs? If so, then how do I handle the epsilon transitions?Plea...

912 views

asked Jan 16, 2016

2 answers

19

synchronisation
The above synchronisation procedure satisfies 1. Mutual exclusion is guranteed 2.Progress is not guranteed 3.Bounded wait is not guranteed 4Deadlock may occur I am getting all of the above. Is it correct?

The above synchronisation procedure satisfies 1. Mutual exclusion is guranteed2.Progress is not guranteed3.Bounded wait is not guranteed4Deadlock may occur I am getting a...

702 views

commented Jan 15, 2016

1 answer

20

Synchronisation
Consider the methods used by processes P1 and P2 for accessing their critical sections whenever needed, as given below. The initial values of shared boolean variables S1 and S2 are randomly assigned. Method used by P1 Method used by P2 while (S1==S2); ... hence no way they are getting blocked out all at once from their critical section.So no deadlock. Also its starvation free .

Consider the methods used by processes P1 and P2 for accessing their critical sections whenever needed, as given below. The initial values of shared boolean variables S1 ...

560 views

closed Jan 15, 2016

1 answer

21

What do the SQL query return ?
Bank(bname, city) Travel(pname, city) SELECT T1.pname FROM Travel T1 WHERE NOT EXISTS (SELECT B.city From Bank B WHERE B.bname = ‘SBI’ EXCEPT SELECT T2.city FROM Travel T2 WHERE T1.pname = T2.pname) Solution I am ... city where SBI is located Answer given as Who have travelled in all city where SBI is located Please tell the correct ans and reason

Bank(bname, city)Travel(pname, city)SELECT T1.pnameFROM Travel T1WHERE NOT EXISTS (SELECT B.city From Bank B ...

493 views

commented Jan 13, 2016

2 answers

22

Minimum number of states in the DFA
What is the minimum number of states in the DFA for accepting the strings $(a+b)^{*}a(a+b)(a+b)$ I draw the following DFA The minimum number of states is 4. The answer given is 8. How is it possible? Please explain.

What is the minimum number of states in the DFA for accepting the strings $(a+b)^{*}a(a+b)(a+b)$I draw the following DFA The minimum number of states is 4. The answer giv...

16.2k views

answered Jan 13, 2016

1 answer

23

Ace Test Series: Algorithms - Time Complexity

823 views

answered Jan 13, 2016

2 answers

24

regarding pointers
What does this mean? int *(*func())[] According to me , it means that its an array of pointers to functions which returns pointers of type int. Am I correct?

What does this mean?int *(*func())[] According to me , it means that its an array of pointers to functions which returns pointers of type int. Am I correct?

665 views

asked Jan 11, 2016

2 answers

25

Division Operator

813 views

commented Jan 8, 2016

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