UGC NET CS 2017 Jan - II

Last Updated :
Discuss
Comments

Question 1

Which of the following operators cannot be overloaded in C/C++ ?
  • A
    Bitwise right shift assignment
  • B
    Address of
  • C
    Indirection
  • D
    Structure reference

Question 2

There are three processes P1, P2 and P3 sharing a semaphore for synchronizing a variable. Initial value of semaphore is one. Assume that negative value of semaphore tells us how many processes are waiting in queue. Processes access the semaphore in following order : (a) P2 needs to access (b) P1 needs to access (c) P3 needs to access (d) P2 exits critical section (e) P1 exits critical section The final value of semaphore will be :

  • A
    0
  • B
    1
  • C
    -1
  • D
    -2

Question 3

In 3G network, W-CDMA is also known as UMTS. The minimum spectrum allocation required for W-CDMA is _______.
  • A
    2 MHz
  • B
    20 KHz
  • C
    5 KHz
  • D
    5 MHz

Question 4

In link state routing algorithm after construction of link state packets, new routes are computed using:
  • A
    DES algorithm
  • B
    Dijkstra’s algorithm
  • C
    RSA algorithm
  • D
    Packets

Question 5

Distance vector routing algorithm is a dynamic routing algorithm. The routing tables in distance vector routing algorithm are updated _____.
  • A
    automatically
  • B
    by server
  • C
    by exchanging information with neighbour nodes
  • D
    with back up database

Question 6

A packet whose destination is outside the local TCP/IP network segment is sent to _____.
  • A
    File server
  • B
    DNS server
  • C
    DHCP server
  • D
    Default gateway

Question 7

The maximum size of the data that the application layer can pass on to the TCP layer below is __________. (A) 216 bytes (B) 216 bytes + TCP header length (C) 216 bytes - TCP header length (D) 215 byte.

  • A
    (1), (2) and (4)
  • B
    (2) and (4)
  • C
    (2), (3) and (4)
  • D
    All option are correct.

Question 8

Match the following Layers and Protocols for a user browsing with SSL : 26

  • A
    (1)
  • B
    (2)
  • C
    (3)
  • D
    (4)

Question 9

The seven elements A, B, C, D, E, F and G are pushed onto a stack in reverse order, i.e., starting from G. The stack is popped five times and each element is inserted into a queue.Two elements are deleted from the queue and pushed back onto the stack. Now, one element is popped from the stack. The popped item is ________.
  • A
    A
  • B
    B
  • C
    F
  • D
    G

Question 10

Which of the following is true for computation time in insertion, deletion and finding maximum and minimum element in a sorted array ?
  • A
    Insertion – 0(1), Deletion – 0(1), Maximum – 0(1), Minimum – 0(l)
  • B
    Insertion – 0(1), Deletion – 0(1), Maximum – 0(n), Minimum – 0(n)
  • C
    Insertion – 0(n), Deletion – 0(n), Maximum – 0(1), Minimum – 0(1)
  • D
    Insertion – 0(n), Deletion – 0(n), Maximum – 0(n), Minimum – 0(n)
Tags:

There are 49 questions to complete.

Take a part in the ongoing discussion