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
Answers by Anurag_s
3
votes
1
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_...
679
views
answered
Mar 15, 2016
Programming in C
programming-in-c
pointers
+
–
1
votes
2
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
answered
Mar 14, 2016
1
votes
3
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
answered
Mar 11, 2016
Operating System
made-easy-test-series
operating-system
process-synchronization
+
–
4
votes
4
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
answered
Mar 9, 2016
Algorithms
algorithms
time-complexity
quick-sort
+
–
0
votes
5
My marks are 34.67 before normalization in set 2 ..can i get any NIT..??
653
views
answered
Mar 7, 2016
3
votes
6
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
answered
Mar 4, 2016
DS
clrs
data-structures
+
–
1
votes
7
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?
477
views
answered
Feb 24, 2016
Interview Questions
iit-interview
+
–
1
votes
8
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
+
–
4
votes
9
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.
422
views
answered
Feb 23, 2016
140
votes
10
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
+
–
34
votes
11
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
+
–
27
votes
12
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
+
–
33
votes
13
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
+
–
4
votes
14
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
+
–
1
votes
15
hamming code
how this relation (m+r+1)<=2^r comes?? please explain.
how this relation (m+r+1)<=2^r comes??please explain.
770
views
answered
Feb 8, 2016
Computer Networks
computer-networks
hamming-code
+
–
3
votes
16
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 ...
357
views
answered
Feb 1, 2016
0
votes
17
probability
if d probability dat an individual suffers a bad reaction frm injection of a serum is 0.001.determine the probability that out of 2000 indivisuals exactly 3 individuals suffer a bad reaction?
if d probability dat an individual suffers a bad reaction frm injection of a serum is 0.001.determine the probability that out of 2000 indivisuals exactly 3 individuals s...
2.3k
views
answered
Jan 5, 2016
Probability
probability
+
–
1
votes
18
Linear Algebra Doubt
while solving linear equations, there comes a case where rank < number of varibles, then we say there are n-r linearly independent solution. What exactly does it mean ?
while solving linear equations, there comes a case where rank < number of varibles,then we say there are n-r linearly independent solution.What exactly does it mean ?
509
views
answered
Jan 4, 2016
Linear Algebra
engineering-mathematics
linear-algebra
+
–
2
votes
19
total possible BST with n nodes
total possible binary search trees with 3 nodes is: 14 15 6 none
total possible binary search trees with 3 nodes is:14 15 6 none
389
views
answered
Jan 3, 2016
87
votes
20
GATE CSE 2011 | Question: 29
We are given a set of $n$ distinct elements and an unlabeled binary tree with $n$ nodes. In how many ways can we populate the tree with the given set so that it becomes a binary search tree? $0$ $1$ $n!$ $\frac{1} {n+1} .^{2n}C_n$
We are given a set of $n$ distinct elements and an unlabeled binary tree with $n$ nodes. In how many ways can we populate the tree with the given set so that it becomes a...
31.5k
views
answered
Jan 2, 2016
DS
gatecse-2011
binary-tree
normal
+
–
3
votes
21
ME-Quick Sort
2.1k
views
answered
Jan 2, 2016
Algorithms
algorithms
made-easy-test-series
quick-sort
numerical-answers
+
–
1
votes
22
Having clause
570
views
answered
Dec 31, 2015
Databases
sql
+
–
92
votes
23
GATE CSE 2003 | Question: 63, ISRO2009-25
A data structure is required for storing a set of integers such that each of the following operations can be done in $O(\log n)$ time, where $n$ is the number of elements in the set. Deletion of the smallest element Insertion of an ... used but not a heap Both balanced binary search tree and heap can be used Neither balanced search tree nor heap can be used
A data structure is required for storing a set of integers such that each of the following operations can be done in $O(\log n)$ time, where $n$ is the number of elements...
20.1k
views
answered
Dec 30, 2015
DS
gatecse-2003
data-structures
easy
isro2009
binary-search-tree
+
–
5
votes
24
GATE CSE 2005 | Question: 4
Which one of the following are essential features of an object-oriented programming language? Abstraction and encapsulation Strictly-typedness Type-safe property coupled with sub-type rule Polymorphism in the presence of inheritance I and II only I and IV only I, II and IV only I, III and IV only
Which one of the following are essential features of an object-oriented programming language?Abstraction and encapsulationStrictly-typednessType-safe property coupled wit...
5.8k
views
answered
Dec 30, 2015
Object Oriented Programming
gatecse-2005
programming
normal
object-oriented-programming
non-gate
+
–
4
votes
25
Recurrence relation explanation
Whenever we have a recurrence relation of type T(n) = a * T(n/b) + c here a is the number of sub problems. what will be Size of sub problems ? Is it n/b ?
Whenever we have a recurrence relation of typeT(n) = a * T(n/b) + chere a is the number of sub problems. what will be Size of sub problems ? Is it n/b ?
304
views
answered
Dec 30, 2015
Algorithms
recurrence-relation
time-complexity
algorithms
+
–
23
votes
26
GATE CSE 2000 | Question: 1.1
The minimum number of cards to be dealt from an arbitrarily shuffled deck of $52$ cards to guarantee that three cards are from same suit is $3$ $8$ $9$ $12$
The minimum number of cards to be dealt from an arbitrarily shuffled deck of $52$ cards to guarantee that three cards are from same suit is$3$$8$$9$$12$
9.9k
views
answered
Dec 29, 2015
Combinatory
gatecse-2000
easy
pigeonhole-principle
combinatory
+
–
2
votes
27
GATE CSE 1996 | Question: 10
Let $A = \begin{bmatrix} a_{11} && a_{12} \\ a_{21} && a_{22} \end{bmatrix} \text { and } B = \begin{bmatrix} b_{11} && b_{12} \\ b_{21} && b_{22} \end{bmatrix}$ be two matrices such that $AB=I$ ... $CD =I$. Express the elements of $D$ in terms of the elements of $B$.
Let $A = \begin{bmatrix} a_{11} && a_{12} \\ a_{21} && a_{22} \end{bmatrix} \text { and } B = \begin{bmatrix} b_{11} && b_{12} \\ b_{21} && b_{22} \end{bmatrix}$ be two m...
4.0k
views
answered
Dec 28, 2015
Linear Algebra
gate1996
linear-algebra
matrix
normal
descriptive
+
–
1
votes
28
OS Scheduling
We are given a computer system consisting of a CPU and a disk. We are told that, each user request has a compute time of 80 msec and an average generates 10 disk requests. We are further told that, the service time at the disk is 10 msec. What is the maximum number of user requests that can be satisfied per second?
We are given a computer system consisting of a CPU and a disk. We are told that, each user request has a compute time of 80 msec and an average generates 10 disk requests...
1.6k
views
answered
Dec 27, 2015
Operating System
process-scheduling
operating-system
+
–
8
votes
29
Find best choice for degree for B+ tree,
Consider a relation R(A B C) with attribute size of A as 8 bytes. Disk block size is 512 bytes and block pointer is 8 bytes. The best choice for degree (maximum value) for B+ tree, if B+ tree was used for creating indexing on R(A B C) is _________.
Consider a relation R(A B C) with attribute size of A as 8 bytes. Disk block size is 512 bytes and block pointer is 8 bytes. The best choice for degree (maximum value) fo...
2.3k
views
answered
Dec 18, 2015
Databases
databases
b-tree
indexing
+
–
1
votes
30
Which Synchronization mechanism suffers from dissatisfaction of Bounde Waiting ?
Peterson's Solution SWAP instruction Strict Alternation Both 2 and 3
Peterson's SolutionSWAP instructionStrict AlternationBoth 2 and 3
461
views
answered
Dec 11, 2015
Operating System
process-synchronization
operating-system
+
–
Page:
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register