|
Lecture |
Coverage |
Duration |
|
Introduction,
data types, variables and constants, operators, expression, assignment, basic
I/O, flowcharts, programming examples |
5 hours |
|
|
|
Number
systems |
2 hours |
|
|
Control
statements, programming examples and exercises |
3 hours |
|
|
Functions,
recursion, programming examples and exercises |
3 hours |
|
Arrays,
strings, using arrays with functions, programming examples and exercises |
4 hours |
|
|
|
Structures,
array of structures, examples |
1 hour |
|
Pointers,
relationship with arrays, parameter passing, dynamic memory allocation |
4 hours |
|
|
|
Files,
command-line parameters |
2 hours |
|
Linked
list, abstract data types, implementation of stacks and queues |
5 hours |
|
|
Sorting
algorithms: selection, bubble and quick, time and space complexity.
Searching: linear, binary. |
4 hours |
|
|
Applications
of stack: Polish notation, evaluation of postfix expressions, parentheses
matching, infix to postfix conversion. |
2 hours |
|
|
|
Algorithm
analysis, formal notations. |
2 hours |
|
L13-Tree |
Trees
and graphs, representation, traversal, application examples. |
3 hours |