2301-Information
System Analysis (Semester V)
The information System Analyst.
Modern Information System. A System Development Life Cycle. Analyze an
Information System: A Problem-Solving Approach. Process Modeling with Physical
Data Flow Diagram. Data Modeling with Logical Entity Relationship Diagram.
Defining Conventional Computer Files and Controls. Designing Computer System.
Designing Computer-based Methods Procedures and Controls. Implementing a New
Information System. Project Management Tools and Techniques.
Books:
1)
System Analysis and
Design Methods. Second Edition. Whitten. Bentley & Sons.
2)
System Analysis and
Design Methods. Second Edition. Marjorie Lesson.
----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
2302-Files
and Data Base (Semester V)
Introduction to file based
system and file proceeding environment (Advantages. Disadvantages.
Implementation issues): Introduction to data. Database Management System. DBA.
Overview of Relational Database. Client-Server and Multi-Tier architectures.
Database Management System: Data-Definition Language commands. Overview of
query proceeding. Transaction proceeding. Outline of Database design.
Elements of Emtity-Relationship
model. Entity sets. Attributes Relations. F-R diagrams. Instance of an F-R diagram. Multiplicity of an F-R diagram.
Attributes on relations. Classification of constraints. Representing keys in
E-R models. Single-value constraints. Referential keys. Enhanced E-R models
(Categorization shared subclass etc)
Relational Data Model:
Attributes. Physical Schema. Logical and other schema. Tuples. Domains. From
E-R diagrams to Relational database.
Relational Algebra: Set.
Operation. Projections. Selection. Cartesian Product. Natural Joins.
Theta-Joins. Forming queries using combination of operators. Duplication
elimination. Grouping Sorting operator. Outer-Joins.
Functional dependencies: Keys
of relations. Super keys. Foreign keys. 1st and 2nd. Normal
forms. Removing anomalies. 3rd Normal
form. Boyee-codd Normal Form. Attribute Independence Normal
Form.
SQL: Simple queries in SQL.
Selection. Comparison of strings. Dates and times. Null values. Ordering.
Produces and joins in SQL. Tuple variables. Multi-relation queries. Union . Intersection. Differences. Sub-queries producing scalar
values.sub-queries in FROM clause. SQL join expressions. Grouping and
aggregation in SQL. HAVING clauses. Insertion. Deletion. Updates in database
using SQL. Declaring views. Querying views. Declaring Primary Keys. Declaring
Foreign keys. Triggers in SQL.
Views: introduction. What they
r for? View retrieval. Updates etc.
Transactions: Introduction.
Properties of transaction. Recovery. Serialization in SQL transaction Locking
transaction. Using timestamps etc.
Concurrency: Introduction.
Related issues. Conflicts in concurrency controls. Etc.
Security: Introduction.
Security issues of DBMS. Related matters etc.
Books:
Hector Molina. Jaffery Ullman
Et. (2001). Database System: The Complete Book. Prentice Hall.
Catherine Ricardo (1996).
Database System.
C.J. Date (1994). An
Introduction to Database System. Narosa Publication House.
2303-Computing Methods II (Semester-V)
Error
Analysis for Linear System: 1-,
2- and x-Norms of Vectors. Maximum columns row sums, 2- and e-Norms of
matrices. Effects of Round-off errors on solutions of system of linear
equation. Maximum column poviting. (Article, 2.8)
III. Conditioned System. Linear System Solver Machine. Condition Number
and their use in estimating relative error. iterative method of reducing
Round-off errors in solution of linear system. (Article, 2.9)
Iterative Method of Solving Linear
System: The
Gauss-Jacobi method and the Gauss-Seidel method.
(Article, 2.10)
System of Non-Linear Equation: Using Bisection Newton Method for solving two
non-linear equations in two unknown. Using Taylors Series and partial
derivative to solve the system 
(Article,
2.12)
(Article,
2.12)
Numerical
Solution to Ordinary Differential Equation:
Initial Values Problems. Taylor Series
method (Article, 5.2). Euler’s method and the Modified Euler’s method (Article,
5.3). Runge-Kutta method of order 2.4 and 6 (Article, 5.4). Multi-step method
(Article, 5.5). Milne’s method (Article, 5.6). Adams-Moulton method (Article,
5.7).
Note:
All article references given above are from the book no. 1 mentioned below.
Books:
·
“Applied Numerical Analysis”. C. F. Gerald &
P. O. Wheatley. 5th Edition. Addison-Wesley.
·
“Numerical Analysis”. R. L. Burden & J. D.
Faires 5th Edition. PWS publishing Co. Boston.
Review of concept of language and grammars. Direct graphs.
Classifications of grammars. Uses of regular expressions in designing lexical
analyze. Use of finite state automata and push down automata with regards to
their connections to language definition.
Parsing: Top down Parsing. Concrete and abstract syntax.
Recursive-descent parsing. Management of symbol table.
Types system: Data types in language. Product types. Algebraic types.
Arrow (function) types. Parameterized type. Type checking algorithms. Static
and dynamic typing.
Syntax detected translation: construction of syntax trees. S-attributed
grammar. L-attributed grammar. LL (I) grammar.
Code generation: Instruction selection. Single multiple pass code
generation. Register allocation.
Books:
Alfred V. Aho Ravi Sethi. Jaffery D. Ullman. Compilers: Principals.
Design and tools. Addison Wesley Co.
P.M. Lewis H.D.J. Rosencrantz. R.E. Stearns (1978). Compiler design
theory. Addison Wesley publishing company.
-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
2304-Comiler
Construction (Lab Work)
1)
Design token set of given langrage specification (on
paper).
2)
Implementation of lexemes generator that inputs a
stream of characters and breaks it into lexemes according to given language
specification.
3)
Implementation of symbol table and routines for storage
and retrieval of symbols (identifiers, literals etc.)
4)
Implementation of tokenizer that takes collection of
lexemes as input and creates tokens. According to given language specification.
5)
Design LL (I) grammar of given language specification
(on paper)
6)
Implementation of syntax checker for given language
specification PDA.
7)
Implementation of syntax checker of given language
specification using method recursive descent.
8)
Implementation of syntax box for given language
specification using method of recursive descent. (Input will be tokens and
output will be intermediate code atoms).
9)
Modification of syntax box that will perform error
detection and recovery.
10) Implementation
of code generator that will input intermediate code atoms and generator
assembly code (Use flow graphs and register allocation).
Note:
The above mentioned categories can be implemented
using any programming language. Short programming routines can be used several
times in different programs. These routines will be used Project Implementation
(Internally).
2315-Computer
Graphics (Semester-V)
Introduction to Computer Graphics: Applications, Line drawing and raster
scan displays, Drawing curves, n-gongs, roses, parametric representations of
line, rays, circle, ellipses.
Raster
Graphics:
Features of raster graphics, World coordinate system, windows and viewports. Mapping
from a window t o a viewport.clipping a line Cohen Sutherland algorithm.
Clipping circles and ellipses. Clipping polygons.Bressenham line algorithm
filling reetengles.filling ellipses.filling polygons.reeursive flood-fill
algorithm.introduction to Anti-Aliasing techniques.
Mathematical Review: vector spaces
and affined spaces. Vectors. Operations with vectors. Dot product. Linear
combination of vectors. Linear transformation.angle between two vectors.point Normal form for a line and a plane.cross product.scalar
Triple product.
Convex sets and
convex Hults Algorithm.Line clippingto convex windows,finding normal to a
plane.Testing plsnarity of a polygon.finding normal to a polygon .testing
convexity of polygon.area of polygon.
Ray tracing
intersection of a ray and a line. Intersection of a ray with circle. Parametric
form for surfaces.plane.cylinders.cones.guadric surfaces.
Two dimensional
transformations, Affined transformations: transformation, rotation, sealing,
sheering inverse Affine transforms. Properties and applying Affine transforms,
introduction to 3D computer graphics.three dimensional Affine transformation:
translation. Rotation.sheering.comouter grahics.three dimensional
Affine transformations,Non-Affine transforms:fish-eye.false perspectives,3D
wire frame model. Projection.Orthognal and perpeetive projrction.
Use of stsndard
graphics API open GL to implement algoriths.
Books:
1. Francis S Hill
jr (2000). Computer graphics using Open GL.prentics Hall inc.
2. James Foley
and Andries van Dam ET (1996).computer graphics principles and practice 2nd Edition.
Appison Wesley Co. (USA
3. Masom Woo.
Jackie.Neider.Tom Davis and Dave shreiner (1999). Open GL programming
Guide. Addison Wesley Co.(USA