Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
avadh
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by avadh
0
answers
1
Swap consecutive algorithm
There are n students standing in a line. The students have to rearrange themselves in ascending order of their roll numbers. This rearrangement must be accomplished only by successive swapping of adjacent students. (i) Design an algorithm for this purpose ... of swaps required. (ii) Derive an expression for the number of swaps needed by your algorithm in the worst case.
There are n students standing in a line. The students have to rearrange themselves in ascending order of their roll numbers. This rearrangement must be accomplished only ...
261
views
commented
Oct 12, 2021
5
answers
2
made easy test series:algorithms,sorting
why not merge sort?we don’t swap in merge sort,we just create auxillary arrays and merge them by changing elements in the original array.should we consider that as a swap?
why not merge sort?we don’t swap in merge sort,we just create auxillary arrays and merge them by changing elements in the original array.should we consider that as a sw...
2.0k
views
commented
Oct 12, 2021
Algorithms
made-easy-test-series
algorithms
sorting
+
–
2
answers
3
Sorting(Algorithms)
The complexity of comparison based sorting algorithm is (nlogn) .How?
The complexity of comparison based sorting algorithm is (nlogn) .How?
631
views
commented
Oct 12, 2021
Algorithms
algorithms
time-complexity
sorting
+
–
9
answers
4
AVL tree
The number of different orders are possible for elements 1, 2, 3, 4, 5, 6, 7 to be inserted in to empty AVL tree such that no rotation will be done and element ‘4’ is root are ________.
The number of different orders are possible for elements 1, 2, 3, 4, 5, 6, 7 to be inserted in to empty AVL tree such that no rotation will be done and element ‘4’ is...
8.7k
views
commented
Jan 11, 2021
DS
data-structures
avl-tree
numerical-answers
+
–
3
answers
5
GATE IT 2008 | Question: 35
Which of the following languages is (are) non-regular? $L_1 = \{0^m1^n \mid 0 \leq m \leq n \leq 10000\}$ $L_2 = \{w \mid w $ reads the same forward and backward$\}$ $L_3 = \{w \in \{0, 1\} ^* \mid w$ contains an even number of 0's and an even number of 1's$\}$ $L_2$ and $L_3$ only $L_1$ and $L_2$ only $L_3$ only $L_2$ only
Which of the following languages is (are) non-regular?$L_1 = \{0^m1^n \mid 0 \leq m \leq n \leq 10000\}$$L_2 = \{w \mid w $ reads the same forward and backward$\}$$L_3 = ...
7.2k
views
commented
Jul 29, 2020
Theory of Computation
gateit-2008
theory-of-computation
normal
regular-language
+
–
3
answers
6
GATE CSE 2015 Set 2 | Question: 51
Which of the following is/are regular languages? $L_1: \left\{ wxw^R \mid w, x \in \{a, b\} ^* \text{ and } |w|, |x| > 0\right\}, w^R \text{ is the reverse of string } w$ $L_2: \left\{ a^nb^m \mid m \neq n \text { and } m, n \geq 0 \right\}$ $L_3: \left\{ a^pb^qc^r \mid p, q, r \geq 0 \right\}$ $L_1$ and $L_3$ only $L_2$ only $L_2$ and $L_3$ only $L_3$ only
Which of the following is/are regular languages?$L_1: \left\{ wxw^R \mid w, x \in \{a, b\} ^* \text{ and } |w|, |x| 0\right\}, w^R \text{ is the reverse of string } w$$L...
11.0k
views
commented
Jul 29, 2020
Theory of Computation
gatecse-2015-set2
theory-of-computation
normal
regular-language
+
–
2
answers
7
What is "Strict recoverable" schedule?
Consider the following schedule: $S: r_1(A), w_2(A), Commit_2, w_1(A),w_3(A), Commit_3, Commit_1$ Which of the following is true? a. Schedule is view serializable schedule and strict recoverable schedule b. Schedule is ... know what is "strict schedule" and "recoverable schedule", But then what it means by "strict recoverable"?
Consider the following schedule:$S: r_1(A), w_2(A), Commit_2, w_1(A),w_3(A), Commit_3, Commit_1$Which of the following is true?a. Schedule is view serializable schedule a...
6.7k
views
commented
Jul 28, 2020
Unknown Category
concurrency
databases
transaction-and-concurrency
+
–
2
answers
8
0/1 knapsack
The difference between maximum possible profit for $0/1$ Knapsack and fractional Knapsack problem with capacity $(W)=20$ ... For 0/1 knapsack, we have to make the whole table or there is any direct method to this?
The difference between maximum possible profit for $0/1$ Knapsack and fractional Knapsack problem with capacity $(W)=20$.$\begin{array}{|c|c|c|c|c|c|} \hline \text{Item} ...
4.5k
views
commented
Jan 3, 2020
Algorithms
algorithms
knapsack-problem
+
–
1
answer
9
VANI Question Bank :DBMS
Minimum number of tables required to represent the relation R where the $A_n$ stands for the primary key of each entity is ___________
Minimum number of tables required to represent the relation R where the $A_n$ stands for the primary key of each entity is ___________
655
views
answered
May 27, 2019
Databases
databases
rdbms
+
–
4
answers
10
Doubt on database normalization for relation having all prime attributes
In a relation, if every attribute is prime but key may not be simple then the relation is in ______. A. 1NF B. 2NF C. 3NF D. BCNF
In a relation, if every attribute is prime but key may not be simple then the relation is in ______.A. 1NFB. 2NFC. 3NFD. BCNF
2.4k
views
answered
May 27, 2019
Databases
databases
database-normalization
rdbms
+
–
1
answer
11
cache memory
Consider a two-level memory hierarchy, L1 (cache) has an accessing time of 5 ns and main memory has an accessing time of 100 ns. Writing or updating contents takes 20 ns and 200 ns for L1 and main memory respectively. Assume L1 gives misses 20% ... instructions being read-only instructions. What is the average access time for the system (in ns) if it uses the WRITETHROUGH technique?
Consider a two-level memory hierarchy, L1 (cache) has an accessing time of 5 ns and main memory has an accessing time of 100 ns. Writing or updating contents takes 20 ns...
1.3k
views
commented
Jan 23, 2019
CO and Architecture
co-and-architecture
cache-memory
multilevel-cache
numerical-answers
+
–
1
answer
12
ME Test series
264
views
answered
Jan 12, 2019
3
answers
13
Doubt [Graph Theory]
Is it possible that a disconnected graph be an Euler graph ?
Is it possible that a disconnected graph be an Euler graph ?
1.9k
views
commented
Jan 10, 2019
Graph Theory
graph-theory
euler-graph
+
–
12
answers
14
GATE CSE 2015 Set 3 | Question: 25
Consider a binary tree T that has $200$ leaf nodes. Then the number of nodes in T that have exactly two children are ______.
Consider a binary tree T that has $200$ leaf nodes. Then the number of nodes in T that have exactly two children are ______.
23.8k
views
answered
Dec 28, 2018
DS
gatecse-2015-set3
data-structures
binary-tree
normal
numerical-answers
+
–
5
answers
15
GATE CSE 2014 Set 1 | Question: 31
An operating system uses the Banker's algorithm for deadlock avoidance when managing the allocation of three resource types $X, Y,$ and $Z$ to three processes $P0, P1,$ and $P2.$ The table given below presents the current system state. ... be permitted. Only REQ2 can be permitted. Both REQ1 and REQ2 can be permitted. Neither REQ1 nor REQ2 can be permitted.
An operating system uses the Banker's algorithm for deadlock avoidance when managing the allocation of three resource types $X, Y,$ and $Z$ to three processes $P0, P1,$ a...
21.9k
views
commented
Dec 24, 2018
Operating System
gatecse-2014-set1
operating-system
resource-allocation
normal
+
–
2
answers
16
Made easy question: Disk scheduling
1.0k
views
answered
Dec 24, 2018
6
answers
17
SSTF Disk Scheduling
My answer is 202 given 232
My answer is 202given 232
1.9k
views
answered
Dec 24, 2018
Operating System
operating-system
disk-scheduling
+
–
4
answers
18
Self Doubt regarding C-SCAN
Consider a disk has 200 cylinders, numbered from 0 to 199. At some time the disk arm is at cylinder 100, and moving towards right direction. There is a queue of disk access requests for cylinders 30, 85, 110, 100, 105, 126, 135, 55 and ... the R/W head when the LOOK algorithm is used compared to the CSCAN algorithm is ________. Please also mention the method of C-SCAN.
Consider a disk has 200 cylinders, numbered from 0 to 199. At some time the disk arm is at cylinder 100, and moving towards right direction. There is a queue of disk acce...
4.1k
views
commented
Dec 24, 2018
Operating System
operating-system
disk-scheduling
+
–
2
answers
19
payload of a packet
Suppose a packet of length 1800 bytes with minimum header size enter a local area network with MTU (Maximum transfer unit ) of 500 bytes, then how many fragments will be generated from the packet and what is size of the payload of the last packet ?
Suppose a packet of length 1800 bytes with minimum header size enter a local area network with MTU (Maximum transfer unit ) of 500 bytes, then how many fragments will be ...
2.2k
views
commented
Dec 22, 2018
Computer Networks
computer-networks
ip-packet
+
–
4
answers
20
TCP Congestion Control
1.2k
views
answered
Dec 20, 2018
Computer Networks
computer-networks
congestion-control
tcp
+
–
4
answers
21
TCP-congestion control
Assume a scenario where the size of congestion window of a TCP connection be 40 KB when a timeout occurs. The maximum segment size (MSS) be 2 KB. Let the propagation delay be 200 msec. The time taken by the TCP connection to get back to 40 ... is 6000msec.I am taking MSS as 2KB.ls someone explain NOTE:same question also asked here https://gateoverflow.in/1794/gate2014-1-27
Assume a scenario where the size of congestion window of a TCP connection be 40 KB when a timeout occurs. The maximum segment size (MSS) be 2 KB. Let the propagation dela...
3.5k
views
answered
Dec 20, 2018
Computer Networks
computer-networks
congestion-control
+
–
5
answers
22
MadeEasy Test Series: Computer Networks - Congestion Control
Initially (as slow start ) full window 12MSS cwnd = 1MSS ssthresh = 6MSS 1MSS sent after 1st RTT -> cwnd = 2 , and so on subsequent RTT -> 4 , 5 ,6, 7, 8,9,10,11,12 so 11RTT so answer should be 110ms but none of the option matches
Initially (as slow start )full window 12MSScwnd = 1MSSssthresh = 6MSS1MSS sent after 1st RTT - cwnd = 2 ,and so on subsequent RTT - 4 , 5 ,6, 7, 8,9,10,11,12so 11RTTso an...
1.5k
views
commented
Dec 20, 2018
Computer Networks
made-easy-test-series
computer-networks
congestion-control
+
–
0
answers
23
Slow-Start
Consider the size of congestion window of a TCP connection be 36 KB when a timeout occurs. The round trip time of the connection is 200 μsec and the maximum segment size used is 2 KB. What is the time taken by the TCP connection to get back to 36 KB congestion window ... μsec D 2800 μsec Given answer is based on segments send but i think it should not be the case ! Please verify.
Consider the size of congestion window of a TCP connection be 36 KB when a timeout occurs. The round trip time of the connection is 200 μsec and the maximum segment size...
473
views
commented
Dec 20, 2018
Computer Networks
computer-networks
made-easy-test-series
+
–
4
answers
24
TCP-Congestion control
Consider a TCP connection using the slow start congestion control scheme with an initial threshold value of 64 kB and a Maximum Segment Size (MSS) of 2 kB. The receiver's advertised window is initially 32 kB. The first transmission attempt is numbered 0, and all transmission ... size of sender's congestion window at attempt number 10? a. 16 KB b. 18 KB c. 20 KB d. 22 KB
Consider a TCP connection using the slow start congestion control scheme with an initial threshold value of 64 kB and aMaximum Segment Size (MSS) of 2 kB. The receiver’...
678
views
answered
Dec 20, 2018
2
answers
25
slow start
Suppose TCP's additive increase and multiplicative decrease algorithm is used as a congestion control algorithm. The slow start phase begins with 4 MSS and threshold at start of first transmission is 16 MSS. Assume that a time-out occurs during 6 th transmission ... ://gateoverflow.in/2156/gate2012_45 I'm not satisfied with the answer here. Shouldn't it start with 1 MSS again?
Suppose TCP’s additive increase and multiplicative decrease algorithm is used as a congestion control algorithm. The slow start phase begins with 4 MSS and threshold at...
596
views
answered
Dec 20, 2018
Computer Networks
congestion-control
sliding-window
+
–
3
answers
26
Super Key 1
Consider the following relational schema R(ABCDE). The number of super keys in relation R if every two attributes of relation R is candidate keys are __________. Please explain a general method to solve
Consider the following relational schema R(ABCDE). The number of super keys in relation R if every two attributes of relation R is candidate keys are __________.Please ex...
1.4k
views
answered
Dec 19, 2018
Databases
superkeys
databases
+
–
0
answers
27
Test Series
Consider the following graph: Which of the following will represents the chromatic number of the graph? I think ans has to be 3 but given as 4
Consider the following graph:Which of the following will represents the chromatic number of the graph?I think ans has to be 3 but given as 4
381
views
commented
Nov 28, 2018
Graph Theory
graph-theory
graph-coloring
+
–
4
answers
28
TIFR CSE 2014 | Part B | Question: 15
Consider the set $N^{*}$ of finite sequences of natural numbers with $x \leq_{p}y$ denoting that sequence $x$ is a prefix of sequence $y$. Then, which of the following is true? $N^{*}$ is uncountable. $\leq_{p}$ is a total order. Every non ... -empty subset of $N^{*}$ has a greatest lower bound. Every non-empty finite subset of $N^{*}$ has a least upper bound.
Consider the set $N^{*}$ of finite sequences of natural numbers with $x \leq_{p}y$ denoting that sequence $x$ is a prefix of sequence $y$. Then, which of the following is...
3.5k
views
answered
Oct 31, 2018
Set Theory & Algebra
tifr2014
set-theory&algebra
partial-order
lattice
+
–
1
answer
29
DRDO2009: Operating System - Resource Allocation
which of the following is true? a:resource preemption is allowed in deadlock can be avoided but cannot be prevented B: if the number of shared resources is greater than the number of process then deadlock can be ... section D: deadlock avoidance schemes required information concerning which resource a process will request and used during its lifetime
which of the following is true?a:resource preemption is allowed in deadlock can be avoided but cannot be preventedB: if the number of shared resources is greater than the...
2.3k
views
answered
Oct 29, 2018
Operating System
drdo2009
operating-system
resource-allocation
+
–
3
answers
30
UGC NET CSE | August 2016 | Part 2 | Question: 40
Consider three CPU intensive processes $P1, P2, P3$ which require $20, 10$ and $30$ units of time, arrive at times $1, 3$ and $7$ respectively. Suppose operating system is implementing Shortest Remaining Time first (preemptive scheduling) algorithm, then ... the beginning of Ready queue and at the end of Ready queue are not counted). $3$ $2$ $4$ $5$
Consider three CPU intensive processes $P1, P2, P3$ which require $20, 10$ and $30$ units of time, arrive at times $1, 3$ and $7$ respectively. Suppose operating system i...
5.8k
views
answered
Oct 23, 2018
Operating System
ugcnetcse-aug2016-paper2
operating-system
process-scheduling
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register