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

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
Blogs
New Blog
Exam Category
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.
Search results for gate2008
+50
votes
5
answers
1
GATE200867
A processor uses 36 bit physical address and 32 bit virtual addresses, with a page frame size of 4 Kbytes. Each page table entry is of size 4 bytes. A three level page table is used for virtual to physical address translation, where the virtual address is used as ... table entry of the first, second and third level page tables are respectively 20,20,20 24,24,24 24,24,20 25,25,24
asked
Sep 12, 2014
in
Operating System
by
Kathleen
Veteran
(
67.5k
points)

9.3k
views
gate2008
operatingsystem
virtualmemory
normal
+26
votes
4
answers
2
GATE200846
You are given the postorder traversal, $P$, of a binary search tree on the $n$ elements $1, 2, \dots, n$. You have to determine the unique binary search tree that has $P$ as its postorder traversal. What is the time complexity of the most efficient algorithm for doing this? $\Theta(\log n)$ $\Theta(n)$ $\Theta(n\log n)$ None of the above, as the tree cannot be uniquely determined
asked
Sep 12, 2014
in
DS
by
Kathleen
Veteran
(
67.5k
points)

4.4k
views
gate2008
datastructure
binarysearchtree
normal
+15
votes
3
answers
3
GATE200870
Consider a file of 16384 records. Each record is 32 bytes long and its key field is of size 6 bytes. The file is ordered on a nonkey field, and the file organization is unspanned. The file is stored in a file system with block size 1024 bytes, and the size ... number of firstlevel and secondlevel blocks in the multilevel index are respectively 8 and 0 128 and 6 256 and 4 512 and 5
asked
Sep 2, 2014
in
Databases
by
ABG
(
133
points)

2.4k
views
gate2008
databases
indexing
normal
+10
votes
4
answers
4
GATE200875
Consider the following C functions: int f1 (int n) { if(n == 0  n == 1) return n; else return (2 * f1(n1) + 3 * f1(n2)); } int f2(int n) { int i; int X[N], Y[N], Z[N]; X[0] = Y[0] = Z[0] = 0; X[1] = 1; Y[1] = 2; Z[1] = 3; for(i = 2; i < ... 2]; Y[i] = 2 * X[i]; Z[i] = 3 * X[i]; } return X[n]; } f1(8) and f2(8) return the values 1661 and 1640 59 and 59 1640 and 1640 1640 and 1661
asked
Apr 23, 2016
in
Algorithms
by
jothee
Veteran
(
96.5k
points)

578
views
gate2008
normal
algorithms
timecomplexity
+11
votes
3
answers
5
GATE200845
Dijkstra's single source shortest path algorithm when run from vertex $a$ in the above graph, computes the correct shortest path distance to only vertex $a$ only vertices $a, e, f, g, h$ only vertices $a, b, c, d$ all the vertices
asked
Sep 12, 2014
in
Algorithms
by
Kathleen
Veteran
(
67.5k
points)

2.7k
views
gate2008
algorithms
graphalgorithms
normal
+16
votes
3
answers
6
GATE2008IT41
Assume that a main memory with only 4 pages, each of 16 bytes, is initially empty. The CPU generates the following sequence of virtual addresses and uses the Least Recently Used (LRU) page replacement policy. 0, 4, 8, 20, 24, 36, 44, 12, 68, 72, 80, 84, 28, 32, 88, 92 How many page faults does ... of the sequence? 6 and 1, 2, 3, 4 7 and 1, 2, 4, 5 8 and 1, 2, 4, 5 9 and 1, 2, 3, 5
asked
Oct 29, 2014
in
Operating System
by
Ishrat Jahan
Veteran
(
21.5k
points)

2.1k
views
gate2008it
operatingsystem
pagereplacement
normal
+14
votes
3
answers
7
GATE200869
Consider the following relational schemes for a library database: Book (Title, Author, Catalog_no, Publisher, Year, Price) Collection(Title, Author, Catalog_no) with the following functional dependencies: $\text{Title Author }\rightarrow\text{ Catalog_no}$ $\text{Catalog_no ... and Collection are in 3NF only Book is in 2NF and Collection in 3NF Both Book and Collection are in 2NF only
asked
Sep 12, 2014
in
Databases
by
Kathleen
Veteran
(
67.5k
points)

2.6k
views
gate2008
databases
databasenormalization
normal
+26
votes
3
answers
8
GATE2008IT61
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 ... 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
asked
Oct 29, 2014
in
Databases
by
Ishrat Jahan
Veteran
(
21.5k
points)

3.8k
views
gate2008it
databases
databasenormalization
normal
+12
votes
3
answers
9
GATE200833, ISRO200980
Which of the following is/are true of the autoincrement addressing mode? It is useful in creating selfrelocating code If it is included in an Instruction Set Architecture, then an additional ALU is required for effective address calculation The amount of increment depends on the size of the data item accessed I only II only III only II and III only
asked
Sep 12, 2014
in
CO & Architecture
by
Kathleen
Veteran
(
67.5k
points)

2.5k
views
gate2008
addressingmodes
coandarchitecture
normal
isro2009
+16
votes
2
answers
10
GATE2008IT84
Host X has IP address 192.168.1.97 and is connected through two routers R1 and R2 to anĀother host Y with IP address 192.168.1.80. Router R1 has IP addresses 192.168.1.135 and 192.168.1.110. R2 has IP addresses 192.168.1.67 and 192.168.1. ... the network is 255.255.255.224. Given the information above, how many distinct subnets are guaranteed to already exist in the network? 1 2 3 6
asked
Oct 29, 2014
in
Computer Networks
by
Ishrat Jahan
Veteran
(
21.5k
points)

1.5k
views
gate2008it
computernetworks
subnetting
normal
+13
votes
4
answers
11
GATE200872
Consider a machine with a 2way set associative data cache of size 64 Kbytes and block size 16 bytes. The cache is managed using 32 bit virtual addresses and the page size is 4 Kbytes. A program to be run on this machine begins as follows: double ARR[1024][1024]; int i, j; /* ... following array elements have the same cache index as ARR[0][0]? ARR[0][4] ARR[4][0] ARR[0][5] ARR[5][0]
asked
Apr 23, 2016
in
CO & Architecture
by
jothee
Veteran
(
96.5k
points)

1.3k
views
gate2008
coandarchitecture
cachememory
normal
+7
votes
3
answers
12
GATE200858
A computer on a 10Mbps network is regulated by a token bucket. The token bucket is filled at a rate of 2Mbps. It is initially filled to capacity with 16Megabits. What is the maximum duration for which the computer can transmit at the full 10Mbps? 1.6 seconds 2 seconds 5 seconds 8 seconds
asked
Sep 12, 2014
in
Computer Networks
by
Kathleen
Veteran
(
67.5k
points)

2.4k
views
gate2008
computernetworks
tokenbucket
+18
votes
2
answers
13
GATE200830
Let $\text{fsa}$ and $\text{pda}$ be two predicates such that $\text{fsa}(x)$ means $x$ is a finite state automaton and $\text{pda}(y)$ means that $y$ is a pushdown automaton. Let $\text{equivalent}$ be another predicate such that $\text{equivalent}(a,b)$ means ... \exists y \left(\text{fsa}\left(y\right) \wedge \text{pda}\left(x\right) \wedge \text{equivalent}\left(x,y\right)\right)$
asked
Sep 12, 2014
in
Mathematical Logic
by
Kathleen
Veteran
(
67.5k
points)

1.4k
views
gate2008
easy
mathematicallogic
firstorderlogic
+17
votes
5
answers
14
GATE200815
Which of the following tuple relational calculus expression(s) is/are equivalent to $\forall t \in r \left(P\left(t\right)\right)$? $\neg \exists t \in r \left(P\left(t\right)\right)$ $\exists t \notin r \left(P\left(t\right)\right)$ $\neg \exists t \in r \left(\neg P\left(t\right)\right)$ $\exists t \notin r \left(\neg P\left(t\right)\right)$ I only II only III only III and IV only
asked
Sep 12, 2014
in
Databases
by
Kathleen
Veteran
(
67.5k
points)

1.3k
views
gate2008
databases
relationalcalculus
normal
+5
votes
2
answers
15
GATE200881
The subsetsum problem is defined as follows. Given a set of $n$ positive integers, $S = \{ a_1, a_2, a_3, \dots , a_n \}$, and positive integer $W$, is there a subset of $S$ whose elements sum to $W$? A dynamic program for solving this problem uses a 2dimensional Boolean array, $X$, ... implies that there is a subset whose elements sum to $W$? $X[1, W]$ $X[n, 0]$ $X[n, W]$ $X[n1, n]$
asked
Apr 23, 2016
in
Algorithms
by
jothee
Veteran
(
96.5k
points)

811
views
gate2008
algorithms
normal
dynamicprogramming
+11
votes
3
answers
16
GATE200862
The following C function takes a singlelinked list of integers as a parameter and rearranges the elements of the list. The function is called with the list containing the integers 1, 2, 3, 4, 5, 6, 7 in the given order. What will be the contents of the list after function completes execution? struct node { int value; ... 6, 7 2, 1, 4 ,3, 6, 5, 7 1, 3, 2, 5, 4, 7, 6 2, 3, 4, 5, 6, 7, 1
asked
Sep 12, 2014
in
DS
by
Kathleen
Veteran
(
67.5k
points)

1.4k
views
gate2008
datastructure
linkedlists
normal
+11
votes
3
answers
17
GATE200834
Which of the following must be true for the RFE (Return From Exception) instruction on a general purpose processor? It must be a trap instruction It must be a privileged instruction An exception cannot be allowed to occur during execution of an RFE instruction I only II only I and II only I, II and III only
asked
Sep 12, 2014
in
CO & Architecture
by
Kathleen
Veteran
(
67.5k
points)

1.7k
views
gate2008
coandarchitecture
machineinstructions
normal
+6
votes
3
answers
18
GATE2008IT28
Consider the following Hasse diagrams. Which all of the above represent a lattice? (i) and (iv) only (ii) and (iii) only (iii) only (i), (ii) and (iv) only
asked
Oct 28, 2014
in
Set Theory & Algebra
by
Ishrat Jahan
Veteran
(
21.5k
points)

1.4k
views
gate2008it
settheory&algebra
lattice
normal
+9
votes
4
answers
19
GATE200847
We have a binary heap on $n$ elements and wish to insert $n$ more elements (not necessarily one after another) into this heap. The total time required for this is $\Theta(\log n)$ $\Theta(n)$ $\Theta(n\log n)$ $\Theta(n^2)$
asked
Sep 12, 2014
in
Algorithms
by
Kathleen
Veteran
(
67.5k
points)

1.8k
views
gate2008
algorithms
timecomplexity
normal
+10
votes
2
answers
20
GATE2008IT34
Consider a CFG with the following productions. $S \to AA \mid B$ $A \to 0A \mid A0 \mid 1$ $B \to 0B00 \mid 1$ $S$ is the start symbol, $A$ and $B$ are nonterminals and 0 and 1 are the terminals. The language generated by this grammar is $\left\{0^n 10^{2n} \mid n \ ... \cup \left\{0^n 10^{2n}\mid n \geq 0\right\}$ The set of all strings over $\{0, 1\}$ containing at least two 0's
asked
Oct 29, 2014
in
Theory of Computation
by
Ishrat Jahan
Veteran
(
21.5k
points)

977
views
gate2008it
theoryofcomputation
contextfreelanguage
normal
Page:
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
Jobs @cvppindia
How to be productive?For all Members,GATE Aspirants, everybody associated with "GO Family"
How to Do preparation for Gate2018
How to write nice answers/questions in GO
Organizing NET Questions
Follow @csegate
Gatecse
Search results for gate2008
Recent Blog Comments
how can i access ugc net questions??
Hi Friends, In my village some people told me ...
Hilarious :)
Visit exam center at your own risk ...
@papesh, Thanks. Helpful Post. Waiting for the ...
28,981
questions
36,818
answers
91,198
comments
34,706
users