Scribd
Upload
16 views4 pages

QUESTION BANK ECE DSA

This document is a question bank for the Data Structures & Algorithm Lab course for 4th semester ECE students, covering various topics across four units. It includes questions on search algorithms, data structures, linked lists, trees, heaps, and sorting algorithms, with a mix of 2, 4, and 8 mark questions. The document aims to assess students' understanding of key concepts and their ability to apply algorithms in practical scenarios.

Uploaded by

pallavprem2003
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
16 views4 pages

QUESTION BANK ECE DSA

This document is a question bank for the Data Structures & Algorithm Lab course for 4th semester ECE students, covering various topics across four units. It includes questions on search algorithms, data structures, linked lists, trees, heaps, and sorting algorithms, with a mix of 2, 4, and 8 mark questions. The document aims to assess students' understanding of key concepts and their ability to apply algorithms in practical scenarios.

Uploaded by

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

QUESTION BANK

SUBJECT: DATA STRUCTURES & ALGORITHM LAB


Semester: 4th, ECE, Batch 2020, Feb- June 2022
SUBJECT CODE: BTCS 302-18

UNIT- I: 2 marks
1 Differentiate between linear search and binary search.
2 Explain asymptotic notations in detail.
3 What is meant by time complexity? Define different time complexity notations.
Give examples one for each.
4 Classify various data structures.
5 Define ADT data structures.
6 Differentiate between data structure & data type?
7 What is the significance of Big -OH notation?
8 Differentiate between LIFO & FIFO.
9 Write an algorithm for binary search.
10 Application of Graph, stack and Queue.
11 Define the term DFS and BFS.
12 Write down the syntax of dynamic memory allocation.
13 What are the time complexity of Bubble and Quick Sort?
14 What is Binary Search tree?
15What is the significance of priority queue?

UNIT- II: 4, 8 Marks Question


S.N:o Question
1 Explain about sparse matrices
2 What is Stack? Explain about application of stack?
3 Explain linked stack implementation.
4 Explain the concept of recursion with suitable example.
5 What is Queue? Define the implementation with array and linked list?
6 Explain all operations of STACK ADT.
7 Explain all operations that can be performed on Queue ADT.
8 What are various applications of priority queue & Dequeue.
9 Explain the concept of Linked list in detail and also explain its types.
10 Explain algorithm to convert infix to postfix expression using stacks.
11 Explain algorithm to evaluate postfix expression using stack.
12 Differentiate between operator precedence & associativity.
13 Explain implementation of queue using linked list.
14 Write algorithm for insertion & deletion in a queue.
15 Explain algorithm for PUSH & POP in stack.
16 What is searching? Explain Binary and Linear Search?

UNIT-III:
S.No 8 Marks Question
1 Differentiate between Single linked list and circular linked list
2 Differentiate between Double linked list and single linked list
3 Differentiate between Double linked list and circular linked list
4 Explain algorithm to insert an element at the beginning, at a specified position &
at the end of a singly linked list.
5 Explain algorithm to delete an element from the beginning, from a specified
position & from the end of a singly linked list.
6 What are header linked list?
7 What are the advantages of doubly linked list over singly linked list?
8 Explain traversing, insertion & deletion algorithms on circular linked list with
appropriate example.
9 Explain algorithm to delete an element from the beginning, from a specified
position & from the end of a doubly linked list.
10 Explain algorithm to delete an element from the beginning, from a specified
position & from the end of a doubly linked list.

UNIT IV
S.No (Question 4 & 8 Marks question)
1 What is Binary Tree? Explain about operations on Binary tree?
2 Describe in brief about array and linked representations of binary tree
3 Write a short note on Threaded binary trees
4 Describe the concept of tree traversals with an example.
5 Describe a procedure to insert and delete an element into a Max Heap
6 Differentiate between tree and binary tree
7 Explain insertion in B-tree with example.
8 Explain deletion in B-tree with example.
9 Explain insertion in B+tree with example.
10 Explain deletion in B+tree with example.
11 Explain insertion in AVL with example.
12 Explain deletion in AVL with example.
13 Define threaded binary tree and give an example
14 Define the following a. Max heap b. Min heap
15 What are the advantages of AVL tree? What is acceptable balancing factor for
AVL tree.
16 Differentiate between B+ & B-tree.
17 Describe a procedure about insertion and deletion operations of BST.
18 What is Graph? Explain linked list representation of graphs.
19 Differentiate between graph and tree.
20 Explain BFS traversal in a graph taking suitable example.
21 Explain array representation of graphs.
22 What are PROS & CONS of adjacency matrix?
23 Explain DFS traversal in a graph taking suitable example.
24vDefine multigraph & digraph.
25 Explain various types of binary trees.

UNIT IV
S.No Question
1 Perform complexity analysis of bubble sort algorithm
2 What is sorting? Explain about Selection and Heap Sorting
3 Illustrate the concept of Merge sort taking suitable example.
4 Construct binary tree from given inorder and preorder elements.
Inorder - 2,5,7,8,99,65,43,32,45,76
Preorder- 65,43,2,7,8,45,99,76,5,32
5 Explain algorithm for Insertion sort taking suitable example
6 Differentiate between quick sort and merge sort
7 What is the time complexity of quick sort in best, worst and average case
8 Define hash tables
9 Write an algorithm of Merge sort
10 Apply selection sort algorithm on given set of integers.
11 Explain the concept of stable .
12 Compare best, worst and average case complexity scenarios of quicksort &
mergesort.
13 What are recurrence relations?
14 Apply bubble sort algorithm on given set of integers.

Prepared by:
Er. Meenakshi Garg

You might also like