ISRO Scientist or Engineer Computer Science 2009

In which addressing mode,the effectives address of the operand is generated by adding a constantvalue to the content of a register?

A certain microprocessor requires 4.5 microseconds to respond to an interrupt. Assuming that the three interrupts $$ I_1, I_2$$ and $$I_3 $$ require the following execution time after the interrupt is recognized :
(i) $$ I_1 $$ requires 25 micro seconds
(ii) $$ I_2 $$ requires 35 microseconds
(iii) $$ I_3 $$ requires 20 microseconds
$$ I_1 $$ has the highest priority and $$ I_3 $$ has the lowest. What is the possible range of time for $$ I_3 $$ to be executed assuming that it may or may not occur simultaneously with other interrupts?

The processof organizing the memory into two banksto allow 8- and 16- bit data operation is called

Suppose the numbers 7, 5, 1, 8, 3, 6, 0, 9, 4, 2 are inserted in that order into an initially empty binary search tree. The binary search tree uses the usual ordering on natural numbers. What is the inorder traversal sequenceof the resultant tree?

A data structure is required for storing a set of integers such that each of the following operations can be done in (log n) time, where n is the number of elementsin the set.
1. Deletion of the smallest element.
2. Insertion of an element if it is not already present in the set.
Whichof the following data structures can be used for this purpose?

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)?

Assume that the operators $$ +, -, \times $$ are left associative and ^ is right associative. The order of precedence (from highest to lowest) is ^, $$ \times , +, -.$$ The postfix expression corresponding to the infix expression $$ a + b \times c - d$$ ^ e ^ f is

The infix expression A + (B — C)* D is correctly represented in prefix notation as

A one dimensionalarray A has indices 1.... 75. Each element is a string and takes up three memory words. The arrayis stored at location 1120 decimal. The starting addressof A [49] is

Thefive items: A, B, C, D, and E are pushed in a stack, one after the other starting from A. The stack is popped four times and each elementis inserted in a queue. Then two elements are deleted from the queue and pushed back on the stack. Now one item is popped from the stack. The popped item is