Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
8 views

Final Lab Exam Program List

The document outlines the syllabus for a Data Structures Lab course in the Computer Science and Engineering department, detailing course structure, assessment weightage, and minimum passing criteria. It includes programming tasks for students, such as defining structures, implementing various data structures (like linked lists and queues), and converting expressions using stacks. The document emphasizes dynamic memory allocation and requires students to learn multiple operations on data structures for examination purposes.

Uploaded by

vibhavspaerk
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
8 views

Final Lab Exam Program List

The document outlines the syllabus for a Data Structures Lab course in the Computer Science and Engineering department, detailing course structure, assessment weightage, and minimum passing criteria. It includes programming tasks for students, such as defining structures, implementing various data structures (like linked lists and queues), and converting expressions using stacks. The document emphasizes dynamic memory allocation and requires students to learn multiple operations on data structures for examination purposes.

Uploaded by

vibhavspaerk
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/ 2

DEPARTMENT Computer Science and Engineering

Course Code 22CS36L Total 1.5 Course Type Professional Core Course
Credits

Course Title Data Structures Lab


Contact Credits Assessment in

Teaching Hours Weightage and marks


Learning
Process Lecture 0 0 CIE SEE Total

Tutorial 0 0 Weightage 40 % 60 % 100 %

Practical 39 1.5 Maximum 40 60 100 Marks


Marks Marks Marks

Total 39 1.5 Minimum 20 25 45 Marks


Marks marks marks

Note: *For passing the student has to score a minimum of 45 Marks (CIE+SEE: 20 +
25 or 21 + 24)

1. Define a structure called Student with the members: Name, Reg_no, marks in 3 tests and average_
marks.
Develop a menu driven program to perform the following by writing separate function for each
operation: a) read information of N students b) display student’s information c) to calculate the
average of best two test marks of each student. d) Sort students based on Reg_no.
Note: Allocate memory dynamically and illustrate the use of pointer to an array of structure.

2. Develop a menu driven program to implement the following operations on an array of integers
with dynamic memory allocation. Display the array contents after each operation.
i)Insert by position ii)) Insert by order iii) Delete by position iv) Delete by key v) Search by
position vi) ) Search by key vii) Reverse the contents.
Display the list contents after each operation
Note: Students are required to learn all operations. In the exam, any four operations
will be asked based on complexity.
3. Implement single (circular or Non-circular ) linked list to perform the following operations
i) Insert front ii) Insert rear iii) Insert by position iv) Insert by order v ) Delete Front
vi) Delete Rear vii) Delete by position viii) Delete by Key ix) Search for an item by key
x) Search for an item by position.
Display the list contents after each operation
Note: Students are required to learn all operations. In the exam, any four operations
will be asked based on complexity.
4. Implement circular double linked list with header to perform the following operations
i) Insert front ii) Insert rear iii) Insert by position iv) Insert by order v ) Delete Front
vi) Delete Rear vii) Delete by position viii) Delete by Key ix) Search for an item by key
x) Search for an item by position.
Display the list contents after each operation
Note: Students are required to learn all operations. In the exam, any four operations
will be asked based on complexity.

5. Develop a menu driven program to convert infix expression to postfix expression using
stack and evaluate the postfix expression. (Test for nested parenthesized expressions)
Note: Define Stack structure and implement the operations. Use different stacks for
conversion and evaluation.

6. Develop a menu driven program to convert infix expression to prefix expression using
stack and evaluate the prefix expression (Test for nested parenthesized expressions)
Note: Define Stack structure and implement the operations. Use different stacks for
conversion and evaluation.

7. Develop a menu driven program to implement the following types of Queues with array
representation by allocating memory dynamically.
i) Circular Queue ii) Double ended Queue
Note: Define Queue structure and implement the operation

8. Develop a menu driven program to implement the following types of Queues with array
representation by allocating memory dynamically.
i) Circular Queue ii) Priority Queue
Note: Define Queue structure and implement the operation

9. Develop a menu driven program to implement Binary Search tree with the following
operations.
i)Construction ii) Traversals( DFS and BFS) iii) Searching a node by key and displaying
its information along with its parent if exists, otherwise a suitable message. iv) Counting
all nodes. v) Finding height. vi )Finding node with the Maximum key value and printing the
node details along with the parent. vi)Searching a node by key and deleting if exists ( node
to be deleted may be leaf or non- leaf with one child or two children)

Note: Students are required to learn all operations. In the exam, any four operations
will be asked based on complexity.
.

You might also like