Prep Hub

UGC NET PAPER 2 COMPUTER SCIENCE – SET 49

UGC NET PAPER 2 COMPUTER SCIENCE – SET 49

Period: AUG 2016


961. 100Base-TX uses ____ cable and max segment ____.

Data Communication and Computer Networks • Ethernet • AUG 2016


962. Raster grid Xmax=10,Xmin=-5,Ymax=11,Ymin=6. Address of pixel (5,4) with base 1?

Data Communication and Computer Networks • Graphics memory • AUG 2016


963. Analog signal 8000 bps, 1000 baud: bits/symbol = ?, elements = ?

Data Communication and Computer Networks • Modulation • AUG 2016


964. Match (Session, App, Presentation, Transport) to codes a b c d.

Data Communication and Computer Networks • OSI Model • AUG 2016


965. Network 10 Mb/s, 12 000 frames/min ×10 000 bits each. Throughput?

Data Communication and Computer Networks • Performance Analysis • AUG 2016


966. Transmission=32 kbps, 8 hops, packet=8000 bits. Total end-to-end delay =?

Data Communication and Computer Networks • Performance analysis • AUG 2016


967. Statements A. Ethernet over fiber. B. PPPoE encapsulates PPP in Ethernet. C. Ethernet not over fiber. D. PPPoE encapsulates Ethernet in PPP. Which correct?

Data Communication and Computer Networks • Protocols • AUG 2016


968. Slotted ALOHA, 200-bit frames, 200 kbps, 1000 frames/sec. Throughput =?

Data Communication and Computer Networks • Random access • AUG 2016


969. Attacker captures and replays info without alteration. This is?

Data Communication and Computer Networks • Security • AUG 2016


970. Which is FALSE about microwaves?

Data Communication and Computer Networks • Wireless Media • AUG 2016


971. S1: Queue via two stacks. S2: Stack via two queues. Which is correct?

Data Structures and Algorithms • Abstract Data Types • AUG 2016


972. Matrix chain <30×35,35×15,15×5,5×10>: min scalar multiplications = ?

Data Structures and Algorithms • DP algorithms • AUG 2016


973. Match: Prim’s, Bellman–Ford, Floyd–Warshall, Johnson’s to i.O(V²E) ii.O(VE lgV) iii.O(E lgV) iv.O(V³).

Data Structures and Algorithms • Graph algorithms • AUG 2016


974. Hash table m=10000, h(K)=floor(m*(KA mod 1)), A=(√5−1)/2, K=123456 maps to:

Data Structures and Algorithms • Hashing • AUG 2016


975. Max-heap [20,18,15,13,12], insert 10 then 17. New level-order = ?

Data Structures and Algorithms • Heaps • AUG 2016


976. On a singly linked list (head, tail), which is not O(1)?

Data Structures and Algorithms • Linked Lists • AUG 2016


977. Radix sort n integers with d digits: time complexity = ?

Data Structures and Algorithms • Sorting algorithms • AUG 2016


978. Traversing all nodes in-order on a BST of n nodes runs in?

Data Structures and Algorithms • Trees • AUG 2016


979. Subject-oriented, integrated, time-variant, nonvolatile data collection is?

Databases • Data Warehousing • AUG 2016


980. Global conceptual Schema completeness condition requires:

Databases • Distributed DBMS • AUG 2016



Disclaimer for MCQ Quiz
This quiz is for educational purposes only…

0 0 votes
Article Rating
Subscribe
Notify of
guest
0 Comments
Oldest
Newest Most Voted
Inline Feedbacks
View all comments
Scroll to Top