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 shashank023
2
answers
1
Minimum Spanning Tree
Multiplying all edge weights by a positive number(>1) will always change the cost of minimum spanning tree. True/False
Multiplying all edge weights by a positive number(>1) will always change the cost of minimum spanning tree.True/False
3.8k
views
commented
Jan 14, 2021
Algorithms
algorithms
minimum-spanning-tree
+
–
8
answers
2
GATE CSE 2018 | Question: 50
The instruction pipeline of a RISC processor has the following stages: Instruction Fetch $(IF)$, Instruction Decode $(ID)$, Operand Fetch $(OF)$, Perform Operation $(PO)$ and Writeback $(WB)$, The $IF$, $ID$, $OF$ and $WB$ ... no data hazards and no control hazards. The number of clock cycles required for completion of execution of the sequence of instruction is _____.
The instruction pipeline of a RISC processor has the following stages: Instruction Fetch $(IF)$, Instruction Decode $(ID)$, Operand Fetch $(OF)$, Perform Operation $(PO)$...
24.0k
views
commented
Jan 7, 2021
CO and Architecture
gatecse-2018
co-and-architecture
pipelining
numerical-answers
2-marks
+
–
6
answers
3
GATE CSE 2006 | Question: 81
A CPU has a $32$ $KB$ direct mapped cache with $128$ byte-block size. Suppose $A$ is two dimensional array of size $512 \times512$ with elements that occupy $8-bytes$ each. Consider the following two $C$ code segments, $P1$ and $P2$. $P1$: for (i=0; i<512; i++) { for ( ... $M2$. The value of the ratio $\frac{M_{1}}{M_{2}}$: $0$ $\frac{1}{16}$ $\frac{1}{8}$ $16$
A CPU has a $32$ $KB$ direct mapped cache with $128$ byte-block size. Suppose $A$ is two dimensional array of size $512 \times512$ with elements that occupy $8-bytes$ eac...
10.5k
views
commented
Jan 6, 2021
CO and Architecture
co-and-architecture
cache-memory
normal
gatecse-2006
+
–
2
answers
4
MadeEasy Test Series: Compiler Design - Viable Prefix
i think "(E+F*" is viable prefix but "E+F*" is not viable prefix. correct?
i think "(E+F*" is viable prefix but "E+F*" is not viable prefix. correct?
1.3k
views
commented
Jan 5, 2021
Compiler Design
made-easy-test-series
compiler-design
viable-prefix
+
–
4
answers
5
GATE CSE 2019 | Question: 33
Assume that in a certain computer, the virtual addresses are $64$ bits long and the physical addresses are $48$ bits long. The memory is word addressible. The page size is $8$ kB and the word size is $4$ bytes. The Translation Look-aside Buffer (TLB) in the address translation path ... TLB miss? $16 \times 2^{10}$ $256 \times 2^{10}$ $4 \times 2^{20}$ $8 \times 2^{20}$
Assume that in a certain computer, the virtual addresses are $64$ bits long and the physical addresses are $48$ bits long. The memory is word addressible. The page size i...
21.7k
views
commented
Jan 2, 2021
Operating System
gatecse-2019
operating-system
virtual-memory
2-marks
+
–
12
answers
6
GATE CSE 2015 Set 1 | Question: 52
Consider the DFAs $M$ and $N$ given above. The number of states in a minimal DFA that accept the language $L(M) \cap L(N)$ is_____________.
Consider the DFAs $M$ and $N$ given above. The number of states in a minimal DFA that accept the language $L(M) \cap L(N)$ is_____________.
17.3k
views
commented
Dec 25, 2020
Theory of Computation
gatecse-2015-set1
theory-of-computation
finite-automata
easy
numerical-answers
minimal-state-automata
+
–
3
answers
7
TIFR CSE 2018 | Part B | Question: 13
Let $n\geq 3,$ and let $G$ be a simple, connected, undirected graph with the same number $n$ of vertices and edges. Each edge of $G$ has a distinct real weight associated with it. Let $T$ be the minimum weight spanning tree of $G.$ Which of the ... edge of $C$ is not in $T.$ $T$ can be found in $O(n)$ time from the adjacency list representation of $G.$
Let $n\geq 3,$ and let $G$ be a simple, connected, undirected graph with the same number $n$ of vertices and edges. Each edge of $G$ has a distinct real weight associate...
2.8k
views
commented
Dec 18, 2020
Algorithms
tifr2018
graph-algorithms
minimum-spanning-tree
+
–
18
answers
8
GATE CSE 2016 Set 1 | Question: 39
Let $G$ be a complete undirected graph on $4$ vertices, having $6$ edges with weights being $1, 2, 3, 4, 5,$ and $6$. The maximum possible weight that a minimum weight spanning tree of $G$ can have is __________
Let $G$ be a complete undirected graph on $4$ vertices, having $6$ edges with weights being $1, 2, 3, 4, 5,$ and $6$. The maximum possible weight that a minimum weight s...
35.6k
views
commented
Dec 16, 2020
Algorithms
gatecse-2016-set1
algorithms
spanning-tree
normal
numerical-answers
+
–
8
answers
9
GATE CSE 2010 | Question: 50
Consider a complete undirected graph with vertex set $\{0, 1, 2, 3, 4\}$. Entry $W_{ij}$ in the matrix $W$ below is the weight of the edge $\{i, j\}$ ... possible weight of a spanning tree $T$ in this graph such that vertex $0$ is a leaf node in the tree $T$? $7$ $8$ $9$ $10$
Consider a complete undirected graph with vertex set $\{0, 1, 2, 3, 4\}$. Entry $W_{ij}$ in the matrix $W$ below is the weight of the edge $\{i, j\}$$$W=\begin{pmatrix} 0...
24.0k
views
commented
Dec 15, 2020
Algorithms
gatecse-2010
algorithms
spanning-tree
normal
+
–
3
answers
10
GATE CSE 2006 | Question: 62, ISRO2016-50
A CPU generates $32$-bit virtual addresses. The page size is $4$ KB. The processor has a translation look-aside buffer (TLB) which can hold a total of $128$ page table entries and is $4$-way set associative. The minimum size of the TLB tag is: $\text{11 bits}$ $\text{13 bits}$ $\text{15 bits}$ $\text{20 bits}$
A CPU generates $32$-bit virtual addresses. The page size is $4$ KB. The processor has a translation look-aside buffer (TLB) which can hold a total of $128$ page table en...
25.9k
views
commented
Dec 1, 2020
Operating System
gatecse-2006
operating-system
virtual-memory
normal
isro2016
+
–
4
answers
11
GATE CSE 2010 | Question: 42
Consider the following schedule for transactions $T1, T2$ and $T3:$ ... correct serialization of the above? $T1 \to T3 \to T2$ $T2 \to T1 \to T3$ $T2 \to T3 \to T1$ $T3 \to T1 \to T2$
Consider the following schedule for transactions $T1, T2$ and $T3:$$$\begin{array}{|c|c|c|}\hline \textbf{T1} & \textbf{T2} & \textbf{T3} \\\hline \text{Read(X)} & \text...
10.6k
views
commented
Nov 20, 2020
Databases
gatecse-2010
databases
transaction-and-concurrency
normal
+
–
12
answers
12
GATE CSE 1994 | Question: 1.6, ISRO2008-29
The number of distinct simple graphs with up to three nodes is $15$ $10$ $7$ $9$
The number of distinct simple graphs with up to three nodes is$15$$10$$7$$9$
34.9k
views
commented
Nov 1, 2020
Graph Theory
gate1994
graph-theory
graph-connectivity
combinatory
normal
isro2008
counting
+
–
4
answers
13
GATE CSE 1997 | Question: 14
Let $R$ be a reflexive and transitive relation on a set $A$. Define a new relation $E$ on $A$ as $E=\{(a, b) \mid (a, b) \in R \text{ and } (b, a) \in R \}$ Prove that $E$ is an equivalence relation on $A$. Define a relation $\leq$ on the equivalence ... $\exists a, b$ such that $a \in E_1, b \in E_2 \text{ and } (a, b) \in R$. Prove that $\leq$ is a partial order.
Let $R$ be a reflexive and transitive relation on a set $A$. Define a new relation $E$ on $A$ as$E=\{(a, b) \mid (a, b) \in R \text{ and } (b, a) \in R \}$Prove that $E$ ...
3.9k
views
commented
Oct 30, 2020
Set Theory & Algebra
gate1997
set-theory&algebra
relations
normal
proof
descriptive
+
–
4
answers
14
GATE CSE 1998 | Question: 11
Suppose $A = \{a, b, c, d\}$ and $\Pi_1$ is the following partition of A $\Pi_1 = \left\{\left\{a, b, c\right\}\left\{d\right\}\right\}$ List the ordered pairs of the equivalence relations induced by $\Pi_1$. Draw the graph of the above ... $\left\langle\left\{\Pi_1, \Pi_2, \Pi_3, \Pi_4\right\}, \text{ refines } \right\rangle$.
Suppose $A = \{a, b, c, d\}$ and $\Pi_1$ is the following partition of A$\Pi_1 = \left\{\left\{a, b, c\right\}\left\{d\right\}\right\}$List the ordered pairs of the equiv...
11.6k
views
comment edited
Oct 28, 2020
Set Theory & Algebra
gate1998
set-theory&algebra
normal
partial-order
descriptive
+
–
5
answers
15
GATE IT 2008 | Question: 31
If $f(x)$ is defined as follows, what is the minimum value of $f(x)$ for $x \in (0, 2]$ ? $f(x) = \begin{cases} \frac{25}{8x} &\text{ when } x \leq \frac{3}{2} \\ x+ \frac{1}{x} &\text { otherwise}\end{cases}$ $2$ $2 \frac{1}{12}$ $2\frac{1}{6}$ $2\frac{1}{2}$
If $f(x)$ is defined as follows, what is the minimum value of $f(x)$ for $x \in (0, 2]$ ?$$f(x) = \begin{cases} \frac{25}{8x} &\text{ when } x \leq \frac{3}{2} \\ x+ \fr...
7.8k
views
commented
Oct 24, 2020
Calculus
gateit-2008
calculus
maxima-minima
normal
+
–
6
answers
16
GATE IT 2008 | Question: 64
A $1\;\text{Mbps}$ satellite link connects two ground stations. The altitude of the satellite is $36,504\;\text{km}$ and speed of the signal is $3 \times 10^{8}\;\text{m/s}.$ What should be the packet size for a channel utilization of $25\%$ for ... there are no errors during communication. $120\;\text{bytes}$ $60\;\text{bytes}$ $240\;\text{bytes}$ $90\;\text{bytes}$
A $1\;\text{Mbps}$ satellite link connects two ground stations. The altitude of the satellite is $36,504\;\text{km}$ and speed of the signal is $3 \times 10^{8}\;\text{m/...
24.9k
views
commented
Oct 14, 2020
Computer Networks
gateit-2008
computer-networks
sliding-window
normal
+
–
10
answers
17
GATE CSE 2003 | Question: 23
In a min-heap with $n$ elements with the smallest element at the root, the $7^{th}$ smallest element can be found in time $\Theta (n \log n)$ $\Theta (n)$ $\Theta(\log n)$ $\Theta(1)$
In a min-heap with $n$ elements with the smallest element at the root, the $7^{th}$ smallest element can be found in time$\Theta (n \log n)$$\Theta (n)$$\Theta(\log n)$$\...
32.2k
views
commented
Oct 10, 2020
DS
gatecse-2003
data-structures
binary-heap
+
–
3
answers
18
7th smallest element in a Min-Heap
In a min-heap with n elements 1). The 7th smallest element can be found in time, if duplicates are allowed ? 2). The 7th distinct smallest element can be found in time, If duplicates are allowed ?
In a min-heap with n elements1). The 7th smallest element can be found in time, if duplicates are allowed ?2). The 7th distinct smallest element can be found in time, I...
4.0k
views
commented
Oct 10, 2020
DS
data-structures
binary-heap
time-complexity
+
–
4
answers
19
TIFR CSE 2020 | Part B | Question: 10
Among the following asymptotic expressions, which of these functions grows the slowest (as a function of $n$) asymptotically? $2^{\log n}$ $n^{10}$ $(\sqrt{\log n})^{\log ^{2} n}$ $(\log n)^{\sqrt{\log n}}$ $2^{2^{\sqrt{\log\log n}}}$
Among the following asymptotic expressions, which of these functions grows the slowest (as a function of $n$) asymptotically?$2^{\log n}$$n^{10}$$(\sqrt{\log n})^{\log ^{...
4.6k
views
commented
Oct 9, 2020
Algorithms
tifr2020
algorithms
asymptotic-notation
time-complexity
+
–
6
answers
20
GATE CSE 2008 | Question: 74
Consider the following C functions: int f1 (int n) { if(n == 0 || n == 1) return n; else return (2 * f1(n-1) + 3 * f1(n-2)); } int f2(int n) { int i; int X[N], Y[N], Z[N]; X[0] = Y[0] = Z[0] = 0; X[1] = 1; Y[1] = 2; Z[1] = 3; for(i = 2 ... $f2(n)$ are $\Theta(n)$ and $\Theta(n)$ $\Theta(2^n)$ and $\Theta(n)$ $\Theta(n)$ and $\Theta(2^n)$ $\Theta(2^n)$ and $\Theta(2^n)$
Consider the following C functions:int f1 (int n) { if(n == 0 || n == 1) return n; else return (2 * f1(n-1) + 3 * f1(n-2)); } int f2(int n) { int i; int X[N], Y[N], Z[N];...
19.0k
views
commented
Oct 8, 2020
Algorithms
gatecse-2008
algorithms
time-complexity
normal
+
–
2
answers
21
TIFR CSE 2019 | Part B | Question: 15
Consider directed graphs on $n$ labelled vertices $\{1,2, \dots ,n\}$, where each vertex has exactly one edge coming in and exactly one edge going out. We allow self-loops. How many graphs have exactly two cycles ? $\displaystyle \sum_{k=1}^{n-1} k!(n-k)!$ ... $n!\bigg[\displaystyle \sum_{k=1}^{n-1} \frac{1}{k}\bigg]$ $\frac{n!(n-1)}{2}$ None of the above
Consider directed graphs on $n$ labelled vertices $\{1,2, \dots ,n\}$, where each vertex has exactly one edge coming in and exactly one edge going out. We allow self-loo...
2.2k
views
commented
Oct 1, 2020
Graph Theory
tifr2019
graph-connectivity
graph-theory
+
–
4
answers
22
GATE CSE 2013 | Question: 7
Which one of the following is the tightest upper bound that represents the time complexity of inserting an object into a binary search tree of $n$ nodes? $O(1)$ $O(\log n)$ $O(n)$ $O(n \log n)$
Which one of the following is the tightest upper bound that represents the time complexity of inserting an object into a binary search tree of $n$ nodes?$O(1)$$O(\log n)$...
12.3k
views
commented
Sep 23, 2020
DS
gatecse-2013
data-structures
easy
binary-search-tree
+
–
11
answers
23
GATE CSE 2004 | Question: 85
A program takes as input a balanced binary search tree with $n$ leaf nodes and computes the value of a function $g(x)$ for each node $x$. If the cost of computing $g(x)$ ... time complexity of the program is? $\Theta (n)$ $\Theta (n \log n)$ $\Theta(n^2)$ $\Theta (n^2\log n)$
A program takes as input a balanced binary search tree with $n$ leaf nodes and computes the value of a function $g(x)$ for each node $x$. If the cost of computing $g(x)$ ...
33.2k
views
commented
Sep 22, 2020
DS
gatecse-2004
binary-search-tree
normal
data-structures
+
–
6
answers
24
GATE CSE 2012 | Question: 35
Suppose a circular queue of capacity $(n −1)$ elements is implemented with an array of $n$ elements. Assume that the insertion and deletion operations are carried out using REAR and FRONT as array index variables, respectively. Initially, $REAR = FRONT = 0$. The conditions to detect ... : $(REAR+1) \mod n == FRONT$ full: $(FRONT+1) \mod n == REAR$ empty: $REAR == FRONT$
Suppose a circular queue of capacity $(n −1)$ elements is implemented with an array of $n$ elements. Assume that the insertion and deletion operations are carried out u...
24.2k
views
commented
Sep 14, 2020
DS
gatecse-2012
data-structures
queue
normal
+
–
2
answers
25
GATE CSE 1992 | Question: 09
Suggest a data structure for representing a subset $S$ of integers from $1$ to $n$. Following operations on the set $S$ are to be performed in constant time (independent of cardinality of $S$ ... an English like language. You may assume that the data structure has been suitable initialized. Clearly state your assumptions regarding initialization.
Suggest a data structure for representing a subset $S$ of integers from $1$ to $n$. Following operations on the set $S$ are to be performed in constant time (independent ...
3.9k
views
commented
Sep 14, 2020
DS
gate1992
data-structures
normal
descriptive
queue
+
–
6
answers
26
GATE CSE 2016 Set 2 | Question: 15
$N$ items are stored in a sorted doubly linked list. For a delete operation, a pointer is provided to the record to be deleted. For a decrease-key operation, a pointer is provided to the record on which the operation is to be performed. An algorithm performs the following operations ... together? $O(\log^{2} N)$ $O(N)$ $O(N^{2})$ $\Theta\left(N^{2}\log N\right)$
$N$ items are stored in a sorted doubly linked list. For a delete operation, a pointer is provided to the record to be deleted. For a decrease-key operation, a pointer is...
34.4k
views
commented
Sep 9, 2020
DS
gatecse-2016-set2
data-structures
linked-list
time-complexity
normal
algorithms
+
–
1
answer
27
CMI2012-B-07
We use the notation $[x1,x2,...,xn]$ to denote a list of integers. $[]$ denotes the empty list, and $[n]$ is the list consisting of one integer $n$. For a nonempty list l, $head(l)$ returns the first element of $l$, and $tail(l)$ returns the list ... (tail(l)) then return g(tail(l)) else return(false) When does $f(l)$ return the value true for an input $l$? Explain your answer.
We use the notation $[x1,x2,...,xn]$ to denote a list of integers. $[]$ denotes the empty list, and $[n]$ is the list consisting of one integer $n$. For a nonempty list l...
1.1k
views
commented
Sep 9, 2020
DS
cmi2012
descriptive
data-structures
linked-list
+
–
3
answers
28
GATE CSE 1987 | Question: 6a
A list of $n$ elements is commonly written as a sequence of $n$ elements enclosed in a pair of square brackets. For example. $[10, 20, 30]$ is a list of three elements and $[]$ is a nil list. Five functions are defined below: $car (l)$ returns the first element of its argument ... $f ([32, 16, 8], [9, 11, 12])$ $g ([5, 1, 8, 9])$
A list of $n$ elements is commonly written as a sequence of $n$ elements enclosed in a pair of square brackets. For example. $[10, 20, 30]$ is a list of three elements an...
2.9k
views
commented
Sep 9, 2020
DS
gate1987
data-structures
linked-list
descriptive
+
–
11
answers
29
GATE CSE 1994 | Question: 1.11
In a compact single dimensional array representation for lower triangular matrices (i.e all the elements above the diagonal are zero) of size $n \times n$, non-zero elements, (i.e elements of lower triangle) of each row are stored one after another, starting from the first row, the index of the ... is: $i+j$ $i+j-1$ $(j-1)+\frac{i(i-1)}{2}$ $i+\frac{j(j-1)}{2}$
In a compact single dimensional array representation for lower triangular matrices (i.e all the elements above the diagonal are zero) of size $n \times n$, non-zero eleme...
28.3k
views
comment edited
Sep 5, 2020
DS
gate1994
data-structures
array
normal
+
–
3
answers
30
GATE CSE 2008 | Question: 59
A client process P needs to make a TCP connection to a server process S. Consider the following situation: the server process S executes a $\text{socket()}$, a $\text{bind()}$ and a $\text{listen()}$ system call in that order, following which ... $\text{connect()}$ system call returns an error $\text{connect()}$ system call results in a core dump
A client process P needs to make a TCP connection to a server process S. Consider the following situation: the server process S executes a $\text{socket()}$, a $\text{bin...
16.8k
views
commented
Aug 23, 2020
Computer Networks
gatecse-2008
computer-networks
sockets
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register