search
Log In

Recent posts in Programming & Data Structures

1
$\text{Size of each segment} = \frac{2^{16}}{8}=2^{13}$ Let the size of page be $2^k$ bytes We need a page table entry for each page. For a segment of size $2^{13}$, number of pages required will be $2^{13-k}$ and so we need $2^{13-k}$ page table entries. Now ... $\text{Size of each page table entry} = 2$ bytes $=16$ bits $\text{Number of bits left for aging} = 16-12 = 4$ bits
posted Sep 17, 2018 in Programming & Data Structures Manoja Rajalakshmi A
retagged Sep 17, 2018 by Manoja Rajalakshmi A
1,385 views
2
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? $O(n)$ $O(n \log n)$ $O(n^2)$ $O(n!)$
posted Jan 13, 2017 in Programming & Data Structures dd
edited Jan 13, 2017 by dd
1,228 views
3
A non-planar graph with minimum number of vertices has $9$ edges, $6$ vertices $6$ edges, $4$ vertices $10$ edges, $5$ vertices $9$ edges, $5$ vertices
posted Dec 28, 2016 in Programming & Data Structures Arjun 3,026 views
4
Ans is (C) 2 $Ax = λx$, where $λ$ is the eigen value of $A$ . Hence $(A−λI)x = 0$ or $|A−λI| = 0$ So, for our given matrix, we have $\begin{bmatrix} A-\lambda I &I \\ I& A - \lambda I \end{bmatrix} = 0$ This is a $ 2 \times 2$ block matrix where the ... we take $\alpha = 1$, we get $\lambda = 2$, and that is one of the choice. For no other choice, this equation holds. So, (c) 2 is the answer.
posted Aug 28, 2016 in Programming & Data Structures Anil Khatri 965 views
5
The amount of ROM needed to implement a $4-bit$ multiplier is $64$ bits $128$ bits $1$ Kbits $2$ Kbits
posted Mar 17, 2016 in Programming & Data Structures Arjun 681 views
To see more, click for the full list of questions or popular tags.
...