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-2005
40
votes
2
answers
31
GATE CSE 2005 | Question: 63
The following diagram represents a finite state machine which takes as input a binary number from the least significant bit. Which of the following is TRUE? It computes $1$’s complement of the input number It computes $2$’s complement of the input number It increments the input number it decrements the input number
Kathleen
asked
in
Theory of Computation
Sep 22, 2014
by
Kathleen
8.6k
views
gatecse-2005
theory-of-computation
finite-automata
easy
24
votes
2
answers
32
GATE CSE 2005 | Question: 60
Consider the grammar: $S \rightarrow (S) \mid a$ Let the number of states in SLR (1), LR(1) and LALR(1) parsers for the grammar be $n_1, n_2$ and $n_3$ respectively. The following relationship holds good: $n_1 < n_2 < n_3$ $n_1 = n_3 < n_2$ $n_1 = n_2 = n_3$ $n_1 \geq n_3 \geq n_2$
Kathleen
asked
in
Compiler Design
Sep 22, 2014
by
Kathleen
15.3k
views
gatecse-2005
compiler-design
parsing
normal
34
votes
5
answers
33
GATE CSE 2005 | Question: 59
Consider the grammar: $E \rightarrow E + n \mid E \times n \mid n$ For a sentence $n + n \times n$, the handles in the right-sentential form of the reduction are: $n, E + n$ and $E + n \times n$ $n, E + n$ and $E + E \times n$ $n, n + n$ and $n + n \times n$ $n, E + n$ and $E \times n$
Kathleen
asked
in
Compiler Design
Sep 22, 2014
by
Kathleen
16.1k
views
gatecse-2005
compiler-design
grammar
normal
18
votes
1
answer
34
GATE CSE 2005 | Question: 58
Consider the following two problems on undirected graphs: $\alpha$: Given $G(V, E)$, does $G$ have an independent set of size |V| - $4$? $\beta$: Given $G(V, E)$, does $G$ have an independent set of size $5$ ... $\beta$ is in P Both $\alpha$ and $\beta$ are NP-complete Both $\alpha$ and $\beta$ are in P
Kathleen
asked
in
Theory of Computation
Sep 22, 2014
by
Kathleen
6.5k
views
gatecse-2005
theory-of-computation
p-np-npc-nph
normal
36
votes
5
answers
35
GATE CSE 2005 | Question: 57
Consider the languages: $L_1 = \left\{ww^R \mid w \in \{0, 1\}^* \right\}$ $L_2 = \left\{w\text{#}w^R \mid w \in \{0, 1\}^* \right\}$, where $\text{#}$ ... of the following is TRUE? $L_1$ is a deterministic CFL $L_2$ is a deterministic CFL $L_3$ is a CFL, but not a deterministic CFL $L_3$ is a deterministic CFL
Kathleen
asked
in
Theory of Computation
Sep 22, 2014
by
Kathleen
8.4k
views
gatecse-2005
theory-of-computation
context-free-language
easy
26
votes
2
answers
36
GATE CSE 2005 | Question: 56
Let $L_1$ be a recursive language, and let $L_2$ be a recursively enumerable but not a recursive language. Which one of the following is TRUE? $L_1$' is recursive and $L_2$' is recursively enumerable $L_1$' is recursive ... enumerable $L_1$' and $L_2$' are recursively enumerable $L_1$' is recursively enumerable and $L_2$' is recursive
Kathleen
asked
in
Theory of Computation
Sep 22, 2014
by
Kathleen
5.5k
views
gatecse-2005
theory-of-computation
recursive-and-recursively-enumerable-languages
easy
33
votes
6
answers
37
GATE CSE 2005 | Question: 55
Consider the languages: $L_1 = \left\{ a^nb^nc^m \mid n,m >0\right\}$ and $ L_2 = \left\{a^nb^mc^m\mid n, m > 0\right\}$ Which one of the following statements is FALSE? $L_1 \cap L_2$ is a context-free language $L_1 \cup L_2$ is a context-free language $L_1 \text{ and } L_2$ are context-free languages $L_1 \cap L_2$ is a context sensitive language
Kathleen
asked
in
Theory of Computation
Sep 22, 2014
by
Kathleen
8.7k
views
gatecse-2005
theory-of-computation
identify-class-language
normal
27
votes
2
answers
38
GATE CSE 2005 | Question: 54
Let $N_f$ and $N_p$ denote the classes of languages accepted by non-deterministic finite automata and non-deterministic push-down automata, respectively. Let $D_f$ and $D_p$ denote the classes of languages accepted by deterministic finite automata and deterministic push-down automata ... $D_f = N_f \text{ and } D_p = N_p$ $D_f =N_f \text{ and } D_p \subset N_p$
Kathleen
asked
in
Theory of Computation
Sep 22, 2014
by
Kathleen
4.2k
views
gatecse-2005
theory-of-computation
easy
non-determinism
50
votes
6
answers
39
GATE CSE 2005 | Question: 53
Consider the machine $M$: The language recognized by $M$ is: $\left\{ w \in \{a, b\}^* \text{ | every a in $w$ is followed by exactly two $b$'s} \right\}$ ... $'} \right\}$ $\left\{w \in \{a, b\}^* \text{ | $w$ does not contain $aa$' as a substring} \right\}$
Kathleen
asked
in
Theory of Computation
Sep 22, 2014
by
Kathleen
12.8k
views
gatecse-2005
theory-of-computation
finite-automata
normal
52
votes
3
answers
40
GATE CSE 2005 | Question: 45
Consider three decision problems $P_1$, $P_2$ and $P_3$. It is known that $P_1$ is decidable and $P_2$ is undecidable. Which one of the following is TRUE? $P_3$ is decidable if $P_1$ is reducible to $P_3$ $P_3$ is undecidable if $P_3$ is reducible ... $P_3$ is undecidable if $P_2$ is reducible to $P_3$ $P_3$ is decidable if $P_3$ is reducible to $P_2$'s complement
Kathleen
asked
in
Theory of Computation
Sep 22, 2014
by
Kathleen
12.1k
views
gatecse-2005
theory-of-computation
decidability
normal
reduction
54
votes
1
answer
41
GATE CSE 2005 | Question: 38
Let $G(V,E)$ be an undirected graph with positive edge weights. Dijkstra’s single source shortest path algorithm can be implemented using the binary heap data structure with time complexity: $O\left(|V|^2\right)$ $O\left(|E|+|V|\log |V|\right)$ $O\left(|V|\log|V|\right)$ $O\left(\left(|E|+|V|\right)\log|V|\right)$
Kathleen
asked
in
Algorithms
Sep 22, 2014
by
Kathleen
16.2k
views
gatecse-2005
algorithms
graph-algorithms
normal
33
votes
5
answers
42
GATE CSE 2005 | Question: 37
Suppose $T(n) =2T (\frac{n}{2}) + n$, $T(0) = T(1) =1$ Which one of the following is FALSE? $T(n)=O(n^2)$ $T(n)=\Theta(n \log n)$ $T(n)=\Omega(n^2)$ $T(n)=O(n \log n)$
Kathleen
asked
in
Algorithms
Sep 22, 2014
by
Kathleen
9.6k
views
gatecse-2005
algorithms
asymptotic-notation
recurrence-relation
normal
22
votes
8
answers
43
GATE CSE 2005 | Question: 36
In a complete $k$-ary tree, every internal node has exactly $k$ children. The number of leaves in such a tree with $n$ internal node is: $nk$ $(n-1)k + 1$ $n(k-1) +1$ $n(k-1)$
Kathleen
asked
in
DS
Sep 22, 2014
by
Kathleen
23.0k
views
gatecse-2005
data-structures
tree
normal
31
votes
4
answers
44
GATE CSE 2005 | Question: 35
How many distinct binary search trees can be created out of $4$ distinct keys? $5$ $14$ $24$ $42$
Kathleen
asked
in
DS
Sep 22, 2014
by
Kathleen
24.3k
views
gatecse-2005
data-structures
binary-search-tree
counting
normal
20
votes
1
answer
45
GATE CSE 2005 | Question: 34
A priority queue is implemented as a Max-Heap. Initially, it has $5$ elements. The level-order traversal of the heap is: $10, 8, 5, 3, 2$. Two new elements $1$ and $7$ ... $10, 8, 7, 2, 3, 1, 5$ $10, 8, 7, 1, 2, 3, 5$ $10, 8, 7, 3, 2, 1, 5$
Kathleen
asked
in
DS
Sep 22, 2014
by
Kathleen
13.9k
views
gatecse-2005
data-structures
binary-heap
normal
22
votes
3
answers
46
GATE CSE 2005 | Question: 33
Postorder traversal of a given binary search tree, $T$ produces the following sequence of keys $10, 9, 23, 22, 27, 25, 15, 50, 95, 60, 40, 29$ Which one of the following sequences of keys can be the result of an in-order traversal of the tree $T$ ... $95, 50, 60, 40, 27, 23, 22, 25, 10, 9, 15, 29$
Kathleen
asked
in
DS
Sep 22, 2014
by
Kathleen
11.3k
views
gatecse-2005
data-structures
binary-search-tree
easy
51
votes
8
answers
47
GATE CSE 2005 | Question: 32
Consider the following C program: double foo (double); /* Line 1 */ int main() { double da, db; //input da db = foo(da); } double foo (double a) { return a; } The above code compiled without any error ... or error some compiler-warnings not leading to unintended results some compiler-warnings due to type-mismatch eventually leading to unintended results compiler errors
Kathleen
asked
in
Programming in C
Sep 22, 2014
by
Kathleen
16.2k
views
gatecse-2005
programming
programming-in-c
compiler-design
easy
26
votes
4
answers
48
GATE CSE 2005 | Question: 31
Consider the following C-program: void foo (int n, int sum) { int k = 0, j = 0; if (n == 0) return; k = n % 10; j = n/10; sum = sum + k; foo (j, sum); printf ("%d,",k); } int main() { int a = 2048, sum = 0; foo(a, sum); printf("%d\n", sum); } What ... print? $\text{8, 4, 0, 2, 14}$ $\text{8, 4, 0, 2, 0}$ $\text{2, 0, 4, 8, 14}$ $\text{2, 0, 4, 8, 0}$
Kathleen
asked
in
Algorithms
Sep 22, 2014
by
Kathleen
13.0k
views
gatecse-2005
algorithms
identify-function
recursion
normal
45
votes
5
answers
49
GATE CSE 2005 | Question: 30
Let r be a relation instance with schema R = (A, B, C, D). We define $r_1 = \pi_{A, B, C} (R)$ and $r_2=\pi_{A, D} (r)$. Let $s =r_1 \: * \: r_2$ where $*$ denotes natural join. Given that the decomposition of $r$ into $r_1$ and $r_2$ is lossy, which one of the following is TRUE? $s \subset r$ $r \cup s =r$ $r \subset s$ $r*s=s$
Kathleen
asked
in
Databases
Sep 22, 2014
by
Kathleen
16.2k
views
gatecse-2005
databases
relational-algebra
natural-join
normal
32
votes
6
answers
50
GATE CSE 2005 | Question: 29, UGCNET-June2015-III: 9
Which one of the following statements about normal forms is $\text{FALSE}?$ $\text{BCNF}$ is stricter than $\text{3NF}$ Lossless, dependency-preserving decomposition into $\text{3NF}$ is always possible Lossless, dependency-preserving decomposition into $\text{BCNF}$ is always possible Any relation with two attributes is in $\text{BCNF}$
Kathleen
asked
in
Databases
Sep 22, 2014
by
Kathleen
16.7k
views
gatecse-2005
databases
database-normalization
easy
ugcnetcse-june2015-paper3
53
votes
5
answers
51
GATE CSE 2005 | Question: 28
Which of the following is a key factor for preferring $B^+$-trees to binary search trees for indexing database relations? Database relations have a large number of records Database relations are sorted on the primary key $B^+$-trees require less memory than binary search trees Data transfer form disks is in blocks
Kathleen
asked
in
Databases
Sep 22, 2014
by
Kathleen
25.0k
views
gatecse-2005
databases
b-tree
normal
27
votes
5
answers
52
GATE CSE 2005 | Question: 27
An organization has a class $B$ network and wishes to form subnets for $64$ departments. The subnet mask would be: $255.255.0.0$ $255.255.64.0$ $255.255.128.0$ $255.255.252.0$
Kathleen
asked
in
Computer Networks
Sep 22, 2014
by
Kathleen
39.8k
views
gatecse-2005
computer-networks
subnetting
normal
22
votes
3
answers
53
GATE CSE 2005 | Question: 26
In a network of LANs connected by bridges, packets are sent from one LAN to another through intermediate bridges. Since more than one path may exist between two LANs, packets may have to be routed through multiple bridges. Why is ... -routing? For shortest path routing between LANs For avoiding loops in the routing paths For fault tolerance For minimizing collisions
Kathleen
asked
in
Computer Networks
Sep 22, 2014
by
Kathleen
12.4k
views
gatecse-2005
computer-networks
routing
normal
25
votes
8
answers
54
GATE CSE 2005 | Question: 25
The maximum window size for data transmission using the selective reject protocol with $n\text{-bit}$ frame sequence numbers is: $2^n$ $2^{n-1}$ $2^n-1$ $2^{n-2}$
Kathleen
asked
in
Computer Networks
Sep 22, 2014
by
Kathleen
38.5k
views
gatecse-2005
computer-networks
sliding-window
easy
18
votes
3
answers
55
GATE CSE 2005 | Question: 24
The address resolution protocol (ARP) is used for: Finding the IP address from the DNS Finding the IP address of the default gateway Finding the IP address that corresponds to a MAC address Finding the MAC address that corresponds to an IP address
Kathleen
asked
in
Computer Networks
Sep 22, 2014
by
Kathleen
8.0k
views
gatecse-2005
computer-networks
normal
network-protocols
30
votes
5
answers
56
GATE CSE 2005 | Question: 23
Packets of the same session may be routed through different paths in: TCP, but not UDP TCP and UDP UDP, but not TCP Neither TCP nor UDP
Kathleen
asked
in
Computer Networks
Sep 22, 2014
by
Kathleen
19.5k
views
gatecse-2005
computer-networks
tcp
udp
easy
35
votes
2
answers
57
GATE CSE 2005 | Question: 22, ISRO2015-36
Increasing the RAM of a computer typically improves performance because: Virtual Memory increases Larger RAMs are faster Fewer page faults occur Fewer segmentation faults occur
Kathleen
asked
in
Operating System
Sep 22, 2014
by
Kathleen
41.7k
views
gatecse-2005
operating-system
page-replacement
easy
isro2015
23
votes
5
answers
58
GATE CSE 2005 | Question: 21
What is the swap space in the disk used for? Saving temporary html pages Saving process data Storing the super-block Storing device drivers
Kathleen
asked
in
Operating System
Sep 22, 2014
by
Kathleen
19.9k
views
gatecse-2005
operating-system
disk
easy
36
votes
4
answers
59
GATE CSE 2005 | Question: 20
Normally user programs are prevented from handling I/O directly by I/O instructions in them. For CPUs having explicit I/O instructions, such I/O protection is ensured by having the I/O instruction privileged. In a CPU with memory mapped I/ ... /O protection is ensured by a hardware trap I/O protection is ensured during system configuration I/O protection is not possible
Kathleen
asked
in
Operating System
Sep 22, 2014
by
Kathleen
11.4k
views
gatecse-2005
operating-system
io-handling
normal
45
votes
7
answers
60
GATE CSE 2005 | Question: 19
Which one of the following is true for a CPU having a single interrupt request line and a single interrupt grant line? Neither vectored interrupt nor multiple interrupting devices are possible Vectored interrupts are not possible ... and multiple interrupting devices are both possible Vectored interrupts are possible but multiple interrupting devices are not possible
Kathleen
asked
in
Operating System
Sep 22, 2014
by
Kathleen
20.9k
views
gatecse-2005
operating-system
io-handling
normal
Page:
« prev
1
2
3
4
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent questions tagged gatecse-2005
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...