Data Structure Using C Information Tech 3rd Sem BTEUP Syllabus 2019-2020

Data Structure Using C detail BTEUP syllabus for Information Technology, effective from 2019-2020, is collected from BTEUP 2017 Syllabus official website and presented for diploma students. PDF download is possible from official site but you can download the istudy mobile app for syllabus on mobile. The course details such as exam duration, Teaching Hr/week, Practical Hr/week, Total Marks, internal marks, theory marks, duration and credits do visit complete sem subjects post given below. The syllabus PDFs can be downloaded from official website.

For all other bteup syllabus 3rd sem information tech 2019-2020 you can visit BTEUP Syllabus 3rd Sem Information Tech 2019-2020 Subjects. The detail syllabus for data structure using c is as follows.

Rationale:

Data structures are the techniques of designing the basic algorithms for real-life projects. Understanding of data structures is essential and this facilitates the understanding of the language. The practice and assimilation of data structure techniques is essential for programming. The knowledge of C’ language and data structures will be reinforced by practical exercises during the course of study. The course will help students to develop the capability of selecting a particular data structure.

Learning Outcomes:

After undergoing the subject, the students will be able to:

• Identify the problem and formulate an algorithm for it.
• Identify the best data structures to solve the problem
• Store data, process data using appropriate data structures
• Sort the data in ascending or descending order.
• Implement trees and various traversing techniques.
• Implement various searching and sorting algorithms and to compare them for checking efficiency.

1. Fundamental Notations (08 Periods)

For complete syllabus and results, class timetable and more pls download iStudy Syllabus App. It’s a lightweight, easy to use, no images, no pdfs platform to make students life easier.

2. Arrays (08 Periods)

1. Concept of Arrays
2. Storage representation of multi-dimensional arrays.
3. Operations on arrays with Algorithms (searching, traversing, inserting, deleting)

3. Linked Lists (12 Periods)

1. Introduction to linked list
2. Representation of linked lists in Memory
3. Operations on linked list (Insertion, deletion and traversals)
4. Application of linked lists
5. Doubly linked lists
6. Operations on doubly linked lists (Insertion, deletion and traversals)

4. Stacks, Queues and Recursion (12 Periods)

For complete syllabus and results, class timetable and more pls download iStudy Syllabus App. It’s a lightweight, easy to use, no images, no pdfs platform to make students life easier.

5. Trees (12 Periods)

1. Concept of Trees
2. Representation of Binary tree in memory
3. Traversing Binary Trees (Pre order, Post order and In order)
4. Searching, inserting and deleting binary search trees
5. Introduction to Heap
6. Application of Trees

6. Sorting and Searching (12 Periods)

1. Introduction to sorting and searching
2. Search algorithm (Linear and Binary)
3. Sorting algorithms (Bubble Sort, Insertion Sort, Quick Sort, Selection Sort, Merge Sort, Heap Sort

7. Graph (06 Periods)

For complete syllabus and results, class timetable and more pls download iStudy Syllabus App. It’s a lightweight, easy to use, no images, no pdfs platform to make students life easier.

List of Experiments:

Write programmes in C to implement

1. Addition of two matrices using functions
2. Multiplication of two matrices
3. Push and pop operation in stack
4. Inserting and deleting elements in queue
5. Inserting and deleting elements in circular queue
6. Insertion and deletion of elements in linked list
7. Insertion and deletion of elements in doubly linked list
8. Factorial of a given number with recursion and without recursion
9. Fibonacii series with recursion and without recursion
10. Program for pre-order, post order and in order traversal of binary tree.
11. The selection sort technique
12. The bubble sort technique
13. The quick sort technique
14. The merge sort technique
15. The binary search procedures to search an element in a given list
16. The linear search procedures to search an element in a given list

Instructional Strategy:

This subject clears all fundamentals of programming techniques. Teachers should stress on explaining all the techniques and algorithms in detail in theory sessions. The students should be asked to convert their ideas about a problem into an algorithm in theory class and implement it in practical class. This willhelp the students to have clear concepts of programming.

Means of Assessment:

1. Assignments and quiz/class tests, mid-term and end-term written tests
2. Actual laboratory and practical work, exercises and viva-voce
3. Software installation, operation, development and viva-voce

Text Books:

1. Data Structure using C by Robert Kruse; Prentice Hall of India
2. Data Structure through C by Yashwant Kanekar; BPB Publications
3. Data structures – Schaum’s Outline Series by Lipschutz; McGraw Hill Education Pvt Ltd , New Delhi
4. Data Structure using C by ISRD Group ; Tata McGraw Hills Education Pvt Ltd , New Delhi
5. Expert Data Structures with C by R.B. Patel ; Khanna Publishers, New Delhi.
6. Data Structures and Algorithm Using C by RS Salaria; Khanna Book Publishing Co. Ltd. New Delhi
7. Data Structure through C in depth by SK Srivastava, Deepali Srivastava; BPB Publications
8. Data Structure through C Language by Sameeran Chattopadhyay, MatanginiChottopadhyay; BPB Publications
9. Data Structure through C Language by DOEACC; BPB Publications
10. Data Structure using C Lab Workbook by Shukla; BPB Publications
11. E-books/e-tools/relevant software to be used as recommended by AICTE/NITTTR, Chandigarh.

Reference Books:

http://swayam.gov.in

For detail syllabus of all other subjects of BE Information Tech, effective from 2019-2020 do visit Information Tech 3rd Sem BTEUP syllabus for 2019-2020.

Dont forget to download iStudy Syllabus App for latest syllabus and results, class timetable and more.