# Ds qb 2021 rma

A

DATA STRUCTURE QUESTION BANK AFFILIATED TO BHARATHIAR UNIVERSITY SYLLABUS BSC COMPUTER SCIENCE WITH SAMPLE UNIVERSITY QUESTION PAPER

Finding Neighbors in Images Represented By Quadtree por
Finding Neighbors in Images Represented By Quadtreeiosrjce
194 vistas6 diapositivas
DS Q&A por
DS Q&Azzzubair
4.5K vistas187 diapositivas
Sem 1 bscit summer 2014 solved assignments por
Sem 1 bscit summer 2014 solved assignmentssmumbahelp
326 vistas4 diapositivas
Gate Previous Years Papers por
Gate Previous Years PapersRahul Jain
318 vistas15 diapositivas
Std 12 Computer Chapter 9 Working with Array and String in Java important MCQs por
Std 12 Computer Chapter 9 Working with Array and String in Java important MCQsNuzhat Memon
210 vistas35 diapositivas
Data structure part 2 por
Data structure part 2Knowledge Center Computer
223 vistas12 diapositivas

AP PGECET Computer Science 2016 question paper por
AP PGECET Computer Science 2016 question paperEneutron
688 vistas16 diapositivas
Data structure part 4 por
Data structure part 4Knowledge Center Computer
212 vistas12 diapositivas
Data structure part 3 por
Data structure part 3Knowledge Center Computer
196 vistas12 diapositivas
Cs6702 graph theory and applications Anna University question paper apr may 2... por
Cs6702 graph theory and applications Anna University question paper apr may 2...appasami
44.1K vistas40 diapositivas
Question bank por
Question bankchandrashekardk
2.6K vistas16 diapositivas
C452023.pdf por
C452023.pdfaijbm
8 vistas4 diapositivas

AP PGECET Computer Science 2016 question paper por Eneutron
AP PGECET Computer Science 2016 question paper
Eneutron688 vistas
Cs6702 graph theory and applications Anna University question paper apr may 2... por appasami
Cs6702 graph theory and applications Anna University question paper apr may 2...
appasami44.1K vistas
C452023.pdf por aijbm
C452023.pdf
aijbm8 vistas
17. Java data structures trees representation and traversal por Intro C# Book
17. Java data structures trees representation and traversal
Intro C# Book3.3K vistas
300+ top data structures and algorithms mc qs pdf 2020 por tadeseguchi
300+ top data structures and algorithms mc qs pdf 2020
Review session2 por NEEDY12345
Review session2
NEEDY12345685 vistas
7th onepagemcq 130215025622-phpapp01 por Asad Shafat
7th onepagemcq 130215025622-phpapp01
Gate Previous Years Papers por Rahul Jain
Gate Previous Years Papers
Rahul Jain339 vistas
C19 19.2 por BGEsp1
C19 19.2
BGEsp18 vistas
MCQs Ordinary Differential Equations por DrDeepaChauhan
MCQs Ordinary Differential Equations
DrDeepaChauhan1.5K vistas
Graphs, Trees, Paths and Their Representations por Amrinder Arora
Graphs, Trees, Paths and Their Representations
Amrinder Arora3.4K vistas
A practical work of matlab por SalanSD
A practical work of matlab
SalanSD240 vistas
A design of parity check matrix for short irregular ldpc codes via magic por IAEME Publication
A design of parity check matrix for short irregular ldpc codes via magic
IAEME Publication479 vistas

## Similar a Ds qb 2021 rma

Data structure - mcqs por
Data structure - mcqssuthi
5.9K vistas40 diapositivas
Data structure por
Data structureVivek Kumar Sinha
49 vistas8 diapositivas
for sbi so Ds c c++ unix rdbms sql cn os por
for sbi so Ds c c++ unix rdbms sql cn osalisha230390
620 vistas176 diapositivas
C programming & data structure por
C programming & data structurerajeev_123
2.8K vistas14 diapositivas
Data structure part 1 por
Data structure part 1Knowledge Center Computer
389 vistas13 diapositivas
DS MCQS.pptx por
DS MCQS.pptxBoomijaIT
3 vistas31 diapositivas

### Similar a Ds qb 2021 rma(20)

Data structure - mcqs por suthi
Data structure - mcqs
suthi 5.9K vistas
for sbi so Ds c c++ unix rdbms sql cn os por alisha230390
for sbi so Ds c c++ unix rdbms sql cn os
alisha230390620 vistas
C programming & data structure por rajeev_123
C programming & data structure
rajeev_1232.8K vistas
Technical aptitude questions_e_book1 por Sateesh Allu
Technical aptitude questions_e_book1
Sateesh Allu646 vistas
Redo midterm por IIUM
Redo midterm
IIUM641 vistas
II PU CS MCQ_KEY ANSWER-2022-23.pdf por study material
study material3 vistas
Dat 305 dat305 dat 305 education for service uopstudy.com por ULLPTT
Dat 305 dat305 dat 305 education for service uopstudy.com
ULLPTT43 vistas
Ee693 sept2014midsem por Gopi Saiteja
Ee693 sept2014midsem
Gopi Saiteja365 vistas
Data structure using c bcse 3102 pcs 1002 por SANTOSH RATH
Data structure using c bcse 3102 pcs 1002
SANTOSH RATH597 vistas
1. ... is very uselul in situations when diata have to be stored asd .pdf por alpha1211
1. ... is very uselul in situations when diata have to be stored asd .pdf
alpha12112 vistas
Gopi Saiteja6.3K vistas
Cplus plus abd datastructure por prabhatjon
Cplus plus abd datastructure
prabhatjon2.8K vistas
Gate Computer Science Solved Paper 2007 por Rohit Garg
Gate Computer Science Solved Paper 2007
Rohit Garg2.3K vistas

## Último

EILO EXCURSION PROGRAMME 2023 por
EILO EXCURSION PROGRAMME 2023info33492
202 vistas40 diapositivas
StudioX.pptx por
StudioX.pptxNikhileshSathyavarap
101 vistas18 diapositivas
A Guide to Applying for the Wells Mountain Initiative Scholarship 2023 por
A Guide to Applying for the Wells Mountain Initiative Scholarship 2023Excellence Foundation for South Sudan
82 vistas26 diapositivas
Retail Store Scavenger Hunt.pptx por
Retail Store Scavenger Hunt.pptxjmurphy154
52 vistas10 diapositivas
Pharmaceutical Analysis PPT (BP 102T) por
Pharmaceutical Analysis PPT (BP 102T) yakshpharmacy009
108 vistas29 diapositivas
CUNY IT Picciano.pptx por
CUNY IT Picciano.pptxapicciano
64 vistas17 diapositivas

### Último(20)

EILO EXCURSION PROGRAMME 2023 por info33492
EILO EXCURSION PROGRAMME 2023
info33492202 vistas
Retail Store Scavenger Hunt.pptx por jmurphy154
Retail Store Scavenger Hunt.pptx
jmurphy15452 vistas
Pharmaceutical Analysis PPT (BP 102T) por yakshpharmacy009
Pharmaceutical Analysis PPT (BP 102T)
yakshpharmacy009108 vistas
CUNY IT Picciano.pptx por apicciano
CUNY IT Picciano.pptx
apicciano64 vistas
JRN 362 - Lecture Twenty-Three (Epilogue) por Rich Hanley
JRN 362 - Lecture Twenty-Three (Epilogue)
Rich Hanley41 vistas
Class 9 lesson plans por TARIQ KHAN
Class 9 lesson plans
TARIQ KHAN82 vistas
ANGULARJS.pdf por ArthyR3
ANGULARJS.pdf
ArthyR351 vistas
Narration lesson plan por TARIQ KHAN
Narration lesson plan
TARIQ KHAN75 vistas
INT-244 Topic 6b Confucianism por S Meyer
INT-244 Topic 6b Confucianism
S Meyer45 vistas
The Future of Micro-credentials: Is Small Really Beautiful? por Mark Brown
The Future of Micro-credentials: Is Small Really Beautiful?
Mark Brown75 vistas
11.30.23A Poverty and Inequality in America.pptx por mary850239
11.30.23A Poverty and Inequality in America.pptx
mary850239130 vistas
NodeJS and ExpressJS.pdf por ArthyR3
NodeJS and ExpressJS.pdf
ArthyR348 vistas

### Ds qb 2021 rma

• 1. SRI VASAVI COLLEGE, ERODE SELF FINANCE WING DEPARTMENT OF COMPUTER SCIENCE II –B.Sc. Computer science DATA STRUCTURE QUESTION BANK ALL FIVE UNITS MCQ WITH ANSWERS IMPORTANT QUESTIONS UNIVERSITY QUESTION PAPER.
• 2. SUBJECT NAME: DATA STRUCTURE MCQ FOR ALL FIVE UNITS 1. A linear of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as____ a)Queue b)stack c)tree d) linked list 2. LIFO stands for a) list of outputs b) last in first out c) first in first out d) none of them 3. Circular queue is also known as______ a) ring buffer b)square buffer c) rectangle buffer d)curve buffer 4. A queue follows_____ a) FIFO b) LIFO c) ordered array d)linear tree 5. A data structure in which elements can be inserted or deleted at I from both ends but not in the middle is_____ a) queue b) circular queue c) dequeue d) priority queue 6. In stack , insertion operation is known as __ a) pop b) push c) top 7. whereas deletion operation is known as ___ a) pop b) push c)top 8. In queue insertion operation is known as____ a) Enqueue b) Dequeue 9. In queue deletion operation is known as____ a)Enqueue b) Dequeue 10. In a queue the initial values of front pointer f rare pointer r should be__and__ respectively. a) 0 and 1 b) 0 and -1 c) -1 and 0 d)1 and 0 11. which of them is an abstract datastructure (ADT) ? A)stacks b)function c) queues d) both A and C 12. The term push and pop is related to ______ a)queue b) stack c) both d) none 13. A normal queue if implemented using an array of size MAX_SIZE gets full when? a)REAR = MAX_SIZE-1 b)Front=(rear+1)mod MAX_SIZEC ) Front=rear+1D ) Rear = front 14. 14. stack can be implemented using_____ a) array and binary tree b)linked list and graph c) array and linked listd)queue and linked list 15. postfix from of following expression D+(E*F) a) EF*D+ b) DEF*+ c)DEF+* d) EFD*+ 16. What is node? A node is a basic unit of a data structure, such as a linked list or tree data structure. Nodes contain data and also may link to other nodes 17. Define garbage collection.- Garbage collection is the systematic recovery of pooled computer storage that is being used by a program 18. Define tree.- A tree is a hierarchical data structure defined as a collection of nodes. 19. Define Binary tree ?A binary tree is a tree-type non-linear data structure with a maximum of two children for each parent. 20. What is Stack.- A stack is an abstract data type that holds an ordered, linear sequence of items 21. Define Queue.- A Queue is a linear structure which follows a particular order in which the operations are performed. 22. What will be the number of passes to sort the elements using insertion sort?14, 12,16, 6, 3, 10 1
• 3. A) 6 B) 5 C) 7 D) 1 23. What is the running time of an insertion sort algorithm if the input is pre-sorted? A) O(N2)B) O(N log N)C) O(N)D) O(M log N) 24. Which of the following real time examples is based on insertion sort? A) arranging a pack of playing cardsB) database scenarios and distributes scenarios C) arranging books on a library shelfD) real-time systems 25. Which of the following sorting algorithms is the fastest for sorting small arrays? A) Quick sort B) Insertion sort C) Shell sort D) Heap sort 26. In what time can a binary heap be built? a)O(N)b) O(N log N) c) O(log N) d) O(N2) 27. Heap sort is faster than Shell sort. a) true b) false 28. Consider the following heap after bulid heap phase. What will be its corresponding array? a) 26,53,41,97,58,59,31b) 26,31,41,53,58,59,97c) 26,41,53,97,31,58,59 d) 97,53,59,26,41,58,31 29. Quick sort is a __________ a) greedy algorithmb) divide and conquer algorithm c) d) Oynamic programming algorithm d) backtracking algorithm 30. What is the worst case time complexity of the Quick sort? a) O(nlogn) b) O(n) c) O(n3 ) d) O(n2 ) 31. The best case behaviour occurs for quick sort is, if partition splits the array of size n into __________ a) n/2 : (n/2) – 1 b) n/2 : n/3 c) n/4 : 3n/2 d) n/4 : 3n/4 32. Shell sort is also known as _____________ a) diminishing decrement sort b) diminishing increment sort c) partition exchange sort d) diminishing insertion sort 33. Shell sort is applied on the elements 27 59 49 37 15 90 81 39 and the chosen decreasing sequence of increments is (5,3,1). The result after the first iteration will be a) 27 59 49 37 15 90 81 39 b) 27 59 37 49 15 90 81 39 c) 27 59 39 37 15 90 81 49 d) 15 59 49 37 27 90 81 39 34. Shell sort is an improvement on ____ a) insertion sort b) selection sort c) binary tree sort d) quick sort 35. Shell sort is more efficient than insertion sort if the length of input arrays is small. a) Trueb) False 36. Who invented the shell sort algorithm? a) John Von Neumannb) Donald Shell c) Tony Hoare d) Alan Shell 37. The number of edges from the root to the node is called Depth of the tree. 38. The number of edges from the node to the deepest leaf is called _Height of the tree. () 2
• 4. 39. The number of edges in a complete graph of n vertices is (n(n-1)/2) 40. A graph is a tree if and only if graph is (Contains no cycles) 41. A vertex of in-degree zero in a directed graph is called a/an Sink 42. What is the maximum number of children that a node can have in a binary tree?Ans 2 43. A Binary Tree can have A. Can have 2 childrenB. Can have 1 childrenC. Can have 0 children D. All of the above 44. A connected planar graph having 6 vertices, 7 edges contains ___3__ regions. 45. How many common operations are performed in a binary tree? Ans 2 46. What is a full binary tree? a) Each node has exactly zero or two children b) Each node has exactly two children c) All the leaves are at the same level d) Each node has exactly one or two children 47. What is a complete binary tree? a) Each node has exactly zero or two children b) A binary tree, which is completely filled, with the possible exception of the bottom level, which is filled from right to left c) A binary tree, which is completely filled, with the possible exception of the bottom level, which is filled from left to right d) A tree In which all nodes have degree 2 48. Which type of data structure does rope represent? a) Array b) Linked List c) Queue d) Binary Tree 49. What is a threaded binary tree traversal? a) a binary tree traversal using stacks b) a binary tree traversal using queues c) a binary tree traversal using stacks and queues d) a binary tree traversal without using stacks and queues 50. In a simple graph, the number of edges is equal to twice the sum of the degrees of the vertices. a) True b) False 51. A connected planar graph having 6 vertices, 7 edges contains _____ regions. a) 15 b) 3 c) 1 d) 11 52. Which of the following properties does a simple graph not hold? a) Must be connected b) Must be unweighted c) Must have no loops or multiple edges d) Must have no multiple edges 53. Which of the following is true? a) A graph may contain no edges and many vertices b) A graph may contain many edges and no vertices c) A graph may contan no edges and no vertices d) A graph may contain no vertices and many edges 54. In which of the following case does a Binary Decision Diagram is used for? a) Representation of Boolean Functions b) String Matching c) Searching d) Sorting of number 55. In a simple graph, the number of edges is equal to twice the sum of the degrees of the vertices. a) True b) false 3
• 5. FIVE MARKS AND EIGHT MARKS IMPORTANT QUESTION UNIT –I 1. Explain analysis of algorithm 2. What is circular queue and their advantages 3. Explain QUEUE MODEL 4. Explain linked stack and queue model 5. Write short notes on sparse matrices 6. Explain Representation of array in detailed. 7. Explain sparse matrix in detailed. 8. Explain stack and queue model in detail 9. Explain Circular Queue in detailed. 10. Explain Infix to Postfix Conversion in detailed. 11. Explain Multiple Stacks and Queues in detailed. UNIT II 1. Explain the linked stacks with algorithms 2. Explain the storage management 3. Describe the polynomial addition with an algorithm 4. Explain the Queue with an algorithm 5. Discuss the analysis of algorithm. 6. Linked Stacks and Queue 7. Polynomial addition with an algorithm 8. Dynamic storage Management 9. Garbage collection and storage compaction 10. Insert and deletion a mode from doubly linked list. UNIT III 1. What is binary tree 2. What is path 3. What a tree traversal 4. What is graph 5. What is algorithm 6. Explain briefly the principle of quick sort. 7. Write a brief node on sorting on several keys. 8. Write short note on binary tree traversal. 9. Write note on constructing spanning tree using krukal’s algorithm. 10.What is binary tree types of representation in binary tree. 11.Algorithm for finding binary spanning tree and connected. 12.Shortest path algorithm. 13.Explain Binary tree traversal and threaded binary tree. UNIT IV 1. Define Buffer 2. What is a Symbol table 3. Define Static tree table 4. Define Dynamic tree table 5. Define Hash Function 6. Define Hash table 7. Define Probing. 8. What is a Dynamic tree table? Explain briefly 9. Write a brief notes on Sequential Organization 10.What is Shell sort? Explain 11.What is a K-way merging? Discuss 12.Write a short notes on Magnetic tapes. 13.Explain Hash Function 4
• 6. 14.Write short note on K-way Merging 15.Write Short notes on merging tapes. 16.Explain Static & Dynamic tree table. 17.Explain Over flow Handling 18.Explain OBS using on Huffman algorithm. UNIT V 1. Define file? 2. Explain insertion sort and Quick sort? 3. Explain Divide Techniques & conquer Techniques. 4. What is structure property? 5. Explain sequential file? And Random Access file in detailed. 6. Write a brief note on simulation. 7. Write a brief note on pattern matching 8. Write note on static tree table. 9. Explain sequential organization of files in detailed? 5