Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
iarnav
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by iarnav
1
answer
1
#Self Doubt OS CPU scheduling?
Does non preemptive CPU scheduling needs hardware support. kindly explain.
Does non preemptive CPU scheduling needs hardware support.kindly explain.
386
views
asked
Jan 12, 2022
Operating System
process-scheduling
operating-system
context-switch
+
–
0
answers
2
#TOC what is the minimum pumping length of this regular language?
2.1k
views
commented
Jan 10, 2022
Theory of Computation
pumping-lemma
theory-of-computation
finite-automata
+
–
1
answer
3
#TOC NPTEL ASSIGNMENT Question about reducibility
Please help me understand this question. I have searched on internet, but not avail. Click this to see the question
Please help me understand this question. I have searched on internet, but not avail. Click this to see the question
449
views
asked
Sep 6, 2021
Theory of Computation
theory-of-computation
reduction
+
–
3
answers
4
TOC Naive Doubt
I'm so confused what happens when you concatenate/MUL Epsilon ε with any input symbol? What is ε.a = ? and what is ε.0 = ? what is ε.1= ?
I'm so confused what happens when you concatenate/MUL Epsilon ε with any input symbol?What is ε.a = ?and what is ε.0 = ?what is ε.1= ?
3.3k
views
answer selected
Oct 9, 2020
Theory of Computation
theory-of-computation
finite-automata
regular-expression
+
–
7
answers
5
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$
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 maxi...
29.9k
views
comment edited
Sep 24, 2020
Computer Networks
gatecse-2009
computer-networks
sliding-window
normal
+
–
1
answer
6
What trees to study in Data structure
Hello may someone tell me what trees need to be studied in Data Structures subject.
Hello may someone tell me what trees need to be studied in Data Structures subject.
575
views
answer selected
Jul 24, 2020
DS
programming-in-c
data-structures
+
–
1
answer
7
#CN SMTP MCQ
Which one of the following protocol is used to receive mail messages? a) smtp b) post office protocol c) internet message access protocol d) all of the mentioned Doubt : Do SMTP also able to receive mail messages?
Which one of the following protocol is used to receive mail messages?a) smtpb) post office protocolc) internet message access protocold) all of the mentioned Doubt : Do S...
4.5k
views
answer selected
Jul 21, 2020
Computer Networks
computer-networks
application-layer-protocols
computer-networks
application-layer-protocols
+
–
1
answer
8
cn TCP doubt
what is the difference between round trip time and propagation delay in tcp/ip protocol? is RTT = 2 * TP ?
what is the difference between round trip time and propagation delay in tcp/ip protocol? is RTT = 2 * TP ?
494
views
answer selected
Jun 14, 2020
Computer Networks
computer-networks
tcp
+
–
1
answer
9
if R1 and R2 are reflexive relations on set A, then is R1 intersection R2 irreflexive?
if R1 and R2 are reflexive relations on set A, then is R1 intersection R2 irreflexive?
if R1 and R2 are reflexive relations on set A, then is R1 intersection R2 irreflexive?
7.3k
views
commented
May 16, 2020
Set Theory & Algebra
set-theory&algebra
relations
+
–
2
answers
10
#Algorithms Time Complexity Analysis of Multistage Graph using Bottom Up Dynamic Programming
Time complexity of Multistage Graph is O(n2) or O(V2) but then some people says it's O(E). So, from O(V2) to O(E) are they taking about dense/complete graphs in which number of edges |E| = |V2|? Kindly help!
Time complexity of Multistage Graph is O(n2) or O(V2) but then some people says it's O(E). So, from O(V2) to O(E) are they taking about dense/complete graphs in which num...
5.0k
views
commented
Apr 26, 2020
Algorithms
algorithms
dynamic-programming
+
–
4
answers
11
Total number of function calls in Merge sort Algorithm
In Merge sort Algorithm when I took input array of size 2 and I got 4 function calls as including original function call with which I call MS algorithm i.e. MS (1,2) and which in turn calls two recursive function calls to merge ... function calls. So, how can I analyze the total number of function calls when input array size is n? thank you!
In Merge sort Algorithm when I took input array of size 2 and I got 4 function calls as including original function call with which I call MS algorithm i.e. MS (1,2) and ...
3.9k
views
commented
Mar 7, 2020
Algorithms
algorithms
merge-sort
sorting
+
–
9
answers
12
GATE CSE 2020 | Question: 16
What is the worst case time complexity of inserting $n$ elements into an empty linked list, if the linked list needs to be maintained in sorted order? $\Theta(n)$ $\Theta(n \log n)$ $\Theta ( n)^{2}$ $\Theta(1)$
What is the worst case time complexity of inserting $n$ elements into an empty linked list, if the linked list needs to be maintained in sorted order?$\Theta(n)$$\Theta(n...
26.2k
views
commented
Feb 12, 2020
DS
gatecse-2020
linked-list
1-mark
+
–
1
answer
13
GATE CSE 2020 | Question: GA-5
There are multiple routes to reach from node $1$ to node $2$, as shown in the network. The cost of travel on an edge between two nodes is given in rupees. Nodes $\text{ }a\text{'}, \text{ }b\text{'}, \text{ }c\text{'}, \text{ }d\text{'}, \text{ }e\text{'},$ ... toll booths. Which is the cheapest route from node $1$ to node $2$? $1-a-c-2$ $1-f-b-2$ $1-b-2$ $1-f-e-2$
There are multiple routes to reach from node $1$ to node $2$, as shown in the network.The cost of travel on an edge between two nodes is given in rupees. Nodes $\text{‘...
4.2k
views
commented
Feb 12, 2020
Quantitative Aptitude
gatecse-2020
quantitative-aptitude
graph-theory
1-mark
+
–
5
answers
14
GATE CSE 2008 | Question: 15
Which of the following tuple relational calculus expression(s) is/are equivalent to $\forall t \in r \left(P\left(t\right)\right)$? $\neg \exists t \in r \left(P\left(t\right)\right)$ $\exists t \notin r \left(P\left(t\right)\right)$ ... $\exists t \notin r \left(\neg P\left(t\right)\right)$ I only II only III only III and IV only
Which of the following tuple relational calculus expression(s) is/are equivalent to $\forall t \in r \left(P\left(t\right)\right)$?$\neg \exists t \in r \left(P\left(t\ri...
13.9k
views
commented
Jan 5, 2020
Databases
gatecse-2008
databases
relational-calculus
normal
+
–
1
answer
15
carry look ahead adder vs ripple carry
$Exclusive-OR$ gate has a propagation delay of $10$ ns and that the $AND$ or $OR$ gates have a propagation delay of $5$ ns.What is the total propagation delay time in the four-bit adder.Assume $FAN-IN =2$ $1)$ ripple adder $2)$ carry look ahead adder
$Exclusive-OR$ gate has a propagation delay of $10$ ns and that the $AND$ or $OR$ gates have a propagation delay of $5$ ns.What is the total propagation delay time in the...
1.1k
views
commented
Nov 9, 2019
Digital Logic
digital-logic
+
–
6
answers
16
GATE CSE 2019 | Question: 38
Let $G$ be any connected, weighted, undirected graph. $G$ has a unique minimum spanning tree, if no two edges of $G$ have the same weight. $G$ has a unique minimum spanning tree, if, for every cut of $G$, there is a unique minimum-weight edge crossing the cut. Which of the following statements is/are TRUE? I only II only Both I and II Neither I nor II
Let $G$ be any connected, weighted, undirected graph.$G$ has a unique minimum spanning tree, if no two edges of $G$ have the same weight.$G$ has a unique minimum spanning...
20.3k
views
comment edited
Oct 16, 2019
Graph Theory
gatecse-2019
engineering-mathematics
discrete-mathematics
graph-theory
graph-connectivity
2-marks
+
–
10
answers
17
GATE CSE 2011 | Question: 54
An undirected graph $G(V,E)$ contains $n \: (n>2)$ nodes named $v_1,v_2, \dots, v_n$. Two nodes $v_i, v_j$ are connected if and only if $ 0 < \mid i-j\mid \leq 2$. Each edge $(v_i,v_j)$ is assigned a weight $i+j$. A sample graph with $n=4$ is shown below. ... spanning tree (MST) of such a graph with $n$ nodes? $\frac{1}{12} (11n^2 - 5 n)$ $n^2-n+1$ $6n-11$ $2n+1$
An undirected graph $G(V,E)$ contains $n \: (n>2)$ nodes named $v_1,v_2, \dots, v_n$. Two nodes $v_i, v_j$ are connected if and only if $ 0 < \mid i-j\mid \leq 2$. Each ...
17.0k
views
commented
Oct 11, 2019
Algorithms
gatecse-2011
algorithms
graph-algorithms
spanning-tree
normal
+
–
2
answers
18
Hashing
Using open addressing with linear probing, we sequentially insert three distinct keys k1, k2 and k3 into a hash table of size m. Assuming simple uniform hashing, what is the probability that we will need three probes, when inserting the third key, k3? 3/m 2/m2 3/m2 2/m Please explain the solution.
Using open addressing with linear probing, we sequentially insert three distinct keys k1, k2 and k3 into a hash table of size m. Assuming simple uniform hashing, what is ...
3.2k
views
commented
Oct 5, 2019
Algorithms
hashing
data-structures
algorithms
uniform-hashing
+
–
4
answers
19
TIFR CSE 2010 | Part B | Question: 27
Consider the Insertion Sort procedure given below, which sorts an array $L$ of size $n\left ( \geq 2 \right )$ in ascending order: begin for xindex:= 2 to n do x := L [xindex]; j:= xindex - 1; while j > 0 and L[j] > x do L[j + ... $n (n - 1) / 2$ comparisons whenever all the elements of $L$ are not distinct.
Consider the Insertion Sort procedure given below, which sorts an array $L$ of size $n\left ( \geq 2 \right )$ in ascending order:begin for xindex:= 2 to n do x := L [xin...
3.7k
views
comment edited
Oct 2, 2019
Algorithms
tifr2010
algorithms
sorting
+
–
1
answer
20
How to find number of swappings in bubble sort in least possible time ( any shortcut available )
1. The number of swappings needed to sort the numbers: 8, 22, 7, 9, 31, 19, 5, 13 in ascending order using bubble sort is- (a) 11 (b) 12 (c) 13 (d) 14 I know how to solve it using ... I did was to write every pass and check the swappings. But , it takes too much time. Is there any shortcut possible ?
1. The number of swappings needed to sort the numbers: 8, 22, 7, 9, 31, 19, 5, 13 in ascending order using bubble sort is—(a) 11 (b) 12(c) 13 (d) 14I know how to solve ...
165k
views
commented
Sep 28, 2019
Algorithms
sorting
algorithms
bubble-sort
+
–
10
answers
21
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)$$\...
31.7k
views
answered
Aug 16, 2019
DS
gatecse-2003
data-structures
binary-heap
+
–
3
answers
22
GATE CSE 1997 | Question: 16
A size-balanced binary tree is a binary tree in which for every node the difference between the number of nodes in the left and right subtree is at most $1$. The distance of a node from the root is the length of the path from the root to the ... height $h \geqslant 1$, how many nodes are at distance $h-1$ from the root? Write only the answer without any explanations.
A size-balanced binary tree is a binary tree in which for every node the difference between the number of nodes in the left and right subtree is at most $1$. The distance...
4.9k
views
commented
Jul 26, 2019
DS
gate1997
data-structures
binary-tree
normal
descriptive
proof
+
–
1
answer
23
what is the best book for-
what is the best standard book for Computer Networks –II . Objectives: The objective of the course is to offer good understanding of the concepts of network security, wireless, Adhoc and various emerging network technologies.
what is the best standard book forComputer Networks –II .Objectives: The objective of the course is to offer good understanding of the concepts of network security, wir...
420
views
answer selected
Jul 25, 2019
Computer Networks
study-resources
+
–
5
answers
24
TIFR CSE 2011 | Part B | Question: 30
Consider an array $A[1...n]$. It consists of a permutation of numbers $1....n$. Now compute another array $B[1...n]$ as follows: $B[A[i]]:= i$ for all $i$. Which of the following is true? $B$ will be a sorted array. $B$ ... of array $A$. Doing the same transformation twice will not give the same array. $B$ is not a permutation of array $A$. None of the above.
Consider an array $A[1...n]$. It consists of a permutation of numbers $1....n$. Now compute another array $B[1...n]$ as follows: $B[A[i]]:= i$ for all $i$. Which of the f...
4.8k
views
comment edited
Jul 22, 2019
DS
tifr2011
data-structures
array
+
–
2
answers
25
GATE IT 2005 | Question: 13
A function $f$ defined on stacks of integers satisfies the following properties. $f(∅) = 0$ and $f (push (S, i)) = max (f(S), 0) + i$ for all stacks $S$ and integers $i$. If a stack $S$ contains the integers $2, -3, 2, -1, 2$ in order from bottom to top, what is $f(S)$? $6$ $4$ $3$ $2$
A function $f$ defined on stacks of integers satisfies the following properties. $f(∅) = 0$ and $f (push (S, i)) = max (f(S), 0) + i$ for all stacks $S$ and integers $i...
17.3k
views
commented
Jul 6, 2019
DS
gateit-2005
data-structures
stack
normal
+
–
0
answers
26
#CLRS #Algorithm Doubt about randomized QuickSort.
1.0k
views
commented
May 30, 2019
Algorithms
algorithms
sorting-algorithms-quicksort
sorting
asymptotic-notation
+
–
1
answer
27
#Algorithms QuickSort Algorithm Doubt regarding pivot and analysis.
884
views
commented
May 23, 2019
Algorithms
algorithms
sorting
+
–
1
answer
28
Mimimum number of comparison to sort 13 elements/numbers for any comparison based sorting algorithm?
I’ve seen this wikipedia article – https://en.wikipedia.org/wiki/Comparison_sortAlso see this link – https://gateoverflow.in/32948/minimum-number-of-comparisonshttp...
834
views
asked
May 4, 2019
Algorithms
algorithms
sorting
+
–
2
answers
29
#Algorithms Quicksort VS Mergesort? Which is a faster sorting algorithm
I did Google and found out that Quicksort is better then Mergesort, but my question is which is faster among both?
I did Google and found out that Quicksort is better then Mergesort, but my question is which is faster among both?
969
views
commented
Apr 26, 2019
Algorithms
algorithms
sorting
+
–
1
answer
30
quick sort
You have an array of n elements. Suppose you implement quick sort by always choosing the central element of the array as the pivot. Then the tightest lower bound for the best case performance is a) O(n2) b) O(nlogn) c) Θ(nlogn) d) O(n3)
You have an array of n elements. Suppose you implement quick sort by always choosing the central element of the array as the pivot. Then the tightest lower bound for the...
2.5k
views
answer selected
Mar 27, 2019
Algorithms
quick-sort
algorithms
sorting
time-complexity
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register