MC7102 syllabus - PROBLEM SOLVING AND PROGRAMMING

MC7102                                  PROBLEM SOLVING AND PROGRAMMING       L T P C

       3 0 0 3

COURSE OBJECTIVES:

1.To understand the basic concepts of problem solving approaches and develop optimal

program structure using conditional and iterative control structures and functions.

2. To design, implement, test, and apply the basic C programming concepts.

3. Apply the techniques of structured (functional) decomposition to break a program into smaller

pieces and describe the mechanics of parameter passing.

UNIT I INTRODUCTION TO COMPUTER PROBLEM SOLVING                                   8

Introduction – The Problem Solving aspect – Top down design – Implementation of algorithm –

Program Verification – The efficiency of algorithm – The analysis of algorithm.

UNIT II PROGRAMMING, ALGORITHMS AND FLOWCHARTS                          9

Programs and Programming – building blocks for simple programs -Programming life cycle phases –

pseudo code representation – flow charts - Algorithm - Programming Languages - compiler –

Interpreter, Loader and Linker - Program execution – Classification of Programming Language -

Structured Programming Concept.

UNIT III BASICS OF ‘C’, INPUT / OUTPUT & CONTROL STATEMENTS         9

Introduction- Identifier – Keywords - Variables – Constants – I/O Statements - Operators -

Initialization –Expressions – Expression Evaluation – Lvalues and Rvalues – Type Conversion in C –

Formatted input and output functions - Specifying Test Condition for Selection and Iteration-

Conditional Execution - and Selection – Iteration and Repetitive Execution- go to Statement – Nested

Loops- Continue and break statements.

UNIT IV ARRAYS, STRINGS, FUNCTIONS AND POINTERS                              10

Array – One dimensional Character Arrays- Multidimensional Arrays- Arrays of Strings - Two

dimensional character array – functions - parameter passing mechanism scope – storage classes –

recursion - comparing iteration and recursion- pointers – pointer operators - uses of pointers- arrays

and pointers – pointers and strings - pointer indirection- pointers to functions - Dynamic memory

allocation.

UNIT V USER-DEFINED DATATYPES & FILES                                                    9

Structures – initialization - nested structures – structures and arrays – structures and pointers - union

– typedef and enumeration types - bit fields - File Management in C – Files and Streams – File

handling functions – Sequential access file- Random access file – Command line arguments.

                                                                                                            TOTAL:45 PERIODS

COURSE OUTCOMES:

1. Able to design a computational solution for a given problem.

2. Able to break a problem into logical modules that can be solved (programmed).

3. Able to transform a problem solution into programs involving programming constructs

4. To write programs using structures, strings, arrays, pointesr and files for solving complex

computational problem.

5. Able to introduce modularity using functions and pointers which permit ad hoc run-time

Polymorphism

REFERNCES:

1. How to solve it by computer , R.G.Dromey, Pearson education , fifth edition, 2007.

2. Pradip Dey, Manas Ghosh, “Fundamentals of Computing and Programming in C”, First Edition,

Oxford University Press, 2009

3. Kamthane, A.N., “Programming with ANSI and Turbo C”, Pearson Education, Delhi,2006

4. Deitel and Deitel, ”C How to Program”, Pearson Education. 2010 6 th edition

5. Brian W. Kernighan and Dennis M. Ritchie, “The C programming Language”,2006, Prentice-Hall

6. Yashavant Kanetkar, “Understanding Pointers In C”, 4th Revised & Updated Edition, 2008, Bpb

Publications

7. Cormen,Leiserson, Rivest, Stein, “ Introduction to Algorithms”, McGraw Hill , Publishers, 2002

8. Peter Norton, “Introduction to Computers”, Sixth Edition, Tata McGraw Hill Publications, 2007.

9. Reema Thareja, “Programming in C”, Oxford University Press, 2011.