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
Recent activity 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
10
answers
1
GATE201950
What is the minimum number of $2$input NOR gates required to implement a $4$ variable function expressed in sumofminterms form as $f=\Sigma(0,2,5,7, 8, 10, 13, 15)?$ Assume that all the inputs and their complements are available. Answer: _______
commented
Feb 5, 2019
in
Digital Logic

6.8k
views
gate2019
numericalanswers
digitallogic
canonicalnormalform
1
answer
2
ISRO 2019
Can anyone pls write about ISRO cut off for CSE in GEN and OBC category?
commented
Feb 5, 2019
in
GATE

581
views
isro19
0
answers
3
GATE 2019
What will be the answer to this question ? Will it go in infinite loop ?
commented
Feb 4, 2019
in
Digital Logic

539
views
usergate2019
usermod
1
answer
4
gate 2019
question about spanning tree? both option are correct or only first
commented
Feb 4, 2019
in
Algorithms

331
views
1
answer
5
gate 2019
Consider the following statements. (i) In max Heap smallest element is at the leaf node. (ii) In max Heap second largest element always the child of root. (iii) Binary search tree can be constructed from max heap in θ(n). (iv) Max Heap can be build from Binary search tree in θ(n) Which of the above ... ) and (iii) (b) (i), (ii) and (iv) (c) (ii), (iii) and (iv) (d) (i), (iii) and (iv)
commented
Feb 4, 2019
in
DS

802
views
1
answer
6
Mid exam
Hi everyone! I've been recently asked by one of my friends to prove an equation but still, I'm confused how to get it started tho. log(n!) = Ω(nlog(n)) Does anyone know how to help? I'll be very grateful if someone comes to reply to my issue. Thanks in advance.
commented
Feb 3, 2019
in
Study Resources

144
views
log
question
factorial
1
answer
7
gate dummy question
there was a question of apti inwhich teachers represented as traingles educationries as circle what is the answer of that ques ?
commented
Feb 3, 2019
in
Verbal Ability

580
views
2
answers
8
gate 2019
From a complete binary tree T of 8 leaf nodes, two leaf nodes a and b are selected randomly and uniformly. What is the expected distance between a and b in T?
commented
Feb 3, 2019
in
Programming

1.1k
views
1
answer
9
Gate 19
The expenditure ______ as follows ...… Break down or breaks down
commented
Feb 3, 2019
in
Verbal Ability

1.9k
views
0
answers
10
First fit,Next fit assumptions
In Os questions related to first fit,next fit etcv if nothing is given which partition scheme do we assume.Fixed or variable
commented
Jan 30, 2019
in
Operating System

41
views
0
answers
11
Made easy test series
Minimum number of registers required by an optimal code generation algorithm (intermediate results can be stored in memory). And if possible solve it using SethiUllman Algorithm?
commented
Jan 30, 2019
in
CO and Architecture

193
views
3
answers
12
MadeEasy Subject Test 2019: Combinatory  Permutations And Combinations
Q.The number of ways, we can arrange 5 books in 3 shelves ________.
commented
Jan 29, 2019
in
Combinatory

459
views
discretemathematics
permutationandcombination
madeeasytestseries2019
madeeasytestseries
2
answers
13
self doubt
Let L = { (a^p)*  p is prime number } and input is {a} . what is minimum number of state in NFA and DFA ?
commented
Jan 28, 2019
in
Theory of Computation

83
views
theoryofcomputation
#dfa
2
answers
14
Find the language
Regural CFL CSL Recursive
commented
Jan 28, 2019
in
Theory of Computation

58
views
0
answers
15
Testbook Test Series: Operating System  Disks
A UNIX style inode has 15 direct pointers and one single, one double and one triple indirect pointers. The disk block size is 1KB, disk block address is 64 bits and 48 bit integers are used. What is the maximum possible fize size in bytes? Thanks!
commented
Jan 28, 2019
in
Operating System

82
views
testbooktestseries
operatingsystem
disks
1
answer
16
Self doubt
Let say L1 is Dcfl and L2=~L1(~ is complement L=L1 Intersection L2 What is L??
commented
Jan 28, 2019
in
Theory of Computation

62
views
theoryofcomputation
8
answers
17
Common Careless Mistakes
What are the most common mistakes you have made in tests? A good list will help aspirants reduce their mistakes in GATE. Just listing out some common ones. Missing the NOT in question  our eyes have a tendency to focus on important words and ... many calculation mistakes. In any formula you do, you must get the correct unit for the result Please add more as answers.
commented
Jan 27, 2019
in
Revision

1.3k
views
mistakes
preparation
0
answers
18
made easy cbt
commented
Jan 24, 2019
in
Databases

114
views
1
answer
19
MadeEasy Test Series 2019: Databases  Transaction And Concurrency
Consider the following schedule $\text{S : r2(A), w1(B), w1(C), R3(B), r2(B), r1(A), commit_1, r2(C), commit_2, w3(A), commit_3 }$ Consider the following statements : S1 : Schedule(S) is conflict ... ) is strict recoverable schedule. S4 : Schedule(S) is allowed by strict 2PL. How many above statements true about schedule(S) ?
commented
Jan 24, 2019
in
Databases

361
views
transactions
madeeasytestseries2019
madeeasytestseries
0
answers
20
Made Easy CBT
Consider the system which has virtual address of 36 bits and physical address of 30 bits and page size of 8 KB, page table entry contain 1 valid bit, 2 protection bit and 1 reference bit. Then the approximate page table size in (MB) is ________.
commented
Jan 23, 2019
in
CO and Architecture

110
views
0
answers
21
MADE EASY CBT2
Consider a binary tree where for every node ⏐P  Q⏐ ≤ 2. P represents number of nodes in left sub tree for node S and Q represents the number of nodes in right sub tree for node S for h > 0. The minimum number of nodes present in such binary ... NEED THAT NODE AT RIGHT SUBTREE DIDNT GET THAT ( 3RD NODE AT 2ND LEVEL WHY IS THAT THERE I THINK WITHOUT IT WE ARE SATISYING CONDITIONS
closed
Jan 23, 2019
in
Algorithms

74
views
1
answer
22
MADE EASY CBT2
THEY GIVE OPTIONS ARE 0 1 2 3 WHAT I DO WAS I PUT P=8,Q=4,R=2 AND X=16 AND THEN GET RESULT ACCORDING TO THAT AND MY RESULT WAS CLOSE TO 1 BUT THEY ARE GIVING ANSWER 0 BY SOME THEOREM WHICH I DONT KNOW CORRECT OR NOT anyones result 0 plzz prove that
closed
Jan 23, 2019
in
Verbal Ability

184
views
1
answer
23
Context Free Languages
What is the difference between regular intersection and intersection? (I found out that CFL is closed under regular intersection but not under intersection) Thanks!
commented
Jan 22, 2019
in
Theory of Computation

28
views
contextfreelanguages
theoryofcomputation
theory
0
answers
24
made easy test series
Consider the following relation: R (ABCDEF) F = {AB → C, BC → A, AC → B, B → D, C → E} The minimum number of relations required which satisfy BCNF, lossless join decomposition and dependency preserving decomposition are ________.
commented
Jan 19, 2019
in
Databases

75
views
0
answers
25
madeeasy test series
answer given as 255.255.255.254 how it is correct please check??
commented
Jan 17, 2019
in
Computer Networks

59
views
0
answers
26
#madeeasy
{w/w€{0,1}^*; w has equal no. of occurrance of ‘001 and ‘010’} is regular or not??
commented
Jan 16, 2019
in
Theory of Computation

56
views
0
answers
27
SELF DOUBT
The number of totally ordered sets compatible to the given POSET are_________ IS IT TOPOLOGICAL SORT POSSIBLE OR TOTAL CHAINS POSSIBLE IN DIAGRAM
asked
Jan 14, 2019
in
Mathematical Logic

62
views
0
answers
28
self doubt
what are comparison based algo properties ? there was a question dont remember much which they take random program and then there are options like 1) comparison based 2) stable 3) both 4 ) none of above that program is inplace for sure .... but altast ... based properties are not satisfied.... ( i know without question little difficult but i dont remember where i saw that question )
edited
Jan 14, 2019
in
Programming

53
views
0
answers
29
SELF DOUBT
Two CSMA/CD stations are each trying to transmit large files of multiple frames. After each frame is sent, they contend for the channel using the binary exponential backoff algorithm. The probability that the contention ends in round 3 is _____ (up to 3 decimal points)
comment edited
Jan 11, 2019
in
Computer Networks

104
views
0
answers
30
ME TEST SERIES DOUBT
A CPU Manufacturer company has two designs p1 and p2 for a synchronous pipeline processor. P1 has 5 pipeline stages with execution times of 3 ns, 4 ns, 3 ns, 2 ns, 4 ns while the design P2 has 6pipeline stage with 3 ns each (execution time). The time that can be saved by P2 over P1 for executing 1000 Instructions is _____________ ns. iam getting answer 997 but they give 1001
comment edited
Jan 11, 2019
in
CO and Architecture

33
views
0
answers
31
verbal ability
The question consists of five statements followed by options consisting of three statements put together in a specific order. Choose the option which indicates a valid argument, that is, where the third statement is a conclusion drawn from the preceding two statements. ... are sour. All sour things are tasteless. Some grapes are not tasteless. No grape is tasteless. cea bdc cbd eac
asked
Jan 11, 2019
in
Others

22
views
0
answers
32
regarding networking syllabus
i am confused about networking syllabus .i studied this subject during may june i think but after that i didnt revise this subject that much means i revise subject half one or two times during these months but later half never . topics i done means revise ... now then in exam maybe i will not able to answer those questions ( just in loop right now in mind) .
edited
Jan 10, 2019
in
Others

48
views
1
answer
33
Probability
Suppose we want to pick two numbers from {1,2……,100} randomly . The probability that sum of the two numbers is divisible by 5 is _________________
comment reshown
Jan 8, 2019
in
Probability

403
views
probability
0
answers
34
self doubt
Consider the string “GATE2000”, the number of nontrivial substrings of given string are i am constatly confused in these types of substrings questions please specify some resource or plzz derive how to solve these questions
asked
Jan 5, 2019
in
Compiler Design

162
views
1
answer
35
Recurrence relation
T(n) = T(n/4) + T(3n/4) + n How to solve these type of problems? Can I solve this using master theorm by considering X = T(3N/4) +N THEN T(N) = T(N/4) +X CAN WE SOLVE LIKE THIS? PLEASE HELP
comment edited
Jan 5, 2019
in
Algorithms

200
views
recurrenceeqation
timecomplexity
recurrence
algorithms
2
answers
36
MadeEasy Test Series: Algorithms  Graph Algorithms
Which of the following statement is true? For a directed graph, the absence of back edges in a DFS tree can have cycle. If all edge in a graph have distinct weight then the shortest path between two vertices is unique. The depth of any DFS ( ... tree rooted at a vertex is atleast as depth of any BFS tree rooted at the same vertex. Both (a) and (c)
comment edited
Jan 4, 2019
in
Algorithms

202
views
madeeasytestseries
algorithms
graphsearch
graphalgorithms
1
answer
37
SELF DOUBT
Output will be int main() { int a =0,b=1,c=3: *((a)?&b:&a)=a ? b : c; printf("%d %d%d ", a,b,c); } O/P AT LAST ?
answer selected
Jan 3, 2019
in
Programming

70
views
1
answer
38
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
0
answers
39
MadeEasy Full Length Test: Programming & DS  Programming in C
Consider the following function foo() void foo(int n) { if(n<=0) printf("Bye"); else { printf("Hi"); foo(n3); printf("Hi"); foo(n1); } } Let P(n) represent the recurrence relation indicating ... P(2) But nothing is mentioned about P value when n<0. How to solve for P(2) and other negative values?
comment edited
Jan 2, 2019
in
Programming

128
views
madeeasytestseries
programminginc
2
answers
40
GATE2006IT78
A pipelined processor uses a $4$stage instruction pipeline with the following stages: Instruction fetch (IF), Instruction decode (ID), Execute (EX) and Writeback (WB). The arithmetic operations as well as the load and store operations are carried out in the EX stage. The sequence of ... the sequence of instructions are, respectively, $2, 2, 4$ $3, 2, 3$ $4, 2, 2$ $3, 3, 2$
comment reshown
Jan 1, 2019
in
CO and Architecture

3.9k
views
gate2006it
coandarchitecture
pipelining
normal
50,737
questions
57,324
answers
198,408
comments
105,173
users