Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by Arjun
63
votes
2
answers
1621
GATE CSE 2017 Set 1 | Question: 16
The following functional dependencies hold true for the relational schema $R\left \{V,W,X,Y,Z \right \}$: V $\rightarrow$ W VW $\rightarrow$ X Y $\rightarrow$ VX Y $\rightarrow$ Z Which of the following is irreducible equivalent for this set of functional ... $\rightarrow$ Z V $\rightarrow$ W W $\rightarrow$ X Y $\rightarrow$ V Y $\rightarrow$ X Y $\rightarrow$ Z
The following functional dependencies hold true for the relational schema $R\left \{V,W,X,Y,Z \right \}$:V $\rightarrow$ WVW $\rightarrow$ XY $\rightarrow$ VXY $\rightarr...
13.3k
views
asked
Feb 14, 2017
Databases
gatecse-2017-set1
databases
database-normalization
normal
+
–
39
votes
3
answers
1622
GATE CSE 2017 Set 1 | Question: 15
A sender $S$ sends a message $m$ to receiver $R$, which is digitally signed by $S$ with its private key. In this scenario, one or more of the following security violations can take place. $S$ ... with a fraudulent message Which of the following are possible security violations? I and II only I only II only II and III only
A sender $S$ sends a message $m$ to receiver $R$, which is digitally signed by $S$ with its private key. In this scenario, one or more of the following security violation...
12.6k
views
asked
Feb 14, 2017
Computer Networks
gatecse-2017-set1
computer-networks
cryptography
normal
network-security
out-of-gate-syllabus
+
–
87
votes
7
answers
1623
GATE CSE 2017 Set 1 | Question: 13
Consider the following C code: #include<stdio.h> int *assignval (int *x, int val) { *x = val; return x; } void main () { int *x = malloc(sizeof(int)); if (NULL == x) return; x = assignval (x,0); ... and not as shown. compiles successfully but execution may result in dangling pointer. compiles successfully but execution may result in memory leak.
Consider the following C code:#include<stdio.h int *assignval (int *x, int val) { *x = val; return x; } void main () { int *x = malloc(sizeof(int)); if (NULL == x) return...
35.4k
views
asked
Feb 14, 2017
Programming in C
gatecse-2017-set1
programming-in-c
programming
pointers
+
–
36
votes
4
answers
1624
GATE CSE 2017 Set 1 | Question: 12
Consider the following intermediate program in three address code p = a - b q = p * c p = u * v q = p + q Which one of the following corresponds to a static single assignment form of the above code? p1 = a - b q1 = p1 * c p1 = u * v q1 = p1 + q1 p3 = a - b q4 = p3 * c p4 = ... = a - b q1 = p2 * c p3 = u * v q2 = p4 + q3 p1 = a - b q1 = p * c p2 = u * v q2 = p + q
Consider the following intermediate program in three address codep = a - b q = p * c p = u * v q = p + qWhich one of the following corresponds to a static single assignme...
11.6k
views
asked
Feb 14, 2017
Compiler Design
gatecse-2017-set1
compiler-design
intermediate-code
normal
static-single-assignment
+
–
49
votes
3
answers
1625
GATE CSE 2017 Set 1 | Question: 11
Consider the $C$ struct defined below: struct data { int marks [100]; char grade; int cnumber; }; struct data student; The base address of student is available in register $R1$. The field student.grade can be accessed efficiently using: Post-increment ... mode, $X(R1)$, where $X$ is an offset represented in $2's$ complement $16\text{-bit}$ representation
Consider the $C$ struct defined below:struct data { int marks [100]; char grade; int cnumber; }; struct data student;The base address of student is available in register...
14.5k
views
asked
Feb 14, 2017
CO and Architecture
gatecse-2017-set1
co-and-architecture
addressing-modes
+
–
75
votes
8
answers
1626
GATE CSE 2017 Set 1 | Question: 10
Consider the following context-free grammar over the alphabet $\Sigma = \{a,b,c\}$ with $S$ as the start symbol:$S \rightarrow abScT \mid abcT$$T \rightarrow bT \mid b$ ... $\{\left ( ab \right )^{n}\left ( cb^{n} \right )^{m} \mid m,n \geq 1 \}$
Consider the following context-free grammar over the alphabet $\Sigma = \{a,b,c\}$ with $S$ as the start symbol:$$S \rightarrow abScT \mid abcT$$$$T \rightarrow bT \mid ...
21.8k
views
asked
Feb 14, 2017
Theory of Computation
gatecse-2017-set1
theory-of-computation
context-free-language
normal
+
–
39
votes
6
answers
1627
GATE CSE 2017 Set 1 | Question: 9
When two $8\text{-bit}$ numbers $A_{7}\cdots A_{0}$ and $B_{7}\cdots B_{0}$ in $2$'s complement representation (with $A_{0}$ and $B_{0}$ as the least significant bits) are added using a ripple-carry adder, the sum bits obtained are $S_{7}\cdots S_{0}$ ... $1$
When two $8\text{-bit}$ numbers $A_{7}\cdots A_{0}$ and $B_{7}\cdots B_{0}$ in $2$'s complement representation (with $A_{0}$ and $B_{0}$ as the least significant bits) ar...
13.8k
views
asked
Feb 14, 2017
Digital Logic
gatecse-2017-set1
digital-logic
number-representation
+
–
65
votes
9
answers
1628
GATE CSE 2017 Set 1 | Question: 7
The n-bit fixed-point representation of an unsigned real number $X$ uses $f$ bits for the fraction part. Let $i = n-f$. The range of decimal values for $X$ in this representation is $2^{-f}$ to $2^{i}$ $2^{-f}$ to $\left ( 2^{i} - 2^{-f} \right )$ 0 to $2^{i}$ 0 to $\left ( 2^{i} - 2^{-f} \right )$
The n-bit fixed-point representation of an unsigned real number $X$ uses $f$ bits for the fraction part. Let $i = n-f$. The range of decimal values for $X$ in this repres...
16.7k
views
asked
Feb 14, 2017
Digital Logic
gatecse-2017-set1
digital-logic
number-representation
fixed-point-representation
+
–
33
votes
10
answers
1629
GATE CSE 2017 Set 1 | Question: 6
Let $T$ be a binary search tree with $15$ nodes. The minimum and maximum possible heights of $T$ are: Note: The height of a tree with a single node is $0$. $4$ and $15$ respectively. $3$ and $14$ respectively. $4$ and $14$ respectively. $3$ and $15$ respectively.
Let $T$ be a binary search tree with $15$ nodes. The minimum and maximum possible heights of $T$ are:Note: The height of a tree with a single node is $0$.$4$ and $15$ res...
16.8k
views
asked
Feb 14, 2017
DS
gatecse-2017-set1
data-structures
binary-search-tree
easy
+
–
67
votes
9
answers
1630
GATE CSE 2017 Set 1 | Question: 3
Let $c_{1}.....c_{n}$ be scalars, not all zero, such that $\sum_{i=1}^{n}c_{i}a_{i}$ = 0 where $a_{i}$ are column vectors in $R^{n}$. Consider the set of linear equations $Ax = b$ ... has a unique solution at $x=J_{n}$ where $J_{n}$ denotes a $n$-dimensional vector of all 1. no solution infinitely many solutions finitely many solutions
Let $c_{1}.....c_{n}$ be scalars, not all zero, such that $\sum_{i=1}^{n}c_{i}a_{i}$ = 0 where $a_{i}$ are column vectors in $R^{n}$.Consider the set of linear equations$...
20.4k
views
asked
Feb 14, 2017
Linear Algebra
gatecse-2017-set1
linear-algebra
system-of-equations
normal
+
–
7
votes
0
answers
1631
Updates on Last Ranks
After our GATE we had no idea where to apply etc. There was this GATE Forum site which had a predictor which showed some data. That was useful but the sad thing is that that's all we have even after 7 years because no one wants to ... and ranks http://gatecse.in/gate-cse-2016-result-responses/ Where they joined? http://gatecse.in/gate-cse-2016-admissions-responses/
After our GATE we had no idea where to apply etc. There was this GATE Forum site which had a predictor which showed some data. That was useful but the sad thing is that t...
4.6k
views
asked
Feb 11, 2017
IISc/IITs
admissions
admissions-gate2017
+
–
27
votes
2
answers
1632
GATE CSE 1999 | Question: 11b
Write a constant time algorithm to insert a node with data $D$ just before the node with address $p$ of a singly linked list.
Write a constant time algorithm to insert a node with data $D$ just before the node with address $p$ of a singly linked list.
3.2k
views
asked
Dec 17, 2016
DS
gate1999
data-structures
linked-list
descriptive
+
–
24
votes
2
answers
1633
GATE CSE 2006 | Question: 77
Statement for Linked Answer Questions 76 & 77: A $3$-ary max heap is like a binary max heap, but instead of $2$ children, nodes have $3$ children. A $3$-ary heap can be represented by an array as follows: The root is stored in the first location, $a[0]$, nodes in the next level, from left to ... $10, 9, 4, 5, 7, 6, 8, 2, 1, 3$ $10, 8, 6, 9, 7, 2, 3, 4, 1, 5$
Statement for Linked Answer Questions 76 & 77:A $3$-ary max heap is like a binary max heap, but instead of $2$ children, nodes have $3$ children. A $3$-ary heap can be re...
7.5k
views
asked
Nov 27, 2016
DS
gatecse-2006
data-structures
binary-heap
normal
+
–
30
votes
2
answers
1634
GATE CSE 2008 | Question: 83
Consider the following $\text{ER}$ diagram The minimum number of tables needed to represent $M$, $N$, $P$, $R1$, $R2$ is Which of the following is a correct attribute set for one of the tables for the minimum number of tables needed to represent $M$, $N$, $P$, $R1$, $R2$? ${M1, M2, M3, P1}$ ${M1, P1, N1, N2}$ ${M1, P1, N1}$ ${M1, P1}$
Consider the following $\text{ER}$ diagramThe minimum number of tables needed to represent $M$, $N$, $P$, $R1$, $R2$ is Which of the following is a correct attribute set ...
10.9k
views
asked
Nov 27, 2016
Databases
gatecse-2008
databases
er-diagram
normal
+
–
12
votes
1
answer
1635
Cleaning up the mess
This is the 3rd year of GATE Overflow. In the first year only few people were here. But results were awesome as 5+ people got to top 100 and majority were first time takers and from final year. Last year majority of toppers here were ... a "Mark as Wrong" option for Answers. We cannot hide/delete wrong answers as they might follow good discussion as comments.
This is the 3rd year of GATE Overflow. In the first year only few people were here. But results were awesome as 5+ people got to top 100 and majority were first time take...
2.4k
views
asked
Nov 15, 2016
Study Resources
bad-question
gateoverflow
+
–
1
votes
0
answers
1636
Off-Topic
Previous year exams till 2010 are available here to be tried. Currently exams from 2000-2009 are being added. So, question is should out-of-syllabus ones be included? what to be done in case they are removed?
Previous year exams till 2010 are available here to be tried. Currently exams from 2000-2009 are being added. So, question isshould out-of-syllabus ones be included?what ...
228
views
asked
Nov 5, 2016
5
votes
1
answer
1637
GATE Overflow | Programming | Test 1 | Question: 30
Consider the following incomplete C function for reversing a singly linked list. node* reverse(node* trav){ if(trav->next) __________________ else { head -> next = null; head = trav; } return trav; } Here, head is a global pointer pointing to ... = trav; trav->next -> next = trav; trav -> next = trav; trav = reverse(trav->next);
Consider the following incomplete C function for reversing a singly linked list.node* reverse(node* trav){ if(trav->next) __________________ else { head - next = null; he...
1.7k
views
asked
Oct 18, 2016
Programming in C
go-programming-1
programming
programming-in-c
linked-list
+
–
3
votes
2
answers
1638
GATE Overflow | Programming | Test 1 | Question: 29
What will be the output of the following code? #include <stdio.h> #include <string.h> int main() { struct mystruct{ char *name; unsigned int age; }; struct mystruct st1 = {"Ram", 12}; printf("%lu %u", strlen(st1.name), st1.age); } 4 12 3 12 compile error run time error
What will be the output of the following code?#include <stdio.h #include <string.h int main() { struct mystruct{ char *name; unsigned int age; }; struct mystruct st1 = {"...
1.1k
views
asked
Oct 18, 2016
Programming in C
go-programming-1
programming
programming-in-c
+
–
8
votes
2
answers
1639
GATE Overflow | Programming | Test 1 | Question: 28
int foo(int n) { if(n > 10000) return 1; int sum = 0, i; for( i = 0; i < n; i++) { sum += i; } return sum; } The value returned by the above function is $\Theta\left(n^2\right)$ $\Theta\left(n\right)$ $\Theta\left(1\right)$ $\Omega\left(n^2\right)$
int foo(int n) { if(n 10000) return 1; int sum = 0, i; for( i = 0; i < n; i++) { sum += i; } return sum; }The value returned by the above function is$\Theta\left(n^2\rig...
1.3k
views
asked
Oct 18, 2016
Programming in C
go-programming-1
programming
asymptotic-notation
programming-in-c
+
–
1
votes
3
answers
1640
GATE Overflow | Programming | Test 1 | Question: 27
Which of the following statements is true regarding C language? S1: C is a functional language S2: C is a declarative language S3: C is a procedural language S4: C is a structured language S1, S2 and S3 only S2 and S4 only S2, S3 and S4 only S1, S3 and S4 only
Which of the following statements is true regarding C language?S1: C is a functional languageS2: C is a declarative languageS3: C is a procedural languageS4: C is a struc...
3.3k
views
asked
Oct 18, 2016
Programming in C
go-programming-1
programming
programming-in-c
+
–
Page:
« prev
1
...
77
78
79
80
81
82
83
84
85
86
87
...
96
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register