Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by imShreyas
9
answers
1
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.6k
views
commented
Feb 18, 2020
DS
gatecse-2020
linked-list
1-mark
+
–
1
answer
2
TLB hit ration and memory lookup time
Consider a system where TLB lookup time is $25$ ns and memory access time is $200$ ns, respectively. Assuming a virtual address space of $2$ KB, page size of $32$ bytes, and a PTE size of $2$ bytes, what is the minimum TLB hit ratio that results in an average v2p (virtual to physical) translation latency of $185$ ns?
Consider a system where TLB lookup time is $25$ ns and memory access time is $200$ ns, respectively. Assuming a virtual address space of $2$ KB, page size of $32$ bytes, ...
769
views
commented
Dec 24, 2019
Operating System
translation-lookaside-buffer
hit-ratio
+
–
1
answer
3
GATE-1990
What would the output?
What would the output?
388
views
commented
Dec 11, 2019
1
answer
4
Ace Test Series 2019: DBMS - SQL Output
1.2k
views
commented
Dec 1, 2019
Databases
databases
sql
ace-test-series
+
–
1
answer
5
ISI2018-DCG-19
The area of the region formed by line segments joining the points of intersection of the circle $x^2+y^2-10x-6y+9=0$ with the two axes in succession in a definite order (clockwise or anticlockwise) is $16$ $9$ $3$ $12$
The area of the region formed by line segments joining the points of intersection of the circle $x^2+y^2-10x-6y+9=0$ with the two axes in succession in a definite order (...
357
views
commented
Nov 29, 2019
Quantitative Aptitude
isi2018-dcg
circle-intersection
non-gate
+
–
0
answers
6
Variation on Birthday Problem
So, I have read the birthday paradox problem, and now I came across below question: Assuming the following: there are no leap years, all years have $n = 365$ days and that people's birthdays are uniformly distributed across the $n$ days of the year. (i) How many ... $n=23$, this works out to be 0.53 and Yes it seems to me I am done. Please correct me If I am wrong.
So, I have read the birthday paradox problem, and now I came across below question: Assuming the following: there are no leap years, all years have $n = 365$ days and tha...
746
views
commented
Nov 23, 2019
Probability
probability
+
–
1
answer
7
ISI2017-DCG-29
The area (in square unit) of the portion enclosed by the curve $\sqrt{2x}+ \sqrt{2y} = 2 \sqrt{3}$ and the axes of reference is $2$ $4$ $6$ $8$
The area (in square unit) of the portion enclosed by the curve $\sqrt{2x}+ \sqrt{2y} = 2 \sqrt{3}$ and the axes of reference is$2$$4$$6$$8$
449
views
answered
Nov 18, 2019
Geometry
isi2017-dcg
non-gate
geometry
area
+
–
1
answer
8
CMI2019-B-3
There is a party of $n$ people. Each attendee has at most $r$ friends in the party. The friend circle of a person includes the person and all her friends. You are required to pick some people for a party game, with the restriction that at most one person is picked from each friend circle. Show that you can pick $\dfrac{n}{r^{2}+1}$ people for the game.
There is a party of $n$ people. Each attendee has at most $r$ friends in the party. The friend circle of a person includes the person and all her friends. You are require...
689
views
commented
Nov 16, 2019
Combinatory
cmi2019
combinatory
pigeonhole-principle
+
–
2
answers
9
CMI2015-B-04
You are given $n$ positive integers, $d_1, d_2 \dots d_n$, each greater than $0$. Design a greedy algorithm to test whether these integers correspond to the degrees of some $n$-vertex simple undirected graph $G = (V, E)$. [A simple graph has no self-loops and at most one edge between any pair of vertices].
You are given $n$ positive integers, $d_1, d_2 \dots d_n$, each greater than $0$. Design a greedy algorithm to test whether these integers correspond to the degrees of so...
1.6k
views
commented
Nov 15, 2019
Algorithms
cmi2015
descriptive
algorithms
greedy-algorithm
+
–
3
answers
10
GATE CSE 1995 | Question: 1.21
In the interval $[0, \pi]$ the equation $x=\cos x$ has No solution Exactly one solution Exactly two solutions An infinite number of solutions
In the interval $[0, \pi]$ the equation $x=\cos x$ has No solutionExactly one solutionExactly two solutionsAn infinite number of solutions
5.7k
views
commented
Nov 14, 2019
Calculus
gate1995
calculus
normal
maxima-minima
+
–
1
answer
11
ISI2014-DCG-41
The number of permutations of the letters $a, b, c$ and $d$ such that $b$ does not follow $a,c$ does not follow $b$, and $c$ does not follow $d$, is $11$ $12$ $13$ $14$
The number of permutations of the letters $a, b, c$ and $d$ such that $b$ does not follow $a,c$ does not follow $b$, and $c$ does not follow $d$, is$11$$12$$13$$14$
578
views
commented
Nov 13, 2019
Combinatory
isi2014-dcg
combinatory
+
–
3
answers
12
ISI2014-DCG-18
$^nC_0+2^nC_1+3^nC_2+\cdots+(n+1)^nC_n$ equals $2^n+n2^{n-1}$ $2^n-n2^{n-1}$ $2^n$ none of these
$^nC_0+2^nC_1+3^nC_2+\cdots+(n+1)^nC_n$ equals$2^n+n2^{n-1}$$2^n-n2^{n-1}$$2^n$none of these
770
views
answer edited
Nov 13, 2019
Combinatory
isi2014-dcg
combinatory
binomial-theorem
+
–
1
answer
13
ISI2014-DCG-32
Consider $30$ multiple-choice questions, each with four options of which exactly one is correct. Then the number of ways one can get only the alternate questions correctly answered is $3^{15}$ $2^{31}$ $2 \times \begin{pmatrix} 30 \\ 15 \end{pmatrix}$ $2 \times 3^{15}$
Consider $30$ multiple-choice questions, each with four options of which exactly one is correct. Then the number of ways one can get only the alternate questions correctl...
980
views
commented
Nov 12, 2019
Combinatory
isi2014-dcg
combinatory
+
–
12
answers
14
GATE CSE 2006 | Question: 48
Let $T$ be a depth first search tree in an undirected graph $G$. Vertices $u$ and $ν$ are leaves of this tree $T$. The degrees of both $u$ and $ν$ in $G$ are at least $2$ ... exist a cycle in $G$ containing $u$ and $ν$ There must exist a cycle in $G$ containing $u$ and all its neighbours in $G$
Let $T$ be a depth first search tree in an undirected graph $G$. Vertices $u$ and $ν$ are leaves of this tree $T$. The degrees of both $u$ and $ν$ in $G$ are at least $...
21.2k
views
commented
Nov 7, 2019
Algorithms
gatecse-2006
algorithms
graph-algorithms
normal
+
–
4
answers
15
GATE CSE 2014 Set 3 | Question: 13
Suppose depth first search is executed on the graph below starting at some unknown vertex. Assume that a recursive call to visit a vertex is made only after first checking that the vertex has not been visited earlier. Then the maximum possible recursion depth (including the initial call) is _________.
Suppose depth first search is executed on the graph below starting at some unknown vertex. Assume that a recursive call to visit a vertex is made only after first checkin...
17.2k
views
commented
Nov 7, 2019
Algorithms
gatecse-2014-set3
algorithms
graph-algorithms
numerical-answers
normal
graph-search
+
–
0
answers
16
Peter Linz Edition 4 Exercise 7.3 Question 18 (Page No. 200)
Give an example of a deterministic context-free language whose reverse is not deterministic.
Give an example of a deterministic context-free language whose reverse is not deterministic.
466
views
commented
Nov 7, 2019
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
context-free-language
+
–
1
answer
17
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 44 (Page No. 470)
In certain countries, when two people meet they bow to each other. The protocol is that one of them bows first and stays down until the other one bows. If they bow at the same time, they will both stay bowed forever. Write a program that does not deadlock.
In certain countries, when two people meet they bow to each other. The protocol is that one of them bows first and stays down until the other one bows. If they bow at the...
714
views
commented
Nov 6, 2019
Operating System
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
descriptive
+
–
1
answer
18
Logic Gates and switching circuits
The gates G1 & G2 in the figure have propagation delays of 10ns and 20ns respectively. If the input Vi makes an abrupt change from logic 0 to 1 at time t=t0 , then what's the output waveform V0 is ? Also please explain how to handle such kinds of questions of waveform?
The gates G1 & G2 in the figure have propagation delays of 10ns and 20ns respectively. If the input Vi makes an abrupt change from logic 0 to 1 at time t=t0 , then what's...
6.7k
views
commented
Nov 3, 2019
Digital Logic
digital-logic
digital-circuits
+
–
3
answers
19
UGC NET CSE | June 2019 | Part 1 | Question: 21
Oar is to rowboat as foot is to running sneaker skateboard jumping
Oar is to rowboat as foot is torunningsneakerskateboardjumping
900
views
answered
Jul 4, 2019
Verbal Aptitude
ugcnetcse-june2019-paper1
general-aptitude
verbal-aptitude
+
–
0
answers
20
Cormen Edition 3 Exercise 10.2 Question 8 (Page No. 241)
Explain how to implement doubly linked lists using only one pointer value $x.np$ per item instead of the usual two (next and prev). Assume that all pointer values can be interpreted as $k$-bit integers, and define $x.np$ ... $INSERT$, and $DELETE$ operations on such a list. Also, show how to reverse such a list in $O(1)$ time.
Explain how to implement doubly linked lists using only one pointer value $x.np$ per item instead of the usual two (next and prev). Assume that all pointer values can be ...
653
views
commented
Jul 2, 2019
Algorithms
cormen
data-structures
linked-list
descriptive
difficult
+
–
1
answer
21
Self doubt
$L=\{wxyw|w,x,y\in (a+b)^+ \}$ $L$ is ? Regular Deterministic CFL Non-deterministic CFL CSL
$L=\{wxyw|w,x,y\in (a+b)^+ \}$$L$ is ?RegularDeterministic CFLNon-deterministic CFLCSL
375
views
answered
Mar 28, 2019
Theory of Computation
theory-of-computation
identify-class-language
+
–
1
answer
22
MadeEasy Test Series 2019: General Aptitude - Work Time
Three identical inlet pipes were opened at 6:00 AM to fill up an empty container. At 8:30 AM, 2 identical pipes (having different rate from existing pipe's rate) are also opened. At 9:30 AM, it still required 1 more ... 8:30 AM can individually fill up the empty container in 40 hours, then the capacity of the container is ____________ m3.
Three identical inlet pipes were opened at 6:00 AM to fill up an empty container. At 8:30 AM, 2 identical pipes (having different rate from existing pipe’s rate) are al...
882
views
answered
Feb 18, 2019
Quantitative Aptitude
general-aptitude
quantitative-aptitude
work-time
made-easy-test-series
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register