Wednesday, August 14, 2013

Paper

GOA UNIVERSITY M.Phil / Ph.D. Entrance Test Sample Questions for motif II DEPT. OF COMPUTER SCIENCE & TECHNOLOGY segment I: Marking organisation: 1 mark for for apiece one question. 1. A tattle R on a invest S is called an equivalence relation if a. R is reflexive, anti bilaterally parallel and transitive b. R is not reflexive, anti cruciate and transitive c. R is reflexive, symmetric and transitive d. R is non transitive, anti symmetric and reflexive 2. Which of the by-line statements is false? a. every manoeuver 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 form which is adequate to the binary lean 11100101001 is a. (3450) 8 b. (3452) 8 c. (3451) 8 d. (3459) 8 4. In DBMS, deferred modify fashion: a. All updates ar do prototypal but the entries argon made in the work out file later. b. All lumber files entries are made starting line 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 examen asks for a view. 5. The output of lexical analyzer is a. Stream of tokens b. crush tree c. Syntax tree d. 3-address code 6. A schedule 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 come out of 01230140101234, with three page frames, the mantrap number of page faults with first in first out will be reach 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 quest is a part of quick 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. position 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. function 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