Computer Fundamentals and Programming in C

Choice Based Credit System (CBCS)

Effective from the Academic Tear 2024-25
Semester- I

Program Name B.Sc Course Credits 04

Course Code 24KBSCS09 Formative Assessment Marks 20
Teaching Hours Per Week 4hrs/week Summative Assessment Marks 80
Total Number of Contact Hours 48hr Exam Duration 3hrs

Course Learning Objectives: This Course will enable students to

 Elucidate the basic architecture and functionalities of a computer and also recognize the hardware and
software parts.
 Apply programming constructs of C language to solve the real world problem
 Explore user-defined data structures like arrays in implementing solutions to problems like searching and
sorting
 Explore user-defined data structures like structures, unions and pointers in implementing solutions
 Design and Develop Solutions to problems using modular programming constructs using functions

UNITS CONTENTS HOURS

1 Fundamentals of Computers: Introduction to Computers - Computer Definition, 10
Characteristics of Computers, Types of Computers, Basic Organization of a Digital Computer;
Number Systems – different types, conversion from one number system to another; Computer
Codes – BCD, Gray Code, ASCII and Unicode; Boolean Algebra – Boolean Operators with
Truth Tables; Types of Software – System Software and Utility Software; Computer Languages
- Machine Level, Assembly Level & High Level Languages, Translator Programs – Assembler,
Interpreter and Compiler; Planning a Computer Program - Algorithm, Flowchart and Pseudo
code with Examples.
2 Introduction to C Programming: Over View of C; History and Features of C; Structure of a C 10
Program with Examples; Creating and Executing a C Program; Compilation process in C.
C Programming Basic Concepts: C Character Set; C tokens - keywords, identifiers, constants,
and variables; Datatypes; Declaration & initialization of variables; Symbolic constants.
Input and output with C: Formatted I/O functions - printf and scanf, control stings and escape
sequences, output specifications with printf functions; Unformatted I/O functions to read and
display single character and a string – getchar, putchar, gets and puts functions.
3 C Operators & Expressions: Arithmetic operators; Relational operators; Logical operators; 10
Assignment operators; Increment & Decrement operators; Bitwise operators; Conditional
operator; Special operators; Operator Precedence and Associatively; Evaluation of arithmetic
expressions; Type conversion.
Control Structures: Decision making Statements - Simple if, if_else, nested if_else, else_if
ladder,
Switch-case, goto, break & continue statements; Looping Statements- Entry controlled and Exit
controlled statements, while, do-while, for loops, Nested loops.
4 Arrays: One Dimensional arrays-Declaration, Initialization and Memory representation; Two 102
Dimensional arrays- Declaration, Initialization and Memory representation.
Strings: Declaring & Initializing string variables; String handling functions –strlen, strcmp,
strcpy and strcat; Character handling functions - toascii, toupper, tolower, isalpha, isnumeric
etc.
Pointers in C: Understanding pointers - Declaring and initializing pointers, accessing address
and value of variables using pointers; Pointers and Arrays; Pointer Arithmetic;
Advantages and Disadvantages of using pointers;
5 User Defined Functions: Need for user defined functions; Format of C user defined functions; 8
Components of user defined functions - return type, name, parameter list, function body, return
statement and function call; Categories of user defined functions - With and without
parameters and return type.
User defined data types: Structures - Structure Definition, Advantages of Structure, declaring
structure variables, accessing structure members, Structure members initialization, comparing
structure variables, Array of Structures; Unions - Union definition; difference between
Structures
And Unions.

Pedagogy: Lecture/ PPT/ Videos/ Animations/ Role Plays/ Think-Pair-Share/ Predict-Observe- Explain/ Demonstration
/ Concept mapping/ Case Studies examples/ Tutorial/ Activity/ Flipped Classroom/ Jigsaw/ Field based Learning/Project
Based Learning/ Mini Projects/ Hobby Projects/ Forum Theatre/ Dance/ Problem Based Learning/ Game Based Learning
/ Group Discussion/ Collaborative Learning/ Experiential Learning / Self Directed Learning etc.

Text Books:
1. Pradeep K.Sinha and Priti Sinha: Computer Fundamentals(Sixth Edition), BPBPublication
2. E. Balgurusamy: Programming in ANSIC(TMH)
3. A. M. Padma Reddy: C- Programming Techniques, Sri Nandi Publications

Reference Books:
1. Kamthane: Programming with ANSI and TURBOC(Pearson Education)
2. V.Rajaraman: Programming in C(PHI–EEE)
3. S.Byron Gottfried: Programming with C(TMH)
4. Kernighan & Ritche: The C Programming Language(PHI)
5. Yashwant Kanitkar: Let us C
6. P.B.Kottur: Programming in C(Sapna Book House)

Formative Assessment for Theory

Assessment Occasion/ type Marks
Internal Assessment Test 1 05
Internal Assessment Test 2 05
Quiz/ Group Discussion/ Seminar 05
Assignment/Team Paper 05
Formative Assessment 20
Summative Assessment 80
Total 100 Marks
C Programming Lab
Choice Based Credit System (CBCS)
Effective from the Academic Tear 2024-25
Semester- I

Program Name B.Sc Course Credits 02

Course Code 24KBSCL09 Formative Assessment Marks 10
Teaching Hours Per Week 2hrs/week Summative Assessment Marks 40

Course Learning Outcomes: After completing this lab course you will be able to:
 Understand the logic for a given problem.
 Write the algorithm of a given problem.
 Draw a flow chart of a given problem.
 Recognize and understand the syntax and construction of C programming code.
 Gain experience of procedural language programming.
 Know the steps involved in compiling, linking and debugging C code.

Sl. No Description
1 Write a C Program to read radius of a circle and to find area and circumference.
2 Write a C Program to read three numbers and find the biggest of three.
3 Write a C Program to check for prime
4 Write a program to calculate simple and compound interest.
5 Write a program to check whether the entered year is leap year or not (a year is leap if it is divisible by 4
and divisible by 100 or 400.)
6 Write a program to find whether a character is consonant or vowel using switch statement.
7 Write a C program to read marks scored by n students and find the average of marks (Demonstration of
single dimensional array)
8 Write a C Program to demonstrate string functions.
9 Write a C Program to demonstrate pointers in C
10 Write a C Program to demonstrate the difference between structure & union.

Practical Assessment
Formative Assessment Summative Total
Assessment Marks
Assessment Weightage in Marks Practical Exams
Practical 10
Internal 40
Total 10 40 50
Data Structure using C
Choice Based Credit System (CBCS)
Effective from the Academic Tear 2024-25
Semester- II

Program Name B.Sc Course Credits 04

Course Code Formative Assessment Marks 20
Teaching Hours Per Week 4hrs/week Summative Assessment Marks 80
Total Number of Contact Hours 48hr Exam Duration 3hrs

Course Learning Objectives: This Course will enable students to

 Understand basics of C programming language
 Acquire knowledge of - Various types of data structures, operations and algorithms - Sorting and searching
operations
 Analyze the performance of - Stack, Queue, Lists, Trees, Graphs
 Implement all the applications of Data structures in a high-level language
 Design and apply appropriate data structures for solving computing problems.

UNITS CONTENTS HOURS

1 Introduction to data structures: Definition; Types of data structures - Primitive & Non- 10
primitive, Linear and Non-linear; Operations on data structures.
Algorithm Specification, Performance Analysis, Performance Measurement.
Recursion: Definition; Types of recursions; Recursion Technique Examples - Fibonacci
n
numbers, GCD, Binomial coefficient Cr, Towers of Hanoi; Comparison between iterative and
recursive functions.
2 Arrays: Basic Concepts – Definition, Declaration, Initialization, Operations on arrays; 10
Types of arrays; Arrays as abstract datatypes (ADT); Representation of Linear Arrays in
memory; Traversing linear arrays; Inserting and deleting elements; Sorting – Selection
sort, Bubble sort, Quick sort, Selection sort, Insertion sort; Searching – Sequential
Search, Binary search; Iterative and Recursive searching; Multidimensional arrays;
Representation of Multidimensional arrays; Sparse matrices.
3 Dynamic memory allocation: Static & Dynamic memory allocation; Memory allocation and 8
de-allocation functions - malloc, calloc, realloc and free.
Linked list: Basic Concepts – Definition and Representation of linked list, Types of linked
lists-Singly linked list, Doubly linked list, Header linked list, Circular linked list;
Representation of Linked list in Memory; Operations on Singly linked lists–Traversing,
Searching, Insertion, Deletion; Memory allocation; Garbage collection.
4 Stacks: Basic Concepts – Definition and Representation of stacks; Operations on stacks; 10
Applications of stacks; Infix, postfix and prefix notations; Conversion from infix to postfix
using stack; Evaluation of postfix expression using stack; Application of stack in function calls.
Queues: Basic Concepts–Definition and Representation of queues; Types of queues-Simple
queues, Circular queues, Double ended queues, Priority queues; Operations on Simple queues;
5 Trees: Definition; Tree terminologies–node, root node, parent node, ancestors of a node, 10
siblings, terminal & non-terminal nodes, degree of a node, level, edge, path, depth; Binary
tree: Type of binary trees - strict binary tree, complete binary tree, binary search tree and
heap tree; Array representation of binary tree. Traversal of binary tree; preorder, inorder
and postorder traversal; Reconstruction of a binary tree when any two of the traversals are
given.
Graphs: Definition, Comparison between graph and tree, types of graph, terminologies.
Pedagogy: Lecture/ PPT/ Videos/ Animations/ Role Plays/ Think-Pair-Share/ Predict-Observe- Explain/ Demonstration
/ Concept mapping/ Case Studies examples/ Tutorial/ Activity/ Flipped Classroom/ Jigsaw/ Field based Learning/Project
Based Learning/ Mini Projects/ Hobby Projects/ Forum Theatre/ Dance/ Problem Based Learning/ Game Based Learning
/ Group Discussion/ Collaborative Learning/ Experiential Learning / Self Directed Learning etc.

Text Books:
1. Satraj Sahani: Fundamentals of Data Structures

Reference Books:
1. Tanenbaum: Data structures using C (Pearson Education)
2. Kamathane: Introduction to Data structures (Pearson Education)
3. Y.Kanitkar: Data Structures Using C (BPB)
4. Kottur: Data Structure Using C
5. Padma Reddy: Data Structure Using C

Formative Assessment for Theory

Assessment Occasion/ type Marks
Internal Assessment Test 1 05
Internal Assessment Test 2 05
Quiz/ / Seminar/ GD 05
Assignment/ Team Paper 05
Formative Assessment 20
Summative Assessment 80
Total 100 Marks
Data Structure using C Lab
Choice Based Credit System (CBCS)
Effective from the Academic Tear 2024-25
Semester- II

Program Name B.Sc Course Credits 02

Course Code Formative Assessment Marks 10
Teaching Hours Per Week 2hrs/week Summative Assessment Marks 40
Total Number of Contact Hours 42hr Exam Duration 2hrs

Course Learning Outcomes: After completing this lab course you will be able to:
 Implement various basic data structures and its operations.
 Implement various sorting and searching algorithms.
 Implement various stack and queue operations.
 Implement various tree and graph operations.
 Develop simple applications using various data structures.
 Develop algorithms using various searching and sorting techniques.

Sl. No Description
1 Write a C Program to find GCD using recursive function.
2 Write a C Program to display Pascal Triangle using binomial function.
3 Write a C Program to implement Towers of Hanoi.
4 Write a C Program to sort the given list using selection sort technique.
5 Write a C Program to sort the given list using bubble sort technique.
6 Write a C Program to implement Stack.
7 Write a C Program to implement simple queue.
8 Write a C Program to convert an infix expression to postfix.
9 Write a C Program to implement linear linked list.
10 Write a C Program to display traversal of a tree.

Practical Assessment
Formative Assessment Summative Total
Assessment Marks
Assessment Weightage in Marks Practical Exams
Practical
Internal 10 40 50