OFFICE OF THE REGISTRAR

University of Malakand
At Chakdara Dir (Lower)
Khyber Pukhtunkhwa, Pakistan.
Aca1-m13/ 7a vo Phone: +92 945 762330
Fax: +92 945 763491
- 00.0 /3

NOTIFICATI N

ified for the information of all concerned that the Vice Chancellor, in anticipation of
m the relevant bodies, has approved the enclosed courses for MS/PH.D (in addition to
y approved courses for . MS/PH.D Computer Science), BS (CS) and BS (IT) with
effect.

page of the list of courses is duly signed by the undersigned. The detailed courses can be
from the office of the Incharge, Department of Computer Science & IT, University of
lakaad.

. issues with the approval of the Competent Authority.

nd:(Duly signed courses as stated above)

Deputy Registrar Academics

University of Malakand

$ IC Vice Chancellor, University of Malakand.

Deans, University of Malakand.
The Controller of Examinations, University of Malakand.
Incharge, Department of Computer Science IT, UOM.
Incharge, Department of Software Engineering, UOM.
Principals of the concerned affiliated colleges

Deputy. strar Academics

University of Malakag fi

V
:.dc51
ettA °

4,4
 University of Malakand
Department of Computer Science & Information Technology

UNDERGRADUATE CUARICULUM
BS (CS)
A Student majoring in Bachelor Studies in Computer Science BS (CS) must complete minimum of 132
Credit Hours courses, The courses list is as follows:

First Semester

Course F Title Cred.Hrs.

MT411 Calculus and Analytical Geometry 3-0
P11412 Physics 3-0 _...
EG413 Functional English 3-0
CS414 ]mrodtction to Information and Communication Technologies ICTs) 4 (3-1)
1541 t Islamiat 2-0
CS4i6 Program tng Fundamentals 4(3-1)
Total Semester Cred firs 19

Second Semester

Course Title Cred. Hrs.

CS421 Digital Logic Design 3-0
EG422 Technical and Report Writing 3-0
KT423 Statistics & Probability - 3-0
MT424 Discrete Mathematical Structures 3-0
CS425 Data Structures 3 (2-1)
EE426 Basic Electronics 3-0
Total Semester Cred Hrs 18

Third Semester

Corse Titie i Cred.Hrs.

EG431 Communication on & Presentation Skills 3-0
CS432 Object Oriented Programming 4(3-1)
CS433 Operating Systems 3.0
CS434 Introduction to Databases g(3-l)
PS435 Pak Studies 1 -0
MT436 Multivariate Calculus 3-0
Total Semester Cred firs 19

Fourth Semesterv-- --

Course 4 Title Cred.Hrs.

C5441 Database Administration 3-0
MT442 Linear Algebra & Applications 3-0
C5443 Computer Organization and Assembly Language: 4(3-1)
MT444 Differential Equations 3-0
C5445 Software Engineering-I 3-0
Total Semester Cred Hrs •. \:14 A i
 '. Fifth Semester
Cred.Hrs.
Course k Title
3-0
CS551 Data Communication and Networks
3-0
CS52 Artificial Intelligence
3-0
CS553 System Programming
4(3-1)
CS554 Advanced Oliect Oriented Pro _rarnmin
3-0
11.555 Numeric and Symbolic Computation
3-0
SE556 Software Engineering-II
19
Total Semester Cred firs

Sixth Semester
Cred.Hrs.
Course # Title 3-0
CS561 Theory of Automata and formal langua es
3-0
CS561 Analysis of Algorithms
3 (2-1)
CS563 Network Strategies
... 3-0
CS564 E-Commerce
4(3-1)
CS565 Advanced Internet Applications
_12:D
CS566 Computer Graphics
Total Semester Cred Hrs / 19

Seventh Semester
Cred Hrs
Course # Title
C8 571 Software Development Project _ . . 0-6
4 (3-1)
CS572 Web Technologies
3-0
CS573 Information Security
3-0
CS574 Computer Architecture
15
Total Semester Cred firs

Eighth Semester
Cred Hrs
Course # Title
3-0
CS581 Software Project Management
3-0
CS582 Professional Ethics
CS583 Systems and Network Administration
4(3-1) _
3-0
CS584 Compiler Construction
13
Total Semester Cred firs ..-- it

Note:

Total Credit Hours: 139

The courses and semester plan can be modified subject tq.the decision o ' of studies.

(14
Ottv

„a t 1
edet'`‘'.4
■6
GO'%S\

2
Time course code consists of two letters and three digits. The letters represent the

major area of the course. The left most digit is reserved for the level (4 for the first

two years and 5 for the last two years). The digit in the middle represents the semester

d the right most digit is for the serial number of the course.

CS = Computer Science

MT = Mathematics

EG = English

PS = Pak Studies

IS = Islamiat

BE = Electronics Engineering

PH = Physics

SE = Software Engineering

r\r j
(Acadetnics1
ei‘kar‘d
Assistailt ok

3
 University of Malakand
Department of Computer Scienee•& Information Technology

UNDERGRADUATE CURRICULUM
BS (CS)
A Student majoring in Bachelor Studies in Computer Science BS (CS) must complete minimum of 132
Credit Hours courses. The courses list is as follows:

First Semester

Course # Title Cred.Hrs.

MT411 Calculus and Analytical Geometry 3-0
PH4I2 Physics 3-0
EG413 Functional English 3-0
CS4 14 Introduction to Information and Communication Technologies (1CTs) 4 (3-1)
1S415 Islamiat 2-0
CS4 I 6 Programming Fundamentals 4(3-1)
Total Semester Cred Firs 19

Second Semester

Course # Title Cred.Hrs.

CS421 Digital Logic Design 3-0
EG422 Technical and Report Writing 3-0
MT423 Statistics & Probability 3-0
MT424 Discrete Mathematical Structures 3-0
CS425 Data Structures 3 (2-1)
EE426 Basic Electronics 3-0
Total Semester Cred firs 18

Third Semester

Course ft Title Cred.Hrs.

EG431 Communication & Presentation Skills 3-0
CS432 Object Oriented Programming 4(3- I )
CS433 Operating Systems 3-0
CS434 Introduction to Databases 4 3:1)
PS435 Pak Studies 2-0
MT436 Multivariate Calculus 3-0
Total Semester Cred Hrs 19

Fourth Semester

Course # Title Cred.Hrs.

CS441 Database Administration 3-0
MT442 Linear Algebra & A2plications 3-0
CS443 Computer Organization and Assembly Language 4(3-I)
M1444 Differential Equations 3-0
CS445 Software Engineering-I * 3-0
Total Semester Cred firs ric\ 16

f\rj‘
ics1
(Acade tn
ant Registrar
taa04,7nci
ASsis
■Ylivetsitq 1
 Fifth Semester

Course # Title Cred.Hrs.

CS551 Data Communication and Networks 3-0
CS552 Artificial Intelligence 3-0
CS553 System Programming 3-0
CS554 Advanced Object Oriented Programming 4(3- I)
MT555 Numeric and Symbolic Computation 3-0
SE556 Software Engineering-11 3-0
Total Semester Cred Hrs 19

Sixth Semester

Course # Title Cred.Firs.

CS561 Theory of Automata and formal languages 3-0
CS562 Analysis of Algorithms 3-0
CS563 Network Strategies 3 (2-1)
CS564 E-Commerce 3-0
CS565 Advanced Internet Applications 4(3-1)
CS566 Computer Graphics 3 (2-1)
Total Semester Cred Hrs 19

Seventh Semester

Course # Title Cred Hrs

CS571 Software Development Project 0-6
CS572 Web Technologies 4 (3-1)
CS573 Information Security 3-0
CS574 Computer Architecture • 3-0
Total Semester Cred Hrs 15

Eighth Semester

Course # Title Cred Hrs

CS581 Software Project Management 3-0
CS582 Professional Ethics 3-0
CS583 Systems and Network Administration 4(3-1)
CS584 Compiler Construction 3-0
Total Semester Cred lirs 13

Note:

Total Credit Hours: 139

The courses and semester plan can be modified subject to the decision of board of studies.

\\i C3dertliCS)
RePttat :\a1alcant%
Assistant ot 1■
1,0VeISM

2
Course Code Details

Flux course code consists of two letters and three digits. The letters represent the

major area of the course. The left most digit is reserved for the level (4 for the first
two years and 5 for the last two years). The digit in the middle represents the semester

and the right most digit is for the serial number of the course.

CS = Computer Science

MT = Mathematics

EG = English

PS = Pak Studies

IS = Islamiat

EE = Electronics Engineering

PH = Physics

SE = Software Engineering
 Computing — Requirements for Bachelor Degree Programs
Required Computing Courses
Knowledge Area Credit hours
Computing Core Areas 40
Supporting Sciences 12
General Education 16
Total 68/130

Computing — Core Courses (40 Credits Hours)

Required Computing Courses

Code Preq Course Title Credit Proposed
Hours Semester
CS - Introduction to Information and 4 (3-1)
Communication Technologies(ICTs)

2 CS - Programming Fundamentals 4 (3-I)

CS 2 Object Oriented Programming 4 (3-1) 3
CS - Discrete Mathematical Structures 3 (3-0) 2
I

5 CS 2 Data Structures 3 (3-0) 2

. 6 CS 1 3 (3-0) 2
Digital Logic Design

7 CS 5 Operating Systems 3 (3-0)

8 CS 5 Introduction to Databases 4 (3-1) 3
9 CS 5 3 (3-0) 4
Software Engineering-1
10 CS 7 Data Communication and 3 (3-0)
Networks
11 CS ' Senior Design Project 6 (0-18) 1 7
(40/130)
I

Computing — Supporting Sciences (12 Credits Hours)

Required Supporting Courses

Code Preq Course Title
Credit I Proposed
Hours I Semester
12 MT 3 (3-0)
Calculus and Analytical
Geometry
Statistics and Probability 3 (3-0) 2
MT Linear Algebra and Applications 3 (3-0) 4
15 PH (3-0)
Physics (Electromagnetism)
(12 /130)

111
,r iAc.0I 's rc6cA
lo
4
 Computing — General Education (15 Credits Hours)
Required General Education
Courses
# Code ' Preq 1 Course Title Credit Proposed
hours Semester
EG - Functional English 3 (3-0) 1
t.- -
2 EG - 'Technical and Report Writing 3 (3-0) 2

' 3 EG - I Communication and Presentation Skills 3 (3-0) 3

4
4 PK - Islamic and Pakistan Studies 4 (4-0) 1,3
5 SS - Professional Practices 3 (3-0)
(16/130)

cadellON
■ ■
aikt
.:f,ksv
AsOtets elt5\bc>0°.:<

5
 Computing — Detail of Courses

Core Courses (40 Credits Hours)

Course Name: introduction to Information and Communication Technologies (ICTs)

Course Structure: Lectures: 3 / Labs: 3 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.
Reference Material:
Computers: Information Technology in Perspective, 12/e: Larry Long and Nancy
Long
An Invitation to Computer Science, 5/e: Schneider and Gersting, Brooks/Cole
Thomson Learning, 2000.
Computer Science: An overview of Computer Science, Sherer.

Course Name: Programming Fundamentals

Course Strueto re: Lectures: 3 / Labs: 3 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: 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.
Reference Material:
Program Design with Pseudo-code, Bailey and Lundgaard, Brooks/Cole Publishing.
1988
Simple Program Design: A step-by-step approach, 5/e, Lesley Anne Robertson,
i ISBN: 0-619-16046-2 0 2004.

rkssistaotiIscS‘stor qxcaOecrocs1
ofc
\y(<%.40,-P...;

6
Course Name: Object Oriented Programming
Course Structure: Lectures: 3/ Labs: 3 I Credit Hour,: 4
Prerequisites: Introduction to Computing, Programming Fundamentals
Objectives: The course aims to focus on object-oriented concepts, analysis and
software development.
Course Outline: Evolution of Object Oriented (00), 00 concepts and principles,
problem solving in 00 paradigm, 00 program 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
Reference Material:
Understanding Object Oriented Programming, Budd, Addison Wesley.
Java: How to Programme, 5/e, Deitel and Deitel, Prentice Hall, 0131016210/
0131202367 International Edition,
C++: How to Programme, Deitel and Deitel, 4/e, Pearson.
Thinking in C+ + , 2nd Edition, Bruce Eckel, Prentice Hall.

Course Name: Data Structures

Course Structure: Lectures: 2 / Labs: 3 Credit Hours: 3
Prerequisites: Object Oriented Programming
Objectives: The course is designed to teach students structures and schemes, which
allow them to write programs to efficiently manipulate, store, and retrieve data.
Students are exposed to the concepts of time and space complexity of computer
programs. '
Course Outline: Introduction to data structures; Arrays, Stacks, Queues, Priority
Queues, Linked Lists. Trees, and Graphs. Recursion, sorting and searching
algorithms, Hashing, Storage and retrieval properties and techniques for the various
data structures. Algorithm Complexity, Polynomial and Intractable
Algorithms, Classes of Efficient Algorithms, Divide and Conquer, Dynamic, Greedy
Reference Material:
Data Abstraction and Problem Solving with C++, 2nd ed, Frank M Carrano, Paul
Heiman, Robert Verof Addison-Wesley, 1998.
Data Structures and Algorithms (SAMS teach yourself), Lafore, Sams Publishing,
1999.
Fundamentals of Data Structures in C++, Horowitz, Salmi, and Mehta, Computer
Science Press, 1995.
Data Structures in JA VA, Standish, Addison Wesley, 2000

7
Course Name: Discrete Mathematical 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
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
invaria, composition); relations (reflexivity, symmetry, transitivity, equivalence
relations); sets (Venn diagrams, complements, Cartesian products, power sets);
pigeonholerix
p Lti inahty___
and co m ____
Reference Material:
Discrete Mathematics and Its Applications, 5th edition; by Rosen; McGraw-Hill; 0-0 7-
1 242434-6.

[Course Name: Digital Logic Design

Course Structure: Lectures: 3 / Labs: 0 Credit Hours: 3
Prerequisites: Introduction to ICTs
Objectives: This course introduces the concept of digital logic, gates and the digital
circuits. Further, it focuses on the design and analysis combinational and sequenti
circuits. It also serves to familiarize the student with the logic design of basic compute
hardware components.
Course Outline: Overview of Binary Numbers, Boolean Algebra, switching a1gebr -a-,1
and logic gates, Karnaugh Map and Quin-McCluskey methods, simplification of
Boolean functions, Combinational Design; two level NAND/NOR implementation,
Tabular Minimization, Combinational Logic Design: adders, subtractors, code
converters, parity checkers, multilevel NAND/NOR/XOR circuits, MSI Components ,
design and use of encoders, decoders, multiplexers, BCD adders, and comparators,
Latches and flip-flops, Synchronous sequential circuit design and analysis, Registers ,
synchronous and asynchronous counters, and memories, Control Logic Design, Wired
logic and characteristics of logic gate families, ROMs, PLDs, and PLAs, State Reduction
and good State Variable Assignments, Algorithmic State Machine (ASM) Charts,
Reference Material:
Digital Design, 2nd Ed., M. Morris Mano, Prentice Hall, 1991.
Practical Digital Logic Design and Testing, P K Lala, Prentice Hall, 1996.

(P,cadeolicli
INP12:1,?,%6
As5istant ge,S.7,trzlr
ok
‘1000`1
8
 , E, r 'same: Introduction to Databases
ourse Structure: Lectures: 3 / Labs: 3 Credit Hours: 4
Prerequisites: Data Structures
), dives: The course aims to introduce basic database concepts, different data models, data
storageand retrieval techniques and database design techniques. The course
primarily focuses on relational data model and DBMS concepts.

ourse Outline: Basic database concepts; Entity Relationship modelling, Relational data mode
land algebra, Structured Query language; RDBMS; Database design, functional dependencie
land normal forms; Transaction processing and optimization concepts; concurrency contro l'
recovery techniques; Database recovery techniques; Database security and authorization.
Group Project implementing a database. Physical database design: Storage and fil
!structure; indexed files; hashed files; signature files; b-trees; files with dense index; files wi
Ivariable length records; database efficiency and tuning Data Warehousing and Data Miningj
'nerging Database Technologies and Applications.
Reference Material:
)otabase Systems, C.J.Date, Addison Wesley Pub. Co. (2004).
'Database Systems: A Practical Approach to Design, Implementation and Management,
: R.Connolly and P.Begg, Addison-Wesley Pub. Co (2003).
Fundamentals of Database Systems, 3/E, Elmasri and Navathe, Addison-
:Wesley, ISBN: 0-201-74153-9.

ourse Name: Operating Systems

("nurse Structure: Lectures: 3 / Labs: 0 i Credit Hours: 3
Prerequisites: Data Structures
objectives: The objective of this course is to give students knowledge of construction and
%, oiling of Operating systems, to enable them to understand management and sharing
,
2computer resources, communication and concurrency and develop effective an
. tficient applications and also to appreciate the problems and issues regarding multi-user.
..:it[titasking, and distributed systems.
course Outline: History and Goals, Evolution of multi-user systems, Process and CPU
anagement, Multithreading, Kernel and User Modes, Protection, Problems of cooperativ
-rocesses, Synchronization, Deadlocks, Memory management and virtual memory, Relocation,
temal Fragmentation, Paging and Demand Paging, Secondary storage, Security an
':otection, File systems, I/O systems, Introduction to distributed operating systems. Scheduling
,1:J dispatch, Introduction to concurrency.Lab assignments involving different single and
ul.tithreaded OS algorithms.
R(ference Material:
Applied Operating Systems Concepts, 6th Edition, Silberschatz A., Peterson, &
Galvin P.C. 1998.
',Modern Operating Systems, 2nd Edition, Tanenmaum A.S., 2001.

ics)
tAcades
vikioltitPtS
AssIstv ok 9
nurse Name: Data Communication and Networks
Course Structure: Lectures: 3 / Labs: 0 Credit Hours: 3
Prerequisites: Operating Systems
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 modem 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
Intemetworking, Routing, Bridging, Transport layer protocols TCP/IP, UDP. Network security
issues.Programming exercises or projects involving implementation of protocols a t
different layers.
Reference Material:
introduction to Computer Networks, Tanenbaum
Unix Network Programming, Richard Stevens
Computer networks: a systems approach, Larry Peterson, Bruce Davie, Princeton Univ.
Princeton.
Computer Networking: A Top-Down Approach Featuring the Internet, 2/e,
James F Kurose, Keith W Ross, Addison Wesley 2003. ISBN: 0-201-97699-4.

Course Name: Software Engineering-I

ou se Structure: Lectures: 3 / Labs: 0 I Credit Hours: 3
Prerequisites: Data Structures
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.

ourse Outline: Introduction to Computer-based System Engineering; Project Management ;

Specification; Requirements Engineering, System Modelling; Requirements Software
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:
Software Engineering: A Practioner's Approach, Roger Pressman, McGraw-Hill, 2001.
Object-Oriented Software Engineering, Stephan Schach, Irwin, 1999.

icsy
Academ
(
,s0 VMP
10
 Computing-Supporting Sciences (12 Credits Hours)

[Course Name: Calculus and Analytic Geometry

Course Structure: Lectures: 3 / Labs: 0 Credit Hours: 3
Prerequisites: None
Objectives: To build the basic 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:
Calculus and Analytical Geometry By Swokowski, Olinick and Pence.
Calculus, H. Anton, John Wiley and Sons (WIE), ISBN: 0471572608.
Calculus, William E. Boyce Richard C. Diprima, John Wiley & Sons.

Course Name: Statistics and Probability

Course Structure: Lectures: 3 / Labs: 0 Credit Hours: 3
rerequisites: None
Objectives: To introduce the concept of statistics, randomness and probability and build on these
concepts to develop tools and techniques to work with random variables
Course Outline: Introduction to Statistics, Descriptive Statistics, Statistics in decision making.
praphical representation of Data Stem-and Lead plot, Box-Cox plots, Histograms and Ogive,
pleasures of central tendencies, dispersion for grouped and tmgrouped Data, Moments of
'requency distribution; examples with real life, use of Elementary statistical packages for
explanatory Data analysis. Counting techniques, definition of probability with classical and
relative frequency and subjective approaches, sample space, events, laws of probability. General
;Probability Distributions, Conditional probability and Bayes theorem with application to Random
variable (Discrete and continuous) Binomial, Poisson, Geometric, Negative Binomial
)Distributions; Exponential Gamma and Normal distributions. Regression and Correlation.
keference Material:
[Introduction to Statistics, Walpole, 1982 Prentice Hall, ISBN: 0024241504.
jtStatistical Data Analysis, G. Cowan G, 1998, Clarendon, Oxford.

4vances in Statistical Analysis and Statistical Computing III Mariano R (Ed.), (1993),
JAI Press, Greenwich, Conn.

04. 36011C_
S)

.,(\ec 000
Assist2A'P,F3
11
course Name: Physics
Course Structure: Lectures: 3 Labs: 0 Credit Hours: 3
Prerequisites: None

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,
.nduced current and their applications, definitions of the values of AC signals (Average and
RMS Values), Electric and Magnetic circuits: Electric current, resistance, Ohm's Law, simple
esistive circuits (series and parallel), Kirchoff laws, Network theorems (DC analysis), RC and
12.1_, circuits. Fundamentals of Semiconductor physics: Band theory, semiconductors (intrinsic
and extrinsic), pn junction, pn- junctions as a rectifier.

Reference Material:
University Physics by Freedman and Young (10 th and higher editions),
plege Physics by Resnick, Halliday and Krane (6 th and higher edition)

nurse Name: Linear Algebra and Applications

Course Structure: Lectures: 3 / Labs: 0 Credit Hours: 3
((wise Outline: Vectors, Vector Spaces, Matrices & Determinants, Cofactor and Inverse,
Rank, Linear Independence, Solution of Linear systems, Gaussian Elimination, Positive Definite
matrix, Linear Transformations, Operations on matrices, Inner products, Eigenvalues &
Eigenvectors. Applications to Systems of Equations and to Geometry.
Reference Material:
1 :c1, !.,1. !)avid C Lay, Pearson Addison Wesley, 1999, ISBN: 0201660369

Computing-General Education (16 Credits Hours)

Course Name: Functional English

Course Structure: Lectures: 3 / Labs: 0 I Credit Hours: 3
Prerequisites: None
Objectives: To develop good English writing, language usage and reading skills.

CUurse Outline: Principles of writing good English, understanding the composition

process: writing clearly; word, sentence and paragraph. Comprehensio
and expression. Use of grammar and punctuation. Process of writing, observing audiene
analysis, collecting, composing, drafting and revising, persuasive writing, reading skill
1 li§tening, skills and comprehension, skills for taking notes in class, skills for exams.

Reference Material: Warriner's English Grammar and composition, John E. Warriner

12
Cw.irse Name: Communication and Presentation Skills
arse Structure: Lectures: 3 / Labs: 0
,
i Credit Hours: 3
Prerequisites: None
Objectives: To develop good English writing, language usage and reading skills. To appreciate
the importance of business communication and to develop understanding of communication
concepts, principles, theories and problems. To develop good oral communication and
-presentation skills.

ourse Outline: Principles of writing good English, understanding the composition process:
writing clearly; words, sentence and paragraphs. Comprehension and expression. Use of
grammar and punctuation. Process of writing, observing, audience collecting, composing,
drafting and revising, persuasive writing, reading skills, listening skills and comprehension,
skills for taking notes in class, skills for exams. Business communications; planning messages,
writing concise but with impact. Letter formats, mechanics of business, letter writing, letters, ,
memo and applications, summaries, proposals, writing resumes, styles and formats, oral
communications, verbal and non-verbal communication, conducting meetings, small group
communication, taking minutes. Presentation skills; presentation strategies, defining the
objective, scope and audience of the presentation, material gathering material organization
strategies, time management, opening and concleding, use of audio-visual aids, delivery and
presentation.

Reference Material:
Business English, Vawdrey, Stoddard, Bell.

se Name: Technical and Report Writing

t. nurse. Structure: Lectures: 3 / Labs: 0 Credit Hours: 3
Pr erequisites: None
Objectives: To develop efficient literature survey, analysis, report writing and document
designing skills.
ourse Outline: Overview of technical reporting, use of library and information gathering, ,
..Jministering questionnaires, reviewing the gathered information. Technical exposition; topical
arrangement, exemplification, definition, classification and division, casual analysis, effective
exposition, technical narration, description and argumentation, persuasive strategy. Organizing
information and generation solution: brainstorming, organizing material, construction of the
formal outline, outlining conventions, electronic communication, generation solutions. Polishing
‘tyle: paragraphs, listening sentence structure, clarity, length and order, pomposity, empty
words, pompous vocabulary, document design: document structure, preamble, summaries,
abstracts, table of contents, footnotes, glossaries, cross-referencing, plagiarism, citation and
!bibliography, glossaries, index, appendices, typesetting systems, creating the professional
report; elements, mechanical elements and graphical elements. Reports: Proposals, progress
reports, Leaflets, brochures, handbooks, magazines articles, research papers, feasibility reports,
project reports, technical research reports, manuals and documentation, thesis. Electronic
klocuments, Linear verses hierarchical structure documents.
Material:
Refi: relict!
ireentield, T., Research Methods, Guidance for Postgraduates, Aril 996.

13
c`‘cs1
( NcOg
W‘,-.
tet
Asststives;':
•
'"%?‘‘62°
.Course Name: Islamiat & Pak Studies
(Course Structure: Lectures: 4 / Labs: 0 I Credit Hours: 4
Prerequisites: None
Objectives: To impart an understanding of the fundamental principles and teachings of Islam
through study of selected verses of the Quran and Prophetic Sayings. Important facets of the
Prophet's life and salient, features of Islamic Civilization. To provide appreciation of other
prominent religions, systems of ethics and cultures to prepare students to survive in
international and multicultural work place. To take an analytical view in the history and
development of Muslim society and culture in the sub-continent, emergence of Pakistan and its
constitutional development. To develop an appreciation of the issues and challenges currently
being faced in Pakistan. The strengths of its people and strategies to deal with the impediments
to progress. International relations of Pakistan
Course Outline: Fundamentals of Islam. (Aqaid, Ibadat, Islamic Dawah etc.); Ethical values of
Islam; Ser ah of the Holy Prophet (PBUH); Islamic Civilization and its effects on humanity.
Study of other prominent world religions and ethical systems in comparison with Islamic
viewpoint. Multicultural societies. Historical ba-ckground of Pakistan: Muslim society in. Indo-
Pakistan, the movement led by the societies, The downfall of Islamic society, The
establishment of British Raj- Causes and consequences. Political evolution of Muslims in the
twentieth century: Sir Syed Ahmed Khan; Muslim League; Nehru; Allama lqbal: Independence
Movement; Lahore Resolution; Pakistan culture and society, Constitutional and Administrative
issues, Pakistan and its geo-political dimension, Pakistan and International Affairs, Pakistan and
he challenges ahead.
Reference Material:
Chaudaty M All ,The Emergence of Pakistan, 1967,
K.KAziz,The making of Pakistan. 1976.

Course Name: Professional 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
Outline: Historical, social, and economic context of Computing (software engineering,
Computer Science, Information Technology); Definitions of Computing (software engineering, I
Computer Science, Information Technology) subject areas and professional activities;
rofessional societies; professional ethics; professional competency and life-long learning; uses,
tsuses, 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:
Professional Issues in Software Engineering, M.F. Bott et al.

tiv;a 6critst10‘1
i

A%\fokalca"
3 14
AsSist 11t•
 Courses for BS program

Computing Additional/Core Requirements

Required Computer Science

Courses
# Code Preq Course Title Credit Proposed 1
hours Semester
--i
12 CS 2 Computer Organization and
4 (3-1) 4
Assembly Language
13 CS Theory of Automata & Formal 3 (3-0) 6
Languages

I
6
<3.v-■

CS Analysis of Algorithms 3 (3-0) 1

I
t

CS Artificial Intelligence 3 (3-0) 1 5

16 CS 12 System Programming 3 (3-0) 5

17 CS 5 Numerical and Symbolic 3 (3-0) t 7
Computation (19/130)

Elective Computer Science Courses

(Not Limited to the List below)
Area Course
18 CS Numerical Nunterical 3 (2-3)
Computation Computing
19 CS 3 (2-3) 6
Computer Computer
Graphics Graphics
20 , CS Software 3 (3-0)
Software
Engineering Engineering-II
21 CS Languages and Compiler 3 (2-3) 7
Translators Construction
22 CS 3 (2-3) 4
Principles of
Programming
Languages
23 CS Computer/ Data 3 (3-0) 6
Communication Communication
4 CS Networks 3 (2-3)
Distributed
Computing
25 CS Data and Network 3(3-0) 7
Security
26 CS Wireless Networks 3(2-3)
27 CS Visual Visual 3 (2-3) 7
Programming Programming

•
15
28,
29
CS Computer
rcture. ,..
r inpuier Architecture 3(3-0)

3(3-0)

Microprocessor
Interfacing

30 CS Signal Processing 3(3-0)

Digital Signal
Processing

14 CS 3(3-0
Digital Image
Processing

32 CS eb E gineerIng Web Engineering 3 (3-0) 5

Rich Internet 4(3-1) 5
33 Applidations
34 :, CS ystems Software 3 (3-0) 7
System
Programming
35 CS Database Systems 3 (3-0)
Distributed
Database Systems
I 36 CS 3(3-0) 6-7
Human Computer Human Computer
Interaction (I ICI) Interaction

(21/130)

dernic0
kAca 4
0.2010t
ttVietiM
t)

16
Computing Requirements-Supporting Sciences 12 Credit Hours
(Refer to computing part)

Required Supporting Courses

5 I PH 38 Physics - 11 3 (3-0) 4
61 ST Multivariate Calculus 3(3-0) 4
71 ST Differential Equations 3 (3-0) 5
(9/130)

Computing Requirements-General Education 12 Credit Hours (Refer to

Computing part)

University Electives-Recommended Courses (Not Limited to the List

below)
46 MG - Financial Accounting
47 MG i - Financial Management 3 (3-0) 4
.
48 MG i - Human Resource Management 3 (3-0) 5
--,-
49 MG , - Marketing 3 (3-0) 6
50 SS - Economics 3 (3-0) 7
51 PS - Psychology 3 (3-0) 6
52 SS - International Relations 3 (3-0) 7
53 SS - Foreign Language (French, 3 (3-0) 7-8
German, etc.)
54 SS - Philosophy 3(3-0) 6-8

(18/ 130)

17
 BS Computer Science Courses (Required/Additional Core)

Course Name: Computer Organization and Assembly Language

Course Structure: Lectures: 3 / Labs: 3 I Credit Hours: 4
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
nterfacing them to any high level language.
('nurse Outline: Objectives and Perspectives of Assembly Language,
Microprocessor Bus Structure: Address, Data and Control, Memory
Organization and Structure (Segmented and Linear Models), Addressing Modes,
Introduction to the Assembler and Debugger, Introduction to Registers and
Flags, Data Movement, Arithmetic and Logic, Program Control, Subroutines, Stack
,

and its operation, Peripheral Control Interrupts, Interfacing with high level languages,
Real-time application.
Reference Material:
Assembly Language for Intel-Based Computer, Third Edition, 1999, by Kip R. Irvine.
Prentice-Hall Publishing, 1999

Course Name: Theory of Automata and Formal Languages

Course Structure: Lectures: 3 / Labs: 0 I Credit Hours: 3
Prerequisites: Discrete Mathematical 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 offormal languages and use of various
abstract machines as 'recognizers' and parsing will be studied for identifying or
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, Push-down Automata, Pumping lemma and non-context free languages,
,Decidability, Chom sky's hierarchy of grammars Turing Machines Theory: Turing
!machines, Post machine, Variations on TM, TM encoding, Universal Turing Machine,.
Context vnsitive Grammars Definine
Reference Material:
,Introduction to Computer Theory, Denial Cohen, John Wiley & Sons, Inc.
Introduction to Automata Theory, Languages and Computation, J Hoperaft, D.
Uliman.
Languages and Machines, An Into to the Theory of Comp. Sc., 2/e Thomas A.
Sudkamp, Addison Wesley.

CD
Assistant Registrar (Academica
alcand
18

al
c
UnW e cs1^
 l arse Name: Analysis of Algorithms
(

(Mousy Structure: Lectures: 3 / Labs: 0 3 Credit Hours: 3

Prerequisites: Discrete Mathematical Structures, Data Structures
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:
loroduction to Algorithms, T. H. Cormen, C. E. Leiserson, and R. L. Rivest, MIT

Course Name: Artificial Intelligence

'course Structure: Lectures: 3 / Labs: 0 E Credit Hours: 3
Prerequisites: Discrete Mathematical Structures
Objectives: This course focuses on the set of computational tools and
techniques, which mimic the human decision-making process and capability.
Course Outline: Introduction to Common Lisp. AI classical systems: General
Problem Solver, rules, simple search, means-ends analysis. ELIZA, pattern
matching, rule based translators, OPS-5. Knowledge Representation: Natural
language, rules, productions, predicate logic, semantic networks, frames, objects,
scripts. Search: Depth first search, breadth first search, best first search, hill
climbing, min-max search, A* search. Symbolic Mathematics: student, solving
algebra problems, translating English equations, solving algebraic equations,
simplification rules, re-write rules, meta-rules, Macsyma, PRESS, ATLAS. Logic
Wogramming: Resolution, unification, horn-clause logic, Prolog, Prolog
programming. Sample case studies of shells and Knowledge Based Systems. A
rief appreciation of state of the art computational techniques like neural
'networks, genetic algorithm, fuzzy sets.

Reference Material:
I: uncial Iraeligence by Luger, 4th edition, Pearson Education.

(Academics)
Assi taut Registrartitatalca nd 19
Oniverstty of
Course Name: Numerical and Symbolic Computation
Course Structure: Lectures: 2 / Labs: 3 Credit Hours: 3
Prerequisites: Data Structures
Ohjectives: On completion of this unit, students will be able to demonstrate
programming proficiency using structured programming techniques in suitable
!programming languages and implement numerical solutions using computer-
based techniques.
Course Outline: Mathematical Preliminaries, Solution of Equations in one
variable, Interpolation and Polynomial Approximation, Numerical
Differentiation and Integration, Initial Value Problems for Ordinary Differential
Equations, Direct Methods for Solving Linear Systems, Iterative Techniques in
Matrix Algebra, Solution of non-linear equations. Approximation Theory.
Eigenvalues and Eigenvector computation.
Reference Material:
Elements of Numerical Analysis, Dr. Faiz, M. Afzal

Course Name: System Programming

Course Structure: Lectures: 3 / Labs: 0 Credit Hours: 3
Prerequisites: Computer Organization and Assembly Language
Objectives: Demonstrate mastery of the internal operation of Unix system
'software including assemblers, loaders, macro-processors, interpreters, inter-
)cess communication.
Course Outline: System Programming overview: Application Vs. System
Programming, System Software, Operating System, Device Drivers, OS Calls.
Window System Programming for Inte1386 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 0 Computer, Linear Executable format, Virtual Device Driver (V D),
• Executable format, Module Management, COFF obj format 16 bit. (Unix)
er 32-bit 0.S Programming for I 386; Unix Binaryble format (ELF),
Ramie shared objects, Unix Kernel Programming (Ring 0), Unix Device
Architecture (Character & Block Devices), Device Driver Development,
Enhancing Unix Kernel.
Reference Material:
UNIX Programming Environment, B. Kernighan & R. Pike Prentice-Hall, 1984.
Jystem Software, Leland L. Beck, Addison-Wesley Longmsan, 1990, ISBN: 0-201-
c0945-8.

20
11"
fA
e''.1,0,
,ikAar.°
 BS Computer Science Courses (Elective)

Course Name: Compiler Construction

Course Structure: Lectures: 3 / Labs: 0 F
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:
Compiler Design and Construction, by Alfred V. Aho, Ravi Sethi, Hardcover 2nd
edition,1987, Van Nostrand Reinhold; ISBN: 0317636367.

u rse Name: Systems and Network Administration

('mirk Structure: Lectures: 3 / Labs: 3 Credit Hours: 4
Prerequisites: Computer Networks, Operating System
Objectives: This course on Systems & Network Administration focuses on to
):(,vide theoretical & practical knowledge required to perform administration of
.inputer systems and networks.
• , aware design and development.
()use Outline: Describe the role/scope of a system and network administrator,
tall various operating systems, Manage computer systems and undertake
.rational tasks, Provide network services to users, Identify security policies and to
)!y necessary preventive & corrective steps to secure a system/network and apply
lipting tools for automating system administration

Reference Material:
Practice of System and Network Administration, Second Edition by Thomas A.
;-- oncelli, Christina J. Hogan and Strata R. Chalup

21
 Course Name: Computer Architecture
'Course Structure: Lectures: 3 / Labs: 0 Credit Hours: 3
Prerequisites: Digital Logic Design, Computer Organization and Assembly Language
Course Outline: Introduction Computer Organization and Architecture, Structure and
unction, History of Computer Evaluation: Generation of Computer, Von Neumann
achine Architecture Execution: Introduction of Execution Unit (EU), Register Section,
eneral Register Design Processor Control Unit: Basic Concepts Design Methods
Olardwired Control Design and Micro Programmed Control Unit Cache Memory:
Characteristics of Memory System, Location, Capacity, Unit of Transfer, Access
lethod, Performance, Physical Type, Physical Characteristics, Organization Memory
Hierarchy: Cache Memory Principles ,Elements of Cache Design Internal Memory
prganiz.ation, DRAM vs SRAM, Types of ROM External Memory Magnetic Disk,
RAID, RAID Level 0 to 6 Advanced Topics: Programmed I/O , Interrupt Driven I/O,
DMA (Direct Memory Access).
Reference Material:
Moris Mano, Modern Computer architecture, .rd Edition, Prentice Hall, 1992.
William Stallings, Computer Organization and Architecture, 7 th Editition

Course Name: Computer Graphics

!Course Structure: Lectures: 2 / Lab 3 Credit Hours: 3
Prerequisites: Data Structures, Software Engineering--I
Objectives: To develop ability to plan and manage software development
projects successfully, maximizing the return from each stage of the software
development life cycle.
!Reference Material:
Software Project Management, Richard H. Thayer, Wiley IEEE Press 2002, ISBN 0-
7695-1 199-6.
Software Engineering: A Practitioner's Approach, 4th edition, Roger S. Pressman,
McGraw-Hill Higher Education, ISBN: 0070521824.

22
Course Name: Database Administration
Cour ,,e Structure: Lectures: 3 / Labs: 0 Credit Hours: 3
Prerequisites: Data Base Systems
Objectives: The student will learn the design, algorithms and techniques
involved in distributed database system and their implementation.
Course Outline: Advanced data models. Conceptual. Database design.
Concurrency control techniques. Recovery techniques. Query processing and
optimization. Integrity and security. Client-Server architecture. Distributed
database systems. Current trends in database systems. Database machines.

Reference Material:
Distributed Databases: Principles and System, Ceri and Pelagatti McGraw-Hil Book
Company 1984, ISBN: 0-07-010829-3.

.Course Name: Information Security

Course Structure: Lectures: 3 / Labs: 0 I Credit Hours: 3
Objectives: This course provides a broad overview of the threats to the security of
information systems, the responsibilities and basic tools for information security, and the
levels of training and expertise needed in organizations to reach and maintain a state of 1
acceptable security. It covers concepts and applications of system and data security.
:Areas of particular focus include secure network design, implementation and transition
issues, and techniques for responding to security breaches.
Course Outline Information Security Attacks & Vulnerabilities, Anatomy of Attack,
Awareness and Management Commitment to Security, Security Policy, Information
Security Network Architecture Design Rules, Rules for Selecting Security Hardware &
Software, Physical Security Rules, Network Hardware Security, Operating System
Security Rules, PC Operating Security Rules, Internet Security Rules, Application
Security Rules, Software Validation and Verification Rules, Data Encryption Rules,
Configuration Management Rules, Network Monitoring Rules, Maintenance and
Troubleshooting Security Rules, Emergency Rules Attacks, An introduction to
confidentiality, integrity, availability; authentication technologies and models, Controls
and protection models, Security kernels, Secure programming, Information Auditing,
intrusion detection and response, Operational security issues, Physical security issues,
Personnel security, Policy formation and enforcement, Access controls, Information
flow, Legal, privacy and social issues, Identification and authentication in local and
,]istributed systems; classification and trust modelling, Risks and vulnerabilities, Risk
rssment, Database security, Encryption, Host-based and network-based security
Issues, Areas of particular focus include secure network design, implementation and
transition issues, and techniques for responding to security breaches.

Riference Material:
Information Security Best Practices by George L. Stefanek, 2006.

2:i
(Ac36WIc■s°
t
Asst
k)0"
'Course Natile: Web Technologies
ourse Structure: Lectures: 3 Labs: 3 I Credit Hours: 4
bjectives: Design and implementation of web based applications.
ourse Outline: Overview of Protocols: TCP/IP, HTTP, Overview of 3-tier
chitecture, Web Based Applications Architecture. Developing Front End
pplications: Front End Development Tools, HTML, DHTML, Scripting (Java
Script, Jscript, Vbscript), Java Applets, ActiveX.
eference Material:
Web enabled Commercial Application Development Using... HTML, DHTML,
IlavaScript, Perl, CGI, Ivan Bayross, BPB Publications.

Course Name: Network Strategies

LCourse Structure: Lectures 2/ Labs: 3 Credit Hours: 3
Prerequisites: Computer Networks
OSI Model: The Layers Concepts, TCP/IP Protocol Suite
$witching Techniques: Circut switching, Packet switching, Virtual Circus Switching,
Frame Relay, ATM
lApplication Layer: Domain Name System (DNS), Simple Mail Transfer Protocol
( SMTP), Hypertext Transfer Protocol (HTTP)
Transport Layer: User Datagram Protocol (UDP), User Datagram Format, UDP
Operation, Uses of UDP, Transmission Control Protocol (TCP), TCP Features, TCP
C onnection
Network Layer: Distance Vector Routing, Routing Information Protocol (RIP), Link
§tate Routing, Open Shortest Path First (OSPF), Path Vector Routing, Border Gatway
rotocol (BGP), Internet Protocol (IP), IPV4 Addresses, IPV6, Transition from IPV4 to
PV6, Introduction to ICMP,IGMP,ARP,RARP
ataLink Layer: High-Level Data Link Control (HDLC), Transfer Modes
(NRM,ABM), Frame Structure, Point to Point Protocol (PPP), PPP Services, Frame
format.
Reference Material:
Data Communications and Networking 4 th Edition by Behrouz A.Forouzan
Data and Computer Communication 5 th Edition By William Stalling.

24
 nurse Name: Advanced Object Oriented Programming
purse Structures Lectures: 3 Labs: 3 Credit Hours: 4
Introduction to java History of java, Features of java, Java Environment-How it
works, Comparison between java and C++, Basic object oriented concepts,
Modifiers for (class, methods and variables) Basic java data types, syntax,Writing
Umple java console applications„Control structures. (if, if-else, nested if-else,
switch, for, while, do-while),Examples of java applications Packages and interfaces.
Overview of Java Packages, What is java package? Packages levels, Why we use
packages? Creating packages(Syntax of packages) Default package. Example of
ckages, What is interface? Why we use interface? Syntax and example of
terface. Comparison between interfaces and abstract class. JAVA Exception
tiling Overview of Exceptions ,Error and Exceptions, Catching a Runtime
xception, Handling Multiple Exceptions., The finally Clause, The throws Clause,
When to use Exceptions , When not to use Exceptions JAVA Multithreading,
Ov erview of Multithreading, The thread control methods, The thread life cycle,
implementation of Multithreading (EXTENDING A THREAD CLASS)
Applets. Basics of Java Applet., Advantages and disadvantages of java Applets, Life
iycle of java Applet, Examples. AWT The java Abstract Window oolkit(AWT)
kage. Implantation of AWT controls. Servlets Client side vs. Server side
tchnologies„ Different Server side technologies, Introduction to Servlets, Servlets
e cycle, Software Requirements, Developing Basic Servlets example., doPost,
t, SSI, Session management.
eference Material:
ava Official Tutorial
,e Complete Reference 5the Edition
a How to Program by Deital and Deital
-

Course Name: E-Commerce

Course Structures Lectures: 3 Labs: 0 Credit Hours: 3
undamentals of E-Commerce Technologies: An overview of the principles of E-
ommerce. The origin and growth of E-Commerce. Technologies that support the
velopment of E-Commerce applications. Business models and strategies for E-
Amerce. Legal issues related to E-Commerce such as privacy, consumer rights
d intellectual property.
ctronic Payments Systems: Electronic money, electronic contracts, micro-
ments, authenticity, integrity and reliability of transactions, the encryption and
tal signature techniques available to support secure transactions on the internet.
ography, Information Security and E-Commerce: Symmetric cryptography,
metric cryptography, Digital signature, one-way hashing, zero-knowledge
f, certificate and certificate authority. Secure information infrastructure, virtual
ate network (VPN), online shopping and payment systems, e-crash. Economic
-,:pLct. Smart card, steganography, time stamping. Cryptanalysis technology.
entication protocols, analysis and evaluation.
buted Systems and Software: Architectural models for distributed systems,
er techniquesa remote procedure call and multicast communication, emerging
rd and platforms (CORBA, DCOM), distributed transa concurrency

25

vct
 control, reliability and security issues.
Network and Web Programming: Client-server system design; interprocess
communication; sockets; blocking and nonblocking I/O; multithreaded process;
iterative and concurrent server designs; Web programming includes HTML, JAVA,
Web page design and construction.
Open Systems for E-Commerce: Introduction to open system standards and
protocols. Transaction protocols. Electronic commerce applications using open
system and artificial intelligence technologies. Application of intelligent agents for
automated transaction processing. Integration of Web programming techniques with
information and communication systems.
i'roject in E-Commerce Technologies: An individual or a team project on E-
Commerce technologies. *Project in E-Commerce Technologies are designed to
allow students to gain first hand experience in studying and developing real-world
systems for E-Commerce. These could be conducted either individually or by
teamwork. Possible projects include, but are not limited to: On-line Banking and
Financial Systems Supply Chain, Web-based Forecasting and pricing Electronic
Payment Systems, Internet Shopping, Virtual Store or Virtual Campus, Electronic
Office, Cryptography Servers, Security Fire Wall, Network Management and
Quality of Service, Distributed System Technologies in CORBA or DCOM,
HTML(Hypertext Markup Language): Internet, web & HTMLK Fundamentals, The
world Wide Web & Web Servers,
Creating Static Web Pages with HTML:
Advanced HTML:
Java Script: Data Type, Control Structures, Object & Function, Event Handling,
VB Script: Introduction, Data Types, Syntax, Control, etc,
Active Server Pages:
Common Gateway Interface (CGI) Script:
Database Connectivity: Using ASP, Using CGI,

Reference Material:
Ann Navarro, Todd Stauffer, HTML by Example
Andrew Wooldrige, Mike Morgan, Mona Everett, Scott J. Walter, Special Edition
Java Script

26

•
Course Name: Software Engineering-II
Course Structures: Lectures: 3 Labs: 0 Credit Hours: 3
Course Contents: Object Oriented Analysis and Design
Introduction Introduction to Software engineering —II, Why software engineering-H,
Software Crises
Basic concepts of 00 software Engineering-II, Object Oriented paradigm,
bstraction, Objects, Classes
eritance, Polymorphism Encapsulation
bject Modeling, Define Model, Objects & Class, Links &
Associations,Generalization & Inheritance
Grouping Constructs, Aggregation, Abstract Class, Multiple Inheritance, Meta Data,
Candidate Key
bject oriented development, Introduction, How to Identify objects,How to
dentify association, How to Identifying multiplicities
Object Oriented Metrics, Introduction, Metrics Suite for Objected Oriented design,
e MOOD Metrics
Object Oriented Testing, Introduction, MM testing, Function pair Coverage
formal Notations, Introduction, Formal Specification, Object Constraint Language
(0CL), UML
ase Study: Compiler Design Using object oriented approach, submit a detail report
on Compiler design. (Draw UML Diagrams).

Reference Material:
Software Engineering DAVID GUSTAFSON,P.hD,schatun's Outline Series
James R.Rumbaugh, Michael R.Blaha, William Premeriani, Frederick Eddy,
William Lorensen,Object Oriented Modeling and Design with UML, 2" d Edition,
Prentice Hall, 2004

27
Course Title: Advanced Internet Applications
Course Structures: Lectures: 3 Labs: 3 Credit Hours: 4
Course Description:
The Rich Internet Applications (RIA) course concentrates primarily on the theory and
practice of building cross platform rich client web applications in the browser for desktop
and mobile devices. This course explores the new category of engaging web applications
being developed using tools such as Flex, Flash ActionScript, AJAX and Silverlight. Rich
Internet Applications (RIAs) can combine rich media (such as video, audio, and
animation) to achieve powerful data visualizations. Along with the fundamentals
underlying these technologies, several applications will be showcased as case studies.
Students work with these technologies starting with simple applications and then
examining real world complex applications. At the end of this course, students would have
mastered the latest and widely used MA methodologies.

Objectives: Build and deploy cross-platform Rich Internet Applications (RIA) and
content, Create engaging animations to attract and retain users, Generate interactive
dynamic content and special effects, Connect to relational databases and XML datasets to
build real-time, data-driven applications, Encode and deliver streaming video to create
innovative, mixed-media content, Integrate and distribute Flash content on multiple
platforms, including DVD, web and Mobile
Course Outline:Rich Internet Applications: Introduction, History, Evolution
MA Tools and their Features: Flash, Flex, Actionscript, Adobe Air, and Silverlight
RIA APIs and IDEs HTML5: Overview of HTML5, Canvas and Scalable Vector
Graphics, Audio and Video, Geolocation, Communication, Web Sockets, Forms, Drag
and Drop, Web Workers, Web Storage, Offline Web Applications, CSS AJAX: Purpose,
Frameworks, XML, JSON, DOM, XMLHttpRequest Object jQuery UI: jQuery Review,
Controls, Drag and Drop jQuery Mobile: Navigation, Form Elements and Lists, Views,
Server Integration Techniques Flex: Flex Programming elements, MXML, Events, Data
Access, User Interface Components, Flex Mobile
Project Presentations
Reference Material:
Pro HTML5 Programming, 2nd edition, by Peter Lubbers, Brian Albers, and Frank Salim,
APress, 2011. 1SBN13: 978-1-4302-3864-5.
Head First HTML5 Programming, Building Web Apps with JavaScript, Eric Freeman and
Elisabeth Robson, O'Reilly, 2011. ISBN 13: 978-1-4493-9054-9.
jQuery UI, by Eric Sarrion, O'Reilly, 2012. ISBN 13: 978-1-449-31699-0
jQuery Mobile: Up and Running, by Maximilian Firtman, O'Reilly, 2012. ISBN 13: 978-
1-449-39765-4.
Adobe Flex 4.5 Fundamentals: Training from the Source, by Labriola, M. and Tapper, J.,
Adobe Press, 2011. ISBN 13: 978-0-321-77712-6 (Reference book)
Flex Mobile in Action, by Jonathan Campos, Manning Publications, 2012. ISBN 13:
9781617290619
Various online resources

28
 - Computer Science Courses (Required Supporting Courses)

' Course Name: MuInvariable Calculus

Course Structure: Lectures: 3 / Labs: 0 j Credit Hours: 3
Prerequisites: Calculus and Analytical Geometry
Object iN CS: Cover Secondary level to advanced topics in Calculus
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:
u!!‘!. , ivulvtical Geometry By Swokowski, Olinick and Pence.

'ou rsc Name: Differential Equations

Course Structure: Lectures: 3 / Labs: 0 I Credit Hours: 3
Prerequisites: Multivariate Calculus
Objectives: Develop fundamental skills of solving ordinary differential !I
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:
Advanced Engineering Mathematics, Michael Greenberg, ISBN: 0133214311.
Advanced Engineering Mathematics,71e, Erwin Kreyszig. John Wiley & Sons 1992
ISBN: 0471553808.
A First Course in Diferential Equations, Zill, Prindle, Weber and Schmidt.
Brooks/Cole Publishing, 1996. ISBN: 0534955746.

IQ/

29
 BS Computer Science Courses (Elective General Courses)

Course Title: Basic Electronics

Course Structures: Lectures: 3 Labs: 0 Credit Hours: 3
Direct Current Circuits Joules' Law, Circuit Analysis, Kirehhoff s Rules, Wheatstone
Bridge Alternating Currents Sinusoidal Signals, Frequency, amplitude and phase, uns,
value, power factor. Capacitive reactance, Inductive•reactance, RL Filter, RC Filter,
Diffenitiating and integrating factor Transient currents, Transition and Diffusion
apacitance, Reese Recovery Time, Zener Diode, Light Emitting Diode. Diode
Applications Load Line Analysis, Series/Parallel and Series-Parellel Configurations.,
AND/OR Gates, Half wave and full wave rectifier., Clippers and dampers, Voltage
multiplier circuits, junction. Transistor Transistor Construction, Transistor Operation,
Different Configurations, Transistor amplifying action, Limits of Operations, DC Biasing,
Fixed Bias Circuit, Emitter Stabilized bias circuit, Voltage Divider biased, BJT transistor
Modeling, BJT small signal analysis Amplifiers Differential and Common mode
operation, Op-amp basic, Op-amp application.
Reference Material:
James J. Brophy, Basic Electronics for Scientists, 5 th Edition, McGraw Hill Publishing
Company Inc, 1990.
Basic Electronics and Circuit Theory by Nashalsky.