Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Sanket_
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Sanket_
12
votes
1
ISRO2017-53
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
In a doubly linked list the number of pointers affected for an insertion operation will be401Depends on the nodes of doubly linked list
13.5k
views
answered
May 8, 2017
DS
isro2017
data-structures
linked-list
bad-question
+
–
0
votes
2
MadeEasy Subject Test: Operating System - Semaphores
568
views
answered
Jan 30, 2017
Operating System
operating-system
made-easy-test-series
semaphore
+
–
1
votes
3
Turing Recognizable and Turing Decidable
Caption Can someone give a clear explanation to this answer?
CaptionCan someone give a clear explanation to this answer?
689
views
answered
Jan 27, 2017
Theory of Computation
turing-machine
theory-of-computation
decidability
+
–
2
votes
4
made-easy 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.
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....
2.7k
views
answered
Jan 26, 2017
Operating System
process-synchronization
deadlock-prevention-avoidance-detection
+
–
5
votes
5
MadeEasy Subject Test: Computer Networks - Network Layering
661
views
answered
Jan 9, 2017
Computer Networks
made-easy-test-series
computer-networks
network-layering
+
–
1
votes
6
Made easy test
261
views
answered
Jan 5, 2017
0
votes
7
Linked List
A linked list of length at most n is maintained in circular array C[0:n-1], 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 manner and head =p ... list can be done in O(1), O(1) time O(1), O(n) time O(n), O(1) time O(n), O(n) time
A linked list of length at most n is maintained in circular array C[0:n-1], clockwise or anticlock wise; two variables head and last are used to point to first and last e...
940
views
answered
Dec 19, 2016
4
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, the answer should be ... and two memory references for operand fetch as it is indirect. But the solution says 3,2. can someone check??
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...
3.7k
views
answered
Dec 16, 2016
CO and Architecture
co-and-architecture
addressing-modes
+
–
4
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 ________ .
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 w...
1.1k
views
answered
Dec 7, 2016
Operating System
deadlock-prevention-avoidance-detection
+
–
0
votes
10
CFL or not
It seemed like , this is textbook example of non-CFL 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 ?
It seemed like , this is textbook example of non-CFL language ; will require 2 comparisons . That means no complement exist was the answer , I was expecting. Why answer g...
586
views
answered
Dec 4, 2016
Theory of Computation
theory-of-computation
context-free-language
finite-automata
dcfl
+
–
29
votes
11
GATE CSE 1987 | Question: 1-xv
In a circular linked list organization, insertion of a record involves modification of One pointer. Two pointers. Multiple pointers. No pointer.
In a circular linked list organization, insertion of a record involves modification ofOne pointer.Two pointers.Multiple pointers.No pointer.
14.1k
views
answered
Nov 8, 2016
DS
gate1987
data-structures
linked-list
+
–
1
votes
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 ??
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...
645
views
answered
Oct 20, 2016
Algorithms
time-complexity
algorithms
ace-booklet
+
–
2
votes
13
Virtual Gate Test Series: Theory Of Computation - Turing Machine
Consider the following two decision problems Whether a Turing machine takes more than $481$ steps on input $\epsilon?$ Whether a Turing machine accepts the null string $\epsilon?$ Which of the following statements is true$?$ ... undecidable but $B$ is decidable Both $A$ and $B$ are decidable Both $A$ and $B$ are undecidable
Consider the following two decision problemsWhether a Turing machine takes more than $481$ steps on input $\epsilon?$Whether a Turing machine accepts the null string $\ep...
482
views
answered
Oct 7, 2016
Theory of Computation
theory-of-computation
turing-machine
decidability
virtual-gate-test-series
+
–
6
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????
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 - 4b- 5c -6d -7 Inter...
7.4k
views
answered
Sep 23, 2016
Operating System
operating-system
memory-management
virtual-memory
test-series
+
–
1
votes
15
gateforum
221
views
answered
Sep 12, 2016
1
votes
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 result is +ve ( sign bit becomes 0) Carry from MSB $\oplus$ Carry into MSB = 1 When we add two unsigned numbers there is an out Carry C out
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 i...
1.5k
views
answered
Aug 27, 2016
Digital Logic
overflow
digital-logic
+
–
1
votes
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
representation of data structure in memory is known as 1)recursive 2)ADT 3)File structure 4)storage structure
4.8k
views
answered
Aug 26, 2016
1
votes
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
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 ...
2.4k
views
answered
Aug 25, 2016
3
votes
19
Continuity
673
views
answered
Aug 25, 2016
Calculus
calculus
+
–
1
votes
20
generalised pigeonhole principle
Show that if seven integers are selected from the first 10 positive integers, there must be at least two pairs of these integers with the sum 11. Attempt-:partition will be {(1,10),(2,9),(3,8)(4,7)(5,6)} now how to apply pigeonhole principle to find the answer?
Show that if seven integers are selected from the first10 positive integers, there must be at least two pairsof these integers with the sum 11.Attempt-:partition will be ...
2.1k
views
answered
Aug 25, 2016
Combinatory
pigeonhole-principle
combinatory
counting
+
–
0
votes
21
Time Complexity
365
views
answered
Aug 25, 2016
0
votes
22
Delete from R ; What does the following query results?
247
views
answered
Aug 25, 2016
1
votes
23
UGC NET CSE | June 2011 | Part 2 | Question: 19
A transaction can include following basic database access operations : Read_item(X) Write_item(X) Both (A) and (B) None of these
A transaction can include following basic database access operations :Read_item(X)Write_item(X)Both (A) and (B)None of these
1.5k
views
answered
Aug 24, 2016
Others
ugcnetcse-june2011-paper2
databases
transaction-and-concurrency
+
–
1
votes
24
UGC NET CSE | June 2011 | Part 2 | Question: 20
Decomposition help in eliminating some of the problems of bad design Redundancy Inconsistencies Anomalies All of the above
Decomposition help in eliminating some of the problems of bad designRedundancyInconsistenciesAnomaliesAll of the above
2.3k
views
answered
Aug 24, 2016
Others
ugcnetcse-june2011-paper2
databases
decomposition
+
–
1
votes
25
UGC NET CSE | June 2011 | Part 2 | Question: 17
Which of the following is the process by which a user’s privileges ascertained ? Authorization Authentication Access Control None of these
Which of the following is the process by which a user’s privileges ascertained ?AuthorizationAuthenticationAccess ControlNone of these
2.4k
views
answered
Aug 24, 2016
Others
ugcnetcse-june2011-paper2
databases
+
–
3
votes
26
Combinatorics
1.1k
views
answered
Aug 21, 2016
1
votes
27
UGC NET CSE | June 2016 | Part 3 | Question: 22
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 \}$ ... family 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
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{ an...
2.5k
views
answered
Aug 20, 2016
Theory of Computation
ugcnetcse-june2016-paper3
theory-of-computation
regular-language
+
–
0
votes
28
TEST SERIES
PLZ someone give one one example... Thanks in advance.
PLZ someone give one one example...Thanks in advance.
272
views
answered
Aug 20, 2016
0
votes
29
UGC NET CSE | December 2011 | Part 2 | Question: 31
CPU does not perform the operation Data transfer Logic operation Arithmetic operation All of the above
CPU does not perform the operationData transferLogic operationArithmetic operationAll of the above
3.4k
views
answered
Aug 20, 2016
CO and Architecture
ugcnetcse-dec2011-paper2
co-and-architecture
cpu
+
–
3
votes
30
Gatebook
Let A has n vertices. If Ā is connected graph then the maximum number of edges that A can have is a) (n-1)(n-2)/2 b) n(n-1)/2 c) n-1 d) n
Let A has n vertices. If Ā is connected graph then the maximum number of edges that A can have isa) (n-1)(n-2)/2b) n(n-1)/2c) n-1d) n
611
views
answered
Aug 19, 2016
Mathematical Logic
graph-connectivity
+
–
Page:
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register