35244: Data Structures Using C IT 4th Sem Syllabus for Diploma TNDTE M Scheme

Data Structures Using C detail TNDTE Diploma syllabus for Information Technology (IT), M scheme is extracted from TNDTE official website and presented for diploma students. The course code (35244), and for 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 it 4th sem syllabus for diploma m scheme tndte you can visit IT 4th Sem Syllabus for Diploma M Scheme TNDTE Subjects. The detail syllabus for data structures using c is as follows.

Rationale:

Data structures are the techniques of designing the basic algorithms for real-life projects. In the present era, it is very essential to develop programs and organize data in such a way that it solves a complex problem efficiently. Understanding of data structures is essential and this facilitates to acquire sound knowledge of the insight of hardware requirement to any problem base. The practice and assimilation of data structure techniques is essential for programming.

Objectives:

• Define Linear and non-linear data structures.
• List and discuss the different types of linear data structures.
• Differentiate Stack and Queue
• Understand the Operations of Stack
• Explain the applications of stack
• Explain Linked lists and its implementation
• Define a tree and the different terms related with trees.
• Describe the different ways of traversing a binary tree.
• Discuss the various operations on Binary Search tree.
• Define graph terminologies and describe the different ways of traversing a graph.
• Write the algorithm for different types of sorting.
• Write the algorithm for different types of searching.
• Describe hash table and hash function.

Unit 1

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.

Unit 2

Stacks , Recursion And Queues …

1. Definition of a Stack – Operations on Stack (PUSH & POP)- Implementing Push and Pop Operations – Implementation of stack through arrays – Applications of Stack : Reversing a list – Polish notations – Conversion of infix to postfix expression – Evaluation of postfix expression – Algorithm for evaluating Infix to prefix expression.
2. Recursion – Recursive definition – Algorithm and C function for :

Multiplication of Natural numbers – Factorial Function – GCD function – Properties of Recursive algorithms/functions – Advantages and Disadvantages of Recursion

3. Queues:

The queue and its sequential representation – implementation of Queues and their operations – implementation of Circular queues and their operations -Dequeue and Priority queues(Concepts only.

Unit 3

Linked Lists

1. Terminologies:

Node, Address, Pointer, Information, Null Pointer, Empty list -. Type of lists : Singly linked list , Doubly linked list, Circular list – Representation of singly linked lists in Memory-Difference between Linked & sequential List -Advantages and Disadvantages of Linked list- Operations on a singly linked list ( only algorithm) : Traversing a singly linked list , Searching a singly linked list , Inserting a new node in a singly linked list ( front, middle, end), Deleting a node from a singly linked list (front, middle, rear) – Doubly linked list, Circular linked lists (Concepts only, no implementations.

Unit 4

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.

Unit 5

Sorting .Searching And Hashing

1. Sorting Techniques :

Introduction – Algorithms and C programs for : Selection sort , Insertion sort , Bubble sort – Algorithms only : Merge Sort ,Radix sort, Shell sort , Quick sort

2. Searching :

Introduction – Algorithms and C programs for Linear search and Binary search

3. Hashing :

Hash tables – methods- Hash function – Collision resolution techniques

Text Books:

1. Data Structures SeyMour Lipschutz Schaum;s outlines, TMH Private Limited,New Delhi Indian Adapted Edition 2006. 20th Reprint 2011
2. Data Structures with C SeyMour Lipschutz Schaum;s outlines, TMH Private First Reprint 2011
3. Data Structures A Programming approach with C Dharmender Singh Kushwaha and Arun Kumar Misra LPirmeniteticde,NHeawll of India, New Delhi 2012

Reference Books:

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.

For detail syllabus of all other subjects of BE It, M scheme do visit It 4th Sem syllabus for M scheme.

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