problem-solving strategies, techniques and skills that can be applied to computers

and problems in other areas which give students an introduction to computer and
analytical skills to be used in their subsequent course work and professional
development. Emphasis of this course is to act as an introduction to the thinking
world of computers, to help students develop the logic, ability to solve the
problems efficiently using C programming. Knowledge in a programming language is
prerequisite to the study of most of computer science courses. This knowledge area
consists of those skills and concepts that are essential to problem-solving and
programming practice independent of the underlying paradigm. Student will learn
various concepts and techniques for problem-solving and will implement those ideas
using C programming.
Syllabus
BLOCK 1: An Introduction to C
Unit 1: Problem Solving
• Problem - Solving Techniques
o Steps for Problem - Solving
o Using Computer as a Problem-Solving Tool
• Design of Algorithms
o Definition
o Features of Algorithm
o Criteria to be followed by an Algorithm
o Top Down Design
• Analysis of Algorithm Efficiency
o Redundant Computations
o Referencing Array Elements
o Inefficiency Due to Late Termination
o Early Detection of Desired Output Condition
o Trading Storage for Efficient Gains
• Analysis of Algorithm Complexity
o Computational Complexity
o The Order of Notation
o Rules for using the Big - O Notation
o Worst and Average Case Behavior
• Flowcharts
o Basic Symbols used in Flowchart Design
Unit 2: Basics of C
• What is a Program and what is a
Programming Language?
• C Language
o History of C
o Salient Features of C
• Structure of a C Program
o A Simple C Program
• Writing a C Program
• Compiling a C Program
o The C Compiler
o Syntax and Semantic Errors
• Link and Run the C Program
o Run the C Program through the Menu
o Run from an Executable File
o Linker Errors
o Logical and Runtime Errors
• Diagrammatic Representation of Program
Execution Process
Unit 3: Variables and Constants
• Character Set
• Identifiers and Keywords
o Rules for Forming Identifiers
o Keywords
• Data Types and Storage
• Data Type Qualifiers
• Variables
• Declaring Variables
• Initialising Variables
• Constants
o Integer Constants
o Floating Point Constants
31