Register
Filter

Answers by Anjali_aspirant

3 votes
1
UGC NET CSE | December 2015 | Part 3 | Question: 37
Match the following with respect to various memory management algorithms : ... $\text{(a)-(ii), (b)-(iii), (c)-(iv), (d)-(i)}$
Match the following with respect to various memory management algorithms :$\begin{array}{clcl} & \textbf{List-I} & & \textbf{List-II} \\ \text{(a)} & \text{Demand pagin...
1 votes
2
UGC NET CSE | June 2013 | Part 3 | Question: 39
Match the following : ... $\text{a-iii, b-i, c-iv, d-ii}$ $\text{a-ii, b-iv, c-i, d-iii}$
Match the following :$\begin{array} {} \text{a.}& \text{Context sensitive language} & \text{i.} & \text{Deterministic finite automation} \\ \text{b.}& \text{Regular gram...
1 votes
3
MCQ COA veii Impp
Choose the correct answer and explain also why ? What is a Flip Flop a)A Binary cell capable of storing one bit information b)An analog device capable of giving the synchronization c)a set of registers d) a clock
Choose the correct answer and explain also why ?What is a Flip Flop a)A Binary cell capable of storing one bit informationb)An analog device capable of giving the synchro...
1 votes
5
Calculate excess 3 code
Convert 11012 to corresponding excess-3 binary number. (A) 10000 (B) 10110 10110 (C) 100110 (D) 01000110
Convert 11012 to corresponding excess-3 binary number.(A) 10000(B) 10110 10110(C) 100110(D) 01000110
1 votes
6
register memory location
The register or main memory location which contains the effective address of the operand is known as pointer special location indexed register None of the above
The register or main memory location which contains the effective address of the operand is known aspointerspecial locationindexed registerNone of the above
1 votes
8
UGC NET CSE | June 2014 | Part 3 | Question: 35
Consider a program that consists of $8$ pages (from $0$ to $7$) and we have $4$ ... including initial page faults to fill available page frames with pages) : $9$ and $6$ $10$ and $7$ $9$ and $7$ $10$ and $6$
Consider a program that consists of $8$ pages (from $0$ to $7$) and we have $4$ page frames in the physical memory for the pages. The page reference string is :$1\; 2\; 3...
1 votes
9
Which of the following is a valid word of the language?
Which of the following is a valid word of the language (1*(01*01*)*) U (0*(10*10*)*) ? 10110010101 1010101010 000101010000 001010001010
Which of the following is a valid word of the language (1*(01*01*)*) U (0*(10*10*)*) ?101100101011010101010000101010000001010001010
0 votes
10
Find given graph is planar, Hamiltonian or eulerian
The graph in the figure is a portion of the Shri Chakra. Is it : (1) a Planar graph ? (2) a Hamiltonian graph ? (3) an Eulerian graph ? (A) 1 and 2 (B) 2 and 3 (C) 1 and 3 (D) 1, 2 and 3
The graph in the figure is a portion of the Shri Chakra.Is it :(1) a Planar graph ?(2) a Hamiltonian graph ?(3) an Eulerian graph ?(A) 1 and 2(B) 2 and 3(C) 1 and 3(D) 1,...
0 votes
12
Asymptotic Notation
If f(n) = big_omega(n), g(n) = O(n) and h(n) = ⊙(n) then what is f(n).g(n) + h(n) ?
If f(n) = big_omega(n), g(n) = O(n) and h(n) = ⊙(n) then what is f(n).g(n) + h(n) ?
2 votes
13
ISRO2011-61
Three coins are tossed simultaneously. The probability that they will fall two heads and one tail is $5/8$ $1/8$ $2/3$ $3/8$
Three coins are tossed simultaneously. The probability that they will fall two heads and one tail is$5/8$$1/8$$2/3$$3/8$
0 votes
14
If
If f(n)=⊖(n) and g(n)=⊖(n) and h(n)=O(n3) then what is f(n).g(n)+h(n) ?
If f(n)=⊖(n) and g(n)=⊖(n) and h(n)=O(n3)then what is f(n).g(n)+h(n) ?
3 votes
15
ISRO2015-73
The output of the following program is main() { static int x[] = {1,2,3,4,5,6,7,8} int i; for (i=2; i<6; ++i) x[x[i]]=x[i]; for (i=0; i<8; ++i) printf("%d", x[i]); } 1 2 3 3 5 5 7 8 1 2 3 4 5 6 7 8 8 7 6 5 4 3 2 1 1 2 3 5 4 6 7 8
The output of the following program ismain() { static int x[] = {1,2,3,4,5,6,7,8} int i; for (i=2; i<6; ++i) x[x[i]]=x[i]; for (i=0; i<8; ++i) printf("%d", x[i]); }1 2 3 ...
2 votes
16
ISRO2015-30
Semaphores are used to solve the problem of Race Condition Process Synchronization Mutual Exclusion None of the above I and II II and III All of the above None of the above
Semaphores are used to solve the problem ofRace ConditionProcess SynchronizationMutual ExclusionNone of the aboveI and IIII and IIIAll of the aboveNone of the above
0 votes
17
Cpu operand fetch speed
How many cycles here indexed addressing mode will take?
How many cycles here indexed addressing mode will take?
1 votes
18
F1, F2, F3 are FD sets with FDs
Isn't F1 covering F3 and F3 covering F1
Isn't F1 covering F3 and F3 covering F1