MCQ-Test-Questions-on-Data-Structures-and-Algorithms-www.psexam.com_

MCQ-Test-Questions-on-Data-Structures-and-Algorithms-www.psexam.com_

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
http://www.psexam.com (Computer Science Exam Preparation) http://new.psexm.com (Computer Operator Exam Preparation) http://msword.psexam.com (Learning MS Word in PS Exam) http://cplusplus.psexam.com (C++ Programming Language Tutorial and Exam Preparation) http://data-structures-and-algorithms.psexam.com (Algorithms and Data Structures Tutorials and Exam Preparation. Attempt online MCQ test on Data Structures and Algorithms presented by PS Exam (www.psexam.com). Visit Data Structures And Algorithms section of PS Exam for more about the topic. Attempt online MCQ test on Data Structures and Algorithms presented by PS Exam (www.psexam.com). Questions presented here suits the level for Higher Secondary or Bachelors in Computer Science or BCA, BIT, BSc IT and competitive exams like Computer Officer, IT Officer. Confused on any question? Check http://data-structures-and-algorithms.psexam.com/dsa-mcq-set-1/ for explanations on these questions. Visit Data Structures And Algorithms on PS Exam PSC01 FM: 50 PM: 30 Time: 1 hrs Attempt All of the following questions. Each question carry equal mark Total Questions » 50 Your Name » shkhanal Q.1) 6 files X1, X2, X3, X4, X5, X6 have 150, 250, 55, 85, 125, 175 number of records respectively. The order of storage ot optimize access time is A. X1, X2, X3, X4, X5, X6 B. X3, X4, X1, X5, X6, X2 C. X1, X3, X2, X4, X5, X6 D. None of the above Q.2) Consider two sorted lists of size L1, L2. Number of comparisions needed in worst case my merge sort algorithm will be A. L1,L2 B. Max(L1,L2) C. Min(L1,L2) D. L1+L2-1 Q.3) Average successful search time for sequential search on 'n' item is A. n/2 B. (n-1)/2 C. (n+1)/2 D. log (n) + 1 Q.4) In the following tree:
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
(Computer Science Exam Preparation) http://new.psexm.com (Computer Operator Exam Preparation) http://msword.psexam.com (Learning MS Word in PS Exam) http://cplusplus.psexam.com (C++ Programming Language Tutorial and Exam Preparation) http://data-structures-and-algorithms.psexam.com (Algorithms and Data Structures Tutorials and Exam Preparation. If post order traversal generates sequence xy-zw*+, then label of nodes 1,2,3,4,5,6,7 will be A. +, -, *, x, y, z, w B. x, -, y, +, z, *, w C. x, y, z, w, -, *, + D. -, x, y, +, *, z, w Q.5) Depth of a binary tree with n node is A. log (n +1) - 1 B. log (n) C. log (n -1)n -1 D. log (n) + 1 Q.6) In a stack the command to access nth element from the top of the stack S will be A. S [Top-n] B. S [Top+n] C. S [Top-n-1] D. None of the above Q.7) To arrange the books of library the best method is A. Bubble sort B. Quick sort C. Merge sort D. Heap sort Q.8) Time complexity of an algorithm T(n), where n is the input size is given by T(n) = T (n-1) + 1/n, if n>1 otherwise T(n) = 1. The order of algorithm is A. Log n
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/02/2012 for the course COMPUTER 101 taught by Professor Dr.kahan during the Spring '11 term at Akademia Ekonomiczna w Krakowie.

Page1 / 10

MCQ-Test-Questions-on-Data-Structures-and-Algorithms-www.psexam.com_

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online