GATE CSE
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
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.
Recent activity by Kapil
User Kapil
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Kapil
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
1
answer
1
algorithmss, Sorting,
Consider the array A containing n distinct elements. Let K = n – $n^{0.75}$. The first ⌊K⌋ elements of A are all in sorted order, but nothing is known about the remaining elements of A. what is the time complexity to sort given array A. A. O($n^{0.75}$) B. O(n) C. O($n^{2}$) D. O(nlogn)
commented
1 day
ago
in
Algorithms

45
views
algorithms
sorting
divideandconquer
ravulatestseries
0
answers
2
theory of computation
L = { <M> / M is a Turing machine and M accepts a regular language }. This Language L is recursively enumerable but not recursive. ...right ??
closed
1 day
ago
in
Theory of Computation

21
views
theoryofcomputation
toc
decidability
undecidability
recursiverecursivelyenumerable
0
answers
3
theory of computation
This language, L = { <M,w> / M is a TM,w is a string and M does not halt on string w } is not recursively enumerable ...right ???
commented
1 day
ago
in
Theory of Computation

33
views
theoryofcomputation
toc
decidability
recursiverecursivelyenumerable
0
answers
4
theory of computation
Which of the following languages below are NOT recursively enumerable ? L1 = {<M> / M is a TM that accepts all even numbers }. L2 = {<M> / M does not accept all even numbers } L3 = {<M> / M rejects all even numbers } A) Only L1 B) Only L1 and L2 C) Only L1 and L3 D) All of L1,L2 and L3
commented
2 days
ago
in
Theory of Computation

83
views
theoryofcomputation
toc
decidability
recursiverecursivelyenumerable
2
answers
5
GATE200659
Consider the following translation scheme. $ S\rightarrow ER$ $ R\rightarrow ^{*}E\left \{ print('*'); \right \} R\mid \varepsilon $ $ E\rightarrow F+E\left \{ print('+'); \right \}\mid F $ $ F\rightarrow S\mid id \left \{ print(id.value); \right \} $ Here id ... . For an input '2 * 3 + 4', this translation scheme prints 2 * 3 + 4 2 * +3 4 2 3 * 4 + 2 3 4+*
answer selected
2 days
ago
in
Compiler Design

766
views
gate2006
compilerdesign
grammar
normal
1
answer
6
cil2017 Q87
answer selected
3 days
ago
in
Databases

40
views
cil2017
databases
losslessjoin
functionaldependencies
2
answers
7
rosen discrete
How many strings of six lowercase letters of the English alphabet contain exactly two vowel?
retagged
3 days
ago
in
Combinatory

41
views
kennethrosen
discretemathematics
combinatorics
combinations
1
answer
8
pointer
please tell how to solve it?
commented
3 days
ago
in
Programming

58
views
2
answers
9
GATE200463
Consider the following program segment for a hypothetical CPU having three user registers R1, R2 and R3. Instruction Operation Instruction Size (in words) MOV R1, 5000 R1 $\leftarrow$ Memory[5000] 2 MOV R2(R1) R2 $\leftarrow$ Memory[(R1 ... after executing the HALT instruction, the return address (in decimal) saved in the stack will be 1007 1020 1024 1028
commented
4 days
ago
in
CO & Architecture

2.7k
views
gate2004
co&architecture
machineinstructions
normal
1
answer
10
How to find size of integer on your system in C programming
commented
5 days
ago
in
Programming

36
views
programminginc
0
answers
11
Kenneth Rosen  Mathematical logic
commented
5 days
ago
in
Mathematical Logic

22
views
mathematicallogic
discretemathematics
kennethrosen
1
answer
12
ISI Sample Paper Question
A club with n members is organized into four committees so that each member belongs to exactly two committees and each pair of committees has exactly one member in common. Then (A) n = 4 (B) n = 6 (C) n = 8 (D) n cannot be determined from the given information
commented
6 days
ago
in
Numerical Ability

36
views
isisamplepapers
3
answers
13
The intersection of a context free language and a regular language
answer edited
6 days
ago
in
Theory of Computation

86
views
1
answer
14
Average Memory Access Time Problem
answer selected
Apr 16
in
CO & Architecture

61
views
2
answers
15
GATE200512, ISRO200964
Let $f(x)$ be the continuous probability density function of a random variable $x$, the probability that $a < x \leq b$, is : $f(ba)$ $f(b)  f(a)$ $\int\limits_a^b f(x) dx$ $\int\limits_a^b xf (x)dx$
answer selected
Apr 16
in
Probability

714
views
gate2005
probability
randomvariable
easy
isro2009
1
answer
16
Timothy Williams Question
The machine pictured in fig a)complements a given bit pattern b)finds 2's complement c)increments a given bit pattern by 1 d)changes the sign bit
commented
Apr 15
in
Theory of Computation

58
views
1
answer
17
GENERAL DOUBT C
void main() { char *p="cprogramming"; } I know the string literal "cprogramming" is stored in read only data segment. But where will the pointer p be stored, in stack or readwrite data segment ?
commented
Apr 15
in
Programming

105
views
programminginc
4
answers
18
Rosen chapter6 (counting)
How many solutions are there to the equation x1 + x2 + x3 + x4 + x5 = 21, where xi , i = 1, 2, 3, 4, 5, is a nonnegative integer such that: 0$\leq$ x1$\leq$10 ?
answer selected
Apr 14
in
Combinatory

110
views
discretemathematics
kennethrosen
2
answers
19
GATE200435
Consider the label sequences obtained by the following pairs of traversals on a labeled binary tree. Which of these pairs identify a tree uniquely? preorder and postorder inorder and postorder preorder and inorder level order and postorder I only II, III III only IV only
answer selected
Apr 14
in
DS

283
views
gate2004
datastructure
binarytree
normal
3
answers
20
What will COUNT(*) returns if all the collection has only null values?
answer selected
Apr 13
in
Databases

206
views
databases
sql
1
answer
21
c programming
explain the output #include <stdio.h> int main() { int a=1; printf("%d %d %d",a,a++,a); return 0; }
closed
Apr 13
in
Programming

69
views
programminginc
cprogramming
4
answers
22
GATE200340
A graph $G=(V,E)$ satisfies $E \leq 3 V  6$. The mindegree of $G$ is defined as $\min_{v\in V}\left\{degree (v)\right \}$. Therefore, mindegree of $G$ cannot be 3 4 5 6
answer selected
Apr 13
in
Graph Theory

766
views
gate2003
graphtheory
normal
5
answers
23
GATE200350
Consider the following deterministic finite state automaton M. Let S denote the set of seven bit binary strings in which the first, the fourth, and the last bits are 1. The number of strings in S that are accepted by M is 1 5 7 8
answer selected
Apr 13
in
Theory of Computation

750
views
gate2003
theoryofcomputation
finiteautomata
normal
1
answer
24
Gilbert Strang Problem set 1.3
Choose a coefficient b that makes this system singular. Then choose a righthand side g that makes it solvable. Find two solutions in that singular case. $2x +by = 16$ $4x + 8y = g$
commented
Apr 13
in
Linear Algebra

34
views
linearalgebra
gilbertstrang
4
answers
25
C programming  Output ?
#include <stdio.h> int main() { unsigned char a = 5; a = (1<<((sizeof(char)<<3)1)); char b = a; printf("%d %d\n",b,a); printf("%u %u\n",b,a); } If the size of a char datatype is 1 Byte, then what will be the output? [Edited]
commented
Apr 12
in
Programming

144
views
programminginc
2
answers
26
ISI 2004 MIII
Q7 The equation $x^{6}5x^{4}+16x^{2}72x+9=0$ has A) Exactly two distinct real roots B) Exactly three distinct real roots C) Exactly four distinct real roots D) six different real roots
answer selected
Apr 11
in
Set Theory & Algebra

59
views
isi2004
polynomials
4
answers
27
GATE20033
Let $P(E)$ denote the probability of the event $E$. Given $P(A) = 1$, $P(B) = 1/2$, the values of $P(A\mid B)$ and $P(B\mid A)$ respectively are 1/4,1/2 1/2,1/4 1/2,1 1,1/2
answer selected
Apr 11
in
Probability

475
views
gate2003
probability
easy
4
answers
28
GATE200362
In a permutation \(a_1 ... a_n\), of n distinct integers, an inversion is a pair \((a_i, a_j)\) such that \(i < j\) and \(a_i > a_j\). What would be the worst case time complexity of the Insertion Sort algorithm, if the inputs are restricted to permutations ... most $n$ inversions? \(\Theta(n^2)\) \(\Theta(n\log n)\) \(\Theta(n^{1.5})\) \(\Theta(n)\)
answer edited
Apr 11
in
Algorithms

689
views
gate2003
algorithms
sorting
expectation
normal
3
answers
29
GATE2005IT66
In a data flow diagram, the segment shown below is identified as having transaction flow characteristics, with p2 identified as the transaction center A first level architectural design of this segment will result in a set of process modules with an ... the transaction flow. This module Tc invokes p2. p2 invokes p1, and then invokes p3, or p4, or p5
answer selected
Apr 10
in
Databases

406
views
gate2005it
databases
transactions
normal
2
answers
30
GATEBOOK TEST
1 +2(1/2) +3(1/4)+ 4(1/8)+ .............. = ? getting 2 please check
answered
Apr 10
in
Numerical Ability

76
views
2
answers
31
GATE2007IT70
Your are given the following four bytes : 10100011 00110111 11101001 10101011 Which of the following are substrings of the base 64 encoding of the above four bytes ? zdp fpq qwA oze
answer selected
Apr 9
in
Computer Networks

1k
views
gate2007it
computernetworks
networksecurity
normal
0
answers
32
gate cs 2014 set1 q22
what is meant by check assertion in sql?
closed
Apr 9
in
Programming

18
views
0
answers
33
gate 2014 set 1 q12
what is meant by rooted n node binary tree?
closed
Apr 9
in
Programming

17
views
9
answers
34
GATE200759
Information about a collection of students is given by the relation $\text{studInfo(}\underline{\text{studId}},\text{ name, sex)}$. The relation $\text{enroll(}\underline{\text{studId}}, \underline{\text{ courseId}})$ gives which ... in which a proper subset of female students are enrolled. Courses in which only male students are enrolled. None of the above
answer selected
Apr 8
in
Databases

1.4k
views
gate2007
databases
relationalalgebra
normal
2
answers
35
In Ppersistent CSMA network there are 5 systems in a slot. The probability of station not transmitting the data is 0.6. Only two stations should transmit the data to avoid collision. What is the probability that channel is collision free?
answer selected
Apr 8
in
Computer Networks

414
views
computernetworks
csmacd
2
answers
36
GATE2005IT76
A company has a class C network address of 204.204.204.0. It wishes to have three subnets, one with 100 hosts and two with 50 hosts each. Which one of the following options represents a feasible set of subnet address/subnet mask pairs? 204.204.204.128/ ... 255.192 204.204.204.128/255.255.255.128 204.204.204.64/255.255.255.192 204.204.204.0/255.255.255.192
answer selected
Apr 7
in
Computer Networks

889
views
gate2005it
computernetworks
subnetting
normal
3
answers
37
GATE2005IT77
Assume that "host1.mydomain.dom" has an IP address of 145.128.16.8. Which of the following options would be most appropriate as a subsequence of steps in performing the reverse lookup of 145.128.16.8? In the following options " ... addr.arpa domains Directly query a NS for 145.inaddr.arpa and then a NS for 128.145.inaddr.arpa domains
answer selected
Apr 7
in
Computer Networks

691
views
gate2005it
computernetworks
normal
4
answers
38
GATE2005IT85a
Consider a simple graph with unit edge costs. Each node in the graph represents a router. Each node maintains a routing table indicating the next hop router to be used to relay a packet to its destination and the cost of the path to the destination through that router. Initially, the ... C 2 F D 2 Table for node D A B 3 B B 1 C C 1 D   E E 1 F F 1
commented
Apr 7
in
Computer Networks

533
views
gate2005it
computernetworks
routing
normal
2
answers
39
GATE1999_1.25
Which of the following is correct? Btrees are for storing data on disk and B$^+$ trees are for main memory. Range queries are faster on B$^+$ trees. Btrees are for primary indexes and B$^+$ trees are for secondary indexes. The height of a B$^+$ tree is independent of the number of records.
answer selected
Apr 6
in
Databases

568
views
gate1999
databases
btree
normal
3
answers
40
GATE2014344
The memory access time is 1 nanosecond for a read operation with a hit in cache, 5 nanoseconds for a read operation with a miss in cache, 2 nanoseconds for a write operation with a hit in cache and 10 nanoseconds for a write ... cache hitratio is 0.9. The average memory access time (in nanoseconds) in executing the sequence of instructions is ______.
commented
Apr 5
in
CO & Architecture

1.9k
views
gate20143
co&architecture
cachememory
numericalanswers
normal
22,073
questions
28,039
answers
63,226
comments
24,133
users