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-2003
51
votes
5
answers
61
GATE CSE 2003 | Question: 29, ISRO2009-73
Which of the following scenarios may lead to an irrecoverable error in a database system? A transaction writes a data item after it is read by an uncommitted transaction A transaction reads a data item after it is read by an ... it is written by a committed transaction A transaction reads a data item after it is written by an uncommitted transaction
Kathleen
asked
in
Databases
Sep 16, 2014
by
Kathleen
14.8k
views
gatecse-2003
databases
transaction-and-concurrency
easy
isro2009
44
votes
7
answers
62
GATE CSE 2003 | Question: 28
Which of the following functionality must be implemented by a transport protocol over and above the network protocol? Recovery from packet losses Detection of duplicate packets Packet delivery in the correct order End to end connectivity
Kathleen
asked
in
Computer Networks
Sep 16, 2014
by
Kathleen
14.1k
views
gatecse-2003
computer-networks
network-layering
easy
47
votes
6
answers
63
GATE CSE 2003 | Question: 27
Which of the following assertions is FALSE about the Internet Protocol (IP)? It is possible for a computer to have multiple IP addresses IP packets from the same source to the same destination can take different routes in the network IP ensures that a ... set the route of an outgoing packets; the route is determined only by the routing tables in the routers on the way
Kathleen
asked
in
Computer Networks
Sep 16, 2014
by
Kathleen
16.2k
views
gatecse-2003
computer-networks
ip-addressing
normal
27
votes
6
answers
64
GATE CSE 2003 | Question: 26
In a system with $\text{32 bit}$ virtual addresses and $\text{1 KB}$ page size, use of one-level page tables for virtual to physical address translation is not practical because of the large amount of internal ... large amount of external fragmentation the large memory overhead in maintaining page tables the large computation overhead in the translation process
Kathleen
asked
in
Operating System
Sep 16, 2014
by
Kathleen
15.2k
views
gatecse-2003
operating-system
virtual-memory
normal
44
votes
5
answers
65
GATE CSE 2003 | Question: 25, ISRO2009-12
Using a larger block size in a fixed block size file system leads to better disk throughput but poorer disk space utilization better disk throughput and better disk space utilization poorer disk throughput but better disk space utilization poorer disk throughput and poorer disk space utilization
Kathleen
asked
in
Operating System
Sep 16, 2014
by
Kathleen
14.9k
views
gatecse-2003
operating-system
disk
normal
isro2009
38
votes
4
answers
66
GATE CSE 2003 | Question: 24
Which of the following statements is FALSE? In statically typed languages, each variable in a program has a fixed type In un-typed languages, values do not have any types In dynamically typed languages, variables have no types In all statically typed languages, each variable in a program is associated with values of only a single type during the execution of the program
Kathleen
asked
in
Programming in C
Sep 16, 2014
by
Kathleen
9.0k
views
gatecse-2003
programming
normal
type-checking
63
votes
2
answers
67
GATE CSE 2003 | Question: 22
The usual $\Theta(n^2)$ implementation of Insertion Sort to sort an array uses linear search to identify the position where an element is to be inserted into the already sorted part of the array. If, instead, we use binary search to identify the position, the worst case running ... $\Theta(n^2)$ become $\Theta(n (\log n)^2)$ become $\Theta(n \log n)$ become $\Theta(n)$
Kathleen
asked
in
Algorithms
Sep 16, 2014
by
Kathleen
15.7k
views
gatecse-2003
algorithms
sorting
time-complexity
normal
24
votes
5
answers
68
GATE CSE 2003 | Question: 21
Consider the following graph: Among the following sequences: abeghf abfehg abfhge afghbe Which are the depth-first traversals of the above graph? I, II and IV only I and IV only II, III and IV only I, III and IV only
Kathleen
asked
in
Algorithms
Sep 16, 2014
by
Kathleen
12.9k
views
gatecse-2003
algorithms
graph-algorithms
normal
graph-search
53
votes
3
answers
69
GATE CSE 2003 | Question: 20
Consider the following three claims: $(n+k)^m = \Theta(n^m)$ where $k$ and $m$ are constants $2^{n+1} = O(2^n)$ $2^{2n+1} = O(2^n)$ Which of the following claims are correct? I and II I and III II and III I, II, and III
Kathleen
asked
in
Algorithms
Sep 16, 2014
by
Kathleen
18.5k
views
gatecse-2003
algorithms
asymptotic-notation
normal
25
votes
3
answers
70
GATE CSE 2003 | Question: 19, ISRO2009-24
Suppose the numbers $7, 5, 1, 8, 3, 6, 0, 9, 4, 2$ ... $9 \ 8 \ 6 \ 4 \ 2 \ 3 \ 0 \ 1 \ 5 \ 7$
Kathleen
asked
in
DS
Sep 16, 2014
by
Kathleen
23.4k
views
gatecse-2003
binary-search-tree
easy
isro2009
75
votes
10
answers
71
GATE CSE 2003 | Question: 18
In a bottom-up evaluation of a syntax directed definition, inherited attributes can always be evaluated be evaluated only if the definition is L-attributed be evaluated only if the definition has synthesized attributes never be evaluated
Kathleen
asked
in
Compiler Design
Sep 16, 2014
by
Kathleen
36.6k
views
gatecse-2003
compiler-design
syntax-directed-translation
normal
26
votes
4
answers
72
GATE CSE 2003 | Question: 17
Assume that the SLR parser for a grammar G has $n_1$ states and the LALR parser for G has $n_2$ states. The relationship between $n_1$ and $n_2$ is $n_1$ is necessarily less than $n_2$ $n_1$ is necessarily equal to $n_2$ $n_1$ is necessarily greater than $n_2$ None of the above
Kathleen
asked
in
Compiler Design
Sep 16, 2014
by
Kathleen
11.2k
views
gatecse-2003
compiler-design
parsing
easy
67
votes
10
answers
73
GATE CSE 2003 | Question: 16
Which of the following suffices to convert an arbitrary CFG to an LL(1) grammar? Removing left recursion alone Factoring the grammar alone Removing left recursion and factoring the grammar None of the above
Kathleen
asked
in
Compiler Design
Sep 16, 2014
by
Kathleen
27.1k
views
gatecse-2003
compiler-design
parsing
easy
56
votes
12
answers
74
GATE CSE 2003 | Question: 14
The regular expression $0^*(10^*)^*$ denotes the same set as $(1^*0)^*1^*$ $0+(0+10)^*$ $(0+1)^*10(0+1)^*$ None of the above
Kathleen
asked
in
Theory of Computation
Sep 16, 2014
by
Kathleen
19.2k
views
gatecse-2003
theory-of-computation
regular-expression
easy
38
votes
4
answers
75
GATE CSE 2003 | Question: 13
Nobody knows yet if $P=NP$. Consider the language $L$ defined as follows.$L = \begin{cases} (0+1)^* & \text{ if } P = NP \\ \phi & otherwise \end{cases} $Which of the following statements is true? $L$ is recursive $L$ is ... but not recursive $L$ is not recursively enumerable Whether $L$ is recursively enumerable or not will be known after we find out if $P=NP$
Kathleen
asked
in
Theory of Computation
Sep 16, 2014
by
Kathleen
9.6k
views
gatecse-2003
theory-of-computation
normal
recursive-and-recursively-enumerable-languages
15
votes
3
answers
76
GATE CSE 2003 | Question: 12
Ram and Shyam have been asked to show that a certain problem $\Pi$ is $\text{NP-complete}.$ Ram shows a polynomial time reduction from the $\text{3-SAT}$ problem to $\Pi$, and Shyam shows a polynomial time reduction from $\Pi$ to $\text{3-SAT.}$ Which of ... not NP-complete $\Pi$ is in NP, but is not NP-complete $\Pi$ is NP-complete $\Pi$ is neither NP-hard, nor in NP
Kathleen
asked
in
Algorithms
Sep 16, 2014
by
Kathleen
8.1k
views
gatecse-2003
algorithms
p-np-npc-nph
normal
out-of-gate-syllabus
48
votes
4
answers
77
GATE CSE 2003 | Question: 11
Consider an array multiplier for multiplying two $n$ bit numbers. If each gate in the circuit has a unit delay, the total delay of the multiplier is $\Theta(1)$ $\Theta(\log n)$ $\Theta(n)$ $\Theta(n^2)$
Kathleen
asked
in
Digital Logic
Sep 16, 2014
by
Kathleen
15.1k
views
gatecse-2003
digital-logic
normal
array-multiplier
30
votes
5
answers
78
GATE CSE 2003 | Question: 10, ISRO-DEC2017-41
For a pipelined CPU with a single ALU, consider the following situations The ${j+1}^{st}$ instruction uses the result of the $j^{th}$ instruction as an operand The execution of a conditional jump instruction The $j^{th}$ and ${j+1}^{st}$ ... ALU at the same time. Which of the above can cause a hazard I and II only II and III only III only All the three
Kathleen
asked
in
CO and Architecture
Sep 16, 2014
by
Kathleen
9.5k
views
gatecse-2003
co-and-architecture
pipelining
normal
isrodec2017
27
votes
5
answers
79
GATE CSE 2003 | Question: 9
Assuming all numbers are in $2’s$ complement representation, which of the following numbers is divisible by $11111011$? $11100111$ $11100100$ $11010111$ $11011011$
Kathleen
asked
in
Digital Logic
Sep 16, 2014
by
Kathleen
10.3k
views
gatecse-2003
digital-logic
number-representation
normal
65
votes
5
answers
80
GATE CSE 2003 | Question: 8, ISRO2009-53
Let $\text{G}$ be an arbitrary graph with $n$ nodes and $k$ components. If a vertex is removed from $\text{G}$, the number of components in the resultant graph must necessarily lie down between $k$ and $n$ $k-1$ and $k+1$ $k-1$ and $n-1$ $k+1$ and $n-k$
Kathleen
asked
in
Graph Theory
Sep 16, 2014
by
Kathleen
15.3k
views
gatecse-2003
graph-theory
graph-connectivity
normal
isro2009
33
votes
2
answers
81
GATE CSE 2003 | Question: 7
Consider the set $\Sigma^*$ of all strings over the alphabet $\Sigma = \{0, 1\}$. $\Sigma^*$ with the concatenation operator for strings does not form a group forms a non-commutative group does not have a right identity element forms a group if the empty string is removed from $\Sigma^*$
Kathleen
asked
in
Set Theory & Algebra
Sep 16, 2014
by
Kathleen
8.8k
views
gatecse-2003
set-theory&algebra
group-theory
normal
81
votes
6
answers
82
GATE CSE 2003 | Question: 6
Let $T(n)$ be the number of different binary search trees on $n$ distinct elements. Then $T(n) = \sum_{k=1}^{n} T(k-1)T(x)$, where $x$ is $n-k+1$ $n-k$ $n-k-1$ $n-k-2$
Kathleen
asked
in
DS
Sep 16, 2014
by
Kathleen
22.2k
views
gatecse-2003
normal
binary-search-tree
43
votes
5
answers
83
GATE CSE 2003 | Question: 5
$n$ couples are invited to a party with the condition that every husband should be accompanied by his wife. However, a wife need not be accompanied by her husband. The number of different gatherings possible at the party is \(^{2n}\mathrm{C}_n\times 2^n\) \(3^n\) \(\frac{(2n)!}{2^n}\) \(^{2n}\mathrm{C}_n\)
Kathleen
asked
in
Combinatory
Sep 16, 2014
by
Kathleen
10.4k
views
gatecse-2003
combinatory
normal
44
votes
4
answers
84
GATE CSE 2003 | Question: 4
Let $A$ be a sequence of $8$ distinct integers sorted in ascending order. How many distinct pairs of sequences, $B$ and $C$ are there such that each is sorted in ascending order, $B$ has $5$ and $C$ has $3$ elements, and the result of merging $B$ and $C$ gives $A$ $2$ $30$ $56$ $256$
Kathleen
asked
in
Combinatory
Sep 16, 2014
by
Kathleen
13.4k
views
gatecse-2003
combinatory
normal
42
votes
10
answers
85
GATE CSE 2003 | Question: 3
Let $P(E)$ denote the probability of the event $E$. Given $P(A) = 1$, $P(B) =\dfrac{1}{2}$, the values of $P(A\mid B)$ and $P(B\mid A)$ respectively are $\left(\dfrac{1}{4}\right),\left(\dfrac{1}{2}\right)$ $\left(\dfrac{1}{2}\right),\left(\dfrac{1}{4}\right)$ $\left(\dfrac{1}{2}\right),{1}$ ${1},\left(\dfrac{1}{2}\right)$
Kathleen
asked
in
Probability
Sep 16, 2014
by
Kathleen
11.7k
views
gatecse-2003
probability
easy
conditional-probability
72
votes
4
answers
86
GATE CSE 2003 | Question: 2
Assume the following C variable declaration: int *A[10], B[10][10]; Of the following expressions: $A[2]$ $A[2][3]$ $B[1]$ $B[2][3]$ which will not give compile-time errors if used as left hand sides of assignment statements in a C program? I, II, and IV only II, III, and IV only II and IV only IV only
Kathleen
asked
in
Programming in C
Sep 16, 2014
by
Kathleen
29.9k
views
gatecse-2003
programming
programming-in-c
easy
pointers
27
votes
3
answers
87
GATE CSE 2003 | Question: 1
Consider the following $C$ function. For large values of $y$, the return value of the function $f$ best approximates float f,(float x, int y) { float p, s; int i; for (s=1,p=1,i=1; i<y; i++) { p *= x/i; s += p; } return s; } $x^y$ $e^x$ $\text{ln} (1+x)$ $x^x$
Kathleen
asked
in
Algorithms
Sep 16, 2014
by
Kathleen
10.0k
views
gatecse-2003
algorithms
identify-function
normal
121
votes
15
answers
88
GATE CSE 2003 | Question: 78
A processor uses $2-level$ 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 ... virtual address is approximately (to the nearest $0.5$ ns) $1.5$ ns $2$ ns $3$ ns $4$ ns
gatecse
asked
in
Operating System
Sep 15, 2014
by
gatecse
46.0k
views
gatecse-2003
operating-system
normal
virtual-memory
45
votes
3
answers
89
GATE CSE 2003 | Question: 52
Consider two languages $L_1$ and $L_2$ each on the alphabet $\Sigma$. Let $f : \Sigma^* \to \Sigma^*$ be a polynomial time computable bijection such that $(\forall x) [ x\in L_1$ iff $f(x) \in L_2]$. Further, let $f^{-1}$ be also polynomial ... $\in NP$ and $L_2$ $\in P$ $L_1$ is undecidable and $L_2$ is decidable $L_1$ is recursively enumerable and $L_2$ is recursive
Arjun
asked
in
Theory of Computation
Sep 8, 2014
by
Arjun
8.5k
views
gatecse-2003
theory-of-computation
normal
decidability
70
votes
4
answers
90
GATE CSE 2003 | Question: 54
Define languages $L_0$ and $L_1$ as follows : $L_0 = \{\langle M, w, 0 \rangle \mid M \text{ halts on }w\} $ $L_1 = \{\langle M, w, 1 \rangle \mid M \text{ does not halts on }w\}$ Here $\langle M, w, i \rangle$ is a ... $L'$ is recursively enumerable, but $ L$ is not Both $L$ and $L'$ are recursive Neither $L$ nor $L'$ is recursively enumerable
Arjun
asked
in
Theory of Computation
Sep 8, 2014
by
Arjun
24.2k
views
theory-of-computation
turing-machine
gatecse-2003
difficult
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-2003
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:...