Cent Percent

 

Computer Science Mock Test & Sample Paper for ISRO – 2

This is second test in this series. This Online Test is based on the expected syllabus for ISRO Scientist/Engineer Recruitment Exam.

Friday, March 27th, 2009 4:27 pm

isroISRO (Indian Space Research Organization) Scientist/Engineers Recruitment
Sample Paper for Computer Science (IT) – 2

This second Sample Paper in this series. It is based on the expected syllabus for ISRO Scientist/Engineer Recruitment Exam.

Candidates may get an idea about what to read for the Computer Science / IT Stream Examination.

This test contains30 questions. Try to finish off this test in 30 minutes.

This test will run like a quiz. The result and correct answers will be shown at the end of the test.

Please wait while the online test loads.

The goal of structured programming is to





Consider the following C function vaid swap (int a, int b) { int temp ; temp = a ; a= b; b=temp; } In order to exchange the values of two variables x and y.





A single array A [1..MAXSIZE] is used to implement two stacks. The two stacks grow from opposite ends of the array. Variables top 1 and top 2 (top1 < top 2) point to the location of the topmost element in each of the stacks. If the space is to be used efficiently, the condition for "stack full" is





The following numbers are inserted into an empty binary search tree in the given order: 10,1, 3, 5,15,12,16. What is the height of the binary search tree (the height is the maximum distance of a leaf node from the root) ?





The best data structure to check whether an arithmetic expression has balanced parentheses is a * n





Level order traversal of a rooted tree can be done by starting from the root and performing





Given the following input (4322,1334,1471, 9679,1989, 6171, 6173, 4199) and the hash function x mod 10, which of the following statements are true ?

(i) 9679, 1989, 4199 hash to the same value
(ii) 1471, 6171 hash to the same value
(iii) All elements hash to the same value
(iv) Each element hashes to a different value





Which of the following grammar rules violate the requirements of an operator grammar ? P, Q, R are nonterminals, and r, s, t are terminals.

(i)P → Q R - (ii) P → Q s R
(iii) P → e (iv) P → QtRr





Consider a program P that consists of two source modules Mt and Mg contained in two different files. If Mt contains a reference to a function defined in the reference^ will be resolved at





Consider the grammar rule E → Et - E2 for arithmetic expressions. The code generated is targeted to a CPU having a single user register. The subtraction operation requires the first operand to be in the register. If Et and E do not have any common subexpression, in order to get the shortest possible code





Consider the following statements with respect to user-level threads and kernel-supported threads

(i) Context switch is faster with kernel-supported threads
(ii) For user-level threads, a system call can block the entire process (Hi) Kernel-supported threads can be scheduled independently
(iv) User-level threads are transparent to the kernel Which of the above statements are true





Consider an operating system capable of loading and executing a single sequential user process at a time. The disk head scheduling algorithm used is First Come First Served (FCFS). If FCFS is replaced by Shortest Seek Time First (SSTF), claimed by the vendor to give 50% better benchmark results, what is the expected improvement in the I/O performance of user programs ?





Consider the following relation schema pertaining to a students database:

Student (rollno, name, address)
Enroll (rollno , courseno. Coursename)

where the primary keys are shown underlined. The number of tuples in the Student and Enroll tables are 120 and 8 respectively. What are the maximum and minimum number of tuples that can be present in (Student * Enroll), where '*' denotes natural join ?





Choose the best matching between Group 1 and Group 2.

Group -1

Group - 2

P. Data link layer

Q. Network layer

R. Transport layer

1. Ensures reliable transport of data over a physical point-to-point link

2. Encodes/decodes data for physical transmission

3. Allows end-to-end communication between two processes

4. Routes data from one network node to the next





Which of the following is NOT true with respect to a transparent bridge and a router ?





The Boolean function x'y' + xy + x'y is equivalent to





In an SR latch made by cross-coupling two NAND gates, if bath S and R inputs are set to 0, then it will result in





if 73x (in base-x number system) is equal to 54y (in base-y number system), the possible values of x and y are





Which of the following addressing modes are suitable for program relocation at run time ? (i) Absolute addressing (ii) Based addressing (iii) Relative addressing (iv) Indirect addressing





The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined by





How many 8-bit characters can be transmitted per second over a 9600 baud serial communication link using asynchronous mode of transmission with one start bit, eight data bits, two stop bits, and one parity bit ?





Consider the binary relation:

S = {(x,y) | y>x + l and x, y ε {0, 1, 2, ...}}
The reflexive transitive closure of S is





If a fair coin is tossed four times. What is the probability that two heads and two tails will result ?





The number of different n x n symmetric matrices with each element being either 0 or 1 is: (Note: power(2, x) is same as 2X)





Let A, B, C, D be n x n matrices, each with non-zero determinant. If ABC I) = I, then B~' is





What is the result of evaluating the following two expressions using three-digit floating point arithmetic with rounding ?
(113. + -111.) + 7.51
113. + (-111. + 7.51)





The problems 3-SAT and 2-SAT are





90 Carry Two Marks Each 31. Consider the following C function:
int f (int n)
{ static int i 1;
if (n >b 5) return n ;
n = n+i;
i++;
return f (n);
}
The value returned by f(l) is





Suppose each set is represented as a linked list with elements in arbitrary order. Which of the operations among union, intersection, membership, cardinality will be the slowest ?





The order of an internal node in a B* tree index is the maximum number of children it can have. Suppose that a child pointer takes 6 bytes, the search field value takes 14 bytes, and the block size is 512 bytes. What is the order of the internal node ?








If you like this site, please recomment it to your friends. This site is 100% free. Please help us to keep it free.

Disclaimer: We do not take any responsibility of the accuracy of the information provided on this site. You are requested to verify and confirm the final details from the concerned company or department.


«
»
Comments (12)

  • Nishant March 28, 2009 at 1:16 pm

    the test is quite helpful. i want to practice more so waiting for some more tests to get uploaded.

  • jasbir March 28, 2009 at 2:04 pm

    very basic questions. good attempt.

  • ishita March 29, 2009 at 1:39 pm

    its quite helpful. but i wanna know more about general awareness

  • Manish March 31, 2009 at 12:59 am

    Excellent!!! if any more mock test is available ,do share with us…

  • admin March 31, 2009 at 1:03 am

    Two more will be uploaded in next 24-48 hours. We are working on it. Thanks for your comments, glad you liked it. Please do spread the word as much as you can.

  • rohit kumar April 12, 2009 at 2:33 am

    that was great.i enjoyed every problem.full creadit for givin this type of materil.i’ll be in the hunt of cracking some more like this.please update soon.

  • srikanth April 18, 2009 at 1:12 pm

    this is a very evaluative test that lets us know our standard and areas to improve….just magnificient

  • shivani April 20, 2009 at 9:00 pm

    commendable effort.. thankx for keepin it free..

  • veerasekaran April 21, 2009 at 4:26 pm

    it’s very usefull for me
    thanks for digg

  • prasanna April 24, 2009 at 8:05 pm

    its very useful. upload more questions. Thanks!!!

  • man June 20, 2009 at 8:31 pm

    tell me some thing more about to this course
    it is great deal to aware ness

  • Manish Kherde November 21, 2009 at 11:45 am

    I want to know exam date for the post “Ast Programmer” and syllabus for technical preparation.

Add comment

Latest Posts

rssRss Feed

Popular Posts