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
Answers by rude
17
votes
121
What is the expected number of probes in a successful search
consider an open address hash table with a total of 10000 slots containing 9800 entries. a) 2 b) 3 c) 4 d) 4.5
consider an open address hash table with a total of 10000 slots containing 9800 entries. a) 2b) 3c) 4d) 4.5
6.9k
views
answered
Jun 1, 2016
4
votes
122
Analysis of code fragment to find time complexity [ACE Gate Practice Booklet Volume 1 Page 127 Question 32]
Consider the following c fragment : void DAA(n) { int i,j,k,x=0; for (i=1 ; i <=n ; i++) for (j=1 ; j <= i * i ; j++) { if ( j mod i == 0 ) for ( k = 1 ; k <= j ; k++) x=...
3.0k
views
answered
Jun 1, 2016
Algorithms
asymptotic-notation
time-complexity
algorithms
ace-booklet
+
–
3
votes
123
COHESION
498
views
answered
Jun 1, 2016
6
votes
124
flip flops
Which of the following flip-flops is free from race condition ? (A) T flip-flop (B) SR flip-flop (C) Master-slave JK flip-flop (D) None of the above
Which of the following flip-flops is free from race condition ?(A) T flip-flop(B) SR flip-flop(C) Master-slave JK flip-flop(D) None of the above
6.1k
views
answered
Jun 1, 2016
Digital Logic
flip-flop
digital-logic
+
–
3
votes
125
ssl is responsible for
374
views
answered
May 30, 2016
6
votes
126
silly window syndrome is related to
5.4k
views
answered
May 30, 2016
3
votes
127
Problem on Contiguous Memory allocation
There are 5 processes in a job queue Process Memory Required Time P1 600kb 10 ms P2 1000kb 5 ms P3 300kb 20 ms P4 700kb 8 ms P5 500kb 15 ms Memory is byte addressable If the size of the memory is 2000 kb and contiguous memory allocation is used, then after ... which processes will be in memory? (A) P4,P5 only (B) P1, P2 only (C) P3, P4 only (D) None of these
There are 5 processes in a job queueProcessMemoryRequired TimeP1600kb10 msP21000kb5 msP3300kb20 msP4700kb 8 msP5500kb15 msMemory is byte addressableIf the size of the mem...
2.1k
views
answered
May 29, 2016
Algorithms
operating-system
time-complexity
+
–
5
votes
128
regular expression algebra
prove the identity: (a*ab + ba)* a* = (a + ab + ba)*
prove the identity: (a*ab + ba)* a* = (a + ab + ba)*
2.3k
views
answered
May 29, 2016
Theory of Computation
regular
expression
+
–
7
votes
129
TOC
Given Language L1 is DCFL and L2 is DCFL ? Then (L1$\cap$L2)c will be Regular DCFL CFL CSL but not CFL
Given Language L1 is DCFL and L2 is DCFL ? Then (L1$\cap$L2)c will beRegularDCFLCFLCSL but not CFL
1.1k
views
answered
May 29, 2016
8
votes
130
Self Doubt: Mathematical Logic
Is the assertion "This statement is false" a proposition?
Is the assertion "This statement is false" a proposition?
2.2k
views
answered
May 29, 2016
Mathematical Logic
mathematical-logic
+
–
4
votes
131
regular expression
Find regular expression for strings over {a,b}, "starting with any number of a's followed by one or more a's followed by a single b, followed by any number of a's followed by b and ending in string of a's and b's".
Find regular expression for strings over {a,b}, "starting with any number of a's followed by one or more a's followed by a single b, followed by any number of a's followe...
2.1k
views
answered
May 29, 2016
Theory of Computation
regular-expression
+
–
4
votes
132
True or False and Concept behind it??
Choice of write-through and write back design involves a tradeoff between miss rate and miss penalty.
Choice of write-through and write back design involves a tradeoff between miss rate and miss penalty.
251
views
answered
May 29, 2016
3
votes
133
is anyone having pdf of korth ..dbms..??
579
views
answered
May 27, 2016
23
votes
134
CMI2012-B-03b
Let $A$ be an array of $n$ integers, sorted so that $A[1] \leq A[2] \leq \dots A[n]$. Suppose you are given a number $x$ and you wish to find out if there exist indices $k$ and $l$ such that $A[k]+A[l] = x$. Design an $O(n)$ algorithm for this problem.
Let $A$ be an array of $n$ integers, sorted so that $A \leq A \leq \dots A[n]$. Suppose you are given a number $x$ and you wish to find out if there exist indices $k$ a...
1.5k
views
answered
May 27, 2016
Algorithms
descriptive
cmi2012
algorithms
algorithm-design
+
–
8
votes
135
Difference between Depth first traversal and Depth first search
DFS is done for a graph.So we need a visited array to keep track of cycles.Do we need visited array for DFT of a tree? What is the basic difference between traversal and search ?
DFS is done for a graph.So we need a visited array to keep track of cycles.Do we need visited array for DFT of a tree?What is the basic difference between traversal and s...
2.1k
views
answered
May 27, 2016
Algorithms
graph-algorithms
descriptive
+
–
7
votes
136
CMI2014-A-10
Avinash is taller than Abhay. Bharat is taller than Vinu and Vinay is taller than Bharat. Which of the following is a minimal set of additional information that can determine the tallest person? Vinay is taller than Avinash and Abhay is taller than Bharat. Avinash is taller than Vinay. Abhay is shorter than Vinay. None of the above.
Avinash is taller than Abhay. Bharat is taller than Vinu and Vinay is taller than Bharat. Which of the following is a minimal set of additional information that can deter...
747
views
answered
May 27, 2016
Analytical Aptitude
cmi2014
logical-reasoning
+
–
9
votes
137
CMI2015-A-06
Suppose we have constructed a polynomial time reduction from problem $A$ to problem $B$. Which of the following can we infer from this fact? If the best algorithm for $B$ takes exponential time, there is no polynomial time algorithm for $A$. If the best ... we don't know whether there is a polynomial time algorithm for $B$, there cannot be a polynomial time algorithm for $A$.
Suppose we have constructed a polynomial time reduction from problem $A$ to problem $B$. Which of the following can we infer from this fact?If the best algorithm for $B$ ...
2.1k
views
answered
May 27, 2016
Algorithms
cmi2015
algorithms
p-np-npc-nph
+
–
23
votes
138
CMI2015-A-08
How many times is the comparison $i \geq n$ performed in the following program? int i=85, n=5; main() { while (i >= n) { i=i-1; n=n+1; } } $40$ $41$ $42$ $43$
How many times is the comparison $i \geq n$ performed in the following program?int i=85, n=5; main() { while (i >= n) { i=i-1; n=n+1; } }$40$$41$$42$$43$
5.6k
views
answered
May 27, 2016
Algorithms
cmi2015
algorithms
time-complexity
+
–
5
votes
139
Solve the recurrence Relation
T(n) = T(n-1) + n T(1) = 1
T(n) = T(n-1) + nT(1) = 1
309
views
answered
May 27, 2016
Algorithms
recurrence-relation
+
–
4
votes
140
Solve The Recurrence Relation
T(n) = 1, if n = 1 = T(n-1) + 2^n , otherwise
T(n) = 1, if n = 1 = T(n-1) + 2^n , otherwise
341
views
answered
May 27, 2016
Algorithms
recurrence-relation
+
–
3
votes
141
UGC NET CSE | December 2015 | Part 2 | Question: 20
A relation R={A,B,C,D,E,F,G} is given with following set of functional dependencies: F={AD→E, BE→F, B→C, AF→G}. Which of the following is a candidate key? A AB ABC ABD
A relation R={A,B,C,D,E,F,G} is given with following set of functional dependencies: F={AD→E, BE→F, B→C, AF→G}. Which of the following is a candidate key?AABABCAB...
5.4k
views
answered
May 26, 2016
Databases
ugcnetcse-dec2015-paper2
databases
database-normalization
+
–
4
votes
142
Bipartite Graph
Consider the graph given below: The two distinct sets of vertices, which make the graph bipartite are: (A) (v1, v4, v6); (v2, v3, v5, v7, v8) (B) (v1, v7, v8); (v2, v3, v5, v6) (C) (v1, v4, v6, v7); (v2, v3, v5, v8) (D) (v1, v4, v6, v7, v8); (v2, v3, v5)
Consider the graph given below: The two distinct sets of vertices, which make the graph bipartite are:(A) (v1, v4, v6); (v2, v3, v5, v7, v8)(B) (v1, v7, v8); (v2, v3, v5,...
3.0k
views
answered
May 26, 2016
7
votes
143
Which of the following is/are not true?
(a) The set of negative integers is countable. (b) The set of integers that are multiples of 7 is countable. (c) The set of even integers is countable. (d) The set of real numbers between 0 and 1/2 is countable.
(a) The set of negative integers is countable.(b) The set of integers that are multiples of 7 is countable.(c) The set of even integers is countable.(d) The set of real n...
1.6k
views
answered
May 26, 2016
Set Theory & Algebra
countable-uncountable-set
+
–
3
votes
144
why the time complexity is O(n) not O(nlogn)?
int fun(int n){ int count = 0; for (int i = n; i > 0; i /= 2) for (int j = 0; j < i; j++) count += 1; return count; } then this function should give O(nlogn). since outer loop run O(logn) time inner loop O(n) time
int fun(int n){ int count = 0; for (int i = n; i 0; i /= 2) for (int j = 0; j < i; j++) count += 1; return count; }then this function should give O(nlogn).since outer lo...
1.1k
views
answered
May 26, 2016
Algorithms
time-complexity
+
–
11
votes
145
Difference between deadloack & spinlock
7.9k
views
answered
May 25, 2016
8
votes
146
UGC NET CSE | June 2012 | Part 2 | Question: 30
In round robin CPU scheduling as time quantum is increased the average turn around time increases decreases remains constant varies irregularly
In round robin CPU scheduling as time quantum is increased the average turn around timeincreasesdecreasesremains constantvaries irregularly
9.9k
views
answered
May 25, 2016
Operating System
ugcnetcse-june2012-paper2
operating-system
process-scheduling
+
–
7
votes
147
Explain
Use of triple pointer ?
Use of triple pointer ?
1.0k
views
answered
May 24, 2016
6
votes
148
UGC NET CSE | December 2013 | Part 2 | Question: 49
How much space will be required to store the bit map of a 1.3 GB disk with 512 bytes block size? 332.8 KB 83.6 KB 266.2 KB 256.6 KB
How much space will be required to store the bit map of a 1.3 GB disk with 512 bytes block size?332.8 KB83.6 KB266.2 KB256.6 KB
6.8k
views
answered
May 24, 2016
Operating System
operating-system
disk
ugcnetcse-dec2013-paper2
+
–
Page:
« prev
1
2
3
4
5
6
7
8
9
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register