Dark Mode

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

answered in DS May 8, 2017

13.5k views

0 votes

2

MadeEasy Subject Test: Operating System - Semaphores

answered in Operating System Jan 30, 2017

573 views

1 vote

3

Turing Recognizable and Turing Decidable
Caption Can someone give a clear explanation to this answer?

answered in Theory of Computation Jan 27, 2017

696 views

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.

answered in Operating System Jan 26, 2017

2.8k views

5 votes

5

MadeEasy Subject Test: Computer Networks - Network Layering

answered in Computer Networks Jan 9, 2017

673 views

1 vote

6

answered in Operating System Jan 5, 2017

262 views

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

answered in Programming in C Dec 19, 2016

950 views

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??

answered in CO and Architecture Dec 16, 2016

3.7k views

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 ________ .

answered in Operating System Dec 7, 2016

1.1k views

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 ?

answered in Theory of Computation Dec 4, 2016

597 views

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.

answered in DS Nov 8, 2016

14.2k views

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 in Algorithms Oct 20, 2016

652 views

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

answered in Theory of Computation Oct 7, 2016

494 views

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????

answered in Operating System Sep 23, 2016

7.4k views

1 vote

15

answered in Operating System Sep 12, 2016

224 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 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

answered in Digital Logic Aug 27, 2016

1.5k views

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 in Programming in C Aug 26, 2016

4.8k 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 in Linear Algebra Aug 25, 2016

2.4k views

3 votes

19

answered in Calculus Aug 25, 2016

676 views

1 vote

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?

answered in Combinatory Aug 25, 2016

2.2k views

0 votes

21

Time Complexity

answered in Unknown Category Aug 25, 2016

383 views

0 votes

22

Delete from R ; What does the following query results?

answered in Databases Aug 25, 2016

254 views

1 vote

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

answered in Others Aug 24, 2016

1.5k views

1 vote

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

answered in Others Aug 24, 2016

2.4k views

1 vote

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

answered in Others Aug 24, 2016

2.4k views

3 votes

26

answered in Mathematical Logic Aug 21, 2016

1.1k views

1 vote

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

answered in Theory of Computation Aug 20, 2016

2.5k views

0 votes

28

TEST SERIES
PLZ someone give one one example... Thanks in advance.

answered in Theory of Computation Aug 20, 2016

273 views

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

answered in CO and Architecture Aug 20, 2016

3.4k views

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

answered in Mathematical Logic Aug 19, 2016

622 views

Page:

1
2
3
next »