22317: Data Structure Using C Syllabus for Computer Technology 3rd Sem I – Scheme MSBTE

Data Structure Using C detailed Syllabus for Computer Technology (CM), I – scheme has been taken from the MSBTE official website and presented for the diploma students. For Subject Code, Subject Name, Lectures, Tutorial, Practical/Drawing, Credits, Theory (Max & Min) Marks, Practical (Max & Min) Marks, Total Marks, and other information, do visit full semester subjects post given below.

For all other Diploma in Computer Technology (CM) Syllabus for 3rd Sem I – Scheme MSBTE, do visit Diploma in Computer Technology (CM) Syllabus for 3rd Sem I – Scheme MSBTE Subjects. The detailed Syllabus for data structure using c is as follows.

Rationale:

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 pdfs platform to make students’s lives easier.
.

Competency:

The aim of this course is to help the student to attain the following industry identified competency through various teaching learning experiences:

• Implement relevant algorithms using Data Structures.

Course Outcomes:

The theory, practical experiences and relevant soft skills associated with this course are to be taught and implemented, so that the student demonstrates the following industry oriented COs associated with the above mentioned competency:

1. Perform basic operations on arrays.
2. Apply different searching and sorting techniques.
3. Implement basic operations on stack and queue using array representation.
4. Implement basic operations on Linked List.
5. Implement program to create and traverse tree to solve problems.

Suggested Exercises:

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 pdfs platform to make students’s lives easier.
.

Instruments Required:

The major equipment with broad specification mentioned here will usher in uniformity in conduct of experiments, as well as aid to procure equipment by authorities concerned.

Equipment Name with Broad Specifications

1. Computer system (Any computer system which is available in laboratory.
2. C Compiler / GCC Compiler

Unit 1

Introduction to Data Structures

Total Teaching Hours – 04

Distribution of Theory Marks

R Level – 02

U Level – 02

A Level – 02

Total Marks – 06

Unit Outcomes (UOs) (in cognitive domain)

1. Classify the given type of Data Structures based on their characteristics.
2. Explain complexity of the given algorithm in terms of time and space.
3. Explain the given operations to be performed on the given type of data structures.

Topics and Sub-topics

1. Concept and need of DS, Abstract Data Type
2. Types of Data Structures:
   1. Linear Data Structures
   2. Non-Linear Data Structures
3. Algorithm Complexity:
   1. Time
   2. Space
4. Operations on Data Structures:
   1. Traversing,
   2. Searching,
   3. Insertion,
   4. Deletion,
   5. Sorting

Unit 2

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 pdfs platform to make students’s lives easier.
.

Unit 3

Stacks and Queues

Total Teaching Hours – 16

Distribution of Theory Marks

R Level – 02

U Level – 04

A Level – 14

Total Marks – 20

Unit Outcomes (UOs) (in cognitive domain)

1. Develop an algorithm to perform PUSH and POP operations for the given item in a Stack.
2. Convert the given expression from Infix to Prefix/Postfix using Stack.
3. Write steps to evaluate the given expression using the stack.
4. Develop a program to perform the given operation on a linear Queue.
5. Write Algorithm to perform the given operations on circular queue.

Topics and Sub-topics

1. Introduction to Stack
   1. Stack representation in memory using array
   2. Stack as an ADT
   3. Stack Operations – PUSH, POP
   4. Stack Operations Conditions – Stack Full I Stack Overflow, Stack Empty I Stack Underflow.
   5. Applications of Stack
   6. Reversing a list
   7. Polish notations
2. Conversion of infix to postfix expression, Evaluation of postfix expression, Converting an infix into prefix expression, Evaluation of prefix expression , Recursion, Tower of Hanoi
3. Introduction to Queue:
   1. Queue representation in memory using array
   2. Queue as an ADT
   3. Types of Queues :- Linear Queue, Circular Queue, Concept of Priority Queue
   4. Queue Operations – INSERT, DELETE
   5. Queue Operations Conditions – Queue Full, Queue Empty
   6. Applications of Queue

Unit 4

Linked List

Total Teaching Hours – 10

Distribution of Theory Marks

R Level – 02

U Level – 04

A Level – 10

Total Marks – 16

Unit Outcomes (UOs) (in cognitive domain)

1. Create relevant structure to represent the given node using linked list.
2. Develop algorithm to insert the given item in linear linked list.
3. Develop algorithm to delete the given item from linear linked list
4. Develop algorithm to traverse a circular linked list.

Topics and Sub-topics

1. Introduction to Linked List Terminologies: node, Address, Pointer, Information field / Data field, Next pointer, Null Pointer, Empty list.
2. Type of lists: Linear list, Circular list
3. Operations on a singly linked list: Traversing a singly linked list, Searching a key in linked list, Inserting a new node in a linked list, Deleting a node from a linked list

Unit 5

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 pdfs platform to make students’s lives easier.
.

Suggested Student Activities:

Other than the classroom and laboratory learning, following are the suggested student-related co-curricular activities which can be undertaken to accelerate the attainment of the various outcomes in this course: Students should conduct following activities in group and prepare reports of about 5 pages for each activity, also collect/record physical evidences for their (students) portfolio which will be useful for their placement interviews:

1. Prepare journal of practical.
2. Undertake micro-projects.
3. Prepare a chart to classify Data Structures.
4. Prepare charts for logical representation of Data Structures.

Suggested Special Instructional Strategies:

These are sample strategies, which the teacher can use to accelerate the attainment of the various learning outcomes in this course:

1. Massive open online courses (MOOCs) may be used to teach various topics/sub topics.
2. L in item No. 4 does not mean only the traditional lecture method, but different types of teaching methods and media that are to be employed to develop the outcomes.
3. About 15-20% of the topics/sub-topics which is relatively simpler or descriptive in nature is to be given to the students for self-directed learning and assess the development of the COs through classroom presentations (see implementation guideline for details).
4. With respect to item No. 10, teachers need to ensure to create opportunities and provisions for co-curricular activities.
5. Guide students in undertaking micro-projects.
6. Demonstrate students thoroughly before they start doing the practice.
7. Encourage students to refer different websites to have deeper understanding of the subject.
8. Observe continuously and monitor the performance of students in Lab.

Suggested Micro-Projects

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 pdfs platform to make students’s lives easier.
.

Suggested Learning Resources:

1. Data Structures using C BalgurusanwJL_ McGraw Hill Education, New Delhi 2013, ISBN: 978-1259029547
2. Data Structures using C ISRD Group McGraw Hill Education, New Delhi 2013, ISBN: 978-12590006401
3. Data Structures with C (S1E) (Schaums Outline Series. Lipschutz McGraw Hill Education, New Delhi 2013, ISBN: 978-0070701984
4. Practical C programming Steve Oualline O’Reilly Media
5. Data Structures Dr. Rajendra Kawale Devraj Publications

Software/Learning Websites:

1. http://nptel.ac.in/courses/106102064/1
2. www.oopweb.com/algorithms
3. www.studytonight.com/data-structures/
4. www.cs.utexas.edu/users
5. Iiscs.wssu.edu
6. http://www.academictutorial.com/data-structurcs
7. http://www.sitebay.com/data-structure/c-data-structure
8. http://www.indiabix.com
9. https://www.khanacademy.org/

For detail Syllabus of all other subjects of Computer Technology, I – scheme do visit Computer Technology 3rd Sem Syllabus for I – scheme.

For all Computer Technology results, visit MSBTE Computer Technology all semester results direct links.