Register
Filter

Answers by Rajatagrawal

0 votes
3
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
1 votes
4
Made Easy Book
114
114
0 votes
5
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$ ...
0 votes
7
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$\...
0 votes
8
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?
0 votes
9
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|
1 votes
10
#Prims Algorithm
1 votes
11
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 ...
0 votes
14
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])...
0 votes
19
DRDO INTERVIEW..
We have stored an element after a few elements in an array, where the array size is unknown, then find the position of in array.
We have stored an element after a few elements in an array, where the array size is unknown, then find the position of in array.
0 votes
21
Algorithms
how O($n^{2}$) in the last.(in the given solution).
how O($n^{2}$) in the last.(in the given solution).