Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged gatecse-2009
2
votes
0
answers
1
Doubt in pipelining questions.
Consider this question and its selected answer: https://gateoverflow.in/3690/gate2004-it-47 And this question: https://gateoverflow.in/1314/gate2009-28 Both questions are somewhat similar. In the first one's answer, instruction $I_1$ (when i = 2), ... that I am missing? PS. From where can I study this? Hamacher book doesn't contain pipelining in this much detail.
Rishabh Gupta 2
asked
in
CO and Architecture
Nov 4, 2017
by
Rishabh Gupta 2
1.0k
views
co-and-architecture
pipelining
gateit-2004
gatecse-2009
32
votes
5
answers
2
GATE CSE 2009 | Question: 52
A hard disk has $63$ sectors per track, $10$ platters each with $2$ recording surfaces and $1000$ cylinders. The address of a sector is given as a triple $\langle c, h, s \rangle$, where $c$ is the cylinder number, $h$ is the surface number and $s$ is the sector ... $\langle 0, 16, 30 \rangle$ $\langle 0, 16, 31 \rangle$ $\langle 0, 17, 31 \rangle$
go_editor
asked
in
Operating System
Apr 23, 2016
by
go_editor
7.5k
views
gatecse-2009
operating-system
disk
normal
43
votes
3
answers
3
GATE CSE 2009 | Question: 54
A sub-sequence of a given sequence is just the given sequence with some elements (possibly none or all) left out. We are given two sequences $X[m]$ and $Y[n]$ of lengths $m$ and $n$, respectively with indexes of $X$ and $Y$ starting from $0$. We wish to find the length of ... $L[M, N]$. $L[p, q]$ needs to be computed before $L[r, s]$ if either $p<r$ or $q < s$.
go_editor
asked
in
Algorithms
Apr 23, 2016
by
go_editor
10.4k
views
gatecse-2009
normal
algorithms
dynamic-programming
recursion
52
votes
6
answers
4
GATE CSE 2009 | Question: 56
Consider the following relational schema: $\text{Suppliers}(\underline{\text{sid:integer}},\text{ sname:string, city:string, street:string})$ $\text{Parts}(\underline{\text{pid:integer}}, \text{ pname:string, color:string})$ ... $\text{2NF}$ but not in $\text{3NF}$ The schema is not in $\text{2NF}$
go_editor
asked
in
Databases
Apr 23, 2016
by
go_editor
20.4k
views
gatecse-2009
databases
sql
database-normalization
normal
74
votes
7
answers
5
GATE CSE 2009 | Question: 58
Frames of $1000\text{ bits}$ are sent over a $10^6$ bps duplex link between two hosts. The propagation time is $25ms$. Frames are to be transmitted into this link to maximally pack them in transit (within the link). Let $I$ be ... before starting transmission of the next frame? (Identify the closest choice ignoring the frame processing time) $16ms$ $18ms$ $20ms$ $22ms$
go_editor
asked
in
Computer Networks
Apr 23, 2016
by
go_editor
23.0k
views
gatecse-2009
computer-networks
sliding-window
normal
23
votes
3
answers
6
GATE CSE 2009 | Question: 60
Consider a binary max-heap implemented using an array. What is the content of the array after two delete operations on $\left\{25,14,16,13,10,8,12\right\}$ $\left\{14,13,12,10, 8\right\}$ $\left\{14,12,13,8,10\right\}$ $\left\{14,13,8,12,10\right\}$ $\left\{14,13,12,8,10\right\}$
go_editor
asked
in
DS
Apr 23, 2016
by
go_editor
7.0k
views
gatecse-2009
data-structures
heap
normal
21
votes
3
answers
7
GATE CSE 2009 | Question: 59
Consider a binary max-heap implemented using an array. Which one of the following array represents a binary max-heap? $\left\{25,12,16,13,10,8,14\right\}$ $\left\{25,14,13,16,10,8,12\right\}$ $\left\{25,14,16,13,10,8,12\right\}$ $\left\{25,14,12,13,10,8,16\right\}$
Kathleen
asked
in
DS
Sep 22, 2014
by
Kathleen
10.3k
views
gatecse-2009
data-structures
heap
normal
105
votes
18
answers
8
GATE CSE 2009 | Question: 57, ISRO2016-75
Frames of $\text{1000 bits}$ are sent over a $10^6$ $\text{bps}$ duplex link between two hosts. The propagation time is $\text{25 ms}$. Frames are to be transmitted into this link to maximally pack them in transit (within the link). What is the ... ? Assume that no time gap needs to be given between transmission of two frames. $I=2$ $I=3$ $I=4$ $I=5$
Kathleen
asked
in
Computer Networks
Sep 22, 2014
by
Kathleen
36.7k
views
gatecse-2009
computer-networks
sliding-window
normal
isro2016
56
votes
7
answers
9
GATE CSE 2009 | Question: 55
Consider the following relational schema: $\text{Suppliers}(\underline{\text{sid:integer}},\text{ sname:string, city:string, street:string})$ $\text{Parts}(\underline{\text{pid:integer}}, \text{ pname:string, color:string})$ ... of all suppliers who have supplied only non-blue part. Find the names of all suppliers who have not supplied only blue parts.
Kathleen
asked
in
Databases
Sep 22, 2014
by
Kathleen
31.0k
views
gatecse-2009
databases
sql
normal
31
votes
2
answers
10
GATE CSE 2009 | Question: 53
A sub-sequence of a given sequence is just the given sequence with some elements (possibly none or all) left out. We are given two sequences $X[m]$ and $Y[n]$ of lengths $m$ and $n$, respectively with indexes of $X$ and $Y$ starting from $0$. We wish to find the ... $\text{expr2} = \max\left(l\left(i-1, j-1\right), l\left(i,j\right)\right)$
Kathleen
asked
in
Algorithms
Sep 22, 2014
by
Kathleen
7.3k
views
gatecse-2009
algorithms
normal
dynamic-programming
recursion
46
votes
4
answers
11
GATE CSE 2009 | Question: 51
A hard disk has $63$ sectors per track, $10$ platters each with $2$ recording surfaces and $1000$ cylinders. The address of a sector is given as a triple $\langle c, h, s \rangle$, where $c$ is the cylinder number, $h$ is the surface number ... $\langle 400, 16, 29 \rangle$ corresponds to sector number: $505035$ $505036$ $505037$ $505038$
Kathleen
asked
in
Operating System
Sep 22, 2014
by
Kathleen
14.9k
views
gatecse-2009
operating-system
disk
normal
5
votes
1
answer
12
GATE CSE 2009 | Question: 50
Consider the following statements about the cyclomatic complexity of the control flow graph of a program module. Which of these are TRUE? The cyclomatic complexity of a module is equal to the maximum number of linearly independent circuits in the graph. The cyclomatic ... that should be tested during path coverage testing. I and II II and III I and III I, II and III
Kathleen
asked
in
IS&Software Engineering
Sep 22, 2014
by
Kathleen
3.3k
views
gatecse-2009
is&software-engineering
cyclomatic-complexity
easy
11
votes
2
answers
13
GATE CSE 2009 | Question: 49
Which of the following statements are TRUE? The context diagram should depict the system as a single bubble. External entities should be identified clearly at all levels of DFDs. Control information should not be represented in a DFD. A data store can be connected wither to another data store or to an external entity. II and III II and III I and III I, II and III
Kathleen
asked
in
IS&Software Engineering
Sep 22, 2014
by
Kathleen
5.8k
views
gatecse-2009
is&software-engineering
normal
data-flow-diagrams
56
votes
6
answers
14
GATE CSE 2009 | Question: 48
Let $G(x)$ be the generator polynomial used for CRC checking. What is the condition that should be satisfied by $G(x)$ to detect odd number of bits in error? $G(x)$ contains more than two terms $G(x)$ does not divide $1+x^k$, for any $k$ not exceeding the frame length $1+x$ is a factor of $G(x)$ $G(x)$ has an odd number of terms.
Kathleen
asked
in
Computer Networks
Sep 22, 2014
by
Kathleen
22.1k
views
gatecse-2009
computer-networks
error-detection
normal
81
votes
7
answers
15
GATE CSE 2009 | Question: 47
While opening a $TCP$ connection, the initial sequence number is to be derived using a time-of-day (ToD) clock that keeps running even when the host is down. The low order $32$ bits of the counter of the ToD clock is to be used for the initial sequence numbers ... sequence numbers used for packets of a connection can increase? $0.015$/s $0.064$/s $0.135$/s $0.327$/s
Kathleen
asked
in
Computer Networks
Sep 22, 2014
by
Kathleen
18.9k
views
gatecse-2009
computer-networks
tcp
difficult
ambiguous
21
votes
3
answers
16
GATE CSE 2009 | Question: 46
In the RSA public key cryptosystem, the private and public keys are $(e, n)$ and $(d, n)$ respectively, where $n=p \times q$ and $p$ and $q$ are large primes. Besides, $n$ is public and $p$ and $q$ are private. Let $M$ be an integer ... Which of the above equations correctly represents RSA cryptosystem? I and II I and III II and IV III and IV
Kathleen
asked
in
Computer Networks
Sep 22, 2014
by
Kathleen
5.6k
views
gatecse-2009
computer-networks
network-security
normal
out-of-gate-syllabus
75
votes
1
answer
17
GATE CSE 2009 | Question: 45
Let $R$ and $S$ be relational schemes such that $R=\{a,b,c\}$ and $S=\{c\}.$ Now consider the following queries on the database: $\pi_{R-S}(r) - \pi_{R-S} \left (\pi_{R-S} (r) \times s - \pi_{R-S,S}(r)\right )$ ... a,R.b From R,S Where R.c = S.c Which of the above queries are equivalent? $1$ and $2$ $1$ and $3$ $2$ and $4$ $3$ and $4$
Kathleen
asked
in
Databases
Sep 22, 2014
by
Kathleen
19.8k
views
gatecse-2009
databases
relational-calculus
difficult
62
votes
11
answers
18
GATE CSE 2009 | Question: 44
The following key values are inserted into a $B+$ - tree in which order of the internal nodes is $3$, and that of the leaf nodes is $2$, in the sequence given below. The order of internal nodes is the maximum number of tree pointers in each node, and the ... $1$ The maximum number of times leaf nodes would get split up as a result of these insertions is $2$ $3$ $4$ $5$
Kathleen
asked
in
Databases
Sep 22, 2014
by
Kathleen
28.7k
views
gatecse-2009
databases
b-tree
normal
26
votes
2
answers
19
GATE CSE 2009 | Question: 43
Consider two transactions $T_1$ and $T_2$, and four schedules $S_1, S_2, S_3, S_4$, of $T_1$ and $T_2$ as given below: $T_1: R_1[x]W_1[x]W_1[y]$ $T_2: R_2[x]R_2[y]W_2[y]$ $S_1: R_1[x]R_2[x]R_2[y] W_1[x] W_1[y] W_2[y]$ ... $S_1 \text{ and } S_2$ $S_2 \text{ and } S_3$ $S_3$ only $S_4$ only
Kathleen
asked
in
Databases
Sep 22, 2014
by
Kathleen
4.9k
views
gatecse-2009
databases
transaction-and-concurrency
normal
43
votes
2
answers
20
GATE CSE 2009 | Question: 42
Which of the following statements are TRUE? There exist parsing algorithms for some programming languages whose complexities are less than $\Theta(n^3)$ A programming language which allows recursion can be implemented with static storage allocation. No L-attributed ... both source language and intermediate code level. I and II I and IV III and IV I, III and IV
Kathleen
asked
in
Compiler Design
Sep 22, 2014
by
Kathleen
13.1k
views
gatecse-2009
compiler-design
parsing
normal
35
votes
7
answers
21
GATE CSE 2009 | Question: 41
The above DFA accepts the set of all strings over $\{0,1\}$ that begin either with $0$ or $1$. end with $0$. end with $00$. contain the substring $00$.
Kathleen
asked
in
Theory of Computation
Sep 22, 2014
by
Kathleen
17.1k
views
gatecse-2009
theory-of-computation
finite-automata
easy
41
votes
6
answers
22
GATE CSE 2009 | Question: 40
Let $L = L_1 \cap L_2 $, where $L_1$ and $L_2$ are languages as defined below: $L_1= \left \{ a^m b^mca^nb^n \mid m,n \geq 0 \right \}$ $L_2=\left \{ a^i b^j c^k \mid i,j,k \geq 0 \right \}$ Then $L$ is Not recursive Regular Context free but not regular Recursively enumerable but not context free.
Kathleen
asked
in
Theory of Computation
Sep 22, 2014
by
Kathleen
9.9k
views
gatecse-2009
theory-of-computation
easy
identify-class-language
42
votes
5
answers
23
GATE CSE 2009 | Question: 39
In quick-sort, for sorting $n$ elements, the $\left(n/4\right)^{th}$ smallest element is selected as pivot using an $O(n)$ time algorithm. What is the worst case time complexity of the quick sort? $\Theta(n)$ $\Theta(n \log n)$ $\Theta(n^2)$ $\Theta(n^2 \log n)$
Kathleen
asked
in
Algorithms
Sep 22, 2014
by
Kathleen
17.3k
views
gatecse-2009
algorithms
sorting
normal
21
votes
3
answers
24
GATE CSE 2009 | Question: 38
Consider the following graph: Which one of the following is NOT the sequence of edges added to the minimum spanning tree using Kruskal’s algorithm? $\text{(b, e) (e, f) (a, c) (b, c) (f, g) (c, d)}$ $\text{(b, e) (e, f) (a, c) (f, g) (b, c) (c, d)}$ $\text{(b, e) (a, c) (e, f) (b, c) (f, g) (c, d)}$ $\text{(b, e) (e, f) (b, c) (a, c) (f, g) (c, d)}$
Kathleen
asked
in
Algorithms
Sep 22, 2014
by
Kathleen
6.7k
views
gatecse-2009
algorithms
spanning-tree
normal
34
votes
4
answers
25
GATE CSE 2009 | Question: 37,ISRO-DEC2017-55
What is the maximum height of any AVL-tree with $7$ nodes? Assume that the height of a tree with a single node is $0$. $2$ $3$ $4$ $5$
Kathleen
asked
in
DS
Sep 22, 2014
by
Kathleen
35.1k
views
gatecse-2009
data-structures
binary-search-tree
normal
isrodec2017
avl-tree
26
votes
2
answers
26
GATE CSE 2009 | Question: 36
The keys $12, 18, 13, 2, 3, 23, 5$ and $15$ are inserted into an initially empty hash table of length $10$ using open addressing with hash function $h(k) = k \mod 10$ ...
Kathleen
asked
in
DS
Sep 22, 2014
by
Kathleen
5.2k
views
gatecse-2009
data-structures
hashing
normal
25
votes
2
answers
27
GATE CSE 2009 | Question: 35
The running time of an algorithm is represented by the following recurrence relation: $T(n) = \begin{cases} n & n \leq 3 \\ T(\frac{n}{3})+cn & \text{ otherwise } \end{cases}$ Which one of the following represents the time complexity of the algorithm? $\Theta(n)$ $\Theta(n \log n)$ $\Theta(n^2)$ $\Theta(n^2 \log n)$
Kathleen
asked
in
Algorithms
Sep 22, 2014
by
Kathleen
8.2k
views
gatecse-2009
algorithms
recurrence-relation
time-complexity
normal
33
votes
2
answers
28
GATE CSE 2009 | Question: 34
A multilevel page table is preferred in comparison to a single level page table for translating virtual address to physical address because It reduces the memory access time to read or write a memory location. It helps to reduce the size of ... is required by the translation lookaside buffer. It helps to reduce the number of page faults in page replacement algorithms.
Kathleen
asked
in
Operating System
Sep 22, 2014
by
Kathleen
11.3k
views
gatecse-2009
operating-system
virtual-memory
easy
47
votes
13
answers
29
GATE CSE 2009 | Question: 33
The enter_CS() and leave_CS() functions to implement critical section of a process are realized using test-and-set instruction as follows: void enter_CS(X) { while(test-and-set(X)); } void leave_CS(X) { X = 0; } In the above solution, $X$ is a memory location ... at the same time Which of the above statements are TRUE? (I) only (I) and (II) (II) and (III) (IV) only
Kathleen
asked
in
Operating System
Sep 22, 2014
by
Kathleen
19.3k
views
gatecse-2009
operating-system
process-synchronization
normal
29
votes
3
answers
30
GATE CSE 2009 | Question: 32
In the following process state transition diagram for a uniprocessor system, assume that there are always some processes in the ready state: Now consider the following statements: If a process makes a transition $D$, it would result in another process making ... -preemptive scheduling. Which of the above statements are TRUE? I and II I and III II and III II and IV
Kathleen
asked
in
Operating System
Sep 22, 2014
by
Kathleen
12.8k
views
gatecse-2009
operating-system
process-scheduling
normal
Page:
1
2
3
next »
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
Aptitude Overflow Book
Participate in Machine Learning benchmarking
GATE Overflow Tikz Templates
UPSC One Time Registration OTR Online Form 2022
DRDO CEPTAM 10 Online Form 2022
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(8.9k)
Digital Logic
(3.2k)
Programming and DS
(5.7k)
Algorithms
(4.5k)
Theory of Computation
(6.5k)
Compiler Design
(2.2k)
Operating System
(4.8k)
Databases
(4.4k)
CO and Architecture
(3.6k)
Computer Networks
(4.4k)
Non GATE
(1.2k)
Others
(2.5k)
Admissions
(644)
Exam Queries
(838)
Tier 1 Placement Questions
(17)
Job Queries
(72)
Projects
(9)
Unknown Category
(851)
Recent questions tagged gatecse-2009
Recent Blog Comments
Try...
@Arjun @Deepak Sir, In Test Schedule google...
sir is this for gate? it has way more questions...
https://gateoverflow.in/tag/gate2010 this link is...
previous years than GATE 2010 paper