A2610008 - COMPUTATIONAL THINKING AND PROBLEM SOLVING USING C LAB

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

 CO1 : Apply computational thinking to construct algorithms and flowcharts for a given problem and translate them into working C programs. Apply - K3 

 CO2:  Develop C programs using operators, selection statements and loops to implement a specified logic. Apply - K3 

 CO3: Develop C programs that manipulate arrays, strings, structures and pointers to solve computational problems. Apply - K3 

 CO4: Construct modular programs using user-defined functions and recursion and perform file input-output operations. Apply - K3

 CO5: Analyse a C program by tracing and debugging it and evaluate alternative implementations for correctness and efficiency. Analyze – K4  

Lab Requirements (tools / software to carry out the experiments): 

•  C compiler: GCC (GNU Compiler Collection) — via MinGW-w64 on Windows, or the built-in gcc on Linux/macOS. 
•  IDE / editor: Code::Blocks, Dev-C++ or Visual Studio Code with the C/C++ extension.  Command-line terminal to compile and run programs (gcc, ./a.out) and observe the compile–link–run stages. 
•  Debugger: GDB (GNU Debugger), integrated in Code::Blocks / VS Code, for tracing and step-by step debugging. 
•  Operating system: Windows 10/11 or a Linux distribution (e.g., Ubuntu); any 64-bit PC with 4 GB RAM or more. 
•  No-install alternative: OnlineGDB, Programiz or Replit for quick practice and testing in a browser.

  List of Experiments Exercise 1: Cycle -1 Record Programs , Extra Module -1 Programs

Getting Started with 

 1. Write, compile and run a C program that prints “Hello, World!” on the screen. Identify the source file, the object file and the executable produced, and record the command used at each stage. 

 2. Write a C program that declares variables of type int, float, char and double, reads a value for each from the user, and displays each value together with the size of its type using sizeof. 

 3. Write a C program to read the height and width of a rectangle from the user and compute its perimeter and area.

Exercise 2: Operators and Expressions Cycle-2 Record Programs  , Extra Module-2 Programs

 1. Write a C program to compute the distance between two points whose coordinates are entered by the user. 

 2. Write a C program that reads four integers p, q, r, s and, using relational and logical operators, prints 'Correct values' if q > r, s > p and (r + s) > (p + q); otherwise 'Wrong values'. 

 3. Write a C program to compute simple and compound interest for values entered by the user.

Exercise 3: Selection and Decision Making Cycle-3 Record Programs, Extra Module-3 Programs

 1. Write a C program to read a character and classify it as a vowel, consonant, digit or special symbol. 2. Write a C program to find the largest of three numbers using nested if-else. 

 3. Write a menu-driven C program to compute the area of various geometrical shapes (circle, rectangle, triangle, square) using switch-case.

Exercise 4: Loops and Series  Cycle 4 Record Programs

 1. Write a C program to display the first n even natural numbers and their sum. 

 2. Write a C program to reverse a given integer and check whether it is a palindrome. 

 3. Write a C program to display the sum of the harmonic series 1 + 1/2 + 1/3 + ... up to n terms. 

Exercise 5: Nested Loops and Number Patterns  Cycle 5 Record Programs

 1. Write a C program to print the multiplication table pyramid for numbers 1 to n using nested loops. 

 2. Write a C program to check whether a given number is prime, then extend it to print all prime numbers and all Armstrong numbers below.

Exercise 6: One-Dimensional Arrays Cycle 6 Record Programs

 1. Write a C program to print all unique elements of an array, and implement linear search to find a given element in the array. 

 2. Write a C program to separate the odd and even elements of an array into two different arrays, and implement binary search to find a given element in a sorted array. 

 3. Write a C program to sort the elements of an array in ascending order using selection sort, and compare the efficiency of linear search vs. binary search on the sorted array by counting the number of comparisons each method takes.

Exercise 7: Matrices  Cycle 7 Record Programs

 1. Write a C program to perform addition of two square matrices and display the resultant matrices. 

 2. Write a C program to multiply two square matrices and display the resultant matrices. 

 3. Write a C program to find the transpose of a given matrix.

Exercise 8: Strings: 

 Write C programs to perform the following without using string handling functions 

•  Find the length of a given string. 
•  Copy one string into another. 
•  Concatenate two strings. 
•  Compare two strings and display whether they are equal, or which one is greater. 
•  Reverse a given string (using a separate swap function to exchange characters). 
•  Search for a character in a string and display its position (or indicate if not found). 
•  Count the number of vowels, consonants, and words in a given string 

Exercise 9: Pointers Fundamentals 

 1. Write a C program to demonstrate the use of the & (address-of) and * (value-at-address) operators. 

 2. Write a C program to add two numbers using pointers. 

 3. Write a C program to swap two values using call by reference. 

Exercise 10: Pointers and Dynamic Memory

 1. Write a C program to dynamically allocate memory for an array using malloc, find the largest element and the sum of all elements in it, then repeat using calloc and note the difference between the two. 

 2. Write a C program to count the number of vowels in a string using a pointer. 

Exercise 11: User-Defined Functions 

 1. Write a C program to check whether a number is prime using a user-defined function. 

 2. Write a C program to compute the GCD and LCM of two numbers using functions. 

 3. Write a C program to demonstrate a function that returns a pointer. 

Exercise 12: Recursion 

 1. Write a C program to compute the factorial and the n-th Fibonacci term using recursion.

 2. Write a C program to compute the sum of digits of a number using recursion. 

 3. Write a C program to convert a decimal number to its binary equivalent using a recursive function. 

Exercise 13: File Handling 

 1. Write a C program to append multiple lines at the end of an existing text file. 

 2. Write a C program to copy the contents of one file into another file. 

 3. Write a C program to count the number of characters, words and lines in a text file. 

E-RESOURCES: 

 1. NPTEL – Programming in C, IIT Kanpur: https://onlinecourses.nptel.ac.in/noc21_cs81/preview 

 2. Virtual Labs – Problem Solving Lab, IIIT Hyderabad: https://ps-iiith.vlabs.ac.in/ 

 3. GeeksforGeeks – C Programming: https://www.geeksforgeeks.org/c-programming-language/

 A2610003 - COMPUTATIONAL THINKING AND PROBLEM SOLVING USING C

Course Objectives: 

The main objective of the course is to

•   Familiarize students with computers, computational thinking, and the process of algorithmic problem solving. 
•  Build strong programming fundamentals using the C language, including operators, control structures, and loops. 
•  Develop the ability to design and implement solutions using arrays, strings, and user- defined data types. 
•  Impart working knowledge of pointers, recursion, dynamic memory allocation, functions, and file handling for building modular, reusable programs.  

Course Outcomes:

CO1: Apply computational thinking techniques (decomposition, abstraction, pattern recognition) to design algorithms and flowcharts for a given problem. Apply - K3

CO2: Develop C programs using appropriate operators, expressions, selection statements, and loops to implement a given logic. Apply - K3

CO3: Apply array, string, structure, and union concepts to develop suitable C programs for solving computational problems. Apply - K3

CO4: Apply pointers, recursion, and dynamic memory allocation to solve computational problems efficiently. Apply - K3

CO5: Construct modular C programs using user-defined functions and perform text/binary file input-output operations. Apply - K3

UNIT-I: Computational Thinking and Introduction to C Computational Thinking: Unit-I Material

Decomposition, Pattern Recognition, Abstraction, Algorithm Design; representing solutions as algorithms, pseudocode, and flowcharts; Number Systems and Data Representation (integers, reals); Overview of Computer Organization and Program Execution. Introduction to C: Background, Structure of a C Program, Identifiers, Keywords, Variables, Constants, Basic Data Types, Input/Output statements; Expressions, Operators, type of operators- arithmetic, relational, logical, bitwise, assignment, conditional, increment, decrement, etc., unary, binary, ternary, Operator Precedence and Associativity, Type Conversion; Scope, Storage Classes, and Type Qualifiers.

 UNIT-II: Selection and Decision-Making:  Unit-2 Material ,  Unit-2 Example Progs 

Simple if, Two-Way selection- if-else, nested-if, else-if ladder, and Multi-Way Selection- switch. Repetition: Counter- and Event-Controlled Loops: for, while, do-while, and nested loops; Break and continue, Programming Applications combining Selection and Repetition. Arrays: One-Dimensional and Two-Dimensional Arrays, Multidimensional Arrays, Array-based Problem Solving (searching, sorting, etc.).

UNIT-III: Functions:

 Designing Structured/Modular Programs, Function Declaration and Definition, Parameter Passing (by value, by reference using pointers), Passing Arrays and Pointers to Functions, Standard Library Functions, Inter-Function Communication. Recursion: Recursive vs. Iterative Solutions, Designing Recursive Algorithms, Recursion with Arrays and Pointers, Efficiency Considerations. Strings: String Representation, Standard String-Handling Functions, Arrays of Strings, String-to-Data Conversion. 

UNIT-IV: Pointers: 

Pointer Fundamentals, Pointer-to-Pointer, Pointer Arithmetic, Pointers and Arrays, Array of Pointers, types of pointers, Compatibility and L-value/R-value concepts. Dynamic Memory Allocation: malloc, calloc, realloc, free. User-Defined Types: typedef, Enumerated Types, Structures, Unions, and Nested Structures; Programming Applications using Structures and Arrays of Structures. 

UNIT-V: Pre-processor: 

Directives and Macros. Command Line Arguments. File I/O: Streams, Text vs. Binary Files, Standard Library File Functions, formatted and Character I/O, Sequential File Processing.

TEXT BOOKS: 

 1. Behrouz A. Forouzan & Richard F. Gilberg, Computer Science: A Structured Programming Approach Using C, 3rd Edition, Cengage Learning, ISBN-13: 978-0-534-49132-1. 

 2. Brian W. Kernighan & Dennis M. Ritchie, The C Programming Language, 2nd Edition, Pearson Education / Prentice Hall India, 1988. 

 REFERENCE BOOKS: 

 1. Sumitabha Das, “Computer Fundamentals and Programming”, 18th Edition, McGraw Hill Education, 2018. 

 2. Ashok N. Kamthane, Amit Ashok Kamthane, “Programming in C”, 4th Edition, Pearson Education, 2025. ISBN: 978-9332543633. 

 3. Pradip Dey, Manas Ghosh, “Computer Fundamentals and Programming in C”, 2nd Edition, Oxford University Press, 2013. ISBN: 978-0198068842. 

 E-RESOURCES: 

 1. NPTEL – Programming in C, IIT Kanpur: https://onlinecourses.nptel.ac.in/noc21_cs81/preview 

 2. Geeks for Geeks – C Programming Language: https://www.geeksforgeeks.org/c-programming language/ 

 3. Programiz – Learn C Programming: https://www.programiz.com/c-programming 

 4. cplusplus.com – C Standard Library Reference: https://cplusplus.com/reference/clibrary/ 

 5. TutorialsPoint – C Programming: https://www.tutorialspoint.com/cprogramming/index.html 

 6. W3Schools – C Tutorial: https://www.w3schools.com/c/

 

 23AM01-MACHINE LEARNING

PREREQUISITE : Probability and Statistics, Data Warehousing and Data Mining 

COURSE OUTCOMES (COs): At the end of the course, student will be able to

 

CO1 : Understand development steps of model building and evaluation approaches. (Understand- L2)

CO2 : Apply Nearest Neighbor-based models to solve real-time regression and classification problems . (Apply -L3)

CO3 : Make use of supervised learning algorithms to solve classification problems. (Apply- L3) 

CO4 : Apply linear discriminants and perceptron classifiers to classify datasets. (Apply- L3)

CO5 : Apply various clustering techniques to solve complex problems. (Apply- L3)

UNIT-I:    Unit-1 PPT Link  Unit-1 Pdf 

Introduction to Machine Learning: Evolution of Machine Learning, Paradigms for ML, Learning by Rote, Learning by Induction, Reinforcement Learning, Types of Data, Matching, Stages in Machine Learning, Data Acquisition, Feature Engineering, Data Representation, Model Selection, Model Learning, Model Evaluation, Model Prediction, Search and Learning, Data Sets. 

UNIT-II:  Unit-2 PPT Link , Unit-2 Pdf Link, Proximity distance measures link

Nearest Neighbor-Based Models: Introduction to Proximity Measures, Distance Measures, Non-Metric Similarity Functions, Proximity Between Binary Patterns, Different Classification Algorithms Based on the Distance Measures ,K-Nearest Neighbor Classifier, Radius Distance Nearest Neighbor Algorithm, KNN Regression, Performance of Classifiers, Performance of Regression Algorithms. 

UNIT-III: Unit-3 PPT Link, Unit-3 Pdf Link

Models Based on Decision Trees: Decision Trees for Classification, Impurity Measures, Properties, Regression Based on Decision Trees, Bias–Variance Trade-off, Random Forests for Classification and Regression. The Bayes Classifier: Introduction to the Bayes Classifier, Bayes’ Rule and Inference, The Bayes Classifier and its Optimality, Multi-Class Classification, Class Conditional Independence and Naive Bayes Classifier (NBC) 

UNIT-IV: Unit-4 PPT Link, Unit-4 Pdf Link, LDA Problem, Perceptron 

Linear Discriminants for Machine Learning: Introduction to Linear Discriminants, Linear Discriminants for Classification, Perceptron Classifier, Perceptron Learning Algorithm, Support Vector Machines, Linearly Non-Separable Case, Non-linear SVM, Kernel Trick, Logistic Regression, Linear Regression, Multi-Layer Perceptrons (MLPs), Backpropagation for Training an MLP. 

UNIT-V: Unit-V Pdf Link

Clustering : Introduction to Clustering, Partitioning of Data, Matrix Factorization, Clustering of Patterns, Divisive Clustering, Agglomerative Clustering, Partitional Clustering, K-Means Clustering, Soft Partitioning, Soft Clustering, Fuzzy C-Means Clustering, Rough Clustering, Rough K-Means Clustering Algorithm, Expectation Maximization-Based Clustering, Spectral Clustering. 

TEXTBOOKS: 

 T1 “Machine Learning Theory and Practice”, M N Murthy, V S Ananthanarayana, Universities Press (India), 2024. 

 REFERENCE BOOKS: 

 R1  “Machine Learning”, Tom M. Mitchell, McGraw-Hill Publication, 2017.

 R2   Peter Harington, “Machine Learning in Action”, Cengage, 1st edition, 2012 

 R3   Peter Flach, “Machine Learning: The art and science of algorithms that make sense of data”, Cambridge university press,2012.

 23AM51-MACHINE LEARNING LAB

Course Objectives: 

• To learn about computing central tendency measures and Data preprocessing techniques
 • To learn about classification and regression algorithms 
• To apply different clustering algorithms for a problem.

CO1: Apply the appropriate pre-processing techniques on dataset.(Apply–L3)
CO2: Implement supervised Machine Learning algorithms.(Apply–L3)
CO3: Implement advanced Machine Learning algorithms.(Apply–L3)
CO4: Improve individual/teamwork skills, communication & report writing skills with ethical values.

TEXTBOOKS:
T1“MachineLearningTheoryandPractice”,MNMurthy,VS Ananthanarayana,UniversitiesPress(India), 2024.
REFERENCEBOOKS:
R1“Machine Learning”,Tom M.Mitchell,McGraw-HillPublication,2017
R2“MachineLearning inAction”,PeterHarrington,DreamTech.
R3“IntroductiontoDataMining”, Pang-NingTan,MichelStenbach, VipinKumar,7^thEdition,2019.

Software Required: Python/R/Weka Lab should cover the concepts studied in the course work, sample list of Experiments:

 1. Compute Central Tendency Measures: Mean, Median, Mode Measure of Dispersion: Variance, Standard Deviation Cycle-1 Program. 

2.  Apply the following Pre-processing techniques for a given dataset. a. Attribute selection b. Handling Missing Values c. Discretization d. Elimination of Outliers.Cycle-2 Program1.py, Cycle -2 Program .ipynb file, Iris Dataset, Kidney-stone-Dataset.csv, Iris-Flower Dataset, Train_loan-Dataset, Cycle-2.1_ipynb, Cycle-2.2_ipynb, Cycle-2-Word, Cycle-2.1_word

3.  Apply KNN algorithm for classification and regression.

Cycle-3 Program link , Cycle-3 Program .py file

4. Demonstrate decision tree algorithm for a classification problem and perform parameter tuning for better results  Cycle -4 & 5 Programs Link, Play-Tennis, Housing Data, Heart Disease Prediction, Iris, Program link2
5. Demonstrate decision tree algorithm for a regression problem 
6. Apply Random Forest algorithm for classification and regression Program Link, Document link
7. Demonstrate Naïve Bayes Classification algorithm. Program Link , Dataset
8. Apply Support Vector algorithm for classification Program Link, Dastaset, Theory
 9. Demonstrate simple linear regression algorithm for a regression problem Program Link , Dataset, Theory
10. Apply Logistic regression algorithm for a classification problem Program link , Dataset, Theory
11. Demonstrate Multi-layer Perceptron algorithm for a classification problem.  Program Link 
12.Implement the K-means algorithm and apply it to the data you selected. Evaluate performance by measuring the sum of the Euclidean distance of each example from its class center. Test the performance of the algorithm as a function of the parameters K. Program Link
13. Demonstrate the use of Fuzzy C-Means Clustering. Program Link
14. Demonstrate the use of Expectation Maximization based clustering algorithm. Program Link

23CS51-COMPUTER PROGRAMMING LAB

 

   23CS51-COMPUTER PROGRAMMING LAB

Pre-requisite: Mathematics, Basic Computer Terminology

Course Objective: The course aims to give students hands – on experience and train them on the concepts of the C- programming language. 

Course Outcomes (CO):

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

CO1: Read, understand, and trace the execution of programs written in C language. (Understand-L2) 

CO2: Apply the right control structure for solving the problem. (Apply-L3) 

CO3: Develop, Debug and Execute programs to demonstrate the applications of arrays, functions, pointers and files in C. (Apply-L3) 

CO4: Improve individual / teamwork skills, communication and report writing skills with ethical values. 

UNIT I

WEEK 1   Click the link 

Objective: Getting familiar with the programming environment on the computer and writing the first program. 

Suggested Experiments/Activities: 

Tutorial 1: Problem-solving using Computers.

 Lab1: Familiarization with programming environment 

i) Basic Linux environment and its editors like Vi, Vim & Emacs etc.

 ii) Exposure to Turbo C, gcc

 iii) Writing simple programs using printf(), scanf() 

WEEK 2   Click the link for week 2 programs

Objective: Getting familiar with how to formally describe a solution to a problem in a series of finite steps both using textual notation and graphic notation. 

Suggested Experiments /Activities: 

Tutorial 2: Problem-solving using Algorithms and Flow charts.

 Lab 2: Converting algorithms/flow charts into C Source code. 

Developing the algorithms/flowcharts for the following sample programs

 i) Sum and average of 3 numbers

 ii) Conversion of Fahrenheit to Celsius and vice versa 

iii) Simple interest calculation 

WEEK 3  Click the link for Week 3 Programs Link 2

Objective: Learn how to define variables with the desired data-type, initialize them with appropriate values and how arithmetic operators can be used with variables and constants.

 Suggested Experiments/Activities: 

Tutorial 3: Variable types and type conversions: 

Lab 3: Simple computational problems using arithmetic expressions. 

i) Finding the square root of a given number

 ii) Finding compound interest

 iii) Area of a triangle using heron’s formulae 

iv) Distance travelled by an object

UNIT II 

WEEK 4 Click the link for Week 4 Programs

Objective: Explore the full scope of expressions, type-compatibility of variables & constants and operators used in the expression and how operator precedence works.

 

Suggested Experiments/Activities: 

Tutorial4: Operators and the precedence and as associativity:

 Lab4: Simple computational problems using the operator’ precedence and associativity

 i) Evaluate the following expressions. a.A+B*C+(D*E) + F*G b. A/B*C-B+A*D/3 c.A+++B---A d. J= (i++) + (++i) 

ii) Find the maximum of three numbers using conditional operator 

iii) Take marks of 5 subjects in integers, and find the total, average in float 

WEEK 5 Click the link for Week 5 Programs

Objective: Explore the full scope of different variants of “if construct” namely if-else, nullelse, ifelse if*-else, switch and nested-if including in what scenario each one of them can be used and how to use them. Explore all relational and logical operators while writing conditionals for “if construct”. 

Suggested Experiments/Activities: 

Tutorial 5: Branching and logical expressions:

 Lab 5: Problems involving if-then-else structures. 

i) Write a C program to find the max and min of four numbers using if-else. 

ii) Write a C program to generate electricity bill. 

iii) Find the roots of the quadratic equation.

 iv) Write a C program to simulate a calculator using switch case. 

v) Write a C program to find the given year is a leap year or not. 

WEEK 6 Click the link for week 6 Programs

Objective: Explore the full scope of iterative constructs namely while loop, do-while loop and for loop in addition to structured jump constructs like break and continue including when each of these statements is more appropriate to use. 

Suggested Experiments/Activities: 

Tutorial 6: Loops, while and for loops 

Lab 6: Iterative problems e.g., the sum of series

 

i) Find the factorial of given number using any loop. 

ii) Find the given number is a prime or not.

 iii) Compute sine and cos series 

iv) Checking a number palindrome 

v) Construct a pyramid of numbers.

UNIT III 

WEEK 7: Click the link for Week 7 Programs

Objective: Explore the full scope of Arrays construct namely defining and initializing 1-D and 2- D and more generically n-D arrays and referencing individual array elements from the defined array. Using integer 1-D arrays, explore search solution linear search. 

Suggested Experiments/Activities: 

Tutorial 7: 1 D Arrays: searching.

 Lab 7:1D Array manipulation, linear search

 i) Find the min and max of a 1-D integer array.

 ii) Perform linear search on1D array. 

iii) The reverse of a 1D integer array 

iv) Find 2’s complement of the given binary number. 

v) Eliminate duplicate elements in an array.

WEEK 8: 

Objective: Explore the difference between other arrays and character arrays that can be used as Strings by using null character and get comfortable with string by doing experiments that will reverse a string and concatenate two strings. Explore sorting solution bubble sort using integer arrays. 

Suggested Experiments/Activities: 

Tutorial 8: 2 D arrays, sorting and Strings. 

Lab 8: Matrix problems, String operations, Bubble sort

 i) Addition of two matrices 

ii) Multiplication two matrices 

iii) Sort array elements using bubble sort 

iv) Concatenate two strings without built-in functions 

v) Reverse a string using built-in and without built-in string functions

 

UNIT IV 

WEEK 9: 

Objective: Explore pointers to manage a dynamic array of integers, including memory allocation and value initialization, resizing changing and reordering the contents of an array and memory deallocation using malloc(), calloc(), realloc() and free() functions. Gain experience processing command-line arguments received by C 

Suggested Experiments/Activities: 

Tutorial 9: Pointers, structures and dynamic memory allocation 

Lab 9: Pointers and structures, memory dereference.

 i) Write a C program to find the sum of a 1D array using malloc() 

ii) Write a C program to find the total, average of n students using structures 

iii) Enter n students data using calloc() and display failed students list 

iv) Read student name and marks from the command line and display the student details along with the total. 

v) Write a C program to implement realloc() 

WEEK 10: 

Objective: Experiment with C Structures, Unions, bit fields and self-referential structures (Singly linked lists) and nested structures 

Suggested Experiments/Activities: 

Tutorial 10: Bitfields, Self-Referential Structures, Linked lists 

Lab10 : Bitfields, linked lists 

i) Read and print a date using dd/mm/yyyy format using bit-fields and differentiate the same without using bit- fields 

ii) Create and display a singly linked list using self-referential structure. 

iii) Demonstrate the differences between structures and unions using a C program. 

iv) Write a C program to shift/rotate using bitfields. 

v) Write a C program to copy one structure variable to another structure of the same type. 

UNIT V 

WEEK 11: 

Objective: Explore the Functions, sub-routines, scope and extent of variables, doing some experiments by parameter passing using call by value. Basic methods of numerical integration 

Suggested Experiments/Activities: 

Tutorial 11: Functions, call by value, scope and extent, 

Lab 11: Simple functions using call by value, solving differential equations using Euler’s theorem.

 

i) Write a C function to calculate NCR value.

 ii) Write a C function to find the length of a string. 

iii) Write a C function to transpose of a matrix.

iv) Write a C function to demonstrate numerical integration of differential equations using Euler’s method 

WEEK 12: 

Objective: Explore how recursive solutions can be programmed by writing recursive functions that can be invoked from the main by programming at-least five distinct problems that have naturally recursive solutions. 

Suggested Experiments/Activities: 

Tutorial 12: Recursion, the structure of recursive calls 

Lab 12: Recursive functions

 i) Write a recursive function to generate Fibonacci series.

ii) Write a recursive function to find the LCM of two numbers.

iii) Write a recursive function to find the factorial of a number. 

iv) Write a C Program to implement Ackermann function using recursion. 

v) Write a recursive function to find the sum of series. 

WEEK 13: 

Objective: Explore the basic difference between normal and pointer variables, Arithmetic operations using pointers and passing variables to functions using pointers 

Suggested Experiments/Activities: 

Tutorial 13: Call by reference, dangling pointers 

Lab 13: Simple functions using Call by reference, Dangling pointers.

 i) Write a C program to swap two numbers using call by reference. 

ii) Demonstrate Dangling pointer problem using a C program.

 iii) Write a C program to copy one string into another using pointer. 

iv) Write a C program to find no of lowercase, uppercase, digits and other characters using pointers. 

WEEK14: 

Objective: To understand data files and file handling with various file I/O functions. Explore the differences between text and binary files.

 Suggested Experiments/Activities: 

Tutorial 14: File handling

 Lab 14: File operations

 i) Write a C program to write and read text into a file.

 ii) Write a C program to write and read text into a binary file using fread() and fwrite() 

iii) Copy the contents of one file to another file.

 iv) Write a C program to merge two files into the third file using command-line arguments. 

v) Find no. of lines, words and characters in a file 

vi) Write a C program to print last n characters of a given file.

 

Textbooks: 

1. Ajay Mittal, Programming in C: A practical approach, Pearson. 

2. Byron Gottfried, Schaum's Outline of Programming with C, McGraw Hill 

Reference Books: 

1. Brian W. Kernighan and Dennis M. Ritchie, The C Programming Language, Prentice Hall of India 

2. C Programming, A Problem-Solving Approach, Forouzan, Gilberg, Prasad, CENGAGE

INTRODUCTION TO PROGRAMMING_2025 -26

 

                                       23CS01-INTRODUCTION TO PROGRAMMING

Pre-requisite : Mathematics, Basic Computer concepts 

Course Objectives:

 • To introduce students to the fundamentals of computer programming.

 • To provide hands-on experience with coding and debugging. 

• To foster logical thinking and problem-solving skills using programming. 

• To familiarize students with programming concepts such as data types, control structures, functions, and arrays.

 • To encourage collaborative learning and teamwork in coding projects. 

Course Outcomes: 

At the end of this course, the student will be able to 

CO1: Understand basics of computers, concept of algorithms and flowcharts. (Understand-L2) 

CO2: Understand the features of C language. (Understand-L2) 

CO3: Interpret the problem and develop an algorithm to solve it. (Apply-L3) 

CO4: Implement various algorithms using the C programming language. (Apply-L3) 

CO5: Develop skills required for problem-solving and optimizing the code (Apply-L3)

 UNIT – I  Click the link for Unit 1 Material  Link 2

Introduction to Programming and Problem Solving History of Computers, Basic organization of a computer: ALU, input-output units, memory, program counter, Introduction to Programming Languages, Basics of a Computer Program, Algorithms, flowcharts (Using Dia Tool), pseudo code. Introduction to Compilation and Execution, Primitive Data Types, Variables, and Constants, Basic Input and Output, Operations, Type Conversion, and Casting. Problem solving techniques: Algorithmic approach, characteristics of algorithm, Problem solving strategies: Top-down approach, Bottom-up approach, Time and space complexities of algorithms.

UNIT – II Click the link for unit-2 Material   Extra Progs for Unit-2

Control Structures Simple sequential programs Conditional Statements (if, if-else, switch), Loops (for, while, do while) Break and Continue.

 UNIT – III 

Arrays and Strings Arrays indexing, memory model, programs with array of integers, two dimensional arrays, Introduction to Strings. 

UNIT – IV 

Pointers & User Defined Data types Pointers, dereferencing and address operators, pointer and address arithmetic, array manipulation using pointers, User-defined data types-Structures and Unions. 

UNIT – V 

Functions & File Handling Introduction to Functions, Function Declaration and Definition, Function call Return Types and Arguments, modifying parameters inside functions using pointers, arrays as parameters. Scope and Lifetime of Variables, Basics of File Handling

Textbooks: 

1. "The C Programming Language", Brian W. Kernighan and Dennis M. Ritchie, Prentice Hall, 1988 

2. Schaum’s Outline of Programming with C, Byron S Gottfried, McGraw-Hill Education, 1996

 Reference Books: 

1. Computing fundamentals and C Programming, Balaguruswamy, E., McGraw-Hill Education, 2008.

 2. Programming in C, Rema Theeraja, Oxford, 2016, 2nd edition

 3. C Programming, A Problem Solving Approach, Forouzan, Gilberg, Prasad, CENGAGE, 3rd edition

computer networks

CN COURSE HANDOUT_V_sem_2018-19

                                        UNIT -I Material

PPT

Important  Questions

Assignment Questions

QUIZ Questions

Tutorial Questions

                                                    UNIT -II Material

PPT1

PPT2
 
PDF

Important  Questions

Assignment Questions

QUIZ Questions

Tutorial Questions


                                                        UNIT -III Material

PPT

Word

Important Questions

Assignment Questions

QUIZ Questions

Tutorial Questions

                                                            UNIT -IV Material

PPT

PDF 

Important Questions

Assignment Questions

QUIZ Questions

Tutorial Questions

                                                               UNIT -V Material

PPT

PDF

Important Questions

Assignment Questions

QUIZ Questions

Tutorial Questions