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 ben10
2
answers
1
Hashing
1.3k
views
answer selected
Nov 16, 2019
Programming in C
data-structures
hashing
+
–
1
answer
2
VANI QB OPERATING SYSTEM Q45
The output is ____________________.
The output is ____________________.
376
views
answered
May 5, 2019
Operating System
operating-system
+
–
14
answers
3
GATE CSE 2012 | Question: 39
A list of $n$ strings, each of length $n$, is sorted into lexicographic order using the merge-sort algorithm. The worst case running time of this computation is $O (n \log n) $ $ O(n^{2} \log n) $ $ O(n^{2} + \log n) $ $ O(n^{2}) $
A list of $n$ strings, each of length $n$, is sorted into lexicographic order using the merge-sort algorithm. The worst case running time of this computation is$O (n \log...
28.9k
views
commented
Jan 12, 2019
Algorithms
gatecse-2012
algorithms
sorting
normal
+
–
6
answers
4
CMI2013-A-06
A simple graph is one in which there are no self-loops and each pair of distinct vertices is connected by at most one edge. Let $G$ be a simple graph on $8$ vertices such that there is a vertex of degree $1$, a vertex of degree $2$, a vertex of degree $3$, a vertex ... degree $6$ and a vertex of degree $7$. Which of the following can be the degree of the last vertex? $3$ $0$ $5$ $4$
A simple graph is one in which there are no self-loops and each pair of distinct vertices is connected by at most one edge. Let $G$ be a simple graph on $8$ vertices such...
5.3k
views
commented
Jan 5, 2019
Graph Theory
cmi2013
graph-theory
normal
degree-of-graph
+
–
0
answers
5
ACE Test Series
464
views
commented
Dec 18, 2018
0
answers
6
ACE Test Series
309
views
asked
Dec 18, 2018
1
answer
7
ACE Test Series
556
views
commented
Dec 18, 2018
0
answers
8
Made Easy Test Series
Recall that a list of elements is called a binary min-heap if in its tree representation, the root is the smallest in magnitude compared to its left and right subtrees. Out of all the possible permutations of {1, 2, 3, 4, 5, 6, 7}, a permutation is picked at random. The probability that the permutation satisfies the min-heap property is ________. (Upto 3 decimal places)
Recall that a list of elements is called a binary min-heap if in its tree representation, the root is the smallest in magnitude compared to its left and right subtrees. O...
987
views
commented
Dec 15, 2018
0
answers
9
ACE Test Series
637
views
commented
Nov 18, 2018
Algorithms
dijkstras-algorithm
+
–
0
answers
10
Test Series
332
views
commented
Sep 11, 2018
CO and Architecture
co-and-architecture
disk
test-series
+
–
0
answers
11
Test Series
252
views
commented
Sep 9, 2018
2
answers
12
Test Series
873
views
asked
Sep 9, 2018
Algorithms
algorithms
binary-search
recurrence-relation
ace-test-series
+
–
0
answers
13
Gate Application Form Doubt
Hi Friend , I have made mistake in College Name section while filling the form: Given Kalyani Government Engineering instead of Kalyani Government Engineering College . Do any one have any idea on, how I can correct the college name or is it create any problem? Please help me,
Hi Friend , I have made mistake in College Name section while filling the form: Given Kalyani Government Engineering instead of Kalyani Government Engineering Colle...
232
views
commented
Sep 7, 2018
1
answer
14
Test Series
720
views
commented
Sep 2, 2018
0
answers
15
Test Series
208
views
commented
Sep 2, 2018
0
answers
16
Test Series
557
views
commented
Aug 30, 2018
Algorithms
array
test-series
+
–
1
answer
17
Test Series
667
views
commented
Aug 29, 2018
Databases
database-normalization
test-series
+
–
0
answers
18
Test Series
269
views
asked
Aug 25, 2018
0
answers
19
Test-Series
394
views
asked
Aug 25, 2018
0
answers
20
Test Series
395
views
commented
Aug 25, 2018
1
answer
21
Test Series
a. Regular, b. DCFL, c. CFL but not DCFL
a. Regular, b. DCFL, c. CFL but not DCFL
251
views
asked
Aug 19, 2018
2
answers
22
Test Series
554
views
commented
Aug 19, 2018
2
answers
23
Test Series
333
views
asked
Aug 19, 2018
1
answer
24
Test Series
293
views
commented
Aug 17, 2018
2
answers
25
Test Series
Sum of the value printed by Rec(6)?
Sum of the value printed by Rec(6)?
561
views
answer selected
Aug 13, 2018
0
answers
26
Test Series
What is the correct ascending order?
What is the correct ascending order?
296
views
asked
Aug 13, 2018
0
answers
27
Test Series
A system has 10 identical resources and N processes competing for them. Each process can request atmost 3 resources but by grouping of first 3 processes needs only 6 resources. Then, the maximum value of N...
A system has 10 identical resources and N processes competing for them. Each process can request atmost 3 resources but by grouping of first 3 processes needs only 6 reso...
547
views
commented
Aug 13, 2018
17
answers
28
GATE CSE 2004 | Question: 62
A 4-bit carry look ahead adder, which adds two 4-bit numbers, is designed using AND, OR, NOT, NAND, NOR gates only. Assuming that all the inputs are available in both complemented and uncomplemented forms and the delay of each gate is one time ... the carry network has been implemented using two-level AND-OR logic. 4 time units 6 time units 10 time units 12 time units
A 4-bit carry look ahead adder, which adds two 4-bit numbers, is designed using AND, OR, NOT, NAND, NOR gates only. Assuming that all the inputs are available in both com...
32.7k
views
answer edited
Aug 12, 2018
Digital Logic
gatecse-2004
digital-logic
normal
adder
+
–
1
answer
29
Cache Mapping
Consider a 16-way set associative cache which holds 64 KB of data. The size of physical address is of 40 bits. A cache block consist of 4 words. Every data word is of 32 bits. Assuming that all cache entries are initially empty and data words are word-addressable. Find the size of Tag , Set and Offset field in bits?
Consider a 16-way set associative cache which holds 64 KB of data. The size of physical address is of 40 bits. A cache block consist of 4 words. Every data word is of 32 ...
1.3k
views
asked
Aug 7, 2018
0
answers
30
Addressing Mode
Consider the following expression used to execute on a stack CPU X = (A × B)+C, where all the variables are in the memory. What is the number of zero and one address instructions are required respectively to evaluate the expression?
Consider the following expression used to execute on a stack CPU X = (A × B)+C, where all the variables are in the memory. What is the number of zero and one address ins...
262
views
asked
Aug 7, 2018
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register