NEW**UGC NET Solved Papers Held On June 2015

Download Admit Card
                                Important Dates      Schedule Of Examination       Eligibility      

January 03, 2015

UGC NET Solved Paper-II December 2014 Computer Science

<--BACK
26. The period of a signal is 10 ms.What is its frequency in Hertz?
      (A) 10     (B) 100    (C) 1000    (D) 10000
27. In a classful addressing, first bits in class A IP address is
      (A) 1010     (B) 1100    (C) 1011    (D) 1110
28.Which of the following algorithms is not a broadcast routing algorithm?
      (A) Flooding                         (B) Multidestination routing
      (C) Reverse path forwarding   (D) All of the above
29. An analog signal has a bit rate of 6000 bps and a baud rate 2000 baud. How many data elements are carried by each signal element?
      (A) 0.336 bits/baud               (B) 3 bits/baud
      (C) 120,00,000 bits/baud       (D) None of the above
30. How many distinct stages are there in DES algorithm, which is parameterized by a         56-bit key?
      (A) 16        (B) 17        (C) 18        (D) 19
31. Shift-Reduce parsers perform the following:
      (A) Shift step that advances in the input stream by K(K>1) symbols and Reduce step that applies a completed grammar rule to some recent parse trees, joining them together as once with a new root symbol.
      (B) Shift step that advances in the input stream by one symbol and Reduce step that applies a completed grammar rule to some recent parse trees, joining them together as one with a new root symbol.
      (C) Shift step that advances in the input stream by K(K=2) symbols and Reduce step that applies a completed grammar rule to form a single tree.
     (D) Shift step that does not advance in the input stream and Reduce step that applies a completed grammar rule to form a single tree.
32. Which of the following is true?
      (A) Canonical LR parser is LR (1) parser with single look ahead terminal.
      (B) All LR (K) parser with K>1 can be transformed into LR (1) parsers.
      (C) Both (A) and (B)
      (D) None of the above
33. In a two-pass assembler, symbol table is
      (A) Generated in first pass  (B) Generated in second pass
      (C) Not generated at all     (D) Generated and used in second  pass
34. Debugger is a program that
      (A) allows to examine and modify the contents of registers
      (B) does not allow execution of a segment of program
      (C) allows to set breakpoints, execute a segment of program and display contents        of registers
      (D) All of the above
35. The following Context-Free Grammar(CFG):
      S--> aB | bA
      A--> a | as | bAA
      B--> b | bs | aBB       will generate
      (A) odd numbers of a's and odd numbers of b's
      (B) even numbers of a's and even numbers of b's
      (C) equal numbers of a's and b's
      (D) different numbers of a's and b's
36. Consider the following justifications for commonly using the two-level CPU scheduling:
      I.   It is used when memory is too small to hold all ready processes.
      II.  Because its performance is same as that of the FIFO.
      III. Because its facilitates putting some set of processes into memory and a choice is made from that
      IV. Because it does not allow to adjust the set of in-core processes.
      Which of the following is true?
      (A) I, III and IV   (B) I and II   (C) III and IV  (D)  I and III
37. A specific editor has 200 K of programs text, 15 K of initial stack, 50 K of initialized data, and 70 K of bootstrap code. If five editors are started simultaneously, how much physical memory is needed if shared text is used?
      (A)  1135 K     (B) 335 K     (C) 1065 K     (D) 320 K
38. Which of the following conditions does not hold good for a solution to a critical section problem?
      (A) No assumptions may be made about speeds or the number of CPUs.
      (B) No two processes may be simultaneously inside the critical sections.
      (C) Processing running outside its critical section may block other processes
      (D) Processes do not wait forever to enter its critical section
39.  For the implementation of a paging scheme, suppose the average process size be x bytes, the page size be y bytes, and each page entry requires z bytes. The optimum page size that minimizes the total overhead due to the page table and the internal fragmentation loss is given by
      (A) x/2       (B) xz/2     (C) (2xz)1/2        (D) (xz)1/2/2
40. In a demand paging memory system, page table is held in registers. The time taken to service a page fault is 8 m.sec. if an empty frame is available or if the replaced page is not modified, and it takes 20 m. secs. if the replaced page is modified. What is the average  access time to service a page fault assuming that the page to be replaced is modified 70% of the time.
      (A) 11.6 m.sec.  (B) 16.4 m.sec.  (C) 28 m.sec.  (D) 14 m.sec.
41. ___________ are applied throughout the software process.
     (A) Framework activities  (B) Umbrella activities
     (C) Planning activities       (D) Constructions  activities
42. Requirement Development,Organizational Process Focus, Organizational  Training, Risk Management and Integrated Supplier Management are process areas required to achieve maturity level
      (A)Performed   (B) Managed   (C) Defined   (D) Optimized
43. The software _________ of a program or a computer system is the structure or structures of the system, which comprise software components, the externally visible properties of those components, and the relationship among them.
      (A)Design   (B) Architecture   (C) Process   (D) Requirement
44. Which one of the following set of attributes should not be encompassed by effective software  metrics?
      (A)Simple and computable    
      (B) Consistent and objective   
      (C) Consistent in the use of units and dimensions
      (D) Programming language dependent
45. Which one of the following is used to compute cyclomatic complexity?
      (A)The number of regions - 1   
      (B) E - N + 1, where E is the number of flow graph edges and N is the number of flow graph nodes.        
      (C) P - 1, where P is the number of predicate nodes in the flow of graph G.   
      (D) P + 1, where P is the number of predicate nodes in the flow of graph G.
46. Consider the following statements S1 and S2:   
      S1: A hard handover is one in which the channel in the source cell is retained and used for a while in parallel with the channel in the target cell.   
      S2: A soft handover is one in which the channel in the source cell is released and only then the channel in the target cell is engaged.
      (A) S1 is true and S2 is not true        (B) S1 is not true and S2 is true   
      (C) Both S1 and S2 is true                (D) Both S1 and S2 is not true
47. Fact- less fact table in a data warehouse contains
      (A) only measures       (B) only dimensions
     (C) keys and measures (D) only surrogate keys
48. Which e-business model allows consumers to name their own price for products and services?
      (A) B2 B       (B) B2 G          (C) C2 C         (D) C2 B
49. __________ model is designed to bring prices down by increasing the number of customers who buy a particular product at once.
      (A)Economic Order Quantity (B) Inventory
      (C) Data Mining                     (D) Demand- Sensitive Pricing  
50. Match the following:
            List - I                                     List -II
  a. Call control protocol  i. Interface between Base Transceiver Station(BTS)and Base Station Controller(BSC)
  b. A-bis                        ii. Spread spectrum
  c. BSMAP                   iii. Connection management
  d. CDMA                    iv. Works between Mobile Switching Centre (MSC) and  Base Station Subsystem (BSS)
      Codes:
                  a       b     c      d
      (A)      iii       iv     i       ii
      (B)      iii       i       iv     ii
      (C)      i        ii      iii      iv
      (D)      iv      iii      ii      i

No comments:

Post a Comment