361. Number of bits used for addressing in Gigabit Ethernet is:

Data Communication and Computer Networks • Data-Link addressing • UGC NET Paper 2 Computer Science NOV 2017

362. Which IoT wireless technology consumes least power?

Data Communication and Computer Networks • IoT technologies • UGC NET Paper 2 Computer Science NOV 2017

363. Which IP address is used by hosts when booting?

Data Communication and Computer Networks • IP addressing • UGC NET Paper 2 Computer Science NOV 2017

364. Which OSI layer is called the end-to-end layer?

Data Communication and Computer Networks • OSI model • UGC NET Paper 2 Computer Science NOV 2017

365. Which algorithms do not take decisions based on current traffic?

Data Communication and Computer Networks • Routing algorithms • UGC NET Paper 2 Computer Science NOV 2017

366. Which device forwards data based on MAC address?

Data Communication and Computer Networks • Switching • UGC NET Paper 2 Computer Science NOV 2017

367. Valid BST search path for 88 is?

Data Structures and Algorithms • Binary search trees • UGC NET Paper 2 Computer Science NOV 2017

368. Max nodes in B-tree order 10 depth 3?

Data Structures and Algorithms • B-trees • UGC NET Paper 2 Computer Science NOV 2017

369. Linear probing suffers from?

Data Structures and Algorithms • Hashing • UGC NET Paper 2 Computer Science NOV 2017

370. Time complexity to build heap of n elements?

Data Structures and Algorithms • Heaps • UGC NET Paper 2 Computer Science NOV 2017

371. Binary tree with 27 nodes has how many null branches?

Data Structures and Algorithms • Trees • UGC NET Paper 2 Computer Science NOV 2017

372. In a chained hash table of size 100, the maximum entries is:

Data Structures and Algorithms • Hashing • UGC NET Paper 2 Computer Science NOV 2017

373. Most appropriate data structure to implement a priority queue is a:

Data Structures and Algorithms • Priority Queues • UGC NET Paper 2 Computer Science NOV 2017

374. Given push(A),push(B),push(C) with A before B before C, which pop order is impossible?

Data Structures and Algorithms • Stacks • UGC NET Paper 2 Computer Science NOV 2017

375. In a complete binary tree of n nodes, the distance between two farthest nodes is about:

Data Structures and Algorithms • Tree Properties • UGC NET Paper 2 Computer Science NOV 2017

376. Logic expression for the output of the given circuit is

Data Structures and Algorithms • Boolean Algebra • UGC NET Paper 2 Computer Science NOV 2017

377. Function represented by the K-map below is

Data Structures and Algorithms • Karnaugh Maps • UGC NET Paper 2 Computer Science NOV 2017

378. Decimal equivalent of BCD 11011.1100 is

Data Structures and Algorithms • Number Systems • UGC NET Paper 2 Computer Science NOV 2017

379. Advantage of synchronous sequential over asynchronous is

Data Structures and Algorithms • Sequential Circuits • UGC NET Paper 2 Computer Science NOV 2017

380. Which of the following is a non-linear data structure?

Data Structures and Algorithms • Data Structures • UGC NET Paper 2 Computer Science NOV 2017