Scribd
Upload
109 views4 pages

CSE-2153 Course Outline

This document outlines the course schedule for a Numerical Methods and Computer Programming course taught in the fall 2016 semester. The course covers topics like introduction to computers and programming in C, conditional statements, loops, arrays, pointers, functions, recursion, numerical methods including solving equations and systems of equations, curve fitting, integration and differentiation. The course is assessed through attendance, three quizzes, and a final exam.

Uploaded by

Md. Azizul Hakim
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
109 views4 pages

CSE-2153 Course Outline

This document outlines the course schedule for a Numerical Methods and Computer Programming course taught in the fall 2016 semester. The course covers topics like introduction to computers and programming in C, conditional statements, loops, arrays, pointers, functions, recursion, numerical methods including solving equations and systems of equations, curve fitting, integration and differentiation. The course is assessed through attendance, three quizzes, and a final exam.

Uploaded by

Md. Azizul Hakim
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Ahsanullah University of Science & Technology

Department of Computer Science & Engineering

Course Outline of Fall-2016


Numerical Methods & Computer Programming
(CSE-2153)

Course Teacher:

Jisan Mahmud, Lecturer, Department of CSE, AUST


Week Topic
1 Introduction to the Digital Computer

 What is Computer
 Parts of Computer System
 Information Processing Cycle
 Essential Computer Hardware
 Software
 Data & users
 Logical Units of Computer
 How to execute a program
 Computer Languages
 Definition of Programming , Language and Algorithms(Flow Chart & Pseudo Codes)

2 Introduction to Programming Variables, Assignment, Input/ Output

 Introduction to C
 History of C
 Integrated Development Environments
 Features of C
 Compilers , Linkers , Loaders
 Source program , object Program , Executable Program, Syntax Errors , linker Errors,
Execution/Run-time errors
 Basic Structure of a C Program
 Characters ,White Space , keywords , Identifiers , Constants(Primary & Secondary)
 Operators(Binary , Unary, Relational , logical , Bitwise , Increment/Decrement &
Assignment )
 C Instructions(Type declaration , Input/ Output , Arithmetic & Control)
 Data types & type modifiers
 Interpreting Characters and Format Specifier
 Operator precedence and associativity

3 Expressions, Conditionals, and Branching

 Expression, Boolean Expression & Statement


 Conditional Statements
 If and Nested if Statements
 If-else and Nested if-else Statements
 If-else if-else Statements
 Switch and nested Switch Statements
 Advantages of switch Statements
 Use of break and continue Statement

4 Loop

 Introduction to Loop
 Initialization, Condition, and Counter
 Infinite Loop
 For loop
 While loop
 Do-while loop
 Quiz - 1

5 Loop Continue

 Nested for loop


 Nested while loop
 Nested do-while loop

6 Pointer and Array

 Introduction to Pointer
 Null Pointer
 Introduction to array
 Advantages and disadvantages of array
 Declaration of array
 Types of Array
 Initialization of array
 Quiz - 2

Page 1
6 String and Functions

 Definition and declaration of string


 User-defined Function
 Advantages of functions
 Function Calls

7 Recursion and Recursive Function

 Definition of Recursion
 Definition of Recursive Function
 Quiz-3

8 Introduction to Numerical Methods & Application , Finding roots of Non- Linear Equation in
Bracketing Method

 Bisection Method(Definition,Description,Applications,Advantages,Limitations)
 False Position Method(Definition,Description,Applications,Advantages,Limitations)

9 Finding roots of Non- Linear Equation in Open End Method

 Newton- Raphson Method(Definition, Procedure, Advantages, Limitations)


 Secant Method(Definition, Procedure, Advantages, Limitations)
 Fixed Point Method(Definition, Procedure, Advantages, Limitations)
 Quiz - 3

10 System of Linear Equation

 Gauss Elimination Method(Definition, Procedure, Advantages, Limitations)


 Gauss-Jordan Method(Definition, Procedure, Advantages, Limitations)
 Quiz - 4

11 Curve Fitting Regression, Numerical Integration & Differentiation

 Fitting Linear Equation


 Fitting Transcendental Equations
 Three-point Central Difference formula
 Romberg Integration

12 Review of all topics

Page 2
Marks Distribution:

Attendance 10%

Quiz 20%

Final Exam 70%

Page 3

You might also like