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 Harsh181996
User Harsh181996
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Harsh181996
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
3
answers
1
CSL and Regular language
if L1 = { anbncn  n>= 0 } and L2 = { anbmck  k,n,m>=0} L1 is CSL and L2 is regular. Now L3 = L1.(L2)*. Is L3 is regualar or CSL?
commented
May 15, 2017
in
Theory of Computation

625
views
theoryofcomputation
contextsensitive
regularlanguages
1
answer
2
IIITHPGEE 2017
Consider 3 card one having both side painted red another having both side printed black and last having one side black and another side red, 3 cards are put in a hat and are mixed properly, now one card in picked and put down on table, its face up color is red what is probability that another side will be black.
comment edited
May 6, 2017
in
Probability

604
views
iiithpgee
probability
0
answers
3
theory of computation
commented
Apr 12, 2017
in
Theory of Computation

47
views
theoryofcomputation
1
answer
4
Algorithms Basic Question
answer edited
Apr 12, 2017
in
Algorithms

82
views
1
answer
5
iisc admission
when does iisc call candidates for mtech(res) interview? is it later after the mtech interviews?
answered
Apr 10, 2017
in
IISc/IITs

262
views
iisc
iiscinterview
admissiongate2017
3
answers
6
CIL17
commented
Apr 10, 2017
in
DS

485
views
1
answer
7
IIT K interview dates
IIT K will be conducting interview/written tests around May 1416 and I have semester exams during that time. How am I supposed to attend the process? Will they change dates because many students may face this issue? Please someone answer. IIT K is the best option I have.
commented
Mar 29, 2017
in
IISc/IITs

471
views
1
answer
8
Discrete Probability Doubt
Consider a group of k people. Assume that each person's birthday is drawn uniformly at random from the 365 possibilities. (And ignore leap years.) What is the smallest value of ksuch that the expected number of pairs of distinct people with the same birthday is at least one?
answer selected
Mar 18, 2017
in
Combinatory

541
views
discretemathematics
probability
3
answers
9
csma/cd
Two csma/cd stations are trying to send frames..After each frame is sent they contend for channel using backoff exponential algorithm?What is probability that contention ends on round k?
commented
Mar 13, 2017
in
Computer Networks

1.2k
views
computernetworks
csmacd
2
answers
10
Algorithm(Recurrences)
What is the value of following recurrence. T(n) = T(n/4) + T(n/2) + cn^2 T(1) = c T(0) = 0 Where c is a positive constant A) O(n^3) B) O(n^2) C) O(n^2logn) D) O(nlogn)
commented
Mar 5, 2017
in
Algorithms

192
views
algorithms
2
answers
11
Discrete Math
Prove or disprove the following: for finite sets A and B, $\overline{(A  B) \cup (B  A)} = A \cap B$ . If the proposition is incorrect, do minimal modifications to the same and prove.
commented
Feb 23, 2017
in
Set Theory & Algebra

137
views
discretemathematics
iitg_math
nongate
descriptive
4
answers
12
GATE20171GA7
Six people are seated around a circular table. There are at least two men and two women. There are at least three righthanded persons. Every woman has a lefthanded person to her immediate right. None of the women are righthanded. The number of women at the table is $2$ $3$ $4$ Cannot be determined
answered
Feb 14, 2017
in
Numerical Ability

3.2k
views
gate20171
numericalability
roundtablearrangement
5
answers
13
GateBook MockTest2
Suppose datagrams are limited to 1,500 bytes (including header) between source Host A and destination Host B. Assuming a 20byte IP header and a 20byte TCP header, how many datagrams would be required to send an MP3 consisting of 4 million bytes?
answered
Feb 8, 2017
in
Computer Networks

1.4k
views
computernetworks
gatebook_mt2
ippacket
8
answers
14
GATE200750
An array of $n$ numbers is given, where $n$ is an even number. The maximum as well as the minimum of these $n$ numbers needs to be determined. Which of the following is TRUE about the number of comparisons needed? At least $2nc$ comparisons, for some constant $c$ are needed. At most $1.5n2$ comparisons are needed. At least $n\log_2 n$ comparisons are needed None of the above
answered
Feb 5, 2017
in
Algorithms

6.5k
views
gate2007
algorithms
timecomplexity
easy
0
answers
15
Mock Test
Given Answer D) I think the answer should be A) Complement of L1 will be ( i = j or j = k) right so there can be a NPDA that will accept this right ?
commented
Feb 5, 2017
in
Theory of Computation

117
views
theoryofcomputation
0
answers
16
GateForum Mock Test
The given answer is A) but option A) produces the string "ab" which is not produced by the above grammar so how can the answer be A) ?
commented
Feb 5, 2017
in
Compiler Design

100
views
gateforumtestseries
compilerdesign
1
answer
17
Mock Test
The answer given is D) Why is option 3 and 4 correct ? In 4) if there is a branch instruction , it can lead to stalls ,so how will it improve the execution ?
asked
Feb 5, 2017
in
CO and Architecture

97
views
pipelining
coandarchitecture
15
answers
18
GATE2016154
For a host machine that uses the token bucket algorithm for congestion control, the token bucket has a capacity of $1$ $\text{megabyte}$ and the maximum output rate is $20$ $\text{megabytes}$ per $\text{second}$. Tokens arrive at a rate to sustain output ... needs to send $12$ $\text{megabytes}$ of data. The minimum time required to transmit the data is _____________ $\text{seconds}$.
commented
Feb 4, 2017
in
Computer Networks

12.9k
views
gate20161
computernetworks
tokenbucket
normal
numericalanswers
1
answer
19
YACC
in case of shiftreduce and RR conflict, which is favoured by YACC?
answered
Feb 3, 2017
in
Compiler Design

146
views
compilerdesign
1
answer
20
Functional Dependency Doubt
The given answer is C) But shouldnt the answer be D) as it satisfies the new database
answer selected
Jan 27, 2017
in
Databases

83
views
databases
databasenormalization
5
answers
21
GATE200346
Consider the ALU shown below. If the operands are in $2's$ complement representation, which of the following operations can be performed by suitably setting the control lines $K$ and $C_0$ only (+ and  denote addition and subtraction respectively)? $A + B$, and $A  B$, but not $A + 1$ $A + B$ ... $A  B$ $A + B$, but not $A  B$ or $A + 1$ $A + B$, and $A  B$, and $A + 1$
commented
Jan 27, 2017
in
Digital Logic

5.7k
views
gate2003
digitallogic
normal
adder
2
answers
22
GATE2016242
Consider the following two statements: If all states of an NFA are accepting states then the language accepted by the NFA is $\Sigma_{}^{*}$. There exists a regular language $A$ such that for all languages $B$, $A \cap B$ is regular. Which one of the following is CORRECT? Only I is true Only II is true Both I and II are true Both I and II are false
comment edited
Jan 26, 2017
in
Theory of Computation

7k
views
gate20162
theoryofcomputation
finiteautomata
normal
1
answer
23
Stack Doubt
The question basically says no. of different outputs produced for given sequence of input (1,2,...,n) I thought in terms of push  pop pairs but cant arrive at the answer @arjun sir , @bikram sir
answer selected
Jan 26, 2017
in
Programming

189
views
stack
datastructures
1
answer
24
Mock Test
Is statement 1 true for all safe expressions ?
asked
Jan 24, 2017
in
Databases

331
views
databases
relationalalgebra
relationalcalculus
3
answers
25
GATE19973.4
Given $\Sigma=\{a,b\}$, which one of the following sets is not countable? Set of all strings over $\Sigma$ Set of all languages over $\Sigma$ Set of all regular languages over $\Sigma$ Set of all languages over $\Sigma$ accepted by Turing machines
comment edited
Jan 20, 2017
in
Theory of Computation

3.2k
views
gate1997
theoryofcomputation
normal
countableuncountableset
2
answers
26
SQL Query
The Given Answer is C) , my doubt is can PassportNo take NULL values as it is defined as UNIQUE ?
asked
Jan 17, 2017
in
Databases

160
views
databases
sql
2
answers
27
Pipelining (Hamacher)
A pipeline processor has two branch delay slots. An optimizing compiler can fill one of these slots 85% of the time and can fill the second slot 20% of the time. What percentage improvement in performence achieved by this optimization, assuming 20% of the instruction executed are branch instruction?
comment edited
Jan 15, 2017
in
CO and Architecture

666
views
pipelining
1
answer
28
Computer Architecture
I am getting answer as 9 , the given answer is 8.
asked
Jan 12, 2017
in
CO and Architecture

196
views
pipelining
coandarchitecture
10
answers
29
GATE200447
Consider a system with a twolevel paging scheme in which a regular memory access takes $150$ $nanoseconds$, and servicing a page fault takes $8$ $milliseconds$. An average instruction takes $100$ nanoseconds of CPU time, and two memory accesses. The ... instruction execution time? $\text{645 nanoseconds}$ $\text{1050 nanoseconds}$ $\text{1215 nanoseconds}$ $\text{1230 nanoseconds}$
comment edited
Jan 10, 2017
in
CO and Architecture

21.8k
views
gate2004
coandarchitecture
virtualmemory
normal
2
answers
30
Travelling Salesman Problem
A)250 B)300 C)550 D)375
answered
Jan 5, 2017
in
Algorithms

1.1k
views
graphalgorithms
0
answers
31
Targate
Here it is mentioned as a queue and not a priority queue ,what would be the answer ?
asked
Jan 5, 2017
in
Algorithms

65
views
algorithms
graphalgorithms
primsalgorithm
1
answer
32
Targate
The Answer given is A) I think the naswer should be B) as we have both the prev pointer and the next pointer available , it will take constant time to update the adjacent nodes pointers and delete the given node .?
asked
Jan 3, 2017
in
DS

896
views
linkedlists
datastructures
timecomplexity
5
answers
33
GATE2016244
Consider the following languages. $L_{1} = \left\{\left\langle M \right\rangle \mid M \text{ takes at least 2016 steps on some input} \right\}$, $L_{2} = \left\{\left\langle M \right\rangle \mid M \text { takes at least 2016 steps on all inputs} \right\}$ ... $L_{1}, L_{2}$ are recursive and $L_{3}$ is not recursive $L_{1}, L_{2}, L_{3}$ are recursive
comment edited
Jan 2, 2017
in
Theory of Computation

12k
views
gate20162
theoryofcomputation
recursiveandrecursivelyenumerablelanguages
6
answers
34
GATE201039
Let $L=\{ w \in \:(0+1)^* \mid w\text{ has even number of }1s \}$. i.e., $L$ is the set of all the bit strings with even numbers of $1$s. Which one of the regular expressions below represents $L$? $(0^*10^*1)^*$ $0^*(10^*10^*)^*$ $0^*(10^*1)^*0^*$ $0^*1(10^*1)^*10^*$
comment edited
Jan 2, 2017
in
Theory of Computation

4.9k
views
gate2010
theoryofcomputation
regularexpressions
normal
5
answers
35
GATE200449
A unixstyle Inodes has $10$ direct pointers and one single, one double and one triple indirect pointers. Disk block size is $1$ Kbyte, disk block address is $32$ bits, and $48$bit integers are used. What is the maximum possible file size? $2^{24}$ bytes $2^{32}$ bytes $2^{34}$ bytes $2^{48}$ bytes
comment edited
Dec 29, 2016
in
Operating System

7k
views
gate2004
operatingsystem
disks
normal
5
answers
36
GATE201048
A computer system has an $L1$ cache, an $L2$ cache, and a main memory unit connected as shown below. The block size in $L1$ cache is $4$ words. The block size in $L2$ cache is $16$ words. The memory access times are $2 \hspace{0.1cm} nanoseconds$, ... transfer? $2 \hspace{0.1cm} nanoseconds$ $20 \hspace{0.1cm} nanoseconds$ $22 \hspace{0.1cm}nanoseconds$ $88 \hspace{0.1cm} nanoseconds$
comment edited
Dec 19, 2016
in
CO and Architecture

12k
views
gate2010
coandarchitecture
cachememory
normal
barc2017
4
answers
37
GATE20029
Consider the following $32bit$ floatingpoint representation scheme as shown in the format below. A value is specified by $3$ fields, a one bit sign field (with $0$ for positive and $1$ for negative values), a $24 bit$ fraction field (with the ... the hexadecimal. What is the largest value that can be represented using this format? Express your answer as the nearest power of $10$.
comment edited
Dec 17, 2016
in
Digital Logic

3.5k
views
gate2002
digitallogic
numberrepresentation
normal
descriptive
6
answers
38
GATE201245
Consider an instance of TCP's Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of the slow start phase is $2$ MSS and the threshold at the start of the first transmission is $8$ MSS. Assume that a timeout occurs during the ... . Find the congestion window size at the end of the tenth transmission. $8$ MSS $14$ MSS $7$ MSS $12$ MSS
answered
Dec 4, 2016
in
Computer Networks

12.5k
views
gate2012
computernetworks
congestioncontrol
normal
5
answers
39
GATE200353
A single tape Turing Machine $M$ has two states $q0$ and $q1$, of which $q0$ is the starting state. The tape alphabet of $M$ is $\{0, 1, B\}$ and its input alphabet is $\{0, 1\}$. The symbol $B$ is the blank symbol used to indicate end of an input string. The ... does not halt on any string in $(00+1)^*$ $M$ halts on all strings ending in a $0$ $M$ halts on all strings ending in a $1$
comment edited
Dec 4, 2016
in
Theory of Computation

3k
views
gate2003
theoryofcomputation
turingmachine
normal
11
answers
40
GATE2014139
The minimum number of comparisons required to find the minimum and the maximum of $100$ numbers is ________
answered
Nov 28, 2016
in
Algorithms

14.5k
views
gate20141
algorithms
numericalanswers
normal
minimummaximum
50,741
questions
57,244
answers
198,018
comments
104,611
users