Course Course

Course Name L-T-P Credits

Code Category

CS1209 Programming and Data Structures ESC 3-0-0 3

Course Objectives:

1. To understand the various steps in Program development.

2. To understand the basic concepts in C Programming Language.
3. To learn about arrays and character arrays
4. To learn how to write modular and readable C Programs
5. To understand the basic concepts of Pointers and Dynamic memory allocation.
6. To understand the usage of Structure and Unions and about file operations
7. To Understand the usage of Basic data structures

Course content

UNIT 1 (8 Hrs)

Introduction, History Of Programming Languages, Character Set, Variables And Identifiers,

Built-In Data Types. Variable Definition, Arithmetic Operators And Expressions, Constants
And Literals, Simple Assignment Statement, Basic Input/output Statement, Simple 'C'
Program , Conditional Statements And Loops.

UNIT 2 (8 Hrs)

One Dimensional Arrays: Array Manipulation; Searching, Insertion, Deletion Of An Element

From An Array; Finding The Largest/Smallest Element In An Array; Two Dimensional
Arrays, Addition/Multiplication Of Two Matrices, Transpose Of A Square Matrix; Character
Arrays

UNIT 3 (8 Hrs)

Function Declaration, Function Definition, Function Call, Call By Value, Call By Reference,
Recursion, String Handling Functions

UNIT 4 (8 Hrs)

Structure Variables, Initialization, Structure Assignment, Nested Structure, Structures and

Functions, Structures And Arrays: Arrays Of Structures, Structures Containing Arrays,
Unions.
UNIT 5 (8 Hrs)

Address Operators, Pointer Type Declaration, Pointer Assignment, Pointer Initialization,

Pointer Arithmetic, Functions And Pointers, Arrays And Pointers, Pointer Arrays, Dynamic
Memory Allocations, Storage Classes

UNIT 6 (8 Hrs)

Linked List, Double Linked Lists, Stack, Stack Implementation Using Arrays, Stack
Implementation Using Linked List.

Learning resources

Text book:

1. Reema Thareja, “ Programming in C”, Oxford Publications, 2nd Edition

Reference Books:

1. E. BalaguruSwamy, “ Programming in ANSI C”, Mc Graw Hill, 7th Edition

2. Brian W. Kernighan, Dennis M. Ritchie, “ The C Programming Language”, Prentice
Hall, 2nd Edition
3. Data structures using C by Reema Thareja, 2ndedition ,Oxford Higher Education

Web resources :

1. Indian Institute of Technology, Kharagpur, “Problem Solving through Programming

in C”, https://nptel.ac.in/courses/106105171/

Course outcomes: At the end of the course, the student will be able to

1. Develop flowcharts, algorithms for given complex problems.

2. Analyze basic programming constructs.

3. Write C programs for real world problems. Implement C programming by using

various control structures.

4. write rite modular and readable C Programs

5. use pointers in C programming.

 6. Appreciate coding standards and best practices for program development.

Assessment Method

Assessment Experiments Report/Viva-Voce/ Quiz/MCQ/Lab Total

Tool project
Weightage (%) 25% 15% 40%

End Semester Examination weightage (%) 60%

Course
Course Code Course Name L-T-P Credits
Category

Programming for
CS1289 Data Structures ESCL 0-0-3 1.5 credits
Laboratory

Course Objective:

1. Identify situations where computational methods and computers would be useful.

2. Given a computational problem, identify and abstractthe programming task involved.
3. Approach the programming tasks using techniques learned and write pseudo-code.
4. To understand the concepts of Programming language
5. To learn the basics of C declarations, operators and expressions
6. To learn on the manipulation of strings, functions and pointers
7. To apply concepts and techniques for implementation.
8. To learn the basic data structures and its usage

UNIT 1 (Week1)
1. C Program to calculate the sum of Natural numbers.
2. C Program to find factorial of a number
 3. C Program to generate multiplication table of a given number.
4. C Program to display Fibonacci sequence ( Up to given number)
5. C Program to Check whether a given number is prime or not
6. C Program to make a simple Calculator using switch case
7. C Program to check whether a number is palindrome or not
8. C Program to display factors of a given number.
9. C Program to print Pyramids and Triangles using loops.
UNIT II (Week2&3)
1. C Program to find second largest Element of an Array
2. C Program to add two matrix using multi-dimensional arrays.
3. C Program to multiply two matrix using multi-dimensional arrays.
4. C Program to find transpose of a matrix.
5. C Program to Sort Elements of an Array.

UNIT III (Week4&5)

1. C Program to check whether given number is prime or not using user-defined
function.
2. C Program to check whether given number is Armstrong or not using user-defined
function.
3. C Program to swap two integer values using call by value and call by reference.
4. C Program to find the sum of Natural numbers using recursion.
5. C Program to find the factorial of a given number using recursion.
6. C Program to calculate length of string without using strlen() function.
7. C Program to sort elements in Lexicographical order (Dictionary order) using in
built string functions.

UNIT IV (Week6&7)
1. C Program using structures to read and display the information about a student.
2. C Program to read, display, add and subtract two complex numbers.
3. C Program to read and display the information of a student using nested
structure.
4. C Program, using an array of pointers to a structure, to read and display the data
of students.
5. C Program to demonstrate arrays of Union variables.

UNIT V (Week8&9)
1. C Program to demonstrate, handling of pointers in C.
2. C Program to access array elements using pointers.
3. C Program to find the sum of n numbers with arrays and pointers.
4. C Program to swap two numbers using pointers and function
5. C Program to find sum of n elements entered by user. To perform this allocate
memory dynamically using malloc() function.
 6. C Program to find sum of n elements entered by user. To perform this allocate
memory dynamically using calloc() function.

UNIT VI (week10&11)
1. Write a program to create a linked list and perform insertions and deletions of all
cases. Write functions to sort and finally delete the entire list at once.
2. Write a program to create a doubly linked list and perform insertions and deletions
in all cases.
3. Write a program to perform push, pop and peek operations on a stack.
4. Write a program to implement a linked stack.

Course outcomes: At the end of the course, the student will be able

1. To formulate the algorithms for simple problems.

2. To translate the given algorithms to a working and correct program
3. To identify and correct logical errors encountered at run time
4. To write iterative as well as recursive programs
5. To represent Data in arrays, strings, Structures and manipulate them through a
program
6. To decompose a problem into functions and synthesize a complete program
7. To be able to create basic data structures

Assessment Method

Assessment Experiments Report/Viva-Voce/ Total

Tool Quiz/MCQ/Lab project
Weightage 25% 15% 40%
(%)
End Semester Examination weightage (%) 60%