Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by srestha
0
answers
1
Testbook Test Series
202
views
commented
Dec 11, 2021
Linear Algebra
testbook-test-series
+
–
1
answer
2
GATE CSE 2021 Set 2 | Question: 21
A data file consisting of $1,50,000$ student-records is stored on a hard disk with block size of $4096$ bytes. The data file is sorted on the primary key $\textrm{RollNo}$. The size of a record pointer for this disk is $7$ bytes. ... that the records of data file and index file are not split across disk blocks. The number of blocks in the index file is ________
A data file consisting of $1,50,000$ student-records is stored on a hard disk with block size of $4096$ bytes. The data file is sorted on the primary key $\textrm{RollNo}...
9.2k
views
commented
May 4, 2021
Databases
gatecse-2021-set2
numerical-answers
databases
indexing
1-mark
+
–
3
answers
3
GATE Overflow Test Series | Theory of Computation | Test 1 | Question: 6
In the DFA (not necessarily minimal) for a regular language $L$ over $\Sigma = \{a, b, c,d\},$ the minimum number of outgoing edges for any state is _____
In the DFA (not necessarily minimal) for a regular language $L$ over $\Sigma = \{a, b, c,d\},$ the minimum number of outgoing edges for any state is _____
355
views
commented
Dec 22, 2020
Theory of Computation
go2025-toc-1
numerical-answers
regular-language
+
–
2
answers
4
ISI2018-PCB-CS8
Consider a $5$ ... $\text{(in ns)}$ needed to execute the program.
Consider a $5$-stage instruction pipeline. The stages and the corresponding stage delays are given below.$$\begin{array}{|l|l|}\hline \textbf{Instruction}&\textbf{Stage d...
1.3k
views
answer edited
Dec 10, 2020
Operating System
isi2018-pcb-cs
co-and-architecture
pipelining
descriptive
+
–
6
answers
5
GATE CSE 2010 | Question: 46
A system has $n$ resources $R_0, \dots,R_{n-1}$, and $k$ processes $P_0, \dots, P_{k-1}$. The implementation of the resource request logic of each process $P_i$ is as follows: $\text{if} (i\%2==0) \{$ $\quad\text{if} (i<n) \text{ request } R_i;$ ... which of the following situations is a deadlock possible? $n=40,\: k=26$ $n=21,\:k=12$ $n=20,\:k=10$ $n=41,\:k=19$
A system has $n$ resources $R_0, \dots,R_{n-1}$, and $k$ processes $P_0, \dots, P_{k-1}$. The implementation of the resource request logic of each process $P_i$ is as fol...
29.3k
views
commented
Dec 7, 2020
Operating System
gatecse-2010
operating-system
resource-allocation
normal
+
–
8
answers
6
GATE CSE 2013 | Question: 16
Three concurrent processes $X$, $Y$, and $Z$ execute three different code segments that access and update certain shared variables. Process $X$ executes the $P$ operation (i.e., $wait$) on semaphores $a$, $b,$ and $c$; process $Y$ executes the $P$ operation on semaphores $b$, $c,$ and $d$; process ... $X:$ $P(a)P(b)P(c)$ $Y:$ $P(c)P(b)P(d)$ $Z:$ $P(c)P(d)P(a)$
Three concurrent processes $X$, $Y$, and $Z$ execute three different code segments that access and update certain shared variables. Process $X$ executes the $P$ operation...
17.2k
views
commented
Dec 6, 2020
Operating System
gatecse-2013
operating-system
resource-allocation
normal
+
–
9
answers
7
GATE CSE 2008 | Question: 1
$\displaystyle \lim_{x \to \infty}\frac{x-\sin x}{x+\cos x}$ equals $1$ $-1$ $\infty$ $-\infty$
$\displaystyle \lim_{x \to \infty}\frac{x-\sin x}{x+\cos x}$ equals$1$$-1$$\infty$$-\infty$
10.1k
views
commented
Nov 9, 2020
Calculus
gatecse-2008
calculus
limits
easy
+
–
2
answers
8
GATE Overflow Test Series | Theory of Computation | Test 1 | Question: 5
For $L=\{\varepsilon \},$ if the number of total and final states required in the minimal state deterministic finite automata to accept $L$ over $\Sigma = \{a,b\}$ are denoted by $a$ and $b$ respectively, then $a-b = $_____
For $L=\{\varepsilon \},$ if the number of total and final states required in the minimal state deterministic finite automata to accept $L$ over $\Sigma = \{a,b\}$ are de...
377
views
commented
Oct 14, 2020
Theory of Computation
go2025-toc-1
numerical-answers
regular-expression
finite-automata
+
–
13
answers
9
GATE IT 2007 | Question: 29
When searching for the key value $60$ in a binary search tree, nodes containing the key values $10, 20, 40, 50, 70, 80, 90$ are traversed, not necessarily in the order given. How many different orders are possible in which these key values can occur on the search path from the root to the node containing the value $60$? $35$ $64$ $128$ $5040$
When searching for the key value $60$ in a binary search tree, nodes containing the key values $10, 20, 40, 50, 70, 80, 90$ are traversed, not necessarily in the order gi...
39.3k
views
commented
Sep 23, 2020
DS
gateit-2007
data-structures
binary-search-tree
normal
+
–
2
answers
10
MadeEasy Subject Test: Programming & DS - Binary Search Tree
The number of BST's possible with $6$ nodes numbered $1$,$2$,$3$,$4$,$5$ and $6$ with exactly one leaf node are ....................... OR The number of BST's possible with $6$ nodes numbered $1$,$2$,$3$,$4$,$5$ and $6$ having a height of $5$ are .................… ( note :- height of a root is 0 )
The number of BST's possible with $6$ nodes numbered $1$,$2$,$3$,$4$,$5$ and $6$ with exactly one leaf node are .......................ORThe number of BST's possible with...
1.8k
views
commented
Sep 22, 2020
DS
data-structures
made-easy-test-series
tree
binary-search-tree
+
–
0
answers
11
Parsing
150
views
closed
Sep 21, 2020
1
answer
12
Made Easy Test Series: DFA
Min number of states in equivalent DFA ______________ will it be 4 or 5 ??
Min number of states in equivalent DFA ______________will it be 4 or 5 ??
627
views
answer selected
Sep 3, 2020
Theory of Computation
made-easy-test-series
theory-of-computation
+
–
1
answer
13
Hamacher COA 5.7,p-362
A computer uses a small direct-mapped cache between the main memory and the processor. The cache has four 16-bit words, and each word has an associated 13-bit tag, as shown in Figure P5.2a. When a miss occurs during a read operation, the ... the cache is $1\tau$. Calculate the execution time for each pass. Ignore the time taken by the processor between memory cycles.
A computer uses a small direct-mapped cache between the main memory and the processor. The cache has four 16-bit words, and each word has an associated 13-bit tag, as sho...
978
views
retagged
Aug 8, 2020
CO and Architecture
co-and-architecture
cache-memory
secondary-storage
+
–
2
answers
14
GATE Overflow Test Series | Discrete Mathematics | Test 1 | Question: 16
Let $P(X)$ be the collection of all the subset of a set $X$ with at least three elements. Consider the following two relations on $P(X):$ $R:A \subseteq B$ $S: A \cap B = \phi$. Which of the following is true ... -symmetric. $R$ is not anti-symmetric but $S$ is anti-symmetric. Both $R$ and $S$ are anti-symmetric None of these
Let $P(X)$ be the collection of all the subset of a set $X$ with at least three elements. Consider the following two relations on $P(X):$$R:A \subseteq B$$S: A \cap B = \...
299
views
commented
Jul 23, 2020
Set Theory & Algebra
go2025-dm-1
relations
normal
+
–
5
answers
15
TIFR CSE 2014 | Part B | Question: 16
Consider the ordering relation $x\mid y \subseteq N \times N$ over natural numbers $N$ such that $x \mid y$ if there exists $z \in N$ such that $x ∙ z = y$. A set is called lattice if every finite subset has a least upper bound and greatest lower ... $(N, \mid)$ is a complete lattice. $(N, \mid)$ is a lattice but not a complete lattice.
Consider the ordering relation $x\mid y \subseteq N \times N$ over natural numbers $N$ such that $x \mid y$ if there exists $z \in N$ such that $x ∙ z = y$. A set is ca...
5.2k
views
commented
Jul 23, 2020
Set Theory & Algebra
tifr2014
set-theory&algebra
partial-order
lattice
+
–
3
answers
16
TIFR CSE 2012 | Part B | Question: 1
For $x, y\in \left\{0, 1\right\}^{n}$, let $x ⊕ y$ be the element of $\left\{0, 1\right\}^{n}$ obtained by the component-wise exclusive-or of $x$ and $y$. A Boolean function $F:\left\{0, 1\right\}^{n}\rightarrow\left\{0, 1\right\}$ ... $\left\{0, 1\right\}$ is. $2^{2n}$ $2^{n+1}$ $2^{n-1}+1$ $n!$ $2^{n}$
For $x, y\in \left\{0, 1\right\}^{n}$, let $x ⊕ y$ be the element of $\left\{0, 1\right\}^{n}$ obtained by the component-wise exclusive-or of $x$ and $y$. A Boolean fun...
2.2k
views
commented
Jul 19, 2020
Set Theory & Algebra
tifr2012
set-theory&algebra
functions
+
–
6
answers
17
GATE CSE 1988 | Question: 1vii
The complement(s) of the element $'a'$ in the lattice shown in below figure is (are) ____
The complement(s) of the element $'a'$ in the lattice shown in below figure is (are) ____
4.6k
views
commented
Jul 13, 2020
Set Theory & Algebra
gate1988
descriptive
lattice
set-theory&algebra
+
–
1
answer
18
Kenneth Rosen Edition 7 Exercise 8.1 Question 21 (Page No. 511)
Find the recurrence relation satisfied by $R_{n},$ where $R_{n}$ is the number of regions that a plane is divided into by $n$ lines, if no two of the lines are parallel and no three of the lines go through the same point. Find $R_{n}$ using iteration.
Find the recurrence relation satisfied by $R_{n},$ where $R_{n}$ is the number of regions that a plane is divided into by $n$ lines, if no two of the lines are parallel a...
1.1k
views
answer edited
Jul 11, 2020
Combinatory
kenneth-rosen
discrete-mathematics
counting
descriptive
+
–
2
answers
19
Rosen-Advance Counting Technique-26
Find a recurrence relation for the number of bit strings of length $n$ that contain the string $01.$ I am getting a recurrence like An = 2^(n-2) + 2A(n-1) - A (N-2) .Answer is not given for this question.Please help and explain your steps.
Find a recurrence relation for the number of bit strings of length $n$ that contain the string $01.$I am getting a recurrence like An = 2^(n-2) + 2A(n-1) - A (N-2) .Answe...
549
views
answered
Jul 11, 2020
Combinatory
kenneth-rosen
+
–
1
answer
20
Kenneth Rosen Edition 7 Exercise 6.2 Question 4 (Page No. 405)
A bowl contains $10$ red balls and $10$ blue balls. A woman selects balls at random without looking at them. How many balls must she select to be sure of having at least three balls of the same color? How many balls must she select to be sure of having at least three blue balls?
A bowl contains $10$ red balls and $10$ blue balls. A woman selects balls at random without looking at them.How many balls must she select to be sure of having at least t...
3.5k
views
commented
Jul 11, 2020
Combinatory
kenneth-rosen
discrete-mathematics
counting
pigeonhole-principle
descriptive
+
–
2
answers
21
GATE2014 AG: GA-10
$10$% of the population in a town is $\text{HIV}\large ^{+}$. A new diagnostic kit for $\text{HIV}$ detection is available; this kit correctly identifies $\text{HIV}\large ^{+}$ individuals $95$ ... time. A particular patient is tested using this kit and is found to be positive. The probability that the individual is actually positive is ______.
$10$% of the population in a town is $\text{HIV}\large ^{+}$. A new diagnostic kit for $\text{HIV}$ detection is available; this kit correctly identifies $\text{HIV}\larg...
6.8k
views
commented
Jul 10, 2020
Quantitative Aptitude
gate2014-ag
quantitative-aptitude
probability
conditional-probability
normal
numerical-answers
+
–
11
answers
22
GATE IT 2005 | Question: 41
Given below is a program which when executed spawns two concurrent processes : semaphore $X : = 0 ;$ /* Process now forks into concurrent processes $P1$ & $P2$ ... (II) are true. (I) is true but (II) is false. (II) is true but (I) is false Both (I) and (II) are false
Given below is a program which when executed spawns two concurrent processes :semaphore $X : = 0 ;$/* Process now forks into concurrent processes $P1$ & $P2$ */$\begin{ar...
24.0k
views
commented
Jul 9, 2020
Operating System
gateit-2005
operating-system
process-synchronization
normal
+
–
1
answer
23
relations
Let R be a reflexive relation on set A for any three elements a,b,c belongs to A if (aRb and bRc) +> (cRa) then which if the following is true? a)R is symmetric but not transitive b)R is transitive but not symmetric c)R is an equivalence relation d)R is neither symmetric nor transitive
Let R be a reflexive relation on set Afor any three elements a,b,c belongs to Aif (aRb and bRc) + (cRa) thenwhich if the following is true?a)R is symmetric but not transi...
441
views
commented
Jul 8, 2020
1
answer
24
GATE CSE 2011 | Question: 28
On a non-pipelined sequential processor, a program segment, which is the part of the interrupt service routine, is given to transfer $500$ bytes from an I/O device to memory. Initialize the address register Initialize the count to 500 LOOP: Load a byte from device Store ... is used in a place of the interrupt driven program based input-output? $3.4$ $4.4$ $5.1$ $6.7$
On a non-pipelined sequential processor, a program segment, which is the part of the interrupt service routine, is given to transfer $500$ bytes from an I/O device to mem...
15.7k
views
commented
Jul 7, 2020
CO and Architecture
gatecse-2011
co-and-architecture
dma
normal
+
–
6
answers
25
GATE CSE 1987 | Question: 1-V
The most relevant addressing mode to write position-independent codes is: Direct mode Indirect mode Relative mode Indexed mode
The most relevant addressing mode to write position-independent codes is:Direct modeIndirect modeRelative modeIndexed mode
15.1k
views
commented
Jul 3, 2020
CO and Architecture
gate1987
co-and-architecture
addressing-modes
easy
+
–
10
answers
26
GATE CSE 2010 | Question: 39
Let $L=\{ w \in \:(0+1)^* \mid w\text{ has even number of }1s \}$. i.e., $L$ is the set of all the bit strings with even numbers of $1$s. Which one of the regular expressions below represents $L$? $(0^*10^*1)^*$ $0^*(10^*10^*)^*$ $0^*(10^*1)^*0^*$ $0^*1(10^*1)^*10^*$
Let $L=\{ w \in \:(0+1)^* \mid w\text{ has even number of }1s \}$. i.e., $L$ is the set of all the bit strings with even numbers of $1$s. Which one of the regular express...
22.4k
views
commented
Jun 18, 2020
Theory of Computation
gatecse-2010
theory-of-computation
regular-expression
normal
+
–
1
answer
27
PIPELINING
Consider the following sequence of instructions executed on the five-stage pipelined processor: LW $1, 30($6) ADD $2, $4, $2 ADD $1, $3, $5 SW $2, 20($4) ADD $1, $1, $4 Assuming there is no forwarding, calculate the number of clock cycles needed to execute above program ?
Consider the following sequence of instructions executed on the five-stage pipelined processor:LW $1, 30($6)ADD $2, $4, $2ADD $1, $3, $5SW $2, 20($4)ADD $1, $1, $...
773
views
answer edited
Jun 4, 2020
CO and Architecture
pipelining
computer-organisation
+
–
1
answer
28
ME test series
Consider a pipeline 'x', consist of 5 stages named as IF, ID, OF, EX and WB with the respective stage delays of 2 ns, 6 ns, 5 ns, 8 ns and 1 ns. The alternative pipeline 'y' contain the same number of stages but EX stage is divided ... the instructions which are memory based instructions, what is the ratio of speedup of x to speedup of y? 0.727 0.902 0.665 0.825
Consider a pipeline 'x', consist of 5 stages named as IF, ID, OF, EX and WB with the respective stage delays of 2 ns, 6 ns, 5 ns, 8 ns and 1 ns. The alternative pipeline ...
756
views
edited
Jun 4, 2020
CO and Architecture
computer
co-and-architecture
pipelining
speedup
+
–
2
answers
29
ISI2011-PCB-CS-6a
Assume a machine has $4$ registers (one of which is the accumulator $A$) and the following instruction set. $\text{LOAD}$ and $\text{STORE}$ are indirect memory operations that load and store, using the address stored in the given register operand ... . Design an instruction encoding scheme that allows each of the above instructions (along with operands) to be encoded in $8$ bits.
Assume a machine has $4$ registers (one of which is the accumulator $A$) and the following instruction set.$\text{LOAD}$ and $\text{STORE}$ are indirect memory operations...
1.3k
views
answer edited
Jun 3, 2020
CO and Architecture
co-and-architecture
descriptive
isi2011-pcb-cs
machine-instruction
+
–
1
answer
30
TIFR CSE 2020 | Part B | Question: 14
The figure below describes the network of streets in a city where Motabhai sells $\text{pakoras}$ from his cart. The number next to an edge is the time (in minutes) taken to traverse the corresponding street. At present, the cart is required to start at point $s$ ... $f$ are the only odd degree nodes in the figure above. $430$ $440$ $460$ $470$ $480$
The figure below describes the network of streets in a city where Motabhai sells $\text{pakoras}$ from his cart. The number next to an edge is the time (in minutes) taken...
1.0k
views
commented
May 31, 2020
Graph Theory
tifr2020
graph-theory
euler-graph
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register