GATE CSE
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 Tesla!
User Tesla!
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Tesla!
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+2
votes
1
Os doubt fork related
the output of the following program is Void main() { Int a= 10; If (fork()==0) a++; Print("%d", a); } 0,10 10,10 11,10 11,11
answered
5 days
ago
in
Operating System

48
views
+2
votes
2
algorithmrecurrence relation
How to write recurrence relation for , possible binary sequence of size n ?
answered
Sep 29
in
Algorithms

51
views
recurrence
algorithms
0
votes
3
gate overflow
16kB cache with line size 64B uses 4way set associative mapping. Main memory is 8 MB and byte addressable.The size of extra space needed for storing tag information in bytes is _________ Is ans is 452
answered
Sep 29
in
CO & Architecture

25
views
0
votes
4
GATE2017115
A sender S sends a message $m$ to receiver R, which is digitally signed by S with its private key. In this scenario, one or more of the following security violations can take place. (I) S can launch a birthday attack to replace $m$ with a fraudulent message. (II) A ... violations? (A) (I) and (II) only (B) (I) only (C) (II) only (D) (II) and (III) only
answered
Sep 29
in
Computer Networks

1.5k
views
gate20171
computernetworks
cryptography
normal
0
votes
5
Minimum number of tables to represent ERDiagram
answered
Sep 19
in
Databases

346
views
erdiagram
databases
ertorelational
relational
0
votes
6
doubt
Suppose that we draw a card from a deck of 52 cards and replace it before the next draw. In how many ways can 10 cards be drawn so that the tenth card is a repetition of a previous draw.
answered
Sep 17
in
Combinatory

16
views
+1
vote
7
Data Structure Linked List
1) What is the algorithm for reversing the singly linked list? 2) How palindrome could be made with the help of this algo ?
answered
Sep 12
in
Algorithms

102
views
linkedlists
datastructure
0
votes
8
GATE1995_1.17
A binary tree $T$ has $n$ leaf nodes. The number of nodes of degree $2$ in $T$ is $\log_2 n$ $n1$ $n$ $2^n$
answered
Sep 11
in
DS

1.2k
views
gate1995
datastructure
binarytree
normal
0
votes
9
set theory
How many minimum number must be chosen from a set {1,2,3,...8} such that at least 2 of them must have sum=9?
answered
Sep 9
in
Set Theory & Algebra

22
views
0
votes
10
is statement written in red also true ?? anyone
answered
Sep 8
in
Mathematical Logic

39
views
+1
vote
11
gate level minimization
prove that x'y+xy'+xy=x+y
answered
Sep 5
in
Digital Logic

79
views
+2
votes
12
cache memory
In kway set associative mapping , the tag field contains 8 bits and 64 no. of sets and propagation delay of a comparator is k/20 nsec and propagation delay of 2*1 multiplexer is k/10 nsec. then what will be the total delay? (let k=8)
answered
Sep 4
in
CO & Architecture

95
views
co&architecture
cachememory
0
votes
13
Rosen Excercise 6.2
Show that if five integers are selected from the first eight positive integers, there must be a pair of these integers with a sum equal to 9. can i choose same interger five times? ex. if i choose integer 1 five times.
answered
Sep 4
in
Combinatory

25
views
+1
vote
14
cache memory
Consider a computer with a 4ways setassociative mapped cache of the following characteristics: a total of 256 MB of main memory, a word size of 1 byte, a line size of 128 words and a cache size of 512 KB. While accessing the memory location FC23CDEH by the ... /6]217 ,where TAG field is the content of the corresponding cache line. (a) 3 (b) 0 (c) 1 (d) 2
answered
Sep 4
in
CO & Architecture

112
views
co&architecture
cachememory
0
votes
15
Maximum and Minimum number in 16 bit Floating Point
answered
Sep 4
in
CO & Architecture

94
views
floatingpointrepresentation
ieeerepresentation
co&architecture
computer
computernetworks
digitallogic
0
votes
16
Concurrent Processes
Consider the program segment: x= 0; y=0; Cobegin begin x= 1; y= y + x; end begin y= 2; x= x + 3; end Coend; Which of the following indicates possible values for the variables when the segment finishes execution? (1) x= 1, y= 2 (2) x= 1, y= 3 (3) x= 4, y= 6 (a) 1 only (b) 1 & 2 only (c) 1 & 3 only (d) 2 & 3 only (e) 1, 2, 3
answered
Sep 3
in
Operating System

69
views
operatingsystem
processsynchronization
0
votes
17
Counting Semaphores
2. Assume that ‘C’ is a Counting Semaphore initialized to value ‘10’. Consider the following program segment: P(C); V(C); P(C); P(C); P(C); V(C); V(C) V(C); V(C); V(C); P(C); V(C); V(C); P(C) What is the value of C? a) 8 b)10 c)12 d)14
answered
Sep 3
in
Operating System

139
views
semaphores
processsynchronization
operatingsystem
semaphore
+2
votes
18
test series
All 2 digit numbers are written in ascending order with a vertical line separating every pair of consecutive numbers. The number of these vertical line is _
answered
Sep 1
in
Numerical Ability

97
views
+1
vote
19
MDFA.
Consider the following NFA Number of states in the equivalent minimal DFA is_________???? (Note: Count one for the dead state (if required))
answered
Aug 30
in
Theory of Computation

46
views
+2
votes
20
limit
solve following $\lim_{x>0} e^{ax} e^{ax}/ log(1+bx)$
answered
Aug 30
in
Calculus

52
views
limits
+2
votes
21
No of labelled trees
What is the number of trees possible with 'n' labelled nodes? I've seen it as n^(n2) [Cayley's formula] So what does (2n C n)/(n+1)) * n! give? which is the Catalan no to find the number of binary trees with 'n' labelled nodes. I'm confused. Please explain the difference between these 2 formulas.
answered
Aug 30
in
DS

37
views
catalannumber
cayleysformula
0
votes
22
cache memory
Cache memory can exploit spatial locality of reference 1)by remembering which pieces of data have been accessed recently 2)when some data items are reaccessed frequently 3)by remembering which cache blocks have been recently written to 4)only if cache line size is greater than 1 byte
answered
Aug 29
in
CO & Architecture

42
views
co&architecture
cachememory
–2
votes
23
GATE1997_3.8
When an interrupt occurs, an operating system ignores the interrupt always changes state of interrupted process after processing the interrupt always resumes execution of interrupted process after processing the interrupt may change state of interrupted process to ‘blocked’ and schedule another process.
answered
Aug 29
in
Operating System

1.8k
views
gate1997
operatingsystem
interrupts
normal
+1
vote
24
Why given C code of Binary Search Tree is errorneous.
answered
Aug 23
in
Programming

71
views
binarysearchtree
programminginc
datastructure
+1
vote
25
Lost Update problem
IN these questions , in T1 it will read value of A from hard disk or local buffer and W(A) when execute it will make change in local buffer or hard disk , are w(A) and commit are same because commit means we stored data in hard disk anyone explain plz in detail
answered
Aug 20
in
Databases

69
views
databases
selfdoubt
0
votes
26
Multi level paging
Im confused with multi level paging As per my understanding the outer most page table must be in main memory and not all inner page tables to be in memory in 2 level paging by this we can save the memory But with this, faults ... more levels of paging more faults wil be their Even then why we are using multi level paging Please can someone help me
answered
Aug 19
in
Operating System

85
views
memorymanagement
+3
votes
27
Please solve this Q
Q. The best case of quick sort helps Aditya to sort a particular data set of size ‘n’ in 640 ms. Suresh also tried the same algorithm on similar data set and it took him 256 ms in best case to sort a file of size 16. What could be Aditya’s file size?
answered
Aug 19
in
Algorithms

48
views
algorithms
+2
votes
28
Optimal Merge Pattern,similar to http://gateoverflow.in/1997/gate2014238
answered
Aug 18
in
Algorithms

96
views
optimalmergepattern
+1
vote
29
the gate book
The no. of binary trees with 3 nodes which when traversed by postorder gives the sequence A, B, C is: (a) 3 (b) 9 (c) 7 (d) 5
answered
Aug 18
in
DS

50
views
binarytree
+1
vote
30
number of comparison
how many comparison are needed to locate the maximum and minimum in a sequence with 128 elements?
answered
Aug 18
in
Mathematical Logic

34
views
0
votes
31
Relation doubt
What is the total number of asymmetric and transitive relation from set a to itself which has n element ?
answered
Aug 17
in
Mathematical Logic

34
views
0
votes
32
GATE201429
A 4way setassociative cache memory unit with a capacity of 16 KB is built using a block size of 8 words. The word length is 32 bits. The size of the physical address space is 4 GB. The number of bits for the TAG field is ____
answered
Aug 17
in
CO & Architecture

2.4k
views
gate20142
co&architecture
cachememory
numericalanswers
normal
0
votes
33
Paging
Suppose you have a computer system with a 48bit logical address, page size of 16KB and 4 bytes per page table entry. If we have a 48MB program such that the entire program and all necessary page tables are in memory. Assume that each page ... this 48Mb process the solution splits the logical address space of 48 bits into parts ?? how do we decide that split ???
answered
Aug 17
in
Operating System

116
views
multilevelpaging
+1
vote
34
Optimal Merging .
The optimal time required in merging the list of size 11, 21, 33, 34,45,54,60 where merging of 2 lists takes O(m+n) time is I think the answer should be 692. But the answer given is 258.
answered
Aug 17
in
Algorithms

143
views
algorithms
arrays
+1
vote
35
The minimum number of comparisons required
answered
Aug 15
in
Algorithms

47
views
+1
vote
36
Cache Memory
Consider a 256KB direct mapped byte addressable cache. If one word is 4 bytes and each cache block contains 16 words , then determine the number of bits required for tag.(Assume that physical address of computer is 32 bits)
answered
Aug 15
in
CO & Architecture

97
views
0
votes
37
Real World Example of Paging
Processor: 32 bit with 4 KB page size. RAM:  4 GB with 220 frames in the RAM. Process: > Process Name  MOTO GP > Process Size  1GB > Frame Size  4 KB // As frame size is always equal to page size. ... processes like NFS Shift 2 which is approx of 7 GB, I think which introduces the concept of virtual memory but don't know how?
answered
Aug 14
in
Operating System

54
views
operatingsystem
paging
multilevelpaging
+1
vote
38
TOC Question
Whats The Answer & How to solve such kind of Questions ?
answered
Aug 12
in
Theory of Computation

61
views
theoryofcomputation
contextfreelanguage
+3
votes
39
cache
Consider a system with the main memory access time as 200 ns and cache access time as 10 ns. Hit ratio for read request is 0.8 and 80% of the memory requests are for read. If write through policy is used, then the average time considering both read and write requests is _______. a. 169.6 ns b. 192.4 ns c. 78.4 ns d. None of these
answered
Aug 12
in
CO & Architecture

90
views
+2
votes
40
cache
Suppose that in 1000 memory references there are 150 misses in first level and 100 miss in second level cache. Assume that miss penalty from L2 cache to memory is 120 cycles. The hit time of L2 cache is 50 cycles. If there are 4 memory references per instruction, the average stall per instruction is _________. (ans given:78 )
answered
Aug 12
in
CO & Architecture

44
views
Page:
1
2
3
4
5
next »
27,422
questions
35,272
answers
84,584
comments
33,511
users