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
Answers 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
+29
votes
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
votes
2
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
+18
votes
3
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
0
votes
4
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.6k
views
gate20141
computernetworks
routing
distancevectorrouting
linkstaterouting
normal
+16
votes
5
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

6k
views
gate20142
computernetworks
numericalanswers
lantechnologies
ethernet
tokenring
normal
+2
votes
6
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
votes
7
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.7k
views
gate1998
operatingsystem
disks
normal
+14
votes
8
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.4k
views
gate1998
operatingsystem
resourceallocation
normal
+15
votes
9
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
+1
vote
10
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
0
votes
11
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
+14
votes
12
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.9k
views
gate1998
settheory&algebra
relations
easy
+5
votes
13
Which of the following is true?
answered
Feb 1, 2015
in
Compiler Design

164
views
compilerdesign
+23
votes
14
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
+15
votes
15
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
+9
votes
16
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
+35
votes
17
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
+27
votes
18
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
0
votes
19
C Programming
answered
Jan 25, 2015
in
Programming

134
views
+5
votes
20
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

645
views
gate20142
verbalability
mostappropriateword
easy
+2
votes
21
Thomas Write Rule
answered
Jan 23, 2015
in
Databases

1.7k
views
+16
votes
22
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
+5
votes
23
which one is not self complemetry code
answered
Jan 19, 2015
in
Digital Logic

183
views
+1
vote
24
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
+2
votes
25
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
+1
vote
26
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

825
views
gate2013
numericalmethods
trapezoidalrule
nongate
+2
votes
27
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
+14
votes
28
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
+4
votes
29
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
0
votes
30
is canonical cover and minimal cover the same thing?
Is canonical cover and minimal cover the same thing?
answered
Jan 8, 2015
in
Databases

2.1k
views
–6
votes
31
GATE2006IT20
Which of the following statement(s) is TRUE? A hash function takes a message of arbitrary length and generates a fixed length code. A hash function takes a message of fixed length and generates a code of variable length. A hash function may give the same hash value for distinct messages. I only II and III only I and III only II only
answered
Jan 1, 2015
in
DS

1.4k
views
gate2006it
datastructure
hashing
normal
0
votes
32
Answer the following question
Please show steps for the question 20 and 14.
answered
Dec 19, 2014
in
Algorithms

68
views
+4
votes
33
Find the dual of boolean algebra expresion S dual:
S: (a^b) = a if a<=b a) S* :(a^b)=a if a<=b b) S* :(aVb)=a if a<=b c) S* :(a^b)=a if a>=b d) S* :(aVb)=a if a>=b
answered
Dec 16, 2014
in
Set Theory & Algebra

161
views
sets
settheory&algebra
0
votes
34
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.....
answered
Dec 14, 2014
in
Algorithms

1.7k
views
+32
votes
35
GATE200610
In a binary max heap containing $n$ numbers, the smallest element can be found in time $O(n)$ $O(\log n)$ $O(\log \log n)$ $O(1)$
answered
Oct 19, 2014
in
DS

3.5k
views
gate2006
datastructure
heap
easy
+7
votes
36
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
answered
Oct 19, 2014
in
Databases

1.6k
views
databases
indexing
+1
vote
37
Concurrency
Consider the following sequential code which is executed in a multiprogramming mode by assuming that each statement can execute independently to achieve the concurrency. If any statement dependent on other statements then those statements will be executed in the order. S1: a = b + c; ... execute concurrently at the beginning of execution? a)S3 and S4 b)S2 and S3 c)S1 and S2 d)S2 and S4
answered
Oct 1, 2014
in
Operating System

580
views
operatingsystem
concurrency
0
votes
38
Sorting under restriction
Array of n elements with first 10 and last 50 elements unsorted..find an algo which runs faster a)merge sort b)quick sort c)insertion sort d)bubble sort Explain
answered
Sep 25, 2014
in
Algorithms

1.1k
views
algorithms
sorting
normal
+18
votes
39
GATE19911,ix
If the binary tree in figure is traversed in inorder, then the order in which the nodes will be visited is ______
answered
Sep 13, 2014
in
DS

1.1k
views
gate1991
binarytree
easy
datastructure
+31
votes
40
GATE199101iii
Consider the number given by the decimal expression: $16^3*9 + 16^2*7 + 16*5+3$ The number of $1’s$ in the unsigned binary representation of the number is ______
answered
Sep 13, 2014
in
Digital Logic

1.2k
views
gate1991
digitallogic
numberrepresentation
normal
Page:
1
2
next »
50,645
questions
56,601
answers
195,856
comments
102,231
users