Scribd
Upload
43 views2 pages

Assignment Bmc-205 Unit-4 GJ

This document outlines an assignment for the Master of Computer Applications program focusing on Data Structures and Algorithms, specifically trees and their various types and operations. It includes questions on tree terminology, binary search trees, tree traversal techniques, AVL trees, and Huffman coding, along with programming tasks in C. The assignment is scheduled for submission on June 5, 2025, and emphasizes understanding and applying concepts related to tree data structures.

Uploaded by

Vanshika Varshney
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
43 views2 pages

Assignment Bmc-205 Unit-4 GJ

This document outlines an assignment for the Master of Computer Applications program focusing on Data Structures and Algorithms, specifically trees and their various types and operations. It includes questions on tree terminology, binary search trees, tree traversal techniques, AVL trees, and Huffman coding, along with programming tasks in C. The assignment is scheduled for submission on June 5, 2025, and emphasizes understanding and applying concepts related to tree data structures.

Uploaded by

Vanshika Varshney
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/ 2

[Approved by AICTE, GOVT. of India & Affiliated to Dr.

APJ
Abdul Kalam Technical University, Lucknow, U.P. India]
Department of Master of Computer Applications

Department of MCA
MCA Sem: IIst Sec: A1,A2,A3
Session 2024-25 (Even Semester)

Assignment- 4

Subject Name: Data Structures & Analysis of Algorithms Subject Code: BMC 205

Date of Assignment: 29.05.2025 Date of Submission: 05.06.2025

UNIT - IV
Trees: Basic terminology used with Tree, Binary Trees, Binary Tree Representation: Array Representation and
Pointer (Linked List) Representation, Binary Search Tree, Complete Binary Tree, Extended Binary Trees.
Tree Traversal algorithms: Inorder, Preorder and Postorder, Constructing Binary Tree from given Tree Traversal,
Operation of Insertion, Deletion, Searching & Modification of data in Binary Search Tree.
Threaded Binary Trees, Huffman coding using Binary Tree, AVL Tree and B Tree.

Q.
Questions Marks CO KL
No.
1 Define tree terminology and differentiate types of trees (Binary, Binary Search Tree, 1 CO3 K2
Complete Binary Tree).
2 Design a Binary Search Tree program in C, including insertion and deletion 1 CO3 K3
operations.
3 Explain tree traversal techniques (Inorder, Preorder, Postorder) with examples. 1 CO3 K2

4 Describe AVL Tree and analyze how rotations balance the tree. 1 CO3 K4

5 Develop a Huffman Coding program using Binary Tree in C. 2 CO3 K3


6 Scenario: A company's employee records need to be searched efficiently by employee 2 CO3 K4
ID. Suggest which tree structure (BST, AVL, B-Tree) is most suitable and justify your
choice.
7 Scenario: You’re designing a file compression tool. How would you implement 2 CO3 K4
Huffman coding to optimize the storage of text files?

Signature & Name of Faculty HOD Signature


Date: Date:

CO-Course Outcomes mapped with respective question


KL- Bloom's Knowledge Level (K1, K2, K3, K4, K5, and
K6)

K1 – Remember K2 – Understand K3 – Apply K4 – Analyze K5 – Evaluate K6- Create

Note: Use A-4 size sheets to write their answer. Avoid copying assignments
[Approved by AICTE, GOVT. of India & Affiliated to Dr. APJ
Abdul Kalam Technical University, Lucknow, U.P. India]
Department of Master of Computer Applications

You might also like