Register
Filter

Recent activity by vamp_vaibhav

1 answer
1
Number system digital
The r ’s complement of an n-digit decimal number N in base r is defined for all values of N except for N = 0. If the given number is (247)9, then its 9’s complement will be equal to ( _____ )9.
The r ’s complement of an n-digit decimal number N in base r is defined for all values of N except for N = 0. If the given number is (247)9, then its 9’s complement w...
1 answer
5
madeeasy
Given f(n) = θ(n), g(n) = Ω(n), h(n) = O(n). Then f(n) + [g(n) ⋅ h(n)] = ? A.O(n) B. θ(n) C. Ω(n) D. None of these Ans is given C Please explain how to solve such questions
Given f(n) = θ(n), g(n) = Ω(n), h(n) = O(n). Then f(n) + [g(n) ⋅ h(n)] = ?A.O(n)B. θ(n)C. Ω(n)D. None of theseAns is given CPlease explain how to solve such questio...
0 answers
7
Min heap tree
Answer given : 1935360 but I m getting 3225600 please check..
Answer given : 1935360 but I m getting 3225600 please check..
0 answers
8
NIELIT SCIENTIST B 2017
The optimization phase in a compiler generally: (A) Reduced the space of the code (B) Optimizes the code to reduce execution time (C) Both (A) and (B) (D) Neither (A) nor (B)
The optimization phase in a compiler generally:(A) Reduced the space of the code(B) Optimizes the code to reduce execution time(C) Both (A) and (B)(D) Neither (A) nor (B)...
1 answer
9
Digital Logic Doubt
The K-Map for a boolean function is shown below.The number of essential prime implicants for this function is ? 1 1 0 1 0 0 0 1 1 0 0 0 1 0 0 1 The answer given is 3. But I think it will be 4 - (0,8,10,2) , (0,1) , (3,6) and (8,12)
The K-Map for a boolean function is shown below.The number of essential prime implicants for this function is ?1101000110001001The answer given is 3. But I think it will ...
0 answers
11
Sorting
Consider an execution of Quicksort with the first item of an array segment acting as pivot or splitter. After first pass of running quicksort on an array (Assume that we are sorting with increasing order)? 12,18,17,11,13,15,16,10 I want to know what will be the sequence for the first pass
Consider an execution of Quicksort with the first item of an array segment acting as pivot or splitter. After first pass of running quicksort on an array (Assume that we ...
2 answers
12
B+ tree
The minimum number of elements (keys) that need to be inserted into a B+ tree with the order of internal node 3 [maximum child pointers per node] and leaf node 2 [maximum keys per node], to make it to reach 3-levels are __________.
The minimum number of elements (keys) that need to be inserted into a B+ tree with the order of internal node 3 [maximum child pointers per node] and leaf node 2 [maximum...
1 answer
14
Time to build a heap
If you are given a sorted list with n elements in ascending order. Then what will be the Time complexity to build a Min heap from the given array?
If you are given a sorted list with n elements in ascending order. Then what will be the Time complexity to build a Min heap from the given array?
0 answers
16
conflict serilizable
if i neglect T2 then its conflict sserilizable but if i dont neglect T2 then its not conflict serilizable ???
if i neglect T2 then its conflict sserilizable but if i dont neglect T2 then its not conflict serilizable ???
1 answer
17
FOLLOW
Find Follow of F : $E\rightarrow E+T | T$ $T\rightarrow T*F | F$ $ F\rightarrow \left ( E \right ) |id$
Find Follow of F :$E\rightarrow E+T | T$$T\rightarrow T*F | F$$ F\rightarrow \left ( E \right ) |id$
1 answer
18
RBR_Cn
which of the protocol is flow control but not error control? 1)stop n wait 2) go back n 3)selective repeate 4)simplest
which of the protocol is flow control but not error control?1)stop n wait2) go back n3)selective repeate4)simplest
1 answer
19
test series
What is the view equivalent serial schedule for the following schedule R2(A); R1(A); W1(C); R3(C); W1(B); R4(B); W3(A); R4(C); W2(D); R2(B); W4(A); W4(B) T1 → T2 → T3 → T4. T2 → T1 → T3 → T4. T1 → T3 → T2 → T4. T4 → T2 → T3 → T1.
What is the view equivalent serial schedule for the following scheduleR2(A); R1(A); W1(C); R3(C); W1(B); R4(B); W3(A); R4(C); W2(D); R2(B); W4(A); W4(B) T1 → T2 → T3...
1 answer
20
# made easy demo test #Q 23
my answer 5 plz check but answer given 4
my answer 5 plz check but answer given 4
3 answers
21
user and kernel mdoe
can anyone tell what are different activities that are performed in kernel mode user mode how to change frm user mode to kernel mode and vice-versa,,
can anyone tell what are different activities that are performed in kernel modeuser modehow to change frm user mode to kernel mode and vice-versa,,
2 answers
22
Tokenization in lexical analysis
Consider the following C program: int main (void) { in/*this is an example*/z; double/*is it an error?*/y; print( “This is simple” ); return 0; } - How many Different tokens are there in the above code.
Consider the following C program: int main (void) { in/*this is an example*/z; double/*is it an error?*/y; print( “This is simple” ); return 0; }- How many Different ...
1 answer
23
number of conflict serializable schedule
A) Number of conflict serializable schedules possible R4(a) R2(a) R3(a) W1(b) W2(a) R3(b) W2(b) B) NUmber of conflict serializABLE SCHEDULES possible by T1 and T2 T1 : R(a) W(a) R(b) W(b) T2 : R(a) W(a) R(b) W(b)
A) Number of conflict serializable schedules possibleR4(a) R2(a) R3(a) W1(b) W2(a) R3(b) W2(b)B) NUmber of conflict serializABLE SCHEDULES possible by T1 and T2T1 : R(...
1 answer
25
Normal Forms
4 answers
26
GATE CSE 2015 Set 2 | Question: 17
Consider a complete binary tree where the left and right subtrees of the root are max-heaps. The lower bound for the number of operations to convert the tree to a heap is $\Omega(\log n)$ $\Omega(n)$ $\Omega(n \log n)$ $\Omega(n^2)$
Consider a complete binary tree where the left and right subtrees of the root are max-heaps. The lower bound for the number of operations to convert the tree to a heap is...
0 answers
29
Write through mechanism doubt
When the write through mechanism is implemented with simultaneous access, why write hit =1 and Tavg (write) = word updating time i.e max(Tc, Tm)?? I am getting confused.. Any help would be appreciated
When the write through mechanism is implemented with simultaneous access,why write hit =1 andTavg (write) = word updating time i.e max(Tc, Tm)?? I am getting confused.. ...