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
Recent activity by Keith Kr
User Keith Kr
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Keith Kr
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
7
answers
1
GATE20002.8
What can be said about a regular language $L$ over $\{ a \}$ whose minimal finite state automaton has two states? $L$ must be $\{a^n \mid n \ \text{ is odd}\}$ $L$ must be $\{a^n \mid n \ \text{ is even}\}$ $L$ must be $\{a^n \mid n \geq 0\}$ Either $L$ must be $\{a^n \mid n \text{ is odd}\}$, or $L$ must be $\{a^n \mid n \text{ is even}\}$
answered
Feb 4, 2015
in
Theory of Computation

2.1k
views
gate2000
theoryofcomputation
easy
regularlanguages
2
answers
2
GATE201040
Consider the languages $L1=\{0^i1^j\ \mid i \neq j\}, $ $L2=\{0^i1^j\mid i=j\},$ $L3=\{0^i1^j \mid i=2j+1\},$ $L4=\{0^i1^j \mid i\neq2j\}$ Only $L2$ is context free. Only $L2$ and $L3$ are context free. Only $L1$ and $L2$ are context free. All are context free
commented
Feb 4, 2015
in
Theory of Computation

3k
views
gate2010
theoryofcomputation
contextfreelanguage
identifyclasslanguage
normal
5
answers
3
GATE19992.20
The minimum number of record movements required to merge five files A (with $10$ records), B (with $20$ records), C (with $15$ records), D (with $5$ records) and E (with $25$ records) is: $165$ $90$ $75$ $65$
answered
Feb 4, 2015
in
Algorithms

3.5k
views
gate1999
algorithms
normal
greedyalgorithm
1
answer
4
Identify the grammar represented by the following production rules
$S \rightarrow C C \\ C \rightarrow c C  d$
commented
Feb 4, 2015
in
Compiler Design

460
views
theoryofcomputation
grammar
1
answer
5
coa
A hard disk with a transfer rate of 10 M bytes/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? (A) 5.0% (B) 1.0% (C) 0.5% (D) 0.1%
comment edited
Feb 3, 2015
in
CO and Architecture

266
views
3
answers
6
GATE200341
Consider the following system of linear equations ... are linearly dependent. For how many values of $\alpha$, does this system of equations have infinitely many solutions? \(0\) \(1\) \(2\) \(3\)
answered
Feb 2, 2015
in
Linear Algebra

3.2k
views
gate2003
linearalgebra
systemofequations
normal
5
answers
7
GATE2014123
Consider the following three statements about link state and distance vector routing protocols, for a large network with $500$ network nodes and $4000$ links. [S1]: The computational overhead in link state protocols is higher than in distance vector protocols. [S2]: A distance vector protocol ( ... $S1$ and $S2$ are true, but $S3$ is false. $S1$ and $S3$ are true, but $S2$ is false.
answered
Feb 1, 2015
in
Computer Networks

4.5k
views
gate20141
computernetworks
routing
distancevectorrouting
linkstaterouting
normal
4
answers
8
GATE2014225
In the diagram shown below, $L1$ is an Ethernet LAN and $L2$ is a TokenRing LAN. An $IP$ packet originates from sender $S$ and traverses to $R$, as shown. The links within each $\text{ISP}$ and across the two $\text{ISP}$s, are all pointtopoint ... of the $\text{TTL}$ field is $32$. The maximum possible value of the $\text{TTL}$ field when $R$ receives the datagram is _______.
answered
Feb 1, 2015
in
Computer Networks

5.9k
views
gate20142
computernetworks
numericalanswers
lantechnologies
ethernet
tokenring
normal
7
answers
9
GATE19982.11
A complete $n$ary tree is one in which every node has $0$ or $n$ sons. If $x$ is the number of internal nodes of a complete $n$ary tree, the number of leaves in it is given by $x(n1) +1$ $xn1$ $xn +1$ $x(n+1)$
answered
Feb 1, 2015
in
DS

2.8k
views
gate1998
datastructure
trees
normal
3
answers
10
GATE199829
Formatting for a floppy disk refers to arranging the data on the disk in contiguous fashion writing the directory erasing the system data writing identification information on all tracks and sectors
answered
Feb 1, 2015
in
Operating System

2.6k
views
gate1998
operatingsystem
disks
normal
3
answers
11
GATE19981.32
A computer has six tape drives, with $n$ processes competing for them. Each process may need two drives. What is the maximum value of $n$ for the system to be deadlock free? $6$ $5$ $4$ $3$
answered
Feb 1, 2015
in
Operating System

4.3k
views
gate1998
operatingsystem
resourceallocation
normal
3
answers
12
GATE19981.29
Which of the following is an example of a spooled device? The terminal used to enter the input data for the C program being executed An output device used to print the output of a number of jobs The secondary memory device in a virtual storage system The swapping area on a disk used by the swapper
answered
Feb 1, 2015
in
Operating System

1.4k
views
gate1998
operatingsystem
iohandling
easy
3
answers
13
GATE19981.19
Which of the following addressing modes permits relocation without any change whatsoever in the code? Indirect addressing Indexed addressing Base register addressing PC relative addressing
answered
Feb 1, 2015
in
CO and Architecture

2.8k
views
gate1998
coandarchitecture
addressingmodes
easy
2
answers
14
GATE19981.11
Regarding the power of recognition of languages, which of the following statements is false? The nondeterministic finitestate automata are equivalent to deterministic finitestate automata. Nondeterministic Pushdown automata are equivalent to ... equivalent to deterministic Turing machines. Multitape Turing machines are available are equivalent to Singletape Turing machines.
answered
Feb 1, 2015
in
Theory of Computation

2k
views
gate1998
theoryofcomputation
easy
nondeterminism
2
answers
15
GATE19981.6
Suppose $A$ is a finite set with $n$ elements. The number of elements in the largest equivalence relation of A is $n$ $n^2$ $1$ $n+1$
answered
Feb 1, 2015
in
Set Theory & Algebra

2.8k
views
gate1998
settheory&algebra
relations
easy
1
answer
16
Which of the following is true?
answered
Feb 1, 2015
in
Compiler Design

163
views
compilerdesign
3
answers
17
GATE19982.1
The rank of the matrix given below is: $\begin{bmatrix} 1 &4 &8 &7\\ 0 &0& 3 &0\\ 4 &2& 3 &1\\ 3 &12 &24 &21 \end{bmatrix}$ $3$ $1$ $2$ $4$
answered
Feb 1, 2015
in
Linear Algebra

1.8k
views
gate1998
linearalgebra
matrices
normal
3
answers
18
GATE201242
Consider the virtual page reference string $\text{1, 2, 3, 2, 4, 1, 3, 2, 4, 1}$ on a demand paged virtual memory system running on a computer system that has main memory size of $3$ page frames which are initially empty. Let $\text{LRU}$, $\text{FIFO}$ ... $\text{OPTIMAL} < \text{FIFO} < \text{LRU}$ $\text{OPTIMAL} = \text{LRU}$ $\text{OPTIMAL} = \text{FIFO}$
answered
Jan 31, 2015
in
Operating System

2.2k
views
gate2012
operatingsystem
pagereplacement
normal
4
answers
19
How many solutions are there to the equation x+y+z=17 ?They are nonnegative integers
answered
Jan 31, 2015
in
Combinatory

1.3k
views
permutationandcombination
3
answers
20
True or False: Relational algebra cannot perform aggregate function
True or False: Relational algebra cannot perform aggregate function
asked
Jan 31, 2015
in
Databases

379
views
relationalalgebra
normal
2
answers
21
GATE200917
Match all items in Group 1 with the correct options from those given in Group 2.Syntax analysis ... $\text{P3, Q4, R1, S2}$ $\text{P2, Q1, R4, S3}$
answered
Jan 31, 2015
in
Compiler Design

1.8k
views
gate2009
compilerdesign
easy
compilationphases
4
answers
22
GATE201136
Consider evaluating the following expression tree on a machine with loadstore architecture in which memory can be accessed only through load and store instructions. The variables $a, b, c, d,$ and $e$ are initially stored in memory. The binary operators used in this ... be stored in memory, what is the minimum number of registers needed to evaluate this expression? $2$ $9$ $5$ $3$
answered
Jan 31, 2015
in
Compiler Design

4.5k
views
gate2011
compilerdesign
registerallocation
normal
1
answer
23
Thomas Write Rule
answer selected
Jan 26, 2015
in
Databases

1.7k
views
1
answer
24
B+ Trees Problem
Construct a B+tree for the following set of key values: (2, 3, 5, 7, 11, 17, 19, 23, 29, 31) Assume that the tree is initially empty and values are added in ascending order. What will be the root of the constructed B+ tree if the number of pointers that will fit in one node is six? (A) 7, 11 (B) 7, 19 (C) 19 (D) 11 Ans is B...Please explain.....
answer selected
Jan 25, 2015
in
Algorithms

1.7k
views
2
answers
25
C Programming
answered
Jan 25, 2015
in
Programming

134
views
4
answers
26
GATE200768, ISRO201673
The message $11001001$ is to be transmitted using the CRC polynomial $x^3 +1$ to protect it from errors. The message that should be transmitted is: $11001001000$ $11001001011$ $11001010$ $110010010011$
commented
Jan 24, 2015
in
Computer Networks

7.1k
views
gate2007
computernetworks
errordetection
crcpolynomial
normal
isro2016
2
answers
27
GATE20142GA1
Choose the most appropriate phrase from the options given below to complete the following sentence. India is a postcolonial country because it was a former British colony Indian Information Technology professionals have colonized the world India does not follow any colonial practices India has helped other countries gain freedom
answered
Jan 23, 2015
in
Verbal Ability

644
views
gate20142
verbalability
mostappropriateword
easy
3
answers
28
Consider the following statement about indexes
Consider the following statement (i) Primary index is always sparse (ii) Secondary index may or may not be dense Which of the above statement is/are false? A)Only (i) B)Only (ii) C)Both (i) and (ii) D)None of these
commented
Jan 23, 2015
in
Databases

1.6k
views
databases
indexing
4
answers
29
GATE2014347
The value of the integral given below is $\int \limits_0^{\pi} \: x^2 \: \cos x\:dx$ $2\pi$ $\pi$ $\pi$ $2\pi$
answered
Jan 22, 2015
in
Calculus

1.9k
views
gate20143
calculus
limits
integration
normal
3
answers
30
which one is not self complemetry code
answered
Jan 19, 2015
in
Digital Logic

183
views
2
answers
31
What is the Generating function G(z) for the sequence of Fibonacci numbers?
Actually i want to know the method for finding Generating function.
answered
Jan 19, 2015
in
Algorithms

1.4k
views
3
answers
32
GATE2014332
An operating system uses shortest remaining time first scheduling algorithm for preemptive scheduling of processes. Consider the following set of processes with their arrival times and CPU burst times (in milliseconds): ... The average waiting time (in milliseconds) of the processes is ______.
answered
Jan 19, 2015
in
Operating System

1.7k
views
gate20143
operatingsystem
processschedule
numericalanswers
normal
2
answers
33
GATE201323
Function $f$ is known at the following points: $x$ 0 0.3 0.6 0.9 1.2 1.5 1.8 2.1 2.4 2.7 3.0 $f(x)$ 0 0.09 0.36 0.81 1.44 2.25 3.24 4.41 5.76 7.29 9.00 The value of $\int_{0}^{3} f(x) \text{d}x$ computed using the trapezoidal rule is (A) 8.983 (B) 9.003 (C) 9.017 (D) 9.045
answered
Jan 15, 2015
in
Numerical Methods

821
views
gate2013
numericalmethods
trapezoidalrule
nongate
5
answers
34
GATE201321
Which one of the following expressions does NOT represent exclusive NOR of $x$ and $y$? $xy + x′ y′$ $x\oplus y′$ $x′\oplus y$ $x′\oplus y′$
answered
Jan 15, 2015
in
Digital Logic

2k
views
gate2013
digitallogic
easy
booleanalgebra
3
answers
35
GATE2014235
Let $\langle M \rangle$ be the encoding of a Turing machine as a string over $\Sigma=\left\{0,1\right\}$ ... $L$ is: decidable and recursively enumerable undecidable but recursively enumerable undecidable and not recursively enumerable decidable but not recursively enumerable
commented
Jan 13, 2015
in
Theory of Computation

9.3k
views
gate20142
theoryofcomputation
turingmachine
normal
4
answers
36
GATE2014249
The number of distinct positive integral factors of $2014$ is _____________
commented
Jan 13, 2015
in
Set Theory & Algebra

3k
views
gate20142
settheory&algebra
easy
numericalanswers
numbertheory
3
answers
37
GATE2014111
Let $G$ be a graph with $n$ vertices and $m$ edges.What is the tightest upper bound on the running time of Depth First Search on $G$, when $G$ is represented as an adjacency matrix? $\Theta(n)$ $\Theta(n+m)$ $\Theta(n^2)$ $\Theta(m^2)$
answered
Jan 12, 2015
in
Algorithms

2.3k
views
gate20141
algorithms
graphalgorithms
normal
2
answers
38
GATE2014118
Match the following: 1) Waterfall model a) Specifications can be developed incrementally 2) Evolutionary model b) Requirements compromises are inevitable 3) Componentbased software engineering c) Explicit recognition of risk 4) Spiral development d) Inflexible partitioning of the project into stages 1a, 2b, 3c, 4d 1d, 2a, 3b, 4c 1d, 2b, 3a, 4c 1c, 2a, 3b, 4d
answered
Jan 12, 2015
in
IS&Software Engineering

712
views
gate20141
is&softwareengineering
normal
6
answers
39
GATE201240
Consider the directed graph shown in the figure below. There are multiple shortest paths between vertices $S$ and $T$. Which one will be reported by Dijkstra’s shortest path algorithm? Assume that, in any iteration, the shortest path to a vertex $v$ is updated only when a strictly shorter path to $v$ is discovered. $\text{SDT}$ $\text{SBDT}$ $\text{SACDT}$ $\text{SACET}$
commented
Jan 12, 2015
in
Algorithms

6.1k
views
gate2012
algorithms
graphalgorithms
normal
1
answer
40
A fair coin is tossed 100 times. The Probability of getting 50 heads is close to one of the following numbers: a) 0.001 b)0.1 c)0.3 d)0.4
answer selected
Jan 10, 2015
in
Probability

378
views
50,648
questions
56,459
answers
195,337
comments
100,190
users