Randomized quicksort is an extension of quicksort where the pivot is chosen randomly. What is the worst case complexity of sorting n numbers using randomized quicksort?
A) O(n)
B) O(n Log n)
C) O(n2)
D) O(n!)
Let G be an undirected connected graph with distinct edge weight. Let emax be the edge with maximum weight and emin the edge with minimum weight. Which of the following statements is false?
A) Every minimum spanning tree of G must contain emin
B) If emax is in a minimum spanning tree, then its removal must disconnect G
C) No minimum spanning tree contains emax
D) G has a unique minimum spanning tree
how many 256x4 RAM chips are required to organise a memory of capacity 32KB and the size of decoder required in this implementation to select a row of chip? pls friends I need explanation .
In a permutation a1.....an of n distinct integers, an inversion is a pair (ai, aj) such that i < j and ai > aj. What would be the worst case time complexity of the Insertion Sort algorithm, if the inputs are restricted to permutations of 1.....n with at most n inversions?
A) ? (n2)
B) ? (n log n)
C) ? (n1.5)
D) ? (n)
Locality of reference implies that the page reference being made by a process
A) will always be to the page used in the previous page reference
B) is likely to be to one of the pages used in the last few page references
C) will always be to one of the pages existing in memory
D) will always lead to a page fault
is it necessary ,if it is in 1 nf or 2 nf or 3 nf then it must be lossless and dependency preserving?
in bcnf can we have a case where it is not lossless but dependency preserving
Locality of reference implies that the page reference being made by a process
A) will always be to the page used in the previous page reference
B) is likely to be to one of the pages used in the last few page references
C) will always be to one of the pages existing in memory
D) will always lead to a page fault
In selective repeat protocol, we are transmitting 10,000 packets and every 100th packet is lost can anyone tell how many retransmissions will be there?
The time complexity of the following C function is (assume n > 0) int recursive (mt n) { if (n == 1) return (1); else return (recursive (n-1) + recursive (n-1)); }
Suppose the letters a, b, c, d, e, f have probabilities 1/2, 1/4, 1/8, 1/16, 1/32, 1/32 respectively. Which of the following is the Huffman code for the letter a, b, c, d, e, f?
As per GALVIN,
To calculate Effective memory access time in case of page fault we used:
EMAT= page fault rate*(page fault service time) + (1-page fault rate)*(memory access time)
My doubt is:
In case of NO PAGE FAULT, why we considered only one memory access time .
Why not TWO memory accesses, one for page table + one for accessing actual byte. ?
That is:
Why not this formula:
EMAT= page fault rate*(page fault service time) + (1-page fault rate)* (2 * memory access time)
Is the hit ratio implicitly accounted for in hit time and read access time? In the subject test for MemoryOrganization in Computer Architecture some questions some questions explicitly account for hit ratio and some don't.How to resolve this confusion?
"The Forum is to encourage students discussions. If you expect our mentors to resolve your doubts/queries please reach out to us by posting comments under the video lectures or sending us a mail on gatecse@appliedcourse.com. Our mentors will get back to you in 3-4 working hours."