The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent questions tagged gate2007
GATE Computer Science 2007 questions and solutions
+55
votes
6
answers
1
GATE200760
Consider the relation employee(name, sex, supervisorName) with name as the key, supervisorName gives the name of the supervisor of the employee under consideration. What does the following Tuple Relational Calculus query produce? ... no immediate male subordinates. Names of employees with no immediate female subordinates. Names of employees with a female supervisor.
asked
Sep 22, 2014
in
Databases
by
Kathleen
Veteran
(
52.2k
points)

7.5k
views
gate2007
databases
relationalcalculus
normal
+32
votes
7
answers
2
GATE200758
Two processes, $P1$ and $P2$, need to access a critical section of code. Consider the following synchronization construct used by the processes: /* P1 */ while (true) { wants1 = true; while (wants2 == true); /* Critical Section */ ... bounded waiting. It requires that processes enter the critical section in strict alteration. It does not prevent deadlocks, but ensures mutual exclusion.
asked
Sep 22, 2014
in
Operating System
by
Kathleen
Veteran
(
52.2k
points)

5.9k
views
gate2007
operatingsystem
processsynchronization
normal
+13
votes
1
answer
3
GATE200757
A single processor system has three resource types $X, Y$ and $Z$, which are shared by three processes. There are $5$ units of each resource type. Consider the following scenario, where the column alloc denotes the number of units of each resource type allocated to each process, and ... $P0$ $P1$ $P2$ None of the above, since the system is in a deadlock
asked
Sep 22, 2014
in
Operating System
by
Kathleen
Veteran
(
52.2k
points)

2.4k
views
gate2007
operatingsystem
resourceallocation
normal
+24
votes
3
answers
4
GATE200756
A virtual memory system uses First In First Out (FIFO) page replacement policy and allocates a fixed number of frames to a process. Consider the following statements: P: Increasing the number of page frames allocated to a process sometimes increases the page fault rate. Q: Some programs do ... Q are true, but Q is not the reason for P. P is false but Q is true Both P and Q are false.
asked
Sep 22, 2014
in
Operating System
by
Kathleen
Veteran
(
52.2k
points)

4.5k
views
gate2007
operatingsystem
pagereplacement
normal
+16
votes
3
answers
5
GATE200755
An operating system used Shortest Remaining System Time first (SRT) process scheduling algorithm. Consider the arrival times and execution times for the following processes: ... $P2$ ? $5$ $15$ $40$ $55$
asked
Sep 22, 2014
in
Operating System
by
Kathleen
Veteran
(
52.2k
points)

1.9k
views
gate2007
operatingsystem
processschedule
normal
+29
votes
4
answers
6
GATE200754
In a simplified computer the instructions are: $\begin{array}{ll} \hline \text {OP $R _j , R _i$} & \text{Perform $R _j $OP $R _i$ and store the result in register $R _j$ } \\\hline \text{OP $m,R _i$} & \text{Perform $val$ OP $ ... of the computation should be in memory. What is the minimum number of MOV instructions in the code generated for this basic block? $2$ $3$ $5$ $6$
asked
Sep 22, 2014
in
CO and Architecture
by
Kathleen
Veteran
(
52.2k
points)

4k
views
gate2007
coandarchitecture
machineinstructions
normal
+42
votes
9
answers
7
GATE200753
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
asked
Sep 22, 2014
in
Compiler Design
by
Kathleen
Veteran
(
52.2k
points)

8.9k
views
gate2007
compilerdesign
grammar
normal
+19
votes
4
answers
8
GATE200752
Consider the grammar with nonterminals $N=\left\{S,C,S_1\right\}$, terminals $T=\left\{a, b, i, t, e\right\}$, with $S$ as the start symbol, and the following set of rules: $S \rightarrow iCtSS_1 \mid a$ $S_1 \rightarrow eS \mid \epsilon$ $C \rightarrow b$ The grammar is NOT LL(1) because: it is left recursive it is right recursive it is ambiguous it is not contextfree
asked
Sep 22, 2014
in
Compiler Design
by
Kathleen
Veteran
(
52.2k
points)

2.8k
views
gate2007
compilerdesign
grammar
normal
+22
votes
3
answers
9
GATE200751
Consider the following C program segment: int IsPrime (n) { int i, n; for (i=2; i<=sqrt(n);i++) if(n%i == 0) {printf("Not Prime \n"); return 0;} return 1; } Let $T(n)$ denote number of times the $for$ loop is executed by the program on input $n$. Which of the following ... $T(n) = O(n) \: \text{ and } T(n) = \Omega(\sqrt{n})$ None of the above
asked
Sep 22, 2014
in
Algorithms
by
Kathleen
Veteran
(
52.2k
points)

3.7k
views
gate2007
algorithms
timecomplexity
normal
+34
votes
8
answers
10
GATE200750
An array of $n$ numbers is given, where $n$ is an even number. The maximum as well as the minimum of these $n$ numbers needs to be determined. Which of the following is TRUE about the number of comparisons needed? At least $2nc$ comparisons, for some constant $c$ are needed. At most $1.5n2$ comparisons are needed. At least $n\log_2 n$ comparisons are needed None of the above
asked
Sep 22, 2014
in
Algorithms
by
Kathleen
Veteran
(
52.2k
points)

6.1k
views
gate2007
algorithms
timecomplexity
easy
+17
votes
3
answers
11
GATE200749
Let $w$ be the minimum weight among all edge weights in an undirected connected graph. Let $e$ be a specific edge of weight $w$. Which of the following is FALSE? There is a minimum spanning tree containing $e$ If $e$ is not in a minimum spanning tree ... , all edges have the same weight. Every minimum spanning tree has an edge of weight $w$ $e$ is present in every minimum spanning tree
asked
Sep 22, 2014
in
Algorithms
by
Kathleen
Veteran
(
52.2k
points)

2.5k
views
gate2007
algorithms
spanningtree
normal
+29
votes
4
answers
12
GATE200748
Which of the following is TRUE about formulae in Conjunctive Normal Form? For any formula, there is a truth assignment for which at least half the clauses evaluate to true. For any formula, there is a truth assignment for which all the clauses evaluate to true. There is a formula such that for each truth assignment, at most onefourth of the clauses evaluate to true. None of the above.
asked
Sep 22, 2014
in
Digital Logic
by
Kathleen
Veteran
(
52.2k
points)

4.5k
views
gate2007
digitallogic
normal
conjunctivenormalform
+37
votes
3
answers
13
GATE200747
Consider the process of inserting an element into a $Max \: Heap$, where the $Max \: Heap$ is represented by an $array$. Suppose we perform a binary search on the path from the new leaf to the root to find the position for the newly inserted element, the number of $comparisons$ performed is: $\Theta(\log_2n)$ $\Theta(\log_2\log_2n)$ $\Theta(n)$ $\Theta(n\log_2n)$
asked
Sep 22, 2014
in
DS
by
Kathleen
Veteran
(
52.2k
points)

4.8k
views
gate2007
datastructure
heap
normal
+18
votes
3
answers
14
GATE200746
Consider the following C program segment where $CellNode$ represents a node in a binary tree: struct CellNode { struct CellNode *leftChild; int element; struct CellNode *rightChild; }; int Getvalue (struct CellNode *ptr) { int value = 0; if (ptr != NULL) { if (( ... of nodes in the tree the number of internal nodes in the tree the number of leaf nodes in the tree the height of the tree
asked
Sep 22, 2014
in
DS
by
Kathleen
Veteran
(
52.2k
points)

2k
views
gate2007
datastructure
binarytree
normal
+26
votes
7
answers
15
GATE200745
What is the $\text{time complexity}$ of the following recursive function? int DoSomething (int n) { if (n <= 2) return 1; else return (DoSomething (floor (sqrt(n))) + n); } $\Theta(n^2)$ $\Theta(n \log_2n)$ $\Theta(\log_2n)$ $\Theta(\log_2\log_2n)$
asked
Sep 22, 2014
in
Algorithms
by
Kathleen
Veteran
(
52.2k
points)

7.4k
views
gate2007
algorithms
timecomplexity
normal
+37
votes
6
answers
16
GATE200744
In the following C function, let $n \geq m$. int gcd(n,m) { if (n%m == 0) return m; n = n%m; return gcd(m,n); } How many recursive calls are made by this function? $\Theta(\log_2n)$ $\Omega(n)$ $\Theta(\log_2\log_2n)$ $\Theta(\sqrt{n})$
asked
Sep 22, 2014
in
Algorithms
by
Kathleen
Veteran
(
52.2k
points)

6.4k
views
gate2007
algorithms
timecomplexity
normal
+19
votes
5
answers
17
GATE200743
A complete $nary$ tree is a tree in which each node has $n$ children or no children. Let $I$ be the number of internal nodes and $L$ be the number of leaves in a complete $nary$ tree. If $L = 41$ and $I = 10$, what is the value of $n$? $3$ $4$ $5$ $6$
asked
Sep 22, 2014
in
DS
by
Kathleen
Veteran
(
52.2k
points)

4.6k
views
gate2007
datastructure
trees
normal
+18
votes
1
answer
18
GATE200742
Consider the following C function: int f(int n) { static int r = 0; if (n <= 0) return 1; if (n > 3) { r = n; return f(n2) + 2; } return f(n1) + r; } What is the value of $f(5)$? $5$ $7$ $9$ $18$
asked
Sep 22, 2014
in
Programming
by
Kathleen
Veteran
(
52.2k
points)

2.1k
views
gate2007
programming
recursion
normal
+23
votes
3
answers
19
GATE200741
In an unweighted, undirected connected graph, the shortest path from a node $S$ to every other node is computed most efficiently, in terms of time complexity, by Dijkstra’s algorithm starting from $S$. Warshall’s algorithm. Performing a DFS starting from $S$. Performing a BFS starting from $S$.
asked
Sep 22, 2014
in
Algorithms
by
Kathleen
Veteran
(
52.2k
points)

4.5k
views
gate2007
algorithms
graphalgorithms
easy
+15
votes
3
answers
20
GATE200740
Consider a hash table of size seven, with starting index zero, and a hash function $(3x + 4)\mod 7$. Assuming the hash table is initially empty, which of the following is the contents of the table when the sequence $1, 3, 8, 10$ is inserted into the table using closed hashing? Note that − denotes an empty location ... $3$ $1$, −, −, −, −, −, $3$ $1, 10, 8$, −, −, −,$ 3$
asked
Sep 22, 2014
in
DS
by
Kathleen
Veteran
(
52.2k
points)

2.2k
views
gate2007
datastructure
hashing
easy
+15
votes
2
answers
21
GATE200739, UGCNETJune2015II22
The inorder and preorder traversal of a binary tree are $\text{d b e a f c g}$ and $\text{a b d e c f g}$, respectively The postorder traversal of the binary tree is: $\text{d e b f g c a}$ $\text{e d b g f c a}$ $\text{e d b f g c a}$ $\text{d e f g b c a}$
asked
Sep 22, 2014
in
DS
by
Kathleen
Veteran
(
52.2k
points)

1.6k
views
gate2007
datastructure
binarytree
normal
ugcnetjune2015ii
+21
votes
3
answers
22
GATE200738, ISRO201627
The following postfix expression with single digit operands is evaluated using a stack: $8 \ 2 \ 3 \ {}^\hat{\mkern6mu} / \ 2 \ 3 * + 5 \ 1 * $ Note that $^\hat{}$ is the exponentiation operator. The top two elements of the stack after the first $*$ is evaluated are $6, 1$ $5, 7$ $3, 2$ $1, 5$
asked
Sep 22, 2014
in
DS
by
Kathleen
Veteran
(
52.2k
points)

4.3k
views
gate2007
datastructure
stack
normal
isro2016
+19
votes
2
answers
23
GATE200737, ISRO200937
Consider a pipelined processor with the following four stages: IF: Instruction Fetch ID: Instruction Decode and Operand Fetch EX: Execute WB: Write Back The IF, ID and WB stages take one clock cycle each to complete the operation. The number of clock cycles for the EX stage depends on ... $ R5$$R4} \\ \end{array}$ $7$ $8$ $10$ $14$
asked
Sep 22, 2014
in
CO and Architecture
by
Kathleen
Veteran
(
52.2k
points)

5.1k
views
gate2007
coandarchitecture
pipelining
normal
isro2009
+42
votes
6
answers
24
GATE200736
The control signal functions of a $4$$bit$ binary counter are given below (where $X$ ... cycles through the following sequence: $0, 3, 4$ $0, 3, 4, 5$ $0, 1, 2, 3, 4$ $0, 1, 2, 3, 4, 5$
asked
Sep 22, 2014
in
Digital Logic
by
Kathleen
Veteran
(
52.2k
points)

6.8k
views
gate2007
digitallogic
circuitoutput
normal
+35
votes
3
answers
25
GATE200735
In a lookahead carry generator, the carry generate function $G_i$ and the carry propagate function $P_i$ for inputs $A_i$ and $B_i$ are given by: $P_i = A_i \oplus B_i \text{ and }G_i = A_iB_i$ The expressions for the sum bit $S_i$ and the carry bit $C_{i+1}$ of the look ... bit adder with $S_3, S_2, S_1, S_0$ and $C_4$ as its outputs are respectively: $6, 3$ $10, 4$ $6, 4$ $10, 5$
asked
Sep 22, 2014
in
Digital Logic
by
Kathleen
Veteran
(
52.2k
points)

3.6k
views
gate2007
digitallogic
normal
carrygenerator
adder
+38
votes
6
answers
26
GATE200734
Suppose only one multiplexer and one inverter are allowed to be used to implement any Boolean function of $n$ variables. What is the minimum size of the multiplexer needed? $2^n$ line to $1$ line $2^{n+1}$ line to $1$line $2^{n1}$ line to $1$line $2^{n2}$ line to $1$line
asked
Sep 22, 2014
in
Digital Logic
by
Kathleen
Veteran
(
52.2k
points)

6.9k
views
gate2007
digitallogic
normal
multiplexer
+25
votes
3
answers
27
GATE200733
Define the connective $*$ for the Boolean variables $X$ and $Y$ as: $X * Y = XY + X'Y'.$ Let $Z = X * Y$. Consider the following expressions $P$, $Q$ and $R$. $P : X = Y * Z, \\ Q :Y = X * Z, \\ R : X *Y * Z = 1$ Which of the following is TRUE? Only $P$ and $Q$ are valid. Only $Q$ and $R$ are valid. Only $P$ and $R$ are valid. All $P$, $Q$, $R$ are valid.
asked
Sep 22, 2014
in
Digital Logic
by
Kathleen
Veteran
(
52.2k
points)

2.6k
views
gate2007
digitallogic
normal
booleanalgebra
+21
votes
4
answers
28
GATE200732
Let $f(w, x, y, z) = \sum {\left(0,4,5,7,8,9,13,15\right)}$. Which of the following expressions are NOT equivalent to $f$? P: $x'y'z' + w'xy' + wy'z + xz$ Q: $w'y'z' + wx'y' + xz$ R: $w'y'z' + wx'y' + xyz+xy'z$ S: $x'y'z' + wx'y'+ w'y$ P only Q and S R and S S only
asked
Sep 22, 2014
in
Digital Logic
by
Kathleen
Veteran
(
52.2k
points)

2.5k
views
gate2007
digitallogic
normal
booleanalgebra
+20
votes
2
answers
29
GATE200731
Which of the following languages is regular? $\left\{ww^R \mid w \in \{0, 1\}^+\right\}$ $\left\{ww^Rx \mid x,w \in \{0, 1\}^+\right\}$ $\left\{wxw^R \mid x, w \in \{0, 1\}^+\right\}$ $\left\{xww^R \mid x, w \in \{0, 1\}^+\right\}$
asked
Sep 22, 2014
in
Theory of Computation
by
Kathleen
Veteran
(
52.2k
points)

3.5k
views
gate2007
theoryofcomputation
normal
regularlanguages
+16
votes
4
answers
30
GATE200730
The language $L=\left\{0^i21^i \mid i \geq 0\right\}$ over the alphabet $\left\{0, 1, 2\right\}$ is: not recursive is recursive and is a deterministic CFL is a regular language is not a deterministic CFL but a CFL
asked
Sep 22, 2014
in
Theory of Computation
by
Kathleen
Veteran
(
52.2k
points)

1.8k
views
gate2007
theoryofcomputation
normal
identifyclasslanguage
Page:
« prev
1
2
3
next »
Quick search syntax
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
Recent Posts
Linear Algebra Important Points
GATE 2020
OFFICIAL GATE MOCK TEST RELEASED
IIITH: Winter Research Admissions 2019 (For Spring 2020)
TIFR and JEST exam
Follow @csegate
Recent questions tagged gate2007
Recent Blog Comments
Great work sir
Yes Sir, It will be very helpful if we get...
@arjun sir is there a pdf...
Really helpful sir Thanks a ton👍👍
Amazing work Sir
50,645
questions
56,542
answers
195,693
comments
101,534
users