Course outline CSE113 PDF

Preview

Summary

Download Course outline CSE113 PDF

Description

East Delta University School of Science, Engineering and Technology Course Code: CSE 113 Credit Hours: 3

Instructor details Mohammed Nazim Uddin, PhD Office Hours: Before or after the class or by appointment. Phone: 01730794514 E-mail: [email protected]

Course Description: This course covers the concepts, features and constructs of structured programming approach. It describes the features of c language such as basic data types, operators, expressions, statements, procedures and functions. Various control statements with applications, arrays, pointers, structures and unions, file I/O operations have also been described with relevant programs. Furthermore it has explored the design and development of modular programming with flow charts. Moreover, it has described the purpose and uses of different library functions and pre-processor directives. Also it has articulated systematic procedure of solving a problem, coding scheme, debugging techniques. Learning Objectives: 

 

To get acquainted with the structured programming concept, features and constructs, and to develop the problem solving knowledge with this approach and modular programming in C syntax. Students will be able to gain insight the C programming language with the exploration of its various components to dig down the robust solutions to different applications. A systematic structured solution to a problem can be devised with reliability, accuracy and with greater efficiency.

Class Schedule and detailed Contents: Session Part 1

Content An overview of C as structured programming language  History of C  C is a structured language  Compilers Vs Interpreters  The library and linking  C's memory map  Pseudocode or Metacode or PDL  Programming  Modular (Top-Down) Program Design  Programming Methods  Top-down Design  Bottom up design and implementation  Structured programming  Why Structured Programming ?  Characteristics of Structured Programs

Part 2

Part 3

Class Test 1 Part 4

Part 5

Part 6

Class Test 2 Part 7

C Fundamentals  The C Character Set  Identifiers and Keywords  Data Types  Constants  Variables and Arrays  Declarations  Expressions  Statements  Symbolic Constants Operators and Expressions  Arithmetic Operators  Unary Operators  Relational and Logical Operators  Assignment Operators  The Conditional Operator  Library Functions Based on part 1 and part 2 Data Input and Output  Preliminaries  Single Character Input .The getchar Function  Single Character Output .The putchar Function  Entering Input Data .The scanf Function  More About the scanf Function  Writing Output Data .The printf Function  More About the printf Function  The gets and puts Functions  Interactive (Conversational) Programming Preparing and Running a Complete C Program  Planning a C Program  Writing a C Program  Entering the Program into the Computer  Compiling and Executing the Program  Error Diagnostics  Debugging Techniques Control Statements  Preliminaries  Branching: The i f .else Statement  Looping: The while Statement  More Looping: The do .while Statement  Still More Looping: The f o r Statement  Nested Control Structures  The switch Statement  The break Statement  The continue Statement  The Comma Operator  The goto Statement Based on Part 6 Functions  A Brief Overview  Defining a Function  Accessing a Function  Function Prototypes  Passing Arguments to a Function  Recursion

Part 8

Flowchart  Flowchart Symbols  Flowcharting Rules  Advantages of Flowchart  Limitations of Flowchart  General Design of Flowcharts

Part 9

Program Structure  Storage Classes  Automatic Variables  External (Global) Variables  Static Variables  Multifile Programs  More About Library Functions Arrays  Defining an Array  Processing an Array  Passing Arrays to Functions  Multidimensional Arrays  Arrays and Strings

Part 10

Presentation Part 11

Pointers  Fundamentals  Pointer Declarations  Passing Pointers to Functions  Pointers and One-Dimensional Arrays  Dynamic Memory Allocation  Operations on Pointers  Pointers and Multidimensional Arrays  Arrays of Pointers  Passing Functions to Other Functions  More about Pointer Declarations Class Test 3 Based on part 10 Part 12 Structures and Unions  Defining a Structure  Processing a Structure  User-Defined Data Types (typedef)  Structures and Pointers  Passing Structures to Functions  Self-Referential Structures  Unions Part 13 Data Files  Opening and Closing a Data File  Creating a Data File  Processing a Data File  Unformatted Data Files Textbooks and Required Reading:

Let Us C By Yashwant Kanetkar - PBP Publications Gottfried, B S 1996,Programming with C, 3rd edn, McGraw Hill. Schildt, H 2000,The complete reference C, 4th edn, McGraw Hill. Course Requirements/ Course Format/Marks Distribution:

Prerequisite: CSE 111 Marks Distribution: Class Attendance Assignment/Quiz Class Test (Best 2 out of 3) Mid Term Final Total

10 20 20 20 30 10 0

Method of Instruction: Lecture presentation, problem classes, case study, exercise questions. Grading Policy: Percentage (Marks) 93% & Above 89% -...