------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
2203-Computing Methods I Semester IV
Computer Architecture and Errors:
Transaction Error, Round of Error, Error in original Data. Propagated Error.
Floating point architect, Actual Computer Number System. Architect Accuracy in
Computers. Absolute Error. Relative Errors. Significant Errors.
Solution of Non-Linear Equations:
Bisection Method, Secant Method, Regula Falsi Method, Fixed Point Iteration
Method. Newton
Interpolation:
Lagrange Polynomials, Divided Difference, Newton’s Divided Difference Polynomials,
Evenly-spaced data, Newton’s forward difference polynomials, Backward
Difference and Central difference formula, Inverse interpolation, Three
dimensional interpolation.
Numerical Differences and
Integration: Derivatives using differences table,
Higher order derivatives, Newton
Linear System of Equations:
The Elimination Method, Gauss and Gauss-Jordan methods.
Books
Recommended:
1. Applied
Numerical Analysis (5th Edition) Curtis F. Gerald and Patrick O.
Wheatley.
------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
2204-Data Structure and
Applications Semester IV
Abstract
Data Type: Introduction to ADT, Introduction to basic data
structure, static and dynamic lists. Stacks, queues, linked-lists, double
linked-list, circular linked lists.
Searching:
Linear searching, binary search, searching trade-offs, order of growth of
binary searching.
Sorting:
Study and implementation of sorting algorithm, selection sort, insertion sort,
merge sort, quick sort, heap sort, external sorting.
Hashing:
Application of Hashing, hashing function, collision detection techniques.
Trees:
Tree ADT, Beadth-first and depth-first traversal, Binary trees, Binary Search
trees, Inorder, Post-Order, Pre-order traversal, Height-balanced binary search
trees.
Graphs:
Graph ADT, Representation of graph, strongly connected graphs, spanning trees,
Minimal spanning trees, Shortest Path Algorithm, Traveling Salesman Problem
(TSM).
Books
Recommended:
1. Wiess. M. A. Data
Strucutre and Algorithm Analysis in C, 1993.
2. Data Structure.
Shaum Series.
3. Tannebaum A. Data
Structure using C++. Prentice Hall.
2205-Introduction to Operating
System Semester IV
Introduction:
Introduction to operating system O/S. Monitors, Multiprogramming, and
Multiprocessing, different classes of computers.
Process:
Process Concepts, process models, critical selection problem, Inter-Process
Communication.
Deadlocks:
Deadlocks characterization, Deadlock prevention and detection, Dijkstra’s
method. Mutex, Semaphores, Philosopher’s problems.
Scheduling:
Scheduling concept, Scheduling Algorithm, first-come-first-served,
shortest-job, first priority, etc.
Memory Management:
Memory hierarchy, paging techniques, Segmentation, Paged Segmentation.
Virtual Memory:
Paging Demand, Page Replacement, Algorithms, Allocation of frames, Thrashing.
File System:
File concept, Access Methods, File protection.
Introduction to Distributed
Systems: Study and analysis of a currently use Operating
System.
Books
Recommended:
1.
Stalling. W. Operating System
Fundamentals.
2.
Silberchatz. A. Peterson. JL.
Operating System Concepts.
------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
2207-Theory of Automata &
Formal Languages Semester IV
Languages:
Defining languages, Formal Languages, Kleene Closure, Regular expression,
Formal definition of regular expression.
Finites Automata:
Finite State Automata, Kleene’s Theorem. Converting regular expression into FA.
Nondeterministic Finite Automata (NFA). Moore
Push Down Automata:
Context free Grammar, A-production. Elimination of A-production. Chomsky Normal Form. PDA. CFG=PDA. Emptines and Uselessness. the
CHY Algorithm.
Turning Machines:
TMs. Post Machines. Nondeterministic TM. Read-Only TM. Theory of Recursive
Function. Recursively enumerable languages. Universal Turning Machine.
Church’s
Thesis, Chomsky Hierarchy, Complexity Classes.
Books
Recommended:
1.
Martin. J. (1997). Introduction to
Theory of languages and Theory of Computation. McGraw Hill.
2.
Cohen.I.A. Introduction to Computer Theory.
Revised Edition.