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
Questions by suneetha
User suneetha
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User suneetha
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
votes
0
answers
1
gate 2019
in gate 2019 my marks are 29.67 and my gate score is 352 in general category please give some information about is there any chance of getting m.tech admission in nit’s or iiit’s and please give me the list of universitie’s of information where can i get m.tech admission
asked
Apr 5, 2019
in
NITs

62
views
gate2019
0
votes
0
answers
2
textbook
please gie the answer
asked
Feb 6, 2019
in
Algorithms

95
views
0
votes
1
answer
3
textbook
T(n)=T(7n/8)+0.05 solve this equation and find out the time complexity?
asked
Feb 5, 2019
in
Algorithms

87
views
0
votes
0
answers
4
text book
please construct a pda for the language l={w belongs to {0,1,2}* the number of 0’s is exactly 3 times the number of 1’s}
asked
Jan 23, 2019
in
Theory of Computation

23
views
0
votes
0
answers
5
textbook
give a pda over the alphabet (a,b) which accepts set of all odd length palindrome which start with ‘a’?
asked
Jan 23, 2019
in
Theory of Computation

11
views
0
votes
0
answers
6
textbook
draw an entity diagram for the given queston
asked
Jan 14, 2019
in
Databases

12
views
0
votes
0
answers
7
textbook
consider a 12 bit physical address and a directmapped cache with 64 blocks and each block has a size of 16 bytes. To which block number does the byte address 1200 map?
asked
Jan 14, 2019
in
CO and Architecture

85
views
0
votes
0
answers
8
MadeEasy Test Series 2019: Digital Logic  Hamming Code
plz tell the answer
asked
Jan 12, 2019
in
Digital Logic

93
views
digitallogic
hammingcode
madeeasytestseries2019
madeeasytestseries
0
votes
0
answers
9
MadeEasy Test Series: Computer Networks  Subnetting
asked
Jan 11, 2019
in
Computer Networks

66
views
madeeasytestseries
computernetworks
subnetting
0
votes
0
answers
10
MadeEasy Test Series: Programming & DS  Programming In C
#include<stdio.h> int main() { code(4); return 0; } int code(int m) { if(m>0){ int i=1; for(;i<3;i++){ code(mi); code(mi1); printf("MadeEasy"); } } return 0; } the number of times made easy will be printed? plz explain in detail
asked
Jan 5, 2019
in
Programming

56
views
madeeasytestseries
programminginc
0
votes
1
answer
11
made easy
for 2 relations R(A,B) with functional dependency F={A>B} and S(B,C) witht functional dependency S={B>C} natural join of R and S is in BCNF
asked
Dec 30, 2018
in
Databases

32
views
databases
+1
vote
1
answer
12
engineering maths
Let $A=\begin{bmatrix} 2\\4 \\7 \end{bmatrix}.\begin{bmatrix} 1 &9 &5 \end{bmatrix}$ and $x,y$ and $z$ be the eigenvalue of $A$, then the value of $xyz$ is equal to?
asked
Dec 25, 2018
in
Linear Algebra

74
views
engineeringmathematics
0
votes
1
answer
13
regular expression
the regular expression for the given finite automata plz provide ans step by step
asked
Dec 24, 2018
in
Theory of Computation

65
views
regularexpressions
0
votes
1
answer
14
MadeEasy Test Series: Theory Of Computation  Recursive And Recursive Enumerable Languages
asked
Dec 24, 2018
in
Theory of Computation

154
views
madeeasytestseries
theoryofcomputation
recursiveandrecursivelyenumerablelanguages
0
votes
1
answer
15
MadeEasy Test Series: Theory Of Computation  Regular Expressions
self doubt the minimal dfa for the given regular expression over the alphabet {0,1} is 1*(0+10)*1*?
asked
Dec 23, 2018
in
Theory of Computation

82
views
madeeasytestseries
theoryofcomputation
regularexpressions
0
votes
0
answers
16
MadeEasy Subject Test 2018: Theory Of Computation  Regular Grammar
asked
Dec 23, 2018
in
Theory of Computation

74
views
0
votes
0
answers
17
MadeEasy Subject Test 2019: Theory Of Computation  Finite Automata
what is the answer
asked
Dec 22, 2018
in
Theory of Computation

69
views
madeeasytestseries
theoryofcomputation
finiteautomata
0
votes
2
answers
18
MadeEasy Test Series: Theory Of Computation  Grammar
i thought that it is the language where both start and end symbols are same and i got 65 but the ans is 29
asked
Dec 22, 2018
in
Theory of Computation

82
views
madeeasytestseries
theoryofcomputation
grammar
0
votes
1
answer
19
MadeEasy Test Series: Theory Of Computation  Grammar
what is the answer
asked
Dec 22, 2018
in
Theory of Computation

63
views
madeeasytestseries
theoryofcomputation
grammar
0
votes
1
answer
20
MadeEasy Test Series: Theory Of Computation  Grammar
G1: S→ aSa bSbe G2:S→ aaSbbS e the shortest length strings which does not belongs to L(g1) but belongs to L(G2) is
asked
Dec 22, 2018
in
Theory of Computation

99
views
madeeasytestseries
theoryofcomputation
grammar
0
votes
1
answer
21
MadeEasy Subject Test 2019: Theory Of Computation  Regular Expressions
the length of the shortest string which is not present in the regular expression 1*(0+10)*1* is?
asked
Dec 22, 2018
in
Theory of Computation

90
views
madeeasytestseries
theoryofcomputation
regularexpressions
0
votes
0
answers
22
MadeEasy Test Series: Operating System  Memory Management
consider a 900KB memory is managed using variable partitions but no compaction it currently has 3 processes occupied partition sizes 212KB 114KB and 100KB respectively which of the following smallest request wil be denied a)475 b)285 c)355 d)none of the above
asked
Dec 17, 2018
in
Operating System

142
views
madeeasytestseries
operatingsystem
memorymanagement
+2
votes
1
answer
23
MadeEasy Subject Test 2019: Computer Networks  Flow Control Methods
consider a network connecting two nodes A and B having a propagation delay of 6*10^4 micro sec.bandwidth of network is 150 Mbps if each frame size is 5000 bytes and both uses go back n sliding window protocal, where maximum 100 frames can be sent at a time then the maximum possible data rate is  [ mbps]
asked
Dec 9, 2018
in
Computer Networks

234
views
madeeasytestseries
computernetworks
flowcontrolmethods
slidingwindow
0
votes
1
answer
24
MadeEasy Test Series: Digital Logic  Flip Flop
asked
Dec 5, 2018
in
Digital Logic

120
views
madeeasytestseries
digitallogic
flipflop
0
votes
0
answers
25
functions
f(x)=ln x +x g(x)=x^2 sin(x) h(x)=x^3x which of them are represents the manytoone function?
asked
Nov 23, 2018
in
Mathematical Logic

29
views
discretemathematics
0
votes
0
answers
26
graphs
consider a complete garph on 2^(log(2^10)) vertices then the minimum number of edge removal operations needed to make graph disconnected
asked
Nov 23, 2018
in
Mathematical Logic

36
views
discretemathematics
0
votes
0
answers
27
prev year question
the eigen values of the following matrix 1 3 5 3 1 6 0 0 3
asked
Nov 20, 2018
in
Mathematical Logic

40
views
matrixeigenvector
0
votes
0
answers
28
merge sort
given n elements merge them into one sorted list using merge procedure then what is the time complexity for this ? explain with example
asked
Nov 3, 2018
in
Algorithms

61
views
mergesort
0
votes
0
answers
29
merge sort
what is the time complexity of merge sort for already sorted array explain with example?
asked
Nov 3, 2018
in
Algorithms

42
views
mergesort
0
votes
1
answer
30
trees
formula for which maximum number of nodes will be present in complete narray tree?
asked
Nov 2, 2018
in
DS

39
views
datastructures
Page:
1
2
next »
50,741
questions
57,244
answers
198,016
comments
104,610
users