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

Welcome to Scribd! Start your free trial and access books, documents and more.

Find out more**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.

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

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

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

B. C. D. T(n) = d if n<1. ii.com (Algorithms and Data Structures Tutorials and Exam Preparation. A.com (Learning MS Word in PS Exam) http://cplusplus. .22) Only (i) Only (ii) Both (i) and (ii) Both (ii) and (III) Running time T(n).http://www. D.9 If the address of (I.7 2. n2 n n3 http://msword. Q. B. where 'n' is input size of recursive algorithm is given as follows: T(n) = c + T(n-1).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]. where it stores the position of first and last non-zero entries of each row is given by C. D.J)th entry.psexam. if n>1.8 2. The order of algorithm is A.com (Computer Science Exam Preparation) http://new. Q.6 2.com (C++ Programming Language Tutorial and Exam Preparation) http://data-structures-and-algorithms.20) 2.psexam. B. iii.psexam.psexm. Q. C. B. iv. C. in dope vector representation.com (Computer Operator Exam Preparation) A.psexam. C. assume l(n) and f(n) represent the last and first non-zero entries in row x i. then tree is called as (i) Full m-ary try (ii) Com plete m-ary tree (iii)Positional m-ary tree A.

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

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

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

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

49) T(1) .psexam. .psexam.com (C++ Programming Language Tutorial and Exam Preparation) http://data-structures-and-algorithms.com (Learning MS Word in PS Exam) http://cplusplus. Q.http://www.com (Computer Operator Exam Preparation) C. Q. 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.psexam.com (Algorithms and Data Structures Tutorials and Exam Preparation. 8/3 8/5 11/7 11/6 http://msword.psexm. B. D.T(3) = T(2) T(1) + T(2) = T(3) If the following tree is used for sorting. D. then a new number 10 should be placed at A. D. C.psexam.com (Computer Science Exam Preparation) http://new. B.

- 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
- csc 233 exam 2010-2011
- Data Structure
- MC0068 - Set 2
- MCQ's of Operating System (OS)
- Software Engineering MCQ Exam
- MT0033 – DATA STRUCTURES USING ‘C’
- [IJCST-V4I3P26]:Geetika Gupta, Rupinder Kaur, Arun Bansal
- M.sc. is Scheme of Instruction 16092014
- os-mcq
- 5 - 3 - Insertion Sort (928)
- rr311203-computer-graphics
- All_ds_solution.doc
- 10.1.1.44
- Chap2 Solutions
- String Matching Algorithms and their Applicability in various Applications
- NewAmulyaYadavresume
- MC0068 - Set 1
- A Modified Recursive X-Y Cut Algorithm for Solving Block Ordering Problems
- Ben Roberts Equity Model
- CG1 2010 June QP
- ep08_93 (2)
- A Refinement of Digital-To-Analog Converters
- 4imis Specimen Qp v2
- Ch4
- PROBLEMA 3
- CS.Nov-Dec.2012

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