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
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 Sanket_
User Sanket_
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Sanket_
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+4
votes
1
ISRO201753
In a doubly linked list the number of pointers affected for an insertion operation will be 4 0 1 Depends on the nodes of doubly linked list
answered
May 8, 2017
in
DS

4k
views
isro2017
datastructure
linkedlists
badquestion
0
votes
2
Madeeasy
answered
Jan 30, 2017
in
Operating System

72
views
operatingsystem
madeeasytestseries
+1
vote
3
Turing Recognizable and Turing Decidable
answered
Jan 27, 2017
in
Theory of Computation

146
views
turingmachine
theoryofcomputation
decidability
+2
votes
4
madeeasy mock test2
Which of the following statement is true related to synchronization mechanism? a) If any solution is satisfying the progress condition, then it will not have any deadlock. b) Race condition occur if mutual exclusion is satisfied. c) Bounded waiting is always satisfied if there are only two processes. d) None.
answered
Jan 26, 2017
in
Operating System

329
views
processsynchronization
deadlock
+4
votes
5
made easy test series
answered
Jan 9, 2017
in
Computer Networks

108
views
madeeasytestseries
computernetworks
+1
vote
6
Made easy test
answered
Jan 6, 2017
in
Operating System

62
views
0
votes
7
Linked List
A linked list of length at most n is maintained in circular array C[0:n1], clockwise or anticlock wise; two variables head and last are used to point to first and last element of the list respectively, for instance if linked list is of size x and if it is maintained in clock wise ... be done in O(1), O(1) time O(1), O(n) time O(n), O(1) time O(n), O(n) time
answered
Dec 19, 2016
in
Programming

158
views
+2
votes
8
made easy
consider an instruction of indirect addressing mode. what are the number of memory references by the processor when an instruction is a computation that requires a single operand and when it is a branch instruction respectively?? According to me answer ... and two memory references for operand fetch as it is indirect. But solution says 3,2. can someone check??
answered
Dec 16, 2016
in
CO & Architecture

368
views
+2
votes
9
MADE EASY TEST SERIES
Suppose 10 processes P1 to P10 share 7 identical resource units which can be reserved and release 1 at are time the maximum resource requirement of a processs P i is SP where SP is greater then 0. The maximum value of that ensures deadlock does not occurs is ________ .
answered
Dec 8, 2016
in
Operating System

320
views
deadlock
0
votes
10
CFL or not
It seemed like , this is textbook example of nonCFL language ; will require 2 comparisons . That means no complement exist was the answer , I was expecting. Why answer given is CFL , am I missing something ?
answered
Dec 5, 2016
in
Theory of Computation

164
views
theoryofcomputation
contextfreelanguage
finiteautomata
dcfl
contextfreelanguages
+13
votes
11
GATE19871xv
In a circular linked list oraganisation, insertion of a record involves modification of One pointer. Two pointers. Multiple pointers. No pointer.
answered
Nov 8, 2016
in
DS

1.2k
views
gate1987
datastructure
linkedlists
+1
vote
12
Ace Page# 128, Q#48
I think the median can be found in O(n), because in O(n) we can merge the arrays into a single sorted array and in O(1) we can find the middle element of the array. Am I correct ??
answered
Oct 20, 2016
in
Algorithms

103
views
timecomplexity
algorithms
+1
vote
13
# virtual gate 2015 Qno.16
answered
Oct 7, 2016
in
Theory of Computation

111
views
virtualgate
testseries
theoryofcomputation
turingmachine
+5
votes
14
OS Memory Management
Consider a paging system with page size of 8 KB. If a process of size 34 KB is in logical address space, find the internal fragmentation in Kbytes. a  4 b 5 c 6 d 7 Internal fragmentation is always half the page size I guess So the answer should be 4 KB but it is 6 KB How????
answered
Sep 23, 2016
in
Operating System

411
views
operatingsystem
memorymanagement
virtualmemory
testseries
+1
vote
15
gateforum
answered
Sep 12, 2016
in
Operating System

55
views
+1
vote
16
Overflow Conditions
Please correct if any of the following does not represnt overflow condition when two binary 2s complement digits are added Two +ve (sign bit 0) numbers are added result is ve ( sign bit becomes 1) Two ve (sign bit 1) numbers are added ... 0) Carry from MSB $\oplus$ Carry into MSB = 1 When we add two unsigned numbers there is an out Carry C out
answered
Aug 27, 2016
in
Digital Logic

238
views
overflow
digitallogic
+1
vote
17
representation of ds in memory
representation of data structure in memory is known as 1)recursive 2)ADT 3)File structure 4)storage structure
answered
Aug 27, 2016
in
Programming

2.6k
views
+1
vote
18
ugcnet_june_2008_II
5. In a set of 8 positive integers, there always exists a pair of numbers having the same remainder when divided by: .(A) 7 (B) 11 (C) 13 (D) 15
answered
Aug 25, 2016
in
Linear Algebra

270
views
+3
votes
19
Continuity
answered
Aug 25, 2016
in
Calculus

114
views
calculus
+1
vote
20
generalised pigeonhole principle
answered
Aug 25, 2016
in
Combinatory

483
views
pigeonhole
permutationsandcombinations
counting
0
votes
21
Time Complexity
answered
Aug 25, 2016

86
views
0
votes
22
Delete from R ; What does the following query results?
answered
Aug 25, 2016
in
Databases

49
views
+1
vote
23
UGCNETJune2011II19
A transaction can include following basic database access operations : Read_item(X) Write_item(X) Both (A) and (B) None of these
answered
Aug 24, 2016
in
Others

136
views
ugcnetjune2011ii
+1
vote
24
UGCNETJune2011II20
Decomposition help in eliminating some of the problems of bad design Redundancy Inconsistencies Anomalies All of the above
answered
Aug 24, 2016
in
Others

155
views
ugcnetjune2011ii
+1
vote
25
UGCNETJune2011II17
Which of the following is the process by which a user’s privileges ascertained ? Authorization Authentication Access Control None of these
answered
Aug 24, 2016
in
Others

282
views
ugcnetjune2011ii
+1
vote
26
UGCNETDec2011II43
The proposition $\sim$ qvp is equivalent to p $\rightarrow$ q q $\rightarrow$ p p $\leftrightarrow$ q p $\vee$ q
answered
Aug 21, 2016
in
Others

204
views
ugcnetdec2011ii
+3
votes
27
Combinatorics
answered
Aug 21, 2016
in
Mathematical Logic

198
views
+1
vote
28
UGCNETJune2016III22
The symmetric differences of two sets $S_1$ and $S_2$ is defined as: $S_1 \oplus S_2 =\{x \mid x \in S_1 \text{ or } x \in S_2, \text{ but x is not in both } S_1 \text{ and } S_2 \}$ The ... of regular languages are closed under both symmetric difference and nor The family of regular languages are not closed under both symmetric difference and nor
answered
Aug 20, 2016
in
Theory of Computation

388
views
ugcnetjune2016iii
theoryofcomputation
0
votes
29
TEST SERIES
PLZ someone give one one example... Thanks in advance.
answered
Aug 20, 2016
in
Theory of Computation

105
views
0
votes
30
UGCNETDec2011II31
CPU does not perform the operation Data transfer Logic operation Arithmetic operation All of the above
answered
Aug 20, 2016
in
Others

276
views
ugcnetdec2011ii
+2
votes
31
Gatebook
Let A has n vertices. If Ā is connected graph then the maximum number of edges that A can have is a) (n1)(n2)/2 b) n(n1)/2 c) n1 d) n
answered
Aug 19, 2016
in
Mathematical Logic

157
views
graphconnectivity
+1
vote
32
UGCNETDec2011II26
Dijikstra banking algorithm in an operating system, solves the problem of Deadlock avoidance Deadlock recovery Mutual exclusion Context switching
answered
Aug 18, 2016
in
Others

101
views
ugcnetdec2011ii
+2
votes
33
No of DFA
How many number of FA are possible with N states (Q1,Q1,........Qn) for input alphabet {1,2,3,........m} ,where Q1 is always initial state ?
answered
Aug 18, 2016
in
Theory of Computation

306
views
theoryofcomputation
finiteautomata
+2
votes
34
Decide about functional dependencies
answered
Aug 18, 2016
in
Databases

79
views
functionaldependencies
0
votes
35
Thrashing
answered
Aug 15, 2016
in
Operating System

223
views
+2
votes
36
#made easy
consider 2 string A="qpqrr" B="pqprqrp". let x be the lenght of longest common subsequence(not necessary contiguus) between A and B and let y be the number of such a longest common subsequence between A and B. then what is the value of X+10Y=________
answered
Aug 15, 2016
in
Algorithms

56
views
+1
vote
37
BIG CONFUSION _PROBABILITY
1)If two fair dice is rolled ,find the probability that sum is 6 when 1st die is 4 2)find the probability of getting a 2 in the second dice if first die is 4 can we say these two are same question beacuse for 1st one answer is ... 1st one we can not consider the cases where 6 comes in 1st die in sample space,coz no chance of sum coming 6 then
answered
Aug 14, 2016

180
views
0
votes
38
UGCNETDec2015III5
A DMA controller transfers 32bit words to memory using cycle Stealing. The words are assembled from a device that transmits characters at a rate of 4800 characters per second. The CPU is fetching and executing instructions at an average rate of one ... By how much will the CPU be slowed down because of the DMA transfer? 0.06% 0.12% 1.2% 2.5%
answered
Aug 14, 2016

789
views
ugcnetdec2015iii
coandarchitecture
dma
+1
vote
39
UGCNETDec2011II9
The amount of uncertainty in a system of symbol is called Bandwidth Entropy Loss Quantum
answered
Aug 14, 2016
in
Others

211
views
ugcnetdec2011ii
+2
votes
40
Ace Page# 11, Q# 16
answered
Aug 14, 2016
in
Databases

55
views
functionaldependencies
Page:
1
2
next »
34,210
questions
40,895
answers
116,082
comments
39,793
users