Placement Papers - ISRO
ISRO PAPER
Posted by :
Rajkiran
(46)
Hi Friends
Discipline : Computer Science
Total no of questions: 80
Duration: 90 minutes
Marking: +3 for correct answer -1 for wrong
Total sections : 1
Mode : Offcampus
Discipline Wise Questions
--------------------------
Questions on
PASCAL code
Networking
Binary Tree
Stack & Queue concept
GateS (AND OR NAND NOR XOR...)
Full adder / subtrecter ckt
Data structure basics
C funda
Page fault and other computer architech. fundamentals
Internet basics
Sin Cosine waves based questions
1. The root directory of disk should be placed at___
2. DNS is basically used to ____
3. one more ques on DNS
4. abt TCP and UDP
5. TCP\'s which layer is there for the OSI\'s first three layers.
6. Multiprocessing models have---
a)symmetric
b)unsymmetric models
c)none of the above
d) both
7. BCD have binary nos in
a)bis b) bytes c)nibble
8. Top-down parser ....
a) leftmost derivation
b)rightmost derivation
c)leftmost derivation in reverse
d)rightmost derivation in reverse
9. Loop which avoids check at every iteration
a) loop controlling
b) loop jamming
10. one tree was given and some expressions were there and we have to find the correct postfix exprn
11. abt logic gates
12. worst case of Shell sort
13. sine wave can be split into
a)set of sine waves
b)set of sine waves with phase zero
14. Full binary tree with n vertices has how many leaf nodes somethng like this...
15. Complete graph with n vertices and somethng
16. in a cyclic graph with n vertices how many minimum edges
a)n b)n/2...
17. The minimum number of edges in a connected cyclic graph on n vertices is
a) n-1 b) n c) n+1 d)none of these
18. A full binary tree with n non leaf nodes contains
a) n nodes b) log n nodes c)2n-1 nodes d)2n nodes
19. The time complexity of shell sort
a) O(n) b) O(log n) c) O(n 1.2 ) d)O(n2)
20. The time taken to insert an element after an element pointed by some pointer
a) O(1) b) O(log n) c) O(n) d) O(nlogn)
21. what is the name given to the first generation computer?
a) Binary language b)Machine language c)Assembly language
22. The root directory of a disk should be placed
a) at a fixed address in main memory
b) at a fixed location on disk
c) anywhere on disk.
23. A top down parser generates
a) right most derivation
b) left most derivation
c) right most derivation in reverse
d) left most derivation in reverse
24. what is the name of the OS that reads and reacts in terms of actual time?
a)batch system
b)time sharing
c)real time
25. FDDI is a
a)ring network
b)star network
c)mesh network
26. Computer memory consists of
a)ROM
b)PROM
c)RAM
d)all the above
Discipline : Computer Science
Total no of questions: 80
Duration: 90 minutes
Marking: +3 for correct answer -1 for wrong
Total sections : 1
Mode : Offcampus
Discipline Wise Questions
--------------------------
Questions on
PASCAL code
Networking
Binary Tree
Stack & Queue concept
GateS (AND OR NAND NOR XOR...)
Full adder / subtrecter ckt
Data structure basics
C funda
Page fault and other computer architech. fundamentals
Internet basics
Sin Cosine waves based questions
1. The root directory of disk should be placed at___
2. DNS is basically used to ____
3. one more ques on DNS
4. abt TCP and UDP
5. TCP\'s which layer is there for the OSI\'s first three layers.
6. Multiprocessing models have---
a)symmetric
b)unsymmetric models
c)none of the above
d) both
7. BCD have binary nos in
a)bis b) bytes c)nibble
8. Top-down parser ....
a) leftmost derivation
b)rightmost derivation
c)leftmost derivation in reverse
d)rightmost derivation in reverse
9. Loop which avoids check at every iteration
a) loop controlling
b) loop jamming
10. one tree was given and some expressions were there and we have to find the correct postfix exprn
11. abt logic gates
12. worst case of Shell sort
13. sine wave can be split into
a)set of sine waves
b)set of sine waves with phase zero
14. Full binary tree with n vertices has how many leaf nodes somethng like this...
15. Complete graph with n vertices and somethng
16. in a cyclic graph with n vertices how many minimum edges
a)n b)n/2...
17. The minimum number of edges in a connected cyclic graph on n vertices is
a) n-1 b) n c) n+1 d)none of these
18. A full binary tree with n non leaf nodes contains
a) n nodes b) log n nodes c)2n-1 nodes d)2n nodes
19. The time complexity of shell sort
a) O(n) b) O(log n) c) O(n 1.2 ) d)O(n2)
20. The time taken to insert an element after an element pointed by some pointer
a) O(1) b) O(log n) c) O(n) d) O(nlogn)
21. what is the name given to the first generation computer?
a) Binary language b)Machine language c)Assembly language
22. The root directory of a disk should be placed
a) at a fixed address in main memory
b) at a fixed location on disk
c) anywhere on disk.
23. A top down parser generates
a) right most derivation
b) left most derivation
c) right most derivation in reverse
d) left most derivation in reverse
24. what is the name of the OS that reads and reacts in terms of actual time?
a)batch system
b)time sharing
c)real time
25. FDDI is a
a)ring network
b)star network
c)mesh network
26. Computer memory consists of
a)ROM
b)PROM
c)RAM
d)all the above
Quick links
Quantitative Aptitude
Verbal (English)
Reasoning
Programming
Interview
Placement Papers