Data Structures Through C detailed Syllabus for Computer Engineering (DCME), C18 curriculum has been taken from the TSSBTET official website and presented for the diploma students. For Course Code, Course Name, Lectures, Tutorial, Practical/Drawing, Internal Marks, Max Marks, Total Marks, Min Marks and other information, do visit full semester subjects post given below.
For all other Diploma in Computer Engineering (DCME) Syllabus for 3rd Sem C18 Curriculum TSSBTET, do visit Diploma in Computer Engineering (DCME) Syllabus for 3rd Sem C18 Curriculum TSSBTET Subjects. The detailed Syllabus for data structures through c is as follows.
Prerequisites:
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.
.
Course Outcome:
Upon completion of the course the student shall be able to
- Develop programs using the concepts of pointers and dynamic memory allocation.
- Describe Data structures and implement space and time complexity of the algorithms.
- Develop programs in C language using Sorting techniques.
- Develop programs in C language using Searching techniques.
- Describe different types of linked list and develop programs using C language. Construct stacks and queues using the concept of Arrays and Linked lists.
- Use of Binary Trees and its Applications
Unit 1: Pointers and Dynamic Memory Allocation
Pointer – Declaration and Initialization of Pointers- Accessing the address of a variable using & operator- Accessing a value of a variable through pointer – Differentiate address and dereferencing operators – Pointer Arithmetic- precedence of address and de-referencing operators -Relationship between Arrays and Pointers – Accessing array elements using pointers- Pointers as Function Arguments – Discuss Array of Pointers with examples.
Unit 2: Introduction To Data Structures
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: Sorting
Introduction to different sorting techniques – selection sort program and algorithm analysis for its time complexity, insertion sort program and algorithm analysis for time complexity, bubble sort program and algorithm analysis for time complexity, quick sort program and algorithm analysis for time complexity & Merge sort program and algorithm analysis for time complexity.
Unit 4: Searching
Introduction to different searching techniques – sequential search example, program and algorithm analysis for its time complexity and binary search example, program and algorithm analysis for its time complexity.
Unit 5: Linear Data Structures
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 6: Non Linear Data Structures
Trees – Trees -Binary trees – Linear representation – Linked list representation, tree traversals, Tree Conversion & Applications
Recommended Books
- Data Structures: A Pseudocode Approach with C++ – Gilberg / Forouzan
- Data Structures using C & C++ – Tanenbaum, Langsam and Augenstein (PHI).
- Data structures through C- YashwanthKanetkar
- An Introduction to data structures with applications – Tremblay & Sorenson
Course Outcome:
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 Activities
Student activity like mini-project, quizzes, etc. should be done in group of 5-10 students.
- Each group should do any one of the following type of activity or any other similar activity related to the course with prior approval from the course coordinator and programme coordinator concerned.
- Each group should conduct different activity and no repetition should occur.
- Explore and analyze topics to improve the level of creativity and analytical skill by taking Quiz/ tests/ assignments. Documents have to be maintained as a record.
- Create a power point presentation on the topic relevant to course or advanced topic as an extension to the course to improve the communication skills. Documents have to be maintained as a record.
- Visit different sites relevant to topics. Listen to the lectures and submit a handwritten report
- Coding competitions
Suggested E-learning references
- https://www.tutorialspoint.com/data structures algorithms/index.htm
- https://www.programiz.com/dsa
- https://www.geeksforgeeks.org/data-structures/
- https://www.w3schools.in/data-structures-tutorial/intro/
Course Outcome:
- Develop programs using the concepts of pointers and dynamic memory allocation.
- Describe Data structures and implement space and time complexity of the algorithms.
- Develop programs in C language using Sorting techniques.
- Develop programs in C language using Searching techniques.
- Describe different types of linked list and develop programs using C language. Construct stacks and queues using the concept of Arrays and Linked lists.
- Use of Binary Trees and its Applications
For detail Syllabus of all other subjects of Computer Engineering, C18 curriculum do visit Diploma In Computer Engineering 3rd Sem Syllabus for C18 curriculum.
For all Computer Engineering results, visit TSSBTET DCME all semester results direct links.