This action might not be possible to undo. Are you sure you want to continue?

**com (Computer Operator 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

shkhanal

Your Name » 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. B. C. D. Q.2) X1, X2, X3, X4, X5, X6 X3, X4, X1, X5, X6, X2 X1, X3, X2, X4, X5, X6 None of the above

Consider two sorted lists of size L1, L2. Number of comparisions needed in worst case my merge sort algorithm will be A. B. C. D. L1,L2 Max(L1,L2) Min(L1,L2) L1+L2-1

Q.3)

Average successful search time for sequential search on 'n' item is A. B. C. D. n/2 (n-1)/2 (n+1)/2 log (n) + 1

Q.4)

In the following tree:

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.

com (Learning MS Word in PS Exam) http://cplusplus.http://www. *. y. -. x. C. y.9) On which principle does stack work? A. B. Q. Bubble sort Quick sort Merge sort Heap sort Q.1 log (n) log (n -1)n -1 log (n) + 1 Q. where n is the input size is given by T(n) = T (n-1) + 1/n.5. -. D. w x. D. w x. B. + -.7 will be A. z.psexam.5) +. S [Top-n] S [Top+n] S [Top-n-1] None of the above Q.6) In a stack the command to access nth element from the top of the stack S will be A.4.psexam. +. -. C.10) The centricity of node labeled 5 is http://msword.psexam.7) To arrange the books of library the best method is A. Log n n n2 nn Q.psexm.psexam.3. x. C. z.com (Computer Science Exam Preparation) http://new. D. The order of algorithm is A. C.2. C. z. *. +. B. B. y. . w Depth of a binary tree with n node is A. FILO FIFO LIFO Both a and c above Q. y. D.com (C++ Programming Language Tutorial and Exam Preparation) http://data-structures-and-algorithms. D. log (n +1) .com (Computer Operator Exam Preparation) If post order traversal generates sequence xy-zw*+. z. D. if n>1 otherwise T(n) = 1.6. *. then label of nodes 1.com (Algorithms and Data Structures Tutorials and Exam Preparation. w. C. B.8) Time complexity of an algorithm T(n). B. *.

psexm. bubble sort selection sort insertion sort merge sort Q. . C. .com (Algorithms and Data Structures Tutorials and Exam Preparation. D.d.com (C++ Programming Language Tutorial and Exam Preparation) http://data-structures-and-algorithms.psexam. Q.12.com (Learning MS Word in PS Exam) http://cplusplus. B. C.12) A text is made up of five characters. One needs a minimum of A. D.78 Q. B.b. Maximum number of comparisions needed in searching an item that is not present is http://msword.psexam. T4. T5. The probability of occurance of each character is . D. T3. . C. C.http://www. T2. 2 deletion and 3 additions 3 deletions and 2 additions 3 deletions and 3 additions 3 deletions and 4 additions Q. T1.14) A hash tabale with 10 buckets with one slot per bucket is depicted in following diagram.13) A queue has configuration a.01 2.b. Symbols S1 to S7 are initially entered using a hashing function with linear probing.com (Computer Science Exam Preparation) http://new. To get configuration d.11) 6 7 2 5 Arranging a pack of cards by picking one by one is an example of A. B.c. respectively. . The optimal coding technique will have average length of A.15.4.a.88 and .15 3. 2.25.psexam.c. D.com (Computer Operator Exam Preparation) A.3 1. B.psexam.

D.17) The order of an algorithm that finds whether a given boolean function of 'n' variable produces a '1' is A. Has 19 nodes Has 16 nodes Has 15 nodes None of the above Q. C. X2.psexam.psexam. .com (C++ Programming Language Tutorial and Exam Preparation) http://data-structures-and-algorithms.http://www.2. D.} *p. Their order is f(n) and g(n).g(n)) f(n)+g(n) f(n)*g(n) Q. The order of algorithm is A. C. B. Max(f(n). A. C.15) 4 5 6 3 Write the output of following program: int a[ ] = {1.psexam. C.3. B. D.psexam. B.com (Computer Operator Exam Preparation) A. C. Q. constant linear logarithmic exponential Q. D.com (Learning MS Word in PS Exam) http://cplusplus.g(n)) Min(f(n). B.psexm. B. Such a tree with 10 leaves A.com (Computer Science Exam Preparation) http://new.18) A binary tree in which every non-leaf node has non-empty left and right sub trees is called a strictly binary tree. D. 3 Junk value Run time error Address of the third element Q. respectively.19) Average successful search time taken by binary search on sorted array of 10 items is http://msword.com (Algorithms and Data Structures Tutorials and Exam Preparation.16) An algorithm consists of two modules X1.

Q. B. then tree is called as (i) Full m-ary try (ii) Com plete m-ary tree (iii)Positional m-ary tree A. C. iii.21) Correct answer is (i) Correct answer is (ii) Correct answer is (iii) Correct answer is (iv) If the out degree of every node is exactly equal to M or 0 and the num ber of nodes at level K is Mk-1 [con sider root at level 1]. n2 n n3 http://msword.9 If the address of (I. C. The order of algorithm is A. iv. B. B. Q. C.6 2.com (Computer Operator Exam Preparation) A. if n>1. where it stores the position of first and last non-zero entries of each row is given by C.http://www.com (Algorithms and Data Structures Tutorials and Exam Preparation. . T(n) = d if n<1. Q.com (C++ Programming Language Tutorial and Exam Preparation) http://data-structures-and-algorithms.psexam.8 2. C. where 'n' is input size of recursive algorithm is given as follows: T(n) = c + T(n-1).22) Only (i) Only (ii) Both (i) and (ii) Both (ii) and (III) Running time T(n).psexam.20) 2. in dope vector representation.com (Learning MS Word in PS Exam) http://cplusplus. D.psexm. D.psexam.7 2.com (Computer Science Exam Preparation) http://new. A. D. assume l(n) and f(n) represent the last and first non-zero entries in row x i. B. ii.psexam.J)th entry.

It decides the best algorithm to solve a problem It determines maximum size of a problem.26) Bib O notation w. operations need to sort numbers 8. C. Q. D.http://www. 13 in ascending order using bubble sort A. Single linked list Linear doubly linked list Circular linked list http://msword. that can be solved in given system in given time It is the lower bound of growth rate of algorithm None of the above Q.psexam. D. 7.com (Algorithms and Data Structures Tutorials and Exam Preparation.com (Computer Operator Exam Preparation) D. C. 11 12 13 14 Q.psexam. 19. 31. C.t algorithm signifies A.psexam. B. C.psexam.psexm. C.28) In linked lists there are no NULL links in A. 9. 5 x 6 matrix with 9 non-zero entries 5 x 6 matrix with 8 non-zero entries 6 x 5 matrix with 8 non-zero entries 6 x 5 matrix with 9 non-zero entries Q.B.com (Computer Science Exam Preparation) http://new.24) Number of swapping. Which of the following stack configuration is not possible A. B. 22. B. 16 12 6 10 Q.C is A.com (Learning MS Word in PS Exam) http://cplusplus. 5.r. B. D. Q.23) nn In evaluating arithmatic expression 2*3-(4+5) using postfix stack form. -----------|4|6| ----------------------|5|4|6| ----------------------|9|6| ----------------------|9|3|2| ------------ B.25) Number of possible ordered trees with 3 nodes A. B.com (C++ Programming Language Tutorial and Exam Preparation) http://data-structures-and-algorithms. D. .27) In which of the following cases linked list implementaion of sparse matrices consumes same memory as a normal array A. C. D.

psexam. B.psexam.2 2. D.34) To arrange a binary tree in ascending order we need A.2.2.com (Computer Science Exam Preparation) http://new. n2 nn n3 n Q. Push(1).1. C. Q.2. Pop. where n is input size is given by T(n) = 8 T(n/2) + qn. First record of the actual data http://msword. if. Pop. Push(2). Push(1). 2. C.2.com (Computer Operator Exam Preparation) D. B.2. Pop. D. A3. B.30) Running time of an algorithm T(n). D. C. Push(2).1 2. post order traversal inorder traversal preorder traversal none of above Q.psexam.31) The total number of comparisons in a bubble sort is A. O(n logn) O(2n) O(n2) None of above Q.com (Algorithms and Data Structures Tutorials and Exam Preparation. Pop. The sequences of popped out values are A. D. C. Pop. that the former is A. n=1 where p and q are constants.1.psexam.1.com (C++ Programming Language Tutorial and Exam Preparation) http://data-structures-and-algorithms. Which is best algorithm A. The order of algorithm is A. Push(2). if n>1 T(n) = p.2 Q. D. .2.29) None of these Following sequence of operation is performed on a stack. A1 A2 A3 A4 Q. A2. log log(n).2 2.psexm.com (Learning MS Word in PS Exam) http://cplusplus. D.33) Four altorithm A1. n.1.1.http://www. C.35) The dummy header in linked list contain A.2. B. B.32) The advantage of sparse matrix linked list representationn over dope vector method is. A4 solves a problem with order log(n). B. C. nlog(n). Conceptually easier Completely dynamic Efficient in accessing an entry Efficient if the sparse matr4ix is a band matrix Q.

D.37) Which algorithm solves all pair shortest path problem A.psexam.39) Which of the following is correct A. Dijkastra's algorithm Floyd's algorithm Prim's algorithm Worshal's algorithm Q.38) In above question average access time will be A.psexm. 38. D.40) In a balance binary tree the height of two sub trees of every node can not differ by more than A. Internal sorting is used.com (Computer Science Exam Preparation) http://new. B.http://www. C.com (Learning MS Word in PS Exam) http://cplusplus. B. . 11.com (Algorithms and Data Structures Tutorials and Exam Preparation. B.36) Last record of the actual data Pointer to the last record of the actual data None of above Hash function f is defined as f(key) = key mod 7. D.com (C++ Programming Language Tutorial and Exam Preparation) http://data-structures-and-algorithms. C. C. Q. if number of items to be sorted is very large External sorting needs auxiliary storage Internal sorting needs auxuliary storage Q. 2 1 0 3 Q. D.psexam.psexam. D. C. D. D. B. 72. C. 48. 150 140 55 None of the above Q.psexam. 56 into a table indexed from 0 to 6.com (Computer Operator Exam Preparation) B. C. 98. C. 3 4 5 6 Q.41) Which of the following algorithm has n log (n) time complexity A. 11 will be stored at the location A. if number of items to be sorted is very large External sorting is used. B. Heap sort Quick sort Insertion sort Selection sort http://msword. If linear probing is used to insert the key 37. B.

if n>3 otherwise T(n)=n. C. C.com (Learning MS Word in PS Exam) http://cplusplus. Stable Consistent External Linear Q. D. B. T(3) where algorithm order become constant A. b=6.47) The order of binary search algorithm is A. B. D.com (Computer Operator Exam Preparation) Q. C.psexam. C. where a=3. d=5 is A.psexam. D. D. T(2). B. T(1)=T(2)=T(3) T(1) + T(2) = 2T2 http://msword.43) The information about an array used in a program will be stored in A. B.http://www. B.psexam. xxx and zzz are the elements of a lexically ordered binary tree.psexm.48) If running time of an algorithm is given by T(n) = T(n-1) + T(n-2) + T(n-3). B.45) A sorting technique which guarrantees that records with same primary key occurs in the sorted list as in the original unsorted list is said to be A. C. what should be relation between T(1). c=1. C.42) In array representation of binary tree teh right child of root will be at location of A.46) If yyy.com (C++ Programming Language Tutorial and Exam Preparation) http://data-structures-and-algorithms. D. D. n n2 n log n log n Q. xxx yyy zzz Can not be determined Q. . then in preorder traversal which node will be traverse first A.com (Algorithms and Data Structures Tutorials and Exam Preparation. 0 5 10 15 Q.44) Symbol table Dope vector Register vector Activation table 2 5 3 0 The result of evaluating prefix expression */b+0dacd.com (Computer Science Exam Preparation) http://new. Q. B.psexam. Q.

psexam.psexam. D. B. then a new number 10 should be placed at A.psexam.com (Algorithms and Data Structures Tutorials and Exam Preparation.http://www.com (C++ Programming Language Tutorial and Exam Preparation) http://data-structures-and-algorithms. Q. C.psexam.com (Learning MS Word in PS Exam) http://cplusplus.49) T(1) . B. Q.psexm.T(3) = T(2) T(1) + T(2) = T(3) If the following tree is used for sorting. D. 8/3 8/5 11/7 11/6 http://msword.com (Computer Science Exam Preparation) http://new. C. .50) Right child of node labeled 7 Left child of node labeled 7 Left child of node labeled 14 Right child of node labeled 8 The average number of comparisions performed by merge sort alrotithm in merging two sorted list of length 2 is A.com (Computer Operator Exam Preparation) C. D.

- Minor Project
- TES-36-158110_26_6_2016
- IJP_ Sales & Marketin_150216.docx
- NAYAGARH AUTONMOUS COLLEGE.docx
- Book1
- Forecasting
- FedEx Sales Force Integration - Example of How to Do3
- Samsung Smartphone Pricing (June2014)
- Samsung Smartphone Pricing (June2014)
- Problem Statement
- overview.pptx
- Zoiper 2.0 Free Manual
- Drilling Machine
- CWESPL_DEC11_3000337213
- GPS INS Integration SKocaman
- Air Palution
- PPT2011-Test13Question_ANSWER

- Data Structures a Algorithms Multiple Choice Questions Mcqs Objective Set 1
- Data Structure MCQ
- data-structures-a-algorithms-multiple-choice-questions-mcqs-objective-set-2
- DBMS.MCQs
- MCQ's of Operating System (OS)
- MC0068 - Set 2
- Software Engineering MCQ Exam
- MT0033 – DATA STRUCTURES USING ‘C’
- os-mcq
- MC0068 - Set 1
- 50756667 Data Structure Objective Questions
- Data Structures a Algorithms Multiple Choset 3
- Database Management System and Design MCQ
- Multiple Choice Question of Computer Networking
- mcq
- Software Engineering Quiz
- Assignment Software Engineering
- 203 Dbms Question Bank
- mcq
- MCQ of C++
- C++ quiz
- Operating System Mcq
- Suggestion Paper for CS503 - Design and Analysis of Algorithm
- Operating System for Online
- Assignments 3
- data structure objective questions
- c Multiple Choice Questions and Answers PDF
- Cs33- Data Structures Questions and Answers
- DBMS MCQ
- Database Management System for Online
- MCQ-Test-Questions-on-Data-Structures-and-Algorithms-www.psexam.com_

Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

We've moved you to where you read on your other device.

Get the full title to continue

Get the full title to continue reading from where you left off, or restart the preview.

scribd