Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
all questions of ISRO 2011 question paper
Recent questions tagged isro2011
3
votes
2
answers
61
ISRO2011-22
A system is having $8\;\text{M}$ bytes of video memory for bit-mapped graphics with $64$-bit colour. What is the maximum resolution it can support? $800 \times 600$ $1024 \times 768$ $1280 \times 1024$ $1920 \times 1440$
A system is having $8\;\text{M}$ bytes of video memory for bit-mapped graphics with $64$-bit colour. What is the maximum resolution it can support?$800 \times 600$$1024 \...
ksvidhya
4.9k
views
ksvidhya
asked
Jun 13, 2016
Computer Peripherals
isro2011
computer-peripherals
+
–
4
votes
1
answer
62
ISRO2011-23
What is the meaning of $\overline{\textsf{RD}}$ signal in Intel $\textsf{8151A}?$ Read (when it is low) Read (when it is high) Write (when it is low) Read and Write (when it is high)
What is the meaning of $\overline{\textsf{RD}}$ signal in Intel $\textsf{8151A}?$Read (when it is low)Read (when it is high)Write (when it is low)Read and Write (when it ...
ksvidhya
2.3k
views
ksvidhya
asked
Jun 12, 2016
Computer Peripherals
isro2011
non-gate
computer-peripherals
+
–
8
votes
1
answer
63
ISRO2011-56
Let $T(n)$ be defined by $T(1) =10$ and $T(n+1)=2n+T(n)$ for all integers $n \geq 1$. Which of the following represents the order of growth of $T(n)$ as a function of $n$? $O(n)$ $O(n \log n)$ $O(n^2)$ $O(n^3)$
Let $T(n)$ be defined by $T(1) =10$ and $T(n+1)=2n+T(n)$ for all integers $n \geq 1$. Which of the following represents the order of growth of $T(n)$ as a function of $n...
shivanisrivarshini
11.7k
views
shivanisrivarshini
asked
May 31, 2016
Algorithms
isro2011
algorithms
time-complexity
recurrence-relation
+
–
5
votes
2
answers
64
ISRO2011-65
The Cyclomatic Complexity metric V(G) of the following control flow graph 3 4 5 6
The Cyclomatic Complexity metric V(G) of the following control flow graph3456
jaiganeshcse94
4.4k
views
jaiganeshcse94
asked
May 30, 2016
IS&Software Engineering
isro2011
is&software-engineering
cyclomatic-complexity
+
–
8
votes
4
answers
65
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
jaiganeshcse94
22.9k
views
jaiganeshcse94
asked
May 27, 2016
Operating System
isro2011
operating-system
paging
virtual-memory
+
–
7
votes
3
answers
66
ISRO2011-6
Evaluate $\text{(X xor Y) xor Y}?$ All $\text{1's}$ All $\text{0's}$ $\text{X}$ $\text{Y}$
Evaluate $\text{(X xor Y) xor Y}?$All $\text{1's}$All $\text{0's}$$\text{X}$$\text{Y}$
amarVashishth
6.7k
views
amarVashishth
asked
Oct 11, 2015
Digital Logic
isro2011
digital-logic
boolean-algebra
+
–
11
votes
2
answers
67
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
amarVashishth
5.7k
views
amarVashishth
asked
Oct 11, 2015
CO and Architecture
isro2011
co-and-architecture
addressing-modes
+
–
4
votes
2
answers
68
ISRO2011-69
Lightweight Directory Access protocol is used for Routing the packets Authentication obtaining IP address domain name resolving
Lightweight Directory Access protocol is used forRouting the packetsAuthenticationobtaining IP addressdomain name resolving
ajit
2.6k
views
ajit
asked
Oct 1, 2015
Computer Networks
isro2011
computer-networks
network-protocols
+
–
3
votes
2
answers
69
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
ajit
7.0k
views
ajit
asked
Oct 1, 2015
Algorithms
isro2011
algorithms
searching
+
–
6
votes
3
answers
70
ISRO2011-1
The encoding technique used to transmit the signal in giga ethernet technology over fiber optic medium is Differential Manchester encoding Non return to zero $\text{4B/5B}$ encoding $\text{8B/10B}$ encoding
The encoding technique used to transmit the signal in giga ethernet technology over fiber optic medium isDifferential Manchester encodingNon return to zero$\text{4B/5B}$...
ajit
5.5k
views
ajit
asked
Oct 1, 2015
Computer Networks
computer-networks
isro2011
communication
+
–
10
votes
3
answers
71
ISRO2011-11
How many distinct binary search trees can be created out of $4$ distinct keys? $5$ $14$ $24$ $35$
How many distinct binary search trees can be created out of $4$ distinct keys?$5$$14$$24$$35$
ajit
10.3k
views
ajit
asked
Oct 1, 2015
DS
isro2011
data-structures
binary-search-tree
combinatory
+
–
5
votes
2
answers
72
ISRO2011-29
Which normal form is based on the concept of 'full functional dependency' is First Normal Form Second Normal Form Third Normal Form Fourth Normal Form
Which normal form is based on the concept of 'full functional dependency' isFirst Normal FormSecond Normal FormThird Normal FormFourth Normal Form
ajit
4.7k
views
ajit
asked
Oct 1, 2015
Databases
isro2011
databases
database-normalization
+
–
9
votes
6
answers
73
ISRO2011-32
In which layer of network architecture, the secured socket layer (SSL) is used? physical layer session layer application layer presentation layer
In which layer of network architecture, the secured socket layer (SSL) is used?physical layersession layerapplication layerpresentation layer
ajit
6.5k
views
ajit
asked
Oct 1, 2015
Computer Networks
isro2011
computer-networks
network-security
network-layering
+
–
4
votes
3
answers
74
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
ajit
4.7k
views
ajit
asked
Oct 1, 2015
CO and Architecture
isro2011
co-and-architecture
cache-memory
+
–
4
votes
6
answers
75
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 ...
ajit
5.9k
views
ajit
asked
Oct 1, 2015
CO and Architecture
isro2011
co-and-architecture
cpu
+
–
10
votes
5
answers
76
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$
ajit
4.3k
views
ajit
asked
Sep 24, 2015
Graph Theory
isro2011
graph-theory
graph-connectivity
+
–
16
votes
2
answers
77
GATE IT 2004 | Question: 11, ISRO2011-33
What is the bit rate of a video terminal unit with $80$ characters/line, $8$ $\text{bits/character}$ and horizontal sweep time of $100$ $\text{µs}$ (including $20$ $\text{µs}$ of retrace time)? $8$ $\text{Mbps}$ $6.4$ $\text{Mbps}$ $0.8$ $\text{Mbps}$ $0.64$ $\text{Mbps}$
What is the bit rate of a video terminal unit with $80$ characters/line, $8$ $\text{bits/character}$ and horizontal sweep time of $100$ $\text{µs}$ (including $20$ $\tex...
Ishrat Jahan
8.1k
views
Ishrat Jahan
asked
Nov 1, 2014
Operating System
gateit-2004
operating-system
io-handling
easy
isro2011
+
–
41
votes
6
answers
78
GATE IT 2007 | Question: 6, ISRO2011-25
A processor takes $12$ cycles to complete an instruction I. The corresponding pipelined processor uses $6$ stages with the execution times of $3, 2, 5, 4, 6$ and $2$ cycles respectively. What is the asymptotic speedup assuming that a very large number of instructions are to be executed? $1.83$ $2$ $3$ $6$
A processor takes $12$ cycles to complete an instruction I. The corresponding pipelined processor uses $6$ stages with the execution times of $3, 2, 5, 4, 6$ and $2$ cycl...
Ishrat Jahan
13.5k
views
Ishrat Jahan
asked
Oct 29, 2014
CO and Architecture
gateit-2007
co-and-architecture
pipelining
normal
isro2011
+
–
34
votes
5
answers
79
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$
Kathleen
21.5k
views
Kathleen
asked
Sep 21, 2014
Digital Logic
gatecse-2007
digital-logic
normal
isro2011
decoder
+
–
39
votes
4
answers
80
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
Rucha Shelke
25.6k
views
Rucha Shelke
asked
Sep 17, 2014
Algorithms
gatecse-2006
algorithms
sorting
easy
isro2011
+
–
Page:
« prev
1
2
3
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register