Andhra Pradesh State Council of Higher Education B.Sc. Computer Science/Information Technology (IT) Syllabus Under CBCS w.e.f.2015-2016 (Modified in April 2016) Structure of Computer Science/Information Technology (IT) Syllabus I YEAR II SEMESTER Paper-II : PROGRAMMING IN C Course Objectives Learn how to solve common types of computing problems. Learn data types and control structures of C Learn to map problems to programming features of C. Learn to write good portable C programs. Course Outcomes Upon successful completion of the course, a student will be able to: Appreciate and understand the working of a digital computer Analyze a given problem and develop an algorithm to solve the problem Improve upon a solution to a problem Use the 'C' language constructs in the right way Design, develop and test programs written in 'C' UNIT I Introduction to Algorithms and Programming Languages: Algorithm Key features of – Algorithms Some more Algorithms Flow Charts Pseudo code Programming – – – – Languages Generation of Programming Languages Structured Programming – – 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 Type Conversion and Type Casting – UNIT II Decision Control and Looping Statements: Introduction to Decision Control Statements – Conditional Branching Statements Iterative Statements Nested Loops Break and – – – Continue Statement Goto Statement – Introduction using functions Function declaration/ prototype Function Functions: – – – definition function call return statement Passing parameters Scope of variables – – – – – Storage Classes Recursive functions Type of recursion Towers of Hanoi Recursion – – – – vs Iteration UNIT III Arrays: Introduction Declaration of Arrays Accessing elements of the Array Storing – – – Values in Array Calculating the length of the Array Operations on Array one – – – dimensional array for inter-function communication Two dimensional Arrays – on Two Dimensional Arrays - Two Dimensional Arrays for inter-function communication Multidimensional Arrays Sparse Matrices – – Strings: Introduction Input String Taxonomy String Operations –Suppressive – – – Miscellaneous String and Character functions Page 4 of 50
Andhra Pradesh State Council of Higher Education B.Sc. Computer Science/Information Technology (IT) Syllabus Under CBCS w.e.f.2015-2016 (Modified in April 2016) Structure of Computer Science/Information Technology (IT) Syllabus I YEAR II SEMESTER Paper-II : PROGRAMMING IN C Course Objectives Learn how to solve common types of computing problems. Learn data types and control structures of C Learn to map problems to programming features of C. Learn to write good portable C programs. Course Outcomes Upon successful completion of the course, a student will be able to: Appreciate and understand the working of a digital computer Analyze a given problem and develop an algorithm to solve the problem Improve upon a solution to a problem Use the 'C' language constructs in the right way Design, develop and test programs written in 'C' UNIT I Introduction to Algorithms and Programming Languages: Algorithm – Key features of Algorithms – Some more Algorithms – Flow Charts – Pseudo code – Programming Languages – Generation of Programming Languages – Structured Programming 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 – Type Conversion and Type Casting UNIT II Decision Control and Looping Statements: Introduction to Decision Control Statements – Conditional Branching Statements – Iterative Statements – Nested Loops – Break and Continue Statement – Goto Statement Functions: Introduction – using functions – Function declaration/ prototype – Function definition – function call – return statement – Passing parameters – Scope of variables – Storage Classes – Recursive functions – Type of recursion – Towers of Hanoi – Recursion vs Iteration UNIT III Arrays: Introduction – Declaration of Arrays – Accessing elements of the Array – Storing Values in Array – Calculating the length of the Array – Operations on Array – one dimensional array for inter-function communication – Two dimensional Arrays on Two Dimensional Arrays - Two Dimensional Arrays for inter-function communication – Multidimensional Arrays – Sparse Matrices Strings: Introduction –Suppressive Input – String Taxonomy – String Operations – Miscellaneous String and Character functions Page 4 of 50