Tuesday, 28 July 2020

ANU B.Sc (Computers) 1st Sen Problem Solving in C New Syllabus A.Y 2020-21

ANU B.Sc (Computers) 1st Sen Problem Solving in C New Syllabus A.Y 2020-21 for three years B.Sc Computer Science / Information Technology is now available. The new syllabus effects from 2020 admitted batch onwards.

Course Learning Outcomes:

Upon successful completion of the course, a student will be able to:

1. Understand the evolution and functionality of a Digital Computer.
2. Apply logical skills to analyze a given problem
3. Develop an algorithm for solving a given problem.
4. Understand ‘C’ language constructs like Iterative statements, Array processing, Pointers, etc.
5. Apply ‘C’ language constructs to the algorithms to write a ‘C’ language program.


General Fundamentals: Introduction to computers: Block diagram of a computer, characteristics and limitations of computers, applications of computers, types of computers, computer generations.

Introduction to Algorithms and Programming Languages: Algorithm – Key features of Algorithms, Flow Charts, Programming Languages – Generations of Programming Languages – Structured Programming Language- Design and Implementation of Correct, Efficient and Maintainable Programs.


Introduction to C: Introduction – Structure of C Program – Writing the first C Program –File used in C Program – Compiling and Executing C Programs – Using Comments –Keywords – Identifiers – Basic Data Types in C – Variables – Constants – I/O Statements in C- Operators in C- Programming Examples.

Decision Control and Looping Statements: Introduction to Decision Control Statements– Conditional Branching Statements – Iterative Statements – Nested Loops – Break and Continue Statement – Goto Statement


Arrays: Introduction – Declaration of Arrays – Accessing elements of the Array – Storing Values in Array– Operations on Arrays – one dimensional, two dimensional and multidimensional arrays, character handling and strings.


Functions: Introduction – using functions – Function declaration/ prototype – Function definition – function call – return statement – Passing parameters – Scope of variables – Storage Classes – Recursive functions.

Structure, Union, and Enumerated Data Types: Introduction – Nested Structures – Arrays of Structures – Structures and Functions– Union – Arrays of Unions Variables – Unions inside Structures – Enumerated Data Types.


Pointers: Understanding Computer Memory – Introduction to Pointers – declaring Pointer Variables – Pointer Expressions and Pointer Arithmetic – Null Pointers - Passing Arguments to Functions using Pointer – Pointer and Arrays – Memory Allocation in C Programs – Memory Usage – Dynamic Memory Allocation – Drawbacks of Pointers

Files: Introduction to Files – Using Files in C – Reading Data from Files – Writing Data to Files – Detecting the End-of-file – Error Handling during File Operations – Accepting Command Line Arguments.


1. E Balagurusamy – Programming in ANSIC – Tata McGraw-Hill publications.
2. Brain W Kernighan and Dennis M Ritchie - The ‘C’ Programming language” - Pearson publications.
3. Ashok N Kamthane: Programming with ANSI and Turbo C, Pearson Edition Publications.
4. YashavantKanetkar - Let Us ‘C’ – BPB Publications


Post a comment

Note: only a member of this blog may post a comment.

Degree One Sitting

Degree One Sitting

Degree Online Admissions


previous question papers







ANU Materials