Placement Papers: Honeywell Paper 22 July 2006 Bangalore

Get unlimited access to the best preparation resource for CTET/Paper-2 : get questions, notes, tests, video lectures and more- for all subjects of CTET/Paper-2.

These are the questions asked for the Honeywell test conducted on 22 July 06 in their Bangalore office.

There were 100 questions:

50 Technical questions (branch wise)

30 C questions

20 aptitude questions

Aptitude is very easy. Simple questions from profit&loss, ratio, odd-man series, time-distance, clock …

Technical from OS, DBMS, CN, 8085, unix, DS. Some of the qns I remembered are given below:

  1. Binary search tree is used in
    1. sorting
    2. searching
    3. indexing
    4. all the above
  2. Given a tree. Write the preorder traversal
  3. Given an infix expression. Write its postfix
  4. First general purpose microprocessor
    1. 2002
    2. 4004
    3. 8080
    4. 8085
  5. What is 8253
  6. ________flag is not used in 8085 jump instructions
  7. SNMP is used in which layer
  8. Banker, s algorithm is used for
  9. Belady, s anomaly is related to________
  10. Which of the following is non-preemptive
    1. FIFO
    2. SJF
    3. Round robin
    4. all the above
  11. A relation in 3NF is in________
  12. A question on serializability
  13. One SQL query
  14. Functional dependency one question
  15. The first general purpose microprocessor is ________-bit
  16. In a three byte instruction the second byte indicates________
  17. Average case analysis for partition exchange sort
  18. How the receiver knows to what service the packet to be forwarded?
  19. Given a binary sign magnitude no: Write its decimal
  20. The order in which data is transferred frm magnetic disk disk-main mem-cache-h/w register
  21. In which layer of the network datastructure format change is done
  22. Which of the following allow parallel & serial connections
    1. DHCP
    2. PPP
    3. IPX
    4. all the above
  23. Given some IP addresses … Identify which one is IPv6?
  24. Open addressing and chaining is used in
    1. sorting
    2. indexing
    3. collision-resolution
    4. none of the above
  25. Storage space requirement for diff: Sorts in the descending order
  26. Which scheduling policy is used in unix.
  27. In database which mechanism is suitable for recovery?
  28. Which of the following is not correct?
    1. arrays consume less space
    2. linked lists are more complex
    3. linked lists use less space
  29. which of the following is not correct?
    1. main does not have arguments
    2. main can have command line arguments
    3. main have variable arguments
  30. Which of the following is not correct?
    1. function can call itself
    2. function can have no return type
    3. function cannot have multiple return statements
    4. function can have arguments
  31. When an interrupt is called control is given to.
  32. Which of the following is not a synchronization tool
    1. semaphore
    2. mutex
    3. mutual exclusion
    4. message passing
  33. Given a graph write the BFS for it
  34. How can u increase ports of a microprocessor?
    1. 8255
    2. 8259
    3. 8253
    4. 8251
  35. What is 8259?
  36. Which of the following maintains a constant time (best, worst, average) ?
    1. searching
    2. sorting
    3. indexing
    4. none
  37. In a database a table is stored not fully. It is an example of
    1. views
    2. logical data independence
    3. abstraction
    4. all the above
  38. The time CPU takes to complete the execution of processes________
  39. The minimum length of TCP/IP header and IP datagram header
  40. Process spawning in OS is________
  41. The topology that uses a central hub is________

C questions were dam easy. Pointers and strings. If ur strong in pointer concepts u can score easily. 2 or 3 qns frm files, enum, extern.

Developed by: