Register
ISRO 2015 Computer Science Questions with Solution

Recent questions tagged isro2015

7 votes
3 answers
61
ISRO2015-62
The minimum time delay between the initiation of two independent memory operations is called Access time Cycle time Rotational time Latency time
The minimum time delay between the initiation of two independent memory operations is calledAccess timeCycle timeRotational timeLatency time
User Avatar
7 votes
5 answers
62
ISRO2015-68
Consider the following program fragment if(a > b) if(b > c) s1; else s2; s2 will be executed if a <= b b > c b >= c and a <= b a > b and b <= c
Consider the following program fragment if(a b) if(b c) s1; else s2;s2 will be executed ifa <= bb cb >= c and a <= ba b and b <= c
User Avatar
7 votes
3 answers
63
ISRO2015-72
Consider the following declaration: int a, *b=&a, **c=&b; The following program fragment a=4; **c=5; does not change the value of a assigns address of $c$ to $a$ assigns the value of $b$ to $a$ assigns $5$ to $a$
Consider the following declaration:int a, *b=&a, c=&b;The following program fragmenta=4; c=5;does not change the value of aassigns address of $c$ to $a$assigns the valu...
User Avatar
16 votes
3 answers
64
ISRO2015-18
Given a block can hold either $3$ records or $10$ key pointers. A database contains n records, then how many blocks do we need to hold the data file and the dense index $13n/30$ $n/3$ $n/10$ $n/30$
Given a block can hold either $3$ records or $10$ key pointers. A database contains n records, then how many blocks do we need to hold the data file and the dense index$1...
User Avatar
10 votes
2 answers
67
ISRO2015-12
A machine needs a minimum of $100$ sec to sort $1000$ names by quick sort. The minimum time needed to sort $100$ names will be approximately $50.2$ sec $6.7$ sec $72.7$ sec $11.2$ sec
A machine needs a minimum of $100$ sec to sort $1000$ names by quick sort. The minimum time needed to sort $100$ names will be approximately$50.2$ sec$6.7$ sec$72.7$ sec$...
User Avatar
31 votes
6 answers
70
GATE CSE 1995 | Question: 2.12, ISRO2015-9
The number of $1$'s in the binary representation of $(3\ast4096 + 15\ast256 + 5\ast16 + 3)$ are: $8$ $9$ $10$ $12$
The number of $1$'s in the binary representation of $(3\ast4096 + 15\ast256 + 5\ast16 + 3)$ are:$8$$9$$10$$12$
User Avatar
34 votes
3 answers
71
GATE CSE 1997 | Question: 3.10, ISRO2008-57, ISRO2015-64
Dirty bit for a page in a page table helps avoid unnecessary writes on a paging device helps maintain LRU information allows only read on a page None of the above
Dirty bit for a page in a page tablehelps avoid unnecessary writes on a paging devicehelps maintain LRU informationallows only read on a pageNone of the above
User Avatar
48 votes
2 answers
72
GATE CSE 1999 | Question: 1.14, ISRO2015-42
If one uses straight two-way merge sort algorithm to sort the following elements in ascending order: $20, \ 47, \ 15, \ 8, \ 9, \ 4, \ 40, \ 30, \ 12, \ 17$ ... $4, \ 8, \ 9, \ 15, \ 20, \ 47, \ 12, \ 17, \ 30, \ 40$
If one uses straight two-way merge sort algorithm to sort the following elements in ascending order: $20, \ 47, \ 15, \ 8, \ 9, \ 4, \ 40, \ 30, \ 12, \ 17$then the o...
User Avatar
35 votes
2 answers
73
GATE CSE 2005 | Question: 22, ISRO2015-36
Increasing the RAM of a computer typically improves performance because: Virtual Memory increases Larger RAMs are faster Fewer page faults occur Fewer segmentation faults occur
Increasing the RAM of a computer typically improves performance because:Virtual Memory increasesLarger RAMs are fasterFewer page faults occurFewer segmentation faults occ...
User Avatar
24 votes
6 answers
75
GATE CSE 2009 | Question: 7, ISRO2015-3
How many $32K \times 1$ RAM chips are needed to provide a memory capacity of $ 256K$ bytes? $8$ $32$ $64$ $128$
How many $32K \times 1$ RAM chips are needed to provide a memory capacity of $ 256K$ bytes?$8$$32$$64$$128$
User Avatar
31 votes
6 answers
76
GATE CSE 2004 | Question: 83, ISRO2015-40
The time complexity of the following C function is (assume $n > 0$) int recursive (int n) { if(n == 1) return (1); else return (recursive (n-1) + recursive (n-1)); } $O(n)$ $O(n \log n)$ $O(n^2)$ $O(2^n)$
The time complexity of the following C function is (assume $n 0$)int recursive (int n) { if(n == 1) return (1); else return (recursive (n-1) + recursive (n-1)); }$O(n)$$...
User Avatar
41 votes
7 answers
79
GATE CSE 2000 | Question: 1.18, ISRO2015-25
The number of tokens in the following C statement is printf("i=%d, &i=%x", i, &i); $3$ $26$ $10$ $21$
The number of tokens in the following C statement isprintf("i=%d, &i=%x", i, &i);$3$$26$$10$$21$
User Avatar
Page: