HIG HER ISSIO N

EDUC ATIO N COMM

Revised Curriculum

OF

BS in COMPUTER SCIENCE
MS in COMPUTER SCIENCE

Revised & Approved by Board of Studies

Department of Computer Science
Islamia College Peshawar (Chartered University)

(19. 02. 2014)

Minutes of the Meeting of Board of Studies for BS(CS), BS(SE) and MS(CS)
Programs

The proceedings of the Board of studies meeting (held on 19.02.2014, 10.00 a.m)
started with the recitation from the holy Quran and welcome address by the Convener of
the meeting, Dr.Zahoor Jan.

The following programs were discussed by the participants of the meeting

1) BS (Computer Science)
2) MS (Computer Science)
3) And the BS (Software Engineering) was also planned but due to lack of time it
was left for discussion in the next meeting.

After a detailed discussion about the current curriculum for BS and MS Programs, the
board of studies updated the above mentioned undergraduate and graduate programs
with the following recommendations:

1) Recommendations for BS Program in Computer Science

i. Aims and objectives should be added to the BS(CS) program.

ii. The name of the subjects from other departments like physics, math etc.
should be specific.
iii. The title of each and every course should match with its contents and should
be having a relation with Computer Science.
iv. The course codes should be standardized like the course codes for BS
program should start from 3 and move upto 6. And those for MS should start
from 7.
v. For the courses from other departments, the codes should be taken from the
departments concerned.
vi. The final project should be split in two as Software Project-1 and Software
Project-2.
vii. Generic subject names should be replaced with specific subject names.
viii. There should be one statistics course (Probability & Statistics) for CS
students and should be offered in second semester.
ix. Programming fundamentals should be offered in first semester.
x. C++ should be used as a language when teaching Programming
fundamentals instead of C.
xi. Object Oriented Programming-1 (OOP-1) should be offered in second
semester covering the object oriented aspects of C++.
xii. Philosophy should be offered to CS students as University Electives instead
of Psychology,
xiii. Arabic, Korean and other regional and foreign languages may be added to
the Languages course in University Electives.
xiv. Principles of IT course should be added to CS Electives.
xv. Data warehousing and Data Mining should be split into two separate courses.
 xvi. Distributed Systems and Multimedia Technologies courses should be added
to CS Electives.
xvii. Professional Practices course should be replaced with Computer Ethics.
xviii. Technical and Report writing course should be offered in 7th Semester.
xix. Linear Algebra should be offered instead of Calculus-II in 2nd Semester.
xx. Object Oriented-II course should be offered in 3rd semester covering the
basics of Java programming language.
xxi. Basic Electronics course should be offered in 2nd semester in place of
physics.
xxii. Physics should be offered in 3rd semester.
xxiii. Data Structures and Algorithms course should be renamed as Data
Structures and should be 3+1.It must have a lab.
xxiv. Add Numerical Analysis to the list of CS Supporting courses
xxv. Assembly Language course should be 3+1.
xxvi. The course “Intro to Database Systems” should be renamed as” Database
Systems”
xxvii. Financial Accounting should be offered instead of sociology,
xxviii. The Advance Programming course should be offered in 5 th semester and
should contain advanced topics like multithreading, JDBC, Socket
Programming, RMI, Swing etc.
xxix. VBScript and ASP should be replaced with topics like XML, XSL, JQuery and
AJAX etc. in Internet Programming course
xxx. Operating System course should be 3+1 having a lab that covers the
administration of linux OS from a command line interface.
xxxi. The course “Intro to Software Development” should be renamed as” Software
Engineering”
xxxii. Data Communication and Computer Networks should be two separate
courses. Data Communication should be offered in 5th semester and
Computer Networks should be offered in 6th semester.
xxxiii. Course contents should be updated with latest books and topics.
xxxiv. The list of CS Electives should be updated with more demanding subjects like
a. Mobile Application Development
b. Information Retrieval
c. Web Mining
d. Semantic Web
e. Social Web etc

2) Recommendations for MS Program in Computer Science

The Board of Studies approved the H.E.C approved curriculum for MS Program and
recommended that the two core courses i.e., “Advanced Operating Systems” and
“Advanced Computer Architecture” should be replaced by “Research Methods” and
“Stochastic Processes”. Additionally it was also approved as suggested by HEC that
Research should be 6 Credit Hours.
The meeting was adjourned with the vote of thanks from the convener.

The following attended the meeting:

i. Dr. Zahoor Jan Convener

ii. Dr. Saeed Mehfooz Member
iii. Dr. Shah Khusro Member
iv. Mr. Atta Ullah Khan Member
v. Mr. Sardar Ali Member
vi. Mr. Murad Ullah Member
vii. Mr. Izhar Ali Member
viii. Mr. Faisal Saeed Member

Dean, Chairman,
Faculty of Physical and Numerical Sciences, Department of Computer Science
Islamia College Peshawar (Chartered University) Islamia College Peshawar (Chartered University)

BS (Computer Science) Program

The structure and other details of the program proposed by the committee were
designed inline to the recommendations of various leading bodies continuously in the
quest to designing the educational programs of Computer Science and related
disciplines. These bodies include HEC, IEEE and ACM.

The structure of a BS program in Computer Science is proposed to meet the needs of

students with formal computing experience and with established relevant skills. The
students are expected to learn theoretical and practical understanding of the entire field
of Computer Science.

Minimum credit hours shall be 130 for BS (Computer Science) program including
computing related courses.

The program shall comprise 8 semesters spread over 4 years with two semesters a
year. The major area of specialization shall be incorporated in the structure. Each major
area shall comprise of 4-6 courses.
The following is distribution of total credit hours.

# Category Credit Hrs

1 Computing courses
Computing – Core courses 43
Computing – Supporting areas 12 70
Computing – General Education 15
2 Computer Science courses
CS – Core courses 18
CS – Electives 21 48
CS – Supporting Area 9
3 University Electives 12
Total credit hours 130

BS (Computer Science) Program

Course Codes

Supporting Area Courses - 12 Credit Hours

# Course Title Credit

hours
1 Calculas and Analytical Geometry 3 (3-0)
2 Probability and Statistics 3 (3-0)
3 Linear Algebra 3 (3-0)
4 Physics 3 (3-0)

Computer Science – Supporting Courses (9 Cr. Hours Inter-Faculty Courses)

# Course Title Credit Hours
1 Basic Electronics 3 (3, 0)
2 Numerical Analysis 3 (3, 0)
3 Simulation and Modeling 3 (3,0)
4 Operation Research 3 (3,0)
 BS (Computer Science) Program
Computing – General Education Courses (16 Credit Hours)

# Course Title Credit hours

1 Functional English 3 (3, 0)
2 Technical and Report Writing 3 (3, 0)
3 Communication Skills 3 (3, 0)
4 Islamic Studies 2 (2, 0)
5 Pakistan Studies 2 (2, 0)
6 Computer Ethics 3 (3, 0)

0. Computing Fundamental and Programming – Core Courses

# Course Title Cr. Hours Code

0 Introduction to Computer 4 (3-3) COMP101
1 Programming Fundamentals 4 (3-3) COMP102
2 Object Oriented Programming-1 4 (3-3) COMP106
3 Object Oriented Programming-2 4(3-3) COMP210

1. Computing - Core Courses

# Course Title Cr. Hours Code

0 Discrete Structures 3(3-0) COMP103
1 Data Structures 4(3-3) COMP202
2 Digital Logic and Design 3(3-0) COMP201
3 Operating Systems 3(2-3) COMP204
4 Database Systems1 4(3-3) COMP205
5 Software Engineering 3(3-0) COMP328
6 Data Communications 3(3-0) COMP301
7 Computer Networks 3(3-0) COMP307
8 Software Project-1 3(0-9) COMP402
9 Software Project-2 3(0-9) COMP402
2. Computer Science - Core Courses

# Course Title Cr. Hours Code

0 Computer Organization and Assembly Language1 3(2-3) COMP212
1 Theory of Automata and Formal Languages 3(3-0) COMP317
2 Design and Analysis of Algorithms 3(3-0) COMP318
3 Computer Architecture 3(3-0) COMP330
4 Compiler Construction 3(3-0) COMP329
5 Artificial Intelligence 3(3-0) COMP315

3. Computer Science - Elective Courses

# Course Title Cr. Hours Code

0 Advance Programming 3(3-0) COMP327
1 Digital Image Processing 3(3-0) COMP416
2 Distributed Database System 3(3-0) COMP422
3 Internet Programming 3(3-0) COMP321
4 Advanced Software Engineering 3(3-0) COMP421
5 Network Security 3(3-0) COMP418
6 Computer Graphics 3(3-0) COMP319
7 Wireless Networks 3(3-0) COMP417
8 System Programming 3(3-0) COMP323
9 Artificial Neural Network 3(3-0) COMP413
10 Mobile Application Development 3(2-3) COMP419
11 Information Retrieval 3(3-0) COMP423
12 Semantic Web 3(3-0) COMP424
13 Social Web 3(3-0) COMP425
14 Web Mining 3(3-0) COMP426

University Elective Courses – 12 Credit Hours

(Not limited to the list below. Institutions may add more courses)

# Course Title CreditHours

1 Financial Accounting 3(3, 0)
2 Financial Management 3 (3, 0)
3 Human Resource Management 3 (3, 0)
4 Marketing 3 (3, 0)
5 Economics 3 (3, 0)
 6 Psychology 3 (3, 0)
7 International Relations 3 (3, 0)
8 Foreign/Regional Language (French, German, Sindhi etc.) 3 (3, 0)
9 Philosophy 3(3, 0)
10 Sociology 3(3, 0)

BS (Computer Science) Program

Semester Wise Scheme of Studies
Semester - 1 ( 19 Credit Hrs)
Code Course Title Cr. Hrs Pre-Requisite Remarks
Functional English 3(3-0) ---
Islamic Studies 2(2-0) ---
Calculus 3(3-0) ---
COMP101 Introduction to Computer 4(3-3) ---
COMP102 Programming Fundamentals 4(3-3) ---
COMP103 Discrete Structures 3(3-0) ---
Semester - 2 ( 18 Credit Hrs)
Code Course Title Cr. Hrs Pre-Requisite Remarks
Basic Electronics 3(3-0) ---
Pakistan Studies 2(2-0) ---
COMP104 Linear Algebra 3(3-0) ---
COMP105 Probability & Statistics 3(3-0) ---
Philosophy 3(3-0) ---
COMP106 Object Oriented Programming-1 4(3-3) ---
Semester - 3 ( 17 Credit Hrs)
Code Course Title Cr. Hrs Pre-Requisite Remarks
Communication Skills 3(3-0)
Physics 3(3-0)
COMP202 Data Structures 4(3-3)
COMP210 Object Oriented Programming-II 4(3-3)
COMP201 Digital Logic and Design 3(3-0)
Semester - 4 ( 17 Credit Hrs)
Code Course Title Cr. Hrs Pre-Requisite Remarks
Professional Practices 3(3-0)
Financial Accounting 3(3-0)
COMP204 Operating Systems 3(2-3)
Computer Organization & Assembly
COMP212 4(3-3)
Language
COMP205 Database Systems 4(3-3)
Semester - 5 ( 19 Credit Hrs)
Code Course Title Cr. Hrs Pre-Requisite Remarks
COMP327 Advance Programming 4(3-3)
COMP318 Design & Analysis of Algorithms 3(3-0)
COMP328 Software Engineering 3(3-0)
COMP301 Data Communication 3(3-0)
COMP317 Theory of Automata & Formal Languages 3(3-0)
COMP331 Numerical Analysis 3(3-0)
Semester - 6 ( 19 Credit Hrs)
Code Course Title Cr. Hrs Pre-Requisite Remarks
COMP319 Computer Graphics 4(3-3)
COMP329 Compiler Construction 3(3-0)
COMP330 Computer Architecture 3(3-0)
COMP315 Artificial Intelligence 3(3-0)
COMP321 Internet Programming 3(2-3)
COMP307 Computer Networks 3(3-0)
Semester - 7 ( 15 Credit Hrs)
Code Course Title Cr. Hrs Pre-Requisite Remarks
Technical & Report Writing 3(3-0)
HRM 3(3-0)
COMP416 Digital Image Processing 3(2-3)
Economics 3(3-0)
COMP402 Final Year Project (Phase-1) 3
Semester - 8 ( 12 Credit Hrs)
Code Course Title Cr. Hrs Pre-Requisite Remarks
COMP421 Advance Software Engineering 3(3-0)
COMP418 Network Security 3(3-0)
COMP417 Wireless Networks 3(3-0)

COMP402 Final Year Project (Phase-2) 3

 ISLAMIA COLLEGE PESHAWAR
(Chartered University)
Department of Computer Science
Curriculum for MS (Computer Science)

 Minimum credit hours shall be 30 for MS (Computer Science) program.

 The program shall comprise 4 semesters spread over 2 years with two
semesters a year.

Core courses
Course # Title Cr.Hrs.
COMP-501 Advanced Theory of Computation 3
COMP -502 Advanced Algorithm Analysis 3
COMP -503 Advanced Operating Systems 3
COMP -504 Advanced Computer Architecture 3
COMP -505 Stochastic Processes 3
COMP -506 Research Methods 3

Non-Credit Course
COMP -599 Programming for Scientific Research --

MS Research Thesis
COMP -600 Thesis 6

Elective Courses
Code Specialization Areas Cr. Code Specialization Areas Cr.
Hrs Hrs

Software Engineering Artificial Intelligence

COMP-507 Software Quality COMP-517 Design of Intelligent
3 3
Assurance Systems
COMP -508 Requirements COMP -518
3 Machine Learning 3
Engineering
COMP -509 Software Architecture 3 COMP -519 Neural Networks 3
COMP -510 Agent Oriented COMP -520
3 Mathematical Reasoning 3
Software Engineering
COMP -511 Software Project COMP -521 Decision Support
3 3
Management Systems
COMP-512 Software Design 3 COMP-522 Computer Vision 3
COMP-513 Software Engineering COMP-523
Knowledge based
and Formal 3 3
systems
Specifications
COMP-514 Empirical Software 3 COMP-524 Genetic Algorithms 3
 Engineering
COMP-515 Software Process COMP-525 Applied Image
3
Improvement Processing
Component-Based COMP-526 Advanced Image
COMP-516 3 3
Computing Processing
COMP-586 Advance Machine
3
Learning
Information Management Graphics and Visual Computing
COMP-527 COMP-542 Advanced Computer
Advanced DBMS 3 3
Graphics
COMP -528 Multimedia COMP-543 Geographical Information
3 3
Information Systems Systems
COMP -529 Database Design 3 COMP-544 Computer Animation 3
COMP -530 Transaction
3 Human Computer Interaction
Processing
COMP -531 Distributed and Object COMP-545
3 Intelligent User Interfaces 3
Databases
COMP-532 COMP-546 Information Retrieval
Data Mining 3 3
Techniques
COMP-533 Spatial and Temporal COMP-547
3 Rich Internet Applications 3
Databases
COMP-534 Semantic Databases 3 COMP-548 Graphical User Interfaces 3
COMP-535 COMP-549 Computer-Supported
Data Warehousing 3 Cooperative Work 3
(CSCW)
COMP-536 Object Oriented COMP-550 Multimedia Systems
3 3
Databases Development
COMP-537 COMP-551 Interactive-Systems
Digital Libraries 3 3
Development
COMP-538 Web-Based DBMS 3 Computational Science
COMP-539 Topics in DBMS 3 COMP-552 Computational Science 3
COMP-540 COMP-553 Computational
Data Grids 3 3
Intelligence
COMP-541 Text Mining 3 COMP-554 Operations Research 3
Net-Centric computing COMP-555 Simulation and Modelling 3
COMP-558 Advanced Computer COMP-556
3 Scientific Computing 3
Networks
COMP-559 Wireless Sensors COMP-557
3 Computational Biology 3
Network
COMP-585 Advance Computational
3
Intelligence
COMP-560 Network Security 3 Web Engineering
Topics in Computer COMP-570
COMP-561 3 Semantic Web 3
Networking
COMP-562 Broadband and 3 COMP-571 Web Services 3
 Satellite
Communication
COMP-563 Mobile and Pervasive
3 Graphics and Visual Computing
computing
COMP-564 Wireless and Mobile COMP-572 Virtual Reality
3 3
Computing Networks
Intelligent and active COMP-573 Human Computer
COMP-565 3 3
networks Interaction
COMP-566 Network Performance Advanced Computer
3 COMP-574 3
Evaluation Graphics
COMP-567 Cluster Computing 3 Grid and Cloud Computing
COMP-568 Distributed Computing 3 COMP-579 Autonomous Computing 3
COMP-569 Cryptography 3 COMP-580 Semantic Grids 3
Programming Language Design and
COMP-581 Data Grids 3
Translators
COMP-575 Compiler construction 3 Operating Systems
COMP-576 Programming COMP-582 Concurrent and
3 3
Language Design Distributed Systems
COMP-577 Algorithm and COMP-583
3 Real-Time Systems 3
Complexity (AL)
COMP-578 Scripting Languages 3 COMP-584 Embedded Systems 3
 COURSE CONTENTS of BS(CS)

Computing Core Courses

Course Name: Introduction to Computing

Course Structure: Lectures: 3, Labs: 1 Credit Hours: 4
Prerequisites: None

Objectives: This course focuses on a breadth-first coverage of computer

science discipline, introducing computing environments, general application
software, basic computing hardware, operating systems, desktop publishing,
Internet, software applications and tools and computer usage concepts;
Introducing Software engineering and Information technology within the broader
domain of computing, Social issues of computing.
Course Outline: Number Systems, Binary numbers, Boolean logic, History
computer system, basic machine organization, Von Neumann Architecture,
Algorithm definition, design, and implementation, Programming paradigms and
languages, Graphical programming, Overview of Software Engineering and
Information Technology, Operating system, Compiler, Computer networks and
internet, Computer graphics, AI, Social and legal issues.
Labs:
Working with Microsoft Windows, MS Office and Internet
Reference Material:
1. Computers: Information Technology in Perspective, 9/e by Larry Long and
Nancy Long,
2. Prentice Hall, 2002 / ISBN: 0130929891
3. An Invitation to Computer Science, Schneider and Gersting, Brooks/Cole
Thomson Learning, 2000
4. Computer Science: An overview of Computer Science, Sherer,
Course Name: Programming Fundamentals
Course Structure: Lectures: 3, Labs: 1 Credit Hours: 4
Prerequisites: None
Objectives: The course is designed to familiarize students with the basic
structured programming skills. It emphasizes upon problem analysis, algorithm
designing, and program development and testing.
Course Outline: Overview of computers and programming. Overview of
language for e.g. C language C. Basics of structured and Modular programming.
Basic Algorithms and problem solving, development of basic algorithms,
analyzing problem, designing solution, testing designed solution. Fundamental
programming constructs, translation of algorithms to programs, data types,
control structures, functions, arrays, records, files, testing programs.
Labs:
Basics of programming using C in a latest IDE.

Reference Material:
1. Problem Solving and Program Design in C / 6E
Hanly & Koffman
Addison-Wesley | Published: 02/06/2009
ISBN-10: 0321535421 | ISBN-13: 9780321535429
2. C How to Program, 5/E
(Harvey & Paul) Deitel & Deitel, ISBN-10: 0132404168 ISBN-13:
9780132404167 Publisher: Prentice Hall Copyright: 2007

Course Name: Object Oriented Programming

Course Structure: Lectures: 3, Labs: 1 Credit Hours: 4
Prerequisites: Programming Fundamentals
Objectives: The course aims to focus on object-oriented concepts, analysis and
software development.
Course Outline: Evolution of Object Oriented (OO) programming, OO concepts
and principles, problem solving in OO paradigm, OO programme design process,
classes, methods, objects and encapsulation; constructors and destructors,
operator and function overloading, virtual functions, derived classes, inheritance
and polymorphism. I/O and file processing, exception handling
Labs:
Basics of Object Oriented Programming using C++ in a latest IDE.
Reference Material:
1. C++ How to Program, 6/E
(Harvey & Paul) Deitel & Deitel ISBN-10: 0136152503
 ISBN-13: 9780136152507 Publisher: Prentice Hall
2. Java How to Program, 7/E
(Harvey & Paul) Deitel & Deitel ISBN-10: 0132222205 ISBN-13:
9780132222204 Publisher: Prentice Hall

Course Name: Discrete Structures

Course Structure: Lectures: 3 , Labs: 0 Credit Hours: 3
Prerequisites: None
Objectives: Introduces the foundations of discrete mathematics as they apply to
Computer Science, focusing on providing a solid theoretical foundation for further
work. Further, this course aims to develop understanding and appreciation of the
finite nature inherent in most Computer Science problems and structures through
study of combinatorial reasoning, abstract algebra, iterative procedures, predicate
calculus, tree and graph structures. In this course more emphasis shall be given
to statistical and probabilistic formulation with respect to computing aspects.
Course Outline: Introduction to logic and proofs: Direct proofs; proof by
contradiction, Sets, Combinatorics, Sequences, Formal logic, Prepositional and
predicate calculus, Methods of Proof, Mathematical Induction and Recursion, loop
invariants, Relations and functions, Pigeonwhole principle, Trees and Graphs,
Elementary number theory, Optimization and matching. Fundamental structures:
Functions; relations (more specifically recursions); pigeonhole principle; cardinality
and countability, probabilistic methods.

Reference Material:
1. Kenneth H. Rosen, Discrete Mathematics and Its Applications, 6TH edition, 2006,
Mcgraw Hill Book Co.
2. Richard Johnsonbaugh, Discrete Mathematics, 7TH edition, 2008, Prentice Hall
Publishers.
3. Kolman, Busby & Ross, Discrete Mathematical Structures, 4th edition, 2000,
Prentice-Hall Publishers.
4. Ralph P. Grimaldi, Discrete and Combinatorial Mathematics: An Applied
Introduction, Addison-Wesley Pub. Co., 1985.

Course Name: Operating Systems

Course Structure: Lectures: 3, Labs: 1 Credit Hours: 4
Prerequisites: Data Structures and Algorithms
Objectives: To help students gain a general understanding of the principles and
concepts governing the functions of operating systems and acquaint students with
the layered approach that makes design, implementation and operation of the
complex OS possible.
Course Outline: History and Goals, Evolution of multi-user systems, Process and
CPU management, Multithreading, Kernel and User Modes, Protection, Problems
of cooperative processes, Synchronization, Deadlocks, Memory management and
virtual memory, Relocation, External Fragmentation, Paging and Demand Paging,
Secondary storage, Security and Protection, File systems, I/O systems, Introduction
to distributed operating systems. Scheduling and dispatch, Introduction to
concurrency.
Lab assignments involving different single and multithreaded OS algorithms.
Labs:
Linux installation and administration using command line interface
Reference Material:
1. Applied Operating Systems Concepts, 7th Edition, Silberschatz A., Peterson,
J.L., & Galvin P.C. 2004.
2. Modern Operating Systems, 3rd Edition, Tanenmaum A.S., 2008.

Course Name: Introduction to Database Systems

Course Structure: Lectures: 3, Labs: 1 Credit Hours: 4
Prerequisites: Data Structures and Algorithms
Objectives: The course aims to introduce basic database concepts, different
data models, data storage and retrieval techniques and database design
techniques. The course primarily focuses on relational data model and DBMS
concepts.
Course Outline: Basic database concepts; Entity Relationship modelling,
Relational data model and algebra, Structured Query language; RDBMS;
Database design, functional dependencies and normal forms; Transaction
processing and optimization concepts; concurrency control and recovery
techniques; Database security and authorization. Small Group Project
implementing a database. Physical database design: Storage and file structure;
indexed files; b-trees; files with dense index; files with variable length records;
database efficiency and tuning.
Labs:
Basic database design and management concepts using any popular DBMS.

Reference Material:
1. Database Systems 8E, C.J.Date, Addison Wesley Pub. Co. (2004).
2. Database Systems: A Practical Approach to Design, Implementation and
Management 5E, R.Connolly and P.Begg, Addison-Wesley Pub. Co (2009).
3. Fundamentals of Database Systems, 5/E, Elmasri and Navathe, Addison-
Wesley, ISBN: 0-201-74153-9.

Course Name: Software Engineering

Course Structure: Lectures: 3, Labs: 0 Credit Hours: 3
Prerequisites: Object Oriented Paradigm/Programming
Objectives: To study 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.
Course Outline: Introduction to Computer-based System Engineering; Project
Management; Software Specification; Requirements Engineering, System
Modelling; Requirements Specifications; Software Prototyping; Software Design:
Architectural Design, Object-Oriented Design, UML modelling, Function-Oriented
Design, User Interface Design; Quality Assurance; Processes & Configuration
Management; Introduction to advanced issues: Reusability, Patterns;
Assignments and projects on various stages and deliverables of SDLC.

Reference Material:
1. Software Engineering 8E by Sommerville Addison Wesley, 2006
2. Software Engineering: A Practitioner's Approach /7E, Roger Pressman,
McGraw-Hill, 2009

Course Name: Data Communication

Course Structure: Lectures: 3, Labs: 0 Credit Hours: 3
Prerequisites: None
Objectives: To introduce students to the concept of computer communication.
Analogue & digital transmission. Network Layers, Network models (OSI, TCP/IP)
and Protocol Standards. Emphasis is given on the understanding of modern
network concepts.
Course Outline: Analogue and digital Transmission, Noise, Media, Encoding,
Asynchronous and Synchronous transmission, Protocol design issues. Network
system architectures (OSI, TCP/IP), Error Control, Flow Control, Data Link
Protocols (HDLC, PPP). Local Area Networks and MAC Layer protocols
(Ethernet, Token ring), Multiplexing, Switched and IP Networks, Inter-networking,
Routing, Bridging, Transport layer protocols TCP/IP, UDP. Network security
issues. Programming exercises, labs or projects involving implementation of
protocols at different layers.

Reference Material:
1. Introduction to Computer Networks /4, A. S. Tanenbaum, Prentice Hall 2003
2. Computer Networks and Internets, 5/E, 2008
Douglas E. Comer, Purdue University ISBN-10: 0136061273 ISBN-13:
9780136061274 Publisher: Prentice Hall
3. Data and Computer Communications By William Stallings Published by
Macmillan Pub. Co., 8th Edition 2006
Course Name: Final Year Project
Course Structure: Lectures: 0, Labs: 6 Credit Hours: 6
Prerequisites: Introduction to Software Development, Data Base Systems,
Computer Architecture
Objectives: The software project involves research, conceive, plan and develop
a real and substantial project related to computer science. It provides an
opportunity to the students to crystallize their acquired professional competence
in the form of a demonstrable software product. Make oral and written project
presentations.
Resources: Software Project Management in Practice by Jalote, Pankaj.

Computing Supporting Courses

Course Name: Calculus-I

Course Structure: Lectures: 3, Labs: 0 Credit Hours: 3
Prerequisites: None
Objectives: To provide foundation and basic ground for calculus and analytical
geometry background.
Course Outline: Complex Numbers, DeMoivre’s Theorem and its Applications,
Simple Cartesian Curves, Functions and Graphs, Symmetrical Properties, Curve
Tracing, Limit and Continuity, Differentiation of Functions. Derivative as Slope of
Tangent to a Curve and as Rate of Change, Application to Tangent and Normal,
Linearization, Maxima/Minima and Point of Inflexion, Taylor and Maclaurin
Expansions and their convergence. Integral as Anti-derivative, Indefinite
Integration of Simple Functions. Methods of Integration: Integration by
Substitution, by Parts, and by Partial Fractions, Definite Integral as Limit of a Sum,
Application to Area, Arc Length, Volume and Surface of Revolution.
Reference Material:
1. Swokowski, Olinick and Pence, Calculus and Analytical Geometry, 6th edition, 1994,
Brooks/Cole Publishers.
2. Howard Anton, Calculus, 7th edition. 2002, John Wiley and Sons (WIE).William E.
Boyce Richard C. Diprima, Calculus, John Wiley & Sons, ISBN: 0471093335.
3. Thomas Finny, Calculus and Analytical Geometry, 10th edition, John Wiley and Sons.
Course Name: Probability and Statistics
Course Structure: Lectures: 3, Labs: 0 Credit Hours: 3
Prerequisites: None
Objectives: To introduce the concepts of data analysis, presentation, counting
techniques, probability and decision making.
Course Outline: Introduction to Statistics, Descriptive Statistics, Statistics in
decision making, Graphical representation of Data Stem-and Lead plot, Box-Cox
plots, measures of central tendencies and dispersion, moments of frequency
distribution; Counting techniques, introduction to probability, sample space,
events, laws of probability, Conditional probability and Baye’s theorem with
application to random variable (Discrete and continuous) Binomial, Poisson,
Geometric, Negative Binomial Distributions; Exponential Gamma and Normal
distributions. Regression and Correlation, Estimation and testing of hypotheses,
use of elementary statistical packages for explanatory Data analysis.
Reference Material:
1. Ronald Walpole, Myers, Myers, Ye, “Probability & Statistics for Engineers &
Scientists”, 8th edition, 2008, Prentice Hall Publisher.
2. Lay L. Devore, Probability and Statistics for Engineering and the Sciences,
2003, Duxbury Publishers.
3. G. Cowan, Statistical Data Analysis, 1998, Clarendon, Oxford.

Course Name: Linear Algebra

Course Structure: Lectures: 3, Labs: 0 Credit Hours: 3
Prerequisites: None

Objectives: To provide fundamentals of solution for system of linear equations,

operations on system of equations, matrix properties, solutions and study of their
properties.
Course Outline: Vectors, Vector Spaces, Matrices & Determinants, Cofactor
and Inverse, Rank, Linear Independence, Solution of system of Linear systems,
Positive Definite matrix, Linear Transformations, Operations on matrices, Inner
products, orthgonality and least squares, Eigenvalue & Eigenvectors. Applications
to Systems of Equations and to Geometry, Singular Value Decomposition.
Reference Material:
1. Bernard Kolman, David Hill, Elementary Linear Algebra with Applications, 9 th
edition, Prentice Hall PTR, 2007.
2. Gilbert Strang, Strang, Brett Coonley, Andy Bulman-Fleming, Andrew Bulman-
Fleming, Strang's Linear Algebra And Its Applications, 4th edition, Brooks/Cole,
2005
3. Howard Anton, Chris Rorres, Elementary Linear Algebra: Applications Version,
 9th edition, Wiley, 2005.
4. David C. Lay, Linear Algebra and Its Applications, 2nd edition, Addison-Wesley,
2000.

Computing – General Education Courses

Course Name: English-I (Functional English)

Course Structure: Lectures: 3, Labs: 0 Credit Hours: 3
Prerequisites: None

Course Name: English – II (Technical and Report Writing)

Course Structure: Lectures: 3, Labs: 0 Credit Hours: 3
Prerequisites: None

Course Name: English – III (Communication Skills)

Course Structure: Lectures: 3, Labs: 0 Credit Hours: 3
Prerequisites: None
Course Name: Islamic & Pakistan Studies
Course Structure: Lectures: 3, Labs: 0 Credit Hours: 3
Prerequisites: None
Course Name: Computer Ethics
Course Structure: Lectures:3, Labs: 0 Credit Hours: 3
Prerequisites: None

Objectives: A Computing graduate as professional has some responsibilities

with respect to the society. This course develops student understanding about
historical, social, economic, ethical, and professional issues related to the
discipline of Computing. It identifies key sources for information and opinion about
professionalism and ethics. Students analyze, evaluate, and assess ethical and
professional computing case studies.

Course Outline: Historical, social, and economic context of Computing

(software engineering, Computer Science, Information Technology); Definitions of
Computing (software engineering, Computer Science, Information Technology)
subject areas and professional activities; professional societies; professional
ethics; professional competency and life-long learning; uses, misuses, and risks
of software; information security and privacy; business practices and the
economics of software; intellectual property and software law (cyber law); social
responsibilities, software related contracts, Software house organization

Resources:
1. Professional Issues in Software Engineering, M.F. Bott et al.

Computer Science – Core Courses

Course Name: Computer Organization and Assembly Language

Course Structure: Lectures: 2, Labs: 1 Credit Hours: 3
Prerequisites: Digital Logic Design
Objectives: The main objective of this course is to introduce the organization of
computer systems and usage of assembly language for optimization and control.
Emphasis should be given to expose the low-level logic employed for problem
solving while using assembly language as a tool. At the end of the course the
students should be capable of writing moderately complex assembly language
subroutines and interfacing them to any high level language.
Course Outline: Microprocessor Bus Structure: Addressing, Data and Control,
Memory Organization and Structure (Segmented and Linear Models), Introduction
to Registers and Flags, Data Movement, Arithmetic and Logic, Programme
Control, Subroutines, Stack and its operation, Peripheral Control Interrupts,
Interfacing with high level languages, Real-time application.
Objectives and Perspectives of Assembly Language, Addressing Modes,
Introduction to the Assembler and Debugger, Manipulate and translate machine
and assembly code, Describe actions inside the processing chip, Discuss
operations performed by an instruction set, Write a fully documented program,
Using an assembler of choice.
Labs:
Understanding processor internals, execution inside the CPU and basics of
Assembly language using a GUI based simulator like emu8086.
Reference Material:
1. Stallings, "Computer Organization & Architecture", 7th ed, Prentice HALL,
2006.
2. Irvine, Assembly Language for Intel-based Computers, 5th ed, Prentice Hall,
2007.
3. Computer Organization and Design, The Hardware/Software Interface, 4th ed,
by David A. Patterson and John L. Hennessy, 2008. Elsevier Publishers.

Course Name: Theory of Automata and Formal languages

Course Structure: Lectures: 3 Labs: 0 Credit Hours: 3
Prerequisites: Discrete Structures
Objectives: The course aims to develop an appreciation of the theoretical
foundations of computer science through study of mathematical & abstract
models of computers and the theory of formal languages. Theory of formal
languages and use of various abstract machines as ‘recognizers’ and parsing will
be studied for identifying/validating the synthetic characteristics of programming
languages. Some of the abstract machines shall also study as ‘Transducers’.
Course Outline: Finite State Models: Language definitions preliminaries,
Regular expressions/Regular languages, Finite automata (FAs), Transition
graphs (TGs), NFAs, Kleene’s theorem, Transducers (automata with output),
Pumping lemma and non regular language Grammars and PDA: Context free
grammars, Derivations, derivation trees and ambiguity, Simplifying CFLs ,
Normal form grammars and parsing, Decidability, Chomsky’s hierarchy of
grammars Turing Machines Theory: Turing machines, Post machine, Variations
on TM, TM encoding, Universal Turing Machine, Context sensitive Grammars,
Defining Computers by TMs.
Text Books/Reference Books:
1. An Introduction to Formal Languages and Automata, By Peter Linz, 4 th
edition, Jones & Bartlett Publishers, 2006
2. Theory of Automata, Formal Languages and Computation, By S. P. Eugene,
Kavier, 2005, New Age Publishers, ISBN (10): 81-224-2334-5, ISBN (13) :
978-81-224-2334-1.
3. John Hopcroft and Jeffrey Ullman, Introduction to Automata Theory,
Languages, and Computation, 2nd edition, 2001, Addison-Wesley.
4. Introduction to Languages and the Theory of Computation, By John C.
Martin3rd edition, 2002, McGraw-Hill Professional.

Course Name: Design and Analysis of Algorithms

Course Structure: Lectures: 3, Labs: 0 Credit Hours: 3
Prerequisites: Discrete Structure, Data Structures and Algorithms
Objectives: Detailed study of the basic notions of the design of algorithms and
the underlying data structures. Several measures of complexity are introduced.
Emphasis on the structure, complexity, and efficiency of algorithms.
Course Outline: Introduction; Asymptotic notations; Recursion and recurrence
relations; Divide-and-conquer approach; Sorting; Search trees; Heaps; Hashing;
Greedy approach; Dynamic programming; Graph algorithms; Shortest paths;
Network flow; Disjoint Sets; Polynomial and matrix calculations; String matching;
NP complete problems; Approximation algorithms.
Reference Material:
1. Introduction to Algorithms /2E, T. H. Cormen, C. E. Leiserson, and R. L. Rivest,
MIT Press, McGraw-Hill, New York, NY, 2001.
2. Algorithms in C++; Robert Sedgewick

Course Name: Artificial Intelligence

Course Structure: Lectures: 3 , Labs: 0 Credit Hours: 3
Prerequisites: Discrete Structures
Objectives: This course studies four main objectives of AI. Modelling the
environment by constructing computer representations of the real world. Perception
and reasoning - obtaining and creating information/knowledge to populate a
computational representation. Taking actions by using the knowledge of the
environment and desired goals to plan and execute actions. Learning from past
experience.
Course Outline: Artificial Intelligence: Introduction, Intelligent Agents. Problem-
solving: Solving Problems by Searching, Informed Search and Exploration,
Constraint Satisfaction Problems, Adversarial Search. Knowledge and reasoning:
Logical Agents, First-Order Logic, Inference in First-Order Logic, Knowledge
Representation. Planning and Acting in the Real World. Uncertain knowledge and
reasoning: Uncertainty, Probabilistic Reasoning, Probabilistic Reasoning over
Time, Making Simple Decisions, Making Complex Decisions. Learning: Learning
from Observations, Knowledge in Learning, Statistical Learning Methods,
Reinforcement Learning. Communicating, perceiving, and acting: Communication,
Probabilistic Language Processing, Perception and Robotics. Introduction to
LISP/PROLOG and Expert Systems (ES) and Applications.
Reference Material:
1. Artificial Intelligence: Structures and Strategies for Complex Problem Solving:
International Edition By George F. Luger, 6th edition: Pearson Education, 2008.
2. Artificial Intelligence: A Modern Approach, By Stuart Jonathan Russell, Peter
Norvig, John F. Canny, 2nd Edition, Prentice Hall, 2003.

Course Name: Computer Architecture

Course Structure: Lectures: 3, Labs: 0 Credit Hours: 3
Prerequisites: Digital Logic and Design
Objectives: Get a deeper understanding of how computers work, working
knowledge of various subsystems and the general principles that affect their
performance, analyze the performance of systems and quantify the performance
measurements, fundamentals of all technologies, and advanced architectural
features that boost the performance of computers.
Course Outlines: Fundamentals of Computer Design including performance
measurements & quantitative principles, principles of Instruction Set Design,
Operands, addressing modes and encoding, pipelining of Processors: Issues and
Hurdles, exception handling features, Instruction-Level Parallelism and Dynamic
handling of Exceptions, Memory Hierarchy Design, Cache Design, Performance
Issues and improvements, Main Memory Performance Issues, Storage Systems,
Multiprocessors and Thread Level Parallelism. Case Studies.
Resources:
1. Computer Architecture: A Quantitative Approach by Hennessy & Patterson,
Morgan & Kauffman Series (2006) Fourth Edition.
2. Computer Organization & Design : The Hardware/Software Interface By
Patterson & Hennessy, Morgan & Kauffman Series (2008) Fourth Edition.

Course Name: Compiler Construction

Course Structure: Lectures: 3, Labs : 0 Credit Hours: 3
Prerequisites: Theory of Automata and Formal Languages
Objectives: At the end of the course students should understand the overall
structure of a compiler, and will know significant details of a number of important
techniques commonly used. They will be aware of the way in which language
features raise challenges for compiler builders.
Course Outline: Compiler techniques and methodology. Organization of
compilers. Lexical and syntax analysis. Parsing techniques. Object code generation
and optimization, detection and recovery from errors. Contrast between compilers
and interpreters.
Reference Material:
1. Compilers: Principles, Techniques, and Tools By Alfred V. Aho, Ravi Sethi,
Jeffrey D. Ullman, Contributor Jeffrey D. Ullman ,Addison-Wesley Pub. Co., 2nd
edition,1987 Original from the University of Michigan
2. Modern Compiler Design, By Dick Grune, Henri E. Bal, Ceriel J. H. Jacobs,
Koen G. Langendoen, John Wiley, 2000.
3. Modern Compiler Implementation in C, By Andrew W. Appel, Maia Ginsburg,
Contributor Maia Ginsburg, Cambridge University Press, 2004.
4. Modern Compiler Design by Dick Grune, Henri E. Bal, Ceriel J. H. Jacobs, Koen
G. Langendoen, 2003, John Wiley & Sons.

Computer Science – Supporting Courses

Course Name: Multivariable Calculus

Course Structure: Lectures: 3, Labs: 0 Credit Hours: 3
Prerequisites: Calculus and Analytical Geometry
Objectives: The goals are to develop the skills to have ground knowledge of
multivariate calculus and appreciation for their further computer science courses.
Course Outline: Functions of Several Variables and Partial Differentiation.
Multiple Integrals, Line and Surface Integrals. Green’s and Stoke’s Theorem.
Fourier Series: periodic functions, Functions of any period P-2L, Even & odd
functions, Half Range expansions, Fourier Transform. Laplace Transform, Z-
Transform.
Reference Material:
1. James Stewart, Multivariable Calculus, 6th edition, 2007, Cengage Learning
publishers.
th
2. Swokowski, Olinick and Pence, Calculus and Analytical Geometry, 6 edition, 1994, Thomson
Learning EMEA, Ltd.
3. Bernard Kolman, William F. Trench, Elementary Multivariable Calculus, 1971,
Academic Press.
4. Howard Anton, Albert Herr, Multivariable Calculus, 5th edition, 1995, John
Wiley.

Course Name: Differential Equations

Course Structure: Lectures: 3, Labs: 0 Credit Hours: 3
Prerequisites: Calculus and Analytical Geometry
Objectives: Develop fundamental skills of solving ordinary differential equations,
and developing differential equations for real-world problems.
Course Outline: Ordinary Differential Equations of the First Order: Geometrical
Considerations, Isoclines, Separable Equations, Equations Reducible to
Separable Form, Exact Differential Equations, Integrating Factors, Linear First-
Order Differential Equations, Variation of Parameters. Ordinary Linear Differential
Equations; Homogeneous Linear Equations of the Second Order, Homogeneous
Second-Order Equations with Constant Coefficients, General Solution, Real
Roots, Complex Roots, Double Root of the Characteristic Equation, Differential
Operators, Cauchy Equation, Homogeneous Linear Equations of Arbitrary Order,
Homogeneous Linear Equations of Arbitrary Order with Constant Coefficients,
Non-homogeneous Linear Equations. Modelling of Electrical Circuits. Systems of
Differential Equations. Series Solutions of Differential Equations. Partial
Differential Equations: Method of Separation of variables, wave, Heat & Laplace
equations and their solutions by Fourier series method.
Reference Material:
1. Michael Greenberg, Advanced Engineering Mathematics, 1996, Prentice Hall
publishers.
2. Erwin Kreyzig, Advanced Engineering Mathematics, 7th edition, 1993, John Wiley &
Sons Inc.
3. Zill, Prindle, Weber and Schmidt, A First Course in Differential Equations,
1996, Brooks/Cole Publishing,
4. Dennis G. Zill, Michael R. Cullen. Differential Equations with Boundary-Value
Problems, 1996, Brooks/Cole Publishing,
5. C. H .Edwards, David E. Penney, Elementary Differential Equations With
Applications, 1993, Prentice Hall.
Course Name: Numerical Analysis
Course Structure: Lectures:3, Labs: 0 Credit Hours: 3
Prerequisites: Calculus and Analytical Geometry
Objectives: On completion of this unit, students will be able to demonstrate
programming proficiency using structured programming techniques to implement
numerical methods for solutions using computer-based programming techniques
.using Matlab for all methods. The course must serve the purpose of scientific
software development for science and engineering problems.
Course Outline: The concepts of efficiency, reliability and accuracy of a method.
Minimising computational errors. Theory of Differences, Difference Operators,
Difference Tables, Forward Differences, Backward Differences and Central
Differences. Mathematical Preliminaries, Solution of Equations in one variable,
Interpolation and Polynomial Approximation, Numerical Differentiation and
Numerical Integration, Initial Value Problems for Ordinary Differential Equations,
Direct Methods for Solving Linear Systems, Iterative Techniques in Matrix Algebra,
Solution of non-linear equations, Orthonormalization.
Reference Material:
1. Numerical Methods in Scientific Computing Germund Dahlquist and Åke Björck .

2. Numerical Methods for Scientific Computing : J.H. Heinbockel

3. Numerical Analysis: I.A. Khubaza
4. Numerical Analysis and Programming : Shan S Kuo
5. Numerical Analysis by Berden Fairs
6. Numerical Analysis by Gerald

Computer Science Elective Courses

Course Name: Computer Graphics

Course Structure: Lectures: 3, Labs: 1 Credit Hours: 4
Prerequisites: Object Oriented Programming , Visual Programming
Objectives: Study of various algorithms in computer graphics and their
implementation in any programming language.
Course Outline: Graphics hardware. Fundamental algorithms. Applications of
graphics. Interactive graphics programming — graph plotting, windows and clipping,
and segmentation. Programming raster display systems, Differential Line Algorithm,
panning and zooming. Raster algorithms and software — Scan-Converting lines,
 characters and circles. Scaling, Rotation, Translation, Region filling and clipping.
Two and three dimensional imaging geometry (Perspective projection and
Orthogonal projection) and transformations. Curve and surface design, rendering,
shading, colour and animation.
Labs:
Implementation of Computer Graphics algorithms using OpenGL with C++.
Reference Material:
1. Computer Graphics, Principles and Practice, J. D. Foley, A. van Dam, S. K.
Feiner and J. F. Hughes, Addison-Wesley ISBN: 0-201-12110-7.
2. Computer Graphics, F.S.Hill, Maxwell MacMillan ISBN: 0-02-354860-6.
1. 3. Interactive Computer Graphics: Functional, Procedural and Device-level
2. methods; Peter Burger and Duncan. F. Gillies; Addison-Wesley, (2003)

Course Name: Digital Image Processing

Course Structure: Lectures:2 Labs: 1
Credit Hours: 3
Prerequisites:
Objective: The aim of this module is to understand the main terms & concepts of
Information Systems & their applications in everyday business. The main objectives of
this module are to make business students aware of the increasing importance of IT,
computers and telecom and to manage IT systems in modern organisational structure.
Another important objective of this module is to learn about various information systems
used in industries and select the appropriate information system for the required
application. Restoration in the Presence of Noise Only–Spatial Filtering, Mean Filters,
Order-Statistics Filters, Adaptive Filters, Periodic Noise Reduction by Frequency
Domain Filtering, Bandreject Filters, Bandpass Filters, Notch Filters. Estimating the
Degradation Function, Estimation by Image Observation, Estimation by
Experimentation, Estimation by Modeling, Inverse Filtering, Minimum Mean Square
Error (Wiener) Filtering. Image Segmentation, Detection of Discontinuities, Point
Detection, Line Detection, Edge Detection, Edge Linking and Boundary Detection, Local
Processing, Global Processing via the Hough Transform.
Thresholding, The Role of Illumination, Basic Global Thresholding, Basic Adaptive
Thresholding, Local Thresholding, Thresholds Based on Several Variables.
Labs:
Implementation of image processing, image analysis and understanding algorithms
using MATLAB and/or OpenCV.

Course Name: Network Security

Course Structure: Lectures: 3 Labs: 0 Credit Hours: 3
Course Outlines: Introduction; Cryptology and simple cryptosystems;
Conventional encryption techniques; Stream and block ciphers; DES; More on
Block Ciphers; The Advanced Encryption Standard. Confidentiality & Message
authentication: Hash functions; Number theory and algorithm complexity; Public key
Encryption. RSA and Discrete Logarithms; Elliptic curves; Digital signatures. Key
management schemes; Identification schemes; Dial-up security. E-mail security,
PGP, S-MIME; Kerberos and directory authentication. Emerging Internet security
standards; SET; SSL and IPsec; VPNs; Firewalls; Viruses; Miscellaneous topics.

Text Books/Reference Books:

1. W. Stallings, Cryptography and Network Security, Prentice Hall PTR, Upper
Saddle River, NJ, 2003.
2. Kaufman, R. Perlman, M. Speciner, Network Security: Private Communication in
a Public World – Prentice Hall PTR, Upper Saddle River, NJ, 2002.
3. M. Bishop, Computer Security: Art and Science – Addison-Wesley, 2003.
4. Stinson, Cryptography: Theory and Practice, CRC Press, Boca Raton, FL, 1995.
5. Richard A. Mollin, An Introduction to Cryptography, Chapman and Hall/CRC,
2001.
6. B. Schneier, Applied Cryptography, John Wiley and Sons, NY, 1996.
7. A. Menezes, P. Oorshcot, and S. Vanstone, Handbook of Applied Cryptography,
CRC Press, Boca Raton, FL, 1997.

Course Name: Wireless Networks

Course Structure: Lectures: 3 Labs: 0 Credit Hours: 3
Course Outlines: This course covers fundamental techniques in design and
operation of first, second, and third generation wireless networks: cellular
systems, medium access techniques, radio propagation models, error control
techniques, handoff, power control, common air protocols (AMPS, IS-95, IS-136,
GSM, GPRS, EDGE, WCDMA, cdma2000, etc), radio resource and network
management. As an example for the third generation air interfaces, WCDMA is
discussed in detail since it is expected to have a large impact on future wireless
networks. This course is intended for graduate students who have some
background on computer networks.

Text Books/Reference Books:

1. Theodore S Rappaport, Wireless Communications.
2. David Tse, Fundamentals of Wireless Communications.
3. W. Stallings, “Wireless Communications and Networks”, Prentice Hall, 2002.
4. T.S. Rappaport, “Wireless Communications: Principles & Practice”, Second
Edition, Prentice Hall, 2002.
5. J. Schiller, “Mobile Communications”, Addison Wesley, 2000.
6. V.K. Garg, “IS-95 CDMA and cdma 2000”, Prentice Hall PTR, 2000.
7. J.P. Castro, “The UMTS Network and Radio Access Technology - Air Interface
 Techniques for Future Mobile Systems”, Wiley, 2001.
8. H. Holma and A. Toskala, “WCDMA for UMTS Radio Access for Third
Generation Mobile Communications”, John Wiley & Sons, 2001.
Region-Based Segmentation, Region Growing, Region Splitting and Merging

Course Name: Distributed Database System

Course Structure: Lectures: 3 (3,0) Credit Hours: 3
Prerequisites: Database Systems
Objectives: To clearly describe the difference of Centralized database and Distributed
database and enable the students to design/model a distributed database.
Course Outline: Introduction, Overview of relational DBMS and Normalization,
Distributed DBMS architecture, Distributed database design and Data Distribution
Strategies, Replication/Fragmentation, Distributed Transaction Management, Distributed
Query Processing, Distributed Concurrency Control, Distributed Data Security, Distributed
Database Recovery.
Reference Material:
1. Principals of Distributed Database Systems by Ozsu Tamer.
2. Database Systems by Thomas Connolly.

Course Name: Artificial Neural Networks

Course Structure: Lectures: 3 (3,0) Credit Hours 3
Prerequisites: Artificial Intelligence
Objectives: This course presents an overview of the theory and applications of artificial
neural network and fuzzy systems to engineering applications with emphasis on signal
processing and control. The objective of this course is on the understanding of various
neural network and fuzzy systems models and the applications of these models to solve
engineering problems.
Course Outline: Introduction Contexts for and Motivation Neural Networks: Artificial
Intelligence | Biological | Physics, Artificial Neural Network overview.
Supervised Learning: Single-Layer Networks , Perceptrons , Adalines Supervised Learning:
Multi-Layer Networks.
Multi-Layer Perceptrons (MLPs) , Backpropagation , Conjugate Gradient method ,
Levenberg-Marquardt (LM) method , Madalines , Radial-Basis Networks , Cascade-
Correlation Networks , Polynomial Networks , Recurrent Networks (Time series ,
Backpropagation through time , Finite Impulse Response (FIR) MLP ), Temporal
Differences method (TD).
Unsupervised Learning
Simple Competitive Networks: Winner-take-all | Hamming network , Learning Vector
Quantization (LVQ), Counterpropagation Networks (CPN) , Adaptive Resonance Theory
(ART) , Kohonen Self-Organizing Maps (SOMs) , Principal Component Analysis networks
(PCA)
Associative Models
Linear Associative Memory (LAM) , Hopfield Networks , Brain-State-in-a-Box , BSB) ,
Boltzmann Machines and Simulated Annealing , Bi-Directional Associative Memory (BAM)
Optimization Problems
Neural Network Approaches, Evolutionary Programming , Fuzzy logic and its connection to
NNs
Resources:
1. Neural Networks: A Comprehensive Foundation, Simon Haykin, Prentice Hall, Upper
Saddle River, NJ, SECOND EDITION, 1999
2. Artificial neural networks: an introduction, by Kevin L. Priddy, Paul E. Keller-Technology
& Engineering-2005
3. Neural networks: methodology and applications, by G. Dreyfus-computers-, 2005

Course Name: Simulation and Modeling

Course Structure: Lectures: 2, Labs: 1 Credit Hours: 3

Prerequisites: Probability and Statistics, Calculus

Objectives:

This course emphasizes the development of modeling and simulation concepts and
analysis skills necessary to design, program, implement, and use computers to solve
complex systems/products analysis problems regarding software engineering discipline.
The key emphasis is on problem formulation, model building, data analysis, solution
techniques, and evaluation of alternative designs/processes in complex systems/products.
Overview of modeling techniques and methods used in decision analysis, including Monte
Carlo simulation and systems dynamics modeling are presented.

1. To apply modern software packages to conduct analysis of real world data.

2. To understand the technical underpinning of modern computer simulation software.

3. The ability to apply the appropriate analytical technique to a wide variety of real world
problems and data sets.

4. To summarize and present the analysis results in a clear and coherent manner.

Course Outline:

Introduction to Simulation and Modeling, Discrete-Event Simulation, Simulation of a

Single-Server Queueing System, Alternative Approaches to Modeling and Simulations;
Review of Basic Probability and Statistics; Estimation of Means, Variances, and
Correlations, Confidence Intervals and Hypothesis Tests for the Mean, The Laws of Large
Numbers; Random number generators; Simulation of discrete, continuous probability
distributions and empirical distributions; tests on simulated distributions, rejection method,
simulation of multivariate distributions, correlations, and stochastic processes, simulation of
models of arrival processes, Poisson Processes, Nonstationary Poisson Processes, Batch
Arrivals, tests on generators, Markov- Chain Monte-Carlo simulations; Variance-Reduction
Techniques.

Resources:

1. A.M. Law and W.D. Kelton, “Simulation Modeling and Analysis”, McGraw Hill, 2000.

2. J. Banks, J.S. Carson and B.L. Nelson, “Discrete-event System Simulation”, Prentice
Hall International, 1994.
3. Mitrani, “Probabilistic Modeling”, Cambridge University Press, 1998.

4. Sheldon M. Ross, “Simulation and Modeling”, 2002.

5. Brian Ripley, “Stochastic Simulations”.

Course Name: Mobile Application Development

Course Structure: Lectures: 2, Labs: 1 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: Internet Programming

Course Structure: Lectures: 2, Labs: 1 Credit Hours 3
Prerequisites: None
Objectives:
This course is an extensive overview of the latest in Web Development. Students will learn
how to develop web pages having client side and server side.
HTML(Hypertext Markup Language)
a) Internet, Web and HTML Fundamentals
b) What is HTML
c) The World Wide Web and Web Servers
d) Working of Web Browsers
e) HTML’s Role on the Web
f) Way of launching the Web Site

Creating Static Web Pages with HTML

a) Creating a Web page and entering Text
b) Changing and Customizations
c) Display Text in List
d) Adding Graphics into Web Pages
e) Hypertext and Creating Links
f) Issuing Links with other HTML Tags

Advance HTML
a) Tables, Forms, Images
b) Frames
c) Multimedia Objects

Java Script
a) Data types
b) Control Structures
c) Object & Function
d) Event Handling

VB Script
Introduction, Data Types, Syntax, Controls, etc.

Active Server Pages, Personal Home Page, Common Gateway Interface(CGI)

Database Connectivity
a) Using ASP
b) Using CGI
c) Using PHP

Books:
1. Thomas A. Powell, HTML The Complete Reference, 2nd Edition, McGraw Hill, 1999.
2. Ann Navarro, Todd Stauffer, HTML by Example, 1st Edition, Que Corp, 1999.
3. Andrew Wooldrige, Mike Morgan, Mona Everett, Scott J. Walter, Special Edition
Using Java Script, Que Corp, 1997.

Course Name: System Programming

Course Structure: Lectures: 2, Labs: 1 Credit Hours: 3
Prerequisites: Operating Systems
Objectives: Demonstrate mastery of the internal operation of Unix system
software including assemblers, loaders, macro-processors, interpreters, inter-
process communication.
Course Outline: System Programming overview: Application Vs. System
Programming, System Software, Operating System, Device Drivers, OS Calls.
Window System Programming for Intel386 Architecture: 16 bit Vs 32 bit,
Programming, 32 bit Flat memory model, Windows Architecture. Virtual Machine
(VM)Basics, System Virtual Machine, Portable Executable Format, Ring O
Computer, Linear Executable format, Virtual Device Driver (V + D), New
Executable format, Module Management, COFF obj format 16 bit. (Unix) other
32-bit O.S Programming for I 386; Unix Binaryble format (ELF), Dynamic shared
objects, Unix Kernel Programming (Ring O), Unix Device Architecture (Character
& Block Devices), Device Driver Development, Enhancing Unix Kernel.
Reference Material:
1. The UNIX Programming Environment, B. Kernighan & R. Pike Prentice-Hall,
1984.
2. System Software, Leland L. Beck, Addison-Wesley Longmsan, 1990, ISBN:
0-201-50945-8.