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 Deepanshu
User Deepanshu
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Deepanshu
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
votes
1
UGCNETDEC2018II13
Consider the following statements: Auto increment addressing mode is useful in creating sefrelocating code. If auto increment addressing mode is included in an instruction set architecture. In auto incrementing addressing mode, the amount of increment depends on the size of the ata item ... statements is/are true? (i) and (ii) only (ii) and (iii) only (iii) only (ii) only
answered
Jan 3, 2019
in
Others

200
views
ugcnetdec2018ii
+1
vote
2
STORAGE ALLOCATION
TRUE/FALSE 1.STATIC STORAGE ALLOCATION DOES NOT SUPPORT DYNAMIC DATA STRUCTURE. 2.STACK STORAGE ALLOCATION DOES NOT SUPPORT DYNAMIC DATA STRUCTURE.
answered
Nov 15, 2018
in
Compiler Design

222
views
0
votes
3
made easy tt2
No. of BST possible with 12 keys , when 1,2,....12 are inserted into empty BST with a condition that 4 is the root and 8 is the immediate right child of 4 are....?? pls tell me why my approach is wrong?? since 4 is the root so 4 should come first in all sequence ... rest of the element 5,6,7,9,10,11,12 they can also come in order , s0 it becomes = 7! =5040 TOTAL WAYS = 24*5040=120960
answered
Nov 11, 2018
in
DS

65
views
0
votes
4
OS MOCK
answered
Oct 24, 2018
in
Operating System

128
views
+5
votes
5
3D array
int arr[2][3][2]; print(arr[1]arr[0],arr[1][0]arr[0][0]) P.s :Sorry i can't able to paste the question but this is main Context.
answered
Oct 21, 2018
in
Programming

348
views
arrayofpointers
arrays
0
votes
6
Algorithms doubt
If f (n), g(n) and h(n) are nondecreasing complexity functions. if f(n) ∈ O(h(n)), what is the relation between f(n) and (g ◦ h(n) + c), for any constant c ≥ 0, where a ◦ b is the composite function of a and b. A f(n) ∈ O(g ◦ h(n) + c), B f(n) ∈ $\Theta$(g ◦ h(n) + c), C f(n) ∈$\Omega$(g ◦ h(n) + c), D none ?
answered
Oct 16, 2018
in
Algorithms

62
views
0
votes
7
MADE EASY TEST SERIES
Consider a hypothetical machine which supports the following data types: unsigned char :1 Byte unsigned short : 2 Bytes int :4 Bytes Consider the following function red() int red (unsigned char a, unsigned short b) { if (a==0) return b; else { a=a+1 ... be the output of the program. Because according to me it should be 32768, but in madeeasy solution it is given as output 0.
answered
Oct 11, 2018
in
Programming

74
views
+1
vote
8
Normal Form (doubt)
Here directly dependency not given. Which normal form it doesnot hold , how to eliminate it? I got here 1:m, or 1:1 dependency. Is it any value to ans this question?
answered
Oct 2, 2018
in
Databases

119
views
databasenormalization
databases
0
votes
9
self doubt
please explain the memory allocation of statement , means how it works register int a= 10;
answered
Oct 1, 2018
in
Programming

41
views
+1
vote
10
please solve my doubt
1) C,C++,JAVA are finite language or not 2) Every finite language are regular .it is true 3) All regular language are Finite
answered
Sep 26, 2018
in
Theory of Computation

34
views
+1
vote
11
Combination
The number of ways can three 0’s, three 1’s and three 2’s be arranged, so that no three adjacent digits are the same in an arrangement is ________
answered
Sep 24, 2018
in
Combinatory

53
views
permutationandcombination
engineeringmathematics
discretemathematics
+1
vote
12
Self Doubt
Degree of multiprogramming is controlled by Longterm scheduler? Why? It just moves jobs from Secondary Memory to MM?
answered
Sep 15, 2018
in
Operating System

59
views
operatingsystem
+1
vote
13
Doubt in Finite Automata
Consider the following DFA D. The number of states in the minimization of D is __________.
answered
Sep 12, 2018
in
Theory of Computation

72
views
finiteautomata
theoryofcomputation
minimalstateautomata
0
votes
14
Cross_Joins
What is CROSS JOIN with an empty table ??
answered
Aug 19, 2018
in
Databases

27
views
0
votes
15
self doubt
find the number of trivial substring in "SAME1234".
answered
Aug 16, 2018
in
Theory of Computation

31
views
0
votes
16
MadeEasy Test Series: Databases  Functional Dependencies
What will be the minimal cover of given FD's?
answered
Aug 16, 2018
in
Databases

94
views
madeeasytestseries
databases
databasenormalization
0
votes
17
self doubt
halting problem for turing machine is undecidable it is clear but what about halting problem of total turing mchine???
answered
Aug 16, 2018
in
Theory of Computation

18
views
0
votes
18
Pratice guqestion
Identify in the list below a sentence of length 6 that is generated by thr grammar S > (S) S  ε
answered
Aug 15, 2018
in
Theory of Computation

16
views
+1
vote
19
parser
Consider a Context Free Grammar G I  if G is not Suitable for Top Down Parser then it is also not suitable for LR parsers Family. II  if G is not Suitable for Top Down Parser then it may work for Operator Precedence parsers. III .if G is suitable for LR parsers ... it will surely work for Top Down Parser a) I and II correct b) II and III correct. c) only II correct d) all are correct
answered
Aug 12, 2018
in
Compiler Design

25
views
0
votes
20
Self Doubt
answered
Aug 11, 2018
in
Algorithms

58
views
timecomplexity
0
votes
21
NFA DFA
My doubt is it always true that the number of state in NFA is always less than number of state required in DFA for all language which are regular?
answered
Aug 10, 2018
in
Theory of Computation

75
views
+1
vote
22
TOC decidability
Let <M> be the encoding of Turing machine as a string over Σ = {0, 1}. Let L = {<M>  M is TM on input w will visit some state P}. The language L is (a) Decidable (b) Undecidable but partially decidable (c) Undecidable and not even partially decidable (d) Not a decision problem
answered
Aug 10, 2018
in
Theory of Computation

140
views
decidability
recursiveandrecursivelyenumerablelanguages
turingmachine
0
votes
23
Engineering mathematics
if the sum of the diagonal elements of a 2x2 matrix is (6) then the maximum possible value of determinant of the matrix is
answered
Aug 9, 2018
in
Linear Algebra

63
views
+1
vote
24
ER model minimum number of tables
What is the min and max number of tables required to convert an ER diagram with 2 entities and 1 relationship between them with partial participation constraints of both entities ? (A) Min 1 and max 2 (B) Min 1 and max 3 (C) Min 2 and max 3 (D) Min 2 and max 2
answered
Aug 9, 2018
in
Databases

382
views
50,741
questions
57,231
answers
197,991
comments
104,577
users