Register
Filter

Questions by sh!va

10 votes
3 answers
81
ISRO2017-21
A cache memory needs an access time of $30$ ns and main memory $150$ ns, what is average access time of CPU (assume hit ratio $= 80\%)?$ $60$ ns $30$ ns $150$ ns $70$ ns
A cache memory needs an access time of $30$ ns and main memory $150$ ns, what is average access time of CPU (assume hit ratio $= 80\%)?$$60$ ns$30$ ns$150$ ns$70$ ns
9 votes
2 answers
82
ISRO2017-20
Which interrupt in $8085$ Microprocessor is unmaskable? $\textsf{RST 5.5}$ $\textsf{RST 7.5}$ $\textsf{TRAP}$ Both (a) and (b)
Which interrupt in $8085$ Microprocessor is unmaskable?$\textsf{RST 5.5}$$\textsf{RST 7.5}$$\textsf{TRAP}$Both (a) and (b)
9 votes
2 answers
83
ISRO2017-19
The most appropriate matching for the following pairs : ... $\text{X-ii, Y-iii, Z-i}$ $\text{X-iii, Y-i, Z-ii}$ $\text{X-ii, Y-i, Z-iii}$
The most appropriate matching for the following pairs :$\begin{array}{clcl} \text{X.} & \text{Indirect Addressing} & \text{i.} & \text{Loop} \\ \text{Y.} & \text{Immedi...
11 votes
3 answers
84
ISRO2017-6
ACID properties of a transactions are Atomicity, consistency, isolation, database Atomicity, consistency, isolation, durability Atomicity, consistency, integrity, durability Atomicity, consistency, integrity, database
ACID properties of a transactions areAtomicity, consistency, isolation, databaseAtomicity, consistency, isolation, durabilityAtomicity, consistency, integrity, durability...
5 votes
3 answers
85
ISRO 2017-5
Which of the following concurrency control protocol ensures both conflict and free from deadlock? , Time stamp ordering 2 Phase locking Both (a) and (b) None of the above
Which of the following concurrency control protocol ensures both conflict and free from deadlock? ,Time stamp ordering2 Phase lockingBoth (a) and (b)None of the above
8 votes
3 answers
86
ISRO2017-3
Using Newton-Raphson method, a root correct to 3 decimal places of $x^3 - 3x -5 = 0$ 2.222 2.275 2.279 None of the above
Using Newton-Raphson method, a root correct to 3 decimal places of $x^3 - 3x -5 = 0$2.2222.2752.279None of the above
11 votes
4 answers
87
ISRO2017-9
The symmetric difference of sets $\text{A}=\{1,2, 3,4, 5, 6, 7, 8\}$ and $\text{B}= \{1, 3, 5, 6, 7,8,9\}$ is: $\{1, 3, 5, 6, 7,8\}$ $\{2, 4, 9\}$ $\{2, 4\}$ $\{1, 2, 3, 4, 5, 6, 7, 8, 9\}$
The symmetric difference of sets $\text{A}=\{1,2, 3,4, 5, 6, 7, 8\}$ and $\text{B}= \{1, 3, 5, 6, 7,8,9\}$ is:$\{1, 3, 5, 6, 7,8\}$$\{2, 4, 9\}$$\{2, 4\}$$\{1, 2, 3, 4, 5...
6 votes
3 answers
88
ISRO2017-8
Which symbol denote derived attributes in ER Model? Double ellipse Dashed ellipse Squared ellipse Ellipse with attribute name underlined
Which symbol denote derived attributes in ER Model?Double ellipseDashed ellipseSquared ellipseEllipse with attribute name underlined
9 votes
2 answers
89
ISRO2017-7
... Employee, Department from Overtime_allowance) natural join (select Department, OT_allowance from Overtime_allowance) as T); $16$ $4$ $8$ None of the above
$\begin{array}{|l|l|l|l|l|} \hline \textbf{Employee} & \textbf{Department} & \textbf{OT_allowance} \\ \hline \text{RAMA} & \text{Mechanical} & \text{5000} \\\hline \text{...
10 votes
5 answers
90
ISRO2017-15
Which one of the following in-place sorting algorithms needs the minimum number of swaps? Insertion Sort Quick Sort Heap Sort Selection Sort
Which one of the following in-place sorting algorithms needs the minimum number of swaps?Insertion SortQuick SortHeap SortSelection Sort
11 votes
3 answers
92
ISRO2017-1
If $\text{A}$ is a skew symmetric matrix then $\text{A}^t$ is Diagonal matrix $\text{A}$ $0$ $-\text{A}$
If $\text{A}$ is a skew symmetric matrix then $\text{A}^t$ isDiagonal matrix $\text{A}$$0$$-\text{A}$
7 votes
3 answers
93
ISRO2017-4
What does a data dictionary will identify? Field name Field format Field types All of the above
What does a data dictionary will identify?Field nameField formatField typesAll of the above
5 votes
3 answers
94
ISRO2017-76
Which of the following algorithms solves the all pair shortest path problem? Prim's algorithm Dijkstra's algorithm Bellman ford algorithm Floyd warshalls algorithm
Which of the following algorithms solves the all pair shortest path problem?Prim's algorithmDijkstra's algorithmBellman ford algorithmFloyd warshalls algorithm
14 votes
4 answers
95
ISRO 2017-79
The output of a lexical analyzer is A parse tree Intermediate code Machine code A stream of tokens
The output of a lexical analyzer isA parse treeIntermediate codeMachine codeA stream of tokens
5 votes
2 answers
96
ISRO2017-75
Choose the most appropriate HTML tag in the following to create a numbered list <dl> <list> <ul> <ol>
Choose the most appropriate HTML tag in the following to create a numbered list<dl><list><ul><ol>
5 votes
2 answers
97
ISRO2017-71
At a particular time the value of counting semaphore is 10. It will become 7 after: 3 V operations 3 P operations 5 V operations and 2 P operations 2 V operations and 5 P operations
At a particular time the value of counting semaphore is 10. It will become 7 after:3 V operations3 P operations5 V operations and 2 P operations2 V operations and 5 P ope...
6 votes
2 answers
98
ISRO2017-16
Given two statements Insertion of an element should be done at the last node of the circular list Deletion of an element should be done at the last node of the circular list Both are true Both are false First is false and second is true None of the above
Given two statementsInsertion of an element should be done at the last node of the circular listDeletion of an element should be done at the last node of the circular lis...
12 votes
2 answers
99
ISRO2017-18
How many $128\times 8$ bit RAMs are required to design $32\;\text{K}\times 32$ bit RAM? $512$ $1024$ $128$ $32$
How many $128\times 8$ bit RAMs are required to design $32\;\text{K}\times 32$ bit RAM?$512$$1024$$128$$32$
4 votes
4 answers
100
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
Page: