NTA-NET (Based on NTA-UGC) Computer Science (Paper-II): Questions 569 - 575 of 2202
Access detailed explanations (illustrated with images and videos) to 2202 questions. Access all new questions we will add tracking exam-pattern and syllabus changes. Unlimited Access for Unlimited Time!
View Sample Explanation or View Features.
Rs. 550.00 or
How to register?
Question number: 569
» Programming in C and C Plus Plus » Programming in C » Structured Data Types in C-Arrays, Struct, Union, String, and Pointers
Appeared in Year: 2013
Question
How many values can be held by an ? (June Paper II)
Choices
| Choice (4) | Response | |
|---|---|---|
a. |
| |
b. |
| |
c. |
| |
d. |
| |
Question number: 570
» Discrete Structures » Graph » Spanning Trees
Appeared in Year: 2013
Question
How many edges must be removed to produce the spanning forest of a graph with N vertices, M edges and C connected components? (June Paper II)
Choices
| Choice (4) | Response | |
|---|---|---|
a. |
| |
b. |
| |
c. |
| |
d. |
| |
Question number: 571
» Discrete Structures » Graph » Spanning Trees
Appeared in Year: 2013
Question
Which of the following connected simple graph has exactly one spanning tree? (June Paper II)
Choices
| Choice (4) | Response | |
|---|---|---|
a. | Complete graph | |
b. | Hamiltonian graph | |
c. | Euler graph | |
d. | None of the above | |
Question number: 572
» Data and File Structures » Priority Queues and Heaps
Appeared in Year: 2013
Question
The time complexity to build a heap with a list of n numbers is (June Paper II)
Choices
| Choice (4) | Response | |
|---|---|---|
a. |
| |
b. |
| |
c. |
| |
d. |
| |
Question number: 573
» Relational Database Design and SQL » Fundamentals of Database » Keys
Appeared in Year: 2013
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: 574
» Analysis and Design of Algorithms » Analysis of Algorithms
Appeared in Year: 2013
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: 575
» Networks, Virtualization, & Cloud Computing » Network Security » Cryptography-Public Key, Secret Key
Appeared in Year: 2013
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 | |