Placement Papers: Persistent Placement Paper Technical Database

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

  1. If there r n processes and each process waits p time in waiting state then cpu utilization is-:

    1. n (1 − p)

    2. n * p

  2. A string of pages were given and no of page faults have to be found in LRU algorithm

  3. here is a file server which provides locking for mutual exclusion. If any process locks the file and abruptly terminated this will result in indefinitely locking. The solution they found is to implement a timer for locking of file i.e., if time outs then server assumes that file is indefinitely locked and terminate the process

    1. this solution is perfect for mutual exclusion

    2. this will solve indefinite locking

    3. this will result in interleaving of file between processes

  4. A critical section is ans a set of instruction which is shared by many processes

  5. There was a question on automata ans the resultant string will have even no of c

  6. CFG was given S → 1 S 1 S → 0 S 0 S → 1 1 S → 0 0 Find out the string

  7. One singly circular ordered list is there if M elements are to be inserted what will be the complexity of time

    1. O (M * N)

    2. O (M * (M + N) )

    3. O ( (M + N) * log (M + N) )

    4. none of these

  8. find postfix and prefix of A + B * (C + D)/E + F

  9. Find out shortest path from A to B A B C D E A 0 m B m 0 2 2 m C 0 5 D 0 6 E 0

  10. From the following when 43 will not be found by binary search (a series was given with last element 43 in each)

  11. From 100 999 find the prob. Of getting 3 digit no with no 7 in any of its digit

    1. 18/25

    2. 10/25

    3. 729/1000

    4. none

  12. from the set { a, b, c, d, e, f} find no of arrangements for 3 alphabet with no data repeated

  13. To save space which option is better

    1. write all join operation than select than project

    2. ____, -----------------than project----select

    3. ____, ----------------in b/w select and project

    Employee = { e_no, salary, fname, lname}

    Works_On = { e_no, p_no, hrs}

    Project = { p_no, p_name}

  14. select e_no from Employee where salary = salary

    1. query invalid

    2. query valid

  15. Select fname, lname from Employee where e_no in (select e_no from works_on where p_no = (select * from project) )

  16. B tree is different from other

    1. has fixed index file size

    2. is better for queries like < ⇔ > =

    3. searching will be easy

    4. none

  17. func (char * s1, char * s2) { char * t; t = s1; s1 = s2; s2 = t; } void main () { char * s1 = jack, * s2 = jill; func (s1, s2); printf (%s %s, s1, s2); } OUTPUT jack jill

  18. void main () { int a[5] = { 1, 2, 3, 4, 5}, i, j = 2; for (i = 0; i<5; i + + ) func (j, a[i]); for (i = 0; i<5; i + + ) printf (%d, a[i]); } func (int j, int * a) { j = j + 1; a = a + j; }

  19. oid main () { for (a = 1; a ⇐ 100; a + + ) for (b = a; b ⇐ 100; b + + ) foo (); } foo () { } how many times foo will be called.

    1. 5050

    2. 1010

  20. A hash table has a sie of 11 and data filled in its position like { 3, 5, 7, 9, 6}how many comparisons have to be made if data is not found in the list in worst case

    1. 2

    2. 6

    3. 11

  21. packet switching is better than circuit switching coz

    1. it takes less time

    2. it takes less bandwidth

    3. it takes low frequency

    4. none

  22. addition of two sparse matrix in 3 tupple notation____time 30 min 24a tree has 1000000 nodes than how many search r required to search a node

  23. A program to arrange a string in order of occurrence of the character

Sign In