DUET PhD in Computer Science Question Paper with Answer Keys 2019-20
Delhi University Entrance Test (DUET) 2019-20 PhD in Computer Science Question Paper with answers DUET PhD in Computer Science Question Paper 2019-20 with solution you can download it in FREE, if DUET PhD in Computer Science Question Paper 2019-20 in text or pdf for DUET PhD in Computer Science Question Paper 2019-20 Answer Keys you can download DUET 2019-20 page also just Go to menu bar, Click on File->then Save.
DUET PhD in Computer Science Question Paper with Answer Keys 2019-20
Delhi University Entrance Test (DUET) 2019-20 PhD in Computer Science Question Paper with Answer Keys Free Download PDF is available in www.oldquestionpapers.net which has been provided by many students this DUET 2019-20 paper is available for all the students in FREE and also DUET PhD in Computer Science Question Paper 2019-20 fully solved DUET with answer keys and solution.
You can get daily updates on DUET 2019-20 from www.oldquestionpapers.net here you can also check similar links for other related study materials on DUET PhD in Computer Science Question Paper question bank 2019-20 is also available in English and Hindi Language.
EXAMPLE QUESTIONS
Q1. Which of the following statements is true for TCP protocol?
- 1. TCP is a connection-less unreliable protocol.
- 2. TCP is a connection-less reliable protocol.
- 3. TCP is a connection-oriented reliable protocol.
- 4. TCP is a connection-oriented unreliable protocol.
Q2. The file space allocation of Unix Operating System is
- 1. Linked
- 2. Single level indexed
- 3. Multi-level Indexed
- 4. Contiguous
Q3. This examination paper has 100 multiple-choice questions of one mark each, with each question having four choices only one of which is correct. Each incorrect answer fetches -0.25 mark. Suppose you choose all your answers randomly with uniform probability. Then the expected mark you obtain is
- 1. 6.25
- 2. 0
- 3. 37.5
- 4. 17.5
Q4. Suppose we are given pointers to first and last nodes of a singly linked list containing 𝑛 elements (where each node contains pointer to the next node). Which of the following operations cannot be performed in time independent on the length of the linked list?
- 1. Insert a new element as the last element.
- 2. Insert a new element as the first element.
- 3. Delete the first element.
- 4. Delete the last element.
Q5. A CPU has 32 bit address lines and 16 bit datalines. The maximum primary memory addressing capacity of the CPU is
- 1. 4 MB
- 2. 2 GB
- 3. 64 KB
- 4. 4 GB
Q6. Which of the following inter-process communication mechanism is most efficient in an operating system?
- 1. Semaphore
- 2. Shared memory
- 3. Message Passing
- 4. Message queue
Q7. In a QAM Modulation scheme, the baud-rate is 4 kilobaud/second. The lowest carrier frequency is 102 KHz. The bandwidth of the channel is 1 MHz. The number of digital channels created would be
- 1. 300
- 2. 250
- 3. 200
- 4. 225
Q8. To reduce thrashing in virtual memory, which of the following data structures is most suitable?
- 1. Queue
- 2. Array
- 3. Hashing
- 4. Stack
Q9. The number of 4 digit even numbers where all the digits are distinct is (Note that the most significant digit of these numbers cannot be zero).
- 1. 2296
- 2. 2240
- 3. 2520
- 4. 2620
Q10. An Ethernet frame is 32 bytes long. How many extra bytes should be added to the frame before transmission?
- 1. 32 bytes
- 2. 48 bytes
- 3. 64 bytes
- 4. 16 bytes
DUET PhD in Computer Science Question Paper with Answer Keys 2019-20 Download PDF File:
Sr. No. |
Papers Name | PDF Files |
1. | PhD in Computer Science |
Similar Pages…..
See Also……