Prep Hub

UGC NET PAPER 2 COMPUTER SCIENCE – SET 39

UGC NET PAPER 2 COMPUTER SCIENCE – SET 39

Period: DEC 2014


761. Excess-3 code is self-complementing because ___.

Computer Organization and Architecture • Coding theory • DEC 2014


762. Array A[20,10],4-word cells, base=100, row-major. Address of A[11,5] is ___.

Computer Organization and Architecture • Memory addressing • DEC 2014


763. Size of ROM to build 8-bit adder/subtractor with mode, carry, overflow is ___.

Computer Organization and Architecture • Microprogramming • DEC 2014


764. Signal period=10 ms. Frequency is ___ Hz.

Computer Organization and Architecture • Signals • DEC 2014


765. DES with 56-bit key has ___ distinct stages.

Data Communication and Computer Networks • Cryptography • DEC 2014


766. In classful addressing, first four bits of a Class A IP are ___.

Data Communication and Computer Networks • IP addressing • DEC 2014


767. Match: a.Call control→conn mgmt; b.A-bis→interface BTS-BSC; c.BSMAP→MSC-BSS; d.CDMA→spread spectrum.

Data Communication and Computer Networks • Mobile Protocols • DEC 2014


768. Analog signal 6000 bps, 2000 baud: bits/signal element = ___

Data Communication and Computer Networks • Modulation • DEC 2014


769. Which is not a broadcast routing algorithm?

Data Communication and Computer Networks • Routing • DEC 2014


770. S1: hard handover retains source channel in parallel. S2: soft releases before new. Which?

Data Communication and Computer Networks • Wireless Handover • DEC 2014


771. Nearly sorted list: best sort is ___.

Data Structures and Algorithms • Sorting • DEC 2014


772. A full binary tree with n leaves has ___ nodes.

Data Structures and Algorithms • Trees • DEC 2014


773. A fact-less fact table contains ___.

Databases • Data Warehousing • DEC 2014


774. Which e-business model lets consumers name their own price?

Databases • E-Business • DEC 2014


775. To convert weak entity set into strong in ER diagram, use ___.

Databases • ER modeling • DEC 2014


776. Which is true? I. Self-join via alias. II. Outer-join basic RA op. III. Natural and outer join equivalent.

Databases • Joins • DEC 2014


777. Minimal key for R(A,B,C,D,E) with F={A→B,B→C,AC→D}?

Databases • Keys • DEC 2014


778. Best normal form of R(A,B,C,D) with F={AB→C,AB→D,C→A,D→B,AE→C}?

Databases • Normalization • DEC 2014


779. Division in RA handles queries like ___.

Databases • Relational algebra • DEC 2014


780. Consider A={1…1000}. How many divisible by 3 or 5 or both?

Discrete Structures and Optimization • Counting • DEC 2014



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