Name: Tahir Rauf

B.Sc. Honors (Computer Science) Course Outline

Semester 1
Title Fundamentals of Algorithms
Code CS-101
Credit Hours 3
Prerequisite None
Follow Up CS-103, CS-318, CS-104
Aims and Objectives To teach problem solving strategies using pseudo language as a base. Introduction to algorithms, the role of algorithm in the problem solving. Implementation strategies for algorithms,
debugging strategies, properties of algorithms process, searching and sorting algorithm, iteration and recursion and their debugging strategies.
Although the text book used for this course is in C language but while solving problems students will only use pseudo-code to solve their problems and will ignore the implementation of
algorithms in C.
Syllabus Introductions, Problem Solving, Using Computers in Problem Solving: The Software, Development Method, Requirements Specification, Analysis Design and Representation of Algorithms,
Pseudo coding, The Sequence Control Structure, The Selection Control Structure, The Repetitions Control Structure, Pseudo coding Conventions, Top-Down Stepwise Refinement of
Algorithms Using Pseudo code Flowcharting. Testing and Verification, Program Documentation, Introduction, Language Character Set and Tokens, Reserved Words, Identifiers, Constants,
Integer Constants, Floating-point Constants and Escape Sequences, String Literals, Punctuations, Operators, Introduction, Arithmetic Operators, Arithmetic Expressions and Precedence of
Arithmetic Operators, Mathematical Library Functions, Style Considerations for Arithmetic Assignment Expression Statements, Introductions, Programming for Simple Selections, Selection
Statements, Two-Way Selection Using the if Statement, Relational Operators and Simple Predicates, Additional Examples of the if Statement, Precedence of Arithmetic and Relational
Operators, Nested if Statement and Multi-way Selection, Programming for Controlled Repetitions, Repetition Statements, Controlled Repetition Using the while Statement, Style Considerations
for if and while Statement, Structured Programming, Introduction, Structure of Modular Programs, Program Structure and Structure Charts, Functions with Parameters (only pseudo-code
type, no implementation of C function), Use of Global Variables for Data Communication Between Functions, Use of Parameters for Data Communications Between Functions, Defining
Functions with Parameters, Declaring Functions with Parameters, Calling Functions with Parameters, Corresponding of Actual Formal Parameters, Parameter Passing by Value, Designing a
modular program using top-down stepwise refinement, Implementing a modular program in c using bottom-up, Development Using Driver Functions to Test Modules, Style Considerations in
Modular Program Design, Introductions, Interactive Versus Batch Program, Introduction, The if Statement Revisited, Multi-way Selection Using the else if Construct, The Conditional
Operator, Complex Predicates, Logical Expressions and Logical Operators, The Logical Operators, Simplifying Complex Predicate, Precedence of Logical Operators, Multi-way Selection
Using if Statements with Complex Predicates, Multi-way Selection Using the Switch Statement, the Switch and Break Statements, Style Considerations for Multi-way Selections Structures,
The Pretest Repetition Structure, The for Statement for Pretest Repetition, Equivalence of for and while Statements, Loop Design Using the for Statement, Missing Initialization Expression,
Missing Update Expression, Missing loop Control expression, all Elements Missing in a for Header, The Posttest Repetition Structure, The do-while Statement, Use of do While for Counter –
and Sentinel-Controlled loops, Use of the Break and Continue Statements in do-while loops, Nested Loops, Style Considerations for Repetition Statements, Recursion, Tracing Recursive
Functions, computing Fibonacci Numbers Recursively, Recursion Versus Iteration, Additional Style Considerations for Modular Program, Structured Data Types and Structures, Declaring
Structures, Declaring Structures, Declaring Nested Structures, Structures as Functions Parameters, Using typedef in Structure Declarations, Enumerated Data Types, Declaring Enumerated data
Types and Variables, Operations on Enumerated Variables, Using Enumerated Data Types, Introduction, Lists and Arrays, Declaring Arrays, Initialization Arrays, Operations of Arrays, Sorting
Arrays, Bubble Sort, Selection Sort, Recursive Selection Sort, Searching Arrays, Sequential Search, Binary Search, Higher Dimensional Arrays, Declaring Two –Dimensional Arrays,
Initialization of two – Dimensional Arrays, Operations on Two- Dimensional Arrays, Arrays of Structures, Introduction, More on Character Data, Strings, Declaring Strings, Compile- Time
Initialization of strings, String Processing, Copying Strings, Comparing Strings, Computing Length of Strings, Concatenation of Strings, Searching Strings for Substrings, Determining
Existence of a Substring in a String, Computing Number of Occurrences of a Substring in a String, Determining Existence of a Character in a string, Tokenizing Strings.
Text Book/s Problem Solving Using Structured Programming Techniques in C by Yuksel Uckan
Reference Material

Title Introduction to Computers

Code CS-102
Credit Hours 3
Prerequisite None
Follow Up CS-103, CS-206, CS-318
Aims and Objectives This course introduces field of computing to the students. The course will cover topics, which illustrate how computers are being used in business, scientific, engineering, medical, economic,
and social areas of human activity. First half of the course will cover some common applications such as email, Web, word processing, spreadsheets, telecommunications, and networking as
well as a look at the hardware that makes up a computing machine. The second half will be devoted to cover the basic concepts of Computer Science and problem solving.

Punjab University College of Information Technology, University of the Punjab http://www.pucit.edu.pk Page 1 of 18
Name: Tahir Rauf
B.Sc. Honors (Computer Science) Course Outline

Syllabus What is Computer, Components of computers, Categories of computers, Personnel computers, Handheld computers, Mid range servers, Mainframes, Super computers, What is Input, The
Keyboard, Pointing devices, Voice inputs, Scanners, Video input, Digital cameras, Reading devices, What is out put, Different forms of out put, Display d Printers, Working of different
printers, Speakers, Terminals, Output devices for disabled devices, The system unit, Central processing unit, Data representation, Memory, Expansion slots, Ports, Buses, Bays, Power supply,
Mobile computers, The internet, History of internet, How internet works, World wide web, Hands on training using Front Page, What is software, Different types of software’s, Categories of
software’s Hands on training (MS Office), What is communication, Sending and receiving devices, Uses of communication, Networks Communication software’s, Communication devices,
Physical and wireless transmission media, Telephone networks, Communication channels, What is operating system, System software, Operating system functions, Types of operating system
Types of operating system, Network operating systems, Utility programs, What is computer program, Program development life cycle, Analyze program, Design program, Code program, Test
program, Formalize program, Maintain programs, Different programming languages, Categories of programming languages, Object oriented program development, Web page program
development, Selecting programming language, Selecting program development tool, Data and information, The hierarchy of data, Maintaining data, File processing vs. database, Database
management system, Relational, Object oriented and multidimensional database, Database administration, What is system development life cycle, What initiates the system development life
cycle, Planning phase, Analysis phase, Design phase, Implementation phase, Support phase, Computer security risk and safe guards, Internet and network security, Information privacy, Careers
in computer industry, What is computer certification, Types of computer certification, Certification benefits, Choosing a computer certification, Final Project
Text Book/s Discovering Computers 2002 By Shelly Cashman Series
Reference Material 1. Using information technology by William Sawyer
2. Introduction to computers by Peter Norton

Title Calculus and Analytic Geometry

Code MT-101
Credit Hours 3
Prerequisite None
Follow Up MT-102
Aims and Objectives  To encourage the students to develop the habit of thinking.
 To master the concepts by practice
 To explore possibilities in the real world and to draw conclusions.
Syllabus Review of the set theory and real number system. Review of linear, quadratic and simultaneous equations. Review of the real line, ordering real numbers, solution of inequalities shown on
number line. Review of the absolute value equations and inequalities. The complex number system. Argand’s diagram. De Moivre’s theorem with simple applications. Functions, kind of
functions, operations on functions. Graph sketching in rectangular coordinate system. Graph sketching in polar coordinate system. Limit of a function, rules and evaluation, continuity of
functions. Definition and examples of the derivative of a function. Techniques of differentiation. Implicit differentiation. Differentiation of trigonometric functions. Differentiation of inverse
trigonometric functions. Differentiation of exponential functions. Differentiation of logarithmic functions. Geometric meaning of the derivative of a function, tangents and normal to curves,
differentials. Higher order derivatives. Increasing and decreasing functions. Maximization or Minimization of a function. Rolle’s and Mean value theorem with applications. Taylor’s and
Maclaurin’s Series.
L’Hôpital’s rules to evaluate limit that lead to indeterminate forms. Anti-derivatives-The Indefinite Integral .Basic integration formulae. Integration by substitution. Integration by parts.
Integrating rational functions; partial fractions. Integration as a limit of sum. The fundamental theorem of calculus. Substitution in definite integral, Properties of definite integrals. Application
of definite integrals in finding the area under a curve. Area between two curves.
Text Book/s Calculus and Analytic Geometry (9th Edition) by G. B. Thomas and R. L. Finney.
Reference Material Calculus with Analytic Geometry by Howard Anton

Title English Comprehension

Code EG-101
Credit Hours 3
Prerequisite None
Follow Up EG-102
Aims and Objectives This is an introductory course of business English, which will serve as a prerequisite to the later courses offered in due time. This course helps the students to develop a clear sense of writing
and understanding what is being written, it not only will sharpen their writing skills but also improve their grasping power of the text. They will be able to write on different types of
composition in detail, and will be able to answer questions relating to the comprehension passages, which will focus their minds to the task ahead. This course is subdivided into four parts
Syllabus Introduction: Introduction of Distributed Data Processing; Promises of DDBMS; Complications of DDBMS; Problem Areas of DDBMS; Distributed DBMS Architecture: DBMS
Standardization; Architectural Models for DDBMS; DDBMS Architecture; Directory Issues; Distributed Database Design: DDBMS Design Strategies; Fragmentation: Horizontal, Vertical,
Hybrid; Allocation; Semantic Data Control: View Management; Data Security; Semantic Integrity Control; Query Processing: Query Processing Problem; Objectives of Query Processing;
Complexity Of Relational Algebras Operations; Characterization Of Query Processors; Layers Of Query Processing; Query Decomposition and Data Localization: Query Decomposition;
Localization of Distributed Data; Optimization of Distributed Queries: Query Optimization; Centralized Query Optimization; Join Ordering In Fragment queries; Distributed Query
Optimization Algorithms; Transaction Management: Definition of Transaction; Properties of Transaction; Types of Transactions; Architecture Revisited; Distributed Concurrency Control:
Serializability Theory; Taxonomy of Concurrency Control Mechanisms; Locking-Based Concurrency Control Algorithms; Timestamp-Based Concurrency Control Algorithms; Optimistic
Concurrency Control Algorithms; Deadlock Management; Relaxed Concurrency Control; Distributed DBMS Reliability: Reliability Concepts and Measures; Failures and Faults Tolerance In
Distributed Systems; Failures In DDBMS; Local Reliability Protocols; Distributed Reliability Protocols; Dealing with Site Failures.
Text Book/s General Certificate English by Alan Etherton
Reference Material Comprehension for O level By Oxford Press

Punjab University College of Information Technology, University of the Punjab http://www.pucit.edu.pk Page 2 of 18
Name: Tahir Rauf
B.Sc. Honors (Computer Science) Course Outline

Title Electronics
Code EE-101
Credit Hours 4
Prerequisite None
Follow Up EE-102
Aims and Objectives The course is designed to give detailed introduction to electric components and elements of circuit theory. Subsequently electronic devices e.g., Diode, BJT, FET and OP-AMPs are introduced
followed by design techniques of various electronic circuits e.g., amplifiers and oscillators
Syllabus Introduction to course, Ch 2: Voltage, Current and Resistor in Electric Circuits, Electric Charge Coulomb, Positive, and Negative Charges, Voltage, Current, Resistance, Electric Circuits, Ch 3:
Ohm’s Law, Energy and Power, Ohm’s Law, Energy and Power, Ch 4: Series Circuit, Resistor in Series, Current in a Series Circuit, Ohm’s Law in Series Circuit, Kirchhoff’s Voltage Law,
Voltage Dividers, Power in a Series Circuit, Ch 5: Parallel Circuits, Resistor in Parallel, Voltage Drop in Parallel Circuits, Kirchhoff’s Current Law, Total Parallel Resistance, Ohms Law in
Parallel Circuits, Ch 6: Series Parallel Circuits, Analysis Of Series –Parallel Circuits, Total Resistance, Total Currents, Branch Currents, Voltage Relationships, Thevenin’s Theorem, The
Thevenin Equivalent of a Circuit, Ch 8: Introduction to Alternating Current and Voltage, Sine Wave, Polarity, Period, Frequency, Rms Value, Average Value, Sine Wave Formula, Expressions
of Phase Shifted Sine Wave, Ohms’s Law, Kirchhoff’s Law in AC Circuits, Non Sinusoidal Wave Forms, Triangular and Sawtooth Waveforms, Ch 9: Capacitance, Basic Capacitor, Series
Capacitor, Parallel Capacitor, Capacitors in DC Circuits, Capacitors in AC Circuits, Ch 10: Inductors, Basic Inductor, Series Inductor, Parallel Inductors, Inductors in DC Circuits, Inductors in
AC Circuits, Ch 11: Transformer, The Basic Transformer, Step-Up Transformer, Step-Down Transformer, Ch 12: RC Circuits, Sinusoidal Response of RC Circuit, Impedance and Phase Angle
of Series RC Circuit, Impedance and Phase Angle of Parallel RC Circuit, CH 13: RL Circuits, Sinusoidal Response of RL Circuit, Impedance and Phase Angle of Series RL Circuit, Impedance
And Phase Angle Of Parallel RL Circuit, Ch 14: RLC Circuits and Response, Impedance and Phase Angle of Series RLC Circuit, Analyses of Series RLC Circuit, Series Resonance, Parallel
RLC Circuits, Parallel Resonance,
BOOK: ELECTRONIC DEVICES (T.L.Floyd): Ch 1: Introduction to Semiconductors, Introduction to Semiconductors, Atomic Structure, Orbits, Ionization. Semiconductors, Conductors and
Insulators. Electron and Hole Current. PN Junction, Diode, Ch 2: Diode Applications, Half-Wave and Full-Wave Rectifiers, Ch 3: Special-Purpose Diodes, Zener Diode, Its Limiting Action
with a Sine Input Voltage. Ch 4: Bipolar Junction Transistors, Basic Transistor Construction and Symbols. Biasing, Transistor Characteristics. The Transistor as an Amplifier, Ch 5: Transistor
Bias Circuits, The DC Operating Point, Base Bias, Emitter Bias, Voltage Divider Bias. Ch 6: Small-Signal Bipolar Amplifiers, Common Emitter Amplifier, Ch 7: Power Amplifiers, Class A
Amplifier. Class B and Class AB Push Pull Amplifiers, Ch 8: Field Effect Transistor and Biasing, The Junction Field-Effect Transistor. JFET Characteristics, JFET Biasing, Ch 9: Small-Signal
FET Amplifiers, Small Signal FET Amplifier Operation. FET Amplification. Common Source Amplifiers, Ch 10: Amplifier Frequency Response, The Decibel. Cutoff Frequency. Low
Frequency, Amplifier Response. The Bode Plot. Miller. Capacitance. Total Amplifier Frequency Response. Bandwidth. Gain Bandwidth Product. Frequency Response of Multistage
Amplifiers. Introduction to Op Amplifier. Op Amp Parameters, Input Offset Voltage, Input Offset Current, Open Loop Voltage Gain. Negative Feedback. Op-Amp Configuration with Negative
Feedback: Non-Inverting Amplifier, Inverting Amplifier, Voltage Follower. Comparator, Summing Amplifier, Integrator and Differentiator. The Oscillator. Oscillator Principle. Oscillator with
RC Feedback. The Wien Bridge Oscillator Crystal, Phase Shift Oscillator, Oscillator with LC Feedback Colpitts Oscillator, Controlled Oscillator. The 555 Timer as an Oscillator Multivibrator
Text Book/s 1. Islamic Education by M. D. Zafar, Revised Edition
2. Pakistan Studies by Dr. Muhammad Sarwar, ILMI KITAB KHANA
Reference Material Electronic Devices and Ciruit Theory, 7th Ed. 2000. R.L.Boylestad And L. Nashelsky Prentice Hall

Title Pakistan / Islamic Studies

Code HU-101
Credit Hours 2
Prerequisite None
Follow Up None
Aims and Objectives The course has been designed to introduce the students to all Important aspects of the teachings of Islam. The following topics would be covered in 5 modules:
 Basic Sources of Teaching
 Beliefs and Their Impact on Human Life
 Obligations To God
 Obligations To Fellow Human-Beings
 Some General Issues
Syllabus Fundamental Doctrine of Islam, Ibadaat, Amar Bil Maroof and Nahi Anil Munkir, Unity of Ummah, Kasbi-I-Hilal, Fundamental Human Rights, Rights of Women, Relations with the Non-
Muslims, Khutba Hajjat-Ul-Wida, The life of the Holy Prophet (P.B.U.H), Hajjat-ul-Wida, Death of the Holy Prophet (P.B.U.H), Influence of Islamic Civilization on the Subcontinent,
International Influence of Islamic Civilization, Revision, Creation of Pakistan, Historical Background of Pakistan Ideology, Liberation Movement, Early Problems After The Creation Of
Pakistan, Islamisation In Pakistan, Physical Features and Economic Characteristics, Population and Manpower, Pakistan and the World of Islam
Text Book/s 1. Islamic Education by M. D. Zafar, Revised Edition
2. Pakistan Studies by Dr. Muhammad Sarwar, ILMI KITAB KHANA
Reference Material

Punjab University College of Information Technology, University of the Punjab http://www.pucit.edu.pk Page 3 of 18
Name: Tahir Rauf
B.Sc. Honors (Computer Science) Course Outline

Semester 2
Title Introduction to Computer Programming
Code CS-103
Credit Hours 4
Prerequisite CS-101, CS-102
Follow Up CS-205
Aims and Objectives This course introduces programming and introduction to Object Oriented techniques using C++ Language. This is the first programming course for students.
Syllabus Course Introduction, Problem Solving, Introduction to programming and programs, Types of Languages, Compiler vs interpreter, Structure of C++ Program, Indentation and coding
conventions, Program Output, Syntax Rules, common errors, Identifiers, Constants, Arithmetic Operators and punctuations, Precedence and Associations, Equality and Relational Operators,
Data Types, C++ Keywords, Selection Structure (if, if/else), Repetition Structure (while), Counter Controlled Repetition, Nested Control Structures, Assignment Operators, Type Casting,
Increment and Decrement Operators, Repetition Structure (for), Multiple Selection Structure (switch and break), Repetition Structure (do/while), break and continue, Logical Operators,
Conditional/Ternary Operator, Library Functions, Moduler Approach : Functions, Function Definitions, Function prototypes, Storage Classes, Type Qualifiers, Scope Rules, Recursion,
Recursion Vs Iteration, Inline Functions, References and Reference Parameters, Default Arguments, Arrays, Declaring Arrays, Initialization, Subscripting, Traversing, Passing Arrays to
Functions, Multidimensional Arrays, Example (Matrix Manipulation), Pointers, Declaration, Initialization, Pointer Operators, Functions : Call by Reference, Using the const Qualifier with
pointers, Pointer Expressions and Pointer Arithmetic, Relationship between Arrays and Pointers, Arrays of Pointers, Fundamentals of Characters and Strings, String Handling Library Functions,
User defined String Functions, String Manipulation Exercises, Structures, Initializing Structures, Pointer to Structures, Arrays of Structures, Using Structures with Functions, typedef, sizeof(),
Bitwise Complements, Bitwise Logical Operators, Shift Operators, Masks, Bit fields, Packing and Unpacking, Unions, Preprocessors, #include, #define, Macros and Macros with arguments,
Conditional Compilation, Command Line Arguments, Program termination with exit() and atexit(), Dynamic Memory Allocation, Dynamic Arrays, Files and Streams, Introduction to Text
Stream, Binary Streams, Files, Console I/O, File Access Modes, Creating a Sequential access File, Reading data from sequential access file using >> operator, Writing Sequential access file
using << operator, Updating sequential access file, Function overloading, Template functions, Introduction to OOP
Text Book/s C++ How to Program by Dietel and Dietel, 3rd Edition
Reference Material Turbo C/C++ The Complete Reference by Herbert Schield

Title Discrete Structures

Code CS-104
Credit Hours 4
Prerequisite CS-101
Follow Up CS-425, CS-419
Aims and Objectives This course covers mathematical foundations of computer science. Topics included are: an introduction to logic, Boolean algebras, sets, functions, linear recurrence relations, and sorting
methods. Trees, Graph theory and algorithms and their notion of complexity (time and space) are introduced and their use in the analysis of algorithms is discussed. Available software will be
used for implementing various algorithms
Syllabus Propositions: Simple & compound, five connectives (Negation, Conjunction, disjunction, implication, bi implication), Propositional Equivalence, tautology, contradiction, Predicate logic,
Quantifiers: universal quantification & Existential quantification, Concept of fuzzy logic Sets, set-operations, subsets, De Morgan’s laws& other identities, power set, Cartesian product with
properties, representation of sets by Venn diagram, Computer representation of a set, concept of Fuzzy sets, Relations on a set. Domain and range. Types of relations, properties of relation
(reflexive, symmetric, transitive, equivalence relation). Combining relation. n-array relations and their applications in database. Representing relations using zero-one matrix and digraph.
Closures of relations, Functions, algebra of functions, types of functions, composition of functions. Characteristic function, floor and ceiling functions, Sequence and summations. The Growth
of Functions: Big-O Notation, Big – Omega & Big – Theta notation. Concept of Mathematical Induction. Basic accounting principles: Sum, product, The Pigeonhole Principle & The Inclusion
– Exclusion Principle, Permutations and Combinations, Binominal Theorem. Discrete Probability, Recurrence relations, Recursive algorithms.& Solving Recurrence Relations, Generating
functions, Inclusion-Exclusion, Introduction to graph, Graph terminology, representing graph, Graph of isomorphism, Connectivity, Euler & Hamilton path, Shortest path problems, Planar
Graphs, Introduction to Tree, properties of Tree. Tree Traversal, Trees and Sorting, Spanning tree, Minimum Spanning Tree.
Text Book/s 1. Discrete Mathematics & its Applications by K.H. Rosen, WCB, Mc Graw-Hill, 1999.
2. Discrete Mathematics & its Applications (Second Edition) by Susanna S. Epp, DePaul University
Reference Material Discrete Mathematics By Ross & Wright

Title Multi Variable Calculus

Code MT-102
Credit Hours 3
Prerequisite MT-101
Follow Up MT-203
Aims and Objectives  To encourage the students to develop the habit of thinking.
 To master the concepts by practice
 To explore possibilities in the real world and to draw conclusions.
 To be familiar with modern trends of programming and modeling applications.

Punjab University College of Information Technology, University of the Punjab http://www.pucit.edu.pk Page 4 of 18
Name: Tahir Rauf
B.Sc. Honors (Computer Science) Course Outline

Syllabus Review of the area between two curves. Review of the improper integrals. Concept of sequence, its general term, limit of a sequence as a function. Convergence and divergence of a sequence.
Finite and Infinite series. Limit Comparison test for convergence of an infinite series. Ratio and Root tests for convergence of an infinite series. Integral test for convergence of an infinite series.
Vectors in the space. Scalar (dot) product of vectors with properties and applications. Vector (cross) product of vectors with properties and applications, Triple scalar product (a . b x c). Triple
cross product (a x b x c). Lines in space. Planes in space. Functions of two or more variables: limits and continuity. Partial derivatives of first and second orders. Verification of given functions
f(x, y), u(x, y), v(x, y) etc. as solutions of Laplace equations, Cauchy- Riemann equations. Homogeneous functions of degree n. Euler’s formula. The Chain rule for functions of two variables.
Gradient of scalar functions, Function for tangent planes and normal lines to surfaces. Divergence of vector functions. Curl of vector functions. Double integral of function of two or more
variables. Surface area of geometrical figures. Triple integral of function of two or more variables. Surface Volume of geometrical figures. Green’s Theorem, Divergence Theorem, Stokes
Theorem, Maxima and Minima of functions of two variables. The method of Lagrange multipliers.
Text Book/s Calculus with Analytic Geometry by Howard Anton.
Reference Material Calculus and Analytic Geometry (9th Edition) by G. B. Thomas and R. L. Finney.

Title Communication Skills

Code EG-102
Credit Hours 3
Prerequisite EG-101
Follow Up EG-203
Aims and Objectives This course aims at helping students develop a positive, constructive and practical approach to effective written and oral communication in business and professional settings. It is expected that
at the end of the course students will be able to communicate in clear, concise correspondence to meet the diverse needs and multiple purposes of business and social communication situations.
Presentations, interviews, meetings and conferences are an integral part of any professional environment. Well-prepared and well-executed presentations leave an indelible impression on
superiors, peers and subordinates alike. Students will learn to use graphics, audio-visual aids and audience handouts in an effective manner. Audience awareness, developing a design, handling
questions and answers, personal presence, style and body language are some other aspects that will be discussed.
Syllabus Introduction of communication, 4 skills of communication, Importance and Benefits of Effective communication, Components of communication, Concepts and problems of communication,
Forms of communication: verbal/ nonverbal, The general principles of communication, Strategies for Successful Speaking, Strategies for Reducing Stage Fright, Strategies for Improving
Listening Skills, Strategies of Informative and Persuasive Speaking, Kinds of Information and Persuasive Speaking, Audience Analysis for Informative and Persuasive Speaking, Organization
for Informative and Persuasive Speaking, Supports for Informative and Persuasive, Impromptu Speaking, Impromptu Speaking, Assignment Writing, Summary Writing, Grammar, Punctuation,
Review of Composition rules, Strategies for Successful Interpersonal Communication, Strategies for Successful Discussion and Group Meetings, Group Meetings, Written Communication
Business Letter, Memorandums, Special Time saving Message Medium, Business Communication and Technology, E – mail/ Use of The Internet, Other Communication Technologies,
Managing Information Outside Organization, Short Reports, Informational Memorandum Reports, Letter Reports, Oral Presentations, Visual Aids, Oral Presentations
Text Book/s Effective Business Communication By Murphy
Reference Material 1. Business & Report writing By Prof Atta-ur-Rehman
2. Business communication today By Bovee & Till
3. Fowler Dictionary of Modern English Usage, 1965

Title Digital Logic Design

Code EE-102
Credit Hours 4
Prerequisite EE-101
Follow Up CS-207
Aims and Objectives The course aims at providing knowledge of various logic gates and flip flops and their characteristic truth tables to enable students to design and analyze combinational and sequential circuits.
Their applications in computers are discussed. The important circuits e.g., encoders, decoders, multiplexer, demultiplexer, RAM ROM etc are discussed in length.

Punjab University College of Information Technology, University of the Punjab http://www.pucit.edu.pk Page 5 of 18
Name: Tahir Rauf
B.Sc. Honors (Computer Science) Course Outline

Syllabus Introduction to the course Ch2: Boolean Algebra and Logic Gates Basic Definitions, Axiomatic Definitions Of Boolean Algebra Two-Valued Boolean Algebra, Basic Theorems and Properties
Of Boolean Algebra Duality, Basic Theorems, Operator Precedence, Boolean Functions Algebraic Manipulation, Complement of a Function Canonical and Standard Forms Minterms and
Maxterms, Sum of Minterms, Product of Maxterms, Conversion Between Canonical Forms, Standard Forms, Other Logical Operations, Digital Logic Gates, Extension to Multiple Inputs,
Integrated Circuits, Levies Of Integration, Digital Logic Families, Integrated-Circuit Gates, Positive and Negative Logic, The Map Method, Two- and Three- Variable Maps, Four Variable Map
Prime Implicants, Product of Sums Simplification, Nand And Nor Implementation, NAND Implementation, NOR Implementation, Other Two Level Implementations Nondegenerate Forms,
and-OR-Invert Implementation, OR-and-Invert Implementation, Don’t Care Conditions, The Tabulation Method, Determination of Prime Implicants, Selection of Prime Implicants, Design
Procedures, Half -Adder, Full-Adder, Half-Subtractor, Full-Subtractor, Code Conversion, Analysis Procedure, Multilevel NAND Circuits Universal Gate, Boolean-Function Implementation,
Analysis Procedure, Derivation of the Boolean Function by Algebraic Manipulation, Derivation of The Truth Table, Transformation To AND-OR Diagram, Multilevel NOR Circuits, Universal
Gate, Boolean-Function Implementation, Analysis Procedure, Exclusive-OR Functions, Odd Function, Parity Generation And Checking, Binary Adder and Subtractor Binary Parallel Adder,
Binary Adder-Subtractor, Carry Propagation, Decimal Adder BCD Adder, Magnitude Comparator, Decoders and Encoders, Combinational Logic Implementation, Demultiplexers, Encoders,
Priority Encoder, Multiplexer Boolean-Function Implementation, Read Only Memory, Combinational Logic Implementation, Types Of ROMs, Programmable Logic Array (PLA), PLA
Program Table, Programmable Array Logic (PLA), Introduction, Flip-Flop, Basic Flip-Flop Circuit, RS Flip-Flop, D Flip-Flop, JK and T Flip Flop, Triggering of Flip-Flop, Master Slave Flip-
Flop, Graphic Symbols, Direct Inputs, Analysis of Clocked Sequential Circuits, Sequential-Circuit Example, State Table, State Diagram, Flip-Flop Input Functions, Characteristics Tables,
Analysis With JK and other Flip-Flops, Mealy and Moore Models, State Reduction and Assignments, State Reduction, State Assignment, Flip-Flop Excitation Tables, RS Flip-Flop, JK Flip-
Flop, D Flip-Flop, T Flip-Flop, Other Flip-Flops, Design Procedures, Design with D Flip-Flops, Design with Unused States, Analysis of Previously Designed Circuit, Design of Counters,
Counter With Non-binary Sequence, Introduction, Registers, Register with Parallel Load, Sequential-Logic Implementation, Shift Register, Serial Transfer, Bi-directional Shift Register with
Parallel Load, Serial Addition, Ripple Counters, Binary Ripple Counter, BCD Ripple Counter, Synchronous Counter, Binary Counter, Binary-Up-Down Counter, BCD Counter, Binary Counter
with Parallel Load, Timing Sequences, Word-Time Generation, Timing Signals, Johnson Counter, Random Access Memory, Write and Read Operations, Types of Memories, Memory
Decoding, Internal Construction, Array of RAM Chips, Error-Correcting Code, Hamming Code, Single-Error Correction, Double-Error Detection,
Text Book/s Digital Design M. Morris Mano Prentice Hall, 2nd Edition, 2000
Reference Material Digital Fundamentals T. L. Floyd Prentice Hall, 7th Edition, 2000

Semester 3
Title Object Oriented Programming
Code CS-205
Credit Hours 4
Prerequisite CS-103
Follow Up CS-208, CS-314, MT-306
Aims and Objectives This is the second course in OOP. In this course students will be taught OOP using C++ at advanced level.
Syllabus Object Oriented Concepts, Terminology and Features, Class/ADT/UDT, Data Abstraction and Encapsulation, Special Methods, Constructor and Destructor; Modifier const; Array and Pointer
of ADT, Composition; this Pointer, friend Function and Class, Modifier static, Operator Overloading, Class Templates, Inheritance, its types, and related Terminology, Overriding: static &
dynamic/Polymorphism; Stream I/O, File Processing; Exception Handling. Case Study, Project
Text Book/s C++ How to Program by Dietel and Dietel
Reference Material Object Orieneted Programming by Robert Lafore

Title Database Systems

Code CS-206
Credit Hours 3
Prerequisite CS-102
Follow Up CS-209, CS-210
Aims and Objectives This course is designed to give a thorough understanding of databases. It enables students to practically deal with database related issues on the basis of solid concepts and theory.
Syllabus Traditional File Based Systems; Database Approach; Roles in Database Environment; History of Database Management Systems; Advantages and Disadvantages of DBMS; ANSI-SPARC
Architecture; Data Manipulation Language (DML); Data Models; Functions of DBMS; Components of DBMS; Multi-User DBMS Architectures; History of Relational Model; Terminologies;
Relational Data Structures, Mathematical Relation, Database Relations, Relational Keys, Representing Relational, Database Schemas; Relational Integrity; Relational Algebra; Introduction to
SQL; Data Manipulation; Integrity enhancement Feature; Data Definition: Create a Database, Creating Tables, Altering Table, Dropping Table, Creating Index, Removing Index; Views:
Creating Views, Removing views, Restrictions on Views, Updating Views, Advantages and Disadvantages, View Materialization; Transactions; Access Control; Information Systems Life
Cycle; Database Application Life Cycle; Database Planning; System Definition; Requirements Collection & Analysis; Database Design; DBMS Selection; Implementation; Testing; Data
Administration & Database Administration; Entity Types; Relationship Types; Attributes; Strong & weak Entity Types; Attributes on Relationships; Structural Constrains; Problems with ER
Models; Specialization/Generalization For EERD; Constraints on Specialization/Generalization; Insertion Anomalies, Deletion Anomalies, Update Anomalies; Functional Dependency; Process
of Normalization; First Normal Form; Second Normal Form; Review of Normalization (1NF-BCNF); Introduction and overview of Database Design Methodology; Conceptual Database
Design Methodology; Logical Database Design Methodology; Comparisons of Logical and Physical Database Design; Overview of Physical Database Design; Physical Database Design
Methodology: Database Security; Counter Measures; Client Server Architecture and their advantages; Centralized and Distributed Databases; Advance Topics.
Text Book/s Modern Database Management By: Fred McFadden, Jeffrey Hoffer, Mary Prescott 5th Edition, Addison Wesley
Reference Material Database Systems - Principles, Design and Implementation By: Catherine Ricardo Macmillan Publishing Co.

Punjab University College of Information Technology, University of the Punjab http://www.pucit.edu.pk Page 6 of 18
Name: Tahir Rauf
B.Sc. Honors (Computer Science) Course Outline

Title Differential Equations

Code MT-203
Credit Hours 3
Prerequisite MT-102
Follow Up MT-204
Aims and Objectives 1. To encourage and motivate the students to think, to master the concepts by practice, to draw conclusions and to explore possibilities.
2. To make the subject matter not only more interesting for students but also more relevant to the world in which they are living.
3. To make the students familiar with the modern trend of computer programming & modeling.
Syllabus Basic Definitions, Preliminary theory, Method of separation of variable. Slop fields, Homogeneous differential equations, Exact equations. Non-Exact equations. Linear differential equation.
Bernoulli’s equation. Modeling Through differential equations. Population Growth model. Applications of First order differential Equations. Qualitative analysis Of solutions using software.
Non-linear differential equations and their solutions. Singular solutions. Clairaut’s equation. Second order linear differential equation. Solution of homogeneous Differential equations. Solution
of non homogeneous higher order Differential equations.
Variations of parameter. Application of second Differential equations. Laplace transform and its properties. Inverse Laplace transforms. Solution Of differential equations using Laplace
transforms. Fourier transform and its properties. Applications of Fourier transform. Terminologies in partial differential equations and its applications in heat, Wave and Laplace equations.
Text Book/s 1. Mathematical Techniques by D. K.H. Dar & Irfanul- Haq
2. Elementary Differential Equations &BVP by William E.Boyce and Richard.
Reference Material Fundamental of Differential equations & BVP by Nagle & Saff

Title Technical and Business Writing

Code EG-203
Credit Hours 3
Prerequisite EG-102
Follow Up None
Aims and Objectives Technical communication will be basically about writing skill, which is the requirement of a technically oriented profession, and the main purpose of this course is to enable the participants to
develop this skill as a prime need of their technical field.
Syllabus Writing Basics; Sentence Structure, Forms of Written Communication: Memos, Business Letters, Good News and Neutral Messages, Bad News Messages, Proposals and Business Plans,
Writing Proposals and Reports, Short Reports, Long Formal Repots, Specification Documents, Writing Technical Research Repots, Review of Language, Special Topics in Business
Communication, Documentation and Research Citation, The Job Application Process: CV’s and Resumes, The Job Application: Interview and follow up, Difficult Interview Questions – and
How to Respond to them. Preparing Oral Presentation, Writing the Presentation, Delivering Oral Presentation, Visual Aids, Oral Presentation of the Written Report.
Text Book/s Murphy, H.A & Hildebrandt, H.W. (1997). Effective business communications. Singapore: McGraw-Hill.
Reference Material

Title Computer Organization & Assembly Programming

Code CS-207
Credit Hours 3
Prerequisite EE-102
Follow Up CS-211
Aims and Objectives In this course student will be taught about the organization of a computer and Assembly Language Programming.
Syllabus Processor Architecture & Organization, Memory Architecture, Intel 8086 Registers, Addressing Modes, Memory Addressing, MOV The Basic Instruction, Debugger, Mathematical and Bit
wise Logical instruction, Stack Instruction, Interrupts, Memory Models, Practice of Program Writing and Debugging, Control Transfer and Conditional Action Instructions, Procedures, Macros,
Shift and Rotate Instructions, Procedures to input and Display Binary, Decimal, Hexadecimal Numbers, Reading DOS command Tail, Data Communication, File Handling, Recursion, Math co-
processor, String instructions, Introduction to Machine Code, Protected Mode, Terminate and Stay Resident Programs, Micro Controller programming(8051).
Text Book/s 1. The Architecture of Computer Hardware and Systems Software an IT Approach by Irv Englander (John Willey ans Sons Inc. ISBN 0-471- 31037-9)
2. Assembly language for Intel based computers by Kip .R Irvine 3rd Edition
Reference Material Using Assembly Language by Allen L. Wyatt Sr. (Que Inc. ISBN 0-88022-884-9)

Title Financial Accounting

Code MG-201
Credit Hours 3
Prerequisite None
Follow Up None
Aims and Objectives To learn accounting principles about book-keeping, preparation of financial statements and certain classified accounting methods, through the contents of this course specifically for the IT
students

Punjab University College of Information Technology, University of the Punjab http://www.pucit.edu.pk Page 7 of 18
Name: Tahir Rauf
B.Sc. Honors (Computer Science) Course Outline

Syllabus Introduction to Accounting, Accounting Systems, Financial Accounting Information, introduction to Financial Statements ( Previews ), Uses Of Financial Statements, The Accounting Equation,
The Accounting Cycle, Double Entry Accounting, The Journal, General Ledger, Special Ledgers, Net Income, Revenue & Expenses, rules for Revenue and Expenses, The Trial Balance,
Adjustments, Rectification of Errors, Preparing Financial Statements, Income Statement, Balance Sheet, Closing & Opening of New Books, The Work Sheet, Spread Sheet, Operating Cycle Of
A Company, Inventory & Cost of Goods Sold, Evaluation of Assets, Depreciation Methods, Cash Flow Statements, Preparing Cash Flow Statements, Financial Statements, Ratio Analysis,
Time Value Of Money
Text Book/s Accounting “The Basis of Business Decision” by Meigs & Meigs (Eleventh Edition)
Reference Material 1. Century 21, Accounting by Swanson, Ross, Hanson & Boynton (Third Edition)
2. Accounting Principles by Hermanson, Edwards & Salmonson (Fourth Edition)

Semester 4
Title Data Structures
Code CS-208
Credit Hours 4
Prerequisite CS-205
Follow Up CS-312, CS-315
Aims and Objectives ―An apprentice carpenter may want only hammer and saw, but a master craftsman employs many precision tools. Computer programming likewise requires sophisticated tools to cope with
complexity of real applications and only practice with these tools will build skill in their use. (Robert L. Kruse Data Structure and Program Design)‖. This subject deals to make students
convenient in building a memory and time efficient data structures for the implementation of large-scale (data intensive) computer systems.
Syllabus Topics: Introduction: Introduction to Course, Review of Object Oriented Programming Concepts. Algorithm Specification: Properties of Algorithm, examples, performance, analysis,
measurement, and Big Oh notation. Introduction to ADTs: Array and Polynomial as an ADT, Sparse Matrices, and Representation of Arrays. Bag ADT, The Stack ADT, Expressions, Postfix
Notation, and Infix to postfix conversion. Recursion: Recursive Definition and Processes, Writing Recursive Programs. Queue: The Queue ADT, Circular and Double Ended Queue. Self-
Referencing Classes and Dynamic Memory Allocation. Linked List: Singly Linked Lists, Circular Lists, Linked Stacks and Queues (Double Ended List), Doubly Linked Lists. Trees:
Introduction to Trees, Logical construction and Traversing of Binary Trees, Implementation of Binary Trees (Insertion and Traversing), Searching and deletion in Binary Trees, Binary Search
Tree, Introduction to Balanced and AVL Trees. Heaps: Heaps and Heaps as Priority Queues, Double Ended Priority Queue. Searching: Linear Search, Binary Search, and Types of Indexing.
Hashing: Hash Functions: Division; Overflow Handling: Chaining; Introduction to other advanced topics like:, B-Trees, etc Composite Data Structures: Multi-Stack, Multi-Queue, Generalized
List, etc. Sorting types and Techniques: Logical and Algorithmic Implementation of Selection, Bubble, Insertion, Shell, Radix, Merge, Quick, Heap, and Tree sorts. Graphs: Graph terminology,
Adjacency List and Adjacency Matrix and Adjacency list representation of Graph; Elementary Graph Operations: Breadth First Search and Depth First Search, Spanning Trees (BFSST,
DFSST).
Text Book/s 1. D. Samanta. “Classic Data Structures”, Prentice Hall, 2001
2. Ellis Horowitz, Sartaj Sahni, and D. Mehta “Fundamentals of Data Structures in C++”, 2nd Ed., Computer Science Press, 1995. ISBN 81-7808-792-8
Reference Material 1. Mark Allen Weiss, “Data Structure and Algorithms in C++”, Benjamin/Cumming
2. Adam Drozdek “Data Structure and Algorithm in Java” ISBN 0-534-37668-1
3. Tenenbaum, M. Augenstein, and Y. Langsam, “Data Structures using C and C++” 2nd Ed., Prentice Hall, 1999 ISBN 0-13-529322-7
4. http://www.nist.gov/dads (Dictionary of Algorithms and Data Structures)

Title Software Engineering-I

Code CS-209
Credit Hours 3
Prerequisite CS-206
Follow Up CS-313
Aims and Objectives  To introduce the fundamental concepts of Combinational and sequential Circuits Designing
 To be able to simulates circuits from soft wares.
 To introduce the internal working of a simple hypothetical microprocessor.
 To discuss the design (hardwired control and micro-programmed control) of processors.
 To provide the comprehensive knowledge about the need and working of different levels of memory (caches, main and virtual memory)
 To provide sufficient knowledge about Interfacing of a microprocessor with the memory and other I/O devices.
 To use Advanced techniques in the modern processors to increase performance (Pipelining, vector processing )
 To discuss in detail Multiprocessor Systems Design issues.
Syllabus The Scope of Software Engineering: Definition, Motivation and Need, Software Characteristics and Applications. The Software Process: Definition, Introduction to Software Development Life
Cycle, Software Process Models. Project Management Concepts: Essentials, 4Ps (People, Product, Process, Project); Software Measurement concepts: Project, Process, Product and Software
Quality Metrics, Software Cost Estimation techniques; Project Scheduling: GANTT chart, Critical Path Method. Requirements Engineering: Definition, Requirements Elicitation, Requirement
Traceability, Requirements Analysis and Specification. Software Designing: Elementary Concepts, Data Design, Software Architecture, Functional Independence, Interface Design,
Component-level Design, Coding Standards. Software Testing: Fundamentals, Verification & Validation, Testing Plan, Testing Techniques, White Box Testing and Black Box Testing, Test
Case Design, Unit Testing, Integration Testing, Validation Testing, System Testing, Debugging practices.

Punjab University College of Information Technology, University of the Punjab http://www.pucit.edu.pk Page 8 of 18
Name: Tahir Rauf
B.Sc. Honors (Computer Science) Course Outline

Text Book/s A - Roger S. Pressman ―Software Engineering- A practitioner’s approach‖, 5th Ed.
Reference Material 1. Ian Sommerville “Software Engineering”, 6th Ed.
2. An integrated approach to software engineering by Pankaj Jalote
3. Fundamentals of Software Engineering By Carlo Ghezzi
4. http://www.mhhe.com
5. http://www.sei-cmu.edu

Title Linear Algebra

Code MT-204
Credit Hours 3
Prerequisite MT-203
Follow Up MT-306, CS-420
Aims and Objectives  To provide a solid foundation in the course of Linear Algebra.
 To master the concepts, class assignment will be given after each lecture.
 To discuss some interesting applications so that students know when and how to apply linear algebra. Applications are taken from such areas as Cryptography, Fractals, Chaos, Computer
Graphics, Game of Strategy, Computer Tomography, Warps and Morphs.
 The Software MATLAB will be used for the implementation of Linear Algebra
Syllabus Concept of a matrix with real entries. Rectangular and square matrices. Dimension. Equality. Conjugate and transpose of a matrix.
Operations of Addition, multiplication and scalar multiplication of matrices. Determinant of a matrix and its properties. Singular and non-singular matrices Diagonal, triangular, symmetric,
skew-symmetric, Hermitian, skew- Hermitian, orthogonal and unitary matrices. Row/Column elementary Operations defined on a matrix Inversion of a matrix (by elementary operations) and
cryptography. Reduction of matrix into echelon and reduced echelon form by elementary operations. Rank of a matrix. Development of Algorithms. Introduction to system of linear equations.
Solution of system of linear equations by Gauss elimination method Gauss-Jordan elimination. LU-Decompositions. Development of algorithms. Comparison of methods. Sub groups, Cosets,
Lagrange’s theorem. Introduction to vector spaces. Linear dependence and independence of vectors. Concept of basis and dimension. Introduction to inner product spaces. Concepts of Norm,
angle and distance. The Gram-Schmidt Orthogonalization process. Orthonormal vectors and projections. Linear transformations. Kernel and Range. Matrix representations of a linear
transformation. Matrix transformations (dilation, contraction, reflection and rotation) Transformations defined by non-singular matrices. Translations and affine transformations. Applications in
computer graphics. Concepts of eigenvalue and eigenvector. Characteristic equation. Eigenvalues of an upper & lower triangular matrix. Diagonalization of matrices. Orthogonal
diagonalization of matrices. Matrix polynomials and Caylay-Hamilton theorem.
Text Book/s Anton - Rorres “Elementary Linear Algebra, application version”. 8th Edition, John Wiley & Sons, Inc. 2000
Reference Material 1. Bernard Kolman “Introductory Linear Algebra with applications”, Sixth Edition., Prentice Hall, 1997
2. Autar K. Kaw, “Introduction to matrix algebra,” Mechanical Engineering Department, University of South Florida, ENB 118, 2002.
3. http://ajax.prenhall.com
4. http://www.numbertheory.org/book/sol2.pdf
5. K.H.Dar and Irfan-ul-Haq Mathematical Techniques, Caravans Publishers, 2001

Title Distributed Database Systems (DDBS)

Code CS-210
Credit Hours 3
Prerequisite CS-206
Follow Up None
Aims and Objectives  Students would fully understand the concepts and technical issues of distributed environment of database.
 Explain the techniques used for data fragmentation, replication, and allocation during the distributed database design process
 Students should have good understanding of internal functionality of Query Processor, differences of central and distributed Query Processor and capable to build their own query
processor.
 Evaluate simple strategies for executing a distributed query to select the strategy that minimizes the amount of data transfer.
 To develop understanding of transaction, Issues regarding transaction management, types of transaction and their working in concurrent environment.
 Explain how the two-phase commit protocol is used to deal with committing a transaction that accesses databases stored on multiple nodes.
 Describe distributed concurrency control based on the distinguished copy techniques and the voting method.
 Recovery and reliability in distributed environment, will add more to student abilities in handling distributed environment of database

Punjab University College of Information Technology, University of the Punjab http://www.pucit.edu.pk Page 9 of 18
Name: Tahir Rauf
B.Sc. Honors (Computer Science) Course Outline

Syllabus Topics:
Introduction: Introduction of Distributed Data Processing; Promises of DDBMS; Complications of DDBMS; Problem Areas of DDBMS; Distributed DBMS Architecture: DBMS
Standardization; Architectural Models for DDBMS; DDBMS Architecture; Directory Issues; Distributed Database Design: DDBMS Design Strategies; Fragmentation: Horizontal, Vertical,
Hybrid; Allocation; Semantic Data Control: View Management; Data Security; Semantic Integrity Control; Query Processing: Query Processing Problem; Objectives of Query Processing;
Complexity Of Relational Algebras Operations; Characterization Of Query Processors; Layers Of Query Processing; Query Decomposition and Data Localization: Query Decomposition;
Localization of Distributed Data; Optimization of Distributed Queries: Query Optimization; Centralized Query Optimization; Join Ordering In Fragment queries; Distributed Query
Optimization Algorithms; Transaction Management: Definition of Transaction; Properties of Transaction; Types of Transactions; Architecture Revisited; Distributed Concurrency Control:
Serializability Theory; Taxonomy of Concurrency Control Mechanisms; Locking-Based Concurrency Control Algorithms; Timestamp-Based Concurrency Control Algorithms; Optimistic
Concurrency Control Algorithms; Deadlock Management; Relaxed Concurrency Control; Distributed DBMS Reliability: Reliability Concepts and Measures; Failures and Faults Tolerance In
Distributed Systems; Failures In DDBMS; Local Reliability Protocols; Distributed Reliability Protocols; Dealing with Site Failures.
Text Book/s 1. M. Tamer Ozsu and Patrick Valduriez “Principles of Distributed Database Systems”, 2 nd Ed., Prentice hall, 2002.ISBN 0-l3-b597907-b
2. Palraj Punniah “Fundamentals of Data Warehouse”
Reference Material 1. Reference Books
2. Online Material URL

Title Computer Architecture

Code CS-211
Credit Hours 3
Prerequisite CS-207
Follow Up CS-315
Aims and Objectives  To introduce the fundamental concepts of Combinational and sequential Circuits Designing
 To be able to simulates circuits from soft wares.
 To introduce the internal working of a simple hypothetical microprocessor.
 To discuss the design (hardwired control and micro-programmed control) of processors.
 To provide the comprehensive knowledge about the need and working of different levels of memory (caches, main and virtual memory)
 To provide sufficient knowledge about Interfacing of a microprocessor with the memory and other I/O devices.
 To use Advanced techniques in the modern processors to increase performance (Pipelining, vector processing )
 To discuss in detail Multiprocessor Systems Design issues.
Syllabus Introduction: Introduction to Course, Review of Digital Logic and Design. Register Transfer Language: Register Transfer, Bus and Memory Transfers, ALU Designing; Arithmetic Micro
operations, Logic micro operations, Shift micro operations, Arithmetic Logic Shift Unit. Instruction set Designing :Instruction codes, Computer Registers, Computer Control Unit Designing
(Hard Wired): instructions, Timing and control Instruction Cycle, Memory-reference instruction Input-output and interrupt Cycle, Design of Basic computer: Control Logic Gates, Design of
Accumulator .Control Unit Designing (Micro programmed): Control Memory, Address sequencing, Micro Program Example, Micro program Sequencer.. Processor’s Organization:
Accumulator Organization, General Register Organization, Stack Organization Instruction Formats (from CPU Organization’s point of views): zero address, One address, two address and three
address instructions, Addressing Modes: Directly in memory and indirection through registers Instruction Types: Data Transfer, Control Transfer, Arithmetic and Logic Instruction Design
Philosophies: RISC and CISC, Overlapped Register Window . Parallel System classification: SISD, SIMD, MISD, MIMD Single Instruction Single Data Systems. Pipelining, Instruction
pipelining, pipelining Hazards and their solutions (Hardware and software) Single Instruction Multiple Data Systems: Vector Processor and its applications in super computers e.g. Matrix
Multiplications INPUT-OUTPUT ORGANIZATION: Devices and interfaces, isolated versus memory-mapped I/O.AsynchronousData Transfer: Strobe and Handshaking, Asynchronous
communication interfaces. Buffer Designing, Modes of Transfer; Programmed I/O, Interrupt-initiated I/O Direct Memory Access. Priority Interrupt; Serial Daisy Chain and Parallel Priority
Interrupt. IO Processor and Serial Communication. MEMORY ORGANIZATION: Memory Hierarchy; Memory address space using RAMs, Auxiliary Memory. Associative Memory:
Matching Logic, Read and Write mechanism. Cache Memory: Mapping techniques; Associative mapping, Direct mapping, set-associative mapping. Virtual Memory: MULTIPROCESSORS
SYSTEMS (MIMD): Multiprocessor (shared memory) and multicomputer (distributed) systems. Processor’s interconnection structure forms. Interprocessor communication and
synchronization: cache coherence problem and its solution.
Text Book/s 1. M.Morris Mano,“Computer System Architecture”, 3rd Ed., Prentice Hall International, ISBN 0-13-175738-5
2. William Stallings, “Computer Organization and Architecture”, 6th Ed., Prentice Hall International, ISBN-81-203-2103-0
3. Rafiquzzaman & Chandra,”Modern Computer Architecture”, Galgotia Publications Pvt. Ltd
Reference Material

Title Statistics & Probability

Code MT-205
Credit Hours 3
Prerequisite None
Follow Up None
Aims and Objectives Basic Probability Theory. Discrete and Continuous Random Variables. Functions of Random Variables. Expectations. Joint Distributions. Moment generating functions. With a clear focus on
understanding, we study what are sources of sampling and non-sampling errors. After a brief review of the probability needed for Statistics, we study the graphical presentation of data and
concepts of measures of location and dispersion of means. This naturally leads to confidence intervals and hypothesis test for average and percentages. Finally, simple linear regression is
covered. To encourage students’ participation, we plan to have open book assignments during the class.
Punjab University College of Information Technology, University of the Punjab http://www.pucit.edu.pk Page 10 of 18
Name: Tahir Rauf
B.Sc. Honors (Computer Science) Course Outline

Syllabus Introduction to Statistics in Computer Science, Pure Probability, Random Variables (Discrete and Continuous, Joint Random Variables), Probability Distribution (Discrete and Continuous,
Binomial, Hypergeometric, Poisson, Normal, Exponential, Beta distributions., Sampling, Sampling Distributions (for mean large and small sample, difference between means for large and
small samples, proportions, t distribution, chi square distribution), Estimation, point and confidence interval estimation (mean for large and small sample, difference between mean for large and
small samples, proportions), Hypothesis Testing (for mean, difference between mean, proportion, independence of variables), Regression and Correlation.
Text Book/s R.E Walpole, R.H. Myers and S.L Myers, “Probability and Statistics For Engineers and Scientists”, 6 th Edition
Reference Material 1. Schaum’s Ser,“ Statistics ”, 3rd Edition, McGraw Hill
2. Modern Elementary Statistics by John E. Freund. Prentice / Hall International editions.
3. Introduction to statistics Walpole
4. Introduction to statistics S.m. Chaudri

Semester 5
Title Analysis of Algorithms
Code CS-312
Credit Hours 3
Prerequisite CS-208
Follow Up CS-420
Aims and Objectives The primary goal of this course is to teach how to design and analyze algorithms. In this class we will cover a number of ideas and techniques useful for designing and analyzing data structures
and algorithms. In particular, we will introduce techniques for analyzing upper bounds for algorithms and lower bounds for problems. Problem areas include sorting, graphs, dynamic
programming, NP-Completeness. The material will be presented in the two weekly lectures.
Syllabus Role of Algorithm in Computing: Algorithms, Algorithms as a technology, Getting Started: Insertion Sort, Analyzing Algorithms, Designing Algorithms Growth of Functions: Asymptotic
Notations Recurrence: The Substitution Method, Recursion Tree Method, The Master Method Heap: Heapsort, Maintaining a Heap Property, Building a Heap, Heap sort Algorithm, Priority
Queues Quick sort: Description of Quick sort, Performance of Quick sort Sorting in Linear time: Lower Bound for Sorting, Counting Sort, Radix Sort, Bucket Sort Dynamic Programming:
Dynamic Programming, Matrix Chain Multiplication, Knapsack Problem Greedy Algorithms: Elements of greedy Strategy, Huffman Code Elementary Graph Algorithm: Some Concepts about
Graph, Representation of Graph Breadth First Search, Breadth First Search, Depth First Search, Topological Sort Minimum Spanning Tree: Krushkal Algorithm, Prims Algorithm Single Source
shortest paths: Bellman Ford Algorithm, Single Source Shortest paths in directed acyclic graph, Dijkstra’s Algorithm All Pair shortest Paths: Floyd Warshall Algorithm String Matching: Naïve
Method, String Matching with finite Automata, Knuth Morris Pratt Algorithm
Text Book/s Introduction to Algorithms by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, MIT Press, Second Edition, 2001
Reference Material Algorithms in C++ By Robert Sedgewick Addison Wesley

Title Principle of Philosophy

Code HU-302
Credit Hours 3
Prerequisite None
Follow Up None
Aims and Objectives The basic aim of this subject is to teach all aspects of philosophy in the world.
Syllabus Definition of Philosophy, Philosophy Base Reality, Why philosophy important, Nature and Scope of Philosophy, Philosophy and its Branches, Philosophy as mother of all sciences, Knowledge,
Sources of Knowledge, What is Truth, Existence of God On the basis of reasoning, Problem of Evil, Reason and Revelation, Freedom and Determinism, Ethics, Philosophy of Education,
Philosophy of Science, Pragmatism, Pragmatism and Society, Existentialism, Morality, Symbolic Login
Text Book/s An Introduction to Philosophy By John Ahoper
Reference Material

Title Web Programming

Code CS-314
Credit Hours 3
Prerequisite CS-205
Follow Up CS-316
Aims and Objectives The goal of this course is to enable Students who are unfamiliar with the Java language to master the language fundamentals so that they may quickly move on to the rest of the Advance Java
(J2EE) platform.
 Students can think according to java environment
 Able to solve problems with in java context
Syllabus Introduction to internet in context of java, History and Introduction to java Language, Introduction to java Application, Language Basics, Java API, Object Based and Object Oriented
Programming in Java, Introduction to Applet, Control Structures, Arrays, Strings and Characters, GUI programming in Java, Event Handling, Exception Handling, Multithreading, Files and
Streams, Networking, Remote Method Invocation, Multimedia Animation and Audio, Java Database Connectivity (JDBC) , Servlet, Java Server Pages, RMI, XML

Punjab University College of Information Technology, University of the Punjab http://www.pucit.edu.pk Page 11 of 18
Name: Tahir Rauf
B.Sc. Honors (Computer Science) Course Outline

Text Book/s 1. Learn java script and HTML in 24 days

2. Java 2 Complete reference
3. Java network programming
4. Core servlet and java server pages
Reference Material 1. Java servelet programming (orielly series)
2. Advance java2 platform
3. Professional JSP(by wrox series)
4. The Complete Reference HTML (Thomas A. Powell)
5. Mastering Java Script and Jscript (James Jaworski)
6. www.java.sun.com
7. www.javaworld.com
8. http://www.apl.jhu.edu/
9. http://www.javaboutique.internet.com/

Title Software Engineering-II

Code CS-313
Credit Hours 3
Prerequisite CS-209
Follow Up CBSE
Aims and Objectives The students should be able to develop their software systems in a disciplined way. They should have all necessary documentation skill and should follow the phase-by-phase approach towards
software development. The students should be proficient enough to analyze, evaluate and apply a set of CASE tools in a given area of software development in order to compete local and
international market
Syllabus Object Oriented Concepts, Object Oriented Analysis & Design Basics, Unified Process & Rational Unified Process, RUP Phases and disciplines, Introduction to UML, Unification, UML
Diagrams, Case Study analysis and basics, Inception, Requirements Understanding, Types of requirements, Requirement Traceability Matrix, Use Case Modeling, System level use case
diagram, Identification of other requirements, Supplementary specifications, Vision Document, Glossary, Activity Diagram, Rational Rose overview, Usecase & Activity diagram modeling in
Rose, Elaboration, Interaction Diagrams, System Sequence Diagram, Domain Model, Use case Operational Contracts, Interaction Diagram, Collaboration Diagrams, Use Case relationships,
Analysis level use case diagram, State Chart Diagram, Introduction of Design Patterns, GRASP: Information Expert, Creator, GRASP: Cohesion & Coupling, Controller, Design Class
Diagram, Mapping Data Model to Domain Model, Coding patterns, Mapping Design to Code, More Patterns for Assigning Responsibilities, Polymorphism, Pure Fabrication, Indirection,
Protected Variation, GoF Design Patterns, Creational, Structural, and Behavioral patterns, Creational Patterns: Abstract Factory, Builder, Factory Method, Prototype, Singleton, Structural
Patterns: Adapter, Bridge, Façade, Composition, Behavioral patterns: Chain of Responsibility, Command, Memento, Strategy, Observer
Text Book/s Craig Larman “Applying UML and design Patterns”, 3rd Ed.
Reference Material

Title Principles of Management

Code MG-302
Credit Hours 3
Prerequisite None
Follow Up MG-303
Aims and Objectives This course, principles of Management will emphasizes the approach, techniques, and activities that software engineers will undertake in practical life. This course is designed for the computer
science students who would exhibit managerial skills in their respective fields.
Syllabus Historical overview of management and organizations, Introducing management and managers, Managerial roles in organizations, Managerial functions i.e. POLCA, Management levels and
skills. 21st century management, Management ideas; yesterday and today, Classical view of management; Scientific and Bureaucratic, (Classical) Administrative view of management, Human
relations/ Behavioral theories of management, Quantitative and Contemporary/Emerging viewpoints, System’s view of organizations, Analyzing external and internal environment of
organization. Understanding organization culture, Organizational social and ethical responsibility and 21st century’s other trends and issues. Globalization, SAARC and WTO. Learning POLCA
as the job of the manager. Planning: Why and What Decision making and decision taking, Rational decision making process and nature of decision making problems, Types of problems and
managerial decisions, Bounded rationality and non-rational models, Creativity and decision making. Lateral thinking. Planning and decision aids, SWOT analysis, Forecasting, competitive
intelligence and bench-marking, Budgeting, scheduling, GANTT charts, PERT network, project management and scenario analysis, Functions and benefits of planning. Nature of organizational
goals and its link with plans, Planning process and levels of goals, Time span of goals and plans. Management by Objective, Strategic management – 1, Strategic management -2, Levels of
strategy. BCG and Porter’s model, Entrepreneurship and promoting innovation, Organizing: Key concepts and nature of organizational structure / organization chart, Job design, job
specialization. Grouping jobs and Departmentalization, Chain of command and span of control. Degree of centralization and delegation. Line and staff authority, Organization design. Organic
vs mechanistic vs virtual design and effect of technology on structure, Leading: Motivating self and other persons around, Nature of motivation. Type of motivators, Maslow’s hierarchy of
needs theory and its analysis, Other need theories. Cognitive theories of motivation, Using goal setting theory, reinforcement theory and open book management for motivation, Motivating
knowledge workers. Leadership process and how leaders influence. Searching for leadership traits and theories, Behavioral and Contigency / Situational models of Leadership, Strategic
leadership models. Transactional, Transformational, and Visionary leadership. Ethical and un-ethical charismatics, Gender, culture and leadership. Understanding group behavior and type of
groups in organization,
Text Book/s Bartol, Kathryn and Martin, David Management: 3rd Ed., McGraw-Hill Inc.2003; Robbins, Stephen and Coulter, Mary Management 7th Ed, Prentice Hall Inc. 2002

Punjab University College of Information Technology, University of the Punjab http://www.pucit.edu.pk Page 12 of 18
Name: Tahir Rauf
B.Sc. Honors (Computer Science) Course Outline

Reference Material Management By Kathryn M. Bartol & David C. Martin

Title Operating System Concepts

Code CS-315
Credit Hours 3
Prerequisite CS-211, CS-208
Follow Up CS-317
Aims and Objectives This course provides understanding of operating systems through Examination of theoretical concepts under ruling various operating Systems components algorithms and techniques used
within Operating systems. A hands-on project involving design and Implementation of these components is also covered in the course
Syllabus What is Operating System, user view, system view, system goals, Main Frames System, multi programmed System, batch system Time sharing system, Desktop System, Multiprocessor system,
distributed system, client server, Real time system, Hand held System Computer System Operation, I/O Structure, I/O interrupts, DMA structure, Storage Structure, Main memory, Magnetic
disks, Magnetic tapes Caching, Coherency and consistency, Hardware protection, Dual mode operation, I/O protection, Memory protection, CPU protection, System components, Process
management, protection system, Command interpreter system, op system services, System calls, Process control, Communication, System program, System structure, layered approach,
microkernel, Virtual machines. Process concept, Process control block, Process Scheduling, Operations on process, Cooperating process, Inter process communication, and synchronization
.What is thread, benefits, user and kernel threads, multithreading models Basic concepts, CPU & I/O burst cycles, CPU schedulers, CPU criteria, Scheduling Algorithms, Multilevel queue
scheduling, Background, Critical section problem, Multiprocessor solution, Synchronization hardware semaphores, Implementation Deadlock and starvation, Binary semaphores Classic
problems of semaphores, Critical regions, monitors System deadlocks, Deadlock characterization, Resource allocation graph Methods for handling deadlock, deadlock prevention, No
preemption, circular wait, Deadlock avoidance Safe state, Bankers algorithm, Deadlock detection, Deadlock recovery Back ground, Address binding, logical vs. physical addresses, Dynamic
loading, Dynamic linking & shared libraries Overlays, Swapping, Contiguous memory allocation, memory protection, Memory allocation, Fragmentation, Paging, Hardware support, Structure
of page table, Segmentation, Segmentation with paging. Background, Demand paging, Performance of demand paging, Process creation.
Page replacement, FIFO page replacement, LRU page replacement, Allocation of frames, Thrashing, Working set model, File concept, File types, Access methods, Directory structure File
system mounting, File sharing, Protection File system structure, File system implementation, overviews Virtual file system Directory implementation, Allocation methods Free space
management, Efficiency and performance, Recovery, Log structured file systems, NFS Goals of protections, Domain of protection, Access matrix, Capability based systems, Language based
protection
Text Book/s Operating Systems Concepts by Silbershatz, Galvin, Gagne, Addison Wesley
Reference Material 1. Modern Operating Systems, A ndrew. S. Tanenbaum
2. Operating Systems, William Stallings, 3rd edition

Semester 6
Title Data Communication Networks
Code CS-318
Credit Hours 3
Prerequisite CS-102, CS-101
Follow Up None
Aims and Objectives This course provides an introduction to the basic concepts and principles involved in computers communication with each other and the problems that affect this communication in relation to
computer networks, the importance of communications network architectures, the range of communication mediums, the necessity of international standards and the standards organizations.
The course will also discuss the OSI and TCP/IP reference models and follows these models in spirit. The course will cover the physical layer, data link layer all the way up to the application
layer Architecture including some of the Practical Approach behind. The course is divided into some modules consisting of first part as General Communication Concepts. Second module will
cover the Computer-to-Computer Communications. Other modules will cover LAN, WAN and Internet Applications.
Syllabus Topics:
Historical overview of management and organizations, Introducing management and managers, Managerial roles in organizations, Managerial functions i.e. POLCA, Management levels and
skills. 21st century management, Management ideas; yesterday and today, Classical view of management; Scientific and Bureaucratic, (Classical) Administrative view of management, Human
relations/ Behavioral theories of management, Quantitative and Contemporary/Emerging viewpoints, System’s view of organizations, Analyzing external and internal environment of
organization. Understanding organization culture, Organizational social and ethical responsibility and 21 st century’s other trends and issues. Globalization, SAARC and WTO. Learning POLCA
as the job of the manager. Planning: Why and What Decision making and decision taking, Rational decision making process and nature of decision making problems, Types of problems and
managerial decisions, Bounded rationality and non-rational models, Creativity and decision making. Lateral thinking. Planning and decision aids, SWOT analysis, Forecasting, competitive
intelligence and bench-marking, Budgeting, scheduling, GANTT charts, PERT network, project management and scenario analysis, Functions and benefits of planning. Nature of organizational
goals and its link with plans, Planning process and levels of goals, Time span of goals and plans. Management by Objective, Strategic management – 1, Strategic management -2, Levels of
strategy. BCG and Porter’s model, Entrepreneurship and promoting innovation, Organizing: Key concepts and nature of organizational structure / organization chart, Job design, job
specialization. Grouping jobs and Departmentalization, Chain of command and span of control. Degree of centralization and delegation. Line and staff authority, Organization design. Organic
vs. mechanistic vs. virtual design and effect of technology on structure, Leading: Motivating self and other persons around, Nature of motivation. Type of motivators, Maslow’s hierarchy of
needs theory and its analysis, Other need theories. Cognitive theories of motivation, Using goal setting theory, reinforcement theory and open book management for motivation, Motivating
knowledge workers. Leadership process and how leaders influence. Searching for leadership traits and theories, Behavioral and Contigency / Situational models of Leadership, Strategic
leadership models. Transactional, Transformational, and Visionary leadership. Ethical and un-ethical charismatics, Gender, culture and leadership. Understanding group behavior and type of
groups in organization.
Punjab University College of Information Technology, University of the Punjab http://www.pucit.edu.pk Page 13 of 18
Name: Tahir Rauf
B.Sc. Honors (Computer Science) Course Outline

Text Book/s 1. Data and Computer Communications by William Stallings, sixth edition
2. Computer Networks and Internets by Douglas E. Comer
Reference Material

Title Modern Programming Languages

Code CS-316
Credit Hours 3
Prerequisite CS-314
Follow Up None
Aims and Objectives Programming languages are important to students of all disciplines of Computer Science. The main objectives of this course are:
 This course intends to provide comparative studies among different programming paradigms.
 To provide a deeper insight into the design, structure and architecture of programming languages.
 To understand the main principles and working of the modern programming languages.
 To understand not only ―how‖, but also ―why‖ things work in a specific way.
 To understand the relationship between formal specifications for syntax and semantics and the implementation of the language.
Syllabus Preliminaries: Programming Domains, Language Evaluation Criteria, Influences on Language Design; Language Categories: Language Design Trade-Offs, Implementation Methods,
Programming Environments; Evolution of the Major Programming Languages the language categories, scripting, structuring, object oriented, web development and mark up languages;
Describing Syntax and Semantics: General Problems, Formal Methods, Attribute Grammars, Meanings of Programs: Dynamic Semantics; Lexical and Syntax Analysis: Lexical Analysis,
Parsing Problem, Recursive-Descent Parsing, Bottom-Up Parsing; Names Bindings Type Checking and Scopes: Names, Variables, Concept of Binding, Type Checking, Scope; Data Types
and Abstract Data Types: Encapsulation Concepts, Data Abstraction, Design Issues for Abstract Data Types, Parameterized Abstract Data Types; Expressions and Assignment Statements:
Arithmetic Expressions, Overloaded Operators, Type Conversions, Relational and Boolean Expressions, Assignment Statements, Mixed-Mode Assignment; Statement-Level Control Structures:
Selection Statements, Iterative Statements, Unconditional Branching, Guarded Commands; Subprograms: Local Referencing Environments, Parameter-Passing Methods, Parameters that are
Subprogram Names, Overloaded Subprograms, Design Issues for Functions, Coroutines; Implementing Subprograms: Nested Subprograms, Blocks, Dynamic Scoping; Support for Object-
Oriented Programming: Object-Oriented Programming, Design Issues for Object-Oriented Languages, Object-Oriented Constructs; Concurrency: Subprogram-Level Concurrency, Semaphores,
Monitors, Message Passing, Java Threads, C# Threads, Statement-Level Concurrency; Functional Programming Languages: LISP, Scheme, COMMON LISP, ML, Advance issues; Platform
independence and Inter-language operability; Web Services: support for web services in Java and C#; Logic Programming: Overview of Logic Programming, different Logic Programming
languages;
Text Book/s A. Sebesta R, Concepts of Programming Languages, Addison Wesley, 2004 6 th Edition, ISBN: 0-321-19362-8
Reference Material 1. Comparative Programming Languages, R. Clark., 3rd Edition. Addison-Wesley, 2001, ISBN: 0-201-71012-9
2. Programming Languages: Design and Implementation, T. Pratt and M. Zelkowitz. 4th Edition. Prentice Hall, 2001.
3. Programming Languages: Concepts and Constructs, R. Sethi. 2nd Edition. Addison Wesley, 1995
4. Structure and Interpretations of Computer Programs by Harold Abelson,Geral Jay Sussman, 2nd Edition, MIT Press 2003
5. Concepts, Techniques, and Models of Computer Programming by Peter Van Roy and Seif Haridi MIT Press, 2004

Title Numerical Analysis

Code MT-306
Credit Hours 3
Prerequisite CS-205, MT-204
Follow Up None
Aims and Objectives This course is concerned with the design and analysis (Stability, Consistency, Convergence, Accuracy) of methods for solving mathematical problems that arise in many fields, especially
science and engineering. Scientific Computing is now mentioned as a third branch, having a status that is essentially equal to, perhaps even eclipsing, that of its two older (theoretical and
experimental) siblings. This is due to efficient numerical techniques (which you shall learn during the course). We can thus simulate any physical process numerically, and this leads to the
routine solution of complicated problems that would have seemed impossible not so long ago. This course will be taught using JAVA / MATLAB/MAPLE.
Syllabus Review of Calculus (Rolle’s Theorem, Mean Value Theorem, Taylor’s & Maclaurin’s series), Computer arithmetic, Error & its measurements (absolute error, relative error, percentage error),
types of error, sources of error. Solution of Equations In One Variable: The Bisection Method, Fixed-Point Iteration, Newton-Raphson Method, Secant Method, Method Of False Position, Error
Analysis for Iterative Methods; Interpolation and Polynomial Approximation: Interpolation and Language Polynomial, Divided Difference:(Newton forward divided –difference formula &
backward divided –difference formula), Cubic Splines Interpolation, Hermite Interpolation, Natural cubic splines, Cubic B-splines, Parabolic and Cubic Runout Splines, Beta-Splines, Bezier
Cures and Surfaces; Numerical Differentiation and Integration: (Forward-difference &backward-difference formulas, Trapezoidal rule & Simpson’s rule), Composite Numerical
Integration:(Composite Trapezoidal & Simpson’s rules), Initial –value Problems for Euler’s Method, Second-Order Taylor’s Series Methods, Modified Euler Method, Runge - Kutta Method of
order 4; Iterative Techniques in Matrix Algebra: Norms of a matrix, Spectral radius & condition number, Approximating Eigenvalues and Eigenvectors by Power Method, LU decomposition.
Iterative Techniques for solving linear systems: Jacobi Iterative, Gauss-seidel Iterative
Text Book/s Richard L. Burden & J. Douglas Faires “Numerical Analysis ”,7th Ed., Publisher’s FAQ, 2001,
Gerald / Wheatley “Applied Numerical Analysis”, 6th Ed, Publisher’s FAQ, 2001.
Reference Material Gerald Farin, Curves and Surfaces for Computer Aided Geometric design, 2nd edition, Academic Press, INC, 1990
Numerical Analysis, Saeed Aktar Bhatti, Al-Fazal Market, A-one Publishers, Lahore, Pakistan.

Punjab University College of Information Technology, University of the Punjab http://www.pucit.edu.pk Page 14 of 18
Name: Tahir Rauf
B.Sc. Honors (Computer Science) Course Outline

Title System Programming

Code CS-317
Credit Hours 3
Prerequisite CS-315
Follow Up None
Aims and Objectives In this course Windows Programming will be taught in depth
Syllabus Introduction: Overview of System Programming, Technology Impact on Programs, Overview of UNIX and UNIX Derivatives. Programming and Standards: ANSI, POSIX, Program and
Program Environment, Writing and Using System Libraries. Process Management: Process Creation and Termination, Process Return Status, exec Family of System Calls, Background
Process and Daemons. Low Level I/O: I/O Redirection and File Locking, System Level Files and Directory, Hard and Symbolic Links. Special Files: PIPEs and FIFOs, Terminal Control,
Device Associated files. Signals Handling: sigaction, Waiting for Signals, Asynchronous I/O Programming, CPU Timer and Real Time Signals. Threads Management: Creation and
Cancellation, Detaching and Joining, Thread Specific Data, Thread Safety, User and Kernel Threads. Thread Synchronization: Mutual Exclusion Locks (mutex), Conditional Variables, Signal
Handling in Threads, Deadlock Avoidance. Interprocess Communication: Critical Sections and Semaphore, POSIX:XSI Semaphores Set, POSIX:XSI Shared Memory, POSIX:XSI Message
Queues, Mapped Memory. Connection Oriented Communication: Communication Channel, Universal Internet Communication Interface (UICI). Connectionless Communication: Socket
with UDP, Multicast. SUN Remote Procedure Calls: rpcgen, Procedure Arguments, Authentication, External Data Representation (XDR) and Marshaling, RPC Packet Format. Device
Drivers: Devices; Writing, Compiling, Attaching and Detaching of Kernel Modules; Registering, Opening, Reading, Releasing, Seeking and Pooling Character Devices. Inline Assembly:
Inline and Extended Assembly Syntax, Optimization, Maintenance, and Portability Issues.
Text Book/s 1. Kay A. Robbins, Steven Robbins, “UNIX System Programming, Communication Concurrency and Threads”, 2 nd Ed., Prentice Hall, 2003. ISBN 81-297-0469-2
2. Terrence Chan, “UNIX System Programming Using C++”, 2 nd Ed., Prentice Hall, 2001. ISBN 0-8120-31468-9
3. Mark Mitchell, Jeffrey Oldham, and Alex Samuel “Advance Linux Programming”, 1 st Ed., New Riders Publishing, 2001. ISBN 0-7357-1043-0
4. W. Richard Stevens, “UNIX Network Programming Volume 2, Inter Process Communication”, 2 nd Ed., Prentice Hall, 2003. ISBN 81-203-2062-X
5. Neil Mathew, Richard Stones, “Beginning LINUX Programming”, 3rd Ed., Wiley Publishing, 2004, ISBN: 0-7645-4497-7
Reference Material 1. W. Richard Stevens, “Advance Programming in the UNIX Environment”, 2nd Ed., Prentice Hall, 1993. ISBN 81-7808-096-6
2. Cameron Hughes, Tracey Hughes, “Parallel and Distributed Programming Using C++”, 2nd Ed., Prentice Hall, 2003. ISBN 81-297-0405-6
3. W. Richard Stevens, “UNIX Network Programming Volume 1, Networking APIs and XTI”, 2nd Ed., Prentice Hall, 2003. ISBN 81-7808-014-1
4. Ori Pomer, “Linux Kernel Module Programming Guide” 3rd Ed., 1998, Macmillan Computer Publishing, ISBN: 0-7357-1043—0
5. Rubini, Corbet, “Linux Device Drivers” 2nd Ed., Macmillan Computer Publishing, 1998, ISBN: 0-7357-1043-0
6. Eric Steven Raymond, “The Art of Unix Programming”, 1st Ed. Addison-Wesley Pub Co, 2003, ISBN: 0-1314-2901-9
7. Tim Parker, Timothy Parker, “Linux Unleashed” 3rd Ed., Macmillan Computer Publishing, 1998, ISBN: 0-6723-1372-3
8. J. Purcell, “Linux Complete Command Reference”, 1st Ed, MacMillan Publishing Company, 1997, ASIN: 0-6723-1104-6
9. GCC Home Page http://gcc.gnu.org/
10. Online Linux Documentation Project http://www.tldp.org/

Title Human Resources Management

Code MG-303
Credit Hours 3
Prerequisite MG-302
Follow Up None
Aims and Objectives A major issue is the changing role of HR in organizations. Where HR was once a clerical function that was relegated to the lower echelons of the organization, today more and more companies
have elevated the HR function to an integral part of the senior planning team. Having students research and show these types of changes in organizations may be a useful and important learning
tool.

Punjab University College of Information Technology, University of the Punjab http://www.pucit.edu.pk Page 15 of 18
Name: Tahir Rauf
B.Sc. Honors (Computer Science) Course Outline

Syllabus Strategic Overview: The Manager’s Human Resource Management Jobs, Why is HR Management Important to all Managers?, Cooperative Line & Staff HRM: An Example, Strategic
Planning and HR Management, The Basics of Strategic Planning, The Strategic Planning Process, Basic Strategic Trends, Managerial Consequences of the Basic Trends, HR’s Strategic Role,
HR’s Evolving Role, Strategic Human Resource Management, HR’s Role as a Strategic Partner, HR and Technology, Why Careful Selection is Important, Basic Testing Concepts, Validity,
Reliability, How to Validate a Test, EEO Aspects of Testing, Test Takers’ Individual Rights and Test Security, Basic Features of Interviews, Types of Interviews, The Appraisal Process, The
Supervisor’s Role, Steps in Appraising Performance, How to Clarify Expectations, Appraisal Methods, Graphic Rating Scale Method, Alternation Ranking Method, Paired Comparison Method,
HR’s Role in Organizational Change, Managing Organizational Change and Development, What to Change, Leading Change: Lewin’s Process, A 10-Step Change Process, Using
Organizational Development, Instituting Total Quality Management Programs, What is Quality?, Total Quality Management Programs, HR’s Role in Quality Management, Employment
Planning and Forecasting, How to Forecast Personnel Needs, Forecasting the Supply of Inside Candidates, Forecasting the Supply of Outside Candidates, Effective Recruiting, The Recruiting
Yield Pyramid, Strategic Overview: Orienting Employees, Why Orientation is Important, Using Orientation to Reduce Stress, The Training Process, Why the Training Business is Booming,
The Five-Step Training and Development Process, Training and Learning, Motivate the Learner, Legal Aspects of Training, Analyzing Training Needs, Task Analysis: Assessing New
Employees’ Training Needs, Performance Analysis: Assessing Current Employees’ Training Needs, Traditional Training Methods, On-the-Job Training, Apprenticeship Training, Informal
Learning, Job Instruction Training, Lectures, Programmed Learning, Audiovisual Tools, Simulated Training, Electronic Training, Computer-Based Training, Electronic Performance Support
Systems (EPSS), Distance and Internet-Based Training; HR.net: HR Employee Performance and Commitment, The Nature of Job Analysis, Job Analysis Defined, Uses of Job Analysis
Information, Steps in Job Analysis, Methods of Collecting Job Analysis Information, Introduction, The Interview, Questionnaire, Observation, Participant Diary/Logs, U.S. Civil Service
Procedure, Quantitative Job Analysis Techniques, Using Multiple Sources of Information, Writing Job Descriptions, Job Identification, Job Summary, Relationships, Responsibilities and
Duties, Work Samples and Simulations, Work Sampling for Employee Selection, Management Assessment Centers, Video-Based Situational Testing, The Miniature Job Training and
Evaluation Approach, Other Selection Techniques, Background Investigations and Reference Checks, Pre-employment Information Services, The Polygraph and Honesty Testing, Are
Interviews Useful?, What Can Determine an Interview’s Usefulness?, First Impressions, Misunderstanding the Job, Candidate-Order (Contrast) Error and Pressure to Hire, Nonverbal Behavior
and Impression Management, Effect of Personal Characteristics: Attractiveness, Gender, Race; Strategic HR: Is There a ―One Best Way‖?, Working Conditions and Physical Environment,
Writing Job Specifics, Specifications for Trained Versus Untrained Personnel, Job Specifications Based on Judgment, Administering the Interview, Complying with Immigration Law, Training
for Special Purposes, Literacy Training Techniques, AIDS Education, Training for Global Business, Diversity Training, HR and Employee Involvement Programs; The New Workplace: HR
and Business Process Reengineering, What is Business Process Reengineering?, HR’s Role in Reengineering Processes, Flexible Work Arrangements, Flextime and Compressed Workweeks,
Standards of Performance, Recruiting Minorities and Women, Welfare-to-Work, The Global Talent Search, Developing and Using Application Forms, Purpose of Application Forms, Equal
Opportunity and Application Forms, Alternative Dispute Resolution, Using Application Forms to Predict Job Performance, Designing and Conducting the Effective Interview, The Structured
Situational Interview, How to Conduct and Interview, Research Insight: Job Specifications Based on Statistical Analysis, Internal Sources of Candidates, Finding Internal Candidates, Hiring
Employees—The Second Time Around, Succession Planning, Outside Sources of Candidates, Advertising, Employment Agencies, Temp Agencies and Alternative Staffing, Executive
Recruiters, The Issue of Privacy, Using Tests at Work, Computer-Interactive Testing, Types of Tests, Tests of Cognitive Abilities, Tests of Motor and Physical Abilities, Measuring Personality
and Interests, Graphology, Physical Examination, Substance Abuse Screening, Achievement Tests, Other Flexible Work Arrangements, Entrepreneurs + HR: Job Analysis in a ―Jobless‖
World, From Specialized to Enlarged Jobs, Why Managers are De-jobbing Their Companies, College Recruiting, Referrals and Walk-ins, Recruiting on the Internet, How HR Helps to Build
Productive Teams, Critical Incident Method, Narrative Forms, Behaviorally Anchored Rating Scales; High-Performance Insight: Recruiting a More Diverse Workforce, Recruiting Single
Parents, Older Workers as a Source of Candidates, Creating Team-Based Organizations, The Nature of Self-Directed Teams and Worker Empowerment,
Text Book/s Human Resource Management, 11th Edition Gary Dessler
Reference Material 1. Human Resource Management, 6th Edition by Lloyd L. Byars & Leslie W. Rue
2. Human Resource Management 6th Edition By R. Wayne Mondy &Robert M. Noe

Semester 7
Title Computer Graphics
Code CS-420
Credit Hours 3
Prerequisite CS-312, MT-204
Follow Up None
Aims and Objectives To provide tools and techniques necessary to design and implement graphics on computer
Syllabus Introduction to Course, Graphic Systems: Input Devices & Output Devices, Graphics Software, Basic Drawing Output Primitive, Line, Circle Ellipse etc. Filled Area Primitives, Scan Line
Polygon Fill Algorithm, Boundary Fill Algorithm, Flood Fill Algorithm, Area Fill Attributes, Fill Style, Pattern Fill, Soft Fill, Two Dimensional Transformations, Three Dimensional Concepts,
Three Dimensional Display Methods, Basic Geometric Transformations, Bitmap and Vector Graphics and their applications, Rasterization, Clipping Operations
Text Book/s Computer Graphics by Donald Hearn, M. Pauline Baker: Prentice Hall
Reference Material Computer Graphics Principles & Practice by Foley, Van Dam, Feiner, Huges : Addison

Title Theory of Automata

Code CS-419
Credit Hours 3
Prerequisite CS-104
Follow Up CS-424

Punjab University College of Information Technology, University of the Punjab http://www.pucit.edu.pk Page 16 of 18
Name: Tahir Rauf
B.Sc. Honors (Computer Science) Course Outline

Aims and Objectives This is an introductory course on the theory of computation. Students are introduced to the concept of formal languages and automata. Formal languages cover regular grammar, regular
expression, context free grammar and language. In automata they shall learn about finite automata (deterministic and non-deterministic) and pushdown automata. They shall also learn about
fundamental concepts of Turing machines
Syllabus Theory of Automata and Formal Languages: Finite State Automata, Regular Expressions and Languages, Deterministic and Non-deterministic Pushdown Automata, Moore and Mealy
Machines, Context-free Languages, Context-sensitive Languages, Normal Forms, Turing Machines, Recursive and Recursively Enumerable Sets, Undecidability, Introduction to Computability
and Complexity Theory.
Text Book/s Peter Linz, An Introduction to Formal Languages and Automata, Jones and Bartlett, 2001 3rd Edition, ISBN: 0-7637-1422-4
Reference Material 1. Cohen, I.A. Daniel, Introduction To Computer Theory, John Wiley, 1996 2nd Edition, ISBN: 0-471-13772-3
2. John C. Martin, Introduction to Languages and The Theory of Computation, McGraw Hill, 1997 2nd Edition, ISBN: 0-0704-0845-9
3. Jeffrey D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley 2000 2nd Edition, ISBN: 0-2014-4124-1
4. Harry R. Lewis, Elements of Theory of Computation, Prentice Hall, 1997 2nd Edition, ISBN: 0132624788

Title Component Based Software Engineering

Code CBSE
Credit Hours 3
Prerequisite CS-313
Follow Up None
Aims and Objectives  The course will focus on technology-independent concepts and methods.
 The course focuses on examining concepts and techniques for design and implementation of component-based software.
 Object oriented analysis and design practices with real world project implementation.
 For practical exercises, the course will use Enterprise Java Beans and other Java 2 Enterprise Edition (J2EE) technologies
 Rational Rose implementation.
Syllabus Introduction to Component Based Software Engineering; Component Life Cycle; Analysis Cycle of Component; Component Process and Management Framework; Business Process
Modeling: Principles, Notations, Techniques; Component Modeling Techniques; Object Stereotypes; Component Modeling with Unified Modeling Language; Business Oriented Component
Modeling: CBSE in Legacy Systems: Package and Data Wrapping Techniques and Guidelines; Perspective Architecture; Themes and Solutions in Perspective Process; Service Based
Architecture; Themes and Styles in Solution Process; Leading Edge Component Technology Comparisons; Current Trends and Practices
Text Book/s Component Based Software Engineering” By Rizwan M. Yousaf
Reference Material 1. Sinan Si Albir “UML In a Nut Shell “, 2nd Ed. O’Rielly
2. Siman Bennett “Object Oriented System Analysis & Design”, 2nd Ed.
3. Grady Booch “The Unified Modeling Language” 2nd Ed.
4. www.rational.com, java.sun.com/products/ejb/, msdn.microsoft.com/, www.omg.org/corba

Title .Net
Code
Credit Hours 3
Prerequisite CS-208, CS-314
Follow Up None
Aims and Objectives  The course will focus on understanding the Dot Net Framework, developing solutions with Dot Net.
 The course focuses on learning Dot Net Framework Classes, developing new libraries, building and deploying data rich desktop and web applications.
 For practical exercises, the course will use VB.Net or C#.Net.
 Learn developing Dot Net Applications with Visual Studio.Net.
Syllabus Introduction to .Net and comparison with other technologies, Exploring .Net Framework, Introduction to Visual Studio.Net and VB.Net, Exploring Data Types, and General Syntax, Working
with classes, namespaces and assemblies, Introduction to Windows Forms, and windows Controls, Programming Windows Forms and building a GUI application, Working with Common
Dialog Boxes, Working with Files and Directories, Introduction to Drawing and GDI+, Image manipulation with GDI+, Building your own windows controls, Introduction to Multithreading
and building a sample application, Building a Multithreaded Chat Server and Clients Application, Introduction to ADO.Net, Dataset, Data Reader, Connecting to SQL Server with ADO.Net and
manipulating data, Building a sample Data Rich Application using ADO.NET and SQL Server, Accessing COM/DCOM component from .Net, building and using Win32 DLL from .Net and
introduction to RCR & CCR, Introduction to ASP.Net, Installing and configuring IIS for ASP.Net, Exploring ASP.Net Server Controls and ASP.Net Events, Working with Web Forms,
Introduction to XML,UDDI,WSDL,SOAP and Web Services, Building a Sample Web Service in Visual Studio.Net and Consuming it in VB.Net and ASP.Net, Building a sample ASP.NET
Application using ADO.Net and Web Services, Crystal Reports.Net.
Text Book/s Thearon Willis “Beginning V.B .NET 2003” 3rd Ed. Wrox
Reference Material 1. Chris Payne “Teach Yourself ASP.Net” 2nd Ed. Sams
2. http://msdn.microsoft.com/, http://www.codeproject.com, http://www.w3schools.com, http://aspalliance.com/, http://www.developerfusion.co.uk,
http://www.planet-source-code.com/, http://www.programmersheaven.com/, http://www.tek-tips.com/, http://www.dotnetrocks.com/,
http://learnvisualstudio.net/

Punjab University College of Information Technology, University of the Punjab http://www.pucit.edu.pk Page 17 of 18
Name: Tahir Rauf
B.Sc. Honors (Computer Science) Course Outline

Semester 8
Title Artificial Intelligent
Code CS-425
Credit Hours 3
Prerequisite CS-104
Follow Up None
Aims and Objectives  To introduce the tips and tricks behinds AI techniques
 To equip students with the developments, justifications, implementation, and use of representational, formalism. Search methods, Neural Networks, Genetic Algorithms, and Natural
Language Processing as hottest research area in the field of AI.
 To provide an opportunity to students to learn methods for Machine Learning and Decision Making.
Syllabus Introduction of Artificial Intelligence: Defining AI, Role of AI, Fields of implementation, Real world Problem and AI (Examples), Application areas of Artificial Intelligence; Approaches of
AI: Agent Based Approach, General Approach; Agent: Simple Reflex Agents with State, Goal-Based Agents, Utility-Based Agents; Logic: Propositional Logic, Predicate Logic, First Order
logic, Rules of Inferences, Unification; Prolog: Introduction, Logic in Prolog, Lists, Operator, Arithmetic, Representation of Lists, Some Operations on Lists, Operator Notation, Controls and
Loops, Implementing If-Else Structure in Atoms, Reading Programs, User Interface Design, Connectives; State Space: Graph as State Representation Data Structure, Graph Tree, State Space;
Search: Goal Driven Search, Depth First Search, Breadth First Search, Depth First with Iterative Deepening, Data Driven Search, Best First Search, A* search, Mini Max Search, And-Or
Graph, Alpha-Beta Search, Heuristic Search, Complexity issues; Heuristics: Characteristic for Good Heuristics, Admissibility, Monotonic, Informed ness; Knowledge Representation:
Introduction, Impairments in Knowledge Representation, Knowledge Representation Schemas, Scripts, Semantic Networks, Frames, Frames and OOPs,. Conceptual Graph Issues; Expert
System: Introduction, Expert System Architecture, Expert System Components, Inference Engine, Knowledge Base, Case Base History, Explanation Sub System, KB Editor, Experts System
Shell, Application Of Expert Systems; Neural Network: Introduction, Biological Model of Neuron, Artificial Model of Neuron, Interconnectivity of Neuron, Types of Neural Networks,
Perceptron, Multi Layer Perceptron, Propagation, Self-Organization, Application of Neural Networks; MATLAB: Neural Network Implementation in MATLAB; Genetic Algorithm:
Introduction, Biological Background, Elements of Genetic Algorithm, Genetic Cycle, Penalty Functions, Integer Variable Constraints, Real Variable Constraints, Traveling Sale s Person
Problem, Application of Genetic Algorithms; Natural Language Processing: Introductions, Communication and Language, Understanding Sub-Modalities, Presuppositions, Levels of
Language Processing, Grammars, Stages of Natural Language Analysis, Morphology, Derivational Morphology, Inflectional Morphology, Segmentation Problem, Grammar & Syntactic
Analysis, Context Free Grammar, Definite Clause Grammar, Application Of NLP, Issues of NLP; Computer Vision: Introduction
Text Book/s 1. George F. Luger “Artificial Intelligence Structures and Strategies for Complex Problem Solving”, 4 th Ed., Pearson Education, 2002 ISBN 81-7808-491-0
2. Stuart Russell & Peter Norvig “Artificial Intelligence A Modern Approach”, 2 nd Ed., Pearson Education, 2003 ISBN 81-297-00417
Reference Material 1. Artificial Intelligence: Structures and Strategies for Complex Problem Solving (George F.Luger, and William A. Stubblefield).
2. Mathematical Methods in Artificial Intelligence. (Edward A. Bender)
3. Principals of Artificial Intelligence and Expert System Development. (David W.Rolston)
4. Introduction of AI and Robotics(Robin R.Murphy)

Title Compiler Construction

Code CS-424
Credit Hours 3
Prerequisite CS-419
Follow Up None
Aims and Objectives The Objective of this course is to provide the theoretical base for Compiler Construction and to accumulate the background knowledge needed to implement different phases of compiler.
Programming assignments provide practice to implement compile phases using different techniques.
Syllabus Introduction to Compiling, A Simple One-Pass Compiler, Lexical Analysis, Syntax Analysis, Syntax-Directed Translation, Type Checking, Run-Time Environments, Intermediate Code
Generation, Code Generation
Text Book/s Compilers Principles, Techniques and Tools, by Alfred V. Aho, Ravi Sethi, Jeffrey D. Ullman, Addison Wesley Publishing Company
Reference Material Crafting Compiler with C, by Charles N. Fischer, Benjiman 1991

Punjab University College of Information Technology, University of the Punjab http://www.pucit.edu.pk Page 18 of 18