Abdul Wali Khan University Mardan

Department of Computer Science

BCS (Hons.) Program

(Curriculum)

Computing Core Courses

Course Title Credit hours

Programming Fundamentals 3-1

Object Oriented Programming 3-1

Data Structures & Algorithms 3-1

Discrete Structures 3-0

Operating Systems 3-1

Database Systems 3-1

Introduction to Software Development 3-0

Introduction to Networks 3-1

Information Security 3-0

Final year Project 0-6

Total Credit Hours 39

 General Education Courses
Course Title Credit hours

Functional English 3

Technical Writing 3

Communication skills 3

Professional Practices 3

Introduction to Communication and Technology 3-1 or 2-1

Pakistan Studies 2

Islamic Studies 2

Total Credit Hours 20 or 19

Computer Science Core (Compulsory) Courses

Course Title Credit hours

Compiler Construction 3-0

Computer Organization & Assembly Language 3-1

Digital Logic Design 3-1

Design & Analysis of Algorithms 3-0

Parallel & Distributed Computing 3-0

Artificial Intelligence 3-1

Automata Theory 3-0

Total Credit hours 24

 Computer Science Supporting Courses
Course Title Credit hours

Differential Equations 3

Multi variate Calculus 3

Graph Theory 3

Theory of Programming Languages 3

Numerical Computing 3

Total Credit hours 15

Technical Electives (Choose any 7 courses: 21 Credit hours)

# Code Title Credit Hours Semester

1 CS-505 Visual Programming 3 5

2 CS-506 Fuzzy Logic and Control 3 5

3 CS-507 Rapid Application Development 3 5

4 CS-554 Mobile Application Development 3 6

5 CS-555 Data Network Security 3 6

6 CS-556 Formal Specification of Software 3 6

7 CS-557 Web Application Development 3 6

8 CS-558 Data Mining and Data Warehousing 3 6

9 CS-559 Game Modeling 3 6

10 CS-560 Software Engineering- II 3 6

11 CS-603 Distributed Database Systems 3 7

12 CS-604 Programming Game Engines 3 7

13 CS-605 Web Engineering 3 7

14 CS-606 Principles of Programming Languages 3 7

15 CS-653 Computer Graphics 3 8

16 CS-654 Artificial Neural Networks 3 8

17 CS-655 System Programming 3 8

18 CS-656 Technical Game Design 3 8

19 CS-657 Multimedia Arts 3 8

20 CS-658 Game Algorithms 3 8

21 CS-659 Interactive Multimedia 3 8

22 Wireless Sensor Networks 3

23 Wireless Communication Systems 3

24 Web application Development 3

25 Web Fundamentals / Web Application Development 3

26 Digital Image Processing 3

27 Expert Systems 3

28 Natural Language Processing 3

29 Big data analytics 3

Total Credits

University Elective Courses (Choose any 4 courses: 12 Credit Hours)

(As per the HEC rules it should be minimum 12 credit hours)

# Code Title Credit Hours Semester

1 CSU-551 Introduction to Psychology 3 6

2 CSU-552 International Relations 3 6

3 CSU-553 Financial Accounting 3 6

4 CSU-554 Human Resource Management 3 6

5 CSU-555 Foreign Language 3 6

6 CSU-556 Organizational Behavior and Culture 3 6

7 CSU-557 Fundamentals of Marketing 3 6

8 CSU-651 E-Commerce 3 8

9 CSU-652 Database Administration 3 8

10 CSU-653 Geographical Information System 3 8

11 CSU-654 Research Methodology 3 8

12 CSU-655 Introduction to Graph Theory 3 8

13 CSU-656 Business Intelligence 3 8

14 CSU-657 Entrepreneurship 3 8

15 CSU-658 Digital Moviemaking and Animation 3 8

16 CSU-659 Enterprise Resource Planning 3 8

17 CSU-660 Information System 3 8

18 CSU-661 Research Methodology 3 8

Total Credits
Course Group Credits % age

Computing Core Courses 39 29.10%

General Education Courses 20 26.8%
Computer Science Core 24 19.9%
(Compulsory) Courses

Computer Science 15 8.3%

Supporting Courses

Technical Electives

University Elective Courses

 Semester 1

Code Title Credit Hour Pre-Requisite

IS-301 Islamic Studies 2

Math-301 Calculus and Analytical Geometry 3

CS-301 Introduction to Computing and Technology 4(3+1)

CS-302 Programming Fundamentals 4(3+1)

Eng-301 Functional English 3

16

Semester 2

Code Title Credit Hour Pre-Requisite

PS-351 Pakistan Studies 2

Math-351 Multivariate Calculus 3 Math-301

CS-351 Object Oriented Programming 4(3+1) CS-302

Phy-351 Basic Electronics 3(2+1)

Eng-351 Communication Skills 3 Eng-301

15
 Semester 3

Code Title Credit Hour Pre-Requisite

CS-401 Digital Logic and Design 3(2+1)

Math-401 Discrete Structure 3

CS-402 Data Structures 4(3+1) CS-351

CS-403 Probability and Statistics 3

Eng-401 Technical Writing 3 Eng-301

16

Semester 4

Code Title Credit Hour Pre-Requisite

Cs-451 Database Systems 4(3+1)

CS-452 Operating Systems 4(3+1) CS-351

CS-453 Data Communications 3 CS-301

CS-454 Advance Computer Programming (Java) 4(3+1) CS-351

Math-451 Linear Algebra 3 Math-301

18
 Semester 5

Code Title Credit Hour Pre-Requisite

CS-501 Introduction to Networks 3(2+1) CS-453

CS-502 Automata Theory 3 Math-401

CS-503 Design and Analysis of Algorithms 3 CS-402

CS-504 Introduction to Software Development 3 CS-351

Tech-Elective-1 (web development application) 3

15
 Semester 6

Code Title Credit Hour

CS-551 Compiler Construction 3 CS-502

CS-552 Artificial Intelligence 3 (2+1) CS-503

CS-553 Computer Organization and Assembly Language 3(2+1) CS-401

University Elective-I 3

Tech-Elective II 3

Tech-Elective III 3

18

Semester 7

Code Title Credit Hour

Math-601 Numerical Computing 3

CS-601 Human Computer Interaction 3(2+1)

University Elective-II (E-Commerce) 3

Tech Elective –IV (Fuzzy Logic and Control) 3

Tech-Elective –V (Data Mining and Data 3

Warehousing)

CS-651 Senior Design Project 3 CS-504

18
 Semester 8

Code Title Credit Hour

University Elective-III 3

Tech-Elective-VI 3

Tech-Elective-VII 3

University Elective-IV 3

CS-651 Senior Design Project 3

15

Total Credit hours: 131 / 130

 Semester 1 (Course Outline)

Course Name: Islamic Studies (IS-301)

Credit Hours: 2 (2+0)

Prerequisites: None

Objectives: To familiarize the students with the basic concepts of Islamic Studies. To inculcate in
the minds of the student’s basic knowledge and spirit of Quran and Hadith. To produce peace loving
and practicing Muslims with an enlightened spirit, moderate approach, missionary zeal and belief in
the universal brotherhood.

Course Outline: Introduction to Compilation of Holy Quran, Surah Al-Furqan and Concept of Ibad-
ur-Rahman, Surah Al-Hujrat and Social Behavior and Character Building, Introduction to Hadith,
Important Sources of Hadith, Few Selected Hadith, Life of the Prophet (P.B.U.H.), Principles of Islam
and Islamic Civilization, Historical Perspective of Ideology of Pakistan.

Reference Material:

 The Holy Quran.

 Islam and Globalization: A Contemporary Vision by Mohamed Abdelrahman, 1st Edition,
Eltayeb Ali Abdelrahman publications, 2009.
 Islam at the Crossroads by Muhammad Asad, 5th Edition, Jehangir Publications, 2001.
 The Vision of Islam by William C. Chittick, 1st Edition, IB Tauris and Co. Ltd., 2000.
Course Name: Calculus and Analytical Geometry (Math-301)

Credit Hours: 3 (3+0)

Prerequisites: None

Objectives: After completing this course the students will be able to understand the basic concept
of calculus with the application of derivatives and integrals in the field of computer science and
engineering.

Course Outline: Introduction to Number System, Solving Linear and Quadratic Inequalities and
Absolute Values, Equation of Straight Line, Slope, Intercepts, Parallel and Perpendicular Lines,
Circles and Parabolas, Functions and their Graphs, Domain and Range of Functions, Composite
Functions, Even and Odd Functions, Trigonometric Functions, Complex Numbers, De Moivre’s
Theorem and Its Applications, Limits and Rate of Change, Rules for Finding Limits, Limits at
Infinity, Limits from Graphs, Limits from Equations, Continuity of Functions, Finding the
Derivatives of the Functions, Tangent and Normal to a Curve, Geometry of Tangent, Derivative as
Slope of Tangent to the Curve and as a Rate of Change, Power Formula, Product Formula, Quotient
Formula, Derivatives of Trigonometric Functions, Implicit Differentiation, Chain Rule, Parametric
Equations, Equations of Tangent and Normal line, Linearization, The Roll’s Theorem, The Mean
Value Theorem, First Derivative Test for finding the Maxima and Minima, Points of Inflexion,
Second Derivative Test for finding the Maxima and Minima and Points of Inflexion, Increasing and
Decreasing Curves, Concavity of a Curve, Taylor Expansions, MacLaurin’s Expansions and their
Convergence, Indefinite Integration of Simple Algebraic Functions, Integration of Trigonometric
Functions, Integration by Substitution, Integration by Parts, Integration by Partial Fractions,
Definite Integration as Limit of a Sum, Area Under the Curve, The Disk Method, Area between two
Curves, The Washer Method, Volume and Surface of Revolution, Length of a Curve.

Reference Material:

 Thomas’ Calculus by George B. Thomas, 11th Edition, Addison Wesley Publications,

2012.
 Calculus and Analytical Geometry by Swokowski, Olinick and Pence, 6th Edition,
Brooks and Cole Publications, 1994.
 Calculus by Howard Anton, 7th Edition, John Wiley and Sons Publications, 2002.
Course Name: Introduction to Computing and Technology (CS-301)

Credit Hours: 4 (3+1)

Prerequisites: None

Objectives: To familiarize the students with the concept on which the computer works. To realize
other important elements of a computing environment i.e. Operating System, Programming
Languages. To make some foundation of algorithm usage.

Course Outline: Information Systems, Information Resources, Need for Information and
Processing, Digital and Analog Computers, Binary System and its Application, Internal Design of
Arithmetic and Logic Unit (ALU), Design of Micro Computer, Flynn Classification, Design of Parallel
Computers, Role and Function of Operating Systems, Operating System Concepts, Types of
Operating Systems, Programming Languages, Basic Paradigms for the Design of Programming
Languages, Lexical Units of a Programming Language, Compilation Process of a Programming
Language, Algorithms, Basic use of Algorithms, Algorithm Design Methodologies, Basic Sorting and
Searching Algorithms.

Reference Material:

 Peter Norton’s Introduction to Computers, 6th Edition, McGraw-Hill, 2014.

 Operating Systems Concepts by Peterson, 3rd Edition, Atlantic Publications, 2010.
 Digital Logic Design by Morris Mano, 3rd Edition, Prentice Hall Publications, 2012.
 Semester 2 (Course Outline)

Course Name: Pakistan Studies (PS-351)

Credit Hours: 2 (2+0)

Prerequisites: None

Objectives: To familiarize the students with the basic concepts of Pakistan Studies. To inculcate in
the minds of the student’s basic knowledge and spirit of Pakistan and its history.
Student will learn history and steps which led to a freedom of Indian Muslims, aims and objectives
of establishment of Pakistan, efforts and movements for independence, reforms and developments
undertaken to develop Pakistan as a Muslim state.

Course Outline: Historical Perspective of Ideology of Pakistan, Reformative Grand Educational

Movement in the Past (1857-1900), Dawn of 20th Century and Political Awakening among the
South Asian Muslims (1906-1916), Constitutional Struggle (1916-1940), Circumstances leading to
Independence (1940-47), Initial difficulties of Pakistan, Post-creation Environment, Islamization
Process, Important National Factors, Economy, Agriculture, Industry and Education, Geo-Politics of
Pakistan’s relation with Neighbors and the Muslim world.

Reference Material:

 The Great Partition: The Making of India and Pakistan by Yasmin Khan, 1st Edition, Yale
University Press, 2010.
 History of Pakistan by Khurshid K. Aziz, 3rd Edition, Doger Publications, 2004.
Course Name: Multivariable Calculus (Math-351)

Credit Hours: 3 (3+0)

Prerequisites: Calculus and Analytical Geometry (Math-301)

Objectives: After completing this course the students will be able to understand the theories and
techniques of differentiation and integration of functions having more than one variable, the
vectors in two and three dimensions, curves and surfaces, and motion in two and three dimensions.

Course Outline: Transcendental Functions, Logarithms, Differentiation and Integration,

Exponential Functions and their Applications, Derivative and Integration of Inverse Trigonometric
Functions, Quadratic Surfaces, Cylindrical and Spherical Coordinates, Indeterminate Forms and
L`Hôpital’s Rule, Differentiation and Integration of Vector-Valued Functions, Velocity and
Acceleration, Tangent Vectors and Normal Vectors, Arc Length and Curvature, Functions of Several
Variables, Limits and Continuity, Partial Derivatives, Chain Rule for Functions of Several Variables,
Directional Derivatives and Gradients, Tangent Planes and Normal Lines, Extreme value of
Functions of several Variables, Directional Derivatives and Gradients, Application of Extreme value
of Functions of several Variables, Lagrange Multipliers, Multiple Integration and Applications,
Double Integrals and Volume, Change of Variables, Polar Coordinates, Surface Area, Triple Integrals
and their Applications, Cylindrical and Spherical Coordinates, Vector Fields and Line Integrals,
Green’s Theorem Parametric Surfaces, Divergence Theorem and Stokes’ Theorem. Fourier
Transform, Laplace Transform, Z-Transform.

Reference Material:

 Calculus and Analytic Geometry by Thomas and Ross L. Finney, 12th Edition, Wesley
Publications, 2009.
 Calculus and Analytical Geometry by S.M. Yusuf, 3rd Edition, Ilmi Kitab Khana Publications,
2004.
Course Name: Object Oriented Programming (CS-351)

Credit Hours: 4 (3+1)

Prerequisites: Programming Fundamentals (CS-302)

Objectives: This course introduces essential Object-Oriented programming skills. Emphasis

will be given on analyzing, designing and developing solutions to real life problems using
Object Oriented techniques. C++ will remain as the basic tool to implement solutions.

Course Outline: Objects, Classes and Object Oriented Programming, Member Functions, Data
Members, Access Modifiers (Public, Private, Protected), Constructors, Default Values for
Functions, Inline Functions, Open Parameter List, References, Pointers to Objects and Dynamic
Memory Allocation, Copy Constructor, Destructors, Friend Functions, Function Overloading,
The This Pointer, Friend Classes, Static Class Members, Association, Simple Association,
Aggregation, Composition, C ++ Implementation of Association, Inheritance, Concept of
Generalization and Specialization, Constructing and Destructing of Objects with respect to
Inheritance, Effect of Access Modifiers in Inheritance, Multiple Inheritance, Pointing down the
hierarchy, Polymorphism, Abstract Classes, Virtual and Pure Virtual Methods, Basic Input
Output Using Streams, Dynamic Binding, Virtual Destructors, Operator Overloading,
Overloading Operators, Exception Handling, Generic Classes and Functions, Templates.

Reference Material:

 C++ Programming: For the Absolute Beginner by Dirk Henkemans, Course

Technology Publications, 2009.
 Object-Oriented Programming in C++ by Robert Lafore, 4th Edition, Sams
Publisher, 2001.
 Last Word on C++ by Vijay Mukhe, 2nd Edition, Vision Books Publication, 1994.
 C++ Programming Language by Bjarne Stroustrup, 3rd Edition, Addison-Wesley
Publication, 2000.
 C++ How to Program by Deitel and Deitel, 3rd Edition, Prentice Hall Publication, 2000.
Course Name: Communication Skills (Eng-351)

Credit Hours: 3 (3+0)

Prerequisites: Functional English (Eng-301)

Objectives: To develop and enhance student’s ability to communicate in English both in their
academic and professional years and increase awareness about communication process and
characteristics of effective communication. The aim is to provide practice in all the four skills of:
listening, speaking, reading and writing. The students will improve upon fluency and
pronunciation, and it will further help them to present and communicate effectively in dialogues,
speeches, meetings, interviews, telephone conversation and presentations.
Course Outline: Basic Principles of Communication, Communication as a Process, Communication
is Contextual, Communication Coordinates our Relationships, Communication is Culturally Linked,
Communication in Symbols, Characteristics of Effective Communication, Forms of Communication,
Internal and External Communication, Formal and Informal Communication, Verbal and Non-verbal
Communication, Communication Design Strategies: Mapping out Message Goals, Having Audience
Oriented Approach, Shaping Message Content, Selecting Channels, Acquiring Resources. Listening:
Active and Passive Listening, Listening Liabilities, External and Internal Noise, Message Noise,
Channel and Cultural Deficiencies. Speaking: Controlling the Barriers in Oral Communication,
Speech Goals and Organization, Articulation, Intonation, Pronunciation, Types of Speech Delivery,
Effective Presentations, Phoning, Meetings (Chairing and Attending), Informal Conversation or
Dialogue, Dealing with visitors or customers, Interviewing. Reading: Comprehension of the
Message, Word Knowledge Awareness, Response to the Text. Use of Sub-skills of Reading:
Skimming, Scanning, Anticipating and Predicting. Writing: Mechanics of Writing, Drafting and
Proofreading the written message, Communicating Internally and Externally, Letters, Memos, Short
Reports, Language Usage, Structural Awareness of Language.

Reference Material:

 Business Communication Today by Courtland L. Bovee and John V. Thill, 9th Edition,
Pearson Education, 2007.
 Business English by Vawdrey, Stoddard and Bell, 1st Edition, Richard D. Irwin Publications,
1992.
Course Name: Basic Electronics (Phy-351)

Credit Hours: 3 (2+1)

Prerequisites: None

Objectives: After completion of this course the students will be able to understand the basic
principles of electricity, magnetism and role of impedance and resistance in various circuits. This
course will help them analyze current when passing through a circuit and its correlation with
potential difference.

Course Outline: Review of Vectors, Electric Charge, Coulomb’s Law, Electric Field and Intensity,
Electric Potential, Capacitors and Charge Storage Concepts, Magnetism, Magnetic fields, Faraday’s
and Lenz’s Laws, Ampere’s Law and Its Applications, Eddy Currents, Inductance, Induced Current
and their Applications, Definitions of the Values of AC signals, Average and Root Mean Square (RMS)
Values, Electric and Magnetic Circuits, Electric Current, Resistance, Ohm’s Law, Series and Parallel
Circuits, Kirchhoff’s Laws, Network Theorems (DC Analysis), RC and RL Circuits, Fundamentals of
Semiconductor Physics, Band Theory, Intrinsic Semi-Conductors, Extrinsic Semi-Conductors, PN
Junction, PN Junctions as a Rectifier, Diodes, Transistors and Integrated Circuits, Characteristics and
types of Diodes and Transistors.

Reference Material:

 Basic Electronics by U.S. Bureau of Naval Personnel, 1st Edition, BN Publications, 2008.
 University Physics by Freedman and Young, 11th Edition, Addison Wesley Publications,
2003.
 College Physics by Resnick, Halliday and Krane, 6th Edition, John Wiley and Sons
Publications, 2004.
Course Name: Functional English (Eng-301)

Credit Hours: 3 (3+0)

Prerequisites: None

Objectives: This course introduces the writing process and stresses effective sentences. Emphasis
is on applying the conventions of written English as well as reflecting standard usage and
mechanics in structuring a variety of sentences and developing paragraphs within the essay. Upon
completion, students should be able to compose a variety of paragraphs, and a unified and
coherent essay.

Course Outline: Comprehension and Expression, Language skills i.e. Listening, Speaking, Reading
and Writing, Presentations and Vocabulary Building, Principles of Writing Good English,
Understanding the Composition Process, Making Notes, Writing Clearly, Word, Sentence and
Paragraph, Use of Grammar and Punctuation, Process of Writing, Observing, Audience Analysis,
Collecting, Composing, Drafting and Revising, Persuasive Writing, and Skills for taking Notes in
Class and Exams.

Reference Material:

 English Language and Composition by Barbara V. Swovelin, 3rd Edition, Cliffs Notes
Publications, 2012.
 General Certificate of English by Alan Etherton and Warriner, 4th Edition, Nelson
Thornes Publications, 2001.
 English Grammar and Composition by John E. Warriner, 1st Edition, Harcourt
School Publications, 1988.
 Semester 3 (Course Outline)

Course Name: Data Structures and Algorithms (CS-402)

Credit Hours: 4 (3+1)

Prerequisites: Object Oriented Programming (CS-351)

Objectives: The objective of the course is to introduce students to some of the basic data
structures, abstract data types (ADTs), and related algorithms so that they can develop efficient,
modular, and robust software in a cost-effective manner and study advanced data structures and
algorithms.

Course Outline: Data Types and Abstract Data Types (ADT), Introduction to Recursion, Algorithm
Analysis, Divide and Conquer Algorithms, Lists, Stacks, Queues, Trees, Binary Search Trees (BST),
Height-balanced BST, Adelson Velskii Landis (AVL)Trees, AVL Tree Rotations, B-Trees, Huffman
Coding, Hashing, Open Hashing, Closed Hashing, Rehashing, Extendible Hashing, Priority Queue,
Min and Max Heaps, Internal Sorting, Bubble Sort, Insertion Sort, Selection Sort, Merge Sort, Heap
Sort, Quick Sort, Graphs, Preliminaries and Representations, Topological Sorting, Network Flow
Problems, Spanning Trees. Breadth-first and depth-first traversal, topological order, Shortest-Path
Algorithms.

Reference Material:

 Data Structures and Algorithm Analysis in C++ by Mark Allen Weiss, 3rd Edition, Addison
Wesley Publications, 2006.
 Introduction to Data Structures and Algorithm with C++ by Glenn W. Rowe, 4th Edition,
Prentice Hall Publications, 2000.
 The C++ Programming Language by Bjarne Stroupstrup, 3rd Edition, Addison Wesley
Publications, 1988.
Course Name: Digital Logic and Design (CS-401)

Credit Hours: 3(2-1)

Prerequisites: Nil

Objectives: This course introduces the concept of digital logic, gates and the digital circuits.
Further, it focuses on the design and analysis of combinational and sequential circuits. It also serves
to familiarize the student with the logic design of basic computer hardware components.

Course Outline: Digital Computers and Information, Combinational Logic Circuits, Binary Logic and
Introduction to Logic Gates, Axioms of Boolean Algebra, Basic Theorems and Properties of Boolean
Algebra, Minimization of Boolean Functions using Basic Theorems, Don't Care States, Combinational
Logic Design, Combinational Circuits, Analysis Procedure, Design Procedure, Decoders, Encoders,
Multiplexers, Demultiplexer, Binary Multipliers, Sequential Circuits, Introduction to Sequential
Circuits, Introduction to Latches, Introduction to Flip Flops, Type of Flip Flops, Analysis of
Sequential Circuits, State Diagrams and State Tables, State Reduction Excitation Tables, Registers
and Counters, Synchronous/Asynchronous, Shift Registers, Serial Shift Registers, Loading Registers,
Parallel Registers, Memory and Programmable Logic Devices, Read-Only Memories, Programmable
Logic Array Devices, Random Access Memory(RAM).
Lab Assessments using tools such as Verilog HDL/VHDL, MultiSim.
Reference Material:

 Logic and Computer Design Fundamentals by Morris Mano and Charles R. Kime, 4th Edition,
Prentice Hall Publications, 2007.
 Digital Fundamentals by Thomas L. Floyd, 7th Edition, Prentice Hall Publications, 2000.
 Digital Design: Principles and Practices by John F. Wakerly, Prentice Hall Publications, 3rd
Edition, 2001.
 Contemporary Logic Design by Randy Katz, 1st Edition, Prentice Hall Publications, 1994.
Course Name: Probability and Statistics (CS-403)

Credit Hours: 3 (3+0)

Prerequisites: Nil.

Objectives: After studying this course the students should be able to identify the role of Statistics in
data collection, processing and interpretation which is used for decision making.

Course Outline: Concepts of Statistics, Basics of Data, Common Notations, Graphical

Representation of Data, Stem and Leaf plot, Graphical Methods for Data Presentation, Measures of
Location: Arithmetic Mean, Median, Mode, Trimmed Mean, Measures of Variability, Absolute and
Relative measures of Range, Standard Deviation and Variance, Moments of Frequency Distribution,
Counting Sample Points, Rule of Permutation, Combination and Multiplication, Probability, Sample
Space, Events, Operations of Events, Tree Diagram, Addition Rule of Probabilities, Multiplication
Rule of Probabilities, Independent and Dependent Events, Bayes’ Rule and its Applications, Discrete
Probability Distributions: Binomial Distribution, Negative Binomial Distribution, Geometric
Distribution, Poisson Distribution, Negative Exponential Distribution, Normal Distribution, Gamma
Distribution, Poisson Process, Continuous Probability Distribution, Normal Probability Distribution,
Exponential Distributed, Regression and Correlation.

Reference Material:

 Probability and Statistics for Engineers and Scientists by Walpole and Myers, 8th Edition,
Pearson Publications, 2006.
 Introduction to Theory of Statistics, Part I by Sher Muhammad Chaudhary, 2nd Edition, Ilmi
Kitab Khana, Lahore, 2004.
 Statistics by Spiegel and Stephens, 3rd Edition, McGraw-Hill Publications, 1998.
 Introduction to Statistics by Walpole, 3rd Edition, MacMillan Publishing Company, 2001.
Course Name: Discrete Structures (Math-401)

Credit Hours: 3 (3+0)

Prerequisites: Nil

Objectives: The main objective of this course is to enable the students to understand mathematical
structures useful for computing. After studying this course, the students should be able to
understand elements of logic and philosophy of reasoning behind computational structures, set
theory, graph theory, trees, automata and cryptology.

Course Outline: Proposition, Compound Proposition, Proofs in Mathematics, Truth Tables, Algebra
of Propositions, Logical Arguments, Theory of Inference for the Statement, Application, Digital Logic
Circuits, Predicate, Truth Set of Predicate, Quantifiers, Methods of Proving Theorems, Sets,
Operations on Sets, Proof of Set Identities by using Truth Table and by using Properties, Relations,
Reflexive, Symmetric and Transitive Relations, Representing Relation using Matrices, Equivalence
Relation, Equivalence Classes and Partition of Sets, Number Theory, The Division Algorithm,
Divisibility and the Euclidean Algorithm, Prime Numbers, Congruencies, Cryptology, Greatest
Common Divisor (GCD) in the Linear Combination, Linear Congruencies, Algorithm for Solving
Linear Congruencies, System of Linear Congruencies, Chinese Remainder Theorem, Algorithm for
Solving Linear Congruencies, Mathematical Induction, Recursively Defined Sequences, Solving
Recurrence Relations, the Inclusion-Exclusion Principle, Graph Theory: Simple Graphs, Multi
Graphs, Pseudo Graphs, Directed Graphs, Directed Multi-Graphs, Basic Terminology of Directed and
Undirected Graphs, The Hand Shaking Theorem, Bipartite Graphs, Representing Graphs by
Adjacency Matrices, Representing Graph by Incidence Matrices, Path, Connected Graph, Connected
Components of a Graph, Tree, N-ary Tree, Binary Tree, Rooted Tree, Theorems about Rooted Trees,
and various applications.
Reference Material:

 Discrete Mathematics and its Application by Kenneth H. Rosen, 6th Edition, McGraw-Hill
Publications, 2007.
 Discrete Mathematics with Application by Susanna S. Epp, 3rd Edition, Brooks Cole
Publications, 2004.
Course Name: Technical Writing (Eng-401)

Credit Hours: 3 (3+0)

Prerequisites: Functional English (Eng-301)

Objectives: Learn and practice different formats of technical and business writing i.e., letters,
memos, and reports using the given sample documents. Write correctly and according to the format
requirement in mock or real scenarios. Learn how to adopt audience, purpose, and content-based
approach while writing. Learn to organize the content in written form through various practice
exercises and editing and proof reading.

Course Outline: Technical Business Writing Forms, Letters, Letter parts, Letter formats, Full block,
Modified, Semi-block, Simplified form, Letter types, Every Day Letters, Persuasive Letters, Bad-
news Letters, Memos, Reports, Report Format, Contents of Report, Prefatory, Parts, Cover Title fly,
Title page, Letters of Authorization, Acceptance, Transmittal, Table of Contents, Illustrations,
Synopsis, Abstract, Executive Summary, Text Parts, Introduction, Body, Summary, Conclusions,
Recommendations, Supplementary Parts, Appendices, Bibliography, Index, Research, Research
Designs, Literature Survey, Data Analysis, Citation and References, Types of Report, Business
Proposal Reports, Project Reports, Progress Reports, Feasibility Reports, Curriculum Vitae, E-mails,
Brochures, Content Organization, Gathering Information, Organizing Paragraphs, Making Outlines,
Writing for Different Audience, Audience Analysis, Writing for Various Purposes, Adjusting Tone in
Writing, Discarding Wordiness and Pompous, Expressions, Considering “Seven Cs” while writing,
Analyzing Data, Language Practice, Correct use of Sentence Structure (Tenses, Parts of Speech),
Spellings, Punctuation, Plagiarism.

Reference Material:

 Business Communication Today by Courtland L. Bovee, John V. Thill and Mukesh

Chaturvedi, 9th Edition, Pearson Education, 2007.
 Research Methods Guidance for Postgraduates by Tony Greenfield, 1st Edition,
Hodder Arnold Publications, 1996.
 Effective Business Communications by Herta A. Murphy, Herbert W. Hildebrandt
and Jane P. Thomas, 7th Edition, McGraw-Hill Higher Education,1997.
 Semester 4 (Course Outline)

Course Name: Database Systems (CS-451)

Credit Hours: 4 (3+1)

Prerequisites: Nil

Objectives: The course aims to introduce basic database concepts, different data models, data
storage, retrieval and database design techniques. The course primarily aims to introduce the
concepts of relational data model and Database Management Systems (DBMS). This course includes
detailed discussion on various features of Databases such as Architecture, ER Model, Relational
Model, Normalization, Indexing and introduction to SQL and its practical use. It will also include
practical demonstration and use of a commercial database packages.

Course Outline: Introduction and Overview, Entity Relationship (ER) Model, Entity, Entity
Instance, Types of Entities, Strong versus Weak Entity, Super Types and Subtypes, Types of
Attributes, Simple and Composite Attributes, Stored and Derived Attributes, Multi-valued
Attributes, Mapping, Regular Entities, Weak Entities, Composite Attribute, Multi-valued Attribute,
Associative Entity, Resolving Multi-valued Attributes, Unary, Binary and Ternary-to-N relationships,
Cardinality constraints, One-to-One, One-to-Many, Many-to-Many, Enhanced Entity Relationship
Model(EER) Super type and Subtype Relationship, Relational Model Concepts, Constraints and
Algebra, ER and EER-to-Relational Mapping, Relational Algebra, Relational Operators and its forms,
Relational Operations, SQL, Data Definition Language(DDL), Data Manipulation Language(DML),
Functional Dependencies(FDs), Normalization, and Further Dependencies, Closure Set, Minimal
Cover, Equivalent Set, Steps in Normalization, Repeating Groups, Dependency, Functional
Dependencies, Partial Dependencies, Database Security and Authorization, Small Group Project
implementing a database.

Reference Material:

 Fundamentals of Database Systems by Ramez Elmasri, 6th Edition, Addison Wesley

Publications, 2009.
 An Introduction to Database Systems by Christopher J. Date, 7th Edition, Addison Wesley
Publications, 2007.
 Distributed Systems, Concepts and Design by George Coulouris, Dollimore and Kindberg, 4th
Edition, Addison Wesley Publications, 2005.
Course Name: Operating Systems (CS-452)

Credit Hours: 4 (3+1)

Prerequisites: Objected Oriented Programming (CS-351)

Objectives: To understand the internals of operating systems. Analyze various techniques used
for Memory Management, Disk Scheduling, Processor Scheduling, File Management, IO
Management and Security.

Course Outline: Introduction to Operating Systems, Operating Systems Concepts, Batch

Processing System, Multitasking and Time Sharing Systems, Multiprocessor Systems, Loosely
Coupled Systems, Tightly Coupled Systems, Real Time Systems, Computer System Structures, Input
Output Structure and Storage Hierarchy, Hardware Protection Operating System Structures,
System Calls and Services, Process Management, Process State Models, Threads and Processes,
User and Kernel Threads, Process Scheduling, Inter-process Communication, Process
Synchronization and Communication, Deadlocks, Deadlock Resolution, Classical Problems in
Concurrency, Memory Management, Contiguous Memory Management Techniques, Non-
Contiguous Memory Management Techniques, Virtual Memory Systems, Paging, Segmentation,
Paged-Segmentation, Placement policies, Fetch Policy, Page Replacement Policies, Global and Local
Scopes, Dynamic and Fixed Allocation, Directory and File structures, IO Systems, Directory
Structures, File Allocation Techniques, Free Space Management, Applications Input/output
Interface, Disk Management and Scheduling, IO methods, IO Controller to IO processor, DMA
(design and advantage), Buffering Techniques, Logical and Physical View of an IO Device, Disk
Scheduling, Disk Performance Improvement Measures, Protection and Security, Access Rights and
Access Control Lists, System Threats and Remedies, Cryptography. Swap Space management,
System protection, virtual machines, operating system security.

Reference Material:

 Operating Systems Design and Internals by William Stalling, 6th Edition, Prentice Hall
Publications, 2009.
 Operating System Concepts by Peterson, 3rd Edition, Atlantic Publications, 2002.
Course Name: Data Communication (CS-453)

Credit Hours: 3 (3+0)

Prerequisites: Introduction to Computing and Technology (CS-301)

Objectives: The Objective of the course is to understand the basic concepts of interfacing,
synchronization issues, digital communication methods, data transmission and signal encoding
techniques.

Course Outline: Introduction and overview, Data Communication, Networks, Protocols and
Standards, Standard Organizations, Basic Concepts of OSI Model, Line Configuration, Topologies,
Transmission Modes, Analog and Digital Signals, Simple and Complex Analog Signals, Time and
Frequency Domain, Frequency Spectrum and Bandwidth, Digital Signals, Attenuation and
Distortion Source, Limited Bandwidth, Delay, Noise, Encoding, Uni-polar, Bipolar, Analog to Digital
Conversion, Pulse Amplitude Modulation, Pulse Code Modulation, Digital to Analog, Amplitude Shift
Keying, Frequency Shift keying, Phase Shift Keying, Quadrature Amplitude Modulation, Analog to
Analog Encoding, Amplitude Modulation, Frequency Modulation, Phase Modulation, Parallel
Transmission, Serial Transmission, Asynchronous Transmission, Bit synchronization, Character
Synchronization, Frame Synchronization, Synch Transmission, Interface, DTE-DCE Interfaces,
Modems, Modem Operations and Transmission, Modem Standards, Transmission Media, Guided
Media, Twisted Pair, Optical Fiber, Coaxial, Unguided Media, Radio Frequency Spectrum, Terrestrial
Microwave, Satellite Communication, Cellular Telephony, Multiplexing, Frequency Division
Multiplexing, Flow Control, Stop and wait, Sliding Window, Error Control, Automatic Repeat
Request, Sliding window, Data Link Protocols.

Reference Material:

 Data Communications and Networking by Behrouz A. Forouzan, 3rd Edition, McGraw-Hill

Publications, 2007.
 Data and Computer Communications by William Stallings, 8th Edition, MacMillan
Publications, 2006.
Course Name: Linear Algebra & Differential Equations (Math-451)

Credit Hours: 3 (3+0)

Prerequisites: Calculus & Analytical Geometry (Math 301)

Objectives: An introduction to Linear Algebra course is designed to provide important

mathematical tools that will be useful in the field of computer science and engineering. At the end of
the course, the students will be able to understand and use the system of linear equations in many
variables, vector and vector spaces, theories of matrices, determinants, linear transformations,
Eigen Values and Eigen Vectors, Orthogonality and least squares, singular value decomposition and
optimization and be able to apply them in fields such as computer graphics and computer vision.
Course Outline: Basics of Matrices, System of Linear Equations, Echelon Form, Reduced Echelon
Form, Gaussian Elimination, Consistent Systems, Inconsistent Systems, Trivial and Non Trivial
Solutions of Homogeneous Systems, Matrix Algebra and Determinants, Cramer’s Rule, Vector
Spaces, Sub-Spaces, Linear Dependent and Independent, Basis and Dimensions, Eigen values, Eigen
Vectors and Eigen Spaces, Diagonalizable Matrices, Linear Transformation, Kernels and Range of
Linear Transformation, Orthogonality and Least Squares, Symmetric Matrices and Quadratic forms,
Singular Value Decomposition (SVD), Principal Component Analysis (PCA). Inner product space and
quadratic forms.

Reference Material:

 Algebra and Its Applications by Gilbert Strang, 4th Edition, Wellesley-Cambridge Publications,
2009.
 Linear Algebra and Its Applications by David C. Lay, 3rd Edition, Addison-Wesley
Publications, 2003.
 Introductory Linear Algebra with Applications by Bernard Kolman and David R. Hill, 9th
Edition, Prentice Hall Publications, 2007.
Course Name: Introduction to Software Development (CS-454)

Credit Hours: 3 (3+0)

Prerequisites: Objected Oriented Programming (CS-351)

Objectives: After studying this course the students should be able to understand various software
development models and phases of software development life cycle. The concepts of project
management, change control, process management, software development and testing are
introduced through hands-on team Projects. This course introduces students to the fundamental
methods and tools of Software Engineering.

Course Outline: Introduction to Software Engineering, Software Engineering Life Cycle and
Processes, Software Specification, Requirements Engineering, Writing a Good Software
Requirement Specification (SRS), System Modeling, Unified Modeling Language(UML), Use Case
Modeling, Use Case Elaboration, Software Prototyping, Software Design, Architectural Design,
Object-Oriented Design, Sequence Diagrams, Activity Diagrams, State Chart Diagrams, Component
Diagrams, Class Diagrams, Object Constraint Language (OCL), Deployment Diagrams, Function
Oriented Design, User Interface Design, Architectural Design, Coding Standards, Software Testing,
Black and White Box Test Cases, Test Plan, Project Management Concepts, Software Project
Planning, Risk Analysis, Project Scheduling and Tracking, Software Quality Assurance, Software
Metric, Line of Code (LOC), Function Point Analysis, Use Case Points, Software Configuration
Management.

Reference Material:

 Object-oriented and Classical Software Engineering by Schach and Stephen, 7th Edition,
McGraw-Hill Higher Education, 2006.
 Software Engineering: A Practitioner’s Approach by Roger S. Pressman, 5th Edition, McGraw-
Hill Publications, 2006.
 Semester 5 (Course Outline)

Course Name: Introduction to Networks CS-501

Credit Hours: 3 (2+1)

Prerequisites: CS-453

Objectives: This course will primarily focus on the Telecom, Data Communication and Computer
Networks and also covers other past and present network technologies. Emphasis will be given on
the understanding of modern network concepts.

Course Outline: Physical Layer and Media, Data and Signals, Analog and Digital Transmission,
Bandwidth Utilization, Transmission Media and Equipment, Noise, Interfacing, Data Encoding
Schemes, Asynchronous and Synchronous Transmission, Network Topologies, Applications of Data
Communications Networks, Open System Interconnection (OSI), Transmission Control Protocol
Internet Protocol (TCP/IP), Error Control, Flow Control, Data Link Protocols, High Data Level Link
Protocol (HDLC), Point-to-Point Protocol (PPP), Local Area Networks and MAC Layer Protocols,
Ethernet, Token Ring, Bridging, Multiplexing, Switched and IP Networks, Network Layer, Internet
Protocol, Logical Addressing, Inter-Networking, Delivering, Forwarding and Routing, Traffic
Control, Routing Algorithms, Routing in the Internet, Sub-netting, Super-netting, Transport Layer
Services, Connection-Oriented Transport Layer Protocols, Connectionless Transport Layer
Protocols, Principles of Reliable Data Transfer, Congestion Control, Application Layer Protocols,
Hyper Text Transfer Protocol (HTTP), File Transfer Protocol (FTP), Distributed Systems, Network
Security Issues, Introduction to Wireless and Mobile Networks, IEEE 802.11 networks.

Reference Material:

 Data and Computer Communications by William Stallings, 8th Edition, Prentice Hall
Publications, 2006.
 Introduction to Computer Networks by Andrew S. Tanenbaum, 4th Edition, Prentice Hall
Publications, 2003.
 Data Communications and Networking by Behrouz A. Forouzan, 3rd Edition, McGraw-Hill
Publications, 2003.

Course Name: Design and Analysis of Algorithms (CS-503)

Credit Hours: 3 (3+0)

Prerequisites: CS-402

Objectives: This course will enable the students to analyze and reason about different algorithms
and comparing different techniques for the designing. The students will be able to appreciate the
effectiveness of complexity theory after studying the course.

Course Outline: Algorithms as a technology, Importance of Algorithm Analysis, Mathematical

Foundation, Asymptotic Analysis, Efficiency of Algorithms, Best, Average and Worst Cases for a
Problem, Growth Functions, Asymptotic Notation, Recurrences, Solving Recurrences, The
Subsitution Method, The Iterative Method, The Master Method, Analysis of Sorting Algorithms,
Insertion Sort Analysis, Merge Sort and Quick Sort Analysis, Heap Sort, Linear Time Sorting
Algorithms, Count Sort, Radix Sort, Bucket Sort, Design and Analysis Techniques, Divide and
Conquer, Dynamic Programming, Greedy Algorithms, Greedy vs Dynamic Programming, Graph
Algorithms, Elementary Graph Theory, BST, DFS and BFS, Minimum Spanning Tree, Kruskal’s
Algorithm, Prim’s Algorithm, Single Source Shortest Path, Dijkstra’s Algorithm, String Matching
Algorithms, Complexity Theory, Introduction to complexity classes, NP Completeness.

Reference Material:

 Introduction to Algorithms by Thomas H. Corman, Charles E. Leiserson, Ronald L. Rivest

and Clifford Stein, 3rd Edition, MIT Press, 2009.
 Fundamentals of Algorithms by Gilles Brassard and Paul Bratley, 1st Edition, Prentice Hall
Publications, 1995.
Course Name: Automata Theory (CS-502)

Credit Hours: 3 (3+0)

Prerequisites: Math-401

Objectives: This course will introduce students to the concepts of automata theory and formal
languages which forms the foundations of theoretical computer science. At the end of this course
students will be able to construct finite state machines, pushdown automata and their equivalent
regular expressions and context free grammars respectively. Students will also learn about a variety
of issues in the mathematical development of computer science.

Course Outline: Introduction, Computation Theory, Mathematics Review, Regular Languages,

Regular Expressions, Finite Automata, Nondeterministic Finite Automata, Equivalence of DFAs and
NFAs, Closure Properties, Kleene’s Theorem, Non regular Languages, Pumping Lemma, Moore and
Mealy Machines, Context-Free Languages, Chomsky Normal Form, Pushdown Automata,
Deterministic and Non Deterministic PDA’s, Non-Context-Free Languages, Computability Theory,
Turing Machines, Variants of Turing Machines.

Reference Material:

 Elements of Automata Theory by Jacques Sakarovitch and Reuben Thomas, 1st Edition,
Cambridge University Press, 2009.
 Introduction to Computer Theory by Cohen, 2nd Edition, John Wiley and Sons Publications,
1996.
 Introduction to the Theory of Computation by Sipper, 2nd Edition, Thomson Course
Technology Publications, 1997.
Course Name: Advance Computer Programming (Java)

Credit Hours: 3 (2+1)

Prerequisites: Object Oriented Programming

Objectives:.

Course Outline:

Reference Material:

 .
Course Name: Web Application Development

Credit Hours: 3

Prerequisites: None

Objectives: After studying this course the students should be able to develop event driven windows
applications and client server programs for networking environment. It will present a detailed and
comprehensive look into JAVA and will provide the necessary tools to begin programming in the
JAVA language. This course will help the students in developing reusable objects for the real world
Internet applications. Extensive programming work will be required for the course.

Course Outline: Introduction and Overview, Setting up the JAVA Environment, Constructors,
Memory Management, Importing Packages, Classes, Sub classing and Language Syntax, Interfaces,
Arguments, System Properties, JAVA Application Programmer Interface (API), JAVA Documentation
(DOCS), Windows Programming, Forms and Abstract Window Toolkit (AWT), JAVA Swing Package,
Event handling, Multi-threading Support, Input Output Streams, Collection Classes, Vector, Hash
Table, HashMap, Optimization Techniques, Vectors vs Arrays, Compiler Optimization and
Performance, Advance Input Output, Serialized Issues, Writing Input Output Classes, Thread
Concepts, Thread Synchronization, Monitors, Deadlock, Producer Consumer Problem, Java Beans,
Version Control, JAVA database Connectivity (JDBC), Network Programming, Internet Addresses,
Transmission Control Protocol(TCP) and User Datagram Protocol(UDP) Sockets, Writing client and
Server applications, JAVA Security, JAVA Archives (JAR) utility, Creating JAR Files, JAVA Applets,
Applets vs Applications.

Reference Material:

 Secure Java: For Web Application Development by Abhay Bhargav and B. V. Kumar, CRC
Press, 2010.
 Java 2: Complete Reference by Herbert Schildt, 5th Edition, Osborne Press Publications,
2002.
 Java Network Programming by Elliote Rusty Harlod, 2nd Edition, O’Reilly Publications, 2001.
 Beginning Java 2 by Ivor Horton, 1st Edition, Peer Information, 1999.
 Semester 6 (Course Outline)

Course Name: Artificial Intelligence CS-552

Credit Hours: 3

Prerequisites: CS-503

Objectives: The course aims to introduce students the basic principles of Artificial Intelligence and
to make them understand the use of representational themes and search methods, it also familiarize
them with different techniques and strategies for complex problem solving.

Course Outline: Introduction to Artificial Intelligence, History, Goals, Approaches, Applications,

Knowledge Representation, Natural Language, Semantic Nets, Frames, First-Order Logic and
PROLOG, Propositional Calculus, Predicate Calculus, Basics of PROLOG (Creating and Quering
Knowledge base), Rule Based Expert Systems, Reasoning, Forward and Backward Chaining,
Managing Uncertainty, Problem Solving through Uninformed Search, Data and Goal Driven Search,
Depth First Search, Breadth First Search, Iterative deepening, Problem Solving through Informed
Search, Best First Search, Heuristic Functions and Properties, Heuristics in Games, State of the Art
Computational Techniques, Artificial Neural Networks, Genetic Algorithms, Agents, Robotics,
Present and Future of AI.

Reference Material:

 Artificial Intelligence: A Modern Approach by Russell and Norvig, 3 rd Edition, Prentice Hall
Publications, 2009.
 Artificial Intelligence Illuminated by Ben Coppin, 1st Edition, Jones and Bartlett Publications, 2004.
 Artificial Intelligence: Structures and Strategies for Complex Problem Solving by George F. Luger
and William, 6th Edition, Addison Wesley, 2008.
Course Name: Compiler Construction CS-551

Credit Hours: 3 (3+0)

Prerequisites: CS-502

Objectives: The objective of the course is to teach students techniques for solving problems
encountered universally in designing a language translator, regardless of source or target
machine. Further, the students will be trained to develop understanding of what compilers are
and how they work.

Course Outline: Introduction to Compiling, Front and Back Ends of a Compiler, Analysis of the
Source Program, The Phases of a Compiler, Passes of Compilers (One and two pass), Lexical
Analysis, Tasks of a Lexical Analyzer, Regular Grammars and Finite Automata, Lexical Analyzer
Implementation using tool, Minimization of DFA, Context Free Grammar, Derivations, Left-
Recursion, Left Factoring, Syntax Analysis, Tasks of a Parser, Top-Down Parsing, First and Follow
Sets, Parsing Table, LL parsers, Error Recovery, Bottom–Up Parsing, LR, SLR and LALR Parsers,
Parser Implementation, Semantic Analysis, Syntax-Directed Translation, Attribute Grammar,
Construction of Syntax Trees, Type Checking, Run-Time Environment, Storage Organization and
Allocation, Stack Frames and Activation Records, Intermediate Code Generation, Three Address
Code, Directed Acyclic Graphs, Generating Intermediate Codes for Declaration, Assignment,
Boolean Expressions, Flow-Control Statements, Procedure Calls, Back Patching, Instruction
Selection and Scheduling, Register Allocation for Target Code Generation, Basic Block, Code
Optimization Techniques, Constant Folding, Common Sub Expression Elimination, Target Code
Generation, Stack based Machines.

Reference Material:

 Crafting A Compiler by Charles N. Fischer, Ronald K. Cytron, and Richard J. LeBlanc, 1st
Edition, Addison Wesley Publications, 2009.
 Compilers Principles, Techniques and Tools by Alfred V. Aho, Ravi Sethi and Ullman, 2nd
Edition, Addison Wesley Publications, 2007.
 Modern Compiler Implementation in C by Andrew W. Appel, 2nd Edition, Cambridge
University Press Publications, 2004.
 Principles of Compiler Construction by Kenneth Louden, 2nd Edition, Course Technology
Publications, 1999.
Course Name: Assembly Language

Credit Hours: 3 (2+1)

Prerequisites: Computer Organization and Architecture

Objectives: To understand how device dependent programming can be performed. To understand

the programming model of Intel 8086 and above processors. To be able to develop low level
programs for an Intel based machine.

Course Outline: Comparison of Low Level and High Level Languages, Basic Organization of a
Conceptual Computer, Organization of an Intel based Micro Computer, Programming Model of Intel
8086 and above, Memory Organization, Intel Based Computers, Addressing Modes, Arithmetic and
Logical Instruction, Program Transfer Instructions and Stack Memory Addressing Instructions,
Conditional Program Transfer Instructions, Design of Control Structures using Conditional Jumps,
Procedures, Far and Near Call and Return Methods, Parameter Passing through Registers and Stack,
Interrupts, Invoking Software Interrupts, Programming Interrupts, Intercepting Interrupts,
Terminate and Stay Resident (TSR) programs, String Instructions, Miscellaneous Instructions, File
operations.

Reference Material:

 The Intel Processors by Barry B. Brey, 8th Edition, Prentice Hall Publications, 2008.
 Using Assembly Language by Allen L. Wyatt, 3rd Edition, QUE Publications, 1992.
 Semester 7 (Course Outline)

Course Name: Human Computer Interaction

Credit Hours: 3 (2+1)

Prerequisites: Nil

Objectives: The course provides an introduction to Human-Computer Interaction (HCI). HCI is

concerned with understanding, designing, implementing and evaluating user-interfaces so that they
better support users in carrying out their tasks. On completing the course you will have knowledge
of the theoretical foundations of designing for interaction between humans and computers. You will
also have practical experience in implementing and evaluating graphical user interfaces.

Course Outline: Background to Human-Computer Interaction, Underpinnings from Psychology and

Cognitive Science, Evaluation Techniques, Heuristic Evaluation, More Evaluation Techniques,
Videotaped User Testing, Cognitive Walkthroughs, Task Analysis, User-Centered Design, Usability
Engineering Processes, Conducting Experiments, Conceptual Models and Metaphors, Designing
Interfaces, Coding Techniques using Color, Fonts, Sound, Animation, Designing Interfaces, Screen
Layout, Response Time, Feedback, Error Messages, Designing Interfaces for Special Devices, Use of
Voice I/O, Designing Interfaces, Internationalization, Help Systems, User Interface Software
Architectures, Expressing Design Rationale for User Interface Design, Sample Labs and
Assignments, Evaluation of User Interfaces Using Heuristic Evaluation, Evaluation of User Interfaces
Using Videotaped Observation of Users, Paper Prototyping of User Interfaces, Discussing Design
Options to arrive at a Consensus Design.
Reference Material:

 Designing the User Interface: Strategies for Effective Human-Computer Interaction by Ben
th
Shneiderman, 5 Edition, Addison Wesley Publications, 2009.
 HCI Models: Theories and Frameworks towards a Multidisciplinary Science by John Carroll, 1st
Edition, Morgan Kaufmann Publications, 2003.
 Usability Engineering: Scenario-Based Development of Human Computer Interaction by Mary
Rosson, John Carroll and Mary Beth Rosson, 1st Edition, Morgan Kaufmann Publications, 2001.
Course Name: Fuzzy Logic

Credit Hours: 3 (3+0)

Prerequisites: None

Objectives: This course is an introduction to fuzzy logic and fuzzy set theory. Topics will include
the mathematical foundations of fuzzy sets, properties of fuzzy systems and fuzzy logic applied to
the design of intelligent systems and for intelligent control, adaptive fuzzy systems, etc.

Course Outline: Introduction, Fuzzy Logic, Mat LAB Overview, Classical Sets and Fuzzy Sets,
Classical Set, Operations on Classical Sets, Properties of Classical Sets, Mapping of Classical Sets to a
Function, Fuzzy Sets, Fuzzy Set Operations Properties of Fuzzy Sets, Classical and Fuzzy Relations,
Cartesian Product of Relation, Classical Relations, Cardinality of Crisp Relation, Operations on Crisp
Relation, Properties of Crisp Relations, Composition, Fuzzy Relations Cardinality of Fuzzy Relations,
Operations on Fuzzy Relations, Properties of Fuzzy Relations,

Fuzzy Cartesian Product, and Composition, Tolerance, and Equivalence Relations, Membership
Functions, Features of Membership Function, Classification of Fuzzy Sets, Fuzzification Membership
Value Assignments, Intuition, Inference, Rank Ordering, Angular Fuzzy Sets, Neural Networks,
Genetic Algorithm, Inductive Reasoning, Defuzzification, Lambda Cuts for Fuzzy Sets, Lambda Cuts
for Fuzzy Relations, Defuzzification Methods, Fuzzy Rule-Based System, Formation of Rules,
Decomposition of Rules, Aggregation of Fuzzy Rules, Properties of Set of Rules, Fuzzy Inference
System, Construction and Working of Inference System Fuzzy Inference Methods, Mamdani’s Fuzzy
Inference Method, Takagi–Sugeno Fuzzy Method (TS Method), Comparison Between Sugeno and
Mamdani Method, Advantages of Sugeno and Mamdani Method, Fuzzy Decision Making, Fuzzy
Ordering, Individual Decision, Multi-Person Decision Making, Multi-Objective Decision Making,
Fuzzy Bayesian Decision Method, Applications of Fuzzy Logic, Application of Fuzzy Expert System.

Reference Material:

 Introduction to Fuzzy Logic using MATLAB, S. N. Sivanandam, S. Sumathi and S. N. Deepa,

Springer-Verlag Berlin Heidelberg 2007
 A First Course in Fuzzy Logic by Hung T. Nouven and Elbert A. Walker, 3rd Edition,
Chapman and Hall Publications, 2005.
 An Introduction to Fuzzy Logic for Practical Applications by Kazuo Tanaka and Niimura, 1st
Edition, Springer Publications, 1996.
 Fuzzy Set Theory, Foundations and Applications by George J. Klir, Ute S. Clair and Bo Yuan,
1st Edition, Prentice Hall Publications, 1997.
Course Name: E-Commerce

Credit Hours: 3 (3+0)

Prerequisites: None

Objectives: To introduce the environment in which e-commerce, e-government and e-health take
place, the main technologies for supporting e-technologies, and how these technologies fit together.
The course provides students with an intensive survey of technologies used to support all aspects of
electronic business.
Course Outline: Introduction to E-Commerce, Elements of a Business Model, Business-to-
Consumer (B2C) Business Models, Business-to-Business (B2B) Business Models, Business Models in
other Emerging E-Commerce Areas, How the Internet and Web change Business, E-Commerce
Strategy, Structure, Process, E-Commerce Business Models and Concepts, The Internet and World
Wide Web, Building an E-commerce Website, E-Commerce Transaction, Security and Encryption,
Web Payment Systems, Web Marketing Concepts, Web Marketing Communications, Auctions,
Portals and Communities.

Reference Material:

 E-Commerce: Business, Technology and Society by Kenneth C. Laudon and Carol Traver, 4 th
Edition Addison Wesley Publications, 2007.
 Electronic Commerce: A Managerial Perspective by Efraim Turban, David King, Dennis Viehland
and Jae Lee, 1st Edition, Pearson Prentice Hall Publications, 2005.
 Technical Electives (Course Outlines)

Course Name: Visual Programming

Credit Hours: 3 (2+1)

Prerequisites: None

Objectives: In this course it will be emphasized: to introduce the message driven architecture of
windows operating system, to provide the students an introduction of class hierarchy of MFC
frameworks, to study various resources provided by windows operating system and to be able to
program quality applications for windows based systems.

Course Outline: The Windows Programming Model, More About Messages, Windows
Programming, SDK-Style, Introducing MFC, Benefits of Using C++ and MFC, MFC Design Philosophy,
Document/View Architecture, MFC Class Hierarchy, Afx Functions, MFC Applications, The
Application Object, How MFC Uses the Application Object, The Window Object, Message Map,
Drawing with the GDI, The MFC Device Context Classes, GDI Pens and the CPen Class, GDI Brushes
and the CBrush Class, Deleting Pens and Brushes, Seeing What You’ve Drawn, Adding a Scroll Bar to
a Window, Setting a Scroll Bar’s Range, Position, and Page Size, Processing Scroll Bar Messages,
Scrolling the Contents of a Window, Scrolling Text and Images, The CScrollView Class, Loose Ends,
Input Devices (Mouse and the Keyboard), Getting Input from the Mouse, Client-Area Mouse
Messages, Nonclient-Area Mouse Messages, Capturing the Mouse, Mouse Capturing in Action, The
Cursor, Mouse Miscellanea, Getting Input from the Keyboard, Keystroke Messages, Character
Messages, The Caret, The VisualKB Application, Handling the Caret, Entering and Editing Text,
Other Points of Interest, The MFC Control Classes, The CButton Class, The CListBox Class, The
CStatic Class, The Font View Application, The CEdit Class, The CComboBox Class, Adding a Keyboard
Interface, Modifying Control Behavior, Owner-Drawn List Boxes, Bitmap Buttons, Changing a
Control’s Color, Message Reflection.

Reference Material:

 Windows Internals by Alex Ionescu, David A. Solomon and Mark E. Russinovich, 5th Edition,
O’Reilly Publications, 2009.
 Programming Windows 98 by Charles Petzold, 5th Edition, Microsoft Press Publications,
1998.
 Programming Windows with MFC by Jeff Prosise, 2nd Edition, Microsoft Press Publications,
1999.
Course Name: Expert Systems

Credit Hours: 3

Prerequisites: Discrete Structures

Objectives Introduction of expert systems, Review of knowledge representation, Review of

inference techniques, Study of logic, rule-based expert systems, Review of course expert system
development software, Demonstration of a rule- based expert system, Workshop: Building a small
rule-based expert system, Advance expert system programming techniques, Review of typical
programming errors, Review of MYCIN, Overview of inexact reasoning, Study of inexact
classification, intelligent database management, intelligent distributed problem solving.:

Course Outline: Introduction of expert systems, Review of knowledge representation, Review of

inference techniques, Study of logic, rule-based expert systems, Review of course expert system
development software, Demonstration of a rule- based expert system, Workshop: Building a small
rule-based expert system, Advance expert system programming techniques, Review of typical
programming errors, Review of MYCIN, Overview of inexact reasoning, Study of inexact
classification, intelligent database management, intelligent distributed problem solving.

Reference Material:

1. Expert Systems: Principles and Programming, Joseph C. Giarratano, Gary D. Riley, 4 th Edition, Course
Technology, 2004, ISBN: 0534384471.

2. Jess in Action: Java Rule-Based Systems, Ernest Friedman-Hill, Manning Publications, July 2003, ISBN:
1930110898.
Course Name: Natural Language Processing

Credit Hours: 3

Prerequisites: Discrete Structures

Objectives:

Course Outline: Introduction and Overview, Ambiguity and uncertainty in language, Regular
Expressions. Chomsky hierarchy, regular languages, and their limitations. Finite-state automata.
Practical regular expressions for finding and counting language phenomena. A little morphology. In
class demonstrations of exploring a large corpus with regex tools, String Edit Distance and
Alignment, Key algorithmic tool: dynamic programming, first a simple example, then its use in
optimal alignment of sequences. String edit operations, edit distance, and examples of use in
spelling correction, and machine translation, Context Free Grammars, Constituency, CFG definition,
use and limitations. Chomsky Normal Form. Top-down parsing; bottom-up parsing, and the
problems with each. The desirability of combining evidence from both directions, Information
Theory, What is information? Measuring it in bits. The "noisy channel model." The "Shannon game"-
-motivated by language! Entropy, cross-entropy, information gain. Its application to some language
phenomena, Language modeling and Naive Bayes, Probabilistic language modeling and its
applications. Markov models. N-grams. Estimating the probability of a word, and smoothing.
Generative models of language. Their application to building an automatically-trained email spam
filter, and automatically determining the language, Part of Speech Tagging and Hidden Markov
Models, The concept of parts-of-speech, examples, usage. The Penn Treebank and Brown Corpus.
Probabilistic (weighted) finite state automata. Hidden Markov models (HMMs), definition and use,
Probabilistic Context Free Grammars, Weighted context free grammars, Maximum Entropy
Classifiers, The maximum entropy principle, and its relation to maximum likelihood. The need in
NLP to integrate many pieces of weak evidence. Maximum entropy classifiers and their application
to document classification, sentence segmentation.
Reference Material:

1. Daniel Jurafsky and James H. Martin. 2008. Speech and Language Processing: An Introduction to
Natural Language Processing, 43 Computational Linguistics and Speech Recognition. Second
Edition. Prentice Hall.

2. Foundations of Statistical Natural Language Processing, Manning and Schütze, MIT Press.
Cambridge, MA: May 1999
Course Name: Rapid Application Development

Credit Hours: 3

Prerequisites: None

Objectives: Applications of RAD approach to computer software design and development, life cycle
models, visual programming, using 4th generation software development tools. Conceptual model
design and detailed design through components. Reusability through component-based software
model.
Course Outline: Rapid Application Development (RAD) Process Model, RAD Principles, RAD in the
Software Development Process, RAD and Prototyping, Horizontal vs Vertical Prototyping, Rapid
Prototyping, The Visual Programming Paradigm, Windows Architecture, Class Hierarchy,
Component-Based Development, In Process and Out of Process Components, Objects, Events, Event
Handling, Object Reuse, Introduction to Commonly Used Visual Tools for Rapid Application
Development, Case Studies using Visual Tools.

Reference Material:

 Programming Windows Identity Foundation by Vittorio Bertocci, 1st Edition, Microsoft

Press, 2010.
 Programming for Windows using MFC by Jeff Proisise, 2nd Edition, Microsoft Press
Publications, 1999.
 Component-Based Software Engineering: Putting the Pieces Together by George T.
Heineman and William T. Councill, 1st Edition, Addison-Wesley Professional Publications,
2001.
 CORBA Programming by Jeremy L. Rosenberger, George T. Heineman and William T.
Councill, 1st Edition, O’Reilly Publications, 1998.
Course Name: Wireless Sensor Networks (BS Computer Science)

Credit Hours: 3

Prerequisites: Data Communication and Computer Networks

Objectives: This course deals with the comprehensive knowledge about wireless sensor networks
(WSNs). It provides an insight into different layers and their design considerations. A thorough
knowledge of infrastructure establishment and sensor network platform is provided. These networks are
also analyzed from various attacks perspective and numerous defense mechanisms are discussed for
these attacks in detail.

Course Outline: Introduction, Architecture, Applications, Medium Access Control Layer: Overview,
Design Challenges, MAC protocols, and Classification, Routing Layer: Overview, Design Challenges,
Proactive and Reactive Routing protocols, hierarchical routing protocols, Threshold-sensitive routing
protocols, Transport Layer: Overview, Design Challenges, pump slowly fetch quickly, Transport Protocols,
Application Layer: Overview, Design Challenges, Application Layer Protocols, Sensor Data Management,
O/S in WSN, Sensor localization, Time Synchronization: Overview, Clock Synchronization, Design of
Synchronization protocols and their challenges, Security and Privacy: Overview, Attacks classification
and defense mechanism.

Reference Material:

Title: Wireless Sensor Networks: Principles and Practice

Edition: 1st Edition

Authors: Fei Hu and Xiaojun Cao

Publisher: CRC Press

Year: 2010

ISBN-13: 978-1420092158

ISBN-10: 9781420092158
Course Name: Wireless Communication Systems (BS Computer Science)

Credit Hours: 3

Prerequisites: Data Communications and Computer Networks

Objectives: This course deals with the comprehensive knowledge about wireless communication
systems and designs. It provides an insight regarding the flow of data communications in a cellular
system. of different generations of Wireless Communications. A thorough knowledge of
infrastructure establishment and advanced wireless network platform is provided. Key
performance metrics are studied in detail.

Course Outline: Introduction and overview of wireless communications standards. Cellular

Network Design principles and core technologies, Cellular planning, Frequency Reuse, Practical
Deployments, Antenna Technology and Propagation for Wireless Communication systems, Small-
and large-scale Fading. Multipath Effects. Data Traffic Modelling. Frequency Division Multiple
Access, Time Division Multiple Access and Code Division Multiple Access terrestrial Scenarios,
Interference management in Cellular Communications. Different performance parameters Power
Spectral Density, Throughput Capacity, Capacity Density. Mobile Generations standards like GSM,
GPRS, EDGE, WCDMA, 3GPP-LTE for UMTS and LTE-Advanced standards. Bluetooth, WIFI and
WiMAX standards. Introduction to Monte Carlo Simulations, Markov Models and Analysis.

Reference Material:

1. Molisch, “Wireless Communications”, John Wiley & Sons, 2nd Edition (2011)
2. Saunders, “Antennas and Propagation for Wireless Communication Systems”, Wiley,
2nd Edition (2007).
3. Rappaport, “Wireless Communications: Principles and Practice”, Prentice Hall, 2nd
Edition (2001).
4. Agrawal, “Introduction to Wireless & Mobile Systems”, Cengage Learning,
International Edition (2011).
Course Name: Mobile Application Development

Credit Hours: 3

Prerequisites: None

Objectives: This course is an extensive overview of the latest in mobile Applications. Students will
learn how to develop interactive mobile Applications for a variety of mobile devices including cell
phones, PDAs and Pocket PCs. The course will be hands‐on and project‐based. Student will examine
the development models for both the Apple iPhone and Google Android.

Course Outline: Mobile Application Development Overview, Mobile Devices Profiles, Mobile
Software, Options for Development, Introduction to Software as a Service, Service‐Oriented
Computing Examples, Google Maps, Amazon Web Services, User Interface (UI), Development for
Mobile Apps, User Interface Frameworks, Gesture‐based Interfaces, The Eclipse Simulator, Google
Application Architecture, Event‐based Programming, Apple iPhone Platform, The UI Kit for
Interfaces, Event Handling and Graphics Services, Layer Animation, Mobile Commerce, Symbian:
Platform Architecture, Application Components, Development Methodology, Testing. Android:
Platform Architecture, Application Components, Development Methodology, Testing.

Reference Material:

 Mobile Design and Development: Practical Concepts and Techniques for Creating Mobile
Sites and Web Apps by Fling and Brian, 1st Edition, O'Reilly Publications, 2009.
 iPhone SDK by Jonathan Zdziarski, 1st Edition, O'Reilly Media Publication, 2009.
 Hello‐Android‐Introducing‐Development by Ed Burnett, 1st Edition, Pragmatic Bookshelf,
2008.
 The Symbian OS Architecture Sourcebook: Design and Evolution of a Mobile Phone OS
by Ben Morris, 1st Edition, Symbian Press, 2007.
Course Name: Web Engineering Credit Hours: 3 (2-1)

Credit Hours: 3

Prerequisites: Web application Development

Objectives: This course involves students in designing and writing web based software that can
communicate across a computer network. The aim is to write our own objects for the real world Internet
Applications using Java and distributed object technologies that can be accessed via network
transparently. Extensive programming work will be required for the course.

Course Outline: Web programming languages (e.g., HTML5, CSS 3, Java Script, PHP/JSP/ASP.Net),
Design principles of Web based applications, Web platform constraints, Software as a Service (SaaS),
Web standards, Responsive Web Design, Web Applications, Browser/Server Communication, Storage
Tier, Cookies and Sessions, Input Validation, Full stack state management, Web App Security - Browser
Isolation, Network Attacks, Session Attacks, Large scale applications, Performance of Web Applications,
Data Centers, Web Testing and Web Maintenance.

Reference Material:

1. Web Engineering, Rajiv Chopra, Prentice-Hall, 2016

2. Web Engineering, Emilia Mendes and Nile Mosley, Springer Verlag, 2010.

3. Web Engineering: A Practitioners’ Approach, Roger S. Pressman, McGraw Hill, 2008.

4. Dynamic HTML: The Definitive Reference: A Comprehensive Resource for XHTML, CSS, DOM,
JavaScript 3rd Edition, O'Reilly Media 2007.

5. JavaScript: The Definitive Guide, 8th Edition, David Flanagan. O'Reilly Media. 2014
Course Name: Web Fundamentals / Web Application Development

Credit Hours: 3

Prerequisites: None

Objectives: This course is aimed for IT professionals new to web designing. Computer science students
aiming to be web developers and to target excellent web designing job market, can also benefit from
this course.

Course Outline: HTML(Hypertext Markup Language), Internet, Web and HTML Fundamentals, What is
HTML, The World Wide Web and Web Servers, Working of Web Browsers, HTML‟s Role on the Web,
Way of launching the Web Site, Creating Static Web Pages with HTML, Creating a Web page and entering
Text, Changing and Customizations, Display Text in List, Adding Graphics into Web Pages, Hypertext and
Creating Links, Issuing Links with other HTML Tags, Advance HTML, Tables, Forms, Images, Frames,
Multimedia Objects, Java Script: Data types, Control Structures, Object & Function, Event Handling, VB
Script : Introduction, Data Types, Syntax, Controls, etc.

Reference Material:

Thomas A. Powell, HTML The Complete Reference, 2nd Edition, McGraw Hill, 1999.

Ann Navarro, Todd Stauffer, HTML by Example, 1st Edition, Que Corp, 1999.

Andrew Wooldrige, Mike Morgan, Mona Everett, Scott J. Walter, Special Edition Using Java Script, Que
Corp, 1997.
Course Name: Digital Image Processing

Credit Hours: 3 (2+1)

Prerequisites: Data Communication and Computer Networks

Objectives:

Course Outline:

Introduction: Elements of digital image processing, Image model, Sampling and quantization,
Relationships between pixels, Image Enhancement: Enhancement by point processing, Spatial filtering,
Enhancement in the frequency domain, Color Image Processing, image Segmentation: Discontinuity
detection, Edge linking and boundary detection, Thresholding, Region oriented segmentation, Use of
motion for segmentation, Image Registration: Introduction to image registration, Techniques of image
registration, Representation and Description: Boundary description, Regional description, Morphological
Image Processing: Dilation and Erosion, Opening and Closing, Some basic morphological algorithms,
Extensions to gray level images, Image Transforms: Discrete Fourier Transform, Discrete Cosine
Transform, Haar Transform, Hadamard Transform

Reference Material:

1. Digital Image Processing, R. C. Gonzalez & R. E. Woods, 3rd edition, Prentice Hall, 2008, ISBN
9780131687288.

2. Digital Image Processing (3rd Edition) by Rafael C. Gonzalez, Prentice Hall; 3rd edition (2007) 36

3. Understanding Digital Signal Processing (3rd Edition) by Richard G. Lyons, Prentice Hall; 3rd edition
(2010)
Course Name: Data Network Security

Credit Hours: 3 (3+0)

Prerequisites: None

Objectives: In this course it will be introduced the basic principles of cryptography and then will be
applied to describe network security protocols.

Course Outline: General Introduction, Network Security Overview, Common Security Threats,
Address Resolution Protocol (ARP), IP Address, Domain Name Server (DNS) Spoofing, Anonymity
and Anti-Anonymity, Virtual Private Networking, Network Address Translation and Tunneling,
Network Layer Security, Cryptography, Message Confidentiality and Symmetric Encryption, Message
Authentication, Authentication and Encryption Protocols, Internet Protocol Security (IPSEC),
Authentication Header (AH), Encapsulating Security Payload (ESP), Public-Key Cryptography, Key
Management and Use, Internet Key Exchange (IKE), Internet Security Association and Key
Management Protocol (ISAKMP), Network Management Security, Transport Layer Security, Secure
Socket Layer (SSL), Transport Layer Security (TLS), Application Layer Security, Authentication
Applications, Electronic Mail Security, System Security, Intruders and Intrusion Detection, Malicious
Software, Firewalls and Trusted System, Operating System Security.

Reference Material:

 Computer Security: Principles and Practice by William Stallings and Lawrie Brown, 1st Edition,
Prentice Hall Publications, 2007.
 Data and Computer Communications by William Stallings, 8th Edition, MacMillan Publications,
2006.
 Cryptography and Network Security by William Stallings, 3rd Edition, Prentice Hall Publications,
2004.
 A Step by Step Guide to Computer Attacks and Effective Defences by Ed Skoudis, Counter Hack, 1 st
Edition, Prentice Hall Publications, 2002.
Course name: Formal Specification of Software

Credit Hours: 3(3+0)

Prerequisites: None

Objectives: Formal specification is considered as an increasingly important activity within the software
development process that has direct impact on the quality, maintenance, economic and success of a
developed system. In this context, formal specification allows us to verify and reason about the properties
of the software before proceeding with the design and implementation. The purpose of this course is to
train students in the art and science for specifying properties of programs and proving their correctness.
The primary emphasis will be on theoretical aspects of specification, formalisms, deductive and
algorithms’ verification.

Course Outline: Review of Mathematical Fundamental, Relations, Functions, Logical Expressions, First
Order Logic, Quantifiers, Sequences, Undirected and Directed graphs, Requirement Analysis, Systems
Specification, Model-based Approaches, Event-based Approaches, Algebraic Specification, Properties of
Systems, Structural Properties, Behavioral Properties, Creation of Systems State, Change of State,
Modeling of System Operation, State-based Verification of Systems, Invariant-based Verification of
Systems, Structural and Dynamic Analysis of Systems.

Reference Material:

 Formal Methods: State of the Art and New Direction by Paul Boca, Jonathan P. Bowen and Jawed
Siddiqi, 1st Edition, Springer Publications, 2009.
 Petri nets: An Introduction, by Wolfgang Reisig, 1st Edition, Springer-Verlag, 1985.
 Using Z: Specification, Requirement and Proof by Jim Woodcock and Jim Davies, 1st Edition,
Prentice-Hall, 1996.
Course Name: Game Modeling

Credit Hours: 3

Prerequisites: None

Objectives: After studying this course the students should be able to model and develop games
using latest game development technologies. It will help them model games related to science,
technology, engineering, and mathematics. The course culminates with the completion of your very
own interactive game on your chosen platform.

Course Outline: Introduction and Overview, Design Fundamentals, Math Review, Sketching basics,
2D Game Basics and User Interactions, Audio and More 2D Games, Deploying Games on Xbox 360
and Windows Plateform, 3D Computer Graphics Basics, 2D and 3D Content Generation, Modeling
Human and Animal Charecters, Modeling Aliens, Modeling Vehicles, UV Mapping, Color Maps for 3D
Models, Effects and HLSL Shaders, Content Pipeline, Sjeletal Animation and Third Person Shooter
Game, Physics and Artificial Intelligence, Games for Education,Student Game Demonstrations and
Presentations.

Reference Material:

 Game Programming: From Novice to Professional by Lobao and Evangelista, 1st Edition,
Apress Publications, 2009.
 Game Modeling using Low Polygon Techniques by Chad Walker and Eric Walker, 1st Edition,
Charles River Media Publications, 2001.
 Pro C# 2008 and the .NET 3.5 Platform by Troelsen, 4th Edition, Apress Berkeley
Publications, 2007.
Course Name: Software Engineering- II

Credit Hours: 3 (3+0)

Prerequisites: None

Objectives: After studying this course the students should be able to propose, refine and criticize
engineering process models and standards This course also covers techniques for specification,
design process, object-oriented design, quality metrics, configuration management, software reuse,
verification and validation techniques, documentation techniques and their standards.

Course Outline: Requirement Engineering, Functional and Non-Functional Requirements,

Documents and Procedures for Gathering Requirements, Use Case Model, Functional Specifications,
IEEE 830 recommended practice for software requirements specifications, IEEE 1074 Standard For
Developing Software Life Cycle Processes, Software Architecture, Components of Software
Architecture, Architecture Diagrams, Deployment Diagrams, Software Design, Design Patterns,
Creational Patterns: Factory, Abstract factory, Singleton, Builder, Prototype, Structural Patterns:
Adaptor, Façade, Bridge, Composite, Proxy, Decorator, Flyweight, Behavioral Patterns: Iterators,
Observer, Strategy, Command, Memento, Mediator, Anti-Patterns, Refactoring Techniques, Software
Verification and Validation Techniques, Software Correctness, Formal Methods, Efficiency,
Performance and Reliability, Attitude of Industry towards Reliability and Performance, Software
Quality, Software Metrics, Function Point Analysis(FPA), Cost Constructive Model(COCOMO), Use
Case base Estimation, Quality Assurance and Quality Control, Capability Maturity Model(CMM),
Capability Maturity Model Integration(CMMI), ISO Software Quality Standards, Project Management
Concepts, Software Project Planning, Risk Analysis, Project Scheduling and Tracking, Project
Evaluation and Review Techniques(PERT), Critical Path Method (CPM), Software Quality Assurance,
Inspections and Walkthrough.

Reference Material:

 Software Engineering: A Practitioner’s Approach by Roger S. Pressman, 7th Edition, McGraw-

Hill Publications, 2009.
 Object-oriented And Classical Software Engineering by Schach and Stephen, 7th Edition,
Irwin Publications, 2006.
 Refactoring: Improving the Design of Existing Code by Fowler, 1st Edition, Addison-Wesley,
1999.
 Object-Oriented Modeling and Design with UML by James Rambaugh, 2nd Edition, Prentice
Hall Publications, 2004.
 Design Patterns: Elements of Reusable Object-Oriented Software by Erich Gamma, Richard
Helm, Ralph Johnson and John Vlissides, 1st Edition, Prentice Hall Publications, 1994.
Course Name: Distributed Database Systems

Credit Hours: 3 (3+0)

Prerequisites: None

Objectives: After Completing this course the students will be able to describe the difference of
Centralized database and Distributed database. This course will help the students to design and
implement distributed database for robust applications.

Course Outline: Introduction and Overview, Relational Model, Distributed Database Management
System (DBMS) Architecture, Distributed Database Design and Data Distribution Strategies,
Fragmentation, Distributed Transaction Management, Atomic consistent Isolated Durable (ACID)
properties, Distributed Concurrency Control, Two Phase Commit Protocol (2PL), Distributed
Database Recovery, Distributed Query Processing, Distributed Data Security, Replication, Update
Protocols, Naming Transparency, Migration Transparency, Failure Transparency, Performance
Issues.

Reference Material:

 Distributed Database Management Systems: A Practical Approach by Saeed K. Rahimi and

Frank S. Haug, 1st Edition, Wiley-IEEE Computer Society Publisher, 2010.
 Principles of Distributed Database Systems by Ozsu Tamer, 1st Edition, Prentice Hall
Publications, 1999.
 Distributed Databases: Principles and System by Ceri and Pelagatti, 1st Edition, McGraw-Hill
Publications, 1984.
Course Name: Programming Gaming Engines

Credit Hours: 3

Prerequisites: None

Objectives: This course provides students with an in-depth exploration of 3D game engine
architecture. Students will learn state-of-the-art software architecture principles in the context of
game engine design, investigate the subsystems typically found in a real production game engine,
survey some engine architectures from actual shipping games, and explore how the differences
between game genres can affect engine design. Students will participate in individual hands-on lab
exercises, and also work together like a real game development team to design and build their own
functional game engine by designing and implementing engine subsystems and integrating 3 rd party
components.

Course Outline: Introduction to Game Engine, Engine differences between game genres, Survey of
runtime engine subsystems, Survey of tools and the asset pipeline, Version control and Subversion:
Microsoft Visual Studio tips and tricks, Profiling tools, Memory leak, Corruption detection. 3D Math
for Games: Vectors, Matrices, Quaternion, Spheres, Lines, Line segments and rays, Planes, Splines.
The Graphics Pipeline: Triangle meshes, Materials, Texturing, Transformation, Lighting basics,
Pipelining concepts, The rendering pipeline. Rendering Engine Architecture: the driver of rendering
engine architecture, Primitive submission and render state management, Sorting, alpha blending
and Z pre-pass, Visibility determination and scene graphs. Visual effects: Particles, overlays, decals,
post pro-Graphical tools for debugging and development. Engine Subsystem Integration: The game
loop, Time in games, Updating a multi-object simulation in real time, Integrating rendering, Physics
and animation into the game loop, Multiprocessor game loops.

Reference Material:

 Game Engine Architecture by Jason Gregory and Jeff Lander, 1st Edition, A K Peters
Publishers, 2009.
 3D Game Engine Design: A Practical Approach to Real-Time Computer Graphics by David H.
Eberly, 2nd Edition, Morgan Kaufmann Publishers, 2006.
Course Name: Web Engineering

Credit Hours: 3

Prerequisites: None

Objectives: This course involves students in designing and writing web based software that can
communicate across a computer network. The aim is to write our own objects for the real world
Internet Applications using Java and distributed object technologies that can be accessed via
network transparently. Extensive programming work will be required for the course.

Course Outline: Basic Network Concepts, Transmission Control Protocol/Internet Protocol

(TCP/IP), User Datagram Protocol (UDP), Client Server Model, Web Concepts, Uniform Resource
Link (URL), Hyper Text Markup Language (HTML), Hypertext Transfer Protocol (HTTP), Multi-
Purpose Internet Mail Extensions (MIMIE), Applets and Security, Processing Internet Addresses
(DNS, InetAddress Class), Sockets for Clients, Socket Class, Socket Exceptions, Sockets for Servers,
Remote Method Invocation, RMI Client and Server, Java Servlets, Servlets Architecture, Objects,
Request and Response, Sessions, DataBase Connectivity, Jdbc-Odbc bridge, Connection, Statement,
Prepared Statement, Java Server Pages, Architecture, Container, Java Beans, Objects, Session
Tracking, Cookies, Security, Input Output (IO), Login Management, JavaScript, Instruction Set,
Events, Objects, Java Mail, Simple Mail Transfer Protocol (SMTP), Post Office Protocol (POP3), Mail
Server, Java Mail API, XML, Rules, Document Type Definition (DTD), Internal and External DTD,
Entities, XML parsing, SAX, DOM, Enterprise Java Beans, J2EE Architecture, State full and Stateless
Session Beans, Entity Bean, Transaction Management, CORBA Architecture, IDL, Common Object
Request Broker Object (CORBA) Client and Server, WAP Technologies, Simple Object Access
Protocol (SOAP), Web Services Architecture and Design.

Reference Material:

 Web Engineering: A Practioner's Approach by Roger S. Pressman and David Lowe, McGraw-
Hill Publications, 2008.
 Beginning JavaServer Pages by Vivek Chopra, Jon Eaves, Rupert Jones, Sing Li and John T.
Bell, 1st Edition, Wrox Publications, 2005.
 Java Network Programming By Elliote Rusty Harlod, 3rd Edition, O’Reilly Publications, 2004.
 Enterprise Java Beans by Paul Tremlet, 1st Edition, Wrox Publications, 2000.
 Java Servlet Programming by Hunter and Crawford, 2nd Edition, O’Reilly Publications, 2001.
 CORBA Programming by Jeremy L. Rosenberger, 1st Edition, O’Reilly Publications, 1998.
Course Name: Principles of Programming Languages

Credit Hours: 3

Prerequisites: None

Objectives: The purpose of this course is to provide a broad vision of Programming Language
design and implementation. The student will develop knowledge on different aspects of the
programming languages which will allow them to perform their critical evaluation and constructs.

Course Outline: Reason for studying Languages, Programming Domains, Language Evaluation
Criteria, Language Evaluation Criteria, Language Design, Language Trade Offs, Language Syntax,
Attributed Grammar, Dynamics Semantics, Naming Conventions, Variables, Binding Concept, Type
Checking, Scope, Scope and Life Time, Reference Environment, Named Constant, Variable
Initialization, Primitive Data Types, Character String Type, User Defined Ordinal Types, Array
Types, Associative Array, Record Type, Union Type, Set Type, Pointer, Arithmetic Expressions,
Operator Overloading, Type Conversion, Compound Statements, Selection Statements, Iterative
Statements, Unconditional Branching, Subprogram, Design Issues of Subprogram, Parameter
Passing Methods, Parameters that are Subprogram Names, Overloaded Subprograms, Generic
Subprogram, Separate and Independent Compilation, Design Issues of Functions, Abstractions, Data
Types, Encapsulation, Exceptional Handling.

Reference Material:

 Concept of Programming Languages by Sebesta and Robert, 9th Edition, Addison-Wesley

Publications, 2009.
 Programming Languages: Principles and Paradigms by Allen B. Tucker,2nd Edition, McGraw-
Hill Publications, 2007.
 Programming Languages: Design and Implementation by Terrence W. Pratt and Marvin V.
Zelkowitz, 4th Edition, Prentice Hall Publications, 2000.
 Advanced Programming Language Design by Raphael Finkel, 1st Edition, Addison-Wesley
Publications, 1995.
Course Name: Computer Graphics

Credit Hours: 3

Prerequisites: None

Objectives: To learn the tools and techniques used to draw and render complex images on a
computer using basic objects as building blocks. Transformation of objects in 2D and 3D. To
understand the basic mathematics involved. Understand the geometry of an image and be able to
process image using some computational mechanism.

Course Outline: Graphics Hardware, Display Processors, Graphics Pipeline, Primitives, Point, Line,
Polygon, Segment-Intersection Algorithm, Polygon-Point, Inside Outside Algorithm, Parity Testing
Approach, Checking for Side with All Line segments, Vectors, Operations (Addition, Scalar
Multiplication, Subtraction), Dot and Cross Product (Visualization and Properties), 2D
Transformations, Rotation, Scaling, Reflection, Translation, Scan Converting Lines, Simple Scheme
and its Problems, Incremental Variation, Midpoint Algorithm for Lines, Incremental Midpoint
Algorithm, Scan Converting Circles, Eight Way Symmetry, Expensive Implicit and Polar Algorithm,
Midpoint Algorithm, Using Incremental Technique to get rid of Multiplications, Scan Converting
Ellipses, Additional Issues, Special Cases in which Order is Not Important, 2D Rotation about an
Arbitrary Point, 3D Transformations, Scaling, Translation, Rotations Around Principle Axes in Right-
Handed Coordinate System, About z-axis, About x-axis, About y-axis, Rotation about Arbitrary Axis,
Aligned with Principle Axes (3 steps), Not-Aligned with Principle Axes (5 steps), Rotation through
use of orthonormal property, Transforming Normal Vectors, Coordinate Transformation, Quadratic
Bezier Curves, Subdivision, Derivation, Control Points, Using Colors on Computer Screen, Image
Representation, Fourier Transformation, Image Manipulation, Filtering, Image Processing,
Geometric Transformation of Images, Multipass Transformation, Image Composition.

Reference Material:

 Fundamentals of Computer Graphics by Peter Shirley, 3rd Edition, AK Peters Publications,

2009.
 Computer Graphics: Principles and Practice by Foley, Van Dam, Feiner and Hughes, 2 nd
Edition, Addison-Wesley Publications, 1990.
Course Name: Artificial Neural Networks

Credit Hours: 3

Prerequisites: None

Objectives: It will be focused to introduce students the theory and practice of artificial neural
networks and to train them to design and implement complex neural network systems for different
problems of practical nature.

Course Outline: Introduction to Artificial Neural Networks, Human Brain, Artificial Neuron,
History of Artificial Neural Networks, AI and Neural networks, Learning, Supervised and
Unsupervised Learning, Error Correction Learning, Memory Based Learning, Hebbian Learning,
Competitive Learning, Single Layer Perceptron, Classfication, Perceptron, Perceptron Convergence
Theorem, Linear Separability, Credit Assignment Problem, Multilayer Perceptrons, Introdution of
MLP and its Chracterisitcs, Back Propagation Algorithm, Heuristics for improving Back Propagation,
Principal Components Analysis, Importance of PCA, Difference between Data and Feature Vectors,
Algoirthm for PCA, Vector Quantization, Adaptive Resonance Theory, Basic Architecture, Stability-
Plasticity Dilemma, ART Algorithm, Associative Memories, Linear Associative Memory.

Reference Material:

 Neural Networks and Learning Machines by Simon Haykin, 3rd Edition, Prentice Hall, 2008.
 Neural Networks: A Comprehensive Foundation by Simon Haykins, 2nd Edition, Prentice
Hall Publications, 1999.
 Fundamentals of Neural Networks by Laurence Fausett, 1st Edition, Prentice Hall
Publications, 1993.
Course Name: System Programming

Credit Hours: 3

Prerequisites: None

Objectives: To enable students to program various I/O devices and write device drivers for those
devices. To understand the internals of Operating Systems in terms of data structures used for
Memory Management and File Management and to be able to access and exploit these data
structures for developing system software.

Course Outline: Introduction to System Programming, I/O Modes, Programmed I/O,

Handshaking/Polling, Interrupt Driven I/O, Interrupts, Hardware and Software Interrupts, Invoking
Interrupts, Invoking interrupts from Windows Application, Intercepting Interrupts and TSR
Programs, Intercepting Hardware Interrupts, Writing Interrupt Services for Certain Hardware, DMA
(Direct Memory Access), Use of DMA, DMA interfacing, DMA internals, Programming the DMA,
Programmable Devices, Interval Timer, Interval Timer Modes, Programming the Interval Timer,
Programmable Peripheral Interface (PPI), Principles of Parallel Communication, PPI Internals and
Modes, Programming the PPI, Using the PPI for Printer Interface, Using the PPI for Computer to
Computer Communication, Universal Asynchronous Receiver Transmitter (UART), Principles of
Serial Communication, UART Internals, Programming the UART, Using UART for Computer to
Computer Communication, Operating System Internals, Memory Management, Real Mode, Memory
Control Block (MCB), Arena Header, Memory Allocation, Traversing through Processes Memory,
Protected Mode, Interrupts Descriptor Tables, Address Translation, Shifting from Real to Protected
Mode, Exception Handling in Protected Mode, File Management, Disk Structure, Disk Formatting
Process on Sectors and Clusters, File Allocation Table (FAT), FAT16 and FAT32, Drive Parameter
Block, Disassembling the Directory and File structure, Accessing and Manipulating the File
Structure, Sector/Partition Table Viruses, Anatomy of Executable File Viruses, Detection of Viruses,
Sign of Viruses, Selecting the Signature of Viruses, Removal of Viruses, Prevention from Viruses.

Reference Material:

 System Programming with C and Unix by Adam Hoover, 1st Edition, Addison Wesley, 2009.
 PC Intern: The Encyclopaedia of System Programming‎ by Micheal Tischer, 6th Edition,
Abacus Software, 1996.
 C Odyssey: Advanced DOS by Vijay Mukhi, 2nd Edition, BPB Publications, 1992.
 Undocumented DOS by Andrew Schulman, 2nd Edition, Addison-Wesley Publications, 1993.
Course Name: Technical Game Design

Credit Hours: 3

Prerequisites: None

Objectives: This course focuses on the technical aspect of game development. Students will learn
state-of-the-art architecture principles in context of game design and development, including the
integration of essential Artificial Intelligence (AI) and animation techniques and various other
mechanics of game development.

Course Outline: Progressive Meshes, Scene Hierarchies, Key frame Animation, Indexed and Non-
Indexed Vertex Blending, Software and Hardware Skinning Techniques, Skeletal Animation, Tree
Animation and Rendering, X Files, Motion Blending, Collision Detection and Response, Quadtrees,
Octrees, and kD-Trees, Binary Space Partitioning (BSP) Trees and Potential Visibility Sets (PVS).
Artificial Intelligence for Game Developers: Decision Making, Grid Traversal and Search Algorithms,
Pathfinding with A*, Flocking Behaviors, Finite State Machines, Artificial Intelligence (AI) Engine
Integration. Physics for Game Developers: The Principles of Newtonian Physics, Simulating Gravity,
Simulating Friction, Modeling Acceleration and Velocity, Trajectories, Kinematics and Motion
Control, Collision Detection and Response, Animation Technique, Procedural animation,
Compression techniques, Animation system architecture and pipeline, Interfaces between game
characters and animation, Animation state machines and layering, Collision detection basics, Fast-
moving bodies and the bullet-through-paper problem, The Gilbert-Johnson-Keerthi (GJK) algorithm,
The prune and sweep algorithm, Ray and sphere casting, Angular dynamics, Collision response,
Constraints and ragdolls, Typical collision system architectures. Components of the gameplay
foundation layer, Runtime object model architectures, Memory management and file I/O for level
loading, Streaming game worlds, Memory management for dynamic objects, Multiplayer
networking, Advanced lighting and rendering effects, Terrain systems, Advanced audio, Player
mechanics and game cameras.

Reference Material:

 Microsoft XNA Game Studio Creator's Guide by Stephen Cawood and Pat McGee, 1st Edition,
McGraw-Hill Osborne Media, 2007.
 Simulation and Event Modeling for Game Developers by John P Flynt and Benjamin Vinson,
1st Edition, Course Technology Publications, 2005.
 3D Game Programming: All in One by Kenneth C. Finney, 2nd Edition, Course Technology
Publications, 2006.
Course Name: Multimedia Arts

Credit Hours: 3

Prerequisites: None

Objectives: This course is designed to describe the media and supporting devices commonly
associated with multimedia information and systems. It will explain basic multimedia presentation
concepts and demonstrate the use of content-based information analysis in a multimedia
information system. It will critically analyze multimedia presentations in terms of their appropriate
use of audio, video, graphics, color and other information presentation concepts. Students will learn
the implementation of a multimedia application using a commercial authoring system.
Course Outline: Introduction and Overview, Multimedia basics, Working with Graphics, Text in
Multimedia Design, Applications, Animations, Media Editors, Authoring Systems, Streams
Structures, Capture, Represent, Transform, Spaces, Domains, Compression and Coding, Content-
based Analysis, Indexing and Retrieval of Audio, Images and Video, Presentation, Rendering,
Synchronization, Multi-modal Integration Interfaces, Real-time Delivery, Quality of Service, Audio
Video Conferencing, Video-On-Demand, Publishing Flash Document.

Reference Material:

 Engineering Design of Multimedia Software by David Bernstein, 1st Edition, John Wiley and
Sons, 2010.
 Multimedia Design and Production for Students and Teachers by Counts, 1st Edition, Allyn
and Bacon, 2003.
 Multimedia Projects in the Classroom: A Guide to Development and Evaluation by Green and
Brown, 1st Edition, Corwin, 2002.
 Macromedia Flash MX 2004 for Windows and Macintosh: Visual Quick Start Guide by Ulrich,
1st Edition, Peachpit Press, 2003.
 PowerPoint 2003 Bible by Wempen, 1st Edition, John Wiley and Sons, 2003.
Course Name: Game Algorithms

Credit Hours: 3

Prerequisites: None

Objectives: After studying this course the students should be able to solve algorithmic problems
present in computer games. They will learn common solution methods, analyze their usability, and
describe possible improvements. It will further help them to understand the concepts of random
numbers, game trees, path finding, terrain generation, and decision-making for synthetic players.
Course Outline: Introduction and Overview, Model-View-Controller, Synthetic players Games and
story-telling. Game design considerations, Random numbers. Linear congruential method. Analysis
and testing, Shuffling. Game world creation, Terrain generation, Rank adjustment tournaments.
Elimination tournaments, Scoring tournaments, Round robin, Game trees, Minimax, Partial
Minimax, Game trees, Minimax, Partial Minimax, Path finding. Grid. Navigation mesh. Graph
algorithms, Decision-making Finite State Machines (FSM), locking algorithms, Evaluation function.
Algorithm A*. Movement realization, Influence maps, Modeling uncertainty, Recapitulation.

Reference Material:

 Data Structures and Algorithms for Game Developers, by Allen Sherrod, 1st Edition, Delmar
Learning Publications, 2010.
 Core Techniques and Algorithms in Game Programming by Daniel Dalmau, 1st Edition, New
Riders Games Publications, 2003.
Course Name: Interactive Multimedia

Credit Hours: 3 (3+0)

Prerequisites: None

Objectives: This course is aimed at exposing students to the current and future trends in
multimedia design and development. There is a huge amount of activity going on in this field with a
big market all over the world, and new tools and technologies emerge quickly. Students shall learn
them and familiarize themselves with the solution development using these tools.

Course Outline: Introduction to Multimedia Programming, Scope of Multimedia Programming,

convention and trends, Media types used in current applications (including digital video, audio, and
graphics). System level issues of performance synchronization, storage and server schemes,
dynamic interactivity, hyper linking, multimedia device control, distributed media development and
delivery, non-standard media and programming frame works. Creating Interactive Files, Scripts for
adding Interactivity, Working with Sound and video, Font Software and Playback System,
Introduction to Multi-media Networks, Interactive Multimedia on the Web.

Reference Material:

 Digital Multimedia by Dr. Nigel Chapman and Jenny Chapman, 3rd Edition, Wiley
Publications, 2009.
 An Introduction to Digital Multimedia by T. M. Savage and K.E. Vogel, 1st Edition, Jones &
Bartlett Publishers, 2008.
 Digital and Development of Interactive Multimedia Systems by Dastbaz Mohammad, 1 st
Edition, McGraw Hill Publications, 2002.
 University Electives (Course Outlines)

Course Name: Introduction to Psychology

Credit Hours: 3 (3+0)

Prerequisites: None

Objectives: After studying this course the students should be able to apply different methods for
understanding human behavior. It will help them identify a number of physiological and
psychological factors that can affect a person’s personality. They will be able to understand three
stages of mind and the role of unconscious mind in personality building. It will enable them to apply
some of the elementary techniques to manage conflict and frustration and mild form of behavioral
disorders. It will further help them differentiate between primary and secondary motives and will
also be able to manage and control their emotions.

Course Outline: Introduction and Overview, Historical Perspectives, Nature and Scope of
Psychology, Branches of Psychology, Pure Psychology and Applied Psychology, Physiological
Psychology, Comparative Psychology, Developmental Psychology, Educational Psychology,
Industrial Psychology, Social Psychology, Abnormal Psychology, Clinical Psychology, Criminal and
Legal Psychology, Methods of Psychology, Introspection, External Observation, Naturalistic
Observation, Statistical Method, Case History Method, Genetic Method, Experimental Method,
Research Methodology, Types of Learning, Learning by Insight or Intelligence, Learning by Trial and
Error, Learning by Imitation, Learning by Conditioning, Importance of Reinforcement and
Punishment, Perception, Monocular Cues, Binocular Cues, Illusion, Delusions, Hallucinations,
Motivation, Classification of Motives, Hierarchy of Motives, Emotions, Basic or Primary Emotions,
Theories of Emotions, Management of Emotions.

Reference Material:

 Introduction to Psychology by Clifford T. Morgan and Richard A. King, 7th Edition, McGraw-
Hill Publications, 2008.
 Essentials of Understanding Psychology by Robert S. Feldman, 8th Edition, McGraw-Hill
Publications, 2008.
 The Psychology of Learning and Motivation by Atkinson and Shiffrin, 2nd Edition, London,
Academic Press Publications, 1980.
Course Name: International Relations

Credit Hours: 3 (3+0)

Prerequisites: None

Objectives: After studying this course the students will be able to appreciate the basic knowledge
in the field of International Relations as a responsible citizen. The course also aims to enable the
students to comprehend the current political controversies and conflicts among different nations
and their impact on global peace and security. The students will also be able to realize the
importance of skillful determination of foreign policy and effective diplomacy for the promotion of
national and international interests.

Course Outline: Evolution and Scope of International Relations, Theories and Approaches related
to International Relations, The Nation State System, National Interest, Diplomacy, Balance of Power,
Cold War and its Impact, Non Aligned Movement, International Law, International Organizations,
Colonialism, Neo-Colonialism and Imperialism, Foreign Policy, Fundamentals of Foreign Policy for
an Islamic State, Foreign Policy of Pakistan, Relations of Pakistan with other Countries.

Reference Material:

 Comparative Politics and International Relations by Prakash Chander, 1st Edition, Cosmos
Bookhive Pvt. Ltd. Publications, 2005.
 Politics among Nations by Hans Morgenthau, 7th Edition, McGraw-Hill, 2005.
 International Relations by Palmer Perkins, 3rd Edition, Houghton Mifflin Co., 2001.
Course Name: Financial Accounting

Credit Hours: 3 (3+0)

Prerequisites: None

Objectives: After studying this course students will be able to understand the key concepts of
Financial Accounting and Accounting Information Systems. Focus will be placed upon preparing
and analyzing the financial statements namely Income Statement, Balance Sheet and Cash Flow
Statement.

Course Outline: Introduction to Cost Management and Accounting, Management Accounting vs

Financial Accounting, Cost Management System, Basic Cost Concepts and Manufacturing Cost terms,
Direct and Indirect Costs, Fixed and Variable Cost, Product and Period Costs, Marginal and Average
Costs, Cost of Goods Sold Statement, Income Statement , Production Costing and Service Costing and
Flow of Costs in Manufacturing Concerns, Types of Product Costing Systems, Concepts of Overhead
Applications, Under and Over Applied Overheads and Predetermined Overhead Application Rates,
Accumulation of Cost in Job, Order Costing System, Job Cost Sheet, Cost Behavior and Cost
Estimation, Cost Behavior Patterns, Using Cost behavior Patterns to Predict Future Costs,
Absorption and Variable Costing, Effects of Changes in Productions and Sales under both methods,
Cost Volume Profit Analysis, Break Even Points and Margin of Safety, Budgetary Control System,
Govt. Budgets vs Corporate Budgets, Operational Budgets, Cash Budgets, Master Budget and Zero
Based Budgets, Flexible Budgets, Standard Costing and Performance Measurements, Setting
Standards for Material Cost, Labor Cost and Overheads, Variance Analysis and Calculation,
Preparing and Evaluating Performance Reports, Using Accounting Information for Managerial
Decision Making, Accepting or Rejecting a Special Order, Dropping or Adding a Product.

Reference Material:

 Accounting by Carl S. Warren, and Jonathan E. Duchac, 23rd Edition, South-Western

Publications, 2008.
 Introduction to Financial Accounting by Horngren and Sundem, 9th Edition, Prentice Hall
Publications, 2005.
 Accounting: The Basis for Business Decisions by Meigs and Meigs, 10th Edition, McGraw-Hill
Publications, 1996.
 Principles of Accounting by Warren, Reeve and Fess, 17th Edition, Thomson South-Western
Publications, 1993.
Course Name: Human Resource Management

Credit Hours: 3 (3+0)

Prerequisites: None

Objectives: This course aims to introduce a range of theories, models, concepts and principles to
help students develop their understanding of the relationships between managers, employers and
employee. Students will also examine a range of strategies, tactic, tools and techniques that can be
used by managers and human resources specialists to enhance the efficiency and effectiveness of
individuals, groups and whole organization in both the short and long term.

Course Outline: Human Resource Management in a Dynamic Environment, Strategic Human Resource Planning,

Recruitment and the Foundation of Selection Devices, Employee Orientation, Employee Training and Development Careers,

Motivation and Job Design Evaluation, Employee Performance Rewards and Compensation, Employee Benefits, Introduction to

Labor Relations, Collective Bargaining, Legal issues in HRM.

Reference Material:

 Human Resource Management by Garry Dessler and Varkkey, 11th Edition, Pearson
Education, 2008.
 Human Resource Management by Raymond J. Stone, 3rd Edition, John Wiley and Sons
Publications, 1998.
Course Name: Foreign Language (Quranic Arabic)

Credit Hours: 3 (3+0)

Prerequisites: None

Objectives: After studying this course the students should be able to understand the meanings of
Quran without any help of any translation.

Course Outline: Parts of Speech, The Noun, The Verb, The Harf, The Vowels, The Verbal Noun, The
Gender of Noun, Real Gender, Formal Gender, Exceptional Cases, Common Gender, The Number of
Nouns, Wahid or Mufrad, Tathniyah, The Plural of Nouns and Adjectives, The Sound Plural in
Arabic, The Broken Plural, The Pronouns, Pronouns Attached to a Verb, Possessive Pronouns,
Demonstrative Pronouns, The Relative Pronouns, Interrogative Pronouns, The Irab of Nouns,
Declinable, Indeclinable, The Adjective Phrase, The Relative Phrase, The Demonstrative Phrase, The
Genitive Phrase, Inseparable Prepositions, Separable Prepositions, The Sentence, The Nominal
Sentence, The Verbal Sentence, Types of the Mubtada, The Omission of the Mubtada/ the Khabar,
Types of the Khabar, The Verb, Perfect Tense, the Active and Passive of Madi, The Verbal Sentence,
The Nominal Sentence, The Verbal Sentence, The Object, The Imperfect Tense, Six Groups of
Triliteral Verbs, Moods of Verb, The Imperative Tense, The Derived Verbal Form-I till IX, The
Unsound Verbs, The Sound Verbs, The Weak Verbs, The Mahmuz, The Muda’af, The Hamzated and
Duplicated Radical, The Mahmuz, The Muda’af, The Numerals, The Nouns in Accusative.

Reference Material:

 The Holy Quran.

 Essentials of Arabic Grammar For Learning Quranic language by Brig.(R) Zahoor Ahmed,1st
Edition, Darrusalam Publishers and Distributers, 2008.
 Qamoos-ul-Quran: A Dictionary Compiled by Qazi Zain-ul-Abedin , Darul Ishaat Urdu Bazaar
Karachi, 1994.
 A Handbook of Arabic by Dr. Khalid Zaheer, 1st Edition, 2009.
Course Name: Organizational Behavior and Culture

Credit hours: 3 (3+0)

Prerequisites: None

Objectives: After studying this course the students should be able to apply different methods for
understanding individual and organizational behaviors. This course will enable the students to
identify and understand the factors that determine an individual’s personality and can apply
techniques for becoming a team player. They can select tactics for balancing the demands of
professional and personal life. This course will help them apply different research methodologies for
conducting research and surveys for effective job performance. It will also help them identify and
apply prominent characteristics and attributes of leaders. They can easily pinpoint important factors
that influence their personality in professional lives and how to communicate effectively at work.

Course Outline: Introduction to Organizational Behavior and Culture, What do Managers do?
Management Functions, Management Roles, Contributing Disciplines to the OB field, Challenges and
Opportunities for OB, Research Methodology, Purpose of Research, Research Design, Foundations of
Individual Behavior, Biographical Characteristics, Learning Techniques, Types of Learning, Basic
Approaches to Leadership, Prominent Qualities of a leader, Characteristic of Leader vs Manager,
Theories of Leadership, Motivation, Importance of Motivation in our lives, Stages of Group
Development, Group Structure, Personality Traits, What are Emotions, Felt vs Displayed Emotions.

Reference Material:

 Behavior in Organizations by Gerald Greenberg and Robert A. Baron, 9th Edition Publisher, Prentice
Hall Publications, 2007.
 Organizational Behavior by Stephen P. Robbins and Seema Sanghi, 13th Edition, Pearson Education
India Publications, 2005.
 Organizational Behavior by Fred Luthans, 11th Edition, McGraw-Hill Publications, 2006.
Course Name: Fundamentals of Marketing

Credit Hours: 3 (3+0)

Prerequisites: None

Objectives: After studying this course the students should be able to explain the basics of
marketing, theories and different elements of marketing. Elaborate the concepts of marketing
research, consumer behavior, marketing planning, and Situation Analysis, Objectives, Strategy,
Tactics, Action, Control (SOSTAC). This course will build understanding of the market planning
process, marketing mix and decision making skills.

Course Outline: Introduction to Marketing, Core Concepts of Marketing, Marketing Mix,

Marketing Research, Developing Marketing Information, Consumer Markets and Consumer Buyer
Behavior, Planning, Marketing Planning, Product Line Decisions, Pricing Products, Pricing
Considerations and Approaches, Distribution Channels and Supply, Chain Management, Retailing,
Tactics, Integrated Marketing Communications, Advertising and Sales Promotion, Sales Promotion
and Sales People, Public Relations and Word of Mouth.

Reference Material:

 Principles of Marketing by Kotler and Armstrong, 12th Edition, Prentice Hall Publications,
2007.
 Principles of Marketing by Brassington, 3rd Edition, Pitman Publications, 2003.
 Principles and Perspectives by Bearden, Ingram and Laforge, 2nd Edition, McGraw-Hill
Publications, 1998.
Course Name: E-Commerce

Credit Hours: 3 (3+0)

Prerequisites: None

Objectives: To introduce the environment in which e-commerce, e-government and e-health take
place, the main technologies for supporting e-technologies, and how these technologies fit together.
The course provides students with an intensive survey of technologies used to support all aspects of
electronic business.
Course Outline: Introduction to E-Commerce, Elements of a Business Model, Business-to-
Consumer (B2C) Business Models, Business-to-Business (B2B) Business Models, Business Models in
other Emerging E-Commerce Areas, How the Internet and Web change Business, E-Commerce
Strategy, Structure, Process, E-Commerce Business Models and Concepts, The Internet and World
Wide Web, Building an E-commerce Website, E-Commerce Transaction, Security and Encryption,
Web Payment Systems, Web Marketing Concepts, Web Marketing Communications, Auctions,
Portals and Communities.

Reference Material:

 E-Commerce: Business, Technology and Society by Kenneth C. Laudon and Carol Traver, 4th
Edition Addison Wesley Publications, 2007.
 Electronic Commerce: A Managerial Perspective by Efraim Turban, David King, Dennis Viehland
and Jae Lee, 1st Edition, Pearson Prentice Hall Publications, 2005.
Course Name: Database Administration

Credit Hours: 3

Prerequisites: None

Objectives: This course is designed for the students to have basic knowledge of database and
structured query language. After completion of this course, the students will have a reasonable
foundation in Database Architecture and administrative tasks. Further, the students will be able to
set up, maintain and troubleshoot Database servers including user accounts and privileges.

Course Outline: Introduction to Procedural Language Structured Query Language (PL/SQL),

Control Structure, Procedures, Functions, Packages and Triggers, Understand Database
Architectural component, Managing Database Instance, Understand Logical and Physical Database
Layouts, Internal/External Files, Create an Operational Database Maintaining the Control File,
Explaining the Uses of the Control File, Examining the Contents of the Control File, Obtaining the
Control File Information, Multiplexing the Control File, Maintaining Redo Log Files, Obtaining Log
and Archive Information, Multiplexing and Maintaining Online Redo Log Files, Planning Online
Redo Log Files, Troubleshooting Common Redo Log File Problems, Managing Tablespaces and Data
Files, Describing the Logical Structure of the Database, Creating Tablespaces, Changing the Size of
Tablespaces using Different Methods, Changing the Status and Storage Settings of Tablespaces,
Relocating Tablespaces, Preparing necessary Tablespaces, Creating and Maintaining Clusters,
Using Index-Organized Tables, Retrieving Information about Clusters and Tables from the Data
Dictionary, Fault Tolerance and Performance Tuning, Managing Tablespaces, Segments, Extents
and Blocks, Index and Performance Issues, Managing Users, Privileges, Resources and Security,
Distributed Database, Replication, Database Backup and Recovery Issues.

Reference Material:

 Understanding Database Administration by Pablo Berzukov, 1st Edition, Create Space Publications,
2010.
 Database Administration: The Complete Guide to Practices and Procedures by Craig S. Mullins, 1 st
Edition, Addison-Wesley Publications, 2002.
 Beginning Oracle Database 11g Administration: From Novice to Professional (Beginning from
Novice to Professional) by Iggy Fernandez, 1st Edition, Apress Publications, 2009.
Course Name: Geographical Information System

Credit Hours: 3 (3+0)

Prerequisites: None

Objectives: Students will learn GIS terminology, capabilities, and applications. Become familiar
with important concepts relating to geographic information systems such as, Database concepts
and algorithms, Spatial data analysis techniques and algorithms, Raster and vector data processing.
Students will develop an awareness of typical applications of geographic information systems. They
will also develop the ability to work confidently and successfully through the steps involved in a
simple GIS project.
Course Outline: Introduction and Overview, Identify Key Terms and GIS Capabilities, Identify
Roles of Relevant Technologies, Computer Hardware and Software, Digital Data Communication and
Data Dissemination, Spatial Data, Vector Data vs Raster Data, Vector Data, Spaghetti Data
Format(DXF), Topological Data Structures and Linking Non-Graphic Data, Geocoding (TIGER files),
Grid Data Model and Raster Data Analysis, Vector Data Analysis, Distance, Line Intersection, Area of a
Polygon, Point/Line in a Polygon, Buffering, and Centroid Calculation, Legal issue of GIS.

Reference Material:

 Fundamentals of Geographical Information Systems by Michael N. DeMers, 4th Edition,

Wiley Publications, 2008.
 An Introduction to Geographical Information Systems by Ian Haywood, Steve Carnern and
Sarah Cornelius, 3rd Edition, Prentice Hall Publications, 2006.
 Geographical Information Systems: An Introduction by Tor Bernhardsen, 3rd Edition, John
Wiley and Sons Publications, 2002.
Course Name: Research Methodology

Credit Hours: 3 (3+0)

Prerequisites: None

Objectives: One of the major objectives of this course is to teach the students different research
methodologies useful in their research work in the area of computer science. The course will help
students understand what research methodology is and the various methods that researchers use
to investigate problems. The course provides a framework for conceptualizing research and is
meant to underpin the research project in the final semester as well as in their higher studies in the
future. After studying the course students are expected to conduct research independently.
Course Outline: Introduction to computer scientist, Experimental computer science, Examine the
theoretical areas of computer science, Issues involved in research, Need and purpose of research in
computer science and engineering, Various research methods, Aspects of research evaluation,
Available measurement and statistical techniques, Selection of research techniques, Identification
and design of research problem being investigated, Implementation and visualization, General
introduction to write research paper, Survey paper, Plagiarism, Making a good presentation, Short
presentation, Long presentation, Critique of long presentations, Academic job hunting, Industry job
hunting, Job hunting tips and interview skills.

Reference Material:

 Research Methods by Donald H. McBurney and Theresa L. White, 8th Edition, Wadsworth
Publishing, 2009.
 Research Design and Methodology by Geoffery R. Marczyk, David DeMatteo and David
Festinger, 1st Edition, John Wiley and Sons Publications , 2005.
 Current research papers from top class journals in the field of Computer Science.
 A little book of plagiarism by HEC.
Course name: Introduction To Graph Theory
Credit Hours: 3(3+0)
Pre – Requisite: None
Objectives: The objective of this course is to understand some of the fundamental concepts of
graph theory and its applications, to improve the ability of the students to develop mathematical
proofs.

Course Outline: Graphs, Simple Graphs, Complete Graphs, Paths, Cycles and Connectivity in
Graphs, Sub Graphs, Degree of a Vertex, Counting of Edges, Handshaking Theorem, Graphic
Sequences using Vertex Degree, Isomorphic Graphs, Digraphs, Adjacency and Incidence Matrices of
Graphs and Digraphs, Eulerian Graphs and Digraphs, Orientation and Tournaments, Hamiltonian
Graphs and Digraphs, Trees and Spanning Trees, Properties of Trees, Distance in Trees and Graphs,
Minimal Spanning Tree, Shortest Path Algorithms, Planer Graphs, Euler’s Formula for Planer
Graphs, Max-Matching, Hall’s Matching Condition, Independent Sets and Covers, Maximum Bipartite
Matching, Cuts and Connectivity, Edge-Connectivity, Vertex Coloring of Graphs, Edge Coloring of
Graphs.
Reference Material:

 Graph Theory and Its Applications by Jonathan L. Gross and Jay Yellen, 2nd Edition, Chapman
and Hall Publications, 2005.
 Introduction to Graph Theory by Douglas B. West, 2nd Edition, Pearson Education
Publications, 2000.
 Introductory Graph Theory by Gary Chartrand, 1st Edition, Dover Publications, 1984.
 Graph Theory by Balakrishnan, 1st Edition, McGraw-Hill, 1997.
Course Name: Data Mining and Data Warehousing

Credit Hours: 3 (3+0)

Prerequisites: None

Objectives: The course introduces data warehousing techniques in spotting, digging out and
analyzing decision support systems. It will enable students to understand the fundamentals of data
mining and warehousing technologies and their applications in business. They will learn how to
select and use appropriate data mining algorithms and techniques. At the end of the course they
are expected to develop a data mining application and understand various data warehousing
models, and know how to apply various tools that utilise a data warehouse.
Course Outline: Overview and Concepts, Data Warehousing (DW) Fundamentals, Need for a DW,
Decision Support versus Transaction Processing, Evolution of a DW, Logical and Physical Data
Modeling, Normalization versus Denormalization, Pre-Join Denormalization, Column Replication
Movement, Pre-Aggregation Denormalization, Online Analytical Process (OLAP) Implementation
Techniques, OLAP Framework for Decision Support, Physical Implementation Techniques,
Multidimensional Online Analytical Processing (MOLAP), Relational Online Analytical Processing
(ROLAP), Hybrid Online Analytical Processing (HOLAP), Data Warehousing and Online Analytical
Processing (DOLAP), Star Schema Design, Dimensional Modeling, Principles of Dimensional
Modeling, Physical Database Design for ROLAP Deployment, Natural versus Surrogate Key Design,
Extract Transform Load (ETL) Processing, Joining Techniques and Performance Evaluation, DSS
versus OLTP Queries, Nested Loop Join, Sort-Merge Join, Merge Join, Hash Join, Pointer Join, Query
Optimization, Indexing Techniques for Data Warehousing, Traditional B-tree Indexing, Hash
Indexing, Primary versus Secondary Indexing, Single Index Access vs Scanning, Combining Multiple
Indexes, Dynamic Bitmap Indexing, Static Bitmap Indexing, Composite Indexing, Covered Indexing,
Cluster Indexing, Partial Indexing, Data Mining, Association, Classification, Clustering, Decision
Trees, Neural Networks.

Reference Material:

 The Data Warehouse Lifecycle Toolkit by Ralph Kimball, Margy Ross, Warren Thornthwaite, and
Joy Mundy, 2nd Edition, Wiley Publications, 2008.
 The Data Warehouse and Data Mining by William H. Inmon, 4th Edition, John Wiley and Sons
Publications, 2005.
 Data Warehousing Fundamentals: A Comprehensive Guide for IT Professionals by Paulraj Ponniah,
1st Edition, John Wiley and Sons Publications, 2001.
 Data mining by Richard J. Roiger, 1st Edition, Addison Wesley Publications, 2002.
Course Name: Entrepreneurship

Credit Hours: 3 (3+0)

Prerequisites: None

Objectives: After studying this course students will be able to discriminate between methodologies
and use structured creative for problem solving and decision making to help enhance their chance of
success in entrepreneurial activities, whilst critically evaluating strategic options and to contribute
effectively to the discussion of entrepreneurial business case studies. The students will be able to
develop a comprehensive business plan that includes sales, financial and legal considerations for
starting and operating a small business.

Course Outline: Process of Entrepreneurship, Characteristic of an Entrepreneur, Developing a

Successful Business Idea, Identifying and Recognizing Opportunities, Observing Trends, Solving a
Problem, Encouraging and Protecting New Ideas, Feasibility Analysis, Industry and Competitor
Analysis, Developing an Effective Business Model, Building a New Venture Team, Partnering for
Success, Financial Strength and Viability, Ethical and Legal Issues Facing a New Firm, Choosing a
Form of Business Organization, Plan, Presentation of Business Plan to the Investors, Getting Finance
or Funding, Unique Marketing Issues, The importance of Intellectual Property, Preparing and
Evaluating Challenges for Growth, Internal and External Growth Strategies.

Reference Material:

 Entrepreneurship by Robert Hisrich, Michael Peters, and Dean Shepherd, 8th Edition,
McGraw-Hill Publications, 2009.
 Entrepreneurship by Bruce R. Barringer and R. Duane Ireland, 6th Edition, Pearson
Publishers, 2006.
Course Name: Digital Moviemaking and Animation

Credit Hours: 3 (3+0)

Prerequisites: None

Objectives: After studying this course students will be able to capture, expose, edit and apply
animation schemes on digital movies. It will further help them to process and synthesize digital
audio, effects and frame-grabbing techniques.

Course Outline: Space and time within movies, Screening of movie excerpts, Discussion of editing
cuts, Lens aperture, Focal length, Perspective, Depth of field, Exposure, Videotape, Video recording
technology, Portable digital video equipment, Camera care and handling, Digital Editing Techniques
and Equipment, Types of Lighting and Use in Movies, Advanced 3D Animation Techniques:
Morphing Materials editing, Texture mapping and scaling, Reflection mapping and scaling, Bump
map, Opacity map. Digital audio recording, Sound synthesis, Microphones, Digital effects,
Parametric animation, Degrees of Freedom, Review of technologies for frame grabbing, Wave form
monitor, Analog to digital converters, Storytelling via interconnecting of images produced with
various electronic media.

Reference Material:

 3D Movie Making: Stereoscopic Digital Cinema from Script to Screen by Bernard

Mendidburu, 1st Edition, Focal Press Publications, 2009.
 Digital Movie-Making by Tony Mullen and Claudio Andaur, 1st Edition, Sybex Publications,
2010.
Course Name: Enterprise Resource Planning

Credit Hours: 3 (3+0)

Prerequisites: None

Objectives: The objective of this course is to make students aware of the potential and the
limitations of enterprise systems through the means of case studies and lectures. It will enable the
students to understand the challenges associated with the successful implementation of global
Supply Chain ERP software with an emphasis on leadership and managerial implications.

Course Outline: Analyzing ERP systems through a managerial perspective, Planning and control
systems used by manufacturing companies, How can ERP help a business organization, Obstacles to
implementing ERP, ERP Modules and Historical Development, System Options and Selection
Methods, Clarifying Business Strategy before Implementing an ERP, Business Process Redesign and
Best Practices, ERP Implementation, ERP Project Management, Business Intelligence and ERP
Systems, ERP and Supply Chains, ERP Security, Trends in ERP, Rationale for acquiring and
implementing ERP systems, Selection of ERP software.

Reference Material:

 Concepts in Enterprise Resource Planning by Ellen Monk and Bret Wagner, 3rd Edition,
Course Technology Publication, 2008.
 Enterprise Information Systems: Contemporary Trends and Issues by David L. Olson and
Subodh Kesharwani, 1st Edition World Scientific Publishing Company, 2009.
Course Name: Foreign Language (Quranic Arabic)

Credit Hours: 3 (3+0)

Prerequisites: None

Objectives: After studying this course the students should be able to understand the meanings of
Quran without any help of any translation.

Course Outline: Parts of Speech, The Noun, The Verb, The Harf, The Vowels, The Verbal Noun, The
Gender of Noun, Real Gender, Formal Gender, Exceptional Cases, Common Gender, The Number of
Nouns, Wahid or Mufrad, Tathniyah, The Plural of Nouns and Adjectives, The Sound Plural in
Arabic, The Broken Plural, The Pronouns, Pronouns Attached to a Verb, Possessive Pronouns,
Demonstrative Pronouns, The Relative Pronouns, Interrogative Pronouns, The Irab of Nouns,
Declinable, Indeclinable, The Adjective Phrase, The Relative Phrase, The Demonstrative Phrase, The
Genitive Phrase, Inseparable Prepositions, Separable Prepositions, The Sentence, The Nominal
Sentence, The Verbal Sentence, Types of the Mubtada, The Omission of the Mubtada/ the Khabar,
Types of the Khabar, The Verb, Perfect Tense, the Active and Passive of Madi, The Verbal Sentence,
The Nominal Sentence, The Verbal Sentence, The Object, The Imperfect Tense, Six Groups of
Triliteral Verbs, Moods of Verb, The Imperative Tense, The Derived Verbal Form-I till IX, The
Unsound Verbs, The Sound Verbs, The Weak Verbs, The Mahmuz, The Muda’af, The Hamzated and
Duplicated Radical, The Mahmuz, The Muda’af, The Numerals, The Nouns in Accusative.

Reference Material:

 The Holy Quran.

 Essentials of Arabic Grammar For Learning Quranic language by Brig.(R) Zahoor Ahmed,1st
Edition, Darrusalam Publishers and Distributers, 2008.
 Qamoos-ul-Quran: A Dictionary Compiled by Qazi Zain-ul-Abedin , Darul Ishaat Urdu Bazaar
Karachi, 1994.
 A Handbook of Arabic by Dr. Khalid Zaheer, 1st Edition, 2009.
Course Name: Database Administration

Credit Hours: 3

Prerequisites: None

Objectives: This course is designed for the students to have basic knowledge of database and
structured query language. After completion of this course, the students will have a reasonable
foundation in Database Architecture and administrative tasks. Further, the students will be able to
set up, maintain and troubleshoot Database servers including user accounts and privileges.

Course Outline: Introduction to Procedural Language Structured Query Language (PL/SQL),

Control Structure, Procedures, Functions, Packages and Triggers, Understand Database
Architectural component, Managing Database Instance, Understand Logical and Physical Database
Layouts, Internal/External Files, Create an Operational Database Maintaining the Control File,
Explaining the Uses of the Control File, Examining the Contents of the Control File, Obtaining the
Control File Information, Multiplexing the Control File, Maintaining Redo Log Files, Obtaining Log
and Archive Information, Multiplexing and Maintaining Online Redo Log Files, Planning Online
Redo Log Files, Troubleshooting Common Redo Log File Problems, Managing Tablespaces and Data
Files, Describing the Logical Structure of the Database, Creating Tablespaces, Changing the Size of
Tablespaces using Different Methods, Changing the Status and Storage Settings of Tablespaces,
Relocating Tablespaces, Preparing necessary Tablespaces, Creating and Maintaining Clusters,
Using Index-Organized Tables, Retrieving Information about Clusters and Tables from the Data
Dictionary, Fault Tolerance and Performance Tuning, Managing Tablespaces, Segments, Extents
and Blocks, Index and Performance Issues, Managing Users, Privileges, Resources and Security,
Distributed Database, Replication, Database Backup and Recovery Issues.

Reference Material:

 Understanding Database Administration by Pablo Berzukov, 1st Edition, Create Space Publications,
2010.
 Database Administration: The Complete Guide to Practices and Procedures by Craig S. Mullins, 1 st
Edition, Addison-Wesley Publications, 2002.
 Beginning Oracle Database 11g Administration: From Novice to Professional (Beginning from
Novice to Professional) by Iggy Fernandez, 1st Edition, Apress Publications, 2009.