The Gateway to Computer Science Excellence
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
Exam Category
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
+1
vote
1
mst non distinct
G = (V, E ) is an undirected simple graph and e is a particular edge of G. Which of the following statements about the minimum spanning trees (MSTs) of G is/are TRUE? I. If e is the lightest edge of some cycle in G, then every MST of G includes e II. ... in G, then every MST of G excludes e (A) I only (B) II only (C) both I and II (D) neither I nor II
answered
Nov 10
in
Algorithms

25
views
0
votes
2
#number representation
If we convert an ndigit number with base 2k into base2,the resulting number of digits will be of what order?
answered
Nov 4
in
Digital Logic

31
views
0
votes
3
Digital Logic
If a full mod counter having 10 flipflops is initialized at 0, the count it holds after 2060 pulses will be ____________________ a) 10 b) 11 c) 12 d) 13
answered
Nov 3
in
Digital Logic

62
views
digitallogic
digitalcounter
+1
vote
4
Number of descendents
In a binary tree if an element is it's own descendent(means 3 descendent of every node), then what is the number of descendent of leaf nodes? If there is any descendent of degree 0?
answered
Nov 2
in
DS

47
views
datastructure
+1
vote
5
GATE2007IT80
Let P1, P2,..... , Pn be n points in the xyplane such that no three of them are collinear. For every pair of points Pi and Pj, let Lij be the line passing through them. Let Lab be the line with the steepest ... the largest or the smallest ycoordinate among all the points The difference between xcoordinatef Pa and Pb is minimum None of the above
answered
Nov 2
in
Set Theory & Algebra

626
views
gate2007it
linescurves
0
votes
6
self doubt
how to decide maximum limit of virtual address space ? is it max disk space available?
answered
Nov 1
in
Operating System

36
views
0
votes
7
How many relation are there on n to n ? I don't get what it means while I know its result .
answered
Nov 1
in
Mathematical Logic

38
views
functions
+3
votes
8
Trees
Number of rooted labeled trees(i.e. each node can be the root) with 6 vertices is:
answered
Nov 1
in
Programming

82
views
binarytree
algorithms
0
votes
9
GATE201025
Which of the following statements are true? Shortest remaining time first scheduling may cause starvation Preemptive scheduling may cause starvation Round robin is better than FCFS in terms of response time I only I and III only II and III only I, II and III
answered
Oct 31
in
Operating System

1k
views
gate2010
operatingsystem
processschedule
easy
0
votes
10
GATE19961.12
Consider the following statements: Firstinfirst out types of computations are efficiently supported by STACKS. Implementing LISTS on linked lists is more efficient than implementing LISTS on an array for almost all the basic LIST operations. Implementing QUEUES on a circular ... true (i) and (ii) are true (iii) and (iv) are true (ii) and (iv) are true
answered
Oct 31
in
DS

894
views
gate1996
datastructure
easy
queues
stack
linkedlists
+1
vote
11
Data Structure
Which data structure can be used to implement a collection of elements with following constraints in most efficient manner? Constraints: Items are retrieved and removed in FIFO order. There is no limits in number of elements Size of an item is relatively larger than storage ... 1st node IV) Binary tree a) I and II b) IV and III c)II and IV d) II and III
answered
Oct 29
in
DS

56
views
datastructure
+3
votes
12
COA: Average Memory Access Time
answered
Oct 29
in
CO & Architecture

95
views
coandarchitecture
cachememory
0
votes
13
DOUBT
how i delete my answer or comment in GO.
answered
Oct 27
in
Others

27
views
+1
vote
14
total recuursive function
What is total recursive function?
answered
Oct 27
in
Theory of Computation

42
views
+2
votes
15
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
Oct 18
in
Operating System

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

58
views
recurrence
algorithms
0
votes
17
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

30
views
0
votes
18
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.7k
views
gate20171
computernetworks
cryptography
normal
0
votes
19
Minimum number of tables to represent ERDiagram
answered
Sep 19
in
Databases

444
views
erdiagram
databases
ertorelational
relational
0
votes
20
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

26
views
+1
vote
21
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

124
views
linkedlists
datastructure
0
votes
22
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.5k
views
gate1995
datastructure
binarytree
normal
0
votes
23
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

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

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

98
views
+2
votes
26
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

109
views
coandarchitecture
cachememory
0
votes
27
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

33
views
+1
vote
28
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

139
views
coandarchitecture
cachememory
0
votes
29
Maximum and Minimum number in 16 bit Floating Point
answered
Sep 4
in
CO & Architecture

131
views
floatingpointrepresentation
ieeerepresentation
coandarchitecture
computer
computernetworks
digitallogic
0
votes
30
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

93
views
operatingsystem
processsynchronization
0
votes
31
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

212
views
semaphores
processsynchronization
operatingsystem
semaphore
+2
votes
32
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

106
views
+1
vote
33
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

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

60
views
limits
+2
votes
35
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

47
views
catalannumber
cayleysformula
+1
vote
36
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

58
views
coandarchitecture
cachememory
+1
vote
37
Why given C code of Binary Search Tree is errorneous.
answered
Aug 23
in
Programming

79
views
binarysearchtree
programminginc
datastructure
+1
vote
38
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

79
views
databases
selfdoubt
0
votes
39
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

122
views
memorymanagement
+3
votes
40
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

55
views
algorithms
Page:
1
2
3
4
5
next »
29,157
questions
36,985
answers
92,166
comments
34,824
users