Placement Papers: GlobalEdge June2004

Download PDF of This Page (Size: 123K)

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

C What is the output of the following:

  1. main () { int * p; p = (int * ) malloc (-10); }

    1. allocates 0 bytes

    2. allocates memory, if available

    3. compilation error

    4. Runtime error

    Answer: b

  2. main () { for (printf ( “a” ); printf ( “b” ); printf ( “c” ) ); }

    1. abc

    2. abc abc abc ____ (infinite times)

    3. a bc bc bc ____ (infinite times)

    4. Error

    Answer: c

  3. main () { int i = 10 * fun (); printf ( “%d” i); } fun () { return 10; }

    1. 0

    2. 10

    3. 100

    4. Error

    Answer: c

  4. int i = 10 * fun (); main () { printf ( “%d” i); } fun () { return 10; }

    1. 0

    2. 10

    3. 100

    4. Error

    Answer: d

  5. Assume size of int to be 2 bytes: Main () { int i = 100; printf ( “%d” sizeof (i + + ) ); printf ( “%d” i); }

    1. 2 100

    2. 2 101

    3. 100 101

    4. 101 100

    Answer: a

Computer Fundamentals

  1. Which one of the following always resides in the memory?

    1. Linker

    2. Loader

    3. Compiler

    4. All of the Above

    Answer: b

  2. Which of these is not a layer in OSI model?

    1. Application layer

    2. Network Layer

    3. Internet Layer

    4. Data Link Layer

    Answer: c

  3. Which one of the following data structures is best suited for searching?

    1. Arrays

    2. Singly Linked List

    3. Doubly Linked List

    4. Hash Table

    Answer: d

  4. Which of the following data structures is best suited for Deletion?

    1. Arrays

    2. Singly Linked List

    3. Doubly Linked List

    4. Hash Table

    Answer: c

  5. Which one of these is not a scheduling technique in Operating System?

    1. Last-Come-First-Serve Scheduling

    2. First-Come-First-Serve Scheduling

    3. Preemptive Scheduling

    4. Round Robin Scheduling

    Answer: a

  6. Demand Paging is

    1. All the pages of a process is loaded at the start

    2. When a single page is demanded then all other pages are also loaded

    3. When a page is required then only it is loaded

    4. None of the Above

    Answer: c

  7. Page Fault is

    1. A page is referenced that is not in the memory.

    2. A page is referenced that is not in the Disk.

    3. A page being added to the process.

    4. None of the above

    Answer: a

  8. If the number of internal nodes in a binary tree is n, then what is the number of external nodes?

    1. n − 1

    2. n

    3. n + 1

    4. 2n

    Answer: c

  9. “Banker's Algorithm” is used for:

    1. Deadlock Detection

    2. Deadlock Avoidance

    3. Deadlock Prevention

    4. All of the above

    Answer: b

  10. Which of the following is used fro designing a lexical analyser of a compiler?

    1. Finite Automata

    2. Push Down Automata

    3. Turing Machine

    4. None of the above

    Answer: a

  11. Which layer in the OSI model is responsible for End to End connectivity?

    1. Data Link Layer

    2. Network Layer

    3. Transport Layer

    4. Session Layer

    Answer: c