GE6151 – COMPUTER PROGRAMMING – SYLLABUS (REGULATION 2013) ANNA UNIVERSITY
UNIT I : INTRODUCTION
(GE6151)Generation and Classification of Computers- Basic Organization of a Computer –Number System –Binary – Decimal – Conversion – Problems. Need for logical analysis and thinking – Algorithm –Pseudo code – Flow Chart.
UNIT II : C PROGRAMMING BASICS
Problem formulation – Problem Solving – Introduction to ‘ C’ programming –fundamentals – structure of a ‘C’ program – compilation and linking processes – Constants, Variables – Data Types –Expressions using operators in ‘C’ – Managing Input and Output operations – Decision Making and
Branching – Looping statements – solving simple scientific and statistical problems.
UNIT III : ARRAYS AND STRINGS
Arrays – Initialization – Declaration – One dimensional and Two dimensional arrays. String- String operations – String Arrays. Simple programs- sorting- searching – matrix operations.
UNIT IV : FUNCTIONS AND POINTERS
Function – definition of function – Declaration of function – Pass by value – Pass by reference – Recursion – Pointers – Definition – Initialization – Pointers arithmetic – Pointers and arrays- Example Problems.
UNIT V : STRUCTURES AND UNIONS
Introduction – need for structure data type – structure definition – Structure declaration – Structure within a structure – Union – Programs using structures and Unions – Storage classes, Pre-processor directives.
Course Curriculum
unit 1 | |||
Unit 1 – Introduction to computers | 00:10:00 | ||
Generations of computers | 00:15:00 | ||
Classification of computers | 00:05:00 | ||
Basic organization of computer | 00:15:00 | ||
Algorithm – properties | 00:05:00 | ||
Flow charts | 00:10:00 | ||
Algorithm & flow chart for calculating area and circumference of circle | 00:05:00 | ||
Algorithm & flow chart to find odd or even no | 00:05:00 | ||
Algorithm and flowchart to find biggest of three number | 00:05:00 | ||
Algorithm and flowchart to find factorial of N numbers | 00:10:00 | ||
Pseudocode & rules | 00:10:00 | ||
Problem formulation & Conclusion | 00:20:00 | ||
unit 2 | |||
Programming language & feature | 00:05:00 | ||
Structure of ‘c’ program | 00:05:00 | ||
Fundamentals of ‘C’ , character set, constants , variables and data types | 00:10:00 | ||
Operators | 00:15:00 | ||
Bitwise operator & Special operator | 00:15:00 | ||
Managing input & output operations | 00:10:00 | ||
Decision making statement | 00:10:00 | ||
Nested if statement | 00:05:00 | ||
Switch statement | 00:05:00 | ||
Iteration statement | 00:10:00 | ||
Jump statement | 00:05:00 | ||
Continue & return statement | 00:05:00 | ||
Conclusion for unit 2 | 00:05:00 | ||
unit 3 | |||
One dimensional array | 00:15:00 | ||
Two dimensional array | 00:15:00 | ||
string declaration & initialization | 00:05:00 | ||
Read & Write string | 00:05:00 | ||
String handling function | 00:15:00 | ||
Program for matrix operation | 00:15:00 | ||
Program searching | 00:05:00 | ||
Program for sorting | 00:05:00 | ||
Conclusion for unit 3 | 00:05:00 | ||
unit 4 | |||
Unit 4 – Introduction | 00:05:00 | ||
User defined function | 00:10:00 | ||
Elements of user defined function | 00:10:00 | ||
Functions | 00:15:00 | ||
Call by value | 00:05:00 | ||
Call by reference | 00:10:00 | ||
Recursion | 00:05:00 | ||
Pointers | 00:05:00 | ||
Declaration of pointer variables | 00:05:00 | ||
Pointers & Array | 00:10:00 | ||
Pointers & Two dimensional array | 00:05:00 | ||
Conclusion of unit 4 | 00:05:00 | ||
unit 5 | |||
Unit 5 – Introduction | 00:05:00 | ||
Structure | 00:10:00 | ||
Access & Giving value to structure members | 00:05:00 | ||
Comparison of structure variable & array of structure | 00:05:00 | ||
Array & structure within structure | 00:10:00 | ||
Union | 00:10:00 | ||
Program using structure & union | 00:05:00 | ||
Storage class | 00:15:00 | ||
Pre-processor & macro substitution | 00:05:00 | ||
File inclusion directives & compiler control directives | 00:05:00 | ||
Conclusion for unit 5 | 00:10:00 |
gud
easy to learn