NTA-NET (Based on NTA-UGC) Computer Science (Paper-II): Questions 754 - 756 of 2104

Access detailed explanations (illustrated with images and videos) to 2104 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: 754

» Operating Systems with Unix » Multiprogramming, Multiprocessing, and Multitasking

Edit

Appeared in Year: 2013

MCQ▾

Question

A thread is usually defined as a light weight process because an Operating System (OS) maintains smaller data structure for a thread than for a process. In relation to this, which of the following statement is correct? (June Paper III)

Choices

Choice (4)Response

a.

OS maintains only scheduling and accounting information for each thread.

b.

OS maintains only CPU registers for each thread.

c.

OS does not maintain a separate stack for each thread.

d.

OS does not maintain virtual memory state for each thread.

Question number: 755

» Data and File Structures » Trees & Graphs

Edit

Appeared in Year: 2013

MCQ▾

Question

Consider the following statements:

(i) A graph in which there is a unique path between every pair of vertices is a tree.

(ii) A connected graph with is a tree.

(iii) A graph with that has no circuit is a tree.

Which of the above statements is/are true? (September Paper II)

Choices

Choice (4)Response

a.

b.

c.

d.

All a. , b. and c. are correct

Question number: 756

» Relational Database Design and SQL » SQL » Database Objects

Edit

Appeared in Year: 2013

MCQ▾

Question

The “PROJECT” operator of a relational algebra creates a new table that has always (June Paper III)

Choices

Choice (4)Response

a.

More columns than columns in original table

b.

More rows than original table

c.

Same number of rows as the original table

d.

Same number of columns as the original table

Developed by: