Dark Mode

Answers by mohitbawankar

0 votes

1

PAGE FAULTS
Consider a binary search algorithm to search an element in array of ‘n’ numbers. Assume that this array spans over multiple pages with each page holding ‘p’ elements (n>p). Every memory access will generate a page fault until the search range is less than ‘p’. The minimum value of ‘p’ that reduces the page fault is

answered in Operating System Jan 22, 2018

517 views

2 votes

2

doubt
Consider a simple system running a single process. The size of physical frames and logical pages is 16 bytes. The RAM can hold 3 physical frames. The virtual addresses of the process are 6 bits in size. The program generates the following 20 virtual ... map to any logical page. Calculate the number of page faults genrated by the accesses above, assuming a LRU page replacement algorithm

answered in Operating System Jan 22, 2018

3.0k views

2 votes

3

answered in Programming in C Jan 6, 2018

1.2k views

0 votes

4

max stack Q
i got ans 24but given ans is 32 please correct me. Consider an efficient implementation of a data structure STACK-MAX that support an operation max( ) that reports the current maximum among all elements in the stack. Normal stack operations i.e., push, pop are also to be ... max, push (5) is Y (in bytes). Assume that an integer can be stored in 4 bytes. What is the value of Y?

answered in DS Jan 6, 2018

483 views

0 votes

5

Propagation Delay
Consider a communication link between a workstation which is on earth and a satellite which acts as a server. Distance between earth and satellite is 4 * 10^4 km. What is the best-case delay in response to a request?

answered in Computer Networks Jan 2, 2018

457 views

0 votes

6

answered in Computer Networks Dec 30, 2017

189 views

0 votes

7

conversion digital logic
5-4-2-1 bcd to natural code conversion explain >>

answered in Digital Logic Dec 30, 2017

1.0k views

2 votes

8

Test series
Consider the program which was made to run on two different machines the machine-2 results 20% speeder compared to machine-1 however the CPI of 2nd machine is 25% more than the CPI of machine 1. If the clock frequency of the machine 1 is 2 MHZ what is the clock frequency of machine 2?

answered in CO and Architecture Dec 28, 2017

978 views

0 votes

9

MadeEasy Test Series: Databases - B Tree
Which of the following statement true about B tree and B+ tree index? Assume order of B tree node same as order of B+ tree node. B tree index has more levels than B+ tree index for large number of keys. B+ tree index has more levels than B ... records. B+ tree index nodes more than B tree for large number of keys I think a is correct but the given ans is b

answered in Databases Dec 26, 2017

1.8k views

2 votes

10

NIELIT 2017 -SET C-108
The automaton which allows transformation to a new state without consuming any input symbol: a) NFA b) DFA c) NFA-l d) All of the mentioned.

answered in Theory of Computation Dec 24, 2017

4.0k views

1 vote

11

NIELIT -SET C-107
Page fault Frequency in an OS is reduced when the: (A) processes tend to the I/O-bound (B) size of pages is reduced (C) processes tend to be CPU-bound (D) locality of reference is applicable to the process

answered in CO and Architecture Dec 24, 2017

470 views

5 votes

12

NIELIT SET-C-106
The average search time of hashing, with linear probing will be less if the load factor A. is far less than one B. equals one C. is far greater than one D. none of the above

answered in Programming in C Dec 24, 2017

3.2k views

5 votes

13

GATE CSE 1993 | Question: 6.5
Convert the following numbers in the given bases into their equivalents in the desired bases: $(110.101)_{2} = (x)_{10} $ $(1118)_{10} = (y)_{H}$

answered in Digital Logic Dec 24, 2017

2.9k views

0 votes

14

disjunctive normal form

answered in Digital Logic Dec 24, 2017

550 views

0 votes

15

Number of Different Minimal Cover
Consider the following FD set {A → BC,B → AC, C → AB}. The number of different minimal covers possible for the above FD set __________ .

answered in Databases Dec 20, 2017

3.5k views

0 votes

16

Comparisons for merging four arrays
Suppose there are 4 sorted lists of 8 elements each. If we merge these lists into a single sorted list of 32 elements. The key comparisons that are needed in the worst case using an efficient algorithm are ____.

answered in Algorithms Dec 19, 2017

3.6k views

50 votes

17

GATE IT 2007 | Question: 60
For the network given in the figure below, the routing tables of the four nodes $A$, $E$, $D$ and $G$ are shown. Suppose that $F$ has estimated its delay to its neighbors, $A$, $E$, $D$ and $G$ as $8$, $10$, $12$ and $6$ msecs respectively and updates its ...

answered in Computer Networks Dec 18, 2017

9.2k views

1 vote

18

NIELIT 2017 DEC Scientist B - Section B: 24
Which of the following is TRUE? Every relation in $3$NF is also in BCNF A relation R is in $3$NF if every non-prime attribute of R is fully functionally dependent on every key of R Every relation in BCNF is also in $3$NF No relation can be in both BCNF and $3$NF.

answered in Databases Dec 18, 2017

1.1k views

4 votes

19

NIELIT 2017 DEC Scientist B - Section B: 30
If for a given Binary Search Tree (BST) the pre-order traversal is $41,23,11,31,62,50,73$. Then which of the following is its post-order traversal? $11,31,23,50,73,62,41$ $31,11,23,50,41,62,73$ $11,31,50,23,73,62,41$ $11,31,23,50,62,73,41$

answered in DS Dec 18, 2017

1.7k views

0 votes

20

NIELIT 2017 DEC Scientist B - Section B: 27
If any string of a language $L$ can be effectively enumerated by an enumerator in a lexicographic order then language $L$ is _______. Regular Context free but not necessarily regular Recursive but not necessarily context free Recursively enumerable but not necessarily recursive

answered in Theory of Computation Dec 18, 2017

1.0k views

0 votes

21

NIELIT 2017 DEC Scientist B - Section B: 37
Which of the following statement is true? $S1$: The power of a multi-tape Turing machine is greater than the power of a single tape Turing machine. $S2$: Every non-deterministic Turing machine has an equivalent deterministic Turing machine. $S1$ $S2$ Both $S1$ and $S2$ None of the options

answered in Theory of Computation Dec 18, 2017

3.0k views

2 votes

22

NIELIT 2017 DEC Scientist B - Section B: 35
Which of the following regular expression is equal to $(r_1+r_2)^*$? $r_1^*r_2^*$ $(r_1r_2)^*$ $r_1^*r_2^*+r_1r_2$ $(r_1^*r_2^*)^*$

answered in Theory of Computation Dec 18, 2017

706 views

1 vote

23

NIELIT 2017 DEC Scientist B - Section B: 19
Recursive enumerable languages are not closed under _________. Set difference Complement Both (A) and (B) None of the options

answered in Theory of Computation Dec 18, 2017

1.4k views

1 vote

24

probability
A diagnostic test has a probability0.95 of giving a positive result when applied to a person suffering from a certain disease, and a probability0.10 of giving a (false) positive when applied to a non-sufferer. It is estimated that 0.5 % of the population are ... a sufferer; (c) that, given a negative result, the person is a non-sufferer; (d) that the person will be misclassified.

answered in Probability Dec 16, 2017

3.4k views

10 votes

25

GATE CSE 2014 Set 1 | Question: 51
Consider an undirected graph $G$ where self-loops are not allowed. The vertex set of $G$ is $\{(i,j) \mid1 \leq i \leq 12, 1 \leq j \leq 12\}$. There is an edge between $(a,b)$ and $(c,d)$ if $|a-c| \leq 1$ and $|b-d| \leq 1$. The number of edges in this graph is______.

answered in Graph Theory Dec 13, 2017

26.7k views

3 votes

26

no of 0 address instructions
A hypothetical processor supports two-address, one-address and zero-address instructions. It has a 256 word memory and each instruction is 19 bits long. If there are 4 two-address instructions and 1000 one-address instructions, how many zero-address instructions are there?( Marks: 0.00 ) 5126 2048 1024 6144

answered in CO and Architecture Dec 12, 2017

2.1k views

0 votes

27

Condition for deadlock free
Let there be ‘m’ resources of single instance & ‘n’ processes. ‘A’ represents sum of allocation matrix for all processes, ‘N’ represents sum of need matrix and ‘M’ represents sum of max matrix for all processes. The conditions for which system is dead lock free is 0≤N≤m and M≤m+n 1<A<m and M≤m+n 1≤N≤m and M<m+n

answered in Operating System Dec 12, 2017

1.0k views

3 votes

28

GATE CSE 1990 | Question: 4-ii
State whether the following statements are TRUE or FALSE with reason: The data transfer between memory and I/O devices using programmed I/O is faster than interrupt-driven I/O.

answered in CO and Architecture Dec 11, 2017

7.5k views

1 vote

29

output of program
main { int i; printf (“Hellow \n”); For(i=1; j<=10; i++) main ( ); } What is the o/p of the following program? Endless execution of code & printing Hellow continuously Compiler error Hellow 10 time Hellow 9 times

answered in Programming in C Dec 11, 2017

1.0k views

22 votes

30

GATE IT 2004 | Question: 21
Which level of locking provides the highest degree of concurrency in a relational database ? Page Table Row Page, table and row level locking allow the same degree of concurrency

answered in Databases Dec 11, 2017

18.6k views

Page: