Register
Filter

Recent activity by sakharam

2 answers
2
Peter Linz, 3rd Ed, Chapter 1, Pg 15, Ques 19
if f(n) = O(n2) and g(n) = O(n3), then what is the complexity of f(n)*g(n) and f(n)/g(n) in big-o-notation?
if f(n) = O(n2) and g(n) = O(n3), thenwhat is the complexity of f(n)*g(n) and f(n)/g(n) in big-o-notation?
6 answers
3
GATE CSE 2010 | Question: 20
Which of the following concurrency control protocols ensure both conflict serializability and freedom from deadlock? $2$-phase locking Time-stamp ordering I only II only Both I and II Neither I nor II
Which of the following concurrency control protocols ensure both conflict serializability and freedom from deadlock?$2$-phase lockingTime-stamp orderingI onlyII onlyBoth ...
0 answers
10
made easy booklet
Find time complexity? a) T(n) = T(n/2) + pow(2,n) b) T(n) = T(pow(n,1/2)) + n c) T(n) = 16T(n/4) + n! d) T(n) = pow(2,1/2)*T(n/2) + log n can we apply master theorem on the above problem?
Find time complexity?a) T(n) = T(n/2) + pow(2,n)b) T(n) = T(pow(n,1/2)) + nc) T(n) = 16T(n/4) + n!d) T(n) = pow(2,1/2)*T(n/2) + log ncan we apply master theorem on the ab...
4 answers
13
DBMS Korth Edition 4 Exercise 12 Question 4 (Page No. 489)
Is it possible in general to have two primary indices on the same relation for different search keys ? Explain your answer.
Is it possible in general to have two primary indices on the same relation for different search keys ? Explain your answer.
1 answer
15
#Threads #OS True/False statements
for kernel-level threads, a system call can block the entire process. User level threads can be scheduled independently. Kernel level threads are transparent to the user level threads. Which of them is True?
for kernel-level threads, a system call can block the entire process.User level threads can be scheduled independently.Kernel level threads are transparent to the user le...
2 answers
17
Segmentation
In segmented paging, is the paging applied on segment table or on segments?
In segmented paging, is the paging applied on segment table or on segments?
1 answer
18
Made Easy Test Series: Digital Logic- Master Slave FF
$1)$ Master-Slave FF is designed to avoid race around condition $2)$ Master-Slave FF is used to store $2$ bit information Which of the following statement is correct? What is meaning of $2-bit $ information??
$1)$ Master-Slave FF is designed to avoid race around condition$2)$ Master-Slave FF is used to store $2$ bit informationWhich of the following statement is correct?What i...
1 answer
23
Made Easy Test Series:Database-Super-Keys
Consider the relation $R\left ( A,B,C,D,E \right )$ $A\rightarrow BC$ $C\rightarrow E$ $B\rightarrow D$ $E\rightarrow A$ Total number of superkeys present in relation will be ____________________
Consider the relation $R\left ( A,B,C,D,E \right )$$A\rightarrow BC$$C\rightarrow E$$B\rightarrow D$$E\rightarrow A$Total number of superkeys present in relation will be ...
0 answers
24
sequential logic Morris Mano
design a counter with the following binary sequence:0,4,2,1,6 and repeat use JK flip-flop
design a counter with the following binary sequence:0,4,2,1,6 and repeat use JK flip-flop
2 answers
26
Self Doubt :Bit Stuffing
End delimeter is → 0111 data to be sent 0111111111. What is the data we should send to the reciever?
End delimeter is → 0111data to be sent 0111111111.What is the data we should send to the reciever?
0 answers
27
No of chips
A memory system of size 16 kbytes is required to be designed using memory chips which have 12 address lines and 4 data lines each. No of chips required to design the memory system ______. Please provide a detailed solution.
A memory system of size 16 kbytes is required to be designed using memory chips which have 12 address lines and 4 data lines each.No of chips required to design the memor...
1 answer
28
Self doubt group theory
Is (Z+,>=) a well oerderd set ,plz explain.
Is (Z+,>=) a well oerderd set ,plz explain.
1 answer
29
Page Fault
Why is accessing a dirty page considered a page fault?
Why is accessing a dirty page considered a page fault?