ITL302: Data Structures Lab Syllabus for IT 3rd Sem 2017 Pattern Mumbai University

Data Structures Lab detailed syllabus scheme for Information Technology (IT), 2017 regulation has been taken from the University of Mumbai official website and presented for the Bachelor of Engineering students. For Course Code, Course Title, Test 1, Test 2, Avg, End Sem Exam, Team Work, Practical, Oral, Total, and other information, do visit full semester subjects post given below.

For all other Mumbai University Information Technology 3rd Sem Syllabus 2017 Pattern, do visit IT 3rd Sem 2017 Pattern Scheme. The detailed syllabus scheme for data structures lab is as follows.

Data Structures Lab Syllabus for Information Technology SE 3rd Sem 2017 Pattern Mumbai University

Data Structures Lab

Lab Objectives:

For the complete Syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdf platform to make students’s lives easier.
.

Lab Outcomes:

Students will be able to:

Select appropriate data structures as applied to specified problem definition.
Implement operations like searching, insertion, and deletion, traversing mechanism etc. on various data structures.
Students will be able to implement Linear and Non-Linear data structures.
Implement appropriate sorting/searching technique for given problem.
Design advance data structure using Non-Linear data structure.
Determine and analyze the complexity of given Algorithms.

Prerequisites:

C Programming Language

Hardware Requirement:

PC i3 processor and above

Software requirement:

Module I

Stack

Implementations of stack menu driven program
Implementation of multistack in one array.
implementations of Infix to Postfix Transformation and its evaluation program.
Implementations of Infix to Prefix Transformation and its evaluation program. 04 LO1 LO2 LO3 LO6

Module II

Queue

Implementations of circular queue menu driven program
* Implementations of double ended queue menu driven program
Implementations of queue menu driven program
Implementation of Priority queue program using array. 04 LO1 LO2 LO3 LO6

Module III

Linked List

Implementations of Linked Lists menu driven program.
implementation of different operations on linked list -copy, concatenate, split, reverse, count no. of nodes etc
Implementation of polynomials operations ( addition, subtraction) using Linked List.
Implementations of Linked Lists menu driven program (stack and queue. 04 LO1 LO2 LO3 LO6

Module IV

Module V

Sorting

Implementations of Shell sort, Radix sort and Insertion sort menu driven program.
implementations of Quick Sort, Merge sort and Heap Sort menu driven program
Implementations of Advanced Bubble Sort, Insertion Sort and Selection Sort menu driven program 04 LO4 LO5 LO6

Module VI

Searching

Implementations of searching methods (Index Sequential, Interpolation Search) menu driven program
*Implementation of hashing functions with different collision resolution techniques 02 LO4 LO5 LO6

Text Books:

Data structures using C by Tenenbaum, Langsam, Augenstein , Pearson.
Data Structures using C, ReemaThareja, Oxford.

Reference Books:

Term Work:

Term Work shall consist of at least 10 to 12 practicals based on the above list. Also Term work Journal must include at least 2 assignments. Term Work Marks: 25 Marks (Total marks) = 15 Marks (Experiment) + 5 Marks (Assignments) + 5 Marks (Attendance) Oral& Practical Exam: An Oral & Practical exam will be held based on the above syllabus.

For detail syllabus of all other subjects of Information Technology (IT) 3rd Sem 2017 regulation, visit IT 3rd Sem Subjects syllabus for 2017 regulation.

InI MH