Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
0% found this document useful (0 votes)
271 views

CS-463 Numerical Computing

This 3-credit, undergraduate-level numerical computing course provides an introduction to numerical methods and their applications in computer science. The course aims to develop students' understanding of numerical methods for solving equations, linear systems, interpolation, differentiation, and ordinary differential equations. Students will learn algorithms and analyze computational errors and convergence. Assessment is based on quizzes, assignments, a midterm exam, and a final exam. The syllabus covers topics like root-finding methods, linear algebra techniques, interpolation, and eigenvalue problems over 16 weeks.

Uploaded by

Ahsan jarar
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
271 views

CS-463 Numerical Computing

This 3-credit, undergraduate-level numerical computing course provides an introduction to numerical methods and their applications in computer science. The course aims to develop students' understanding of numerical methods for solving equations, linear systems, interpolation, differentiation, and ordinary differential equations. Students will learn algorithms and analyze computational errors and convergence. Assessment is based on quizzes, assignments, a midterm exam, and a final exam. The syllabus covers topics like root-finding methods, linear algebra techniques, interpolation, and eigenvalue problems over 16 weeks.

Uploaded by

Ahsan jarar
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

UNIVERSITY OF GUJRAT

A WORLD CLASS UNIVERSITY

Department of Computer Science


COURSE DESCRIPTION
Course Code CS-463
Course Title Numerical Computing
Credit Hours 03
Instructor Name Bushra Younas
Category Computing Supporting Course
Prerequisite MATH-107, MATH-110
Amis and This course provides a systematic introduction to aspects of numerical methods Introduces the foundations of numerical
Objectives computing as they apply to Computer Science, focusing on providing a solid theoretical foundation for further work.
Further, this course aims to develop a systematic introduction to aspects of numerical methods in most Computer Science
problems and structures. In this course more emphasis shall be given to statistical and probabilistic formulation with respect
to computing aspects. It provides a sound foundation in NUMERICAL Computing for students of Computer Science.
Course Outline / The concepts of efficiency, reliability and accuracy of a method; Minimising computational errors; Theory of Differences, Difference
Syllabus Operators, Difference Tables, Forward Differences, Backward Differences and Central Differences. Mathematical Preliminaries,
Solution of Equations in one variable, Interpolation and Polynomial Approximation, Numerical Differentiation and Numerical
Integration, Initial Value Problems for Ordinary Differential Equations, Direct Methods for Solving Linear Systems, Iterative
Techniques in Matrix Algebra, Solution of non-linear .
Text Book 1. Numerical Analysis, Richard L. Burden, J. Douglas Faires, (9th Edition), 2010, Brooks/Cole Publishing Company.

2. Applied Numerical Analysis, Curtis F. Gerald, Patrick O, Wheatley, (7th Edition), 2003, Addison Education.

3. Numerical Methods for Mathematics, Science and Engineering, John H. Mathews,

(4th Edition), 2004, Prentice Hall International.


4. Numerical Methods, V. N. Vedamurthy, Ch. S. N. Iyenger, 2002, Vikas Publishing House PVT Ltd.

Reference Material 1. Bernard Kolman, David Hill, Elementary Linear Algebra with Applications, 9th edition, Prentice Hall PTR, 2007.
2. David C. Lay, Linear Algebra and Its Applications, 2nd edition, 2000.
Assessment 5% weightage of Quiz, 10 % weightage of Assignments and 10% weightage of Presentation.

1
Criteria 25 % weightage of Mid Term Exam and 50 % weightage of Final Exam.

Grading System

Numeric value of
Marks in Percentage Letter Grade Description
Grade

85+ A+ 4.00 Exceptional

80-84 A 3.70 Outstanding

75-79 B+ 3.40 Excellent

70-74 B 3.00 Very Good

65-69 B- 2.50 Good

60-64 C+ 2.00 Average

55-59 C 1.50 Satisfactory

50-54 D 1.00 Pass

49 and below F 0.0 Fail

W Withdrawal

I Incomplete

2
Recommendations for
Learning Activities
(Mention Assignments,
Test, Quizzes,
Week Lecture Topic
Practical, Case Study,
Projects, Lab Work
or Reading
Assignments)
1 1 ● Number System and errors; Round off Errors
2 ● Computer Arithmetic. Error estimation
2 3 ● Algorithm and Convergence Solution of non Linear Equations Assignment
4 ● Iterative Methods and Convergence Quiz
3 5 ● Bisection Methods Assignment
6 ● Fixed point iterative Method
4 7 ● Regular Falsi method quiz
8 ● Secant and Newton´s Method,
5 9 ● Gaussian Elimination methods
10 ● Gauss-Jordan Method
6 11 ● Factorization DoolittleMethod and its various Forms Assignment will be given
12 ● Factorization Crout Method and its various Forms
7 13 ● Factorization Cholesky Method and its various Forms Quiz
14 ● Factorization(Doolittle, Crout and Cholesky) Method and its various Forms Assignment
8 15 ● Iterative Methods and convergence
16 ● Jacobi Methods
9 17 ● Mid Term Exam Objective and Subjective
18 ● Mid Term Exam
10 19 ● Gauss-Seidel Method Assignment
20 ● III-Condition system and condition number
11 21 ● Eigen values Quiz

3
22 ● Eigen Vectors
12 23 ● Interpolating and Polynomial Approximation: Difference Operators
24 ● Interpolation with unequal intervals
13 25 ● Lagrange´s Interpolation Formula Quiz
26 ● Newton´s Divided Difference Formula
14 27 ● Error in Polynomial Interpolation. Assignment
28 ● Interpolation with equal intervals: Gregory Newton Forward/Backward
Interpolation Formula
15 29 ● Stirling´s Formula Quiz
30 ● Laplace Everett´s Formula, Bessel´ s Formula
16 31 ● Gauss´s Forward/Backward Interpolation Formula,
32 ● Revision of Course

You might also like