Syllabus (COMPUTER SCIENCE)

Course Type: MAJ-1

Semester: 1

Course Code: BCOSMAJ01C

Course Title: Computer Fundamentals and Programming using C

(L-P-Tu): 4-2-0

Credit: 6

Practical/Theory: Combined

Course Objective: • Understand the functionality and history of computer. • Design the logical structure of a C Programming Language. • Identify the input, output functions and format Specifiers in C Programming. • Understand built-in and user defined functions in

Learning Outcome: • Able to write the pseudo code for the programs. • Proficient enough to implement the derived and the user defined data types. • Describe the pointer and file data structures concepts with its operations. • Proficient enough to debug and test cod

Fundamentals

Use of computer, history and generation of computer, Software/ Hardware, Computer peripherals, Basic component and storage, Fundamentals of Boolean Algebra, Logic Gates, Switching Functions, Simplification of Switching Functions, Data Representation and Basic Computer Arithmetic Number Systems and Codes, Base Conversion, Complements, Fixed and Floating-Point Representation, Character Representation, Addition, Subtraction, Magnitude Comparison. (10 Lectures)

Overview of C

Concept of Logic, Need of Programming, A Brief History of C, Form of a C Program, Basic syntax of C Program, Concept of Block, Compilation and Execution of a C Program, Use of Comments. (5 Lectures)

Data Types, Variables, Constants, Operators and Basic I/O

Basic Data Types, Declaration and Definition of Variables, Memory map of variable, Scope of Variables, Storage Class Specifiers, Variable Initialization, Constants, Type Qualifier (const), Operators, Formatted Console I/O, Unformatted Console I/O (getchar(), putchar()), Header Files. (5 Lectures)

Expressions and Statements

Operator Precedence, Type Conversion, Typecasting, Conditional Statements, Loops. (5 Lectures)

Arrays, Strings, Functions

Array, Types, Declaration and Initialization, Passing Arrays to Functions, Strings, General form of a Function, Function Declaration and Definition, Call by Value, Call by Reference, Arguments to main()(argc and argv), Returning from a Function, Functions Returning Values, Function Returning Pointers, Functions of Type void, Declaring Variable-Length Parameter Lists, Recursion, Library Functions. (18 Lectures)

Derived Data Types (Structures and Unions)

Basics of Structures, Accessing Structure Members, Structure Assignments, Array of Structures, Pointers to Structures, Passing Structures to Functions, Nested Structures, Self-Referential Structures, Bit-Fields, Unions, typedef. (5 Lectures)

Pointers

Pointer Variables, Pointer Assignments, Pointer/Address Arithmetic, Pointer Comparison, Array of Pointers, Multiple Indirection, Pointers to Functions, Problems with Pointers.(5 Lectures)

Memory Allocation in C

Static and Dynamic Memory Allocation, C’s Dynamic Allocation Functions (malloc(), calloc(), free()). (3 Lectures)

File I/O and Preprocessor Directives

Opening and Closing a File, Reading and Writing Text Files, Random Access in Files, Preprocessor Directives, Macros. (4 Lectures)

Programming Lab using C

• Basics: Print in Console, Arithmetic Operations, Swapping, Control Sequence.
• Conditional Statement: If, If else, If else ladder, Switch, Break.
• Iteration: For Loop, While Loop, Do While Loop, Continue Statement.
• Function: Simple Function, Recursion Structure, Union Pointer.

References:

1. R. Sethi, Programming Languages: concepts and constructs, Addison-Wesley.

2. B.W. Kernighan and D.M. Ritchie, The C Programming Language, PHI.

3. R.C. Hutchinson and S.B. Just, Programming using the C Language, McGraw-Hill.

4. B.S. Gottfried, Schaum’s Outline of Theory and Problems of Programming with C, McGraw-Hill.

5. H. Schildt, C Made Easy, Osborne McGraw-Hill.

6. YashavantKanetkar, Let Us C, BPB Pubication.

7. E Balagurusamy, Computer Fundamentals and C Programming, McGraw-Hill.