The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
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 Mr.OOPs
User Mr.OOPs
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Mr.OOPs
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
10
answers
1
GATE201233
Suppose a fair sixsided die is rolled once. If the value on the die is $1, 2,$ or $3,$ the die is rolled a second time. What is the probability that the sum total of values that turn up is at least $6$ ? $\dfrac{10}{21}$ $\dfrac{5}{12}$ $\dfrac{2}{3}$ $\dfrac{1}{6}$
commented
Jul 10, 2018
in
Probability

7.9k
views
gate2012
probability
conditionalprobability
normal
4
answers
2
ISRO201578
The decimal number has 64 digits. The number of bits needed for its equivalent binary representation is? 200 213 246 277
commented
Jul 7, 2018
in
Digital Logic

5.4k
views
isro2015
digitallogic
numberrepresentation
2
answers
3
Hasse diagram lattice or not
commented
Jul 5, 2018
in
Set Theory & Algebra

226
views
4
answers
4
GATE2008IT28
Consider the following Hasse diagrams. Which all of the above represent a lattice? (i) and (iv) only (ii) and (iii) only (iii) only (i), (ii) and (iv) only
commented
Jul 5, 2018
in
Set Theory & Algebra

4k
views
gate2008it
settheory&algebra
lattice
normal
2
answers
5
Languages
Consider a language over Σ={a,b} the description of L is given below. L={ PQ  P ∈(a,b)* , Q ∈ (a,b)* and na(P) = nb(Q) }. Select the correct option. 1. L is DCFL but not regular. 2. L is CSL but not CFL. 3. L is CFL but not DCFL. 4. None of these.
commented
Jul 3, 2018
in
Theory of Computation

168
views
theoryofcomputation
regularlanguages
contextfreelanguages
grammar
9
answers
6
GATE19941.6, ISRO200829
The number of distinct simple graphs with up to three nodes is $15$ $10$ $7$ $9$
commented
Jul 3, 2018
in
Graph Theory

11.6k
views
gate1994
graphtheory
combinatory
normal
isro2008
counting
8
answers
7
GATE201129
We are given a set of $n$ distinct elements and an unlabeled binary tree with $n$ nodes. In how many ways can we populate the tree with the given set so that it becomes a binary search tree? $0$ $1$ $n!$ $\frac{1} {n+1} .^{2n}C_n$
commented
Jul 3, 2018
in
DS

8.5k
views
gate2011
binarytree
normal
1
answer
8
Topic: functions in C
How can we identify whether a function is call by value or call by refrence?? by looking at the defination or by looking at the statement where it is called. please someone explain
commented
Jun 2, 2018
in
Programming

185
views
2
answers
9
ISRO201423
The test suite (set of test input) used to perform unit testing on a module could cover 70% of the code. What is the reliability of the module if the probability of success is 0.95 during testing? 0.665 to 0.95 At the most 0.665 At the most 0.95 At least 0.665
commented
May 6, 2018
in
IS&Software Engineering

3k
views
isro2014
is&softwareengineering
softwaretesting
3
answers
10
ISRO201824
Choose the correct statement  $A=\{a^nb^n \mid n= 1, 2, 3, \ldots\}$ is a regular language The set $B$, consisting of all strings made up of only $a's$ and $b's$ having equal number of $a's$ and $bs$ defines a regular language $L(A^*B)\cap B$ gives the set $A$ None of the above
comment edited
May 3, 2018
in
Theory of Computation

1.7k
views
isro2018
identifyclasslanguage
theoryofcomputation
2
answers
11
ISRODEC201722
Consider the grammar with productions $S\rightarrow aSb\mid SS \mid \varepsilon$ This grammar is not contextfree, not linear not contextfree, linear contextfree, not linear contextfree, linear
commented
Apr 13, 2018
in
Theory of Computation

1.2k
views
isrodec2017
5
answers
12
ISRO201730
If there are $n$ devices (nodes) in a network, what is the number of cable links required for a fully connected mesh and a star topology respectively $n(n1)/2$, $n1$ $n$, $n1$ $n1$, $n$ $n1$, $n(n 1)/ 2$
commented
Apr 9, 2018
in
Computer Networks

3.5k
views
isro2017
computernetworks
networktopologies
1
answer
13
Language accepted by given NFA
Language accepted by following NFA and number of states in DFA accepting that Language are: $\{a^nn=2k,kϵN\}$ and 2 $\{a^{2n}n=2k,kϵN\}$ and 2 $\{a^nn=2k,kϵ N\}$ and 3 $\{a^{2n}n=2k,kϵ N\}$ and 3
commented
Mar 3, 2018
in
Theory of Computation

148
views
finiteautomata
nondeterminism
theoryofcomputation
4
answers
14
The gate book
Which of the following need not be a binary tree? (a) Heap (b) BTree (c) AVL Tree (d) None of these
commented
Feb 13, 2018
in
DS

1.6k
views
trees
1
answer
15
Finite Automata : DFA
Is the following DFA valid ?? Can we go to same state from a same state with different inputs ??
commented
Feb 11, 2018
in
Theory of Computation

94
views
finiteautomata
0
answers
16
#System call #context #switching #tread
need the concept to understand context switching for processes created by fork system call.
commented
Feb 11, 2018
in
Operating System

47
views
1
answer
17
Algorithm
commented
Feb 8, 2018
in
Algorithms

116
views
algorithms
stack
1
answer
18
Gate 2018 Question
No of minimum weight spanning tree are possible for x=?
commented
Feb 6, 2018
in
Algorithms

1.7k
views
2
answers
19
Gate 2018
NFA to DFA..no of states answer
commented
Feb 4, 2018
in
Theory of Computation

836
views
0
answers
20
ME TEST
commented
Dec 22, 2017
in
Compiler Design

40
views
2
answers
21
ISRODEC201749
A binary search tree is used to locate the number $43.$ Which one of the following probe sequence is not possible? $61,52,14,17,40,43$ $10,65,31,48,37,43$ $81,61,52,14,41,43$ $17,77,27,66,18,43$
answered
Dec 21, 2017
in
DS

830
views
isrodec2017
Amazon.in Widgets
52,223
questions
59,815
answers
201,021
comments
118,087
users