CBSE-NET (UGC) Computer Science (Paper-II & Paper-III): Questions 31 - 35 of 202

Get 1 year subscription: Access detailed explanations (illustrated with images and videos) to 202 questions. Access all new questions we will add tracking exam-pattern and syllabus changes. View Sample Explanation or View Features.

Rs. 200.00 or

Question number: 31

» Relational Database Design and SQL » SQL » Data Dictionary, Metadata

Appeared in Year: 2015

MCQ▾

Question

Data which improves the performance and accessibility of the database are called: (December)

Choices

Choice (4) Response

a.

Application Metadata

b.

User Data

c.

Data Dictionary

d.

Indexes

Question number: 32

» Analysis and Design of Algorithms » Recursion and Non-Recursion Algorithms

Appeared in Year: 2015

MCQ▾

Question

In general, in a recursive and non-recursive implementation of a problem (program):

Choices

Choice (4) Response

a.

Time and space complexities are better in non-recursive than in recursive program

b.

Time complexity is better in recursive version but space complexity is better in non-recursive version of the program

c.

Time and space complexities are better in recursive than in non-recursive program

d.

Space complexity is better in recursive version but time complexity is better in non-recursive version of the program

Question number: 33

» Computer Networks » Routing » Conjestion Control

Appeared in Year: 2015

MCQ▾

Question

Which of the following is not a congestion policy at network layer? (December)

Choices

Choice (4) Response

a.

Routing Algorithm

b.

Packet Discard Policy

c.

Packet Lifetime Management Policy

d.

Flow Control Policy

Question number: 34

» Computer Networks » Network Security » Cryptography-Public Key, Secret Key

Appeared in Year: 2015

MCQ▾

Question

Using p = 3, q = 13, d = 7 and e = 3 in the RSA algorithm, what is the value of ciphertext for a plain text 5? (December)

Choices

Choice (4) Response

a.

33

b.

21

c.

26

d.

None of the above

Question number: 35

» Relational Database Design and SQL » SQL » Wildcard Operators

Appeared in Year: 2015

MCQ▾

Question

Consider a “CUSTOMERS” database table having a column “CITY” filled with all the names of Indian cities (in capital letters). The SQL statement that finds all cities that have “GAR” somewhere in its name, is: (December)

Choices

Choice (4) Response

a.

Select * from customers where city like ‘%GAR % ’;

b.

Select * from customers where city = ’%GAR % ’;

c.

Select * from customers where city = ’$GAR$’;

d.

Select * from customers where city as ’%GAR’;

f Page
Sign In