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
Answers by vijaycs
User vijaycs
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User vijaycs
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+6
votes
1
What will be the output of the following C program? If you think it will give a runtime error, you need to mention it.
answered
Apr 2, 2017
in
Programming

231
views
programminginc
+4
votes
2
Pipeline : ans should be 13 or 14?
Here loading result should take in ALU ,rt?
answered
Jan 29, 2017
in
CO and Architecture

239
views
pipelining
+3
votes
3
DSBST
If preorder of a BST is passed as an argument to the above function. Function returns 1 if, a)All the leaf nodes of the tree are at same level b) All the nodes of the tree have atmost 1 child c) True is a complete binary tree, where the nodes at each level are completely filled d) None of these
answered
Jan 13, 2017
in
DS

167
views
datastructures
tree
+4
votes
4
design a dfa and plz provide approach also
Can some plz design a dfa over binary string whr 1. each string is divisible by 7 ? 2. divivsile by 7 but start with 1
answered
Dec 29, 2016
in
Theory of Computation

343
views
+7
votes
5
Draw the LL(1) parsing table of the given grammar ?
Consider a Grammar G as follows : $S\rightarrow W$ $W \rightarrow ZXY / XY$ $Y\rightarrow c/\epsilon$ $Z\rightarrow a/d$ $X\rightarrow Xb/\epsilon$ Draw the LL(1) parsing table for the given grammar ? NOTE : The above grammar is NOT LL(1) .
answered
Dec 27, 2016
in
Compiler Design

4.5k
views
parsing
compilerdesign
ll1
grammar
+15
votes
6
Algorithm  Minimum comparison sorting
The lower bound on the no. of comparisons required to sort n numbers is __________ ?
answered
Dec 23, 2016
in
Algorithms

1.2k
views
algorithms
sorting
+15
votes
7
TIFR2017A14
Consider the following game with two players, Aditi and Bharat. There are $n$ tokens in a bag. The two players know $n$, and take turns removing tokens from the bag. In each turn, a player can either remove one token or two tokens. The player that removes the ... Aditi has a winning strategy. For both $n=7$ and $n=8$, Aditi has a winning strategy. Bharat never has a winning strategy.
answered
Dec 23, 2016
in
Numerical Ability

699
views
tifr2017
numericalability
logicalreasoning
+7
votes
8
TIFR2017A3
On planet TIFR, the acceleration of an object due to gravity is half that on planet earth. An object on planet earth dropped from a height $h$ takes time $t$ to reach the ground. On planet TIFR, how much time would an object dropped from height $h$ take to reach the ground? $\left(\dfrac{t}{\sqrt{2}}\right)$ $\sqrt {2}t$ $2t$ $\left(\dfrac{h}{t}\right)$ $\left(\dfrac{h}{2t}\right)$
answered
Dec 21, 2016
in
Numerical Ability

403
views
tifr2017
numericalability
speedtimedistance
+10
votes
9
Ace Test Series: Combinatory  Permutations And Combinations
answered
Dec 14, 2016
in
Combinatory

280
views
acetestseries
engineeringmathematics
discretemathematics
permutationandcombination
+6
votes
10
TIFR2012A18
A large community practices birth control in the following peculiar fashion. Each set of parents continues having children until a son is born; then they stop. What is the ratio of boys to girls in the community if, in the absence of birth control, 51% of the babies are born male? $51:49$ $1:1$ $49:51$ $51:98$ $98:51$
answered
Dec 9, 2016
in
Numerical Ability

310
views
tifr2012
numericalability
ratioproportion
+9
votes
11
Max Heap
The number of ways , in which numbers 1,2,3,4,5 can be inserted into binary heap,such that resultant binary heap is max heap ? given ans :8
answered
Dec 9, 2016
in
Programming

1.3k
views
heap
binaryheap
algorithms
+3
votes
12
TOC DFA
Number of states in DFA which accepts the binary strings divisible by 4 or 5. answer?
answered
Dec 9, 2016
in
Theory of Computation

1k
views
theoryofcomputation
minimalstateautomata
+3
votes
13
MadeEasy Test Series: Programming & DS  Hashing
answered
Dec 6, 2016
in
DS

114
views
madeeasytestseries
datastructures
hashing
+2
votes
14
MadeEasy Test Series: Programming & DS  Programming In C
answer?
answered
Dec 1, 2016
in
CO and Architecture

119
views
madeeasytestseries
programming
programminginc
+2
votes
15
Programming
answered
Nov 30, 2016
in
Programming

112
views
programminginc
+5
votes
16
what is the probability you will see a full moon?
A full moon occurs every 29 nights. If you choose a night at random and then observe the night sky for 11 successive nights, what is the probability you will see a full moon? 0.03 0.11 0.38
answered
Nov 29, 2016
in
Probability

335
views
probability
engineeringmathematics
+4
votes
17
MEFST1Q51
I have a little doubt regarding the Language L.Any one please what L contain?
answered
Nov 14, 2016
in
Theory of Computation

268
views
0
votes
18
TIFR2014MathsA10
Let $C\subset \mathbb{Z} \times\mathbb{Z}$ be the set of integer pairs $(a, b)$ for which the three complex roots $r_{1}, r_{2}$ and $r_{3}$ of the polynomial $p(x)=x^{3}2x^{2}+axb$ satisfy $r^{3}_{1}+r^{3}_{2}+r^{3}_{3}=0$. Then the cardinality of $C$ is $C = \infty$ $C = 0$ $C = 1$ $1 < C < \infty$
answered
Nov 12, 2016
in
Set Theory & Algebra

106
views
tifrmaths2014
sets
+1
vote
19
vgate
why is B wrong? as far as i know DRAM has less number of gates and hence its cheaper. but static RAM contains many gates per bit
answered
Oct 24, 2016
in
CO and Architecture

71
views
0
votes
20
vgate
what is ur take on this? @arjun sir please see this
answered
Oct 24, 2016
in
CO and Architecture

180
views
+16
votes
21
GO2017Programming122
Which one among the following definitions of string str could cause problem when passed as the first argument to printf function? char str[] = "Hello World"; char str[12] = "Hello World"; char *str = "Hello World"; char str[] = {'H','e','l','l','o',' ','W','o','r','l','d'};
answered
Oct 24, 2016
in
Programming

577
views
go2017programming1
programming
programminginc
+2
votes
22
Virtual Gate Test Series: Calculus  Integration
Let $\frac{d}{dx} [f(x)] = \frac{e^{sinx}}{x} , x > 0 .$ If $\int_{1}^{4}(\frac{2e^{sinx^{2}}}{x}) dx = f(k)  f(1)$ where limits of integration is from $1$ to $4$ , then $k =?$
answered
Oct 4, 2016
in
Calculus

317
views
engineeringmathematics
calculus
virtualgatetestseries
+10
votes
23
Peter Linz Edition 4 Exercise 2.1 Question 6 (Page No. 47)
With $Σ = $ {$a,b$} , give a dfa for $L =$ {$w_1aw_2: w1≥ 3, w2≤ 5$}.
answered
Oct 4, 2016
in
Theory of Computation

135
views
theoryofcomputation
peterlinz
finiteautomata
+4
votes
24
MADE EASY TEST SERIES
Is L = {a bn an ;n > 0} $\cup${aa bk a2k ;k > 0} a DCFL ???
answered
Oct 4, 2016
in
Theory of Computation

165
views
0
votes
25
Please help in solving this question a **** big doubt
answered
Oct 3, 2016
in
Compiler Design

333
views
0
votes
26
Mutual exclusion
Consider the following code: #define N 2 #define FALSE 0 #define TRUE 1 Int Interested [N]; //initially both are set to FALSE. Void enter(int process) { int other; Other=1process; Interested[process]=TRUE; While(Interested[other]==TRUE); { ... ; } } Void Leave(int process) { Interested[process]=FALSE; } Find whether progress, mutual exclusion and bounded waiting are satisfied?
answered
Sep 28, 2016
in
Operating System

231
views
+2
votes
27
UGCNETAUG2016II25
Given the following prefix expression : $^{*} + 3 + 3 ↑ 3 + 3 3 3$ What is the value of the prefix expression ? $2178$ $2199$ $2205$ $2232$
answered
Sep 27, 2016
in
Others

1.8k
views
ugcnetaug2016ii
datastructures
prefixexpression
+3
votes
28
mutual exclusion,deadlock problem
which of the following statements are correct? a. 1 only b. 2 only c. both d. none
answered
Sep 27, 2016
in
Operating System

329
views
operatingsystem
deadlock
+5
votes
29
Expectated no of coin toss
An unbiased coin is tossed repeatedly and outcomes are recorded. What is the expected no of toss to get HT ( one head and one tail consecutively) ?
answered
Sep 26, 2016
in
Probability

745
views
discretemathematics
probability
expectation
counting
+2
votes
30
UGCNETAUG2016II32
The content of the accumulator after the execution of the following 8085 assembly language program, is MVI A, 35H MOV B, A STC CMC RAR XRA B $00H$ $35H$ $EFH$ $2FH$
answered
Sep 26, 2016
in
CO and Architecture

1.6k
views
ugcnetaug2016ii
coandarchitecture
assembly
8085
+12
votes
31
fork system call
Consider the following code snippet: if(fork()&& fork()) { fork(); } if(fork()fork()) { fork(); fork(); } printf("GATE 2017"); How many times GATE 2017 printed ?
answered
Sep 26, 2016
in
Operating System

2.2k
views
fork
operatingsystem
+2
votes
32
Finite Automata
Construct dfa for set of all strings where every pair of consecutive 0's occurs before any pair of adjacent 1's ?
answered
Sep 26, 2016
in
Theory of Computation

359
views
theoryofcomputation
finiteautomata
+6
votes
33
Minimized DFA no of states  Peter Linz
$L = \left \{ a^nb \ ; n\geq 0 \right \} \cup \left \{ b^na \ ; n\geq 1 \right \}$ Minimal DFA for the above language ?
answered
Sep 24, 2016
in
Theory of Computation

1k
views
theoryofcomputation
minimalstateautomata
finiteautomata
theoryofcomputation_
+2
votes
34
Toc Ullman
Give DFA of The set of all strings which when interpreted as a binary integer is a multiple of 3.
answered
Sep 20, 2016
in
Theory of Computation

459
views
theoryofcomputation
+3
votes
35
practice questions
what should be the ans?
answered
Sep 10, 2016
in
Programming

86
views
+3
votes
36
What is the time complexity of given recurrence relation
1. T(n) = T(na) + T(a) + cn 2. T(n) = T(αn) + T( (1α)n ) + cn where α, a and c are constant.
answered
Sep 8, 2016
in
Algorithms

395
views
Page:
1
2
3
4
next »
50,741
questions
57,232
answers
197,993
comments
104,579
users