Scribd
Upload
7 views1 page

CIE II Question Bank

The document covers various data structures including linked lists, trees, and graphs. It explains types of linked lists and their operations, details on binary search trees (BST), AVL trees, B-trees, and operations on doubly linked lists. Additionally, it discusses graph traversal techniques, terminology, and data structures used for graph representation.

Uploaded by

anujsable001
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 views1 page

CIE II Question Bank

The document covers various data structures including linked lists, trees, and graphs. It explains types of linked lists and their operations, details on binary search trees (BST), AVL trees, B-trees, and operations on doubly linked lists. Additionally, it discusses graph traversal techniques, terminology, and data structures used for graph representation.

Uploaded by

anujsable001
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/ 1

3.

Linked List
1. List and explain various types of Linked List with appropriate examples.
2. Explain the following operations on the singly linked list
a.Insertion.
b.Searching.
c.traversing
3. Explain the following operations on the circular linked list : a.Insertion. b.Searching. c.Traversing
4. List and explain various types of Linked List with appropriate examples.

5.Trees
1. Draw the BST for the given input: 10, 1, 5, 15, 10, 20, 2, 16, 7, 20, 2, 1 Write the inorder
traversal of the BST.
2. What is AVL tree? Explain inset node operation of AVL tree.
3. What is B-tree? Explain with suitable example, insertion of a node in B-Tree?
4. Define the following terms with example:
a. Strictly Binary Tree
b. AVL tree
c. Heap tree
5. Explain the following operations on the doubly linked list
1. Insertion.
2. Searching.
3. Traversing
6. Explain Heap sort with example.
7. Explain following tree terminologies with suitable example a. Terminal Nodes b. Degree of a
Node c. Degree of a Tree 35 What is use of Binary Search Tree? Construct BST for following set
of key values. 55,45,30,65,54,32,35,50,61
8. Define B Tree and Construct B Tree of order 4 for given numbers 1, 6, 8, 2, 9, 12, 15, 7, 18, 3, 4,
20
9. What is use of Binary Search Tree? Construct BST for following set of key values.
55,45,30,65,54,32,35,50,61

6. Graph
1. Difference between DFS and BFS
2. Explain Graph terminology. Give various types of Graphs
3. Explain graph traversal techniques with Example-DFS
4. Describe data structures used for storing a graph.
5. Explain graph traversal techniques with Example-BFS
6. Explain Graph basic concepts and its storage representation
7. Define the following terms with example
1. Path
2. Directed Graph
3. Strongly Connected Graph
4. Weighted Graph

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