The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
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
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Recent activity by Shaik Masthan
User Shaik Masthan
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Shaik Masthan
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
answers
1
GATEBOOK2019 Mock Test165
Maximum length of the cable for transmitting data at a rate of $500$ Mbps in an Ethernet LAN with frames of size $X$ bits is $2000$ meters then $X$ value is ________. (Assume the signal speed in the cable to be $2,00,000$ km/s.)
recategorized
2 hours
ago
in
Computer Networks

33
views
gb2019mock1
numericalanswers
0
answers
2
GATEBOOK2019 Mock Test163
Suppose datagrams are limited to $1,500$ bytes (including header) between source Host A and destination Host B. Assuming a $20$byte IP header and a $20$byte TCP header, how many datagrams would be required to send an $MP3$ consisting of $4$ million bytes? $2900$ $2740$ $3200$ $4200$
recategorized
2 hours
ago
in
Computer Networks

62
views
gb2019mock1
networklayer
0
answers
3
GATEBOOK2019 Mock Test160
Given the following Deterministic Finite Automaton (DFA) $A_1$ over $Σ= \{a, b\}$ Which of the following statements about $A_1$ is FALSE? $aabb \in L(A_1)$ $bbaa \in L(A_1)$ $A_1$ accepts precisely the words where the symbol $a$ occurs before the symbol $b.$ $A_1$ accepts precisely the words with an odd number of $a’s$ or at least one $b.$
recategorized
2 hours
ago
in
Theory of Computation

12
views
gb2019mock1
finiteautomata
0
answers
4
GATEBOOK2019 Mock Test159
The language $\left \{ a^{n}ba^{m}: n,m \geq 0\right \}$ over alphabet $\{a,b\}$ is Regular Contextfree but not Regular Not Context free Finite
recategorized
2 hours
ago
in
Theory of Computation

17
views
gb2019mock1
identifyclasslanguage
1
answer
5
GATEBOOK2019 Mock Test130
Which of the following statements about E/R models is/are correct? Manytomany relationships cannot be represented in E/Rdiagrams Relationship sets can have attributes of their own. All manytoone relationships are represented by a relationship between a weak and a nonweak entity set. II only. III only. II and III only. I and II only
commented
2 hours
ago
in
Databases

36
views
gb2019mock1
erdiagram
1
answer
6
GATEBOOK2019 Mock Test158
Given TMs $M_{1},M_{2},M_{3}, \ldots M_{n}$ and $L = \{x \mid \text{Every }M_{i} \text{ halts on input }x \},$ which of the following is TRUE about $L?$ $L$ is recursively enumerable but not recursive $L$ is Recursive but not Context free $L$ is Not Recursively Enumerable $L$ is regular
recategorized
2 hours
ago
in
Theory of Computation

62
views
gb2019mock1
identifyclasslanguage
recursiveandrecursivelyenumerablelanguages
0
answers
7
GATEBOOK2019 Mock Test157
Consider the following two transactions: $T1 = w1(C) r1(A) w1(A) r1(B) w1(B);$ $T2 = r2(B) w2(B) r2(A) w2(A)$ Say our scheduler performs exclusive locking only (i.e., no shared locks). For each of the following three instances of transactions $T1$ and $T2$ annotated with lock and ... A) r2(A) w2(A) Commit U2(A) U2(B) Only (a) Only (a) and (b) Only (a) and (c) (a),(b),(c)
recategorized
2 hours
ago
in
Databases

48
views
gb2019mock1
transactionandconcurrency
1
answer
8
GATEBOOK2019 Mock Test156
A Btree of order $m$ is a tree which satisfies the following properties: Every node has at most $m$ children. Every node (except root) has at least $ \lceil m/2 \rceil$ children The maximum number of internal nodes an order $4$ Btree can have with $20$ keys is _____
recategorized
2 hours
ago
in
Databases

115
views
gb2019mock1
numericalanswers
btree
0
answers
9
GATEBOOK2019 Mock Test154
If Tree1 and Tree2 are the trees given below, which traversals of Tree1 and Tree2, respectively, will produce the same sequence of node names? preorder & postorder postorder & inorder postorder & postorder inorder & inorder
recategorized
2 hours
ago
in
DS

15
views
gb2019mock1
treetraversal
1
answer
10
GATEBOOK2019 Mock Test150
To compute the matrix product $M1M2$, where $M1$ has $p$ rows and $q$ columns and where $M2$ has $q$ rows and $r$ columns, takes time proportional to $pqr$, and the result is a matrix of $p$ rows and $r$ columns. Consider the product of three matrices $N1N2N3$ that have, respectively, $w$ ... the same time $1/x + 1/z < 1/w + 1/y$ $x > y$ $1/w + 1/x < 1 /y+ 1/z$
recategorized
2 hours
ago
in
Algorithms

39
views
gb2019mock1
matrixmultiplication
dynamicprogramming
0
answers
11
GATEBOOK2019 Mock Test149
Consider a data type whose elements are integers and whose operations are INSERT, DELETE, and FINDCLOSEST, with FINDCLOSEST(y) deﬁned to be some element x in the current set such thatxy ≤ xiy for all xi in the current set. Let ... following data structures would be best to use in order to minimizeT? A sorted list An unordered list An implicit heap An AVL tree
recategorized
2 hours
ago
in
Algorithms

38
views
gb2019mock1
datastructure
1
answer
12
GATEBOOK2019 Mock Test145
Below is a precedence graph for a set of tasks to be executed on a parallel processing system S. Efficiency is defined as the ratio between the speedup and the number of processors. (The speedup is defined as the ratio of the time taken to perform a set of tasks on a single ... , what is the efficiency of this precedence graph on S ? $25 \%$ $33 1/3 \%$ $50 \%$ $100 \%$
recategorized
2 hours
ago
in
CO & Architecture

65
views
gb2019mock1
1
answer
13
GATEBOOK2019 Mock Test144
A certain pipelined RISC machine has $8$ generalpurpose registers $R0, R1, \dots , R7$ and supports the following operations. ADD Rs1, Rs2, Rd /* Add Rs1 to Rs2 and put the sum in Rd */ MUL Rs1, Rs2, Rd /* Multiply Rs1 by Rs2 and put the product ... number of clock cycles required for an operation sequence that computes the value of AB + ABC + BC ? $5$ $6$ $7$ $8$
recategorized
2 hours
ago
in
CO & Architecture

67
views
gb2019mock1
pipelining
0
answers
14
GATEBOOK2019 Mock Test143
Consider a logical address space of $64$ pages of $1024$ words each mapped on to physical memory of $32$ frames. The number of bits in physical address $+$ the no of bits in logical address is?
recategorized
2 hours
ago
in
Operating System

34
views
gb2019mock1
numericalanswers
coandarchitecture
1
answer
15
GATEBOOK2019 Mock Test140
The number of graphs possible with $5$ vertices and $3$ edges is ____ $10$ $15$ $5$ $120$
recategorized
2 hours
ago
in
Graph Theory

63
views
gb2019mock1
1
answer
16
GATEBOOK2019 Mock Test139
Consider the collection of all un directed graphs with $10$ nodes and $6$ edges. Let M and m, respectively, be the maximum and minimum number of connected components in any graph in the collection. If a graph has no self loops and there is at most one edge between any pair of nodes, which of the ... $M = 10, \: m = 1$ $M = 7, \: m = 4$ $M = 6, \: m = 4$
recategorized
2 hours
ago
in
Graph Theory

30
views
gb2019mock1
0
answers
17
GATEBOOK2019 Mock Test138
Suppose that $P(x,y)$, means "$x$ is a parent of $y$" and $M (x)$ means "$x$ is male". If $F(v,w)$ equals $M(v)\wedge \exists x\exists y(p(x,y) \wedge p(x,v) \wedge (y \neq v) \wedge p(y,w))$, what is the meaning of the expression $F(v,w)$? $v$ is a brother of $w$ $v$ is a nephew of $w$ $v$ is an uncle of $w$ $v$ is a grandfather of $w$
recategorized
2 hours
ago
in
Mathematical Logic

12
views
gb2019mock1
0
answers
18
GATEBOOK2019 Mock Test137
In an examination there are $80$ questions each having four choices. Exactly one of these four choices is correct and the other three are wrong. A student is awarded $1$ mark for each correct answer, and $0.25$ for each wrong answer. If a student ticks ... each question randomly, then the expected value of his/her total marks in the examination is. $15$ $0$ $5$ $20$
recategorized
2 hours
ago
in
Probability

33
views
gb2019mock1
expectation
1
answer
19
GATEBOOK2019 Mock Test128
If the expression $((2 + 3) * 4 + 5 * (6 + 7) * 8) + 9$ is evaluated with $*$ having precedence over $+$, then the value obtained is the same as the value of which of the following prefix expressions? $+ + * + 2 3 4 * * 5 + 6 7 8 9$ $+ * + + 2 3 4 * * 5 + 6 7 8 9$ $* + + 2 3 4 * * 5 + + 6 7 8 9$ $* + + + 2 3 4 * * 5 + 6 7 8 9$
recategorized
2 hours
ago
in
DS

19
views
gb2019mock1
stack
prefixnotation
0
answers
20
GATEBOOK2019 Mock Test125
Which of the following sorting algorithm has a running time that is least dependent on the initial ordering of the inputs? Quick sort. Insertion sort. Merge sort Selection sort
recategorized
2 hours
ago
in
Algorithms

37
views
gb2019mock1
sorting
0
answers
21
GATEBOOK2019 Mock Test124
Which of these statements is not true about an AVL tree T containing n nodes? Rotations may be required during key insertion to keep T balanced. The height of T cannot exceed $1.5 * \log_2n$. The number of interior nodes in T cannot exceed the ... of that node's subtree, then T can be used to perform order statistic searches in O(lg n) asymptotic algorithmic complexity.
recategorized
2 hours
ago
in
DS

26
views
gb2019mock1
avltree
0
answers
22
GATEBOOK2019 Mock Test122
Which of the following conditions can be expressed by a Boolean formula in the Boolean variables $p1,p2,p3,p4$ and the connectives ∧ ∨, (without ¬ )? At least three of $p1,p2,p3,p4$ are true. Exactly three of $p1,p2,p3,p4$ are true. An even number of $p1,p2,p3,p4$ are true. I only II only III only I and III
recategorized
2 hours
ago
in
Digital Logic

69
views
gb2019mock1
booleanalgebra
kmap
0
answers
23
GATEBOOK2019 Mock Test121
What is the decimal value of $(AB.56)_{16}$ $176.80$ $171.3125$ $182.80$ $176.3125$
recategorized
2 hours
ago
in
Digital Logic

25
views
gb2019mock1
numberrepresentation
0
answers
24
GATEBOOK2019 Mock Test117
Which of the following statements is FALSE? Each thread has its own stack Starvation implies deadlock Smaller page size increases the page table size User level process can not modify its own page table entries
recategorized
2 hours
ago
in
Operating System

15
views
gb2019mock1
threads
deadlock
paging
0
answers
25
GATEBOOK2019 Mock Test116
Which of the following can make a processor transition from user mode to kernel mode? A user process executing trap instruction A user process causing an exception Receiving an interrupt All of the above
recategorized
2 hours
ago
in
CO & Architecture

19
views
gb2019mock1
interrupts
0
answers
26
GATEBOOK2019 Mock Test147
A $1$ to $8$ multiplexer with data input $D_{in}$, address inputs $S_0, S_1, S_2$ (with $S_0$ as the LSB) and $\overline{Y}_0$ to $\overline{Y}_7$ as the eight multiplexed output, is to be designed using two $2 \text{to} 4$ decoders (with enable input $\overline{E}$ ... be $S_2, D_{in}, S_0, S_1$ $S_1, D_{in}, S_0, S_2$ $D_{in}, S_0, S_1. S_2$ $D_{in}, S_2, S_0, S_1$
commented
2 hours
ago
in
Others

46
views
gb2019mock1
digitallogic
demultiplexer
0
answers
27
GATEBOOK2019 Mock Test111
Let $S, T,$ and $U$ be nonempty sets, and let $f : S\to T$ and $g : T \to U$ be functions such that the function $g o f : S \to U$ is onetoone (injective). Which of the following must be TRUE? $f$ is onetoone. $f$ is onto. $g$ is onetoone. $g$ is onto.
retagged
2 hours
ago
in
Others

45
views
gb2019mock1
discretemathematics
settheory&algebra
1
answer
28
GATEBOOK2019 Mock Test120
Assume the distribution of instructions that run on a processor as follows: $50 \%$: ALU $25 \%$: BEQ $15 \%$: Load Word $10 \%$: Store Word Assuming there are no stalls or hazards, what is the utilization of the register block’s write port? (Utilization in percentage of clock cycles used) $45 \%$ $55 \%$ $65 \%$ $75 \%$
answer selected
2 hours
ago
in
CO & Architecture

95
views
gb2019mock1
instructionexecution
coandarchitecture
1
answer
29
GATEBOOK2019 Mock Test129
SELECT [....] FROM R GROUP BY A, B Assume A,B,C, D take integer values. Which of the following can appear in the position marked as [... ] MIN(C+D) A,B C,D II only. I and II only. I, II, and III. None.
commented
3 hours
ago
in
Databases

74
views
gb2019mock1
sql
0
answers
30
GATEBOOK2019 Mock Test161
$S\rightarrow aS\mid b$ ... Which of the following stack contents causes the parser to reduce by some production? $a$ $aa$ $bb$ $aaS$
commented
3 hours
ago
in
Compiler Design

33
views
gb2019mock1
parsing
1
answer
31
Semaphore
Let m[0]....m[4] be mutexes (binary semaphores) and P[0].......P[4] be processes. Suppose each process P[i] executes the following: wait (m[i]; wait (m(i+1) mode 3]); ........... release (m[i]); release (m(i+1) mod 3]); Will it cause Starvation and deadlock? If the ... (m(i+1) mode 5]); ........... release (m[i]); release (m(i+1) mod 5]); Is there any change in answer in this question?
commented
5 hours
ago
in
Operating System

173
views
semaphore
operatingsystem
processsynchronization
1
answer
32
GATEBOOK2019 Mock Test119
According to the IEEE standard, a $32$bit, singleprecision, floatingpoint number $N$ is defined to be $N = (1)^{^{S}} \times 1.F \times 2^{E127}$ where $S$ is the sign bit, $F$ the fractional mantissa, and $E$ the biased ... $C1E00000$ (hexadecimal notation) ? $26$ $12$ $26$ $28$
answer selected
5 hours
ago
in
Digital Logic

36
views
gb2019mock1
ieeerepresentation
0
answers
33
GATEBOOK2019 Mock Test118
A process executes the following code for (i=0;i<5;i++) for (j=0;j<5;j++) fork(); The number of child processes created is ______
commented
5 hours
ago
in
Operating System

64
views
gb2019mock1
numericalanswers
process
fork
3
answers
34
GATE200545
Consider three decision problems $P_1$, $P_2$ and $P_3$. It is known that $P_1$ is decidable and $P_2$ is undecidable. Which one of the following is TRUE? $P_3$ is decidable if $P_1$ is reducible to $P_3$ $P_3$ is undecidable if $P_3$ is reducible to $P_2$ $P_3$ is undecidable if $P_2$ is reducible to $P_3$ $P_3$ is decidable if $P_3$ is reducible to $P_2$'s complement
comment edited
11 hours
ago
in
Theory of Computation

2.6k
views
gate2005
theoryofcomputation
decidability
normal
1
answer
35
Effective Access time
commented
14 hours
ago
in
Operating System

34
views
effectivememoryaccess
operatingsystem
coandarchitecture
acetestseries
0
answers
36
Operating System: Page Fault Count
Consider the two dimensional array A $Int A[50][50];$ // int size is 4 bytes where A[0][0] is at location 200 in a paged memory system with pages of size 200 bytes. A small process that manipulates the matrix resides in page 0 (locations 0 to 199). Thus, every instruction fetch ... ? $for(\text{int j}=0;j<50;j++)$ $for(\text{int i}=0;i<j;i++)$ $A[i][j]=0;$
commented
2 days
ago
in
Operating System

120
views
pagefault
operatingsystem
0
answers
37
Made_easy_test_series
The number of totally ordered sets compatible to the given POSET are ________.
commented
2 days
ago
in
Graph Theory

122
views
discretemathematics
graphtheory
0
answers
38
GATEBOOK2019DS117
Consider following function for a given Linked List $L$ as: $head\rightarrow[1]\rightarrow[2]\rightarrow[3]\rightarrow[4]\rightarrow[6]\rightarrow[5]\rightarrow[7]$, which is pointed to by a $\text{head}$ pointer. (Assume the type of $\text{head}$ as $\text{struct node *}$ which is already defined.) void foo( ... $7 \: 5 \: 3 \: 1$ $7 \: 6 \: 5 \: 4 \: 3 \: 2 \: 1$
commented
2 days
ago
in
Programming

103
views
gb2019ds1
linkedlists
0
answers
39
Self Doubt
Suppose we are using 4bit carry lookahead adder modules to build a 64 bit adder with twolevel carry lookahead, with ripple carry between the modules. If the delay of a basic gate (AND, OR, NOT) is 2 nanoseconds, the worstcase delay of the 64bit adder will be ……….. nanoseconds.
commented
2 days
ago
in
Digital Logic

64
views
digitallogic
adder
2
answers
40
GATEBOOK2019DL120
Consider the $16$bit floatingpoint format which has $9$ rightmost bits for the mantissa and $6$ bits for the excess$31$ exponent (base $2$) in the middle and most significant bit stands for sign of the float number. Which of the following represents the difference between the ... value (using implicit leading 1) in this system? $2^{39}$ $2^{35}$ $2^{38}$ $2^{32}$
commented
2 days
ago
in
Digital Logic

118
views
gb2019dl1
floatingpointrepresentation
47,199
questions
51,432
answers
178,321
comments
66,728
users