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.
Recent activity 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
0
answers
1
Data Structure
For a table of 12 items given 19,13,05,27,01,26,31,16,02,09,11,21 What will be the output when items of bucket are merged after first distribution??
commented
5 hours
ago
in
Algorithms

14
views
datastructure
0
answers
2
teatbook questions
commented
5 hours
ago
in
Theory of Computation

29
views
0
answers
3
william stallings 8th ediiton
For the hexadecimal main memory addresses 111111, 666666,BBBBBB, show the following information, in hexadecimal format: a. Tag, Line, and Word values for a directmapped cache, b. Tag and Word values for an associative cache, c. Tag, Set, and Word values for a twoway setassociative cache,
commented
5 hours
ago
in
CO & Architecture

7
views
co&architecture
1
answer
4
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 ???
answer edited
1 day
ago
in
Operating System

60
views
multilevelpaging
1
answer
5
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.
answer edited
1 day
ago
in
Algorithms

65
views
algorithms
arrays
1
answer
6
Related to page frame
n a 32 bit processor the virtual address is 22 bit:12 bit(Table index : Offset). What is the size of the page frame and the process page table assuming that each entry in the page table is 4 Bytes?
commented
2 days
ago
in
Operating System

98
views
operatingsystem
pagetable
memorymanagement
discretemathematics
programminginc
0
answers
7
Page tables
Suppose you have a computer system with a 48bit logical address, page size of 16K 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. How much memory is used by program, including its page tables? A.216(3121) B.216(3211) C.217(3121) D.217(3211)
commented
2 days
ago
in
Operating System

25
views
1
answer
8
Sorted List
suppose there are 4 sorted lists of n/4 elements each. if we merge these list into a single sorted list of n elements, for the n=400 number of key comparisons in the worst case using an efficient algorithm is
commented
2 days
ago
in
Algorithms

41
views
sorting
algorithms
1
answer
9
Set theory lattice
why lub of 2 and 3 does not exist ... upper bond of 2 and 3 is 12 18 and 36 ... least among them is 12 thus least upper bond is 12... right? question image : https://drive.google.com/open?id=0ByxeyAYDQMMXakFLYTZ6NE9OWEtOSjQ1LXp5dmhGS0FiT3dF
commented
2 days
ago
in
Set Theory & Algebra

43
views
settheory
lattice
discretemathematics
1
answer
10
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
commented
2 days
ago
in
Operating System

32
views
memorymanagement
1
answer
11
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
commented
2 days
ago
in
Databases

34
views
databases
selfdoubt
3
answers
12
rosen
Show that each of the conditional statement is a tautology not using truth table [(p → q) ∧ (q → r)] → (p → r)
answer edited
2 days
ago
in
Mathematical Logic

71
views
discretemathematics
kennethrosen
mathematicallogic
0
answers
13
1995_13
closed
3 days
ago
in
Mathematical Logic

19
views
1
answer
14
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
3 days
ago
in
Algorithms

28
views
algorithms
1
answer
15
GO query.........
is there is any option available for bookmark the question in GO or something else which we solved in during preparation time, so it's easy to recollect the concepts because there are lot's of the question in GO, sometimes forget whether it's solved previously or not???
commented
4 days
ago
in
Others

30
views
0
answers
16
Geometry
two equal circles intersect at A and B and distance between their centres is 40 cm. Distance between A and B is 30 cm then find the radius of circle.
commented
4 days
ago
in
Study Resources

29
views
0
answers
17
Effective memory access time
What has to be the general and final formula for calculating the effective memory access time, taking in consideration the $\alpha$level page table, TLB hit ratio as $h$, miss ratio as $m$, memory access time as $M$, TLB ... fault servicing as $x$? There seems to be so many formulae, each different from each other depending on the question.
commented
4 days
ago
in
CO & Architecture

20
views
co&architecture
effectivememoryaccess
tlb
operatingsystem
0
answers
18
Process Synchronization
The following program consists of 3 concurrent processes and 3 binary semaphores.The semaphores are initialized as S0 = 1, S1 = 0, S2 = 0. Process P0 Process P1 Process P2 While (true) { wait (S0); print '0'; release S1; release S2; } Wait ... many time process P0 print '0'? a. Exactly 2 time b. Exactly 3 time c. Atleast 2 time c. Atleast 3 time
closed
4 days
ago
in
Operating System

16
views
0
answers
19
Degital logic
closed
4 days
ago
in
Digital Logic

24
views
1
answer
20
Optimal Merge Pattern,similar to http://gateoverflow.in/1997/gate2014238
commented
4 days
ago
in
Algorithms

33
views
optimalmergepattern
1
answer
21
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
5 days
ago
in
DS

16
views
binarytree
0
answers
22
Programming in C
#include <stdio.h> int main(void){ int i=511; char *p = (char *)&i; printf("%d", *p); } OK so why take 2's complement and not simple binary number? Means, why is C giving 1 and not 255?
commented
5 days
ago
in
Programming

40
views
programminginc
pointers
output
0
answers
23
ACE TestSeries
commented
5 days
ago
in
Databases

18
views
1
answer
24
number of comparison
how many comparison are needed to locate the maximum and minimum in a sequence with 128 elements?
answered
5 days
ago
in
Mathematical Logic

19
views
1
answer
25
How many total bits are required for a direct mapped cache with 16 KB of...?
commented
5 days
ago
in
CO & Architecture

22
views
co&architecture
0
answers
26
Directed graph
how to calculate number of directed graphs possible having n vertices?
commented
5 days
ago
in
Graph Theory

48
views
directedgraph
1
answer
27
Relation doubt
What is the total number of asymmetric and transitive relation from set a to itself which has n element ?
answered
6 days
ago
in
Mathematical Logic

20
views
2
answers
28
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
6 days
ago
in
CO & Architecture

1.8k
views
gate20142
co&architecture
cachememory
numericalanswers
normal
1
answer
29
OS 2005
Is fork() in OS syllabus or COA syllabus
commented
Aug 16
in
Operating System

15
views
2
answers
30
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)
commented
Aug 15
in
CO & Architecture

74
views
1
answer
31
Regular Expression
What is the regular expression for all strings over {0, 1} not containing the substring 101?
comment edited
Aug 15
in
Theory of Computation

89
views
theoryofcomputation
regularexpressions
1
answer
32
Toc Basics
Complement of (0+1)*1 ?? my answer is (0+11*0)* given answer is (1*0)* please give detail explanation!
commented
Aug 15
in
Theory of Computation

38
views
theoryofcomputation
finiteautomata
regularexpressions
1
answer
33
The minimum number of comparisons required
answered
Aug 15
in
Algorithms

22
views
0
answers
34
postal course
hi all, i am going to buy postal course plese suggest me which coaching offers good quality postal course. ACE OR MADEEASY.
closed
Aug 15
in
Others

31
views
0
answers
35
Ace Practice booklet
T(n)=sqrt(2T(n/2))+logn
closed
Aug 15
in
Algorithms

134
views
acebooklet
timecomplexity
recurrence
0
answers
36
cache
closed
Aug 15
in
CO & Architecture

17
views
0
answers
37
Digital
closed
Aug 15
in
Digital Logic

15
views
digitallogic
1
answer
38
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

26
views
operatingsystem
paging
multilevelpaging
0
answers
39
UGC Net computer science, June 2014, Paper 3 , Question n o. 60
closed
Aug 14
in
Others

25
views
0
answers
40
ace previous year solution
does this formula holds good in all cases? window size=bandwidth * round trip time
commented
Aug 14
in
Computer Networks

17
views
datalink
layer
switching
25,071
questions
32,225
answers
75,102
comments
30,232
users