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

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

Info icon This preview shows pages 1–4. 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:
Image of page 1

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

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. 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 B. n C. n 2 D. n n Q.9) On which principle does stack work? A. FILO B. FIFO C. LIFO D. Both a and c above Q.10) The centricity of node labeled 5 is
Image of page 2
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.
Image of page 3

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

View Full Document Right Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern