To give the students a thorough and practical introduction to programming by means of a contemporary programming language.
Lecture 1:
Introduction to the course, problem-solving methodology.
Lecture 2 & 03:
Analyzing a problem, decomposition, designing problems that involve sequence, selection and iteration designing the algorithm using flowcharts, pseudocode.
Lecture 4:
Concept of a program, Introduction to first C++ computer program, source code, the compilation of a program, executable program, introduction to Variable, the identifier, and types of a variable
Lecture 5 & 6:
Writing programs using sequence statements
Lecture 7 & 8:
Introduction to operators and expressions, arithmetic operators, unary operators, comparison operators, logical operators,
Lecture 9:
Performing arithmetic operations, the order of precedence,
writing programs using arithmetic and logical operators
Lecture 10 & 11:
Working with the selection constructs (If statement, If-else statement )
Lecture 12:
Nested if statements, sample programs using selection statements
Lecture 13:
Working with selection statement (switch statement)
Lecture 14 & 15:
sample programs using the switch statement, exercise questions on the switch statement
Lecture 16:
Working with the iteration construct (For and nested For)
Lecture 17 & 18:
Sample programs using For statement, exercise questions
Lecture 19 & 20:
Working with the iteration construct (While and Do-While loop)
Lecture 21:
Sample programs using While and Do-while loops, exercise questions
Lecture 22, 23 & 24:
Working with arrays, Working with the array of characters, sample programs using arrays, exercise questions.
Lecture 25:
Working with 2-D arrays
Lecture 26 & 27:
Sample programs on 2-D arrays, exercise questions
Lecture 28,29 :
Understanding the string class, Using the string class functions, sample programs using the string class
Lecture 30:
Character conversions, Sample programs, writing programs using string class, exercise questions
Lecture 31:
Working with functions
Lecture 32 &33:
Sample programs and exercises
Lecture 34,35:
Using pointers, sample programs, sample programs and exercises
Lecture 36:
Dynamic memory allocation, sample programs
Lecture 37, 38:
Using structures, structure variables, array of structure variable. Sample programs and exercises.
Lecture 39:
Using structures wit functions, pointers and structures
Lecture 41, 42 & 4:
Working with text files, Why use files, standard library, various functions used for the files manipulations.
Semester project demos