Bidyanagar, Mahura, Janla, Bhubaneswar - 752 054 (Orissa) : C.V.Raman College of Engineering
Bidyanagar, Mahura, Janla, Bhubaneswar - 752 054 (Orissa) : C.V.Raman College of Engineering
Bidyanagar, Mahura, Janla, Bhubaneswar - 752 054 (Orissa) : C.V.Raman College of Engineering
Prerequisites:
Course Details:
U1.1. Basic functional units of a computer and their utility. Problem solving using
computers and logic design. Algorithms and their representations: flowcharts,
pseudo code. Designing algorithms. Efficient algorithm writing techniques.
Concept of programming languages for implementing algorithms – levels of
languages. Role of assemblers, compilers, linker, loader, interpreter in program
execution.
U1.2. Introduction to C: “Hello World” in C – editor, compiler, execution environment. C
as a middle level language. Basic structure of C program, standard library and
header files, Syntax and Semantics. Input-output statements, Formatted
input/output statements. Variable, constant (literal and named), Data types,
variable declaration. Assignment. Operators: Arithmetic, logical, relational,
Expressions, Precedence & Associativity. Input and output statements, escape
sequences.
U1.3. Self Study: Bits and bytes – importance of digital representation in computers.
Number System and algorithms for inter conversions. C programming
environments.
U3.1. Need of functions, function declaration, definition and call. Inbuilt functions and
user defined functions. Passing arguments to a function, returning values from a
function. Scope of variable, local and global variable. Access specifiers. Passing
arrays to functions.
U3.2. Recursive Functions: Need of Recursion, direct recursion, indirect recursion,
impact of recursion on local& global variables, examples of recursive programs –
factorial, progressions, towers of Hanoi. Recursive vs Iterative solutions.
Disadvantages of recursion.
U3.3. Self Study: Preprocessor and preprocessor directives: macro substitution,
difference between macro and functions.
U4.1. Concept of pointers, relevance of data type in pointer variable, pointer arithmetic.
Pointer to pointer. Pointers and functions (passing pointers to functions, returning
pointers from functions). Pointers and arrays. Constant Pointer. Array of pointers,
pointer to array. Array accessing using pointers.
U4.2. Strings: Strings as arrays, character array versus strings, reading and writing
strings, String handling functions, user defined functions for string operations –
copy, concatenate, length, reverse, converting case, appending, comparing two
string, extracting a substring. Pointers and strings. Array of strings.
U4.3. Self Study: String matching and implementation.
Note: Five assignments to be given to the students on self study, comprising of one
assignment from each unit.
Text Books:
T1. “Programming language – ANSI C”, Brain W Kernighan and Dennis Ritchie,
Second edition ISBN 0-13-110370-9
T2. “C Programming”, Balagurusamy, Tata McGraw-Hill
T3. Programming with C- Schaum’s outline Series”, B. Gottfried, Second edition, Tata
McGraw Hill Publication, ISBN 0-07-463491-7
Reference Books:
Prerequisites:
Course Details:
10. Write a C program that works with complex numbers using a structure. Perform
the following operations:
12. Write a program in C that use both recursive and non-recursive functions to find
the Factorial / GCD (greatest common divisor) of two given integers / Fibonacci
series.
13. Write a program in C to sort n integers using bubble / merge sort.
14. Write a program in C to search a number in a given list using linear / binary
search.
Text Books
Reference Books
R1. “Programming language – ANSI C”, Brain W Kernighan and Dennis Ritchie,
Second edition ISBN 0-13-110370-9,
R2. “A first book of C- Fundamental of C Programming”, Gary Bronson and Stephen
R3. “Projects using C”, P V N Varalakshmi, Sci-tech Publications (2009)
Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.
Alternative Proxies: