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 kickassakash
3
answers
1
GATE CSE 2021 Set 1 | Question: 19
There are $6$ jobs with distinct difficulty levels, and $3$ computers with distinct processing speeds. Each job is assigned to a computer such that: The fastest computer gets the toughest job and the slowest computer gets the easiest job. Every computer gets at least one job. The number of ways in which this can be done is ___________.
There are $6$ jobs with distinct difficulty levels, and $3$ computers with distinct processing speeds. Each job is assigned to a computer such that:The fastest computer g...
11.9k
views
commented
Feb 3
Combinatory
gatecse-2021-set1
combinatory
counting
numerical-answers
1-mark
+
–
10
answers
2
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
Jan 29
DS
gatecse-2003
data-structures
binary-heap
+
–
2
answers
3
GATE CSE 2022 | Question: 1
Which one of the following statements is $\text{TRUE}$ for all positive functions $f(n)?$ $f(n^{2}) = \theta (f(n)^{2}),$ when $f(n)$ is a polynomial $f(n^{2}) = o (f(n)^{2})$ $f(n^{2}) = O (f(n)^{2}),$ when $f(n)$ is an exponential function $f(n^{2}) = \Omega (f(n)^{2})$
Which one of the following statements is $\text{TRUE}$ for all positive functions $f(n)?$$f(n^{2}) = \theta (f(n)^{2}),$ when $f(n)$ is a polynomial$f(n^{2}) = o (f(n)^{2...
15.8k
views
commented
Jan 24
Algorithms
gatecse-2022
algorithms
asymptotic-notation
1-mark
+
–
2
answers
4
GATE CSE 2023 | Question: 32
A $4$ kilobyte $\text{(KB)}$ byte-addressable memory is realized using four $1 \mathrm{~KB}$ memory blocks. Two input address lines $\text{(IA4 and IA3)}$ are connected to the chip select $\text{(CS)}$ port of these memory blocks through a decoder as shown in the figure. The ... options is $\text{CORRECT}?$ $(0,1,2,3)$ $(0,1024,2048,3072)$ $(0,8,16,24)$ $(0,0,0,0)$
A $4$ kilobyte $\text{(KB)}$ byte-addressable memory is realized using four $1 \mathrm{~KB}$ memory blocks. Two input address lines $\text{(IA4 and IA3)}$ are connected t...
6.3k
views
commented
Jan 19
CO and Architecture
gatecse-2023
co-and-architecture
memory-interfacing
2-marks
+
–
2
answers
5
GATE CSE 1998 | Question: 22
An identifier in a programming language consists of up to six letters and digits of which the first character must be a letter. Derive a regular expression for the identifier. Build an $LL(1)$ parsing table for the language defined by the $LL(1)$ ... $X \rightarrow d \text{ semi } X \mid sY$ $Y \rightarrow \text{ semi } s Y \mid \epsilon$
An identifier in a programming language consists of up to six letters and digits of which the first character must be a letter. Derive a regular expression for the identi...
3.8k
views
commented
Dec 5, 2023
Compiler Design
gate1998
compiler-design
parsing
descriptive
+
–
9
answers
6
GATE CSE 2015 Set 2 | Question: 52
$\text{Host A}$ sends a $\text{UDP}$ datagram containing $8880\text{ bytes}$ of user data to $\text{host B}$ over an $\text{Ethernet LAN}.$ Ethernet frames may carry data up to $1500\text{ bytes (i.e. MTU = 1500 bytes)}.$ Size of $\text{UDP}$ ... be the contents of offset field in the last fragment? $6$ and $925$ $6$ and $7400$ $7$ and $1110$ $7$ and $8880$
$\text{Host A}$ sends a $\text{UDP}$ datagram containing $8880\text{ bytes}$ of user data to $\text{host B}$ over an $\text{Ethernet LAN}.$ Ethernet frames may carry data...
25.8k
views
comment edited
Nov 20, 2023
Computer Networks
gatecse-2015-set2
computer-networks
ip-packet
normal
+
–
5
answers
7
GATE CSE 2012 | Question: 29
Let $G$ be a weighted graph with edge weights greater than one and $G'$ be the graph constructed by squaring the weights of edges in $G$. Let $T$ and $T'$ be the minimum spanning trees of $G$ and $G'$, respectively, with total weights $t$ ... $t' < t^2$ $T' \neq T$ but total weight $t' = t^2$ None of the above
Let $G$ be a weighted graph with edge weights greater than one and $G'$ be the graph constructed by squaring the weights of edges in $G$. Let $T$ and $T'$ be the minimum ...
16.5k
views
commented
Nov 19, 2023
Algorithms
gatecse-2012
algorithms
spanning-tree
normal
marks-to-all
+
–
5
answers
8
GATE CSE 2015 Set 3 | Question: 40
Let $G$ be a connected undirected graph of $100$ vertices and $300$ edges. The weight of a minimum spanning tree of $G$ is $500$. When the weight of each edge of $G$ is increased by five, the weight of a minimum spanning tree becomes ______.
Let $G$ be a connected undirected graph of $100$ vertices and $300$ edges. The weight of a minimum spanning tree of $G$ is $500$. When the weight of each edge of $G$ is i...
10.9k
views
commented
Nov 19, 2023
Algorithms
gatecse-2015-set3
algorithms
spanning-tree
easy
numerical-answers
+
–
8
answers
9
GATE CSE 2016 Set 1 | Question: 14
Let $G$ be a weighted connected undirected graph with distinct positive edge weights. If every edge weight is increased by the same value, then which of the following statements is/are TRUE? $P$: Minimum spanning tree of $G$ does not change. $Q$: Shortest path between any pair of vertices does not change. $P$ only $Q$ only Neither $P$ nor $Q$ Both $P$ and $Q$
Let $G$ be a weighted connected undirected graph with distinct positive edge weights. If every edge weight is increased by the same value, then which of the following sta...
22.7k
views
commented
Nov 19, 2023
Algorithms
gatecse-2016-set1
algorithms
spanning-tree
normal
+
–
5
answers
10
GATE CSE 1996 | Question: 2.18
A $1000$ $\text{Kbyte}$ memory is managed using variable partitions but no compaction. It currently has two partitions of sizes $200$ $\text{Kbyte}$ and $260$ $\text{Kbyte}$ respectively. The smallest allocation request in $\text{Kbyte}$ that could be denied is for $151$ $181$ $231$ $541$
A $1000$ $\text{Kbyte}$ memory is managed using variable partitions but no compaction. It currently has two partitions of sizes $200$ $\text{Kbyte}$ and $260$ $\text{Kbyt...
21.2k
views
commented
Nov 8, 2023
Operating System
gate1996
operating-system
memory-management
normal
+
–
2
answers
11
GATE CSE 1994 | Question: 1.13
A memory page containing a heavily used variable that was initialized very early and is in constant use is removed then LRU page replacement algorithm is used FIFO page replacement algorithm is used LFU page replacement algorithm is used None of the above
A memory page containing a heavily used variable that was initialized very early and is in constant use is removed thenLRU page replacement algorithm is usedFIFO page rep...
11.4k
views
commented
Nov 8, 2023
Operating System
gate1994
operating-system
page-replacement
easy
+
–
2
answers
12
GATE CSE 2022 | Question: 28
Which one of the following statements is $\text{FALSE}?$ The $\text{TLB}$ performs an associative search in parallel on all its valid entries using page number of incoming virtual address. If the virtual address of a word given by $\text{CPU}$ has a ... $\text{V2}$ map to the same value while hashing, then the memory access time of these addresses will not be the same.
Which one of the following statements is $\text{FALSE}?$The $\text{TLB}$ performs an associative search in parallel on all its valid entries using page number of incoming...
8.1k
views
commented
Nov 7, 2023
Operating System
gatecse-2022
operating-system
memory-management
translation-lookaside-buffer
2-marks
+
–
11
answers
13
GATE CSE 2015 Set 3 | Question: 36
Two hosts are connected via a packet switch with $10^7$ bits per second links. Each link has a propagation delay of $20$ microseconds. The switch begins forwarding a packet $35$ microseconds after it receives the same. If $10000$ bits of ... between the transmission of the first bit of data and the reception of the last bit of the data in microseconds is ______.
Two hosts are connected via a packet switch with $10^7$ bits per second links. Each link has a propagation delay of $20$ microseconds. The switch begins forwarding a pack...
33.2k
views
commented
Oct 15, 2023
Computer Networks
gatecse-2015-set3
computer-networks
normal
numerical-answers
network-switching
+
–
3
answers
14
GATE IT 2008 | Question: 85
Host $X$ has $IP$ address $192.168.1.97$ and is connected through two routers $R1$ and $R2$ to another host $Y$ with $IP$ address $192.168.1.80$. Router $R1$ has $IP$ addresses $192.168.1.135$ and $192.168.1.110$. $R2$ has $IP$ ... . Which $IP$ address should $X$ configure its gateway as? $192.168.1.67$ $192.168.1.110$ $192.168.1.135$ $192.168.1.155$
Host $X$ has $IP$ address $192.168.1.97$ and is connected through two routers $R1$ and $R2$ to another host $Y$ with $IP$ address $192.168.1.80$. Router $R1$ has $IP$ a...
20.0k
views
commented
Oct 9, 2023
Computer Networks
gateit-2008
computer-networks
subnetting
normal
+
–
5
answers
15
GATE CSE 2011 | Question: 6, UGCNET-June2013-III: 62
Let the time taken to switch from user mode to kernel mode of execution be $T1$ while time taken to switch between two user processes be $T2$. Which of the following is correct? $T1 > T2$ $T1 = T2$ $T1 < T2$ Nothing can be said about the relation between $T1$ and $T2$
Let the time taken to switch from user mode to kernel mode of execution be $T1$ while time taken to switch between two user processes be $T2$. Which of the following is c...
26.0k
views
commented
Oct 4, 2023
Operating System
gatecse-2011
operating-system
context-switch
easy
ugcnetcse-june2013-paper3
+
–
6
answers
16
GATE CSE 2010 | Question: 45
The following program consists of $3$ concurrent processes and $3$ binary semaphores. The semaphores are initialized as $S0=1, S1=0$ and $S2=0.$ ... $P0$ print '$0$'? At least twice Exactly twice Exactly thrice Exactly once
The following program consists of $3$ concurrent processes and $3$ binary semaphores. The semaphores are initialized as $S0=1, S1=0$ and $S2=0.$$$\begin{array}{|l|l|}\hli...
26.3k
views
commented
Oct 3, 2023
Operating System
gatecse-2010
operating-system
process-synchronization
normal
+
–
5
answers
17
GATE CSE 1998 | Question: 2.17, UGCNET-Dec2012-III: 43
Consider $n$ processes sharing the CPU in a round-robin fashion. Assuming that each process switch takes $s$ seconds, what must be the quantum size $q$ such that the overhead resulting from process switching is minimized but at the same time each process is guaranteed to get ... $q \leq \frac{t-ns}{n+1}$ $q \geq \frac{t-ns}{n+1}$
Consider $n$ processes sharing the CPU in a round-robin fashion. Assuming that each process switch takes $s$ seconds, what must be the quantum size $q$ such that the over...
22.3k
views
commented
Oct 2, 2023
Operating System
gate1998
operating-system
process-scheduling
normal
ugcnetcse-dec2012-paper3
+
–
4
answers
18
GATE CSE 2020 | Question: 2
For parameters $a$ and $b$, both of which are $\omega(1)$, $T(n) = T(n^{1/a})+1$, and $T(b)=1$. Then $T(n)$ is $\Theta (\log_a \log _b n)$ $\Theta (\log_{ab} n$) $\Theta (\log_{b} \log_{a} \: n$) $\Theta (\log_{2} \log_{2} n$)
For parameters $a$ and $b$, both of which are $\omega(1)$, $T(n) = T(n^{1/a})+1$, and $T(b)=1$. Then $T(n)$ is$\Theta (\log_a \log _b n)$ $\Theta (\log_{ab} n$)$\Thet...
19.6k
views
commented
Sep 17, 2023
Algorithms
gatecse-2020
algorithms
recurrence-relation
1-mark
+
–
12
answers
19
GATE CSE 2003 | Question: 14
The regular expression $0^*(10^*)^*$ denotes the same set as $(1^*0)^*1^*$ $0+(0+10)^*$ $(0+1)^*10(0+1)^*$ None of the above
The regular expression $0^*(10^*)^*$ denotes the same set as$(1^*0)^*1^*$$0+(0+10)^*$$(0+1)^*10(0+1)^*$None of the above
19.3k
views
commented
Sep 13, 2023
Theory of Computation
gatecse-2003
theory-of-computation
regular-expression
easy
+
–
5
answers
20
GATE IT 2008 | Question: 77
A binary tree with $n > 1$ nodes has $n_1$, $n_2$ and $n_3$ nodes of degree one, two and three respectively. The degree of a node is defined as the number of its neighbours. Starting with the above tree, while there remains a node $v$ of degree two in the tree, add ... will remain at the end of the process? $2 * n_1- 3$ $n_2 + 2 * n_1 - 2$ $n_3 - n_2$ $n_2+ n_1- 2$
A binary tree with $n 1$ nodes has $n_1$, $n_2$ and $n_3$ nodes of degree one, two and three respectively. The degree of a node is defined as the number of its neighbo...
14.8k
views
commented
Sep 4, 2023
DS
gateit-2008
data-structures
binary-tree
normal
+
–
1
answer
21
Go Class data structure asymptotic notation practice video question 21
I have specific doubt on this question and I’ve tried to explain that in the picture , If anyone can explain it then it’ll be of great help. according to sachin sir the answer should be false( fyi).
I have specific doubt on this question and I’ve tried to explain that in the picture ,If anyone can explain it then it’ll be of great help. according to sachin sir th...
425
views
answer selected
Jul 31, 2023
DS
asymptotic-notation
goclasses
data-structures
+
–
11
answers
22
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
commented
Jul 28, 2023
DS
gate1994
data-structures
array
normal
+
–
3
answers
23
GATE CSE 2023 | Question: 36
Let $A$ be a priority queue for maintaining a set of elements. Suppose $A$ is implemented using a max-heap data structure. The operation $\text{EXTRACT-MAX} (A)$ extracts and deletes the maximum element from $A$. The operation $\operatorname{INSERT}(A, key )$ inserts a new ... $O(1)$ whereas $\operatorname{INSERT}(A, k e y)$ runs in $O(\log (n))$.
Let $A$ be a priority queue for maintaining a set of elements. Suppose $A$ is implemented using a max-heap data structure. The operation $\text{EXTRACT-MAX} (A)$ extracts...
6.3k
views
commented
Jul 25, 2023
DS
gatecse-2023
data-structures
priority-queue
time-complexity
binary-heap
2-marks
+
–
4
answers
24
GATE CSE 2015 Set 2 | Question: GA-3
Consider a function $f(x) = 1- |x| \text{ on } -1 \leq x \leq 1$. The value of $x$ at which the function attains a maximum, and the maximum value of the function are: $0, -1$ $-1, 0$ $0, 1$ $-1, 2$
Consider a function $f(x) = 1- |x| \text{ on } -1 \leq x \leq 1$. The value of $x$ at which the function attains a maximum, and the maximum value of the function are:$0, ...
6.9k
views
commented
Jul 15, 2023
Calculus
gatecse-2015-set2
set-theory&algebra
functions
normal
maxima-minima
+
–
4
answers
25
GATE CSE 2023 | Question: 43
Consider a random experiment where two fair coins are tossed. Let $A$ be the event that denotes $\text{HEAD}$ on both the throws, $B$ be the event that denotes $\text{HEAD}$ on the first throw, and $C$ be the event that denotes $\text{HEAD}$ on the ... . $A$ and $C$ are independent. $B$ and $C$ are independent. $\operatorname{Prob}(B \mid C)=\operatorname{Prob}(B)$
Consider a random experiment where two fair coins are tossed. Let $A$ be the event that denotes $\text{HEAD}$ on both the throws, $B$ be the event that denotes $\text{HEA...
7.1k
views
answered
Jul 10, 2023
Probability
gatecse-2023
probability
independent-events
multiple-selects
2-marks
+
–
5
answers
26
ISRO2014-36
Consider a standard Circular Queue implementation (which has the same condition for Queue Full and Queue Empty) whose size is $11$ and the elements of the queue are $q[0], q[1], \ldots q[10]$. The front and rear pointers are initialized to point at $q[2]$. In which position will the ninth element be added? $q[0]$ $q[1]$ $q[9]$ $q[10]$
Consider a standard Circular Queue implementation (which has the same condition for Queue Full and Queue Empty) whose size is $11$ and the elements of the queue are $q[0]...
8.7k
views
commented
Jul 6, 2023
DS
data-structures
queue
isro2014
+
–
8
answers
27
GATE IT 2005 | Question: 3
The determinant of the matrix given below is $\begin{bmatrix} 0 &1 &0 &2 \\ -1& 1& 1& 3\\ 0&0 &0 & 1\\ 1& -2& 0& 1 \end{bmatrix}$ $-1$ $0$ $1$ $2$
The determinant of the matrix given below is$$\begin{bmatrix}0 &1 &0 &2 \\ -1& 1& 1& 3\\ 0&0 &0 & 1\\ 1& -2& 0& 1\end{bmatrix}$$$-1$$0$$1$$2$
23.3k
views
commented
Jul 2, 2023
Linear Algebra
gateit-2005
linear-algebra
normal
determinant
+
–
5
answers
28
GATE CSE 2021 Set 1 | Question: 52
Consider the following matrix.$\begin{pmatrix} 0 & 1 & 1 & 1\\ 1& 0& 1 & 1\\ 1& 1 & 0 & 1 \\1 & 1 & 1 & 0 \end{pmatrix}$The largest eigenvalue of the above matrix is __________.
Consider the following matrix.$$\begin{pmatrix} 0 & 1 & 1 & 1\\ 1& 0& 1 & 1\\ 1& 1 & 0 & 1 \\1 & 1 & 1 & 0 \end{pmatrix}$$The largest eigenvalue of the above matrix is __...
15.8k
views
commented
Jun 30, 2023
Linear Algebra
gatecse-2021-set1
linear-algebra
matrix
eigen-value
numerical-answers
2-marks
+
–
3
answers
29
GATE CSE 1987 | Question: 1-xv
In a circular linked list organization, insertion of a record involves modification of One pointer. Two pointers. Multiple pointers. No pointer.
In a circular linked list organization, insertion of a record involves modification ofOne pointer.Two pointers.Multiple pointers.No pointer.
14.3k
views
commented
Jun 26, 2023
DS
gate1987
data-structures
linked-list
+
–
4
answers
30
GO Classes CS/DA 2025 | Weekly Quiz 4 | Linear Algebra | Question: 12
If $P=\left[\begin{array}{lll}1 & \alpha & 3 \\ 1 & 3 & 3 \\ 2 & 4 & 4\end{array}\right]$ is the adjoint of a $3 \times 3$ matrix $\mathrm{A},$ and $\operatorname{det(A)}=4,$ then $\alpha$ equals to?
If $P=\left[\begin{array}{lll}1 & \alpha & 3 \\ 1 & 3 & 3 \\ 2 & 4 & 4\end{array}\right]$ is the adjoint of a $3 \times 3$ matrix $\mathrm{A},$ and $\operatorname{det(A)}...
1.3k
views
commented
Apr 5, 2023
Linear Algebra
goclasses2025_csda_wq4
numerical-answers
goclasses
linear-algebra
determinant
1-mark
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register