Register
Filter

Recent activity by Rajatagrawal

6 answers
2
GATE CSE 1996 | Question: 1.13
An advantage of chained hash table (external hashing) over the open addressing scheme is Worst case complexity of search operations is less Space used is less Deletion is easier None of the above
An advantage of chained hash table (external hashing) over the open addressing scheme isWorst case complexity of search operations is lessSpace used is lessDeletion is ea...
2 answers
6
physics wallah question
$L_1=a^ * b^ *$ $L_2=a^ + b^ +$ Find $L_2-L_1$: A. $a ^ *$ B. $b ^ *$ C. $a ^ * +b^ *$ D. None
$L_1=a^ * b^ *$$L_2=a^ + b^ +$Find $L_2-L_1$:A. $a ^ *$B. $b ^ *$C. $a ^ * +b^ *$D. None
0 answers
7
Made Easy DFS video Lecture
Caption
Caption
2 answers
8
Very Basic Question
When to convert ‘K’ or ‘M’ as power of 2 vs power of 10? Ex – 4K as $^{2^{12}}$ or 4*10^3?
When to convert ‘K’ or ‘M’ as power of 2 vs power of 10?Ex – 4K as $^{2^{12}}$ or 4*10^3?
2 answers
9
Made Easy Book
114
114
0 answers
10
Are GO Classes good ? Reviews from enrolled students preferred.
How do you rate the classes for those subjects ? I would not be in doubt if there were demo lectures for subjects other than maths.
How do you rate the classes for those subjects ? I would not be in doubt if there were demo lectures for subjects other than maths.
1 answer
14
UGC NET CSE | June 2023 | Part 2: 13
Consider universe positive integer $X=\{1 \leq n \leq 8\}$, proposition $P=$ " $n$ is an even integers", $Q="(3 \leq n \leq 7) \wedge(n \neq 6)$ ". Then truth set of $P$ $\leftrightarrow \mathrm{Q}$ is $\{1,4\}$ $\{2,6\}$ $\{3,4,5\}$ $\{1\}$
Consider universe positive integer $X=\{1 \leq n \leq 8\}$, proposition $P=$ " $n$ is an even integers", $Q="(3 \leq n \leq 7) \wedge(n \neq 6)$ ". Then truth set of $P$ ...
2 answers
16
UGC NET CSE | June 2023 | Part 2: 8
In a multiuser operating system, $20$ requests are made to use a particular resource per hour, on an average. The probability that no request is made in $45$ minutes is $\mathrm{e}^{-15}$ $\mathrm{e}^{-5}$ $1-\mathrm{e}^{-5}$ $1-\mathrm{e}^{-10}$
In a multiuser operating system, $20$ requests are made to use a particular resource per hour, on an average. The probability that no request is made in $45$ minutes is$\...
1 answer
17
Arrays, Storage classes
Can an array store elements of different storage classes?
Can an array store elements of different storage classes?
1 answer
18
GO class
sir in this question m should be equal to n without this how rank=n?
sir in this question m should be equal to n without this how rank=n?
1 answer
19
what will be output and explain how
#include<stdio.h> #include<string.h> #define MAX(x, y) ((x) > (y) ? (x) : (y)) int main() { int i = 10, j = 5, k = 0; k = MAX(i++, ++j); printf("%d %d %d", i, j, k); return 0; }
#include<stdio.h #include<string.h #define MAX(x, y) ((x) (y) ? (x) : (y)) int main() { int i = 10, j = 5, k = 0; k = MAX(i++, ++j); printf("%d %d %d", i, j, k); return ...
1 answer
20
let a = {2,4,6,8} suppose b is a set with |b| = 5 what are the smallest and largest possible values of |A*B|
let a = {2,4,6,8} suppose b is a set with |b| = 5 what are the smallest and largest possible values of |A*B|
0 answers
21
Programming 2024 test series
Caption @sachinmittal1 sir here answer should be B na because Arr[2] point s to the 0th index of 2nd 1D-array so it means pointing to address of arr[2][0] so address size would be 8.
Caption@sachinmittal1 sir here answer should be B na because Arr point s to the 0th index of 2nd 1D-array so it means pointing to address of arr [0] so address size woul...
1 answer
22
#Prims Algorithm
1 answer
25
UGCNET CSE December 2022: 5
Which one of the following types of memory is fastest Cache Memory Register Memory Main Memory Secondary Memory (Option $1 [39317]) 1$ (Option $2 [39318]) 2$ (Option $3 [39319]) 3$ (Option $4 [39320]) 4$ Answer Given by Candidate : $2$
Which one of the following types of memory is fastestCache MemoryRegister MemoryMain MemorySecondary Memory(Option $1 [39317]) 1$(Option $2 [39318]) 2$(Option $3 [39319])...
3 answers
28
C Programming Recursion
#include<stdio.h> void print(int n) { printf("Hello "); if(n++ == 0) return ; print(n); n++; } int main() { void print(); print(-4); } How many times printf execute?? And How ??
#include<stdio.h void print(int n) { printf("Hello "); if(n++ == 0) return ; print(n); n++; } int main() { void print(); print(-4); }How many times printf execute?? And H...