Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by vijaycs
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.
What will be the output of the following C program? If you think it will give a runtime error, you need to mention it. In either case,your answer must include proper just...
1.6k
views
answered
Apr 2, 2017
Programming in C
programming-in-c
+
–
5
votes
2
Pipeline : ans should be 13 or 14?
Here loading result should take in ALU ,rt?
Here loading result should take in ALU ,rt?
887
views
answered
Jan 29, 2017
CO and Architecture
pipelining
+
–
5
votes
3
DS-BST
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
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 levelb) All the nodes of the tree ...
946
views
answered
Jan 13, 2017
DS
data-structures
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
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
4.2k
views
answered
Dec 29, 2016
8
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) .
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...
19.8k
views
answered
Dec 27, 2016
Compiler Design
parsing
compiler-design
ll-parser
grammar
+
–
3
votes
6
Test by Bikram | Theory of Computation | Test 1 | Question: 2
The minimal DFA that accepts all strings of a's and b's, and ends with 'aa' has _____ number of states.
The minimal DFA that accepts all strings of a's and b's, and ends with 'aa' has _____ number of states.
524
views
answered
Dec 26, 2016
Theory of Computation
tbb-toc-1
numerical-answers
+
–
15
votes
7
Algorithm || Minimum comparison sorting
The lower bound on the no. of comparisons required to sort n numbers is __________ ?
The lower bound on the no. of comparisons required to sort n numbers is __________ ?
3.6k
views
answered
Dec 23, 2016
Algorithms
algorithms
sorting
+
–
16
votes
8
TIFR CSE 2017 | Part A | Question: 14
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 ... a winning strategy. For both $n=7$ and $n=8$, Bharat has a winning strategy. Bharat never has a winning strategy.
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 e...
2.9k
views
answered
Dec 23, 2016
Analytical Aptitude
tifr2017
analytical-aptitude
logical-reasoning
+
–
8
votes
9
TIFR CSE 2017 | Part A | Question: 3
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 ... $\sqrt {2}t$ $2t$ $\left(\dfrac{h}{t}\right)$ $\left(\dfrac{h}{2t}\right)$
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...
1.2k
views
answered
Dec 21, 2016
Quantitative Aptitude
tifr2017
quantitative-aptitude
speed-time-distance
+
–
11
votes
10
Ace Test Series: Combinatory - Permutations And Combinations
1.0k
views
answered
Dec 14, 2016
Combinatory
ace-test-series
engineering-mathematics
discrete-mathematics
combinatory
+
–
12
votes
11
TIFR CSE 2012 | Part A | Question: 18
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$
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 th...
1.2k
views
answered
Dec 9, 2016
Quantitative Aptitude
tifr2012
quantitative-aptitude
ratio-proportions
+
–
10
votes
12
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
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
4.0k
views
answered
Dec 9, 2016
Programming in C
binary-heap
algorithms
+
–
3
votes
13
TOC- DFA
Number of states in DFA which accepts the binary strings divisible by 4 or 5. answer?
Number of states in DFA which accepts the binary strings divisible by 4 or 5.answer?
5.1k
views
answered
Dec 9, 2016
Theory of Computation
theory-of-computation
minimal-state-automata
+
–
5
votes
14
MadeEasy Test Series: Programming & DS - Hashing
404
views
answered
Dec 5, 2016
DS
made-easy-test-series
data-structures
hashing
+
–
2
votes
15
MadeEasy Test Series: Programming & DS - Programming In C
answer?
answer?
411
views
answered
Dec 1, 2016
CO and Architecture
made-easy-test-series
programming
programming-in-c
+
–
2
votes
16
Programming
412
views
answered
Nov 30, 2016
Programming in C
programming-in-c
+
–
5
votes
17
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
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 m...
1.8k
views
answered
Nov 29, 2016
Probability
probability
engineering-mathematics
+
–
4
votes
18
ME-FST1-Q51
I have a little doubt regarding the Language L.Any one please what L contain?
I have a little doubt regarding the Language L.Any one please what L contain?
1.1k
views
answered
Nov 14, 2016
0
votes
19
TIFR-2014-Maths-A-10
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}+ax-b$ 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$
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}...
452
views
answered
Nov 11, 2016
Set Theory & Algebra
tifrmaths2014
set-theory
+
–
1
votes
20
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
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
884
views
answered
Oct 24, 2016
0
votes
21
vgate
what is ur take on this? @arjun sir please see this
what is ur take on this?@arjun sir please see this
1.4k
views
answered
Oct 24, 2016
16
votes
22
GATE Overflow | Programming | Test 1 | Question: 22
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 = " ... ,'l','o',' ','W','o','r','l','d'};
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] =...
1.8k
views
answered
Oct 24, 2016
Programming in C
go-programming-1
programming
programming-in-c
+
–
2
votes
23
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 =?$
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 $...
563
views
answered
Oct 4, 2016
Calculus
engineering-mathematics
calculus
virtual-gate-test-series
+
–
15
votes
24
Peter Linz Edition 4 Exercise 2.1 Question 6 (Page No. 47)
With $Σ = \{a,b\},$ give a DFA for $L = \{w_1aw_2: |w_1|\geq 3, |w_2|\leq 5\}.$
With $Σ = \{a,b\},$ give a DFA for $L = \{w_1aw_2: |w_1|\geq 3, |w_2|\leq 5\}.$
10.0k
views
answered
Oct 3, 2016
Theory of Computation
theory-of-computation
peter-linz
peter-linz-edition4
finite-automata
+
–
4
votes
25
MADE EASY TEST SERIES
Is L = {a bn an ;n > 0} $\cup${aa bk a2k ;k > 0} a DCFL ???
Is L = {a bn an ;n 0} $\cup${aa bk a2k ;k 0} a DCFL ???
580
views
answered
Oct 3, 2016
0
votes
26
Please help in solving this question a veii big doubt
1.3k
views
answered
Oct 3, 2016
Compiler Design
compiler-design
parsing
operator-precedence
descriptive
test-series
+
–
0
votes
27
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=1-process; Interested[process]=TRUE; While(Interested[other]==TRUE); { ... ; } } Void Leave(int process) { Interested[process]=FALSE; } Find whether progress, mutual exclusion and bounded waiting are satisfied?
Consider the following code:- #define N 2#define FALSE 0#define TRUE 1Int Interested [N]; //initially both are set to FALSE.Void enter(int process){ int other; ...
697
views
answered
Sep 28, 2016
Page:
1
2
3
4
5
6
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register