Scribd
Upload
10 views2 pages

DSL Learning Booklet

The document outlines the syllabus for the Data Structures Lab at Fr. C. Rodrigues Institute of Technology, detailing compulsory and optional experiments for students, including stack and queue implementations, linked lists, and graph traversal techniques. It specifies the term work requirements, grading criteria, and lab objectives focused on implementing and analyzing data structures. Additionally, it maps assessment tools to course outcomes to ensure students can demonstrate proficiency in various data structure operations.

Uploaded by

riyashelke126
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
10 views2 pages

DSL Learning Booklet

The document outlines the syllabus for the Data Structures Lab at Fr. C. Rodrigues Institute of Technology, detailing compulsory and optional experiments for students, including stack and queue implementations, linked lists, and graph traversal techniques. It specifies the term work requirements, grading criteria, and lab objectives focused on implementing and analyzing data structures. Additionally, it maps assessment tools to course outcomes to ensure students can demonstrate proficiency in various data structure operations.

Uploaded by

riyashelke126
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

Agnel Charities

Fr. C. Rodrigues Institute of Technology, Vashi, Navi-


Mumbai
Department of Computer Engineering
Data Structures Lab

Syllabus
Suggested Experiments: Students are required to complete at least 10 experiments.
Star (*) marked experiments are compulsory.
Sr. No. Name of the Experiment
1* Implement Stack ADT using array.
2* Convert an Infix expression to Postfix expression using stack ADT.
3* Evaluate Postfix Expression using Stack ADT.
4 Applications of Stack ADT.
5* Implement Linear Queue ADT using array.
6* Implement Circular Queue ADT using array.
7 Implement Priority Queue ADT using array.
8* Implement Singly Linked List ADT.
9* Implement Circular Linked List ADT.
10 Implement Doubly Linked List ADT.
11* Implement Stack / Linear Queue ADT using Linked List.
12* Implement Binary Search Tree ADT using Linked List.
13* Implement Graph Traversal techniques:) Depth First Search b) Breadth First Search
14 Applications of Binary Search Technique.

Useful Links:
1 www.leetcode.com
2 www.hackerrank.com
3 www.cs.usfca.edu/~galles/visualization/Algorithms.html
4 www.codechef.com

Term Work:
1 Term work should consist of 10 experiments.
2 Journal must include at least 2 assignments.
3 The final certification and acceptance of term work ensures that satisfactory performance
of laboratory work and minimum passing marks in term work.
4 Total 25 Marks (Experiments: 15-marks, Attendance Theory& Practical: 05-marks,
Assignments: 05-marks)
Oral & Practical exam
Based on the entire syllabus of CSL301and CSC303
Agnel Charities
Fr. C. Rodrigues Institute of Technology, Vashi, Navi-
Mumbai
Department of Computer Engineering
Data Structures Lab

Lab Objectives:
1 To implement basic data structures such as arrays, linked lists, stacks and queues
2 Solve problem involving graphs, and trees
3 To develop application using data structure algorithms
4 Compute the complexity of various algorithms.
Course Outcomes:
Students will be able to implement Linear data structures to demonstrate various
CSL303.1
operations like create, insert, delete, search and traversal.
Students will be able to implement Non-linear data structures to demonstrate various
CSL303.2
operations like create, insert, delete, search and traversal.
Students will be able to choose and apply a suitable data structure to implement
CSL303.3
diverse problems.
CSL303.4 Students will be able to analyze and implement several searching techniques.

Mapping Assessment tools to Course Outcome

COURSE
OUTCOME
CO1 CO2 CO3 CO4
TOOLS

Practical – 1 √
Practical – 3 √
Practical – 4 √
Practical – 5 √
Practical – 7 √
Practical – 8 √
Practical – 9 √
Practical – 10 √
Practical – 11 √
Practical – 12 √

You might also like