Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Recent
Hot!
Most votes
Most answers
Most views
Previous GATE
Featured
Most viewed questions
100
votes
9
answers
81
GATE CSE 2014 Set 2 | Question: 34
For a C program accessing $\mathbf{X[i] [j] [k]}$, the following intermediate code is generated by a compiler. Assume that the size of an integer is $32$ bits and the size of a character is $8$ bits. t0 = i ∗ 1024 t1 = j ∗ 32 t2 = k ∗ 4 t3 = t1 + t0 t4 ... as "char $\mathbf{X[4] [32] [8]}$ . $\mathbf{X}$ is declared as "char $\mathbf{X[32] [16] [2]}$ .
For a C program accessing $\mathbf{X[i] [j] [k]}$, the following intermediate code is generated by a compiler. Assume that the size of an integer is $32$ bits and the siz...
go_editor
36.2k
views
go_editor
asked
Sep 28, 2014
Compiler Design
gatecse-2014-set2
compiler-design
intermediate-code
programming-in-c
normal
+
–
43
votes
6
answers
82
GATE CSE 1995 | Question: 1.17
A binary tree $T$ has $n$ leaf nodes. The number of nodes of degree $2$ in $T$ is $\log_2 n$ $n-1$ $n$ $2^n$
A binary tree $T$ has $n$ leaf nodes. The number of nodes of degree $2$ in $T$ is$\log_2 n$$n-1$$n$$2^n$
Kathleen
36.1k
views
Kathleen
asked
Oct 8, 2014
DS
gate1995
data-structures
binary-tree
normal
+
–
60
votes
13
answers
83
GATE CSE 2007 | Question: 67, ISRO2016-72
The address of a class $\text{B}$ host is to be split into subnets with a $6\;\text{-bit}$ subnet number. What is the maximum number of subnets and the maximum number of hosts in each subnet? $62$ subnets and $262142$ hosts. $64$ subnets and $262142$ hosts. $62$ subnets and $1022$ hosts. $64$ subnets and $1024$ hosts.
The address of a class $\text{B}$ host is to be split into subnets with a $6\;\text{-bit}$ subnet number. What is the maximum number of subnets and the maximum number of ...
Kathleen
35.8k
views
Kathleen
asked
Sep 21, 2014
Computer Networks
gatecse-2007
computer-networks
subnetting
easy
isro2016
+
–
31
votes
6
answers
84
GATE CSE 2008 | Question: 19
The Breadth First Search algorithm has been implemented using the queue data structure. One possible order of visiting the nodes of the following graph is: $\text{MNOPQR}$ $\text{NQMPOR}$ $\text{QMNPRO}$ $\text{QMNPOR}$
The Breadth First Search algorithm has been implemented using the queue data structure. One possible order of visiting the nodes of the following graph is:$\text{MNOPQR}$...
Kathleen
35.8k
views
Kathleen
asked
Sep 11, 2014
Algorithms
gatecse-2008
normal
algorithms
graph-algorithms
graph-search
+
–
75
votes
8
answers
85
GATE CSE 2007 | Question: 53
Consider the following two statements: P: Every regular grammar is LL(1) Q: Every regular set has a LR(1) grammar Which of the following is TRUE? Both P and Q are true P is true and Q is false P is false and Q is true Both P and Q are false
Consider the following two statements:P: Every regular grammar is LL(1)Q: Every regular set has a LR(1) grammarWhich of the following is TRUE?Both P and Q are trueP is tr...
Kathleen
35.7k
views
Kathleen
asked
Sep 21, 2014
Compiler Design
gatecse-2007
compiler-design
grammar
normal
+
–
48
votes
6
answers
86
GATE CSE 2004 | Question: 3
A single array $A[1 \ldots \text{MAXSIZE}]$ is used to implement two stacks. The two stacks grow from opposite ends of the array. Variables $top1$ and $top2$ $(top1 < top 2)$ point to the location of the topmost element in each of the stacks. If the space is to ... $(top1 = \text{MAXSIZE} / 2)$ or $(top2 = \text{MAXSIZE})$ $top1 = top2 - 1$
A single array $A[1 \ldots \text{MAXSIZE}]$ is used to implement two stacks. The two stacks grow from opposite ends of the array. Variables $top1$ and $top2$ $(top1 < top...
Kathleen
35.6k
views
Kathleen
asked
Sep 18, 2014
DS
gatecse-2004
data-structures
stack
easy
+
–
101
votes
3
answers
87
GATE IT 2008 | Question: 61
Let $R (A, B, C, D)$ be a relational schema with the following functional dependencies : $A → B$, $B → C$, $C → D$ and $D → B$. The decomposition of $R$ into $(A, B), (B, C), (B, D)$ gives a ... a lossless join, but is not dependency preserving does not give a lossless join, but is dependency preserving does not give a lossless join and is not dependency preserving
Let $R (A, B, C, D)$ be a relational schema with the following functional dependencies :$A → B$, $B → C$, $C → D$ and $D → B$. The decomposition of $R$ into $(A, ...
Ishrat Jahan
35.6k
views
Ishrat Jahan
asked
Oct 28, 2014
Databases
gateit-2008
databases
database-normalization
normal
+
–
85
votes
18
answers
88
GATE CSE 2016 Set 1 | Question: 39
Let $G$ be a complete undirected graph on $4$ vertices, having $6$ edges with weights being $1, 2, 3, 4, 5,$ and $6$. The maximum possible weight that a minimum weight spanning tree of $G$ can have is __________
Let $G$ be a complete undirected graph on $4$ vertices, having $6$ edges with weights being $1, 2, 3, 4, 5,$ and $6$. The maximum possible weight that a minimum weight s...
Sandeep Singh
35.5k
views
Sandeep Singh
asked
Feb 12, 2016
Algorithms
gatecse-2016-set1
algorithms
spanning-tree
normal
numerical-answers
+
–
87
votes
7
answers
89
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...
Arjun
35.4k
views
Arjun
asked
Feb 14, 2017
Programming in C
gatecse-2017-set1
programming-in-c
programming
pointers
+
–
5
votes
2
answers
90
Morris Mano Edition 3 Exercise 2 Question 12 (Page No. 70)
Express the following function in the sum of minterms and The product of the maxterms. (a) F(A,B,C,D) = B’D + A’D + BD (b)F(x,y,z)=(xy + z)(xz + y)
Express the following function in the sum of minterms and The product of the maxterms.(a) F(A,B,C,D) = B’D + A’D + BD(b)F(x,y,z)=(xy + z)(xz + y)
ajaysoni1924
35.3k
views
ajaysoni1924
asked
Mar 31, 2019
Digital Logic
digital-logic
morris-mano
boolean-algebra
simplification
+
–
47
votes
8
answers
91
GATE CSE 2019 | Question: 37
There are $n$ unsorted arrays: $A_1, A_2, \dots, A_n$. Assume that $n$ is odd.Each of $A_1, A_2, \dots, A_n$ contains $n$ distinct elements. There are no common elements between any two arrays. The worst-case time complexity of computing the median of the medians of $A_1, A_2, \dots , A_n$ is $O(n)$ $O(n \: \log \: n)$ $O(n^2)$ $\Omega (n^2 \log n)$
There are $n$ unsorted arrays: $A_1, A_2, \dots, A_n$. Assume that $n$ is odd.Each of $A_1, A_2, \dots, A_n$ contains $n$ distinct elements. There are no common elements ...
Arjun
35.3k
views
Arjun
asked
Feb 7, 2019
Algorithms
gatecse-2019
algorithms
time-complexity
2-marks
+
–
83
votes
13
answers
92
GATE CSE 2013 | Question: 9
What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon and unit-production (i.e., of type $A \rightarrow \epsilon$ and $A \rightarrow a$) to parse a string with $n$ tokens? $n/2$ $n-1$ $2n-1$ $2^{n}$
What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon and unit-production (i.e., of type $A \rightarrow \epsilo...
Arjun
35.3k
views
Arjun
asked
Sep 23, 2014
Compiler Design
gatecse-2013
compiler-design
parsing
normal
+
–
67
votes
4
answers
93
GATE CSE 2014 Set 3 | Question: 34
Consider the basic block given below. a = b + c c = a + d d = b + c e = d - b a = e + b The minimum number of nodes and edges present in the DAG representation of the above basic block respectively are $6$ and $6$ $8$ and $10$ $9$ and $12$ $4$ and $4$
Consider the basic block given below. a = b + c c = a + d d = b + c e = d - b a = e + b The minimum number of nodes and edges present in the DAG representation of the abo...
go_editor
35.3k
views
go_editor
asked
Sep 28, 2014
Compiler Design
gatecse-2014-set3
compiler-design
code-optimization
directed-acyclic-graph
normal
+
–
3
votes
2
answers
94
Morris Mano Numerical
How many 128 × 8 RAM chips are needed to provide a memory capacity of 2048 bytes? How many lines of the address bus must be used to access 2048 byte of memory? How many of these lines will be common to all chips? How many lines must be decoded for chip select? Specify the size of the decoders?
How many 128 × 8 RAM chips are needed to provide a memory capacity of 2048 bytes?How many lines of the address bus must be used to access 2048 byte of memory? How many o...
LavTheRawkstar
35.1k
views
LavTheRawkstar
asked
Nov 3, 2016
CO and Architecture
co-and-architecture
digital-logic
memory-interfacing
+
–
113
votes
9
answers
95
GATE CSE 2012 | Question: 38
Let $G$ be a complete undirected graph on $6$ vertices. If vertices of $G$ are labeled, then the number of distinct cycles of length $4$ in $G$ is equal to $15$ $30$ $90$ $360$
Let $G$ be a complete undirected graph on $6$ vertices. If vertices of $G$ are labeled, then the number of distinct cycles of length $4$ in $G$ is equal to$15$$30$$90$$36...
gatecse
35.0k
views
gatecse
asked
Sep 12, 2014
Graph Theory
gatecse-2012
graph-theory
normal
marks-to-all
counting
+
–
5
votes
1
answer
96
Carl Hamacher
Registers R1 and R2 of a computer contain the decimal values 1200 and 4600.What is the Effective address of the memory operand in each of the following instructions? a) Load 20(R1),R5 b) Move #3000,R5 c) Store R5,30(R1,R2) d) Add -(R2),R5 e) Subtract (R1)+,R5
Registers R1 and R2 of a computer contain the decimal values 1200 and 4600.What is the Effectiveaddress of the memory operand in each of the following instructions?a) Loa...
reena_kandari
35.0k
views
reena_kandari
asked
Jun 4, 2017
CO and Architecture
co-and-architecture
carl-hamacher
+
–
143
votes
12
answers
97
GATE CSE 2016 Set 1 | Question: 41
Let $Q$ denote a queue containing sixteen numbers and $S$ be an empty stack. $Head(Q)$ returns the element at the head of the queue $Q$ without removing it from $Q$. Similarly $Top(S)$ returns the element at the top of $S$ without removing ... = Pop(S); Enqueue (Q, x); end end The maximum possible number of iterations of the while loop in the algorithm is _______.
Let $Q$ denote a queue containing sixteen numbers and $S$ be an empty stack. $Head(Q)$ returns the element at the head of the queue $Q$ without removing it from $Q$. Simi...
Sandeep Singh
34.9k
views
Sandeep Singh
asked
Feb 12, 2016
DS
gatecse-2016-set1
data-structures
queue
difficult
numerical-answers
+
–
7
votes
2
answers
98
Regular expression for the language L = { w ∈ {0, 1}* | w has no pair of consecutive zeros} is
A. (1 + 010)* B. (01 + 10)* C. (1 + 010)* (0 + λ) D. (1 + 01)* (0 + λ)
A. (1 + 010)*B. (01 + 10)*C. (1 + 010)* (0 + λ)D. (1 + 01)* (0 + λ)
im.raj
34.9k
views
im.raj
asked
Jun 16, 2016
Theory of Computation
theory-of-computation
+
–
4
votes
2
answers
99
Solve this equation T(n) = 7T(n/2) + n^2
Deep99
34.9k
views
Deep99
asked
Jun 18, 2016
Algorithms
recurrence-relation
algorithms
+
–
78
votes
12
answers
100
GATE CSE 1994 | Question: 1.6, ISRO2008-29
The number of distinct simple graphs with up to three nodes is $15$ $10$ $7$ $9$
The number of distinct simple graphs with up to three nodes is$15$$10$$7$$9$
Kathleen
34.9k
views
Kathleen
asked
Oct 4, 2014
Graph Theory
gate1994
graph-theory
graph-connectivity
combinatory
normal
isro2008
counting
+
–
Page:
« prev
1
2
3
4
5
6
7
8
9
10
...
3226
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register