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
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
Search results for gate2004
+68
votes
7
answers
1
GATE200447
Consider a system with a twolevel paging scheme in which a regular memory access takes $150$ $nanoseconds$, and servicing a page fault takes $8$ $milliseconds$. An average instruction takes $100$ nanoseconds of CPU time, and two memory accesses. The ... instruction execution time? $\text{645 nanoseconds}$ $\text{1050 nanoseconds}$ $\text{1215 nanoseconds}$ $\text{1230 nanoseconds}$
asked
Sep 5, 2014
in
CO and Architecture
by
gatecse
Boss
(
16.1k
points)

18.2k
views
gate2004
coandarchitecture
virtualmemory
normal
+37
votes
9
answers
2
GATE200462
A 4bit carry look ahead adder, which adds two 4bit numbers, is designed using AND, OR, NOT, NAND, NOR gates only. Assuming that all the inputs are available in both complemented and uncomplemented forms and the delay of each gate is one time unit, what ... that the carry network has been implemented using twolevel ANDOR logic. 4 time units 6 time units 10 time units 12 time units
asked
Sep 19, 2014
in
Digital Logic
by
Kathleen
Veteran
(
52.1k
points)

8k
views
gate2004
digitallogic
normal
adder
+46
votes
7
answers
3
GATE200485
A program takes as input a balanced binary search tree with $n$ leaf nodes and computes the value of a function $g(x)$ for each node $x$. If the cost of computing $g(x)$ is: $\Large \min \left ( \substack{\text{number of leafnodes}\\\text{in leftsubtree of $ ... worstcase time complexity of the program is? $\Theta (n)$ $\Theta (n \log n)$ $\Theta(n^2)$ $\Theta (n^2\log n)$
asked
Sep 19, 2014
in
DS
by
Kathleen
Veteran
(
52.1k
points)

7.6k
views
gate2004
binarysearchtree
normal
datastructure
+38
votes
4
answers
4
GATE200429
The tightest lower bound on the number of comparisons, in the worst case, for comparisonbased sorting is of the order of $n$ $n^2$ $n \log n$ $n \log^2n$
asked
Sep 19, 2014
in
Algorithms
by
Kathleen
Veteran
(
52.1k
points)

7.5k
views
gate2004
algorithms
sorting
asymptoticnotations
easy
+26
votes
7
answers
5
GATE200436
A circularly linked list is used to represent a Queue. A single variable $p$ is used to access the Queue. To which node should $p$ point such that both the operations $\text{enQueue}$ and $\text{deQueue}$ can be performed in constant time? rear node front node not possible with a single pointer node next to front
asked
Sep 19, 2014
in
DS
by
Kathleen
Veteran
(
52.1k
points)

5.7k
views
gate2004
datastructure
linkedlists
normal
+28
votes
8
answers
6
GATE200468
A hard disk with a transfer rate of $10$ Mbytes/second is constantly transferring data to memory using DMA. The processor runs at $600$ MHz, and takes $300$ and $900$ clock cycles to initiate and complete DMA transfer respectively. If the size of the transfer is $20$ Kbytes, what is the percentage of processor time consumed for the transfer operation? $5.0 \%$ $1.0\%$ $0.5\%$ $0.1\%$
asked
Sep 19, 2014
in
CO and Architecture
by
Kathleen
Veteran
(
52.1k
points)

7.1k
views
gate2004
disks
normal
coandarchitecture
+29
votes
8
answers
7
GATE2004IT88
Suppose that the maximum transmit window size for a TCP connection is $12000$ $\text{bytes}$. Each packet consists of $2000$ $\text{bytes}$. At some point in time, the connection is in slowstart phase with a current transmit window of $4000$ $\text{bytes}$. ... current transmit window? $4000$ $\text{bytes}$ $8000$ $\text{bytes}$ $10000$ $\text{bytes}$ $12000$ $\text{bytes}$
asked
Nov 2, 2014
in
Computer Networks
by
Ishrat Jahan
Boss
(
16.3k
points)

6.4k
views
gate2004it
computernetworks
slidingwindow
normal
+31
votes
9
answers
8
GATE2004IT13
Let $P$ be a singly linked list. Let $Q$ be the pointer to an intermediate node $x$ in the list. What is the worstcase time complexity of the bestknown algorithm to delete the node $x$ from the list ? $O(n)$ $O(\log^2 n)$ $O(\log n)$ $O(1)$
asked
Nov 2, 2014
in
DS
by
Ishrat Jahan
Boss
(
16.3k
points)

4.4k
views
gate2004it
datastructure
linkedlists
normal
ambiguous
+38
votes
3
answers
9
GATE200479
How many graphs on $n$ labeled vertices exist which have at least $\frac{(n^2  3n)}{ 2}$ edges ? $^{\left(\frac{n^2n}{2}\right)}C_{\left(\frac{n^23n} {2}\right)}$ $^{{\large\sum\limits_{k=0}^{\left (\frac{n^23n}{2} \right )}}.\left(n^2n\right)}C_k\\$ $^{\left(\frac{n^2n}{2}\right)}C_n\\$ $^{{\large\sum\limits_{k=0}^n}.\left(\frac{n^2n}{2}\right)}C_k$
asked
Sep 19, 2014
in
Graph Theory
by
Kathleen
Veteran
(
52.1k
points)

3.9k
views
gate2004
graphtheory
permutationandcombination
normal
counting
+28
votes
9
answers
10
GATE2004IT50
In an enhancement of a design of a CPU, the speed of a floating point unit has been increased by $\text{20%}$ and the speed of a fixed point unit has been increased by $\text{10%}$. What is the overall speedup achieved if the ratio of the number of floating point ... used to take twice the time taken by the fixed point operation in the original design? $1.155$ $1.185$ $1.255$ $1.285$
asked
Sep 15, 2014
in
CO and Architecture
by
gatecse
Boss
(
16.1k
points)

5.8k
views
gate2004it
normal
coandarchitecture
speedup
+22
votes
4
answers
11
GATE2004IT12, ISRO201677
Consider a system with $2$ level cache. Access times of Level $1$ cache, Level $2$ cache and main memory are $1$ $ns$, $10$ $ns$, and $500$ $ns$ respectively. The hit rates of Level $1$ and Level $2$ caches are $0.8$ and $0.9$, respectively. What is the average access time of the system ignoring the search time within the cache? $13.0$ $12.8$ $12.6$ $12.4$
asked
Nov 2, 2014
in
CO and Architecture
by
Ishrat Jahan
Boss
(
16.3k
points)

10.6k
views
gate2004it
coandarchitecture
cachememory
normal
isro2016
+30
votes
7
answers
12
GATE2004IT84
Consider a parity check code with three data bits and four parity check bits. Three of the Code Words are $0101011, 1001101$ and $1110001.$ Which of the following are also code words? $0010111$ $0110110$ $1011010$ $0111010$ I and III I, II and III II and IV I, II, III and IV
asked
Nov 2, 2014
in
Computer Networks
by
Ishrat Jahan
Boss
(
16.3k
points)

4.9k
views
gate2004it
computernetworks
networksecurity
normal
+36
votes
5
answers
13
GATE200414
Consider the following relation schema pertaining to a students database: Students (rollno, name, address) Enroll (rollno, courseno, coursename) where the primary keys are shown underlined. The number of tuples in the student and Enroll tables are $120$ and $8$ respectively. What are the ... in (Student * Enroll), where *' denotes natural join? $8, 8$ $120, 8$ $960, 8$ $960, 120$
asked
Sep 19, 2014
in
Databases
by
Kathleen
Veteran
(
52.1k
points)

5.3k
views
gate2004
databases
easy
joins
naturaljoin
+23
votes
4
answers
14
GATE200449
A unixstyle Inodes has $10$ direct pointers and one single, one double and one triple indirect pointers. Disk block size is $1$ Kbyte, disk block address is $32$ bits, and $48$bit integers are used. What is the maximum possible file size? $2^{24}$ bytes $2^{32}$ bytes $2^{34}$ bytes $2^{48}$ bytes
asked
Sep 19, 2014
in
Operating System
by
Kathleen
Veteran
(
52.1k
points)

5.8k
views
gate2004
operatingsystem
disks
normal
+24
votes
8
answers
15
GATE2004IT40
Let $M = (K, Σ, Г, Δ, s, F)$ be a pushdown automaton, where $K = (s, f), F = \{f\}, \Sigma = \{a, b\}, Г = \{a\}$ and $Δ = \{((s, a, \epsilon), (s, a)), ((s, b, \epsilon), (s, a)), (( s, a, a), (f, \epsilon)), ((f, a, a), (f, \epsilon)), ((f, b, a), (f, \epsilon))\}$. Which one of the following strings is not a member of $L(M)$? $aaa$ $aabab$ $baaba$ $bab$
asked
Nov 2, 2014
in
Theory of Computation
by
Ishrat Jahan
Boss
(
16.3k
points)

5.6k
views
gate2004it
theoryofcomputation
pushdownautomata
normal
+23
votes
5
answers
16
GATE200484
The recurrence equation $ T(1) = 1$ $T(n) = 2T(n1) + n, n \geq 2$ evaluates to $2^{n+1}  n  2$ $2^n  n$ $2^{n+1}  2n  2$ $2^n + n $
asked
Sep 19, 2014
in
Algorithms
by
Kathleen
Veteran
(
52.1k
points)

4.7k
views
gate2004
algorithms
recurrence
normal
+25
votes
10
answers
17
GATE200418, ISRO200731
In an $SR$ latch made by crosscoupling two NAND gates, if both $S$ and $R$ inputs are set to $0$, then it will result in $Q = 0, Q' = 1$ $Q = 1, Q' = 0$ $Q = 1, Q' = 1$ Indeterminate states
asked
Sep 19, 2014
in
Digital Logic
by
Kathleen
Veteran
(
52.1k
points)

5.6k
views
gate2004
digitallogic
easy
isro2007
flipflop
+23
votes
7
answers
18
GATE2004IT35
In how many ways can we distribute $5$ distinct balls, $B_1, B_2, \ldots, B_5$ in $5$ distinct cells, $C_1, C_2, \ldots, C_5$ such that Ball $B_i$ is not in cell $C_i$, $\forall i= 1,2,\ldots 5$ and each cell contains exactly one ball? $44$ $96$ $120$ $3125$
asked
Nov 2, 2014
in
Combinatory
by
Ishrat Jahan
Boss
(
16.3k
points)

2.6k
views
gate2004it
permutationandcombination
normal
ballsinbins
+39
votes
5
answers
19
GATE200421, ISRO200744
The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined by the instruction set architecture page size number of processes in memory physical memory size
asked
Sep 19, 2014
in
Operating System
by
Kathleen
Veteran
(
52.1k
points)

6.4k
views
gate2004
operatingsystem
virtualmemory
pagereplacement
normal
isro2007
+22
votes
4
answers
20
GATE200461
Consider the partial implementation of a 2bit counter using T flipflops following the sequence 02310, as shown below. To complete the circuit, the input X should be $Q_2^c$ $Q_2 + Q_1$ $\left(Q_1 + Q_2\right)^c$ $Q_1 \oplus Q_2$
asked
Sep 19, 2014
in
Digital Logic
by
Kathleen
Veteran
(
52.1k
points)

4k
views
gate2004
digitallogic
circuitoutput
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
How to prepare for GATE with a fulltime job??
Interview Experience at IISc
All subject Gate notes from Standard Books!!
My journey from Wipro to an IISc student  GATE 2019
Interview Experience at IITPalakkad
Follow @csegate
Search results for gate2004
Recent Blog Comments
Hi, the previous email was sent to only those who...
@kriti05 can you please tell me when did you got...
It was said that there will be an address...
sir .I recvd a mail which states "Your...
49,808
questions
54,489
answers
188,267
comments
74,660
users