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 srestha
User srestha
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User srestha
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
2
answers
1
coin probability
an unbiased coin is tossed infinite no of times.The probability that 4th head appear at 10th toss is 1) 0.067 2) 0.073 3) 0.082 4) 0.091
commented
1 day
ago
in
Probability

1.6k
views
probability
5
answers
2
GATE2006IT15
Which of the following relational query languages have the same expressive power? Relational algebra Tuple relational calculus restricted to safe expressions Domain relational calculus restricted to safe expressions II and III only I and II only I and III only I, II and III
commented
1 day
ago
in
Databases

1.9k
views
gate2006it
databases
relationalalgebra
relationalcalculus
easy
2
answers
3
TIFR2019B5
Stirling's approximation for $n!$ states for some constants $c_1,c_2$ $c_1 n^{n+\frac{1}{2}}e^{n} \leq n! \leq c_2 n^{n+\frac{1}{2}}e^{n}.$ What are the tightest asymptotic bounds that can be placed on $n!$ $?$ ... $n! =\Theta((\frac{n}{e})^{n+\frac{1}{2}})$ $n! =\Theta(n^{n+\frac{1}{2}}2^{n})$
commented
6 days
ago
in
Algorithms

341
views
tifr2019
algorithms
asymptoticnotations
4
answers
4
TIFR2019A11
Suppose there are $n$ guests at a party (and no hosts). As the night progresses, the guests meet each other and shake hands. The same pair of guests might shake hands multiple times. for some parties stretch late into the night , and it is hard to keep track.Still, they don't shake ... $2 \mid \text{Even} \mid  \mid \text{Odd} \mid$ $2 \mid \text{Odd} \mid  \mid \text{Even} \mid$
commented
6 days
ago
in
Numerical Ability

316
views
tifr2019
generalaptitude
numericalability
logicalreasoning
1
answer
5
TIFR2019B15
Consider directed graphs on $n$ labelled vertices $\{1,2, \dots ,n\}$, where each vertex has exactly one edge coming in and exactly one edge going out. We allow selfloops. How many graphs have exactly two cycles ? $\sum_{k=1}^{n1} k!(nk)!$ $\frac{n!}{2}\bigg[\sum_{k=1}^{n1} \frac{1}{k(nk)}\bigg]$ $n!\bigg[\sum_{k=1}^{n1} \frac{1}{k}\bigg]$ $\frac{n!(n1)}{2}$ None of the above
edited
6 days
ago
in
Graph Theory

364
views
tifr2019
graphconnectivity
graphtheory
5
answers
6
GATE20012.25
Consider a relation geq which represents "greater than or equal to", that is, $(x,y) \in $ geq only if $y \geq x$. create table geq ( ib integer not null, ub integer not null, primary key ib, foreign key (ub) references geq on delete cascade ); Which of the ... tuple (z,w) with z > x is deleted A tuple (z,w) with w < x is deleted The deletion of (x,y) is prohibited
comment edited
Dec 3
in
Databases

3k
views
gate2001
databases
sql
normal
2
answers
7
GATE20002.25
Given relations r(w, x) and s(y, z) the result of select distinct w, x from r, s is guaranteed to be same as r, provided. r has no duplicates and s is nonempty r and s have no duplicates s has no duplicates and r is nonempty r and s have the same number of tuples
commented
Dec 3
in
Databases

4.9k
views
gate2000
databases
sql
3
answers
8
GATE199776a
Consider the following relational database schema: EMP (eno name, age) PROJ (pno name) INVOLVED (eno, pno) EMP contains information about employees. PROJ about projects and involved about which employees involved in which projects. The underlined attributes are the ... which is equivalent to SQL query. select eno from EMPINVOLVED where EMP.eno=INVOLVED.eno and INVOLVED.pno=3
commented
Dec 3
in
Databases

1.2k
views
gate1997
databases
sql
relationalalgebra
1
answer
9
ISI2011PCBCS4a
Let $L$ be the set of strings over $\{0, 1\}$ containing an unequal number of $0$s and $1$s. Prove that $L$ is not regular. $L^2$ is regular.
commented
Dec 2
in
Theory of Computation

182
views
descriptive
isi2011pcbcs
theoryofcomputation
regularlanguages
3
answers
10
GATE19981.19
Which of the following addressing modes permits relocation without any change whatsoever in the code? Indirect addressing Indexed addressing Base register addressing PC relative addressing
commented
Dec 1
in
CO and Architecture

2.8k
views
gate1998
coandarchitecture
addressingmodes
easy
3
answers
11
GATE201842
Consider the following four relational schemas. For each schema , all nontrivial functional dependencies are listed, The bolded attributes are the respective primary keys. Schema I: Registration(rollno, courses) Field courses' is a setvalued attribute containing the set of ... Which one of the relational schemas above is in 3NF but not in BCNF? Schema I Schema II Schema III Schema IV
edited
Nov 30
in
Databases

2.9k
views
gate2018
databases
databasenormalization
normal
0
answers
12
MadeEasy Subject Test 2019: Algorithms  Dynamic Programming
Let G = (V,E) be a directed graph.Each edge of G is represented as (i,j) with length l[i,j].If there is no edge from i to j then l[i,j] = (IMAGE ATTACHED)
commented
Nov 30
in
Algorithms

132
views
madeeasytestseries
algorithms
dynamicprogramming
4
answers
13
GATE200748
Which of the following is TRUE about formulae in Conjunctive Normal Form? For any formula, there is a truth assignment for which at least half the clauses evaluate to true. For any formula, there is a truth assignment for which all the clauses evaluate to true. There is a formula such that for each truth assignment, at most onefourth of the clauses evaluate to true. None of the above.
commented
Nov 30
in
Digital Logic

4.5k
views
gate2007
digitallogic
normal
conjunctivenormalform
4
answers
14
GATE200568
A $5$ stage pipelined CPU has the following sequence of stages: IF  instruction fetch from instruction memory RD  Instruction decode and register read EX  Execute: ALU operation for data and address computation MA  Data memory access  for write access, the register ... cycles taken to complete the above sequence of instructions starting from the fetch of $I_1$? $8$ $10$ $12$ $15$
commented
Nov 30
in
CO and Architecture

13.9k
views
gate2005
coandarchitecture
pipelining
normal
12
answers
15
GATE2007IT83
The head of a hard disk serves requests following the shortest seek time first (SSTF) policy. The head is initially positioned at track number $180$. What is the maximum cardinality of the request set, so that the head changes its direction after servicing every request if the total number of tracks are $2048$ and the head can start from any track? $9$ $10$ $11$ $12$
commented
Nov 28
in
Operating System

6.1k
views
gate2007it
operatingsystem
diskscheduling
normal
3
answers
16
Demand Paging
Suppose: TLB lookup time = 20 ns TLB hit ratio = 80% memory access time = 75 ns swap page time = 500,000 ns 75% of pages are dirty OS uses a 3 level page table What is the effective access time (EAT) if we assume the page fault rate is 15% ?
commented
Nov 25
in
Operating System

1.4k
views
operatingsystem
demandpaging
memorymanagement
multilevelpaging
4
answers
17
GATE201851
A processor has $16$ integer registers $(R0, R1, \ldots , R15)$ and $64$ floating point registers $(F0, F1, \ldots , F63).$ It uses a $2 byte$ instruction format. There are four categories of instructions: $Type1, Type2, Type3,$ and $Type4.$ ... $Type4$ category consists of $N$ instructions, each with a floating point register operand $(1F).$ The maximum value of $N$ is _____
commented
Nov 25
in
CO and Architecture

6.6k
views
gate2018
coandarchitecture
machineinstructions
instructionformat
numericalanswers
6
answers
18
GATE2016222
Suppose a database schedule $S$ involves transactions $T_1,........,T_n$ . Construct the precedence graph of $S$ with vertices representing the transactions and edges representing the conflicts.If $S$ is serializable, which one of the ... is guaranteed to yield a serial schedule? Topological order Depthfirst order Breadth first order Ascending order of the transaction indices
commented
Nov 24
in
Databases

4.5k
views
gate20162
databases
transactions
normal
3
answers
19
Fork (ACE)
main() { if(fork()>=0) { printf("*"); if(fork()==0) { printf("*"); } else{ //do nothing } printf("*"); } How many number of times “*” will be printed?
commented
Nov 24
in
Operating System

374
views
fork
operatingsystem
2
answers
20
GATE19871vii
The exponent of a floatingpoint number is represented in excessN code so that: The dynamic range is large. The precision is high. The smallest number is represented by all zeros. Overflow is avoided.
commented
Nov 24
in
Digital Logic

1.1k
views
gate1987
digitallogic
numberrepresentation
floatingpointrepresentation
6
answers
21
GATE201822
Consider the sequential circuit shown in the figure, where both flipflops used are positive edgetriggered D flipflops. The number of states in the state transition diagram of this circuit that have a transition back to the same state on some value of "in" is ____
commented
Nov 24
in
Digital Logic

5k
views
gate2018
digitallogic
flipflop
numericalanswers
normal
0
answers
22
Variation on Birthday Problem
So, I have read the birthday paradox problem, and now I came across below question: Assuming the following: there are no leap years, all years have $n = 365$ days and that people's birthdays are uniformly distributed across the $n$ days of the year. (i) How many ... $n=23$, this works out to be 0.53 and Yes it seems to me I am done. Please correct me If I am wrong.
commented
Nov 22
in
Probability

80
views
probability
1
answer
23
TIFR2014A13
Let $L$ be a line on the two dimensional plane. $L'$s intercepts with the $X$ and $Y$ axes are respectively $a$ and $b$. After rotating the coordinate system (and leaving $L$ untouched), the new intercepts are $a'$ and $b'$ ... $\frac{b}{a}+\frac{a}{b}=\frac{b'}{a'}+\frac{a'}{b'}$. None of the above.
commented
Nov 21
in
Numerical Ability

254
views
tifr2014
geometry
cartesiancoordinates
2
answers
24
GATE2017208
In a file allocation system, which of the following allocation scheme(s) can be used if no external fragmentation is allowed ? Contiguous Linked Indexed 1 and 3 only 2 only 3 only 2 and 3 only
commented
Nov 21
in
Operating System

3.7k
views
gate20172
operatingsystem
filesystem
normal
0
answers
25
Self Doubt
Let 'P' be the $8's$ complement of $[507]_{9}$ and 'Q' be the 7's complement of $[400]_{7}$ then what is the value, if Q subtracted from P?
closed
Nov 21
in
Digital Logic

123
views
digitallogic
1
answer
26
Ace Test Series: Digital Logic  Number System
answer edited
Nov 21
in
Digital Logic

112
views
acetestseries
digitallogic
numbersystem
1
answer
27
GATE19884ii
Using binary full adders and other logic gates (if necessary), design an adder for adding 4bit number (including sign) in 2’s complement notation.
commented
Nov 21
in
Digital Logic

278
views
gate1988
digitallogic
descriptive
adder
0
answers
28
Theory of Computation
For a binary string x = a0a1 · · · an−1 define val(x) to be the value of x interpreted as a binary number, where a0 is the most significant bit. More formally, val(x) is given by How many minimum states will be in a finite automaton that accepts exactly the set of binary strings x such that val(x) is divisible by either 4 or 5. i m getting 5 states. ??
commented
Nov 20
in
Theory of Computation

118
views
theoryofcomputation
finiteautomata
regularlanguages
2
answers
29
TIFR2017B14
Consider the following grammar $G$ with terminals $\{[, ]\}$, start symbol $S$, and nonterminals $\{A, B, C\}$: $S \rightarrow AC \mid SS \mid AB$ $C \rightarrow SB$ $A \rightarrow [$ $B \rightarrow ]$ A language $L$ is called prefixclosed if for ... free $L(G)$ is infinite $L(G)$ can be recognized by a deterministic push down automaton $L(G)$ is prefixclosed $L(G)$ is recursive
commented
Nov 20
in
Theory of Computation

637
views
tifr2017
theoryofcomputation
identifyclasslanguage
0
answers
30
Allen Career Institute:Circular Queue
$1)$How circular queue can be implemented? $2)$ For which data structure circular queue cannot be implemented? $(A)$Array $(B)$ Singly Linked List $(C)$ Doubly Linked List $(D)$ Stack
comment edited
Nov 20
in
DS

206
views
datastructure
circularqueue
2
answers
31
complexity
We want to sort input sequence in ascending order. If inputs are already ascending order , then what is the time complexity to run this of all well known sort (Bobble sort, quick sort,merge sort, insertion sort, selection sort, heap sort,...) Which complexity of sorting will be change with general case complexity? Which are not ? If any resource u have for this question plz. provide
recategorized
Nov 19
in
Algorithms

171
views
algorithms
1
answer
32
MADE EASY COMBINATORICS
commented
Nov 19
in
Mathematical Logic

73
views
2
answers
33
TIFR2014B13
Let $L$ be a given contextfree language over the alphabet $\left\{a, b\right\}$. Construct $L_{1},L_{2}$ as follows. Let $L_{1}= L  \left\{xyx\mid x, y \in \left\{a, b\right\}^*\right\}$, and $L_{2} = L \cdot L$. Then, Both $L_{1}$ and $L_{2}$ ... and $L_{2}$ is context free. $L_{1}$ and $L_{2}$ both may not be context free. $L_{1}$ is regular but $L_{2}$ may not be context free.
commented
Nov 19
in
Theory of Computation

863
views
tifr2014
theoryofcomputation
identifyclasslanguage
8
answers
34
GATE2017239
Let $\delta$ denote the transition function and $\widehat{\delta}$ denote the extended transition function of the $\epsilon$NFA whose transition table is given below: $\begin{array}{cccc}\hline \delta & \text{$\epsilon$} & \text{$a$} & \text{$ ... $\emptyset$ $\{q_0, q_1, q_3\}$ $\{q_0, q_1, q_2\}$ $\{q_0, q_2, q_3 \}$
commented
Nov 19
in
Theory of Computation

6.1k
views
gate20172
theoryofcomputation
finiteautomata
1
answer
35
Made Easy Test Series: Algo Mathematical Solution
Through an experiment, it is found that selection sort performs $5000$ comparisons when sorting an array of size $k.$ If the size of array is doubled, what will be the number of comparisons? will it be $\left ( 5000 \right )^{2}$ or $\left ( 5000 \right )\times 4$. Someone check plz
comment moved
Nov 18
in
Algorithms

59
views
madeeasytestseries
algorithms
4
answers
36
GATE20197
If $L$ is a regular language over $\Sigma = \{a,b\} $, which one of the following languages is NOT regular? $L.L^R = \{xy \mid x \in L , y^R \in L\}$ $\{ww^R \mid w \in L \}$ $\text{Prefix } (L) = \{x \in \Sigma^* \mid \exists y \in \Sigma^* $such that$ \ xy \in L\}$ $\text{Suffix }(L) = \{y \in \Sigma^* \mid \exists x \in \Sigma^* $such that$ \ xy \in L\}$
commented
Nov 18
in
Theory of Computation

2.4k
views
gate2019
theoryofcomputation
regularlanguages
4
answers
37
TIFR2010B27
Consider the Insertion Sort procedure given below, which sorts an array $L$ of size $n\left ( \geq 2 \right )$ in ascending order: begin for xindex:= 2 to n do x := L [xindex]; j:= xindex  1; while j > 0 and L[j] > x do L[j + 1]:= L[j]; ... makes $n (n  1) / 2 $ comparisons. Insertion Sort makes $n (n  1) / 2$ comparisons whenever all the elements of $L$ are not distinct.
commented
Nov 17
in
Algorithms

739
views
tifr2010
algorithms
sorting
0
answers
38
Testbook Test Series: Compiler Design  Syntax Directed Translation
comment edited
Nov 16
in
Compiler Design

186
views
compilerdesign
syntaxdirectedtranslation
testbooktestseries
1
answer
39
GATE19871IV
The output $F$ of the below multiplexer circuit can be represented by $AB+B\bar{C}+\bar{C}A+\bar{B}\bar{C}$ $A\oplus B\oplus C$ $A \oplus B$ $\bar{A} \bar{B} C+ \bar{A} B \bar{C}+A \bar{B} \bar{C}$
commented
Nov 16
in
Digital Logic

830
views
gate1987
digitallogic
circuitoutput
multiplexer
2
answers
40
MadeEasy Test Series: Compiler Design  Syntax Directed Translation
Question: Options:
answered
Nov 16
in
Compiler Design

93
views
madeeasytestseries
compilerdesign
syntaxdirectedtranslation
50,645
questions
56,542
answers
195,693
comments
101,534
users