Scribd
Upload
7 views3 pages

Data Structure Important Questions Chapter Wise.

The document outlines a comprehensive syllabus for a Data Structures course at A.P.S College of Arts and Science, covering topics from non-primitive data structures to hashing techniques. It includes detailed questions and programming tasks across ten chapters, addressing algorithms, complexity, various data structures like arrays, linked lists, trees, and sorting methods. Each chapter emphasizes both theoretical concepts and practical programming examples.

Uploaded by

paulalex5498
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
7 views3 pages

Data Structure Important Questions Chapter Wise.

The document outlines a comprehensive syllabus for a Data Structures course at A.P.S College of Arts and Science, covering topics from non-primitive data structures to hashing techniques. It includes detailed questions and programming tasks across ten chapters, addressing algorithms, complexity, various data structures like arrays, linked lists, trees, and sorting methods. Each chapter emphasizes both theoretical concepts and practical programming examples.

Uploaded by

paulalex5498
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

[Type the document title]

A.P.S COLLEGE OF ARTS AND SCIEN0CE


N.R.COLONY, BANGALORE-19
II Semester BCA
Data structure:
Chapter1:
1).what is non-primitive ds?give example
2.define ADT?
3.Write note on Queue ADT?
4.Define Algorithm and algorithm complexity.
5.what is the relationship b/w ADT and Data structure.
6.Define space and time complexity.
7.Define Data Structure list the types of Data structure.

Chapter2:
1.brifly explain best case, average case and worst case time complexity of an algorithm.
2.find out the space required for matrix multiplication and factorial of a number.
3.define big 0notation,Omega and Theta Notation.
4.Explain algorithmic notation with examples.
5.explain all the case efficiency of an algorithm?

Chapter3:
1.list any four string operations?
2.explain the difference storage representation of strings?
3.what is pattern matching give an example?
4.list any four string library functions in c?
5.write a program to find length of a string, concatenate two strings ,compare two strings.
6.explain knuth-morrie prat algorithm[kmp algorithm]

Chapter4:
1.define an array, linear array?
2.explain array as ADT?
3.Write c program to perform insert and delete operation on array.
4.different between static array and dynamic array.
5.how linear arrays and represented in memory?
6.what is multidimensional array, spare matrices?
7. explain memory and row major representation of multi dimensional arrays.

Chapter5:
1.compare bubble sort, insertion sort and selection sort techniques.
2.show the steps to sort the element 25,57,48,37,12,92,86,33 using selection sort?
3.how merge sort works ? explain with an example
4.how linear search works? explain with an example?
5.explain a. binary search ,b.linear search and its complexity.
6.compare linear and binary search techniques.
7.explain all types of sorting methods?
(concentrate on programs also(as example))

DN NOTES
Page 1
[Type the document title]

Chapter 6.
1.define linked list (all types of linked list include)
2.explain linked list representation of stacks and queues.
3. write an algorithm for traversing a singly linked list , doubly and circular linked list?
4.compare singly linked list v/s doubly linked list?
5.what is garbage collection?
6.explain types of operations on linked list?
7.explain static representation of linked list?
8.advantages and disadvantages of all type of linked list?
9.applications of linked list?
10.explain the types of operations of singly linked list, doubly linked list, circular linked list?
((concentrate on programs also(as example))

Chapter 7
Write algorithm for push and pop operation on a linked stacks.
2.explain recursion of characteristics of recursion.
3.write an algorithm for tower of Hanoi problem.
4.write a program to generate Fibonacci series, factorial of a number, tower of honoi.
5.advantage and disadvantages of recursion,
6.what is infix notation ,prefix polish notation.
7.write a c program to convert infix to postfix expression.
8.write prefix and post fix form of the
a.(A+B)*C-(D-E))/(F+G) B.(A+B)*(C+D-E)*F C. (A+B)*(C+D)*(A+B)

Chapter 8:
1.explain queue as ADT?
2.Write advantages and disadvantages of array representation of queues.
3.explain linked list representation of queues.
4.expain types of queues with example?
5.explain the working of circular ,doubly and singly linked list with example.
6.discuss the applications of queues.
7.write an algorithm for insert and delete operations on a queue.

Chapter 9:
1.define a)degree b)leaf c)level d)depth or height e)siblings f)forest
2.write an algorithm for constructing a
a)binary search tree
b)red black tree
c)AVL Tree
d)B-Tree
3.what is red black tree and explain the properties of red black trees.
4.what is balance factor in AVL Trees? give example.
5.what is heap tree ?how it is different from BST?
6.Define B-tree, explain B-tree
7.write a algorithm for in order ,pre order and post order traversal of a binary tree.
8.write the applications of trees.
9.what is external searching ?give an example of B-Tree .

DN NOTES
Page 2
[Type the document title]

10.explain insert and delete operations in a red black tree with an example?
Chapter 10
1.explain hashing works with an example?
2.explain hast table as ADT?
3.What are the characteristics of good hash functions?
4.what is hast table? give example
5.explain various methods of choosing a hashing functions

DN NOTES
Page 3

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy