Scribd
Upload
706 views

320 - CS8391 Data Structures - Important Questions 2

This document contains important questions from 5 units of the CS8391 Data Structures course for the 3rd semester of Anna University's BE/BTECH program. The units cover topics like arrays and linked lists, stacks and queues, binary search trees, graphs, sorting and hashing techniques. For each unit, 5 questions are provided related to algorithms and implementations of various data structures.

Uploaded by

current job
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
706 views

320 - CS8391 Data Structures - Important Questions 2

This document contains important questions from 5 units of the CS8391 Data Structures course for the 3rd semester of Anna University's BE/BTECH program. The units cover topics like arrays and linked lists, stacks and queues, binary search trees, graphs, sorting and hashing techniques. For each unit, 5 questions are provided related to algorithms and implementations of various data structures.

Uploaded by

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

Click Here for Data Structures full study material.

Anna University Exams – Regulation 2017


Important Questions – 3rd Semester BE/BTECH
CS8391 Data Structures
Unit-I
1. Explain the array implementation of list ADT with routine and example.
2. Explain the insertion and deletion operations (a) single linked list (b)double linked list
3.How polynomials are represented as linked list? Give an example.Write a routine to add two
polynomials using linked list
4. Explain the different types of Linked Lists and its Implementation
5. Construct the algorithm for Circular Linked list for the following operations using structure pointer (a)
Create & Insert (b) Delete & Display

Unit-II
1. Convert the infix expression a+b^c+(d*e/f)*g to postfix expression and evaluate the same
using stack. a=3, b=5, c=2, d=7, e=4, f=1, g=8
2. Explain the operations and the implementation of Stack ADT using Array.
3. Explain the operations and the implementation of Queue ADT using Linked list
4. Explain Prefix, Infix and postfix expressions with an example.
5 .Briefly describe the operations of stack and queue with examples.

Unit-III
1. Write an algorithm to find an element from binary search tree.
13, 3, 4, 15, 19, 25, 35, 69, 15, 12, 14, 17, 18.
2. Write an algorithm to insert , delete, Find minimum and maximum element from binary search tree
3.What are the tree traversal techniques? Explain with an example.
4. Explain the AVL tree insertion and deletion with suitable example
5. Explain about B-Tree and B+ Tree with suitable example
Unit-IV
1. Explain Breadth First and Depth first Search algorithm in detail
2. Describe in detail about the following representations of a graph(a) Adjacency Matrix (b) Adjacency List
3. Illustrate Kruskal’s algorithm to find the minimum spanning tree of a graph. Trace the algorithm for the
following graph

4. Discuss the prims algorithm for minimum spanning tree.Give an example


5. Describe any one of the shortest path algorithms with suitable example
Unit V
1. Describe how the divide and conquer technique is implemented in binary search
2. List the different types of hashing techniques with example
3. Describe the open addressing and chaining methods of collusion resolution techniques in hashing
4. Develop an algorithm various sorting (study all sorting techniques in syllabus) with an example

www.BrainKart.com

You might also like