# Recent activity by shekhar chauhan

1
Assume statements $S_1$ and $S_2$ defined as: $S_1$: $L_2 - L_1$ is recursive enumerable where $L_1$ and $L_2$ are recursive and recursive enumerable respectively. $S_2$: The set of all Turing machines is countable. Which of the following is true? $S_1$ is correct and $S_2$ ... correct Both $S_1$ and $S_2$ are correct Both $S_1$ and $S_2$ are not correct $S_1$ is not correct and $S_2$ is correct
2
Given the production rules of a grammar G1 as $S_1 \rightarrow AB \mid aaB$ $A \rightarrow a \mid Aa$ $B \rightarrow b$ and the production rules of a grammar G2 as $S_2 \rightarrow aS_2bS_2 \mid bS_2 aS_2 \mid \lambda$ Which of the following is correct ... is not ambiguous G1 is ambiguous and G2 is ambiguous G1 is not ambiguous and G2 is ambiguous G1 is not ambiguous and G2 is not ambiguous
3
Given the following production of a grammar: $S \rightarrow aA \mid aBB$; $A \rightarrow aaA \mid \lambda$; $B \rightarrow bB \mid bbC$; $C \rightarrow B$ Which of the following is true? The language corresponding to the given grammar is a set of even number of a's ... by odd number of b's The language corresponding to the given grammar is a set of odd number of a's followed by even number of b's
4
A regular grammar for the language $L= \{a^nb^m \mid \text{ n is even and m is even } \}$ is given by $S \rightarrow aSb \mid S_1; S_1 \rightarrow bS_1a \mid \lambda$ $S \rightarrow aaS \mid S_1;S_1 \rightarrow bSb \mid \lambda$ $S \rightarrow aSb \mid S_1;S_1 \rightarrow S_1ab \mid \lambda$ $S \rightarrow aaS \mid S_1;S_1 \rightarrow bbS_1 \mid \lambda$
5
Which of the following conditions does not hold good for a solution to a critical section problem ? No assumptions may be made about speeds or the number of $CPU$'s. No two processes may be simultaneously inside their critical sections. Processes running outside its critical section may block other processes. Processes do not wait forever to enter its critical section.
6
Consider the following justifications for commonly using the two-level $CPU$ scheduling: I. It is used when memory is too small to hold all the ready processes. II. Because its performance is same as that of the $FIFO$. III. Because it facilitates putting some set of processes into memory and a choice ... Which of the following is true ? $I, III$ and $IV$ $I$ and $II$ $III$ and $IV$ $I$ and $III$
7
The following Context-Free Grammar (CFG) : $S \rightarrow aB | bA$ $A \rightarrow a | as | bAA$ $B \rightarrow b | bs | aBB$ will generate Odd numbers of $a's$ and odd numbers of $b's$ Even numbers of $a's$ and even numbers of $b's$ Equal numbers of $a's$ and $b's$ Different numbers of $a's$ and $b's$
8
Debugger is a program that Allows to examine and modify the contents of registers Does not allow execution of a segment of program Allows to set breakpoints, execute a segment of program and display contents of register All of the above
9
In a two-pass assembler, symbol table is Generated in first pass Generated in second pass Not generated at all Generated and used only in second pass
10
Which of the following is true ? Canonical $LR$ parser is $LR (1)$ parser with single look ahead terminal All $LR(K)$ parsers with $K > 1$ can be transformed into $LR(1)$ parsers. Both $(A)$ and $(B)$ None of the above
11
What Ip addresses do we actually use and what we do not ?
12
Given the IP address 201.14.78.65 and the subset mask 255.255.255.224. What is the subset address? 201.14.78.32 201.14.78.64 201.14.78.65 201.14.78.224
13
Match the following: ... a-iii, b-iv, c-ii, d-i a-iv, b-iii, c-ii, d-i a-iv, b-iii, c-i, d-ii a-iii, b-iv, c-i, d-ii
14
a. Dangling pointer i. Buffer replacement policy b. Page fault ii. Variable-length records c. List representation iii. Object identifier d. Toss-immediate iv. Pointer-swizzling a-iii, b-iv, c-ii, d-i a-iv, b-iii, c-ii, d-i a-iv, b-iii, c-i, d-ii a-iii, b-iv, c-i, d-ii
15
Which of the following field of the TCP header tells how many bytes may be sent starting at the byte acknowledged? TCP header length Window size Acknowledgement number Urgent pointer
16
Which of the following is the size of Network bits and Host bits of Class A of IP address? Network bits 7, Host bits 24 Network bits 14, Host bits 16 Network bits 15, Host bits 16 Network bits 16, Host bits 16
17
Convert the following infix expression into its equivalent post fix expression $(A + B$^$D) / (E – F) + G$ $ABD$^ $+EF – / G+$ $ABD +$^$EF – / G+$ $ABD +$ ^$EF / – G+$ $ABD$^ $+ EF / – G+$
18
In which one of the following continuous process improvement is done? ISO9001 RMMM CMM None of the above
19
The decision tree classifier is a widely used technique for Classification Association Partition Clustering
20
Cross_tab displays permit users to view ____ of multidimensional data at a time. One dimension Two dimensions Three dimensions Multidimensions
21
A method to provide secure transmission of email is called TLS SA IPSec PGP
22
Match the following: List-I Process state transition List-II Reason for transition a. Ready $\rightarrow$ Running i. Request made by the process is satisfied or an event for which it was waiting occurs b. Blocked $\rightarrow$ Ready ii. Process wishes to wait for some action by another process c. Running $\rightarrow$ ... d-iv a-iv, b-i, c-iii, d-ii a-iv, b-iii, c-i, d-ii a-iii, b-iv, c-ii, d-i
23
The directory can be viewed as _______ that translates filenames into their directory entries. Symbol table Partition Swap space Cache
24
A full binary tree with $n$ leaves contains $n$ nodes $\log_{2} n$ nodes $2n –1$ nodes $2^{n}$ nodes
25
Which of the following algorithms is not a broadcast routing algorithm ? Flooding Multidestination routing Reverse path forwarding All of the above
In a classful addressing, first four bits in Class $A$ IP address is $1010$ $1100$ $1011$ $1110$