The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent activity by Sanjay Mahaveer
User Sanjay Mahaveer
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Sanjay Mahaveer
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
answers
1
Barc exam
Can any one tell me....IT branch student can apply for barc in CS branch...
commented
Feb 4
in
GATE

289
views
1
answer
2
GATE2008IT35
Which of the following languages is (are) nonregular? $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
commented
Jan 10
in
Theory of Computation

1.3k
views
gate2008it
theoryofcomputation
normal
regularlanguages
3
answers
3
CMI2012A01
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.
commented
Jan 10
in
Theory of Computation

1.2k
views
cmi2012
theoryofcomputation
regularlanguages
2
answers
4
GATE201040
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
commented
Jan 7
in
Theory of Computation

3k
views
gate2010
theoryofcomputation
contextfreelanguage
identifyclasslanguage
normal
2
answers
5
GATE19943.3
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).
commented
Jan 5
in
Theory of Computation

3.2k
views
gate1994
theoryofcomputation
finiteautomata
normal
1
answer
6
CMI2012B02a
For a binary string $x = a_0a_1 \dots a_{n−1}$ define $val(x)$ to be $\Sigma_{0 \leq i < n} 2^{n1i}.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})$.
commented
Jan 5
in
Theory of Computation

657
views
cmi2012
descriptive
theoryofcomputation
finiteautomata
4
answers
7
GATE2008IT34
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
commented
Jan 1
in
Theory of Computation

2.3k
views
gate2008it
theoryofcomputation
contextfreelanguage
normal
2
answers
8
NTA NET DEC 2018 Q11
answered
Dec 25, 2018
in
Operating System

104
views
diskscheduling
9
answers
9
GATE200867
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$ bytes. A three level page table is used for virtual to physical address translation, where the virtual address is used as follows: ... page tables are respectively $\text{20,20,20}$ $\text{24,24,24}$ $\text{24,24,20}$ $\text{25,25,24}$
commented
Dec 24, 2018
in
Operating System

25.6k
views
gate2008
operatingsystem
virtualmemory
normal
7
answers
10
GATE2017233
A system shares $9$ ... following best describes current state of the system? Safe, Deadlocked Safe, Not Deadlocked Not Safe, Deadlocked Not Safe, Not Deadlocked
commented
Dec 22, 2018
in
Operating System

3.8k
views
gate20172
operatingsystem
resourceallocation
normal
4
answers
11
GATE198911a
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$ ... . 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?
commented
Dec 21, 2018
in
Operating System

711
views
descriptive
gate1989
operatingsystem
resourceallocation
9
answers
12
GATE2015146
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, ... the 1st millisecond and task preemptions are allowed, the first instance of $T_{3}$ completes its execution at the end of_____________________milliseconds.
commented
Dec 19, 2018
in
Operating System

10k
views
gate20151
operatingsystem
processschedule
normal
numericalanswers
2
answers
13
GATE19973.5
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
commented
Dec 17, 2018
in
Operating System

2.4k
views
gate1997
operatingsystem
pagereplacement
easy
1
answer
14
ME test series
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)
commented
Dec 11, 2018
in
Computer Networks

206
views
2
answers
15
IPv4 (Wrap around time)
Consider an IPv4 network. Each host can generate packets at the rate of 500 packets per second. If each host in the network is identified by unique identification number of 48 bits, then the host wrap around time for generating packets will be ________s
commented
Dec 9, 2018
in
Computer Networks

338
views
ipv4
computernetworks
networkaddressing
ipaddress
madeeasytestseries2018
3
answers
16
GATE200455
The routing table of a router is shown below: $\begin{array}{lll} \hline \textbf {Destination} & \textbf {Subnet Mask} & \textbf{Interface} \\\hline \text {128.75.43.0} & \text{255.255.255.0} & \text{Eth$ ... $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$
commented
Dec 8, 2018
in
Computer Networks

4.5k
views
gate2004
computernetworks
subnetting
normal
3
answers
17
GATE2004IT22
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 perpacket processing than circuit switching Packet switching can lead to reordering unlike in circuit switching
commented
Dec 5, 2018
in
Computer Networks

3.5k
views
gate2004it
computernetworks
networkswitching
normal
3
answers
18
GATE2007IT70
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}$
commented
Dec 5, 2018
in
Computer Networks

5.4k
views
gate2007it
computernetworks
networksecurity
normal
1
answer
19
broadcast
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
answered
Dec 1, 2018
in
Computer Networks

31
views
computernetworks
0
answers
20
GB CN  Test 1  Question 9
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 ... that a station in a pure Aloha network can successfully send a frame during the vulnerable time. A. B. C. D.
commented
Nov 5, 2018
in
Computer Networks

90
views
gatebook
computernetworks
1
answer
21
Homework
T(n)=0.5T(n/2)+n^3 How to solve this using recurrence method?
commented
Oct 6, 2018
in
Algorithms

137
views
1
answer
22
Combinatorics
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?
answer edited
Oct 4, 2018
in
Combinatory

132
views
permutationandcombination
discretemathematics
4
answers
23
GATE200682
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 ... $\text{B1, B5, B2, B3, B4}$ $\text{B1, B3, B4, B5, B2}$
commented
Oct 4, 2018
in
Computer Networks

7.4k
views
gate2006
computernetworks
bridges
normal
1
answer
24
TIFR2014B3
Consider the following directed graph. Suppose a depthfirst 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$. ... $B = 1$, $C = 2$, and $T = 3$. $B = 2$, $C = 2$, and $T = 1$.
commented
Oct 1, 2018
in
Algorithms

1.1k
views
tifr2014
algorithms
graphalgorithms
3
answers
25
GATE2014113
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.
commented
Sep 30, 2018
in
Algorithms

2k
views
gate20141
graphalgorithms
easy
4
answers
26
GATE200913
Which of the following statement(s) is/are correct regarding BellmanFord 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$
commented
Sep 30, 2018
in
Algorithms

4.7k
views
gate2009
algorithms
graphalgorithms
normal
1
answer
27
TIFR2018B5
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
commented
Sep 27, 2018
in
Algorithms

598
views
tifr2018
asymptoticnotations
recurrence
6
answers
28
GATE20002.11
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
commented
Sep 6, 2018
in
Digital Logic

1.7k
views
gate2000
digitallogic
kmap
normal
4
answers
29
GATE2004IT85
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 ... support if each host has to be provided a minimum throughput of $0.16$ frames per time slot? $1$ $2$ $3$ $4$
commented
Aug 31, 2018
in
Computer Networks

4.8k
views
gate2004it
computernetworks
congestioncontrol
macprotocol
normal
50,645
questions
56,597
answers
195,837
comments
102,132
users