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 Mohnish
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Mohnish
1
answer
1
% time of CPU blocked in DMA
Please Explain the formulae for % time of CPU blocked in both Cycle Stealing mode and Burst mode of DMA
commented
in
CO and Architecture
Feb 5, 2021
6.4k
views
co-and-architecture
dma
4
answers
2
GATE CSE 2007 | Question: 17
Consider the following statements about user level threads and kernel level threads. Which one of the following statements is FALSE? Context switch time is longer for kernel level threads than for user level threads. User level threads do ... be scheduled on different processors in a multi-processor system. Blocking one kernel level thread blocks all related threads.
answered
in
Operating System
Feb 2, 2021
17.2k
views
gatecse-2007
operating-system
threads
normal
8
answers
3
GATE CSE 2018 | Question: 14
Consider the following statements regarding the slow start phase of the TCP congestion control algorithm. Note that cwnd stands for the TCP congestion window and MSS window denotes the Maximum Segments Size: The cwnd increases by $2$ MSS on every successful acknowledgment The cwnd ... true Only $\text{(iv)}$ is true Only $\text{(i)}$ and $\text{(iv)}$ are true
commented
in
Computer Networks
Jan 20, 2021
17.3k
views
gatecse-2018
computer-networks
tcp
congestion-control
normal
1-mark
4
answers
4
GATE IT 2007 | Question: 60
For the network given in the figure below, the routing tables of the four nodes $A$, $E$, $D$ and $G$ are shown. Suppose that $F$ has estimated its delay to its neighbors, $A$, $E$, $D$ and $G$ as $8$, $10$, $12$ and $6$ msecs respectively and updates its ...
commented
in
Computer Networks
Jan 18, 2021
7.2k
views
gateit-2007
computer-networks
distance-vector-routing
normal
6
answers
5
GATE IT 2005 | Question: 76
A company has a class $C$ network address of $204.204.204.0$. It wishes to have three subnets, one with $100$ hosts and two with $50$ ... $204.204.204.128/255.255.255.128$ $204.204.204.64/255.255.255.192$ $204.204.204.0/255.255.255.192$
commented
in
Computer Networks
Jan 16, 2021
11.4k
views
gateit-2005
computer-networks
subnetting
normal
3
answers
6
GATE CSE 1992 | Question: 03,iii
How many edges can there be in a forest with $p$ components having $n$ vertices in all?
commented
in
Graph Theory
Jan 7, 2021
4.9k
views
gate1992
graph-theory
graph-connectivity
descriptive
3
answers
7
TIFR CSE 2012 | Part B | Question: 2
In a graph, the degree of a vertex is the number of edges incident (connected) on it. Which of the following is true for every graph $G$? There are even number of vertices of even degree. There are odd number of vertices of even degree ... even number of vertices of odd degree. There are odd number of vertices of odd degree. All the vertices are of even degree.
commented
in
Graph Theory
Jan 7, 2021
2.2k
views
tifr2012
graph-theory
degree-of-graph
11
answers
8
GATE CSE 2014 Set 1 | Question: 12
Consider a rooted n node binary tree represented using pointers. The best upper bound on the time required to determine the number of subtrees having exactly $4$ nodes is $O(n^a\log^bn)$. Then the value of $a+10b$ is __________.
answered
in
DS
Jan 3, 2021
18.5k
views
gatecse-2014-set1
data-structures
binary-tree
numerical-answers
normal
3
answers
9
GATE CSE 2020 | Question: 41
In a balanced binary search tree with $n$ elements, what is the worst case time complexity of reporting all elements in range $[a,b]$? Assume that the number of reported elements is $k$. $\Theta (\log n)$ $\Theta (\log n +k)$ $\Theta (k \log n)$ $\Theta ( n \log k)$
commented
in
DS
Jan 2, 2021
15.8k
views
gatecse-2020
data-structures
binary-search-tree
2-marks
4
answers
10
Context Free Language
L= { $a^{n}b^{m}$ | $n<=m<=2n$ } a) DCFL b) CFL but not DCFL c) Not CFL
commented
in
Theory of Computation
Jan 1, 2021
485
views
context-free-language
theory-of-computation
grammar
12
answers
11
GATE CSE 2015 Set 2 | Question: 40
The number of onto functions (surjective functions) from set $X = \{1, 2, 3, 4\}$ to set $Y=\{a,b,c\}$ is ______.
answered
in
Set Theory & Algebra
Dec 31, 2020
16.0k
views
gatecse-2015-set2
set-theory&algebra
functions
normal
numerical-answers
4
answers
12
TIFR CSE 2017 | Part A | Question: 11
Let $f \: \circ \: g$ denote function composition such that $(f \circ g)(x) = f(g(x))$. Let $f: A \rightarrow B$ such that for all $g \: : \: B \rightarrow A$ and $h \: : \: B \rightarrow A$ ... ) $f$ is one-to-one (injective) $f$ is both one-to-one and onto (bijective) the range of $f$ is finite the domain of $f$ is finite
commented
in
Set Theory & Algebra
Dec 31, 2020
3.0k
views
tifr2017
set-theory&algebra
functions
4
answers
13
GATE CSE 1996 | Question: 2.2
Let $R$ be a non-empty relation on a collection of sets defined by $_{A}R_ B$ if and only if $A \cap B = \phi$. Then, (pick the true statement) $A$ is reflexive and transitive $R$ is symmetric and not transitive $R$ is an equivalence relation $R$ is not reflexive and not symmetric
commented
in
Set Theory & Algebra
Dec 26, 2020
12.0k
views
gate1996
set-theory&algebra
relations
normal
2
answers
14
GATE CSE 1999 | Question: 11a
Consider the following algorithms. Assume, procedure $A$ and procedure $B$ take $O (1)$ and $O(1/n)$ unit of time respectively. Derive the time complexity of the algorithm in $O$-notation. algorithm what (n) begin if n = 1 then call A else begin what (n-1); call B(n) end end.
commented
in
Algorithms
Dec 21, 2020
5.1k
views
gate1999
algorithms
time-complexity
normal
descriptive
9
answers
15
GATE CSE 2003 | Question: 62
In a permutation $a_1\ldots a_n$, of $n$ distinct integers, an inversion is a pair $(a_i, a_j)$ such that $i < j$ and $a_i > a_j.$ What would be the worst case time complexity of the Insertion Sort algorithm, if the inputs are restricted to permutations of $1. . . n$ with at most $n$ inversions? $\Theta(n^2)$ $\Theta(n\log n)$ $\Theta(n^{1.5})$ $\Theta(n)$
answered
in
Algorithms
Dec 17, 2020
16.1k
views
gatecse-2003
algorithms
sorting
normal
insertion-sort
1
answer
16
GATE CSE 2008 | Question: 36
Which of the following are NOT true in a pipelined processor? Bypassing can handle all RAW hazards Register renaming can eliminate all register carried WAR hazards Control hazard penalties can be eliminated by dynamic branch prediction I and II only I and III only II and III only I, II and III
commented
in
CO and Architecture
Dec 16, 2020
18.3k
views
gatecse-2008
pipelining
co-and-architecture
normal
5
answers
17
GATE CSE 2017 Set 1 | Question: 41
Consider a database that has the relation schemas EMP(EmpId, EmpName, DeptId), and DEPT(DeptName, DeptId). Note that the DeptId can be permitted to be NULL in the relation EMP. Consider the following queries on the database expressed in tuple relational calculus. { ... Which of the above queries are safe? I and II only I and III only II and III only I, II and III
answered
in
Databases
Dec 15, 2020
21.1k
views
gatecse-2017-set1
databases
relational-calculus
safe-query
normal
7
answers
18
GATE CSE 2010 | Question: 37
The program below uses six temporary variables $a, b, c, d, e, f$. a = 1 b = 10 c = 20 d = a + b e = c + d f = c + e b = c + e e = b + f d = 5 + e return d + f Assuming that all operations take their operands from registers, what is the minimum number of registers needed to execute this program without spilling? $2$ $3$ $4$ $6$
commented
in
Compiler Design
Dec 14, 2020
16.7k
views
gatecse-2010
compiler-design
target-code-generation
register-allocation
normal
4
answers
19
TIFR CSE 2014 | Part B | Question: 20
Consider the following game. There is a list of distinct numbers. At any round, a player arbitrarily chooses two numbers $a, b$ from the list and generates a new number $c$ by subtracting the smaller number from the larger one. The numbers $a$ and $b$ are put ... $273$. What is the score of the best player for this game? $40$ $16$ $33$ $91$ $123$
answered
in
Algorithms
Dec 13, 2020
2.4k
views
tifr2014
algorithms
identify-function
2
answers
20
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 9, 2020
2.9k
views
gate1998
compiler-design
parsing
descriptive
4
answers
21
GATE CSE 2014 Set 1 | Question: 11
Let $G$ be a graph with $n$ vertices and $m$ edges. What is the tightest upper bound on the running time of Depth First Search on $G$, when $G$ is represented as an adjacency matrix? $\Theta(n)$ $\Theta(n+m)$ $\Theta(n^2)$ $\Theta(m^2)$
commented
in
Algorithms
Dec 6, 2020
10.0k
views
gatecse-2014-set1
algorithms
graph-algorithms
normal
graph-search
7
answers
22
GATE CSE 2009 | Question: 58
Frames of $1000\text{ bits}$ are sent over a $10^6$ bps duplex link between two hosts. The propagation time is $25ms$. Frames are to be transmitted into this link to maximally pack them in transit (within the link). Let $I$ be ... before starting transmission of the next frame? (Identify the closest choice ignoring the frame processing time) $16ms$ $18ms$ $20ms$ $22ms$
commented
in
Computer Networks
Dec 5, 2020
24.5k
views
gatecse-2009
computer-networks
sliding-window
normal
18
answers
23
GATE CSE 2009 | Question: 57, ISRO2016-75
Frames of $\text{1000 bits}$ are sent over a $10^6$ $\text{bps}$ duplex link between two hosts. The propagation time is $\text{25 ms}$. Frames are to be transmitted into this link to maximally pack them in transit (within the link). What is the ... ? Assume that no time gap needs to be given between transmission of two frames. $I=2$ $I=3$ $I=4$ $I=5$
answered
in
Computer Networks
Dec 5, 2020
39.1k
views
gatecse-2009
computer-networks
sliding-window
normal
isro2016
1
answer
24
context free language
Show that the language L={xy∣|x|=|y|,x≠y} is context free. Do not give links plz explain in simple manner
commented
in
Theory of Computation
Dec 1, 2020
2.5k
views
3
answers
25
GATE IT 2007 | Question: 62
Let us consider a statistical time division multiplexing of packets. The number of sources is $10$. In a time unit, a source transmits a packet of $1000$ bits. The number of sources sending data for the first $20$ ... unit. Then the average number of backlogged of packets per time unit during the given period is $5$ $4.45$ $3.45$ $0$
commented
in
Computer Networks
Nov 30, 2020
9.8k
views
gateit-2007
computer-networks
communication
normal
2
answers
26
GATE CSE 1990 | Question: 13a
Consider the height-balanced tree $T_{t}$ with values stored at only the leaf nodes, shown in Fig$.4.$ (i) Show how to merge to the tree, $T_{1}$ elements from tree $T_{2}$ shown in Fig$.5$ using node D of tree $T_{1}$. (ii) What is the ... where $T_{1}$ and $T_{2}$ are of height $h_{1}$ and $h_{2}$ respectively, assuming that rotation schemes are given. Give reasons.
commented
in
DS
Nov 28, 2020
2.7k
views
gate1990
data-structures
tree
descriptive
5
answers
27
GATE CSE 2007 | Question: 47
Consider the process of inserting an element into a $Max \: Heap$, where the $Max \: Heap$ is represented by an $array$. Suppose we perform a binary search on the path from the new leaf to the root to find the position for the newly inserted element, the number of $comparisons$ performed is: $\Theta(\log_2n)$ $\Theta(\log_2\log_2n)$ $\Theta(n)$ $\Theta(n\log_2n)$
answered
in
DS
Nov 23, 2020
14.7k
views
gatecse-2007
data-structures
heap
normal
6
answers
28
GATE CSE 2002 | Question: 2.12
A weight-balanced tree is a binary tree in which for each node, the number of nodes in the left sub tree is at least half and at most twice the number of nodes in the right sub tree. The maximum possible height (number of nodes on the path from the root to the furthest ... which of the following? $\log_2 n$ $\log_{\frac{4}{3}} n$ $\log_3 n$ $\log_{\frac{3}{2}} n$
commented
in
DS
Nov 20, 2020
18.5k
views
gatecse-2002
data-structures
binary-tree
normal
5
answers
29
TIFR CSE 2010 | Part B | Question: 26
Suppose there is a balanced binary search tree with $n$ nodes, where at each node, in addition to the key, we store the number of elements in the sub tree rooted at that node. Now, given two elements $a$ and $b$, such that $a < b$ ... $O(n)$ comparisons and $O(n)$ additions, using depth-first- search.
commented
in
DS
Nov 19, 2020
6.9k
views
tifr2010
binary-search-tree
5
answers
30
GATE CSE 2008 | Question: 46
You are given the postorder traversal, $P$, of a binary search tree on the $n$ elements $1, 2, \dots, n$. You have to determine the unique binary search tree that has $P$ as its postorder traversal. What is the time complexity of the most efficient algorithm ... $\Theta(\log n)$ $\Theta(n)$ $\Theta(n\log n)$ None of the above, as the tree cannot be uniquely determined
commented
in
DS
Nov 18, 2020
30.9k
views
gatecse-2008
data-structures
binary-search-tree
normal
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
DRDO Previous Year Papers
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
What are the key things to focus on during the final 10-15 days before the GATE exam to improve performance?
All India GO Classes Mock test
NTA UGC NET JRF December 2022 Apply Online Form 2023
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.8k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.6k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(842)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
@amit166 can you share the reference of the...
Twist at every point Man
Diagonalization of a MatrixIf there is an...
"i applied to amazon for 6 times,flipkart 2...
The Memes were inserted perfectly😁😁