Scribd
Upload
106 views4 pages

Important Questions

The document outlines a course on Data Structures using C and C++, covering various topics such as arrays, stacks, queues, linked lists, trees, B-trees, and sorting algorithms. Each unit includes definitions, algorithms, and example problems to illustrate the concepts. Key algorithms discussed include those for insertion, deletion, searching, and sorting within different data structures.

Uploaded by

onlymusic2332
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
106 views4 pages

Important Questions

The document outlines a course on Data Structures using C and C++, covering various topics such as arrays, stacks, queues, linked lists, trees, B-trees, and sorting algorithms. Each unit includes definitions, algorithms, and example problems to illustrate the concepts. Key algorithms discussed include those for insertion, deletion, searching, and sorting within different data structures.

Uploaded by

onlymusic2332
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/ 4

Data Structure Using C & C++(Course Code: 0327002)

Unit -1- Introduction to Data Structure and its Characteristics Array


Q1)What is data structure?Describe the types of data structures

Q2) What is an array? How to declare and initialize arrays? Explain with examples
Q3) How can we declare and initialize 2D arrays? Explain with examples.
Q4) Explain how two dimensional arrays can be used to represent matrices. (or) Define an array and how the memory is allocated for a 2D
array?
Q5) Write a program to perform matrix addition.
Q6) What is a sparse array?

Unit-II-Stacks and queues


Q1)Explain Stack Data Structure. Write an algorithm for inserting an element in stack and deletion of an element from a stack.How can we
perform array representation of stacks
Q2) Explain Polish Notation and Reverse Polish Notation with example
Q3)Write an algorithm for evaluation of postfix notation .Evaluate the following arithmetic expression using the algorithm
P:5,6,2,+,*,12,4,/,-

Q4)Write an algorithm for transforming infix to postfix expression.Convert the following Infix to postfix using the algorithm
A+(B*C-(D/E^F)*G)*H
Q5)write short notes on
a)Recursion
b)Tower of Hanoi

Q6)Explain Queues.Write algorithm for insertion and deletion in queue


Q7)Explain Circular queue
Q8)Explain deques and Priority queues

Unit-3-Linked List

Q1)Explain Linked List.How can we represent linked list in memory


Q2)Write an algorithm for traversing a linked list
Q3)How can we search an element in a linked list if list is unsorted
Q4) How can we search an element in a linked list if list is sorted
Q5)Write an algorithm to insert an element in linked list at the beginning of the list,Inserting after given a node

Unit-4- Trees
Q1)Explain Binary tree with example
Q2)Explain complete binary tree
Q3)Give Linked representation of binary tree

Q4)Explain different ways of traversing binary trees.Write algorithm for all of these
Q5)Explain Binary search tree.Write an algorithm for searching an item in binary search tree
Q6) Write an algorithm for insert and delete an item in binary search tree

Unit-5 B-Trees
Q1)Define B-Tree. How can we search ,insert and delete an item in B-Tree
Q2)Insert 5,3,21,9,13,22,7,10,,11,14,8,16 into B-tree of order=4.What will be the output after deleting 16

Unit-6

Q1)Write an algorithm for bubble sort.Sort the following using bubble sort

Q2)Write an algorithm for quick sort.Sort the following

Q3)Explain merge sort.


Q4)Write an algorithm for insertion sort with example
Q5)Write an algorithm for Linear search and binary search
Q6)What is hashing.Explain division method in hashing

You might also like