Register

Search results for isro2011

39 votes
4 answers
1
GATE CSE 2006 | Question: 14, ISRO2011-14
Which one of the following in place sorting algorithms needs the minimum number of swaps? Quick sort Insertion sort Selection sort Heap sort
Which one of the following in place sorting algorithms needs the minimum number of swaps?Quick sortInsertion sortSelection sortHeap sort
User Avatar
9 votes
3 answers
2
ISRO2011-62
The average depth of a binary search tree is $O(n^{0.5})$ $O(n)$ $O(\log n)$ $O(n \log n)$
The average depth of a binary search tree is$O(n^{0.5})$$O(n)$$O(\log n)$$O(n \log n)$
User Avatar
34 votes
5 answers
3
GATE CSE 2007 | Question: 8, ISRO2011-31
How many $3$-to-$8$ line decoders with an enable input are needed to construct a $6$-to-$64$ line decoder without using any other logic gates? $7$ $8$ $9$ $10$
How many $3$-to-$8$ line decoders with an enable input are needed to construct a $6$-to-$64$ line decoder without using any other logic gates?$7$$8$$9$$10$
User Avatar
6 votes
3 answers
4
ISRO2011-74
In an $RS$ flip-flop, if the $S$ line (Set line) is set high ($1$) and the $R$ line (Reset line) is set low ($0$), then the state of the flip-flop is : Set to $1$ Set to $0$ No change in state Forbidden
In an $RS$ flip-flop, if the $S$ line (Set line) is set high ($1$) and the $R$ line (Reset line) is set low ($0$), then the state of the flip-flop is :Set to $1$Set to $0...
User Avatar
6 votes
4 answers
5
ISRO2011-79
A problem whose language is recursion is called? Unified problem Boolean function Recursive problem Decidable
A problem whose language is recursion is called?Unified problemBoolean functionRecursive problemDecidable
User Avatar
8 votes
4 answers
6
ISRO2011-24
If the page size in a 32-bit machine is 4K bytes then the size of page table is 1 M bytes 2 M bytes 4 M bytes 4 K bytes
If the page size in a 32-bit machine is 4K bytes then the size of page table is1 M bytes2 M bytes4 M bytes4 K bytes
User Avatar
4 votes
4 answers
8
ISRO2011-26
The in-order traversal of a tree resulted in FBGADCE. Then the pre-order traversal of that tree would result in FGBDECA ABFGCDE BFGCDEA AFGBDEC
The in-order traversal of a tree resulted in FBGADCE. Then the pre-order traversal of that tree would result inFGBDECAABFGCDEBFGCDEAAFGBDEC
User Avatar
7 votes
4 answers
9
ISRO2011-16
Consider a direct mapped cache with $64$ blocks and a block size of $16$ bytes. To what block number does the byte address $1206$ map to does not map $6$ $11$ $54$
Consider a direct mapped cache with $64$ blocks and a block size of $16$ bytes. To what block number does the byte address $1206$ map todoes not map$6$$11$$54$
User Avatar
5 votes
5 answers
11
ISRO2011-40
Consider the following pseudocode x:=1; i:=1; while ( x <= 500) begin x:=2^x; i:=i+1; end What is the value of $\textsf{i}$ at the end of the pseudocode? $4$ $5$ $6$ $7$
Consider the following pseudocodex:=1; i:=1; while ( x <= 500) begin x:=2^x; i:=i+1; endWhat is the value of $\textsf{i}$ at the end of the pseudocode?$4$$5$$6$$7$
User Avatar
11 votes
4 answers
13
ISRO2011-39
Two control signals in microprocessor which are related to Direct Memory Access (DMA) are $\textsf{INTR & INTA}$ $\textsf{RD & WR}$ $\textsf{S0 & S1}$ $\textsf{HOLD & HLDA}$
Two control signals in microprocessor which are related to Direct Memory Access (DMA) are$\textsf{INTR & INTA}$$\textsf{RD & WR}$$\textsf{S0 & S1}$$\textsf{HOLD & HLDA}$
User Avatar
4 votes
6 answers
14
ISRO2011-41
If a microcomputer operates at $5$ MHz with an $8$-bit bus and a newer version operates at $20$ MHz with a $32$-bit bus, the maximum speed-up possible approximately will be $2$ $4$ $8$ $16$
If a microcomputer operates at $5$ MHz with an $8$-bit bus and a newer version operates at $20$ MHz with a $32$-bit bus, the maximum speed-up possible approximately will ...
User Avatar
3 votes
2 answers
15
ISRO2011-70
Number of comparisons required for an unsuccessful search of an element in a sequential search organized, fixed length, symbol table of length L is L L/2 (L+1)/2 2L
Number of comparisons required for an unsuccessful search of an element in a sequential search organized, fixed length, symbol table of length L isLL/2(L+1)/22L
User Avatar
11 votes
2 answers
16
ISRO2011-5
$\textsf{MOV [BX], AL}$ type of data addressing is called? register immediate register indirect register relative
$\textsf{MOV [BX], AL}$ type of data addressing is called?registerimmediateregister indirectregister relative
User Avatar
10 votes
5 answers
17
ISRO2011-35
How many edges are there in a forest with $v$ vertices and $k$ components? $(v+1) - k$ $(v+1)/2 - k$ $v - k$ $v + k$
How many edges are there in a forest with $v$ vertices and $k$ components?$(v+1) - k$$(v+1)/2 - k$$v - k$$v + k$
User Avatar
4 votes
3 answers
18
ISRO2011-42
The search concept used in associative memory is Parallel search Sequential search Binary search Selection search
The search concept used in associative memory isParallel searchSequential searchBinary searchSelection search
User Avatar
4 votes
5 answers
19
ISRO2011-58
In DMA transfer scheme, the transfer scheme other than burst mode is cycle technique stealing technique cycle stealing technique cycle bypass technique
In DMA transfer scheme, the transfer scheme other than burst mode iscycle techniquestealing techniquecycle stealing techniquecycle bypass technique
User Avatar
5 votes
4 answers
20
ISRO2011-46
Which $\textsf{RAID}$ level gives block level striping with double distributed parity? $\textsf{RAID 10}$ $\textsf{RAID 2}$ $\textsf{RAID 6}$ $\textsf{RAID 5}$
Which $\textsf{RAID}$ level gives block level striping with double distributed parity?$\textsf{RAID 10}$$\textsf{RAID 2}$$\textsf{RAID 6}$$\textsf{RAID 5}$
User Avatar
Page: