NTA-NET (Based on NTA-UGC) Computer Science (Paper-II): Questions 574 - 579 of 2012

Access detailed explanations (illustrated with images and videos) to 2012 questions. Access all new questions we will add tracking exam-pattern and syllabus changes. Subscription can be renewed yearly absolutely FREE! View Sample Explanation or View Features.

Rs. 550.00 or

How to register?

Question number: 574

» Relational Database Design and SQL » Fundamentals of Database » Keys

Edit

Appeared in Year: 2013

MCQ▾

Question

Which of the following is not a type of Database Management System? (June Paper II)

Choices

Choice (4) Response

a.

Hierarchical

b.

Network

c.

Relational

d.

Sequential

Question number: 575

» Analysis and Design of Algorithms » Analysis of Algorithms

Edit

Appeared in Year: 2013

MCQ▾

Question

Give as good a big–O estimate as possible for the following functions:

(June Paper II)

Choices

Choice (4) Response

a.

b.

c.

d.

Question number: 576

» Networks, Virtualization, & Cloud Computing » Network Security » Cryptography-Public Key, Secret Key

Edit

Appeared in Year: 2013

MCQ▾

Question

In ________ substitution, a character in the plaintext is always changed to the same character in the ciphertext, regardless of its position in the text. (June Paper II)

Choices

Choice (4) Response

a.

polyalphabetic

b.

monoalphabetic

c.

transpositional

d.

multialphabetic

Question number: 577

» Relational Database Design and SQL » Normalization-INF, 2NF, 3NF, BCNF and 4NF

Edit

Appeared in Year: 2013

MCQ▾

Question

Which normal form is considered as adequate for usual database design? (June Paper II)

Choices

Choice (4) Response

a.

4NF

b.

3NF

c.

2NF

d.

5NF

Question number: 578

» Software Engineering » Software Design » Design Level Metrics

Edit

Appeared in Year: 2013

MCQ▾

Question

Cyclometric complexity of a flow graph G with n vertices and e edges is (June Paper II)

Choices

Choice (4) Response

a.

b.

c.

d.

Question number: 579

» Computer Arithmetic » Logic Families » Boolean Algebra and Minimization of Boolean Functions

Edit

Appeared in Year: 2013

MCQ▾

Question

A Boolean operator is defined as follows:

What will be the truth value of the expression ? (June Paper II)

Choices

Choice (4) Response

a.

Always false

b.

Always true

c.

Sometimes true

d.

True when x, y, Z are all true

Developed by: