Memory and variables – locations, addresses, definitions and declarations; program structure, data types, operators, and expressions, expression evaluation: operator, precedence and associativity, expression evaluation with different data types: type conversion (implicit and explicit), relational, equality, and logical operators

Control statements- sequential, conditional and iterative, if-statement (if-else ladder, nested if, compound if), switch statement (multiway selection), for statement (nested for), while and do-while loops. Sample programs illustrating the use of control statements as basic building blocks.

One dimensional and multi-dimensional random access lists: declaring, initializing, and accessing list elements, searching algorithms: linear and binary, sorting algorithms: selection, insertion and bubble sort, implementing stacks and queues using arrays.

Need of functions: modularity and reuse, declaration and definition, scope of data and problem solving, Recursion-self recursive structures, Merge sort, Binary Search using recursion.<br /> Introduction to pointers, argument passing to functions: by value and by reference and pointer arithmetic

Character arrays as strings, standard library string functions: syntax and implementation, string manipulation with and without header file string.

Memory layout – implicit vs. explicit allocation; static vs. dynamic allocation; new and delete for dynamic allocation/deallocation, user defined types: typedef, # define, structures, pointer to structure, union, enumerated data types, self referential structures