Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
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
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’ eleme...
519
views
answered
Jan 22, 2018
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
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...
3.0k
views
answered
Jan 22, 2018
2
votes
3
merge sort
1.2k
views
answered
Jan 6, 2018
Programming in C
merge-sort
algorithms
sorting
+
–
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?
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 ...
490
views
answered
Jan 6, 2018
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?
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...
469
views
answered
Jan 2, 2018
Computer Networks
computer-networks
+
–
0
votes
6
#testbook
190
views
answered
Dec 30, 2017
0
votes
7
conversion digital logic
5-4-2-1 bcd to natural code conversion explain >>
5-4-2-1 bcd to natural code conversion explain >>
1.0k
views
answered
Dec 30, 2017
Digital Logic
digital-logic
boolean-algebra
logic
+
–
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?
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 th...
1.0k
views
answered
Dec 28, 2017
CO and Architecture
co-and-architecture
+
–
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
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 ...
1.8k
views
answered
Dec 26, 2017
Databases
made-easy-test-series
databases
b-tree
+
–
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.
The automaton which allows transformation to a new state without consuming any input symbol:a) NFAb) DFAc) NFA-ld) All of the mentioned.
4.0k
views
answered
Dec 24, 2017
1
votes
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
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 r...
471
views
answered
Dec 24, 2017
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
The average search time of hashing, with linear probing will be less if the load factorA. is far less than oneB. equals oneC. is far greater than oneD. none of the above
3.2k
views
answered
Dec 24, 2017
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}$
Convert the following numbers in the given bases into their equivalents in the desired bases:$(110.101)_{2} = (x)_{10} $$(1118)_{10} = (y)_{H}$
3.0k
views
answered
Dec 24, 2017
Digital Logic
gate1993
digital-logic
number-representation
normal
descriptive
+
–
0
votes
14
disjunctive normal form
553
views
answered
Dec 24, 2017
Digital Logic
digital-logic
+
–
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 __________ .
Consider the following FD set {A → BC,B → AC, C → AB}. The number of different minimal covers possible for the above FD set __________ .
3.6k
views
answered
Dec 20, 2017
Databases
databases
minimal-cover
+
–
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 ____.
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 ca...
3.6k
views
answered
Dec 19, 2017
Algorithms
algorithms
merging
array
+
–
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 ...
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...
9.4k
views
answered
Dec 18, 2017
Computer Networks
gateit-2007
computer-networks
distance-vector-routing
normal
+
–
1
votes
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.
Which of the following is TRUE?Every relation in $3$NF is also in BCNFA relation R is in $3$NF if every non-prime attribute of R is fully functionally dependent on every ...
1.1k
views
answered
Dec 18, 2017
Databases
nielit2017dec-scientistb
database-normalization
bcnf
+
–
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$
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$$...
1.7k
views
answered
Dec 18, 2017
DS
nielit2017dec-scientistb
data-structures
binary-search-tree
tree-traversal
+
–
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
If any string of a language $L$ can be effectively enumerated by an enumerator in a lexicographic order then language $L$ is _______.RegularContext free but not necessari...
1.1k
views
answered
Dec 18, 2017
Theory of Computation
nielit2017dec-scientistb
theory-of-computation
recursive-and-recursively-enumerable-languages
+
–
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
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-determin...
3.1k
views
answered
Dec 18, 2017
Theory of Computation
nielit2017dec-scientistb
theory-of-computation
turing-machine
+
–
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^*)^*$
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^*)^*$
711
views
answered
Dec 18, 2017
Theory of Computation
nielit2017dec-scientistb
theory-of-computation
regular-expression
+
–
1
votes
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
Recursive enumerable languages are not closed under _________.Set differenceComplementBoth (A) and (B)None of the options
1.4k
views
answered
Dec 18, 2017
Theory of Computation
nielit2017dec-scientistb
theory-of-computation
easy
recursive-and-recursively-enumerable-languages
+
–
1
votes
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.
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) p...
3.4k
views
answered
Dec 16, 2017
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______.
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 $...
26.8k
views
answered
Dec 13, 2017
Graph Theory
gatecse-2014-set1
graph-theory
numerical-answers
normal
graph-connectivity
+
–
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
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 tw...
2.1k
views
answered
Dec 12, 2017
CO and Architecture
co-and-architecture
instruction-format
+
–
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
Let there be ‘m’ resources of single instance & ‘n’ processes. ‘A’ represents sum of allocation matrix for all processes, ‘N’ represents sum of need matri...
1.0k
views
answered
Dec 12, 2017
Operating System
deadlock-prevention-avoidance-detection
operating-system
+
–
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.
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...
7.6k
views
answered
Dec 11, 2017
CO and Architecture
gate1990
true-false
co-and-architecture
io-handling
interrupts
+
–
1
votes
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
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 co...
1.0k
views
answered
Dec 11, 2017
Programming in C
programming-in-c
output
programming
+
–
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
Which level of locking provides the highest degree of concurrency in a relational database ?PageTableRowPage, table and row level locking allow the same degree of concurr...
18.7k
views
answered
Dec 11, 2017
Databases
gateit-2004
databases
normal
transaction-and-concurrency
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register