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 commenter commenter
User commenter commenter
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User commenter commenter
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
4
answers
1
ISRO201431
A IP packet has arrived in which the fragmentation offset value is 100,the value of HLEN is 5 and the value of total length field is 200. What is the number of the last byte? 194 394 979 1179
commented
Jan 3
in
Computer Networks

4.6k
views
computernetworks
ippacket
isro2014
2
answers
2
ISRO201411
An aggregation association is drawn using which symbol? A line which loops back on to the same table A small open diamond at the end of a line connecting two tables A small closed diamond at the end of a line connecting two tables A small closed triangle at the end of a line connecting two tables
commented
Jan 3
in
Databases

3.2k
views
isro2014
databases
2
answers
3
ISRO20144
Consider the following pseudo code while (m<n) if (x>y ) and (a<b) then a=a+1 y=y1 end if m=m+1 end while What is cyclomatic complexity of the above pseudo code? 2 3 4 5
commented
Jan 3
in
IS&Software Engineering

4k
views
isro2014
is&softwareengineering
cyclomaticcomplexity
nongate
2
answers
4
ISRO201326
Calculate the order of leaf ($P_{leaf}$) and non leaf (P) nodes of a $B^{+}$ tree based on the information given below. Search key field = $12$ field Record pointer = $10$ bytes Block pointer = $8$ bytes Block size = $1$KB $P_{leaf}$ = 51 & p = 46 $P_{leaf}$ = 47 & p = 52 $P_{leaf}$ = 46 & p = 51 $P_{leaf}$ = 52 & p = 47
commented
Jan 2
in
Databases

3.2k
views
isro2013
databases
btree
5
answers
5
ISRO201311
When two BCD numbers $0x 14$ and $0x 08$ are added what is the binary representation of the resultant number? $0x 22$ $0x 1c$ $0x 16$ Results in overflow.
commented
Jan 2
in
Digital Logic

3.9k
views
isro2013
numberrepresentation
bcd
5
answers
6
ISRO201318
How many check bits are required for $16$ bit data word to detect $2$ bit errors and single bit correction using hamming code? $5$ $6$ $7$ $8$
commented
Jan 2
in
Computer Networks

4.8k
views
isro2013
errordetection
1
answer
7
UGCNETJune2015III53
In _____ allocation method for disk block allocation in a file system, insertion and deletion of blocks in a file is easy Index Linked Contiguous Bit Map
commented
Dec 31, 2019
in
Operating System

947
views
ugcnetjune2015iii
operatingsystem
filemanagement
2
answers
8
UGCNETJune2019II44
Which of the following are NOT shared by the threads of the same process? Stack Registers Address space Message queue a and d b and c a and b a, b and c
commented
Dec 31, 2019
in
Operating System

197
views
ugcnetjune2019ii
threads
10
answers
9
ISRO201530
Semaphores are used to solve the problem of Race Condition Process Synchronization Mutual Exclusion None of the above I and II II and III All of the above None of the above
commented
Dec 31, 2019
in
Operating System

9.1k
views
semaphore
isro2015
1
answer
10
array in cache
commented
Dec 17, 2019
in
CO and Architecture

80
views
3
answers
11
ISI2017MMA13
An even function $f(x)$ has left derivative $5$ at $x=0$. Then the right derivative of $f(x)$ at $x=0$ need not exist the right derivative of $f(x)$ at $x=0$ exists and is equal to $5$ the right derivative of $f(x)$ at $x=0$ exists and is equal to $5$ none of the above is necessarily true
commented
Dec 1, 2019
in
Calculus

333
views
isi2017mma
engineeringmathematics
calculus
differentiation
1
answer
12
MadeEasy Test Series: Operating System  Process Synchronization
What is the main reason for RACE condition while synchronzing the process? A)The two processes trying to update the variable at same time. B) More than one process entering into the critical section at same time. C)Mutual Exclusion condition not satisfies. D)All of the above
commented
Nov 30, 2019
in
Operating System

123
views
operatingsystem
processsynchronization
madeeasytestseries
4
answers
13
UGCNETJune2012II5
Networks that use different technologies can be connected by using Packets Switches Bridges Routers
commented
Nov 30, 2019
in
Computer Networks

1.8k
views
ugcnetjune2012ii
computernetworks
2
answers
14
UGCNETJune2014II39
An algorithm is made up of $2$ modules $M_{1}$ and $M_{2}$ . If time complexity of modules $M_{1}$ and $M_{2}$ are $h(n)$ and $g(n)$ respectively, the time complexity of the algorithm is $\min (h(n), g(n))$ $\max (h(n), g(n))$ $h(n) + g(n)$ $h(n) * g(n)$
commented
Nov 29, 2019
in
Algorithms

344
views
ugcnetjune2014ii
algorithms
timecomplexity
1
answer
15
UGCNETJune2014II18
Which of the following statement(s) is (are) not correct ? i. The $2$’s complement of $0$ is $0$. ii. In $2$’s complement, the left most bit cannot be used to express a quantity. iii. For an $n$bit word ($2$’s complement) ... ’s of positive numbers and $0$’s of the negative numbers. $i$ & $iv$ $i$ & $ii$ $iii$ $iv$
commented
Nov 29, 2019
in
Digital Logic

1.2k
views
ugcnetjune2014ii
digitallogic
numberrepresentation
7
answers
16
Heap..
1)The number of min heap trees are possible with 15 elements such that every leaf node must be greater than all nonleaf nodes of the tree are ________.  2)The number of min heap trees are possible with 15 elements_________________
commented
Nov 27, 2019
in
Programming

1.3k
views
heap
5
answers
17
GATE2015135
What is the output of the following C code? Assume that the address of $x$ is $2000$ (in decimal) and an integer requires four bytes of memory. int main () { unsigned int x [4] [3] = {{1, 2, 3}, {4, 5, 6}, {7, 8, 9}, {10, 11, 12}}; printf ("%u, %u, %u", x + 3, *(x + 3), *(x + 2) + 3); } $2036, 2036, 2036$ $2012, 4, 2204$ $2036, 10, 10$ $2012, 4, 6$
commented
Nov 26, 2019
in
Programming

8.3k
views
gate20151
programming
programminginc
normal
1
answer
18
#self doubt
Let a schedule be Strict Recoverable then it will suffer from which problem? a) ww problem b) rw problem c)wr problem d) Lost update problem
commented
Nov 23, 2019
in
Databases

146
views
transactionandconcurrency
2
answers
19
GATE199110a
Consider the following grammar for arithmetic expressions using binary operators $$ and $/$ which are not associative $E \rightarrow E T\mid T$ $T \rightarrow T/F\mid F$ $F \rightarrow (E) \mid id$ ($E$ is the start symbol) Is the grammar unambiguous? Is so, what is the relative precedence between $$ and $/$? If not, give an unambiguous grammar that gives $/$ precedence over $$.
commented
Nov 23, 2019
in
Compiler Design

1.3k
views
gate1991
grammar
compilerdesign
normal
descriptive
3
answers
20
Interrupt I/O
Consider a system employing interrupt driven input/output for a particular device that transfers data at an average of 16 KB/s on a continuous basis. Assume that interrupt processing takes 50 μsec (i.e., the jump to the interrupt service routine (ISR), ... of processor time is consumed by this input/output device if it interrupt for every byte is _______ (Upto 3 decimal places).
commented
Nov 22, 2019
in
CO and Architecture

1.6k
views
coandarchitecture
interrupts
2
answers
21
Computer Architecture > Interrupt Driven I/O
Consider a system, that uses Interrupt Driven I/O for a particular device which has a data transfer rate of 10 KBPS . The processing of the interrupt ( Jump, Execute and Return to the main program ) takes 250 us . What percentage of CPU time is consumed by I/O device , if I/O device interrupts for every 2 bytes ?
commented
Nov 22, 2019
in
CO and Architecture

1.1k
views
coandarchitecture
interrupts
7
answers
22
number of WAR dependencies
commented
Nov 21, 2019
in
CO and Architecture

2.1k
views
coandarchitecture
datadependences
2
answers
23
pipeline_hazard
no of RAW,WAR and WAW ?
commented
Nov 21, 2019
in
CO and Architecture

3.2k
views
coandarchitecture
datahazards
datadependences
1
answer
24
quick sort
You have an array of n elements. Suppose you implement quick sort by always choosing the central element of the array as the pivot. Then the tightest lower bound for the best case performance is a) O(n2) b) O(nlogn) c) Θ(nlogn) d) O(n3)
commented
Nov 20, 2019
in
Algorithms

342
views
quicksort
algorithms
sorting
timecomplexity
5
answers
25
TIFR2013A14
An unbiased die is thrown $n$ times. The probability that the product of numbers would be even is $\dfrac{1}{(2n)}$ $\dfrac{1}{[(6n)!]}$ $1  6^{n}$ $6^{n}$ None of the above.
answered
Nov 11, 2019
in
Probability

530
views
tifr2013
probability
2
answers
26
GATE20132
Suppose $p$ is the number of cars per minute passing through a certain road junction between $5$ PM and $6$ PM, and $p$ has a Poisson distribution with mean $3$. What is the probability of observing fewer than $3$ cars during any given minute in this interval? $\dfrac{8}{(2e^{3})}$ $\dfrac{9}{(2e^{3})}$ $\dfrac{17}{(2e^{3})}$ $\dfrac{26}{(2e^{3})}$
commented
Nov 10, 2019
in
Probability

3k
views
gate2013
probability
poissondistribution
normal
3
answers
27
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\)
commented
Nov 8, 2019
in
Linear Algebra

3.5k
views
gate2003
linearalgebra
systemofequations
normal
3
answers
28
TIFR2012B5
Let $R$ be a binary relation over a set $S$. The binary relation $R$ ... $\sqsubseteq $ is an equivalence relation and a well order. $\sqsubseteq $ is neither a partial order nor an equivalence relation.
commented
Nov 5, 2019
in
Set Theory & Algebra

525
views
tifr2012
settheory&algebra
partialorder
6
answers
29
GATE2016128
A function $f: \Bbb{N^+} \rightarrow \Bbb{N^+}$ , defined on the set of positive integers $\Bbb{N^+}$,satisfies the following properties: $f(n)=f(n/2)$ if $n$ is even $f(n)=f(n+5)$ if $n$ is odd Let $R=\{ i \mid \exists{j} : f(j)=i \}$ be the set of distinct values that $f$ takes. The maximum possible size of $R$ is ___________.
commented
Nov 4, 2019
in
Set Theory & Algebra

6.6k
views
gate20161
settheory&algebra
functions
normal
numericalanswers
3
answers
30
GATE2014349
Consider the set of all functions $f:\{0,1, \dots,2014\} \to \{0,1,\dots, 2014\}$ such that $ f\left(f\left(i\right)\right)=i$, for all $0 \leq i \leq 2014$. Consider the following statements: $P$ ... the following is CORRECT? $P, Q$ and $R$ are true Only $Q$ and $R$ are true Only $P$ and $Q$ are true Only $R$ is true
commented
Nov 4, 2019
in
Set Theory & Algebra

5k
views
gate20143
settheory&algebra
functions
normal
0
answers
31
Algorithms: Test series Complexity
operations on the list in this order insert, O(n log n) decrease key, O(n) find operations. What is the time complexity of all these operations put together? A O(n) B O(n2) C O(n2 log n) D O$(sqrt(n))$
commented
Nov 2, 2019
in
Algorithms

125
views
algorithms
timecomplexity
2
answers
32
ISI2004MIII13
Let $X =\frac{1}{1001}+\frac{1}{1002}+\frac{1}{1003}+\ldots+\frac{1}{3001}$. Then $X< 1$ $X>\frac{3}{2}$ $1< X< \frac{3}{2}$ none of the above
commented
Nov 2, 2019
in
Calculus

601
views
isi2004
engineeringmathematics
integration
1
answer
33
Ullman (TOC) Edition 3 Exercise 7.1 Question 1 (Page No. 275)
Find a grammar equivalent to $S\rightarrow ABCA$ $A\rightarrow a$ $B\rightarrow BCAB$ $C\rightarrow aBb$ with no useless symbols.
commented
Nov 1, 2019
in
Theory of Computation

29
views
ullman
theoryofcomputation
contextfreegrammars
3
answers
34
IIITHPGEE 2016
An anthropologist is visiting the island of knights and knaves one after the other.. This particular island is a very peculiar place, for it has only two kinds of inhabitants, namely, knights and knaves! Now, knights always tell the truth and knaves always lie! There are cluster of ... B: A is a knave, and this is the island of Maya. Is this the island of Maya? What are A and B ?
commented
Oct 31, 2019
in
Verbal Ability

602
views
puzzles
puzzle
iiithpgee
verbalability
5
answers
35
GATE2007IT25
What is the largest integer $m$ such that every simple connected graph with $n$ vertices and $n$ edges contains at least $m$ different spanning trees ? $1$ $2$ $3$ $n$
commented
Oct 30, 2019
in
Graph Theory

5.4k
views
gate2007it
graphtheory
spanningtree
normal
0
answers
36
ME Test Series
commented
Oct 30, 2019
in
Compiler Design

34
views
5
answers
37
GATE200414
Consider the following relation schema pertaining to a students database: Students (rollno, name, address) Enroll (rollno, courseno, coursename) where the primary keys are shown underlined. The number of tuples in the student and Enroll tables are $120$ and $8$ respectively. What are the ... in (Student * Enroll), where *' denotes natural join? $8, 8$ $120, 8$ $960, 8$ $960, 120$
commented
Oct 27, 2019
in
Databases

6.3k
views
gate2004
databases
easy
joins
naturaljoin
2
answers
38
GATE199013a
Consider the heightbalanced tree $T_{t}$ with values stored at only the leaf nodes, shown in Fig.4. (i) Show how to merge to the tree, $T_{1}$ elements from tree $T_{2}$ shown in Fig.5 using node D of tree $T_{1}$. (ii) What is the time complexity of ... $T_{1}$ and $T_{2}$ are of height $h_{1}$ and $h_{2}$ respectively, assuming that rotation schemes are given. Give reasons.
answered
Oct 25, 2019
in
DS

796
views
gate1990
descriptive
datastructures
trees
3
answers
39
GATE200438, ISRO200927
Assume that the operators $+, , \times$ are left associative and $^\hat{}$ is right associative. The order of precedence (from highest to lowest) is $^\hat{}, \times, +, $. The postfix expression corresponding to the infix expression $a+ b \times cd^\hat{}e^\hat{}f$ ... $ab+c\times de^\hat{}f^\hat{}$ $+a\times bc^\hat{}{}^\hat{}def$
commented
Oct 25, 2019
in
DS

3.8k
views
gate2004
stack
isro2009
2
answers
40
GATE200585b
Consider the following floatingpoint format. Mantissa is a pure fraction in signmagnitude form. The normalized representation for the above format is specified as follows. The mantissa has an implicit $1$ preceding the binary (radix) point. Assume that only $0's$ are padded in while shifting a field ... the above number $(0.239 \times 2^{13})$ is: $0A\;20$ $11\;34$ $49\;D0$ $4A\;E8$
commented
Oct 25, 2019
in
Digital Logic

1.9k
views
gate2005
digitallogic
numberrepresentation
floatingpointrepresentation
normal
50,741
questions
57,245
answers
198,020
comments
104,614
users