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 Shashi Shekhar 1
User Shashi Shekhar 1
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Shashi Shekhar 1
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
votes
0
answers
1
Admission query
Hii , can anyone tell me what specialization to choose between CSE and MATHEMATICS AND COMPUTING? which is best keeping in mind the government jobs like ISRO,AAI,BHSPCL ETC.
asked
Feb 28, 2019
in
GATE Application

63
views
0
votes
0
answers
2
Uppcl 2018
what could be the eigen values of a 2*2 Matrix if all its elements are intergers.
asked
Jan 2, 2019
in
Linear Algebra

79
views
0
votes
0
answers
3
General query
Is there internal fragmentation in continuous dynamic partitioning ? After the processes have been allocated the partitions according to their size , there is no internal fragmentation , I agree but what if some processes have completed their execution and left leaving behind the ... which has size smaller than the hole , then will it create a new partion of its size from the hole?
asked
Dec 20, 2018
in
Operating System

21
views
0
votes
0
answers
4
Aai it 2018
Minimum number of 2 input nor gates required for xy+z?
asked
Dec 11, 2018
in
Digital Logic

73
views
–1
vote
2
answers
5
Aai it 2018
asked
Dec 10, 2018
in
Combinatory

140
views
0
votes
2
answers
6
Aai it 2018
asked
Dec 10, 2018
in
Theory of Computation

94
views
0
votes
0
answers
7
Aai 2018 it
asked
Dec 10, 2018
in
Graph Theory

94
views
+1
vote
1
answer
8
Aai it 2018
Which of the following data structure is most suitable for radix sort? 1 .tree 2 . Linked list 3 . Stack 4 . Binary search tree
asked
Dec 10, 2018
in
Programming

131
views
+1
vote
1
answer
9
Aai it 2018
secondary indexing can not be defined on key attribute values? True or false.
asked
Dec 10, 2018
in
Databases

60
views
0
votes
1
answer
10
Self doubt
minimum mod bimary up counter which counts {0,1,8,64}
asked
Sep 1, 2018
in
Digital Logic

76
views
0
votes
2
answers
11
Self doubt, Automata theory
Suppose ∑* over {a,b,c} , whether it is regular or not ? If yes then will it contain this language or not { an . bn . cn  n > 0 } ? If yes then how is sigma* regular ? I am in great confusion plz help.
asked
Aug 30, 2018
in
Theory of Computation

44
views
regularlanguages
0
votes
0
answers
12
Gate 04 , DBMS ,FILE STRUCTURE,B TREES
https://gateoverflow.in/?qa=blob&qa_blobid=2550937292644146307 Plz explain, if we are asked to put each b tree node to fit in one block then why don't we consider it a leaf node , why do we need to consider block pointers .
asked
Aug 13, 2018
in
Databases

33
views
0
votes
0
answers
13
Algorithm
https://gateoverflow.in/?qa=blob&qa_blobid=14025624239320406621
asked
Aug 4, 2018
in
Algorithms

22
views
0
votes
2
answers
14
Algorithms doubt
F(n)=n^(sin n) G(n)=n^(cos n) Why they are non comparable.
asked
Aug 2, 2018
in
Algorithms

36
views
+2
votes
3
answers
15
operating system
Consider the processes P1, P2, P3, P4 whose arrival times are 0, 1, 2, 3 and Burst times are 5, 2, 13, 7. If the Context Switching time is 1 unit (ms), what is the average waiting time if Shortest Job Next scheduling algorithm is used? (a) 7.5 (b) 6.25 (c) 6.5 (d) None
asked
Sep 5, 2017
in
Operating System

224
views
operatingsystem
processschedule
0
votes
0
answers
16
regular expressions
5. Consider r = (11 + 111)* over Ʃ = {0, 1}. Number of states in minimal NFA and DFA respectively: (a) N – 3, D – 4 (b) N – 3, D – 3 (c) N – 3, D – 3 (d) N – 4, D – 4
asked
Sep 3, 2017
in
Theory of Computation

190
views
theoryofcomputation
regularexpressions
finiteautomata
regularlanguages
#theoryofcomputation
0
votes
1
answer
17
regular expression
What type of grammar is this most accurately described as? S>b/ aD D>a/ aDD A. A regular grammar B. CFG C. CSG D. Type0
asked
Sep 2, 2017
in
Theory of Computation

144
views
theoryofcomputation
finiteautomata
regularlanguages
regularexpressions
0
votes
1
answer
18
regular expression
What are the number of final states in minimal DFA, where ∑= {a, b}, if every string starts with “aa” and length of string is not congruent to 0 (mod 4). A. 7 B. 6 C. 3 D. 5
asked
Sep 2, 2017
in
Theory of Computation

233
views
regularexpressions
theoryofcomputation
finiteautomata
regularlanguages
0
votes
2
answers
19
regular expressions
How many DFA with four states can be constructed over the alphabet ∑= {a, b} with designated initial state? A. 416 * 24 B. 220 C. 216 D. 224
asked
Sep 2, 2017
in
Theory of Computation

189
views
theoryofcomputation
finiteautomata
minimalstateautomata
regularexpressions
+2
votes
1
answer
20
regular expressions
Consider a DFA with 1000000000000000000000000000 states, over the input alphabet consisting of all Greek alphabet letters. What can we say about it? a.It is not possible that it accepts the empty set. b.It is not possible that it accepts only empty string ... possible that it accepts strings of length 1 only. d.It is possible that it accepts all strings over the input alphabet.
asked
Sep 1, 2017
in
Theory of Computation

139
views
theoryofcomputation
regularexpressions
regularlanguages
finiteautomata
#theoryofcomputation
+2
votes
3
answers
21
TOPIC : REGULAR EXPRESSIONS,
1.One of the following Regular Expressions is not the same as others. Which one? A. (a* + b*a*)* B. (a*b* + b*a*)* (a*b*)* C. ((ab)* + a*)* D. (a + b)* a*b*a*b*
asked
Sep 1, 2017
in
Theory of Computation

275
views
regularexpressions
theoryofcomputation
finiteautomata
#theoryofcomputation
regularlanguages
50,737
questions
57,324
answers
198,408
comments
105,174
users