UGC NET PAPER 2 COMPUTER SCIENCE – SET 27
Period: JUN 2013
521. Hiding manager’s salary from Employee is ___.
Data Communication and Computer Networks • Architecture • JUN 2013
522. In ______ substitution, a plaintext char always maps to same ciphertext char.
Data Communication and Computer Networks • Cryptography • JUN 2013
523. A network schema:
Data Communication and Computer Networks • Data Models • JUN 2013
524. Which is not a DBMS type?
Data Communication and Computer Networks • DB Architectures • JUN 2013
525. IP 190.255.254.254 belongs to which class?
Data Communication and Computer Networks • IP Addressing • JUN 2013
526. In IPv4 header, which field associates fragments with original datagram?
Data Communication and Computer Networks • IP Layer • JUN 2013
527. Which normal form is adequate for usual DB design?
Data Communication and Computer Networks • Normalization • JUN 2013
528. If D₁…Dₙ are domains, a relation is any subset of:
Data Communication and Computer Networks • Relational Model • JUN 2013
529. For 4800 routers, optimal 3-layer hierarchy region/cluster sizes are:
Data Communication and Computer Networks • Routing • JUN 2013
530. Which address delivers a message to the correct host application?
Data Communication and Computer Networks • Transport Layer • JUN 2013
531. How many values in array A(–1,m;1,m)?
Programming Languages • Arrays • JUN 2013
532. After `y = x++` with x=1,y=0, values of x,y?
Programming Languages • C Language • JUN 2013
533. Result of `(1&2)+(3/4)` in C?
Programming Languages • C Language • JUN 2013
534. Times “print” is printed by nested loops i<2,j<2,k<2
Programming Languages • C Language • JUN 2013
535. Good software design must have:
Software Engineering • Design Principles • JUN 2013
536. COCOMO stands for:
Software Engineering • Effort Estimation • JUN 2013
537. LOC and Function Points measure:
Software Engineering • Metrics • JUN 2013
538. Match: Good quality, Correctness, Predictable, Reliable to i,ii,iii,iv options.
Software Engineering • Quality Concepts • JUN 2013
539. Cyclomatic complexity V(G) for graph with e edges and n vertices is:
Software Engineering • Software Metrics • JUN 2013
540. NFA→minimal DFA needs how many states for given table?
Theory of Computation • Automata • JUN 2013
Disclaimer for MCQ Quiz
This quiz is for educational purposes only…