The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
Google Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions.
Answers by Deepthi_ts
User Deepthi_ts
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Deepthi_ts
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
votes
1
#test_series
Consider a scenario where 3 processes P1, P2 and P3 are sharing X resources of the same type. The maximum need of the three processes is 4, 8, 6. It is also known that the maximum combined need of both processes P1 and P2 at a time is 9 and they always execute only in a combined manner. Then the value of X+ 7 is ________.
answered
Jan 12
in
Operating System

50
views
0
votes
2
Higher Engg. Mathematics by B.S. Grewal probability & statistics
answered
Jan 12
in
Probability

75
views
probability
+1
vote
3
#DS #Graphs
Tell me 1. Possible number of BINARY TREES with n vertices ? 2. Possible number of BINARY SEARCH TREES with n vertices ? 3. Possible number of TREES with n vertices ? 4. Possible number of LABELED Trees with n vertices? 5. Possible number of UNLABELED Trees with n vertices? Also, When Cayley's Formula is applied and when Catalan Number is applied ?
answered
Oct 12, 2017
in
DS

56
views
0
votes
4
output
main() { int a=2; if(a==2) { a=~a+2<<1; printf("%d",a); } else { break; } a)3 b)2 c)1 d)compile error
answered
Oct 12, 2017
in
Programming

35
views
+1
vote
5
co_williams
What would be the bias value for a. A base2 exponent in a 6bit field? b. A base8 exponent in a 7bit field?
answered
Oct 12, 2017
in
CO & Architecture

54
views
0
votes
6
Time complexity
Given a 2D array X[m][n] which has m rows and n columns. The array X is row wise and column wise sorted (i.e) each individula row and column is sorted. What is the complexity to search an element in this array a)O(m*n) b)O(m2) or O(n2) c)O(log2(m*n)) d)O(m+n)
answered
Oct 12, 2017
in
Algorithms

78
views
0
votes
7
Associative
A fully associative cache memory unit with a capacity of 64KB is built using a block size of 32 words.The size of the physical address is 30 bits. The size of the tag comparator (in bits) is ____________
answered
Oct 12, 2017
in
CO & Architecture

83
views
+1
vote
8
upload snaps
Someone please help me in guiding how to upload snap of questions by phone.
answered
Oct 12, 2017
in
Others

40
views
+1
vote
9
UGCNETJan2017III42
What can you say about the following statements ? I. XML tags are caseinsensitive. II. In JavaScript, identifier names are casesensitive. III. Cascading Style Sheets (CSS) cannot be used with XML. IV. All wellformed XML documents must contain a document ... ) only III and IV are false. (3) only I and III are false. (4) only II and IV are false.
answered
Oct 12, 2017
in
Web Technologies

74
views
0
votes
10
UGCNETJan2017III32
Any decision tree that sorts n elements has height ________. (1) Ω(lg n) (2) Ω(n) (3) Ω(n lg n) (4) Ω(n2)
answered
Oct 11, 2017
in
Algorithms

91
views
0
votes
11
UGCNETJan2017III33
Redblack trees are one of many search tree schemes that are “balanced” in order to guarantee that basic dynamicset operations take ________ time in the worst case. (1) O(1) (2) O(lg n) (3) O(n) (4) O(n lg n)
answered
Oct 11, 2017
in
Algorithms

59
views
0
votes
12
UGCNETDEC2016III34
The minimum number of scalar multiplication required, for parenthesization of a matrixchain product whose sequence of dimensions for four matrices is <5, 10, 3, 12, 5> is 630 580 480 405
answered
Oct 11, 2017
in
Others

1.2k
views
ugcnetdec2016iii
0
votes
13
UGCNETJan2017III34
The minimum number of scalar multiplication required, for parenthesization of a matrixchain product whose sequence of dimensions for four matrices is is (1) 630 (2) 580 (3) 480 (4) 405
answered
Oct 11, 2017
in
Algorithms

76
views
+1
vote
14
synchronization
. A unixstyle Inode has 10 direct pointers and one single, one double and one triple indirect pointers. Disk block size is 1 Kbyte, disk block address is 32 bits, and 48bit integers are used. What is the maximum possible file size?} \\\ (A) $2^{24}$ bytes (B)$ 2^{32}$ bytes (C)$2^{34}$ bytes (D)$2^{48}$ bytes
answered
Oct 11, 2017
in
Databases

41
views
+4
votes
15
aptitudee
A) Statements No proud is animal Some sheeps are animals All cats are sheeps Conclusions 1.No cat is proud 2.Some cats are animals 3.No animal is cat 4.Some prouds are sheep OPTIONS 1.Only 3 folllows 2.Either 2 or 3 follows 3.only 1 follows 4.only 3 and 4 follows
answered
Oct 11, 2017
in
Numerical Ability

149
views
+4
votes
16
helpless mind
What is the difference between Base addressing and Index addressing? And finally how does based indexed addressing works?
answered
Oct 11, 2017
in
CO & Architecture

88
views
coandarchitecture
addressingmodes
+5
votes
17
# gate cse 1998 2 marks
Plz explain the answer of ques no. 4 a) 2NF b) 3NF
answered
Apr 26, 2017
in
Databases

111
views
databases
databasenormalization
+2
votes
18
UGCNETJune2015III68
Consider the following transportation problem: The initial basic feasible solution of the above transportation problem using Vogel's Approximation method (VAM) is given below: The solution of the above problem: is degenerate solution is optimum solution needs to improve is infeasible solution
answered
Apr 21, 2017
in
Others

878
views
ugcnetjune2015iii
transportationproblem
operationresearch
+1
vote
19
Peter Linz chapter 2 exercise
How to solve this type of questions ? Every substring of four symbols has at most two 0's. For example, 001110 and 011001 are in the language, but 10010 is not since one of its substrings, 0010, contains three zeros. over the alphabet 0 and 1.
answered
Apr 12, 2017
in
Theory of Computation

507
views
theoryofcomputation
finiteautomata
dfa
+3
votes
20
Peter line 2.1
Construct the DFA for all string with at least one a and exactly two b
answered
Apr 12, 2017
in
Theory of Computation

55
views
0
votes
21
theory of computation
Let sigma = { 0,1 } . Construct a minimal DFA which accepts set of all strings in which "Every substring of four symbols has at most two 0’s". For example, 001110 and 011001 are in the language, but 10010 is not since one of its substrings, 0010, contains three zeros.
answered
Apr 12, 2017
in
Theory of Computation

92
views
theoryofcomputation
finiteautomata
0
votes
22
theory of computation
Is the language given below regular or not ? I feel it is regular. The equivalent language is, L = {anblak ; n>=1,l>=1,k>=1 }  { a1b1a1 , a1b1a2 , a1b1a3 , a1b2a1 , a1b2a2 , a1b3a1 and few more strings (but ... is regular ... QUESTION TAKEN FROM PETER LINZ TEXTBOOK AND ANSWER WAS NOT GIVEN. So please verify whether i am correct ...???
answered
Apr 12, 2017
in
Theory of Computation

80
views
theoryofcomputation
finiteautomata
0
votes
23
Union of Two Language
WHat is the union of the following wo languages L=0*1+0+1* ∪ 10*1 L=001 U 0*1*
answered
Apr 11, 2017
in
Theory of Computation

67
views
theoryofcomputation
0
votes
24
Introduction to theory of computing by "Michael sipser" 3rd edition page no:37
answered
Apr 11, 2017
in
Theory of Computation

214
views
dfa
+1
vote
25
Peter Linz Exercise 4.3
answered
Apr 11, 2017
in
Theory of Computation

37
views
theoryofcomputation
regularlanguages
0
votes
26
Automata Theory by HMU
Is L(G) finite, for a given CFG G. Is decidable or undecidable?
answered
Apr 11, 2017
in
Theory of Computation

40
views
0
votes
27
introduction to computer theory second edition by daniel chapter 5 question 14 (ii)
answered
Apr 11, 2017
in
Theory of Computation

134
views
dfa
+2
votes
28
theory of computation
The language generated by the below grammar is S > aSS / b
answered
Apr 11, 2017
in
Theory of Computation

147
views
theoryofcomputation
finiteautomata
0
votes
29
theory of computation
answered
Apr 11, 2017
in
Theory of Computation

49
views
theoryofcomputation
finiteautomata
0
votes
30
sub: Theory Of Computation Topic: regular exp. to DFA
answered
Apr 11, 2017
in
Theory of Computation

120
views
regularexpressions
finiteautomata
#theoryofcomputation
0
votes
31
GATE CSE 2018
can anybody help me out as what to read in aptitude section or what not to read for GATE CSE 2018. as i know probability,permutation & combination is very important topic to read. but i don't know from where to read. i am very bad ... part is it ok for gate or not. please give me full detail about which topic/chapter read for aptitude CSE GATE 2018.
answered
Apr 11, 2017
in
Numerical Ability

271
views
+1
vote
32
putchar (*(wer[1]+1)); a)prints e B) prints a C)prints 1 D)prints b
answered
Apr 10, 2017
in
Programming

110
views
badquestion
0
votes
33
C Programming(interview)
Write an algorithm of the given problem Given a chess board of order NxM and source points (s1,s2) and destination points (d1,d2), Your task to find min number of moves required by the Knight to go to the destination cell.
answered
Apr 10, 2017
in
Programming

198
views
programminginc
0
votes
34
ullman (toc)
design cfg for (i) {aibjcki=j+k} (ii){aibji<=2j}
answered
Apr 10, 2017
in
Theory of Computation

75
views
theoryofcomputation
cfg
0
votes
35
what happens in Internetworking somebody please tell this doubt
answered
Apr 9, 2017
in
Computer Networks

29
views
computernetworks
0
votes
36
Peter Linz 5.1
I need two proves, i am stuckhere 1.Show that every Sgrammar is Unambiguous 2.Show that a RegEx can never be Inherently Ambiguous so what to use here? Induction/Contradiction
answered
Apr 8, 2017
in
Theory of Computation

347
views
theoryofcomputation
contextfreelanguage
regularexpressions
regularlanguages
grammar
+3
votes
37
#Doubt ClassFull Addressing
When we already have classFull Addressing Scheme in which we divided the IP addresses into Class A , Classs B , Class C , Class D and Class E then what was limitation in this that we need to introduce ClassLess ... Can anyone tell please what happens in ClassLess IP addressing scheme and what was drawback that classless came from classfull.
answered
Apr 8, 2017
in
Computer Networks

187
views
computernetworks
ipaddress
+3
votes
38
# Token Bucket and Leaky Bucket Confusion
answered
Apr 8, 2017
in
Computer Networks

661
views
computernetworks
leakybucket
tokenbucket
congestioncontrol
+1
vote
39
B+ tree deletion
In this by deleting 298 last node is not staifying half filled property so 65 is adjusted in that last node By this now tree becomes as [45] [529] [515965] [134] [59] [293743] [454749] [515357] [5961] [65165] every node is ok then why 29 is made as root Don't whether my doubt is correct can anybody say please
answered
Apr 8, 2017
in
Databases

93
views
0
votes
40
graph theory
A graph consists of only one vertex,which is isolated ..Is that graph A) a complete graph ??? B) a clique??? C) connected graph ??? Please explain your answer ...
answered
Apr 7, 2017
in
Graph Theory

246
views
graphtheory
discretemathematics
graphconnectivity
engineeringmathematics
Page:
1
2
next »
33,718
questions
40,263
answers
114,378
comments
38,900
users