# Recent activity by Sanjay Mahaveer

1
Can any one tell me....IT branch student can apply for barc in CS branch...
2
Which of the following languages is (are) non-regular? $L_1 = \{0^m1^n \mid 0 \leq m \leq n \leq 10000\}$ $L_2 = \{w \mid w$ reads the same forward and backward$\}$ $L_3 = \{w \in \{0, 1\} ^* \mid w$ contains an even number of 0's and an even number of 1's$\}$ $L_2$ and $L_3$ only $L_1$ and $L_2$ only $L_3$ only $L_2$ only
3
Let $L \subseteq \{0,1\}^*$. Which of the following is true? If $L$ is regular, all subsets of $L$ are regular. If all proper subsets of $L$ are regular, then $L$ is regular. If all finite subsets of $L$ are regular, then $L$ is regular. If a proper subset of $L$ is not regular, then $L$ is not regular.
4
Consider the languages $L1=\{0^i1^j\ \mid i \neq j\},$ $L2=\{0^i1^j\mid i=j\},$ $L3=\{0^i1^j \mid i=2j+1\},$ $L4=\{0^i1^j \mid i\neq2j\}$ Only $L2$ is context free. Only $L2$ and $L3$ are context free. Only $L1$ and $L2$ are context free. All are context free
5
State True or False with one line explanation A FSM (Finite State Machine) can be designed to add two integers of any arbitrary length (arbitrary number of digits).
6
For a binary string $x = a_0a_1 \dots a_{n−1}$ define $val(x)$ to be $\Sigma_{0 \leq i < n} 2^{n-1-i}.a_i$ Let $\Sigma = \{(0, 0),(0, 1),(1, 0),(1, 1)\}$. Construct a finite automaton that accepts the set of all strings $(a_0, b_0)(a_1, b_1) \dots (a_{n−1}, b_{n−1}) \in \: \Sigma^*$ such that $val(b_0b_1 \dots b_{n−1}) = 2 · val(a_0a_1 \dots a_{n−1})$.
7
Consider a CFG with the following productions. $S \to AA \mid B$ $A \to 0A \mid A0 \mid 1$ $B \to 0B00 \mid 1$ $S$ is the start symbol, $A$ and $B$ ... $\{0, 1\}$ containing at least two $0$'s
8
9
A processor uses $36$ bit physical address and $32$ bit virtual addresses, with a page frame size of $4$ Kbytes. Each page table entry is of size $4$ ... level page tables are respectively $\text{20,20,20}$ $\text{24,24,24}$ $\text{24,24,20}$ $\text{25,25,24}$
10
A system shares $9$ ... of the following best describes current state of the system? Safe, Deadlocked Safe, Not Deadlocked Not Safe, Deadlocked Not Safe, Not Deadlocked
11
A system of four concurrent processes, $P, Q, R$ and $S$, use shared resources $A, B$ and $C$. The sequences in which processes, $P, Q, R$ and $S$ ... processes. What strategies can be used to prevent deadlocks in a system of concurrent processes using shared resources if preemption of granted resources is not allowed?
12
Consider a uniprocessor system executing three tasks $T_{1}, T_{2}$ and $T_{3}$ each of which is composed of an infinite sequence of jobs (or instances) which arrive periodically at intervals of $3$, $7$ and $20$ milliseconds, respectively ... the 1st millisecond and task preemptions are allowed, the first instance of $T_{3}$ completes its execution at the end of_____________________milliseconds.
13
Locality of reference implies that the page reference being made by a process will always be to the page used in the previous page reference is likely to be to one of the pages used in the last few page references will always be to one of the pages existing in memory will always lead to a page fault
14
A leaky bucket with the capacity of bucket of 200 MB is at the host network interface. The data rate on the network is 2 Mbyte/s. If the host has 450 Mbytes to send onto the network and it sends the data in a burst then the maximum data speed from the host in order that no data is lost is ________ in Mbps. (Upto 1 decimal place)
15
Consider an IPv4 network. Each host can generate packets at the rate of 500 packets per second. If each packet in the network is identified by unique identification number of 48 bits, then the host wrap around time for generating packets will be ________s
16
The routing table of a router is shown below: $\begin{array}{|l|l|l|} \hline \textbf {Destination} & \textbf {Subnet Mask} & \textbf{Interface} \\\hline \text {128.75.43.0} & \text{255.255.255.0} & \text{Eth$ ... $128.75.43.16$ and $192.12.17.10$ respectively? Eth$1$ and Eth$2$ Eth$0$ and Eth$2$ Eth$0$ and Eth$3$ Eth$1$ and Eth$3$
17
Which one of the following statements is FALSE? Packet switching leads to better utilization of bandwidth resources than circuit switching Packet switching results in less variation in delay than circuit switching Packet switching requires more per-packet processing than circuit switching Packet switching can lead to reordering unlike in circuit switching
18
You are given the following four bytes : 10100011 00110111 11101001 10101011 Which of the following are substrings of the base $64$ encoding of the above four bytes? $\text{zdp}$ $\text{fpq}$ $\text{qwA}$ $\text{oze}$
19
A 40 Mbps broadcast network that controls medium access using polling has 20 hosts and time required for polling the next host is 80 µsec. whenever a node is polled, it is allowed to transmit 4000bytes. Find the efficiency of the broadcast channel 100/9 100/11 80/7 10/11
20
A multiple access network with a large number of stations can be analyzed using the Poisson distribution. When there is a limited number of stations in a network, we need to use another approach for this analysis. In a network with N stations, we assume that each station ... The probability that a station in a pure Aloha network can successfully send a frame during the vulnerable time. A. B. C. D.
21
T(n)=0.5T(n/2)+n^3 How to solve this using recurrence method?
22
There are n hats and k people (where k<n). $1)$ How many ways we can assign each person a hat? $2)$ How many ways we can assign each person atleast a hat?
23
Consider the diagram shown below where a number of LANs are connected by (transparent) bridges. In order to avoid packets looping through circuits in the graph, the bridges organize themselves in a spanning tree. First, the root bridge is identified as the bridge with the least serial number. Next, the root sends out ... $\text{B1, B5, B2, B3, B4}$ $\text{B1, B3, B4, B5, B2}$
24
Consider the following directed graph. Suppose a depth-first traversal of this graph is performed, assuming that whenever there is a choice, the vertex earlier in the alphabetical order is to be chosen. Suppose the number of tree edges is $T$, the number of back edges is $B$ and the number of cross edges is $C$ ... $T = 3$. $B = 1$, $C = 2$, and $T = 3$. $B = 2$, $C = 2$, and $T = 1$.
25
Consider the directed graph below given. Which one of the following is TRUE? The graph does not have any topological ordering. Both PQRS and SRQP are topological orderings. Both PSRQ and SPRQ are topological orderings. PSRQ is the only topological ordering.
Which of the following statement(s) is/are correct regarding Bellman-Ford shortest path algorithm? P: Always finds a negative weighted cycle, if one exists. Q: Finds whether any negative weighted cycle is reachable from the source. $P$ only $Q$ only Both $P$ and $Q$ Neither $P$ nor $Q$
Which of the following functions, given by there recurrence, grows the fastest asymptotically ? T(n) = 4T$\left ( \frac{n}{2} \right )$ + 10n T(n) = 8T$\left ( \frac{n}{3} \right )$ + 24n$^{2}$ T(n) = 16T$\left ( \frac{n}{4} \right )$ + 10n$^{2}$ T(n) = 25T$\left ( \frac{n}{5} \right )$ + 20$\left ( n log n \right )^{1.99}$ They all are asymptotically the same
Which functions does NOT implement the Karnaugh map given below? $(w + x) y$ $xy + yw$ $(w + x) (\bar{w} + y) (\bar{x} + y)$ None of the above
Consider a simplified time slotted MAC protocol, where each host always has data to send and transmits with probability $p$ = $0.2$ in every slot. There is no backoff and one frame can be transmitted in one slot. If more than one host transmits in the same slot, then the transmissions ... support if each host has to be provided a minimum throughput of $0.16$ frames per time slot? $1$ $2$ $3$ $4$