15CS41T: Data Structures Using C Information Sci 4th Sem Syllabus for Diploma DTE Karnataka C15 Scheme

Data Structures Using C detail DTE Kar Diploma syllabus for Information Science And Engineering (IS), C15 scheme is extracted from DTE Karnataka official website and presented for diploma students. The course code (15CS41T), 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 information sci 4th sem syllabus for diploma c15 scheme dte karnataka you can visit Information Sci 4th Sem Syllabus for Diploma C15 Scheme DTE Karnataka Subjects. The detail syllabus for data structures using c is as follows.

Pre-requisites:

Knowledge of C programming.

Course Objectives:

To study the concepts of derived data types and data structures such as linked list, stack, queue, sorting and searching techniques.

Course Outcomes:

For complete syllabus and results, class timetable and more pls download iStudy Syllabus App. Its a light weight, easy to use, no images, no pdfs platform to make students life easier.

UNIT I : Pointers and Dynamic Memory allocation 08 Hrs

Pointers –
Concept of pointers, Declaring and initializing pointers, Accessing variables using pointers, Pointer arithmetic, Pointers and arrays, Pointers and character strings, Pointers and functions, Pointer as a function argument, Pointers to function, Pointers and structures.

Dynamic Memory allocation –
Introduction, Dynamic memory allocation, Allocating a block of memory: Malloc, Allocating multiple blocks of memory: Calloc, Releasing the used space: Free Altering the size of memory: Realloc

UNIT II: Files 06 Hrs

Introduction, Defining and opening a file, closing a file, Input / Output operations on files, Error handling during I/O operations, Random Access to files, Command line arguments

UNIT III: Introduction to data structures & Linked lists 10 Hrs

For complete syllabus and results, class timetable and more pls download iStudy Syllabus App. Its a light weight, easy to use, no images, no pdfs platform to make students life easier.

UNIT IV: Stack & Queues 10 Hrs

Stack –
Introduction, Stacks, Stack operations, stack implementations.

Queues –
Introduction, Basic concept, queue operations, queue implementations, circular queue (no implementation), priority queues (no implementation), double ended queues (no implementation).

UNIT V: Tree 08 Hrs

Introduction, Basic concept, Binary tree, Binary tree representation, Binary tree traversal.

UNIT VI: Sorting, Searching and Application of Data Structures 08 Hrs

For complete syllabus and results, class timetable and more pls download iStudy Syllabus App. Its a light weight, easy to use, no images, no pdfs platform to make students life easier.

Text Books:

1. Programming with AN S I-C, E. Balaguruswamy, Sixth Edition, Tata Mcgraw Hill for Unit I and II
2. Data Structures using C, E. Balagurusamy, Tata Mcgraw Hill for Unit III,IV,V,VI

Reference Books:

1. Programming with ANSI & Turbo C, Ashok Kamthane, Second Edition, Pearson Education.
2. Let us C, Yashavant P Kanetkar, 14th Edition, BPB publication, ISBN 9788183331630
3. Data structures A Programming Approach with C Second Edition , PHI publication, Dharmender Singh Kushwaha, Arun Kumar Misra.
4. Programming in C and Data Structure, P.B.Kotur, Sapna Book house
5. http://spoken-tutorial.org/tutorial-search/?search_foss=C+and+Cpp&search_language=English
6. http://www.tutorialspoint.com/cprogramming/
7. http://www.indiabix.com/online-test/c-programming-test/

Suggested List of Student Activities:

Note: the following activities or similar activities for assessing CIE (IA) for 5 marks (Any one)

Student activity like mini-project, surveys, quizzes, etc. should be done in group of 3-5 students.

1. Each group should do any one of the following type activity or any other similar activity related to the course and before conduction, get it approved from concerned course coordinator and programme coordinator.
2. Each group should conduct different activity and no repeating should occur

1. Implementation of Double linked list and circular linked list
2. Implementation of Circular Queue
3. Implementation of function pointers
4. Design and implement the Applications of Stack
5. Quiz

Course Delivery:

The course will be delivered through lectures and Power point presentations/ Video

Model Question Paper:

(CIE)

1. How is a pointer to an array different from an array of pointers? Explain with an example (5)
2. Write C program to swap two numbers using pointers. (5)

OR Give the difference between call-by-value and call-by-reference methods.

3. Explain different file accessing modes.

OR With an example, explain how to handle errors during I/O operations

4. Write a program to copy contents of one file to another.

Model Question Paper:

PART-A

Answer any SIX questions. Each carries 5 marks. 5X6=30 Marks

1. Explain fseek() and ftell() functions.
2. Define Data structures. Mention different types of data structures.
3. Write the advantages and disadvantages of a Linked List.
4. Define stack. Explain how to represent a stack in C.
5. Write a note on dequeue.
6. Define the following
1. internal node
2. sibling
3. degree of the tree
4. depth of a tree
5. path
7. Define the following
1. root node
2. leaf node
3. level of tree
4. child node
5. parent node.
8. Write a recursive C program to find the GCD of two numbers.
9. List the application of Linked List.

PART-B

Answer any SEVEN full questions each carries 10 marks. 10X7=70 Marks

1. Define Pointer. Write its advantages and disadvantages.
2. Explain pointer to structure with example.
2. List and explain Dynamic Memory allocation functions in C.
3. Write a program to copy contents of one file to another. Use command line arguments to specify the file names.
4. Write the c functions to perform insert at front and delete operations on Singly Linked List.
5. Define Circular Linked List. Give its c representation.
6. Write C program to implement push and pop operation of stack.
7. Define Priority queue. Write the C implementation Priority Queue.
8. Construct a binary tree for the following values and traverse the tree in preorder, inorder and postorder: 46, 76, 36, 26, 16, 56, 96
9. Write a c program to implement Binary Search.
10. List the application of stack. Write an algorithm to convert infix to postfix expression.

For detail syllabus of all other subjects of BE Information Sci, C15 scheme do visit Information Sci 4th Sem syllabus for C15 scheme.

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