.

Thursday, May 9, 2013

Paper

GOA UNIVERSITY M.Phil / Ph.D. Entrance Test Sample Questions for authorship II DEPT. OF COMPUTER SCIENCE & TECHNOLOGY department I: Marking avoidance: 1 mark for for to each one one question. 1. A apprisal R on a invest S is called an tolerableity relation if a. R is reflexive, anti bilaterally parallel and transitive b. R is not reflexive, anti stellate and transitive c. R is reflexive, symmetric and transitive d. R is non transitive, anti symmetric and reflexive 2. Which of the pastime statements is false? a. every point is a bipartite graph. b. A tree contains a cycle. c. A tree with n nodes contains n-1 edges. d. A tree is a attached graph. 3. The octal phone subject which is adequate to the binary account 11100101001 is a. (3450) 8 b. (3452) 8 c. (3451) 8 d. (3459) 8 4. In DBMS, deferred update promoter: a. All updates ar do prototypal but the entries be made in the preface file later. b. All record files entries ar made world-class but the actual updates are done later. c. Every update is done first followed by a writing on the log file. d. Changes in the views are deferred till a research asks for a view. 5. The output of lexical analyzer is a. Stream of tokens b. canvass tree c. Syntax tree d. 3-address code 6. A platform has five virtual pages, numbered from 0 to 4.
Ordercustompaper.com is a professional essay writing service at which you can buy essays on any topics and disciplines! All custom essays are written by professional writers!
If the pages are referenced in the align of 01230140101234, with three page frames, the pass water number of page faults with first in first out will be equal to: a. 0 b. 4 c. 6 d. 9 7. A computer uses the -------- IP address to refer to itself: a. 0.0.1.127 b. 127.0.0.1 c. 127.1.1.0 d. 1.0.0.127 8. Which of the sideline is a part of active methodologies? a. SCRUM b. XP c. Crystal d. All of the above 9. Apache HADOOP is not a/an a. Implementation of MapReduce algorithm b. Distributed File System c. RDBMS Implementation d. per centum of cloud computing 10. Which of the following is a pre-emptive scheduling algorithm? a. Shortest-job first b. Round-Robin c. Priority-based d. proceed In...If you want to get a full essay, order it on our website: Ordercustompaper.com

If you want to get a full essay, wisit our page: write my paper

No comments:

Post a Comment