Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Anurag_s
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Anurag_s
5
answers
1
What is the complexity of finding 50th smallest element in an already constructed binary min-heap?
What is the complexity of finding $50^{th}$ smallest element in an already constructed binary min-heap? $\Theta(1)$ $\Theta (\log n)$ $\Theta (n)$ $\Theta (n \log n)$
What is the complexity of finding $50^{th}$ smallest element in an already constructed binary min-heap?$\Theta(1)$$\Theta (\log n)$$\Theta (n)$$\Theta (n \log n)$
3.6k
views
answer edited
Jul 7, 2016
DS
data-structures
binary-heap
time-complexity
+
–
4
answers
2
GATE CSE 2006 | Question: 32, ISRO2016-35
Consider the following statements about the context free grammar $G = \left \{ S \rightarrow SS, S \rightarrow ab, S \rightarrow ba, S \rightarrow \epsilon \right \} $ $G$ is ambiguous $G$ produces all strings with equal number of $a$'s ... combination below expresses all the true statements about $G$? I only I and III only II and III only I, II and III
Consider the following statements about the context free grammar$$G = \left \{ S \rightarrow SS, S \rightarrow ab, S \rightarrow ba, S \rightarrow \epsilon \right \} $$$G...
28.6k
views
commented
Jul 6, 2016
Compiler Design
gatecse-2006
compiler-design
context-free-language
normal
isro2016
+
–
3
answers
3
C pointer doubt
What is the difference when I write in program mynode * head; add_node(&head,10); add_node( struct node ** head, into value); To this mynode *head; add_node (head,10); add_node( struct node* head, into value) Which is the correct way of writing?
What is the difference when I write in program mynode * head; add_node(&head,10); add_node( struct node head, into value);To this mynode *head; add_node (head,10); add_...
682
views
commented
Mar 15, 2016
Programming in C
programming-in-c
pointers
+
–
2
answers
4
c array
Under which of the following conditions, the size of an one-dimensional array need to be specified ? a) when initialization is a part of definition b) when it is a declaration c) when it is a formal parameter or actual parameter d) none of the above
Under which of the following conditions, the size of an one-dimensional array need to be specified ?a) when initialization is a part of definitionb) when it is a declarat...
5.2k
views
commented
Mar 14, 2016
2
answers
5
MadeEasy Test Series: Operating System - Process Synchronization
Description of Peterson's Algorithm & also for which problem it is used to solve (1) deadlock (2) mutual exclusion (3) Thrashing (4) Paging.
Description of Peterson's Algorithm & also for which problem it is used to solve(1) deadlock(2) mutual exclusion(3) Thrashing(4) Paging.
3.0k
views
commented
Mar 14, 2016
Operating System
made-easy-test-series
operating-system
process-synchronization
+
–
1
answer
6
what are the key differences among iits, top 4nits(W,T,S,C) and iiits(iiith,iiitb,iiitd ) w.r.t Masters(Mtech/MS) in CSE
What are the key differences among iits, top 4nits(W,T,S,C) and iiits(iiith,iiitb and iiitd only) w.r.t Masters (Mtech/MS) in CSE considering these aspects(feel free to m...
1.8k
views
asked
Mar 12, 2016
1
answer
7
quick sort time complexity
the worst case time complexity of quicksort for an elements when the median is selected as the pivot a. o(n^2) b.o(n) c.o(nlogn) d.o(logn)
the worst case time complexity of quicksort for an elements when the median is selected as the pivota. o(n^2)b.o(n)c.o(nlogn)d.o(logn)
15.7k
views
commented
Mar 9, 2016
Algorithms
algorithms
time-complexity
quick-sort
+
–
1
answer
8
My marks are 34.67 before normalization in set 2 ..can i get any NIT..??
655
views
answered
Mar 7, 2016
1
answer
9
What is the cut off score/rank in Gate for admission in MS in CS at IISc ?
8.5k
views
commented
Mar 6, 2016
IISc/IITs
iisc
ms
+
–
1
answer
10
my marks are 34.67 before normalization.. can i get new nits till third round
557
views
commented
Mar 5, 2016
2
answers
11
Select a data structure that you have seen previously, and discuss its strengths and limitations.
Select a data structure that you have seen previously, and discuss its strengths and limitations.
Select a data structure that you have seen previously, and discuss its strengths and limitations.
2.8k
views
answer edited
Mar 4, 2016
DS
clrs
data-structures
+
–
20
answers
12
GATE CSE 2016 Set 1 | Question: 8
We want to design a synchronous counter that counts the sequence $0-1-0-2-0-3$ and then repeats. The minimum number of $\text{J-K}$ flip-flops required to implement this counter is _____________.
We want to design a synchronous counter that counts the sequence $0-1-0-2-0-3$ and then repeats. The minimum number of $\text{J-K}$ flip-flops required to implement this ...
51.7k
views
commented
Feb 25, 2016
Digital Logic
gatecse-2016-set1
digital-logic
digital-counter
flip-flop
normal
numerical-answers
+
–
2
answers
13
IITD2011
What is pipelining? Whats the need? Whats the funda behind it? Does it make the processor faster?
What is pipelining? Whats the need? Whats the funda behind it? Does it make the processor faster?
478
views
answered
Feb 24, 2016
Interview Questions
iit-interview
+
–
8
answers
14
GATE CSE 2013 | Question: 30
The number of elements that can be sorted in $\Theta(\log n)$ time using heap sort is $\Theta(1)$ $\Theta(\sqrt{\log} n)$ $\Theta(\frac{\log n}{\log \log n})$ $\Theta(\log n)$
The number of elements that can be sorted in $\Theta(\log n)$ time using heap sort is$\Theta(1)$$\Theta(\sqrt{\log} n)$$\Theta(\frac{\log n}{\log \log n})$$\Theta(\log n)...
27.9k
views
answered
Feb 24, 2016
Algorithms
gatecse-2013
algorithms
sorting
normal
heap-sort
+
–
3
answers
15
UGC NET CSE | December 2015 | Part 3 | Question: 27
There are exactly ____ different finite automata with three states $x$, $y$ and $z$ over the alphabet $\{a,b\}$ where $x$ is always the start state $64$ $256$ $1024$ $5832$
There are exactly ____ different finite automata with three states $x$, $y$ and $z$ over the alphabet $\{a,b\}$ where $x$ is always the start state$64$$256$$1024$$5832$
6.8k
views
commented
Feb 24, 2016
Theory of Computation
ugcnetcse-dec2015-paper3
theory-of-computation
+
–
1
answer
16
IITD2011interview
Have you heard of ethernet?” I said “Yes!”. Then I was asked “Can we lay an ethernet LAN between Delhi and Bangalore?
Have you heard of ethernet?” I said “Yes!”. Then I was asked “Can we lay an ethernet LAN between Delhi and Bangalore?
607
views
commented
Feb 24, 2016
2
answers
17
How To Prepare For Written and Interviews?Major Subjects To Focus and Type of Questions asked.
Which IIT's take admission through written Test and Interviews,Upto what Rank They call and Eg Major Subjects To Focus and Type of Questions asked.
Which IIT's take admission through written Test and Interviews,Upto what Rank They call and Eg Major Subjects To Focus and Type of Questions asked.
12.8k
views
commented
Feb 24, 2016
2
answers
18
IITD_2011 Interview
#IITD_2011 If we are give a sorted array and we have to find two elements which sum to a number x.
#IITD_2011If we are give a sorted array and we have to find two elements which sum to a number x.
423
views
answered
Feb 23, 2016
6
answers
19
GATE CSE 2016 Set 1 | Question: 24
Which one of the following protocols is NOT used to resolve one form of address to another one? $\textsf{DNS}$ $\textsf{ARP}$ $\textsf{DHCP}$ $\textsf{RARP}$
Which one of the following protocols is NOT used to resolve one form of address to another one?$\textsf{DNS}$$\textsf{ARP}$$\textsf{DHCP}$$\textsf{RARP}$
18.0k
views
commented
Feb 18, 2016
Computer Networks
gatecse-2016-set1
computer-networks
network-protocols
normal
+
–
8
answers
20
GATE CSE 2016 Set 1 | Question: 32
The stage delays in a $4$-stage pipeline are $800, 500, 400$ and $300$ picoseconds. The first stage (with delay $800$ picoseconds) is replaced with a functionality equivalent design involving two stages with respective delays $600$ and $350$ picoseconds. The throughput increase of the pipeline is ___________ percent.
The stage delays in a $4$-stage pipeline are $800, 500, 400$ and $300$ picoseconds. The first stage (with delay $800$ picoseconds) is replaced with a functionality equiva...
25.5k
views
answered
Feb 17, 2016
CO and Architecture
gatecse-2016-set1
co-and-architecture
pipelining
normal
numerical-answers
+
–
5
answers
21
GATE CSE 2016 Set 1 | Question: 48
Cylinder a disk queue with requests for $I/O$ to blocks on cylinders $47, 38, 121, 191, 87, 11, 92, 10.$ The C-LOOK scheduling algorithm is used. The head is initially at cylinder number $63$, moving towards larger cylinder ... are numbered from $0$ to $199$. The total head movement (in number of cylinders) incurred while servicing these requests is__________.
Cylinder a disk queue with requests for $I/O$ to blocks on cylinders $47, 38, 121, 191, 87, 11, 92, 10.$ The C-LOOK scheduling algorithm is used. The head is initially at...
19.2k
views
answered
Feb 15, 2016
Operating System
gatecse-2016-set1
operating-system
disk-scheduling
normal
numerical-answers
+
–
5
answers
22
GATE CSE 2016 Set 2 | Question: 21
B+ Trees are considered BALANCED because. The lengths of the paths from the root to all leaf nodes are all equal. The lengths of the paths from the root to all leaf nodes differ from each other by at most $1$. The number of children of any two non-leaf sibling nodes differ by at most $1$. The number of records in any two leaf nodes differ by at most $1$.
B+ Trees are considered BALANCED because.The lengths of the paths from the root to all leaf nodes are all equal.The lengths of the paths from the root to all leaf nodes d...
11.6k
views
answered
Feb 12, 2016
Databases
gatecse-2016-set2
databases
b-tree
normal
+
–
4
answers
23
GATE CSE 2016 Set 2 | Question: 14
The Floyd-Warshall algorithm for all-pair shortest paths computation is based on Greedy paradigm. Divide-and-conquer paradigm. Dynamic Programming paradigm. Neither Greedy nor Divide-and-Conquer nor Dynamic Programming paradigm.
The Floyd-Warshall algorithm for all-pair shortest paths computation is based onGreedy paradigm.Divide-and-conquer paradigm.Dynamic Programming paradigm.Neither Greedy no...
7.2k
views
answered
Feb 12, 2016
Algorithms
gatecse-2016-set2
algorithms
dynamic-programming
easy
+
–
1
answer
24
GATE2015 EC-1: GA-7
Read the following paragraph and choose the correct statement. Climate change has reduced human security and threatened human well being. An ignored reality of human progress is that human security largely depends upon environmental ... to environmental security. Human security is contradictory to environmental security. Human progress depends upon environmental security
Read the following paragraph and choose the correct statement.Climate change has reduced human security and threatened human well being. An ignored reality of human progr...
2.0k
views
answered
Feb 12, 2016
Verbal Aptitude
gate2015-ec-1
general-aptitude
verbal-aptitude
passage-reading
+
–
2
answers
25
hamming code
how this relation (m+r+1)<=2^r comes?? please explain.
how this relation (m+r+1)<=2^r comes??please explain.
773
views
answered
Feb 8, 2016
Computer Networks
computer-networks
hamming-code
+
–
2
answers
26
aptitude
1. S, P, M and E are four persons, working on project efficiency of M is twice that of others and M works only for half of the total days worked by E. M works 6 hours/day and E works 12 hours/day. Ratio of contribution of work to project of M and E is (i.e., work done by M work done by (A) 1 : 1 (B) 1 : 2 (C) 1 : 4 (D) 1 : 3
1. S, P, M and E are four persons, working on project efficiency of M is twice that of others and Mworks only for half of the total days worked by E. M works 6 hours/day ...
359
views
answered
Feb 1, 2016
2
answers
27
Does Deadlock imply no Bounded waiting Or no Progress or BOTH of These?
Does Deadlock imply no Bounded waiting Or no Progress or BOTH of These?Also provide explanation in support
Does Deadlock imply no Bounded waiting Or no Progress or BOTH of These?Also provide explanation in support
6.7k
views
asked
Jan 30, 2016
Operating System
deadlock-prevention-avoidance-detection
process-synchronization
+
–
1
answer
28
Which of the following is not a recursive Language? Please explain the reason for each
Which of the following is not a recursive language? a. Regular language b. {$\langle M,w \rangle$ | $M$ is a DFA that accepts $w$} c. {$\langle M \rangle$ | $M$ is a TM and there exists an input which halts within $100$ steps} d. {$\langle M \rangle$ | $M$ is a TM and $L(M)$ is regular }
Which of the following is not a recursive language?a. Regular languageb. {$\langle M,w \rangle$ | $M$ is a DFA that accepts $w$}c. {$\langle M \rangle$ | $M$ is a TM and ...
1.3k
views
commented
Jan 28, 2016
Theory of Computation
theory-of-computation
recursive-and-recursively-enumerable-languages
decidability
+
–
10
answers
29
GATE CSE 2015 Set 1 | Question: 45
Let $G = (V, E)$ be a simple undirected graph, and $s$ be a particular vertex in it called the source. For $x \in V$, let $d(x)$ denote the shortest distance in $G$ from $s$ to $x$. A breadth first search (BFS) is performed starting at $s$. Let $T$ be the ... that is not in $T$, then which one of the following CANNOT be the value of $d(u) - d(v)$? $-1$ $0$ $1$ $2$
Let $G = (V, E)$ be a simple undirected graph, and $s$ be a particular vertex in it called the source. For $x \in V$, let $d(x)$ denote the shortest distance in $G$ from ...
18.0k
views
commented
Jan 21, 2016
Algorithms
gatecse-2015-set1
algorithms
graph-algorithms
normal
graph-search
+
–
1
answer
30
MadeEasy Test Series: Digital Logic - Number Representation
Consider the addition of the two numbers 10001110 and 10000000 in an 8-bit ALU. Which of the following best summarizes the result and the status of the Z(zero), S(sign), C(carry) and O(overflow) flags? Assume that the numbers are represented in 2's Complement format ... = 0, O =1, S = 0 d) Sum = 100001110, Z = 0, C = 1, O =1, S = 0
Consider the addition of the two numbers 10001110 and 10000000 in an 8-bit ALU. Which of the following best summarizes the result and the status of the Z(zero), S(sign), ...
602
views
commented
Jan 19, 2016
CO and Architecture
made-easy-test-series
digital-logic
number-representation
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register