Scribd
Upload
34 views

Lab Syllabus

This document outlines the course objectives, schedule, and expected outcomes for a C Programming and Data Structures lab course. Over 15 weeks, students will write programs to implement recursive and non-recursive functions, arrays, strings, pointers, structures, stacks, queues, linked lists, binary trees, and perform searching and sorting algorithms. The course aims to teach basic C programming concepts and developing programs using various data structures and algorithms.

Uploaded by

Salma Faroze
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
34 views

Lab Syllabus

This document outlines the course objectives, schedule, and expected outcomes for a C Programming and Data Structures lab course. Over 15 weeks, students will write programs to implement recursive and non-recursive functions, arrays, strings, pointers, structures, stacks, queues, linked lists, binary trees, and perform searching and sorting algorithms. The course aims to teach basic C programming concepts and developing programs using various data structures and algorithms.

Uploaded by

Salma Faroze
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY ANANTAPUR

B.Tech (CE)– II Sem L T P C


0 0 3 1.5

(20A05201P) C-Programming & Data Structures Lab

Course Objectives: (Common to All Branches of Engineering)

 To get familiar with the basic concepts of C programming.


 To design programs using arrays, strings, pointers and structures.
 To illustrate the use of Stacks and Queues
 To apply different operations on linked lists.
 To demonstrate Binary search tree traversal techniques.
 To design searching and sorting techniques.

Week l

Write C programs that use both recursive and non-recursive functions

i) To find the factorial of a given integer.


ii) To find the GCD (greatest common divisor) of two given integers.
iii) To solve Towers of Hanoi problem.

Week 2

a) Write a C program to find both the largest and smallest number in a list of integers.
b) Write a C program that uses functions to perform the following:
i) Addition of Two Matrices ii) Multiplication of Two Matrices

Week 3
a) Write a C program that uses functions to perform the following operations:
i) To insert a sub-string in to a given main string from a given position.
ii) To delete n characters from a given position in a given string.

Week 4
a) Write a C program that displays the position or index in the string S where the string T
begins, or – 1 if S doesn‘t contain T.

b) Write a C program to count the lines, words and characters in a given text.

Week 5

a) Write a C Program to perform various arithmetic operations on pointer variables.


b) Write a C Program to demonstrate the following parameter passing mechanisms:
i) call-by-value ii) call-by-reference

Week 6
Write a C program that uses functions to perform the following operations:
i) Reading a complex number
ii) Writing a complex number
iii) Addition of two complex numbers
iv) Multiplication of two complex numbers

(Note: represent complex number using a structure.)

Week 7

Write C programs that implement stack (its operations) using

i) Arrays
ii) Pointers

Week 8
Write C programs that implement Queue (its operations) using
i) Arrays
ii) Pointers

Week 9

Write a C program that uses Stack operations to perform the following:

i) Converting infix expression into postfix expression


ii) Evaluating the postfix expression

Week 10

Write a C program that uses functions to perform the following operations on singly linked list.

i) Creation ii) Insertion iii) Deletion iv) Traversal

Week 11

Write a C program that uses functions to perform the following operations on Doubly linkedlist.

i) Creation ii) Insertion iii) Deletion iv) Traversal

Week 12

Write a C program that uses functions to perform the following operations on circular linkedlist.

i) Creation ii) Insertion iii) Deletion iv) Traversal

Week 13

Write a C program that uses functions to perform the following:

i) Creating a Binary Tree of integers

ii) Traversing the above binary tree in preorder, inorder and postorder.
Week 14

Write C programs that use both recursive and non-recursive functions to perform the
following searching operations for a key value in a given list of integers:

i) Linear search
ii) Binary search

Week 15

Write a C program that implements the following sorting methods to sort a given list of
integers in ascending order

i) Bubble sort
ii) Selection sort
iii) Insertion sort

Text Books:
1. Programming in C and Data Structures, J.R.Hanly, Ashok N. Kamthane and A. Ananda
Rao, Pearson Education.
2. B.A. Forouzon and R.F. Gilberg, “COMPUTER SCIENCE: A Structured Programming
Approach Using C”, Third edition, CENGAGE Learning, 2016.
3. Richard F. Gilberg & Behrouz A. Forouzan, “Data Structures: A Pseudocode Approach
with C”, Second Edition, CENGAGE Learning, 2011.

Reference Books:
1. PradipDey and ManasGhosh, Programming in C, Oxford University Press, 2nd Edition 2011.
2. E.Balaguruswamy, “C and Data Structures”, 4th Edition, Tata Mc Graw Hill.
3. A.K.Sharma, Computer Fundamentals and Programming in C, 2nd Edition, University Press.
4. M.T.Somashekara, “Problem Solving Using C”, PHI, 2nd Edition 2009.

Course Outcomes

 Demonstrate basic concepts of C programming language. (L2)


 Develop C programs using functions, arrays, structures and pointers. (L6)
 Illustrate the concepts Stacks and Queues. (L2)
 Design operations on Linked lists. (L6)
 Apply various Binary tree traversal techniques. (L3)
 Develop searching and sorting methods. (L6)

You might also like