[go: up one dir, main page]
Scribd
Upload
18 views1 page

DSA Lab

The document outlines a course curriculum for a data structures and algorithms lab. It details the course objective of understanding and implementing simple data structures and various sorting and searching techniques. It lists lab modules covering topics like linked lists, stacks, queues, trees and sorting algorithms. It also specifies outcomes of being able to identify and use appropriate data structures and apply algorithmic skills.

Uploaded by

Dhruv Pratap Singh
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
18 views1 page

DSA Lab

The document outlines a course curriculum for a data structures and algorithms lab. It details the course objective of understanding and implementing simple data structures and various sorting and searching techniques. It lists lab modules covering topics like linked lists, stacks, queues, trees and sorting algorithms. It also specifies outcomes of being able to identify and use appropriate data structures and apply algorithmic skills.

Uploaded by

Dhruv Pratap Singh
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

Course Curriculum (w.e.f.

Session 2018-19)
B.Tech. Computer Science & Engineering

BCSC0805: DATA STRUCTURES & ALGORITHMS LAB


Objective: The objective of this course is that students will understand and implement simple data
structures, able demonstrate different sorting and searching techniques. and will be familiar with graphs
and their applications.

Credits:01 L-T-P-J:0-0-2-0

Module Lab
• Program to implement various operations in a singly linked list.
• Program to implement insertion, deletion and traversal in a doubly linked
List.
• Program to implement polynomial addition using linked list.
• Program to demonstrate the various operations on stack.
• Program to convert an infix expression into postfix expression.
• Program to evaluate a given postfix expression.
I, II and • Program to implement Tower of Hanoi problem using Recursion.
• Program to demonstrate the implementation of various operations on linear 24
III and circular queue.
• Program to demonstrate the implementation of insertion and traversals on a
binary search tree.
• Program to implement Dijkstra’s Algorithm to find the shortest path
between source and destination.
• Program to search a given element as entered by the user using sequential
and binary search to search a given element as entered by the user.
• Implementation of various sorting algorithms like Selection Sort, Bubble
Sort, Insertion Sort, Merge Sort, Quick Sort and Heap Sort.

Note: All Code must be done in Java as well as Python

Outcome: After completion of course, student will be able to:


• Identify, implement and use the appropriate data structures for a given problem
• Apply algorithmic skills for computing and engineering practice.
• Apply design and development principles of data structures and algorithms in the construction of
software systems.

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

You might also like