Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Saurabh666
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Saurabh666
12
answers
1
GATE CSE 1994 | Question: 1.6, ISRO2008-29
The number of distinct simple graphs with up to three nodes is $15$ $10$ $7$ $9$
The number of distinct simple graphs with up to three nodes is$15$$10$$7$$9$
34.5k
views
answered
Oct 19, 2019
Graph Theory
gate1994
graph-theory
graph-connectivity
combinatory
normal
isro2008
counting
+
–
4
answers
2
GATE CSE 2019 | Question: 20
An array of $25$ distinct elements is to be sorted using quicksort. Assume that the pivot element is chosen uniformly at random. The probability that the pivot element gets placed in the worst possible location in the first round of partitioning (rounded off to $2$ decimal places) is ________
An array of $25$ distinct elements is to be sorted using quicksort. Assume that the pivot element is chosen uniformly at random. The probability that the pivot element ge...
16.1k
views
answered
Feb 21, 2019
Algorithms
gatecse-2019
numerical-answers
algorithms
quick-sort
probability
1-mark
+
–
6
answers
3
GATE CSE 2019 | Question: 49
Consider that $15$ machines need to be connected in a LAN using $8$-port Ethernet switches. Assume that these switches do not have any separate uplink ports. The minimum number of switches needed is ______
Consider that $15$ machines need to be connected in a LAN using $8$-port Ethernet switches. Assume that these switches do not have any separate uplink ports. The minimum ...
19.7k
views
answered
Feb 21, 2019
Computer Networks
gatecse-2019
numerical-answers
computer-networks
lan-technologies
2-marks
+
–
6
answers
4
GATE CSE 2019 | Question: GA-2
The search engine’s business model ____ around the fulcrum of trust. revolves plays sinks bursts
The search engine’s business model ____ around the fulcrum of trust.revolvesplayssinksbursts
5.7k
views
answered
Feb 9, 2019
Verbal Aptitude
gatecse-2019
general-aptitude
verbal-aptitude
english-grammar
1-mark
+
–
4
answers
5
GATE CSE 2014 Set 3 | Question: 34
Consider the basic block given below. a = b + c c = a + d d = b + c e = d - b a = e + b The minimum number of nodes and edges present in the DAG representation of the above basic block respectively are $6$ and $6$ $8$ and $10$ $9$ and $12$ $4$ and $4$
Consider the basic block given below. a = b + c c = a + d d = b + c e = d - b a = e + b The minimum number of nodes and edges present in the DAG representation of the abo...
34.7k
views
commented
Jan 9, 2018
Compiler Design
gatecse-2014-set3
compiler-design
code-optimization
directed-acyclic-graph
normal
+
–
4
answers
6
GATE CSE 2006 | Question: 14, ISRO2011-14
Which one of the following in place sorting algorithms needs the minimum number of swaps? Quick sort Insertion sort Selection sort Heap sort
Which one of the following in place sorting algorithms needs the minimum number of swaps?Quick sortInsertion sortSelection sortHeap sort
25.2k
views
commented
Jan 3, 2018
Algorithms
gatecse-2006
algorithms
sorting
easy
isro2011
+
–
4
answers
7
GATE CSE 2011 | Question: 20, UGCNET-June2013-II: 48
Let the page fault service time be $10$ milliseconds(ms) in a computer with average memory access time being $20$ nanoseconds (ns). If one page fault is generated every $10^6$ memory accesses, what is the effective access time for memory? $21$ ns $30$ ns $23$ ns $35$ ns
Let the page fault service time be $10$ milliseconds(ms) in a computer with average memory access time being $20$ nanoseconds (ns). If one page fault is generated every $...
26.5k
views
comment edited
Dec 28, 2017
Operating System
gatecse-2011
operating-system
virtual-memory
normal
ugcnetcse-june2013-paper2
+
–
6
answers
8
Self doubt
Does fixed size partitioning suffer from external fragmentation?
Does fixed size partitioning suffer from external fragmentation?
9.4k
views
commented
Dec 28, 2017
Operating System
operating-system
memory-management
+
–
0
answers
9
Memory Management
Does external fragmentation occur in fixed partition scheme?
Does external fragmentation occur in fixed partition scheme?
192
views
asked
Dec 28, 2017
4
answers
10
GATE CSE 1997 | Question: 6.5
Which one of the following is not decidable? Given a Turing machine $M$, a string $s$ and an integer $k$, $M$ accepts $s$ within $k$ steps Equivalence of two given Turing machines Language accepted by a given finite state machine is not empty Language generated by a context free grammar is non-empty
Which one of the following is not decidable?Given a Turing machine $M$, a string $s$ and an integer $k$, $M$ accepts $s$ within $k$ stepsEquivalence of two given Turing m...
10.0k
views
commented
Dec 14, 2017
Theory of Computation
gate1997
theory-of-computation
decidability
easy
+
–
6
answers
11
GATE CSE 2012 | Question: 15
Which of the following statements are TRUE about an SQL query? P : An SQL query can contain a HAVING clause even if it does not have a GROUP BY clause Q : An SQL query can contain a HAVING clause only if it has a GROUP BY clause R : All attributes used ... Not all attributes used in the GROUP BY clause need to appear in the SELECT clause P and R P and S Q and R Q and S
Which of the following statements are TRUE about an SQL query?P : An SQL query can contain a HAVING clause even if it does not have a GROUP BY clauseQ : An SQL query can ...
39.7k
views
commented
Dec 8, 2017
Databases
gatecse-2012
databases
easy
sql
ambiguous
+
–
3
answers
12
GATE CSE 2014 Set 2 | Question: 29
Consider the following schedule S of transactions $T1, T2, T3, T4:$ ... S is not conflict-serializable but is recoverable S is both conflict-serializable and recoverable S is neither conflict-serializable not is it recoverable
Consider the following schedule S of transactions $T1, T2, T3, T4:$$${\begin{array}{|l|l|l|l|}\hline\textbf{T1}& \textbf{T2}& \textbf{T3}& \textbf{T4} \\\hline& \...
28.1k
views
commented
Dec 2, 2017
Databases
gatecse-2014-set2
databases
transaction-and-concurrency
conflict-serializable
normal
+
–
2
answers
13
GATE CSE 2011 | Question: 41
Consider an instruction pipeline with four stages $\text{(S1, S2, S3 and S4)}$ each with combinational circuit only. The pipeline registers are required between each stage and at the end of the last stage. Delays for the stages and for the pipeline ... under ideal conditions when compared to the corresponding non-pipeline implementation? $4.0$ $2.5$ $1.1$ $3.0$
Consider an instruction pipeline with four stages $\text{(S1, S2, S3 and S4)}$ each with combinational circuit only. The pipeline registers are required between each stag...
13.5k
views
commented
Nov 30, 2017
CO and Architecture
gatecse-2011
co-and-architecture
pipelining
normal
+
–
3
answers
14
GATE IT 2008 | Question: 15
A processor that has the carry, overflow and sign flag bits as part of its program status word (PSW) performs addition of the following two $2's$ complement numbers $01001101$ and $11101001$. After the execution of this addition operation, the status of the carry, overflow and sign flags, respectively will be: $1, 1, 0$ $1, 0, 0$ $0, 1, 0$ $1, 0, 1$
A processor that has the carry, overflow and sign flag bits as part of its program status word (PSW) performs addition of the following two $2's$ complement numbers $0100...
14.2k
views
commented
Nov 29, 2017
Digital Logic
gateit-2008
digital-logic
number-representation
normal
+
–
1
answer
15
Relative Addressing Mode
3.3k
views
commented
Nov 28, 2017
1
answer
16
ace test series 2018
658
views
commented
Nov 4, 2017
Computer Networks
computer-networks
bit-stuffing
+
–
7
answers
17
GATE CSE 2012 | Question: 45
Consider an instance of TCP's Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of the slow start phase is $2$ MSS and the threshold at the start of the first transmission is $8$ MSS. Assume that a timeout occurs during ... Find the congestion window size at the end of the tenth transmission. $8$ MSS $14$ MSS $7$ MSS $12$ MSS
Consider an instance of TCP’s Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of the slow start phase is $2$ MSS and the t...
38.1k
views
commented
Sep 25, 2017
Computer Networks
gatecse-2012
computer-networks
congestion-control
normal
+
–
17
answers
18
GATE CSE 2016 Set 2 | Question: 40
The number of ways in which the numbers $1, 2, 3, 4, 5, 6, 7$ can be inserted in an empty binary search tree, such that the resulting tree has height $6$, is _________. Note: The height of a tree with a single node is $0$.
The number of ways in which the numbers $1, 2, 3, 4, 5, 6, 7$ can be inserted in an empty binary search tree, such that the resulting tree has height $6$, is _________.No...
49.5k
views
commented
Jul 2, 2017
DS
gatecse-2016-set2
data-structures
binary-search-tree
normal
numerical-answers
+
–
2
answers
19
GATE IT 2004 | Question: 1
In a population of $N$ families, $50 \%$ of the families have three children, $30 \%$ of the families have two children and the remaining families have one child. What is the probability that a randomly picked child belongs to a family with two children? $\left(\dfrac{3}{23}\right)$ $\left(\dfrac{6}{23}\right)$ $\left(\dfrac{3}{10}\right)$ $\left(\dfrac{3}{5}\right)$
In a population of $N$ families, $50 \%$ of the families have three children, $30 \%$ of the families have two children and the remaining families have one child. What is...
10.4k
views
commented
Jun 28, 2017
Probability
gateit-2004
probability
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register