Placement Papers: FutureSoft Placement Paper 24 August 2003

Download PDF of This Page (Size: 153K)

Examrace Placement Series prepares you for the toughest placement exams to top companies.

40 min-30 Questions

Correct ans 3 marks

Wrong ans-1 mark

There were 3 or 4 different sets of questions

This is my version of questions (this is based on only a vague memory of mine and i would request any of the members who attended the test and who remember, to contribute any correction or improvisation to the questions)

  1. S > AB | AS A > a | aA B > b What is the grammar accepted by the above?

  2. Given a string STOCK and a stack of size 4. Which of the following strings cannot be generated using this stack.

    1. TSOCK

    2. TOSKC

    3. STOCK

    4. TKOSC

  3. Where are the following variables stored Automatic Global Static

    1. Heap, Stack, Heap

    2. Stack, Heap, Heap

    3. Heap, Heap, Stack

    4. None of these

    Answer: d

  4. What is the greatest disadvantage of dynamic RAM over static RAM Ans. Capacitor needs to refresh every 2 ms.

  5. What happens when the CPU gets interrupted?

    1. Performs ISR immediately

    2. releases the memory and data bus for the interrupting process

    3. Finishes the current instruction and performs ISR

    4. gets halted

  6. The s/n id 3 dB and freq is 300hz. Find the capacity of the line.

    1. 100

    2. 150

    3. 300

    4. 200

    5. None of these

  7. How much infomation can be stored between fffh-f00h address space.

    1. 1024 bytes

    2. 2048 bytes

    3. 4096 bytes

    4. None of these

    Answer: d

  8. void main () { int ari[] = { 1, 2, 3, 4, 5}; char arc[] = { ‘a’ ‘b’ ‘c’ ‘d’ ‘e’ }; printf (%d %d, &ari[4]-&ari[2], &arc[3]-&arc[0]); } Ans → 2 3

  9. Find the POS form of the expression given below X (bar). Y (bar). Z (bar) + X. Y. Z + X (Y + Z).

  10. The binary equivalent of 3B7F is Ans. 0011 1011 0111 1111

  11. A microprogram can be defines as to consist of Ans. A primitive operation

  12. A drum rotates at 4000 rpm. What is its average access time.

  13. What range of integral values can be stored using 32 bits?

  14. e = | < (e-e) > | then

    1. It is ambigous

    2. generates all the arithemetic expressions for addition, subtraction and multiplication

    3. It is non inherently ambigous

    4. None of the above

  15. the sorting algorithm that requires maximum comparisons when in sorted order and minimum comparisons when in reverse order?

    1. straight insertion sort

    2. binary insertion sort

    3. heap sort

    4. bubble sort

  16. A graph is represented as an adjacency list with n vertices and e edges What is its time complexity

  17. A variable in a function cannot be accessed outside the function, why (think the question is like this)?

    1. garbage collection

    2. because it exists in swap area of memory

    3. it gets popped out of the stack

  18. How many addresses are possible with 512 64kb segments?

  19. A question on pages and pagetables, i think to find the wrong statement of the given

    1. small pages implies large page tables

    2. larger pages implies i/o operations efficiency

    (don't remember the rest of the options, though the answer lies there)

  20. A reference string was given and using LRU page replacement algorithm we were asked to find the state of the memory during 3rd page fault, the memory size being 3 pages.

  21. A finite automaton was given and we were asked to find the expression that represented the language that could be accepted by the finite automaton

  22. There was a question on networks given a set of data like 5 byte header for network layer and maximum data allowed 110 bytes similar data for 2 other layers question was to find the actual number of bytes send if the data size was bytes under conditions like no separate acknowledgement frames required, etc.

  23. there was a program given on an array of unsigned integers and i think the answer was that the program was to find the largest and second largest of the elements in an array.

  24. John and Jacob are assigned the tasks of writing main () and a function funct (X, Y) in Pascal. Where will there be conflicts between the two?

    1. the position of main and function

    2. the type of function

    3. the number of times the function is called

    4. in the paramters (I'm not sure abt the options)

  25. there was question on why h/w translation was required for memory relocation (pretty easy one, don't remember the options)?

  26. to find the prefix of (a + b) * (c-d)

  27. #include void main () { int i, x = 4, sum = 0; int arr[6] = [1, 2, 3, 4, 5, 6] for (i = 0; i<4; i + + ) sum + = func (arr); printf ( “%d” sum); } func (int x) { int val, x; val = 2; return (x + val + + ); } (there was another twist in the question about a static declaration in the function, though i cannot recollect) f

  28. With a 2 line x decoder and 2 line y decoder how many address lines could be decoded with two dimensional addressing?

    1. 4

    2. 16

    3. 32

    4. 64

Another Version

  1. Output of folowing C code void main () { int i = 4, j = 5; printf ( “%f” i/j); }

    1. 0

    2. 0.8

    3. 1

    4. None of these

    Answer: d

  2. In which of the following postfix notations there is no confusion between unary and binary minus.

  3. Output of folowing C code void main () { int i = 0, j = 0; int arr[4][4] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16}; clrscr (); for (i = 2; i> = 0; i) for (j = 2; j> = 0; j) printf (%d-, * ( * (arr + j) + i) ); getch (); }

    1. 11 10 9 7 6 5 3 2 1

    2. 11 7 3 10 6 2 9 5 1

    3. None of these

    Answer: b

  4. If there is 4 jobs (j1, j2, j3, j4) and there deadlines (2, 4, 2, 4). Which of the followinf sheduling is not possible.

    1. j1 j3 j2 j4

    2. j1 j2 j4 j3

    3. j1 j3 j4 j2

    4. j3 j1 j2 j4

  5. 4 process allocated 8000 bytes of memory according to best fit as follows: p1 − 2000 p2 − 2000 p3 − 2500 p4 − 1500 p1 and p4 is released. If a process p with 1000 bytes enter where will it be paced

    1. After p1

    2. After p3

    3. Cannot be placed

    Answer: b

  6. Heap with 10 bytes is present. Then which of the following series is possible 4 options of a series of malloc and free funtions. Don't remeber the choices but easy to get the answer.

  7. All combinational circuits can be implemented by

    1. Only NOR

    2. Only NAND

    3. Only XOR

    4. None of these

    Answer: d

  8. void main () { int a = 10, b = 11; printf (%d, a + + + b); printf (%d, a + + + b); }

    1. 22, 23

    2. 23, 24

    3. 21, 22

    4. none

    Answer: c