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

Data Structures Using C Practical detail TNDTE Diploma syllabus for Information Technology (IT), M scheme is extracted from TNDTE official website and presented for diploma students. The course code (35246), 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 practical is as follows.

Rationale:

To provide the hands on experience on implementation of linear and non-linear data structure , this course will be introduced . 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.

Objectives:

On completion of the following units of syllabus contents, the students must be able to

• Understand the use of arrays
• Use of arrays and pointers.
• Implement linear data structure algorithms using C language.
• Implement non – linear data structure algorithms using C language.
• Write programs for traversing a binary tree.
• Write programs for searching and sorting.

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.

Lab Exercises:

1. Write a program in C’ to insert, delete an element from an array of elements. Also print the position of a particular element
2. Implement array using row major order and column major order.
3. Write a program in C’ to create a two dimensional array with at least ten elements. Search for a particular element and print its position and address of the element.
4. Write a program in C’ to perform PUSH and POP operations in stack by using array.
5. Write a program in C’ to display the reverse of a string using a stack.
6. Write a program in C’ to evaluate a postfix expression.
7. Write a program in C’ to create a queue containing ten elements and perform delete and insert operations using array.
8. Write a program in C’ to implement recursive function.
9. Write a program in C’ to create a singly linked list containing at least five elements. Make necessary assumptions.
10. Write a program in C’ to delete the first node that contains an integer data item of a single linked list.
11. Write a program in C’ to create a binary tree.
12. Write a program in C’ for pre-order traversal of a binary tree.
13. Write a program in C’ for binary searching
14. Write a program in C’ to sort N’ Numbers using Insertion sort.
15. Write a program in C’ to sort N’ Numbers using bubble sort.
16. Write a program in C’ to sort N’ Numbers using selection sort.

Hardware And Software Requirement

Hardware Requirement :

• Desktop Computers – 36 Nos
• Laser Printer – 4 Nos

Software Requiremnt :

• C – Compiler with Editor

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.