The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
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
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Recent questions tagged gate2003
+2
votes
1
answer
1
Doubt Algorithms Gate 2003
2^2n =O(2^n) True or False Its false but why
asked
Nov 26, 2017
in
Algorithms
by
aka 53
(
281
points)

147
views
gate2003
algorithms
asymptoticnotations
+3
votes
0
answers
2
Modified GATE 2003 question
Consider this GATE 2003 question: https://gateoverflow.in/937/gate200346 Here, instead of XOR gates we had OR gates, then which of the following operations can we perform? $A + B, A  B\ and\ A + 1$
asked
Nov 3, 2017
in
CO & Architecture
by
Rishabh Gupta 2
Boss
(
16.3k
points)

180
views
gate2003
adder
+4
votes
0
answers
3
#Gate2003
Consider the following logic program P A(x) < B(x, y), C(y) < B(x,x) Which of the following first order sentences is equivalent to P? Can anyone explain how it can be solved ?
asked
Jun 29, 2017
in
Mathematical Logic
by
Syedarshadali
(
347
points)

375
views
discretemathematics
firstorderlogic
gate2003
+38
votes
3
answers
4
GATE200379
A processor uses $\text{2level}$ page tables for virtual to physical address translation. Page tables for both levels are stored in the main memory. Virtual and physical addresses are both $32$ bits wide. The memory is byte addressable. For virtual to physical address translation, the $10$ ... the page tables of this process is $\text{8 KB}$ $\text{12 KB}$ $\text{16 KB}$ $\text{20 KB}$
asked
Apr 24, 2016
in
Operating System
by
jothee
Veteran
(
115k
points)

6.2k
views
gate2003
operatingsystem
normal
virtualmemory
+17
votes
2
answers
5
GATE200349
Consider the following assembly language program for a hypothetical processor A, B, and C are 8 bit registers. The meanings of various instructions are shown as comments. MOV B, #0 ; $B \leftarrow 0$ MOV C, #8 ; $C \leftarrow 8$ Z: CMP C, #0 ; compare C with 0 JZ ... same as its initial value? RRC A, #1 NOP ; no operation LRC A, #1; left rotate A through carry flag by one bit ADD A, #1
asked
Apr 24, 2016
in
CO & Architecture
by
jothee
Veteran
(
115k
points)

2.3k
views
gate2003
coandarchitecture
machineinstructions
normal
+33
votes
4
answers
6
GATE200362
In a permutation \(a_1 ... a_n\), of $n$ distinct integers, an inversion is a pair \((a_i, a_j)\) such that \(i < j\) and \(a_i > a_j\). What would be the worst case time complexity of the Insertion Sort algorithm, if the inputs are restricted to permutations of \(1. . . n\) with at most $n$ inversions? \(\Theta(n^2)\) \(\Theta(n\log n)\) \(\Theta(n^{1.5})\) \(\Theta(n)\)
asked
Apr 24, 2016
in
Algorithms
by
jothee
Veteran
(
115k
points)

3.9k
views
gate2003
algorithms
sorting
normal
+21
votes
4
answers
7
GATE200374
The following program fragment is written in a programming language that allows global variables and does not allow nested declarations of functions. global int i=100, j=5; void P(x) { int i=10; print(x+10); i=200; j=20; print (x); } main() {P(i+j);} If ... and call by name parameter passing mechanism, the values printed by the above program are $115, 220$ $25, 220$ $25, 15$ $115, 105$
asked
Apr 24, 2016
in
Compiler Design
by
jothee
Veteran
(
115k
points)

2k
views
gate2003
programming
compilerdesign
parameterpassing
runtimeenvironments
normal
+30
votes
5
answers
8
GATE200381
Suppose we want to synchronize two concurrent processes $P$ and $Q$ using binary semaphores $S$ and $T$. The code for the processes $P$ and $Q$ is shown below. Process P: Process Q: while(1) { while(1) { W: Y: print '0'; print '1'; print '0'; print '1'; X: Z: } } Synchronization statements ... $1$ $V(S)$ at $W, V(T)$ at $X, P(S)$ at $Y, P(T)$ at $Z, S$ and $T$ initially $1$
asked
Apr 24, 2016
in
Operating System
by
jothee
Veteran
(
115k
points)

2.9k
views
gate2003
operatingsystem
processsynchronization
normal
+22
votes
5
answers
9
GATE200347
Consider the following circuit composed of XOR gates and noninverting buffers. The noninverting buffers have delays $\delta_1 = 2 ns$ and $\delta_2 = 4 ns$ as shown in the figure. Both XOR gates and all wires have zero delays. Assume that all gate inputs, outputs, and wires are stable ... change of logic levels) occur(s) at $B$ during the interval from $0$ to $10$ ns? $1$ $2$ $3$ $4$
asked
Dec 2, 2015
in
Digital Logic
by
shikharV
Active
(
4.3k
points)

4.3k
views
gate2003
digitallogic
logicgates
digitalcircuits
+34
votes
5
answers
10
GATE200323
In a minheap with $n$ elements with the smallest element at the root, the $7^{th}$ smallest element can be found in time $\Theta (n \log n)$ $\Theta (n)$ $\Theta(\log n)$ $\Theta(1)$
asked
Sep 19, 2014
in
DS
by
Disha
(
121
points)

7.4k
views
gate2003
datastructure
heap
+26
votes
2
answers
11
GATE200390
Consider the function $f$ defined below. struct item { int data; struct item * next; }; int f(struct item *p) { return ((p == NULL)  (p>next == NULL) ((p>data <= p >next > data) && f(p>next) ... decreasing order of data value the elements in the list are sorted in nonincreasing order of data value not all elements in the list have the same data value
asked
Sep 17, 2014
in
DS
by
Kathleen
Veteran
(
59.9k
points)

2.9k
views
gate2003
datastructure
linkedlists
normal
+18
votes
5
answers
12
GATE200389
Consider the C program shown below: #include<stdio.h> #define print(x) printf("%d", x) int x; void Q(int z) { z+=x; print(z); } void P(int *y) { int x = *y + 2; Q(x); *y = x  1; print(x); } main(void) { x = 5; P(&x); print(x); } The output of this program is: $12 \ 7 \ 6$ $22 \ 12 \ 11$ $14 \ 6 \ 6$ $7 \ 6 \ 6$
asked
Sep 17, 2014
in
Programming
by
Kathleen
Veteran
(
59.9k
points)

3k
views
gate2003
programming
programminginc
normal
+30
votes
5
answers
13
GATE200388
In the following $C$ program fragment, $j$, $k$, $n$ and TwoLog_n are integer variables, and $A$ is an array of integers. The variable $n$ is initialized to an integer $\geqslant 3$, and TwoLog_n is initialized to the value of $2^*\lceil \log_2(n) \rceil$ for (k = 3; k <= n; ... $\left\{m \mid m \leq n, \text{m is prime} \right\}$ { }
asked
Sep 17, 2014
in
Algorithms
by
Kathleen
Veteran
(
59.9k
points)

2.5k
views
gate2003
algorithms
identifyfunction
normal
+18
votes
4
answers
14
GATE200387
Consider three data items $D1, D2,$ and $D3,$ and the following execution schedule of transactions $T1, T2,$ and $T3.$ In the diagram, $R(D)$ and $W(D)$ denote the actions reading and writing the data item $D$ respectively. Which of the following ... $T2; T1; T3$ The schedule is serializable as $T3; T2; T1$ The schedule is not serializable
asked
Sep 17, 2014
in
Databases
by
Kathleen
Veteran
(
59.9k
points)

2k
views
gate2003
databases
transactions
normal
+24
votes
1
answer
15
GATE200386
Consider the set of relations shown below and the SQL query that follows. Students: (Roll_number, Name, Date_of_birth) Courses: (Course_number, Course_name, Instructor) Grades: (Roll_number, Course_number, Grade) Select distinct Name from Students, Courses, Grades where Students. ... of students who have got an A grade in at least one of the courses taught by Korth None of the above
asked
Sep 17, 2014
in
Databases
by
Kathleen
Veteran
(
59.9k
points)

2.6k
views
gate2003
databases
sql
easy
+21
votes
2
answers
16
GATE200385
Consider the following functional dependencies in a database. Date_of_Birth $\to$ Age Age $\to$ Eligibility Name $\to$ Roll_number Roll_number $\to$ Name Course_number $\to$ Course_name Course_number $\to$ Instructor (Roll_number, Course_number) $\to$ Grade The relation ( ... normal form but not in third normal form in third normal form but not in BCNF in BCNF in none of the above
asked
Sep 17, 2014
in
Databases
by
Kathleen
Veteran
(
59.9k
points)

3k
views
gate2003
databases
databasenormalization
normal
+42
votes
4
answers
17
GATE200384
Host $A$ is sending data to host $B$ over a full duplex link. $A$ and $B$ are using the sliding window protocol for flow control. The send and receive window sizes are $5$ packets each. Data packets (sent only from $A$ to $B$) are all $1000$ bytes long and the transmission ... communication? $7.69 \times 10^6$ Bps $11.11 \times 10^6$ Bps $12.33 \times 10^6$ Bps $15.00 \times 10^6$ Bps
asked
Sep 17, 2014
in
Computer Networks
by
Kathleen
Veteran
(
59.9k
points)

7.4k
views
gate2003
computernetworks
slidingwindow
normal
+17
votes
6
answers
18
GATE200383
A $2$ $km$ long broadcast LAN has $10^7$ bps bandwidth and uses CSMA/CD. The signal travels along the wire at $2 \times 10^8$ m/s. What is the minimum packet size that can be used on this network? $50$ $\text{bytes}$ $100$ $\text{bytes}$ $200$ $\text{bytes}$ None of the above
asked
Sep 17, 2014
in
Computer Networks
by
Kathleen
Veteran
(
59.9k
points)

2.8k
views
gate2003
computernetworks
lantechnologies
normal
+23
votes
5
answers
19
GATE200382, ISRO20091
The subnet mask for a particular network is $255.255.31.0.$ Which of the following pairs of $\text{IP}$ addresses could belong to this network? $172.57.88.62$ and $172.56.87.23$ $10.35.28.2$ and $10.35.29.4$ $191.203.31.87$ and $191.234.31.88$ $128.8.129.43$ and $128.8.161.55$
asked
Sep 17, 2014
in
Computer Networks
by
Kathleen
Veteran
(
59.9k
points)

7.3k
views
gate2003
computernetworks
subnetting
normal
isro2009
+18
votes
3
answers
20
GATE200380
Suppose we want to synchronize two concurrent processes $P$ and $Q$ using binary semaphores $S$ and $T$. The code for the processes $P$ and $Q$ is shown below. Process P: Process Q: while(1) { while(1) { W: Y: print '0'; print '1'; print '0'; print '1'; X: Z: } } Synchronization statements ... $P(S)$ at $W, V(S)$ at $X, P(T)$ at $Y, V(T)$ at $Z, S$ initially $1$ , and $T$ initially $0$
asked
Sep 17, 2014
in
Operating System
by
Kathleen
Veteran
(
59.9k
points)

1.9k
views
gate2003
operatingsystem
processsynchronization
normal
+41
votes
1
answer
21
GATE200377
A uniprocessor computer system only has two processes, both of which alternate $10$ $\text{ms}$ CPU bursts with $90$ $\text{ms}$ I/O bursts. Both the processes were created at nearly the same time. The I/O of both processes can proceed ... scheduling Static priority scheduling with different priorities for the two processes Round robin scheduling with a time quantum of $5$ $\text{ms}$
asked
Sep 17, 2014
in
Operating System
by
Kathleen
Veteran
(
59.9k
points)

4.4k
views
gate2003
operatingsystem
processschedule
normal
+27
votes
4
answers
22
GATE200376
Which of the following is NOT an advantage of using shared, dynamically linked libraries as opposed to using statistically linked libraries? Smaller sizes of executable files Lesser overall page fault rate in the system Faster program startup Existing programs need not be relinked to take advantage of newer versions of libraries
asked
Sep 17, 2014
in
Compiler Design
by
Kathleen
Veteran
(
59.9k
points)

3.9k
views
gate2003
compilerdesign
runtimeenvironments
linking
easy
+1
vote
2
answers
23
GATE200375
Consider the following class definitions in a hypothetical Object Oriented language that supports inheritance and uses dynamic binding. The language should not be assumed to be either Java or C++, though the syntax is similar. Class P { Class Q subclass of P { void f(int i) { void f ... y to P. The output produced by executing the above program fragment will be 1 2 1 2 1 1 2 1 2 2 2 2
asked
Sep 17, 2014
in
Programming
by
Kathleen
Veteran
(
59.9k
points)

1.4k
views
gate2003
programming
variablebinding
normal
outofsyllabusnow
+20
votes
4
answers
24
GATE200373
The following program fragment is written in a programming language that allows global variables and does not allow nested declarations of functions. global int i=100, j=5; void P(x) { int i=10; print(x+10); i=200; j=20; print (x); } main() {P(i+j);} If ... and call by need parameter passing mechanism, the values printed by the above program are: $115, 220$ $25, 220$ $25, 15$ $115, 105$
asked
Sep 17, 2014
in
Programming
by
Kathleen
Veteran
(
59.9k
points)

2.1k
views
gate2003
compilerdesign
normal
runtimeenvironments
parameterpassing
+27
votes
5
answers
25
GATE200372
The following resolution rule is used in logic programming. Derive clause $(P \vee Q)$ from clauses $(P\vee R),(Q \vee ¬R)$ Which of the following statements related to this rule is FALSE? $((P ∨ R)∧(Q ∨ ¬R))⇒(P ∨ Q)$ ... and only if $(P ∨ R)∧(Q ∨ ¬R)$ is satisfiable $(P ∨ Q)⇒ \text{FALSE}$ if and only if both $P$ and $Q$ are unsatisfiable
asked
Sep 17, 2014
in
Mathematical Logic
by
Kathleen
Veteran
(
59.9k
points)

2.7k
views
gate2003
mathematicallogic
normal
propositionallogic
+4
votes
0
answers
26
GATE200371
Consider the following logic program P $\begin{align*} A(x) &\gets B(x,y), C(y) \\ &\gets B(x,x) \end{align*}$ ... $(\forall x) [(\forall y) [B(x,y) \land C(y)] \Rightarrow A(x)] \land (\exists x)[B(x,x)]$
asked
Sep 17, 2014
in
Programming
by
Kathleen
Veteran
(
59.9k
points)

1.4k
views
gate2003
programming
logicprogramming
outofsyllabusnow
+30
votes
4
answers
27
GATE200370
Let $G= (V,E)$ be a directed graph with $n$ vertices. A path from $v_i$ to $v_j$ in $G$ is a sequence of vertices ($v_{i},v_{i+1}, \dots , v_j$) such that $(v_k, v_k+1) \in E$ for all $k$ in $i$ through $j1$. A simple path is a path in which no ... path length from $j$ to $k$ If there exists a path from $j$ to $k$, every simple path from $j$ to $k$ contains at most $A[j,k]$ edges
asked
Sep 17, 2014
in
Algorithms
by
Kathleen
Veteran
(
59.9k
points)

3.8k
views
gate2003
algorithms
graphalgorithms
normal
+24
votes
8
answers
28
GATE200369
The following are the starting and ending times of activities $A, B, C, D, E, F, G$ and $H$ ... in a room only if the room is reserved for the activity for its entire duration. What is the minimum number of rooms required? $3$ $4$ $5$ $6$
asked
Sep 17, 2014
in
Algorithms
by
Kathleen
Veteran
(
59.9k
points)

2.7k
views
gate2003
algorithms
normal
greedyalgorithm
+10
votes
2
answers
29
GATE200368
What is the weight of a minimum spanning tree of the following graph? $29$ $31$ $38$ $41$
asked
Sep 17, 2014
in
Algorithms
by
Kathleen
Veteran
(
59.9k
points)

1.5k
views
gate2003
algorithms
spanningtree
normal
+43
votes
4
answers
30
GATE200367
Let $G =(V,E)$ be an undirected graph with a subgraph $G_1 = (V_1, E_1)$. Weights are assigned to edges of $G$ as follows. $w(e) = \begin{cases} 0 \text{, if } e \in E_1 \\1 \text{, otherwise} \end{cases}$ A singlesource shortest path algorithm is ... of edges in the shortest paths from $v_1$ to all vertices of $G$ $G_1$ is connected $V_1$ forms a clique in $G$ $G_1$ is a tree
asked
Sep 17, 2014
in
Algorithms
by
Kathleen
Veteran
(
59.9k
points)

4.5k
views
gate2003
algorithms
graphalgorithms
normal
Page:
1
2
3
4
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
For GATECSE Admissions 2019
Challenge to GATE keys: Question 26, If you also want to challenge the same, as I did!
How to follow Standard Textbooks?
Gate contest link is now open
Official keys are out now.
Follow @csegate
Recent questions tagged gate2003
Recent Blog Comments
The much awaited one!! 🤩🤩
Yes...I did 🖐
Anyone challenged for Nor gates question?
Ok...cool..Lets see what happens.
47,925
questions
52,325
answers
182,364
comments
67,790
users