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 smsubham
User smsubham
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User smsubham
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
votes
1
ISRO202038
Which of the following is true? Every subset of a regular set is regular Every finite subset of nonregular set is regular The union of two non regular set is not regular Infinite union of finite set is regular
answered
3 days
ago
in
Theory of Computation

91
views
isro2020
theoryofcomputation
regularlanguages
easy
0
votes
2
Countable and recursive language relation
Is every countable language recursive enumerable?
answered
Dec 28, 2019
in
Theory of Computation

78
views
theoryofcomputation
recursiveandrecursivelyenumerablelanguages
countableuncountableset
0
votes
3
ISI2016MMA13
Which one of the following statements is correct regarding the elements and subsets of the set $\{1, 2, \{1, 2, 3\}\}$? $\{1, 2\} \in \{1, 2, \{1, 2, 3\} \}$ $\{1, 2\} \subseteq \{1, 2, \{1, 2, 3\} \}$ $\{1, 2, 3\} \subseteq \{1, 2, \{1, 2, 3\} \}$ $3 \in \{1, 2, \{1, 2, 3\} \}$
answered
Dec 26, 2019
in
Set Theory & Algebra

23
views
isi2016mmamma
sets
subsets
0
votes
4
Michael Sipser Edition 3 Exercise 0 Question 5 (Page No. 26)
If C is a set with c elements, how many elements are in the power set of C? Explain your answer.
answered
Dec 26, 2019
in
Theory of Computation

40
views
michaelsipser
theoryofcomputation
sets
easy
0
votes
5
GATE199711
Consider the grammar $S \rightarrow bSe$ $S \rightarrow PQR$ $P \rightarrow bPc$ $P \rightarrow \varepsilon$ $Q \rightarrow cQd$ $Q \rightarrow \varepsilon$ $R \rightarrow dRe$ $R \rightarrow \varepsilon$ where $S, P, Q, R$ are nonterminal symbols with $S$ being the ... $i, j, k, m$? Find the smallest string that has two parse trees.
answered
Dec 25, 2019
in
Compiler Design

1.2k
views
gate1997
compilerdesign
grammar
normal
theoryofcomputation
0
votes
6
GATE19959
Translate the arithmetic expression $a^*(b+c)$ into syntax tree. A grammar is said to have cycles if it is the case that $A \Rightarrow^+ A$ Show that no grammar that has cycles can be LL(1).
answered
Dec 25, 2019
in
Compiler Design

1.6k
views
gate1995
compilerdesign
grammar
normal
+1
vote
7
Doubt in access link and control link in activation record?
Can anybody explain me access link and control link in activation record?I am confused what is different between them IF POSSIBLE GIVE EXAMPLE ALSO THANKS A LOT
answered
Dec 25, 2019
in
Compiler Design

999
views
compilerdesign
runtimeenvironments
0
votes
8
MadeEasy Test Series 2018: Compiler Design  Runtime Environments
Match the following with respect to activation record fields: A 1 → A, D; 2 → B, C B 1 → A, C; 2 → B, D C 1 → B, C; 2 → A, D D 1 → B, D; 2 → A, C Doubt: Control link points to caller activation record.Can some one confirm?
answered
Dec 25, 2019
in
Compiler Design

188
views
compilerdesign
runtimeenvironments
madeeasytestseries
0
votes
9
Compiler Design Activation Record
As actual parameters are stored in the Actual parameter field in case of Activation record then where does formal parameters will be stored? f(a,b) { a(e,f) } Here e,f are actual parameters that will be stored in actual parameter field,but where does formal parameters a,b will be stored for f activation record?
answered
Dec 25, 2019
in
Compiler Design

305
views
compilerdesign
runtimeenvironments
activationrecords
0
votes
10
UGCNETAUG2016II33
In compiler optimization, operator strength reduction uses mathematical identities to replace slow math operations with faster operations. Which of the following code replacements is an illustration of operator strength reduction ? Replace $P + P$ by $2 ^{*} P$ or Replace $3 + 4$ by $7$ ... $P ^{*} 0$ by $0$ Replace $(P < <4)  P$ by $P ^{*} 15$
answered
Dec 24, 2019
in
Others

674
views
ugcnetaug2016ii
compilerdesign
compilationphases
0
votes
11
UGCNET CS 2016
In compiler optimization, operator strength reduction uses mathematical identities to replace slow math operations with faster operations. Which of the following code replacements is an illustration of operator strength reduction ? A. Replace P + P by 2 * P or Replace 3 + 4 by 7 B. Replace P ... 5 C. Replace P * 0 by 0 D. Replace (P < <4)  P by P * 15 pls explain your answer
answered
Dec 24, 2019
in
Compiler Design

85
views
compiler
codeoptimization
0
votes
12
Galvin Edition 9 Exercise 9 Question 36 (Page No. 456)
A system provides support for userlevel and kernellevel threads. The mapping in this system is one to one (there is a corresponding kernel thread for each user thread). Does a multithreaded process consist of $(a)$ a working set for the entire process or $(b)$ a working set for each thread ? Explain
answered
Dec 19, 2019
in
Operating System

76
views
galvin
operatingsystem
threads
descriptive
0
votes
13
UGCNETJune2019II44
Which of the following are NOT shared by the threads of the same process? Stack Registers Address space Message queue a and d b and c a and b a, b and c
answered
Dec 19, 2019
in
Operating System

197
views
ugcnetjune2019ii
threads
0
votes
14
Zeal Test Series 2019: Operating System  Process Schedule
ANSWER IS C) BUT I AM NOT GETTING HOW 2ND IS CORRECT
answered
Dec 19, 2019
in
Operating System

106
views
zeal
operatingsystem
processschedule
zeal2019
0
votes
15
ISI2018PCBCS7
A context switch from a process $P_{old}$ to a process $P_{new}$ consists of the following steps: Step I:saving the context of $P_{old}$; Step II: running the scheduling algorithm to pick $P_{new}$; Step III: restoring the saved context of $P_{new}$. Suppose Steps ... in the order $P_1, P_2, . . . , P_k;$ each process requires exactly one CPU burst of $20$ms and no I/O burst.
answered
Dec 19, 2019
in
Operating System

117
views
isi2018pcbcs
operatingsystem
processschedule
descriptive
0
votes
16
Cormen Edition 3 Exercise 7.2 Question 3 (Page No. 178)
Show that the running time of QUICKSORT is $\Theta(n^2)$ when the array $A$ contains distinct elements and is sorted in decreasing order.
answered
Dec 17, 2019
in
Algorithms

26
views
cormen
algorithms
quicksort
timecomplexity
descriptive
0
votes
17
Cormen Edition 3 Exercise 7.4 Question 2 (Page No. 184)
Show that quicksort’s bestcase running time is $\Omega(n\ lg\ n)$.
answered
Dec 17, 2019
in
Algorithms

36
views
cormen
algorithms
quicksort
timecomplexity
descriptive
0
votes
18
IISCCSAResearchTest6
Someone claims that Kruskal's algorithm for finding minimum spanning tree can return different spanning trees for the same input graph $G$. Do you agree with the claim? If so, why? If not, argue briefly why the claim is incorrect.
answered
Dec 17, 2019
in
Algorithms

204
views
iisccsaresearch2016
descriptive
algorithms
graphalgorithms
minimumspanningtrees
iiscinterview
0
votes
19
Minimum Spanning Tree ( TestBook Test Series 2)
answered
Dec 17, 2019
in
DS

148
views
minimumspanningtrees
graphalgorithms
0
votes
20
MadeEasy CBT Test 2018: Algorithms  Minimum Spanning Trees
Consider a graph G with positive and distinct edge weights : $1)$ The highest weight edge will never be included in any MST : false if its in cut set $2)$ There will be different MST but with equal weights : False again because applying any algorithm either prim or kruskal it will give same MST G'. Please comment on my understanding.
answered
Dec 17, 2019
in
Algorithms

76
views
algorithms
minimumspanningtrees
madeeasytestseries
0
votes
21
madeeasy work book
Q. State whether the following statements are FALSE. (a). if $e$ is the minimum edge weight in a connected weighted graph,it must be among the edges of at least one minimum spanning tree of the graph. (b). if $e$ is the minimum edge weight ... connected weighted graph,it must be among the edges of each one minimum spanning tree of the graph. which one is correct above two option?
answered
Dec 17, 2019
in
Algorithms

270
views
graphtheory
minimumspanningtrees
0
votes
22
Spanning Tree
2) An undirected graph G has n nodes. Its adjacency matrix is given by an n n square matrix whose (i) diagonal elements are 0 s and (ii) nondiagonal elements are 1 s. which one of the following is TRUE? (a) Graph G has no minimum spanning tree (MST) ... n1 (c) Graph G has multiple distinct MSTs, each of cost n1 (d) Graph G has multiple spanning trees of different costs Expain?
answered
Dec 17, 2019
in
Algorithms

89
views
minimumspanningtrees
algorithms
graphalgorithms
0
votes
23
GATE Minimum Spanning Trees
Q1) Why is the path between a pair of vertices in a minimum Spanning tree of an undirected graph not the shortest( minimum weight) path?
answered
Dec 17, 2019
in
Mathematical Logic

187
views
minimumspanningtrees
spanningtree
graphtheory
graphalgorithms
algorithms
0
votes
24
Gateforum Test Series: Algorithms  Minimum Spanning Trees
answered
Dec 17, 2019
in
Algorithms

98
views
gateforumtestseries
algorithms
minimumspanningtrees
0
votes
25
ISI2017PCBCS7a
Show that $\{1,A \bar{B}\}$ is functionality complete, i.e., any Boolean function with variables $A$ and $B$ can be expressed using these two primitives.
answered
Dec 8, 2019
in
Digital Logic

41
views
isi2017pcbcs
digitallogic
functionalcompleteness
descriptive
0
votes
26
Andrew S. Tanenbaum Edition 5th Exercise 5 Question 32 (Page No. 492)
The set of IP addresses from 29.18.0.0 to 19.18.128.255 has been aggregated to 29.18.0.0/17. However, there is a gap of 1024 unassigned addresses from 29.18.60.0 to 29.18.63.255 that are now suddenly assigned to ... , add the new block to the table, and then see if any reaggregation is possible? If not, what can be done instead?
answered
Dec 6, 2019
in
Computer Networks

69
views
computernetworks
tanenbaum
ipaddressing
subnetting
0
votes
27
Andrew S. Tanenbaum Edition 5th Exercise 6 Question 19 (Page No. 608)
Both UDP and TCP use port numbers to identify the destination entity when delivering a message. Give two reasons why these protocols invented a new abstract ID (port numbers), instead of using process IDs, which already existed when these protocols were designed.
answered
Dec 6, 2019
in
Computer Networks

48
views
computernetworks
transportlayer
udp
tcp
descriptive
0
votes
28
Kurose and Ross Edition 6 Exercise 2 Question R8 (Page No 169)
List the four broad classes of services that a transport protocol can provide. For each of the service classes, indicate if either UDP or TCP (or both) provides such a service.
answered
Dec 6, 2019
in
Computer Networks

54
views
computernetworks
tcp
udp
applicationlayerprotocols
descriptive
0
votes
29
#set theory #groups
Consider the set H of all 3 × 3 matrices of the type: $\begin{bmatrix} a&f&e\\ 0&b&d\\ 0&0&c\\ \end{bmatrix}$ where a, b, c, d, e and f are real numbers and $abc ≠ 0$. Under the matrix multiplication operation, the set H is: (a) a group (b) a monoid but not a group (c) a semigroup but not a monoid (d) neither a group nor a semigroup
answered
Dec 3, 2019
in
Set Theory & Algebra

80
views
settheory&algebra
grouptheory
matrices
0
votes
30
UGCNETJune2019II31
Which of the following has same expressive power with regard to relational query language? Rational algebra and domain relational calculus Relational algebra and tuples relational calculus Relational algebra and domain relational calculus restricted to safe expression Relational algebra and ... restricted to safe expression a and b only c and d only a and c only b and d only
answered
Nov 28, 2019
in
Databases

352
views
ugcnetjune2019ii
relationalcalculus
+1
vote
31
made easy test series
Consider a relation R(A,B,C,D,E) with the following functional dependencies. A→BC C→E B→D E→A The total number of super keys present in the relation are_______
answered
Sep 21, 2018
in
Databases

100
views
+1
vote
32
ISI2016PCBCS1
Consider the array $A=[20,13,19,8,3,5,4]$ that represents a heap. Draw the heap after removing the element $20.$ List all the distinct integer keys $k$ such that, when $k$ is inserted in the Binary Search Tree of Figure $1,$ its height increases. Note that you are not allowed to insert an already existing key again. Justify your answer.
answered
Sep 18, 2018
in
DS

41
views
isi2016pcbcs
trees
binarysearchtree
descriptive
+1
vote
33
#Combinatorics #Self Doubt
The number of ways of dividing 3 men and 3 women into 3 couples each consisting of a man and woman is: ____
answered
Sep 18, 2018
in
Combinatory

91
views
permutationandcombination
0
votes
34
doubt
doubt1:what is the nature of clustering index whether it is dense on sparse? doubt2:what is the nature of secondary index whether it is dense on sparse?
answered
Sep 18, 2018
in
Databases

9
views
0
votes
35
gate forum workbook
answered
Sep 7, 2018
in
Digital Logic

41
views
+1
vote
36
MadeEasy Test Series (Number of tables required)
Answer given is 3 tables which are $R_1(A, B, C, H)$ , $R_2(G, H)$ , $R_3(D, F, A)$ My doubt is if we join $E_1$ and $E_2$ making a new relation $R_{13}(A,G,B,C,H)$ with AG as key and $R_2(A,D,F)$. ... only 2 tables as $E_1$ and $E_2$ are totally participating hence no loss of any data and relation $R_2$ with having AD as key can identify $E_2$.
answered
Sep 2, 2018
in
Databases

480
views
erdiagram
databases
+2
votes
37
true or false finite automata
finite automata have no storage and no computing capability????
answered
Aug 17, 2018
in
Theory of Computation

295
views
+1
vote
38
Programming
answered
Aug 17, 2018
in
Programming

32
views
+2
votes
39
Made Easy algorithms
How many edge disjoint spanning trees are possible for a undirected complete connected graph of n vertices?
answered
Aug 14, 2018
in
Algorithms

151
views
algorithms
spanningtree
graphtheory
0
votes
40
Time Complexity
What is the time complexity of the following? for(i=0; i < n *n ; i = i *i) print("*");
answered
Aug 10, 2018
in
Algorithms

107
views
timecomplexity
algorithms
asymptoticnotations
Page:
1
2
3
next »
50,741
questions
57,243
answers
198,016
comments
104,608
users