Register
Filter

Recent activity by Ram Swaroop

1 answer
1
MadeEasy Test Series 2019: Programming & DS - Hashing
Consider the hashing table with 'm' slots and 'n' keys. If the expected number of probes in unsuccessful search is 3. The expected number of probes in a successful search is_ Answer 1.647
Consider the hashing table with 'm' slots and 'n' keys. If the expected number of probes in unsuccessful search is 3. The expected number of probes in a successful search...
0 answers
5
How to Prepare SOP for IIITH - PGEEE
How to prepare SOP (Statement Of Purpose ) ? What are the important points to be taken in mind while preparing SOP
How to prepare SOP (Statement Of Purpose ) ?What are the important points to be taken in mind while preparing SOP
4 answers
6
ISRO2011-16
Consider a direct mapped cache with $64$ blocks and a block size of $16$ bytes. To what block number does the byte address $1206$ map to does not map $6$ $11$ $54$
Consider a direct mapped cache with $64$ blocks and a block size of $16$ bytes. To what block number does the byte address $1206$ map todoes not map$6$$11$$54$
2 answers
10
#dining-philoshpers problem
5 answers
14
ISRO2020-15
A stack organized computer is characterised by instructions with indirect addressing direct addressing zero addressing index addressing
A stack organized computer is characterised by instructions withindirect addressingdirect addressingzero addressingindex addressing
9 answers
17
GATE CSE 2020 | Question: 16
What is the worst case time complexity of inserting $n$ elements into an empty linked list, if the linked list needs to be maintained in sorted order? $\Theta(n)$ $\Theta(n \log n)$ $\Theta ( n)^{2}$ $\Theta(1)$
What is the worst case time complexity of inserting $n$ elements into an empty linked list, if the linked list needs to be maintained in sorted order?$\Theta(n)$$\Theta(n...
4 answers
19
GATE CSE 2020 | Question: 18
Let $G$ be a group of $35$ elements. Then the largest possible size of a subgroup of $G$ other than $G$ itself is _______.
Let $G$ be a group of $35$ elements. Then the largest possible size of a subgroup of $G$ other than $G$ itself is _______.
3 answers
21
GATE CSE 2020 | Question: 13
Consider a relational database containing the following schemas. ... WHERE pno = P4' GROUP BY pno) ; The number of rows returned by the above SQL query is $4$ $5$ $0$ $2$
Consider a relational database containing the following schemas.$$\overset{\text{Catalogue}} {\begin{array}{|c|c|c|} \hline \underline{\text{sno}} & \underline{\text{pno}...
3 answers
23
GATE CSE 2020 | Question: 7
Which one of the following regular expressions represents the set of all binary strings with an odd number of $1’$s? $((0+1)^*1(0+1)^*1)^*10^*$ $(0^*10^*10^*)^*0^*1$ $10^*(0^*10^*10^*)^*$ $(0^*10^*10^*)^*10^*$
Which one of the following regular expressions represents the set of all binary strings with an odd number of $1’$s?$((0+1)^*1(0+1)^*1)^*10^*$$(0^*10^*10^*)^*0^*1$$10^*...
6 answers
27
GATE CSE 2020 | Question: GA-2
His knowledge of the subject was excellent but his classroom performance was_______. extremely poor good desirable praiseworthy
His knowledge of the subject was excellent but his classroom performance was_______.extremely poorgooddesirablepraiseworthy
3 answers
28
ISRO2020-36
What is the complexity of the following code? sum=0; for(i=1;i<=n;i*=2) for(j=1;j<=n;j++) sum++; Which of the following is not a valid string? $O(n^2)$ $O(n\log\ n)$ $O(n)$ $O(n\log\ n\log\ n)$
What is the complexity of the following code?sum=0; for(i=1;i<=n;i*=2) for(j=1;j<=n;j++) sum++;Which of the following is not a valid string?$O(n^2)$$O(n\log\ n)$$O(n)$$O(...
2 answers
29
Time Complexity
What is the complexity of the following code? i = n while (i>=1){ for j = 1 to n x=x +1 i = i/2 } $\Theta(n)$ $\Theta( \log_2 n)$ $\Theta( n/\log_2 n)$ $\Theta( n \log_2 n)$
What is the complexity of the following code? i = n while (i>=1){ for j = 1 to n x=x +1 i = i/2 }$\Theta(n)$$\Theta( \log_2 n)$$\Theta( n/\log_2 n)$$\Theta( n \log_2 n)$