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 Kaluti
User Kaluti
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Kaluti
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
votes
1
Made Easy Test Series:DS
I want longest path from root to leaf. Then which code is correct among Code1 or Code2? Code1) int tree(Struct node *root){ int a=0, b=0,c=0; if(root==NULL) return 0; if((root>left==NULL)&&(root>right==NULL)) return 1; a=1+tree(root ... )&&(root>right==NULL)) return 1; a=tree(root>left); b=tree(root>right); c=1+max(a,b); return c; }
answered
May 22, 2019
in
DS

76
views
madeeasytestseries
datastructures
0
votes
2
Made Easy Test Series: ProgrammingRecursive and Iterative Program
$I=$Iterative Program $R=$ Recursive Program $(A)$ For every program belonging to class $I$, there is an equivalent program to class $R.$ $(B)$ Every program in $R$ uses strictly more stack space compared to equivalent program in $I.$ Among $(A)$ and $(B)$ which one is correct?
answered
May 22, 2019
in
Programming

27
views
madeeasytestseries
datastructures
0
votes
3
Made Easy Test Series:Binary Tree
Consider the following function with a binary tree with atleast one node: int path(struct node *x, int len){ if(x==NULL) return B; else return A; } Assume the above function is used to check the given binary tree has any path with specified length from root to ... $B$ is $(len== 1)$ which of these two option correct? Please Explain.
answered
May 22, 2019
in
DS

116
views
madeeasytestseries
datastructures
+1
vote
4
oops doubt
A default catch block catches, [A]. all thrown objects [B]. no thrown objects [C]. any thrown object that has not been caught by an earlier catch block [D]. all thrown objects that have been caught by an earlier catch block
answered
May 21, 2019
in
Programming

57
views
oops
class
trycatch
nongate
0
votes
5
Number of cache misses
answered
Sep 23, 2018
in
CO and Architecture

235
views
coandarchitecture
misses
0
votes
6
Linked List
What kind of linked list is best to answer question like “What is the item at position n?” a) Singly linked list b) Doubly linked list c) Circular linked list d) Array implementation of linked list
answered
Aug 21, 2018
in
Programming

186
views
linkedlists
datastructures
algorithms
0
votes
7
Time Complexity
What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list? a) O(1) b) O(n) c) θ(n) d) θ(1)
answered
Aug 20, 2018
in
Programming

41
views
asymptoticnotations
datastructures
0
votes
8
Heapsort Comparisons
How many element comparisons would heap sort use to sort the integers $1$ to $8$ if they were initially in sorted order, initially in reverse sorted order?
answered
Jun 17, 2018
in
DS

305
views
datastructures
heapsort
+2
votes
9
Madeeasy workbook
Let $A$ be a $3\times 3$ matrix such that $\mid AI \mid=0$.If trace of $A=13$ and $det A = 32$ then sum of squares of the eigen values of $A$ is ..... $82$ $13$ $169$ $81$
answered
Mar 30, 2018
in
Linear Algebra

772
views
matrices
eigenvalue
+2
votes
10
ISI2017MMA29
Suppose the rank of the matrix $\begin{pmatrix}1&1&2&2\\1&1&1&3\\a&b&b&1\end{pmatrix}$ is $2$ for some real numbers $a$ and $b$. Then $b$ equals $1$ $3$ $1/2$ $1/3$
answered
Mar 30, 2018
in
Linear Algebra

536
views
isi2017mma
engineeringmathematics
linearalgebra
rankofmatrix
+1
vote
11
Gate probability
A party of n persons take their seats at random at a round table,then the probability that two specified person do not sit together is $\left(\dfrac{2}{n1}\right)$ $\left(\dfrac{n3}{n1}\right)$ $\left(\dfrac{n2}{n1}\right)$ $\left(\dfrac{1}{n1}\right)$
answered
Mar 30, 2018
in
Probability

123
views
probability
+1
vote
12
MadeEasy Workbook: Engineering Mathematics  Eigen value
Let $A$ be a $3\times 3$ matrix with Eigen values $1,1,0$.Then $\mid A^{100}+I\mid$ is...
answered
Mar 29, 2018
in
Linear Algebra

324
views
engineeringmathematics
linearalgebra
eigenvalue
0
votes
13
Rosen (Graph)
Show that an edge in a simple graph is a cut edge if and only if this edge is not a part of any simple circuit in the graph.
answered
Mar 18, 2018
in
Graph Theory

72
views
discretemathematics
graphtheory
0
votes
14
ISI201411
Let $X_1,X_2,X_3,X_4$ be i.i.d. random variables each assuming the value $1$ and $1$ with probability $\dfrac{1}{2}$ each. Then, the probability that the matrix $\begin{pmatrix}X_1 &X_2\\ X_3 &X_4\end{pmatrix}$ is nonsingular equals $1/2$ $3/8$ $5/8$ $1/4$
answered
Mar 17, 2018
in
Probability

217
views
isi2014
probability
randomvariable
0
votes
15
Sheldon Ross Example 3.7f
A plane is missing and it is presumed that it was equally likely to have gone down in any of three possible regions. Let 1 − αi denote the probability the plane will be found upon a search of the ith region when the plane is, in fact, in that ... conditional probability that the plane is in the ith region, given that a search of region 1 is unsuccessful, i = 1, 2, 3?
answered
Mar 17, 2018
in
Probability

116
views
probability
discretemathematics
sheldonross
0
votes
16
GraphTheory_Problem_testpaper
Consider the undirected graph $G$ defined as follows. The vertices of $G$ are bits of strings of length $n$. We have an edge between vertex $u$ and $v$ if and only if $u$ and $v$ differ exactly in one bit position. The ratio of chromatic number of $G$ to the diameter of $G$ is . $\dfrac{1}{(2^{n1})}$ $\dfrac{1}{n}$ $\dfrac{2}{n}$ $\dfrac{3}{n}$
answered
Mar 17, 2018
in
Graph Theory

93
views
graphtheory
graphcoloring
0
votes
17
self doubt
Every student in this class has studied calculus If S(x) represents the statement that person x is in this class, C(x) which is the statement x has studied calculus. we see that our statement can beexpressed as ∀x(S(x) → C(x) ) Some student in this class has visited Mexico M ... ∃x(S(x) ∧ M(x)) In 1st example Implication is taken Why in 2nd Example and is taken why not S(x) >M(x)
answered
Mar 4, 2018
in
Mathematical Logic

101
views
+2
votes
18
sparse/dense indexing
which statement is true? 1)for any data file it is possible to construct two separate sparse first level index on different keys. 2)for any data file it is possible to construct two separate dense first level index on different keys. 3)for any data file it is possible to construct a sparse first level index and a dense second level indexboth should be useful 4) none.
answered
Jan 13, 2018
in
Databases

591
views
databases
indexing
+1
vote
19
Transaction
How many concurrent schedules are conflict serializable of given transactions T1 and T2: T1 = r1(A) W1(A)R1(B)W1(B) T2 = R2(B)W2(B)R2(A)W2(A)
answered
Jan 13, 2018
in
Databases

161
views
transactions
databases
0
votes
20
Identify the language
$L = \{ wcww^r \ w,c\ \epsilon\ ( a + b\ )^* \}$ Identify the language.
answered
Dec 12, 2017
in
Theory of Computation

101
views
theoryofcomputation
identifyclasslanguage
0
votes
21
finite automata
If all state of DFA is final then it accpets $\sum$ (i.e) regular true or false
answered
Oct 16, 2017
in
Theory of Computation

150
views
0
votes
22
NYQUIST THEOREM
What should be the minimum & maximum sampling rate for NYQUIST THEOREM?
answered
Oct 16, 2017
in
Computer Networks

312
views
0
votes
23
turing machine  self
Turing machine can be constructed by FA with 2 stacks??
answered
Oct 16, 2017
in
Theory of Computation

95
views
0
votes
24
TOC regular languages
Let the homomorphism defined over alphabet Σ{0, 1} is h(0) = aa and h(1) = aba, and L = (ab + ba)*a then what is h1(L)?
answered
Oct 4, 2017
in
Theory of Computation

110
views
theoryofcomputation
+1
vote
25
self doubt
there is a proof for equivalence of empty stack and final state but what about the prefix property cases empty stack cant accept regular languages which donot accept the prefix property isnt it less powerful than the acceptance by final state ?? what kind of equivalence they have ??
answered
Oct 4, 2017
in
Theory of Computation

126
views
theoryofcomputation
empty
stack
final
state
+1
vote
26
BCD Adder
A decimal parallel adder that add n decimal digits needs how many BCD adder stages 1. n 2. 2n 3. 1 4 n^2
answered
Oct 4, 2017
in
Digital Logic

791
views
0
votes
27
practics paper
for fintie autometa of n state the max lenght of string that must be consider to distinguish two state is 1. n 2. n1 3 n2 4.none
answered
Oct 2, 2017
in
Theory of Computation

37
views
0
votes
28
TEST SERIES
This question I have many doubts like (1) what are those final states (2) what is the meaning of phyi here (3) from state q0 n q1 when EPSILON input is given what is its meaning (4) plz someone draw the PDA diag. (5) Plz give the language also (6) And lastly what the answar
answered
Oct 1, 2017
in
Theory of Computation

144
views
0
votes
29
Friendfunction
The friend functions are used in situations where: (A) We want to have access to unrelated classes (B) Dynamic binding is required (C) Exchange of data between classes to take place (D) None of the above
answered
Oct 1, 2017
in
Programming

302
views
0
votes
30
UGCNETdec2008ii15
If 4 input multiplexers drive a 4 input multiplexer, we get a: (A) 16 input MUX (B) 8 input MUX (C) 4 input MUX (D) 2 input MUX
answered
Sep 26, 2017
in
Digital Logic

557
views
ugcnetdec2008ii
digitallogic
multiplexer
0
votes
31
probability
A and B play game in whic they toss coin 3 times.The one obtaining heads first wins the game.If A tosses coin first and if total value of stake is Rs 20.How much should be contributed by B in order that game is fair?
answered
Sep 13, 2017
in
Probability

370
views
0
votes
32
Peter Linz Edition 4 Exercise 2.1 Question 24 (Page No. 49)
Let us define an operation $truncate$, which removes the rightmost symbol from any string. For example, $truncate (aaaba)$ is $aaab$. The operation can be extended to languages by $truncate (L)= $ {$truncate(w):w ∈ L$} Show how, ... From this, prove that if $L$ is a regular language not containing $λ$, then $truncate (L)$ is also regular.
answered
Sep 9, 2017
in
Theory of Computation

479
views
peterlinz
theoryofcomputation
finiteautomata
0
votes
33
probability dice
1.Probability of getting total of atleast once in three tosses of pair of fair dice is a)125/136 b)91/216 c)117/216 d)99/216 2.How many dice must be thrown so that there is better than even chances of getting 6 a)4 b)5 c)6 d)7
answered
Sep 6, 2017
in
Probability

492
views
0
votes
34
probability dice
1.Probability of getting total of atleast once in three tosses of pair of fair dice is a)125/136 b)91/216 c)117/216 d)99/216 2.How many dice must be thrown so that there is better than even chances of getting 6 a)4 b)5 c)6 d)7
answered
Sep 6, 2017
in
Probability

492
views
0
votes
35
counting
How many 5 digit number are possible so that in each of these number every digit is greater than digit on its right?
answered
Sep 5, 2017
in
Combinatory

107
views
0
votes
36
CMI2011B04a
Let $\subseteq \{0,1\}^*$ Suppose $L$ is regular and there is a nondeterministic automaton $N$ which recognizes $L$. Define the reverse of the language $L$ to be the language $L^R = \{w \in \{0, 1\}  \text{ reverse}(w) \in L \}$ ... reverse. For example $reverse(0001) = 1000$. Show that $L^R$ is regular, How can you use $N$ to construct an automata to recognize $L^R$.
answered
Aug 27, 2017
in
Theory of Computation

84
views
cmi2011
descriptive
theoryofcomputation
regularlanguages
finiteautomata
0
votes
37
group theory
"the union of two subgroups neednot be a subgroup".can somebody prove without using counter example ...
answered
Aug 24, 2017
in
Set Theory & Algebra

199
views
discretemathematics
grouptheory
settheory&algebra
engineeringmathematics
sets
0
votes
38
DCFL,CFL,NonDCFL,Non CFl
how to we identify them... if a lang is not cfl then it is DCFL?? what is differenc between all of them
answered
Aug 12, 2017
in
Theory of Computation

256
views
Page:
1
2
3
next »
50,741
questions
57,235
answers
197,995
comments
104,580
users