Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
User kickassakash
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 ___________.
commented
in
Combinatory
Feb 3
11.7k
views
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)$
commented
in
DS
Jan 29
31.9k
views
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})$
commented
in
Algorithms
Jan 24
15.5k
views
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)$
commented
in
CO and Architecture
Jan 19
6.1k
views
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$
commented
in
Compiler Design
Dec 5, 2023
3.8k
views
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$
comment edited
in
Computer Networks
Nov 20, 2023
25.6k
views
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
commented
in
Algorithms
Nov 19, 2023
16.4k
views
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 ______.
commented
in
Algorithms
Nov 19, 2023
10.8k
views
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$
commented
in
Algorithms
Nov 19, 2023
22.5k
views
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$
commented
in
Operating System
Nov 8, 2023
20.9k
views
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
commented
in
Operating System
Nov 8, 2023
11.3k
views
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.
commented
in
Operating System
Nov 7, 2023
8.0k
views
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 ______.
commented
in
Computer Networks
Oct 15, 2023
32.9k
views
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$
commented
in
Computer Networks
Oct 9, 2023
19.7k
views
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$
commented
in
Operating System
Oct 4, 2023
25.8k
views
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
commented
in
Operating System
Oct 3, 2023
25.9k
views
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}$
commented
in
Operating System
Oct 2, 2023
21.8k
views
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$)
commented
in
Algorithms
Sep 17, 2023
19.5k
views
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
commented
in
Theory of Computation
Sep 13, 2023
19.2k
views
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$
commented
in
DS
Sep 4, 2023
14.7k
views
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).
answer selected
in
DS
Jul 31, 2023
420
views
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}$
commented
in
DS
Jul 28, 2023
28.1k
views
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))$.
commented
in
DS
Jul 25, 2023
6.1k
views
gatecse-2023
data-structures
priority-queue
time-complexity
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$
commented
in
Calculus
Jul 15, 2023
6.8k
views
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)$
answered
in
Probability
Jul 10, 2023
6.8k
views
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]$
commented
in
DS
Jul 6, 2023
8.6k
views
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$
commented
in
Linear Algebra
Jul 2, 2023
20.3k
views
gateit-2005
linear-algebra
normal
determinant
4
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 __________.
commented
in
Linear Algebra
Jun 30, 2023
15.4k
views
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.
commented
in
DS
Jun 26, 2023
14.3k
views
gate1987
data-structures
linked-list
1
answer
30
GO Classes Weekly Quiz 5 | Propositional Logic | Question: 11
A set of propositions is called a system specification. System specification is consistent if they do not contain conflicting requirements that could be used to derive a contradiction. When specifications are not consistent, there ... retransmitted. Which of the above system specifications are consistent? Only $1$ Only $2$ Both None
commented
in
Mathematical Logic
Mar 29, 2023
975
views
goclasses2024_wq5
goclasses
mathematical-logic
propositional-logic
2-marks
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...