Scribd
Upload
14 views1 page

DSA Assign m345

The document outlines the course structure for 'Data Structures and Applications' (BCS304) at Bapuji Institute of Engineering and Technology. It includes course outcomes, a list of questions for assessment, and the cognitive levels associated with each question. The course aims to equip students with knowledge and practical skills in various data structures and their applications.

Uploaded by

jayadev.nishan
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
14 views1 page

DSA Assign m345

The document outlines the course structure for 'Data Structures and Applications' (BCS304) at Bapuji Institute of Engineering and Technology. It includes course outcomes, a list of questions for assessment, and the cognitive levels associated with each question. The course aims to equip students with knowledge and practical skills in various data structures and their applications.

Uploaded by

jayadev.nishan
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

Bapuji Educational Association ®

Bapuji Institute of Engineering and Technology, Davangere–577 004


Department of Computer Science and Engineering

Course Title DATA STRUCTURES AND APPLICATIONS Course Code BCS304


Course Instructors Dr.Gururaj.T Semester III Semester
CIE No.
I Max. Marks 25
(Assignment)
Date 27-11-2024

Course Outcome Statements : After the successful completion of the course, the students will be able to
CO1 Explain different data structures and their applications.
CO2 Apply Arrays, Stacks, and Queue data structures to solve the problems.
CO3 Use the concept of a linked list in problem-solving.
CO4 Develop solutions using trees and graphs to model the real-world problem.
CO5 Explain the advanced Data Structures concepts such as hashing techniques and Optimal Binary Search Trees.

Note: Answer the following questions


Q. Questions Marks RBL CO
No.
1 Discuss inorder, preorder, postorder and level order traversal with suitable recursive 2 L2 3
function for each.
2 Define Threaded Binary Tree. Discuss In-Threaded binary Tree. 2 L2 3
3 Write a function in add two polynomials using Linked List. 2 L2 3
4 Discuss selection Trees with an example. 2 L2 4
5 Define the following Terminologies with examples, 2 L2 4
(i) Digraph
(ii)Weighted graph
(iii)Self loop
(iv) Parallel edges
6 Construct a tree using the given tree traversals: 2 L3 4
In-Order : GDHBAEICF
Post-Order : GHDBIEFCA
7 Write a function to create and search for an element in a binary search tree. 2 L2 4
8 Define Threaded Binary Tree. Discuss In-threaded binary tree. 2 L2 4
9 What is a collision? What are the methods to resolve collisions? Explain linear 2 L2 5
probing with an example.
10 Explain different types of HASH function with examples. 2 L2 5
11 Discuss AVL tree with an example. Write a function for insertion into an AVL Tree. 2 L2 5
12 What is a Priority queue? Demonstrate functions in C to implement the Max Priority 3 L2 5
queue with an example.
i) Insert into the Max priority queue
ii) Delete into the Max priority queue
iii) Display Max priority queue

RBT (Revised Bloom’s Taxonomy) Levels : Cognitive Domain


L1 : Remembering L2 : Understanding L3 : Applying
L4 : Analysing L5 : Evaluating L6 : Creating

Course Instructor Course Coordinator DQAC Coordinator Program Coordinator

You might also like