Road Map BS (Computer Science) Session 2023-27

SR.NO. CODE COURSE_TITLE DOMAIN CRHRS

Semester 1
1 CCC-301 Programming Fundamentals Core 4(3-1)
2 CSI-303 Discrete Structures GER 3(3-0)
3 CSI-321 Introduction to Computing Applications GER 3(2-1)
4 MTH-323 Calculus and Analytic Geometry GER 3(3-0)
5 ENG-321 Functional English GER 3(3-0)
6 *THQ-311 Translation of The Holy Quran-I GER 1(1-0)
7 **MTH-111 Basic Mathematics-I Deficiency 3(3-0)
Course
16(14-2)
Semester 2
1 CCC-302 Object Oriented Programming Core 4(3-1)
2 CCC-304 Database Systems Core 4(3-1)
3 CCC-306 Digital Logic Design Core 3(2-1)
4 MTH-324 Multivariable Calculus Math 3(3-0)
5 MTH-424 Linear Algebra Math 3(3-0)
6 **MTH-112 Basic Mathematics-II Deficiency 3(3-0)
Course
17(14-3)
Semester 3
1 CCC-401 Data Structures Core 4(3-1)
2 CCC-403 Information Security Core 3(2-1)
3 CCC-404 Software Engineering Core 3(3-0)
4 CCC-405 Computer Networks Core 3(2-1)
5 CSI-415 Advanced Programming Domain Elective 3(2-1)
6 STA-328 Probability and Statistics Math 3(3-0)
7 *THQ-411 Translation of The Holy Quran-II GER 1(1-0)
19(15-4)
Semester 4
1 CSI-406 Theory of Automata Domain Core 3(3-0)
2 CSI-418 Advance Database Management Systems Domain Core 3(2-1)
3 CCC-402 Computer Organization and Assembly Language Core 3(2-1)
4 PHY-321 Applied Physics GER 3(2-1)
5 ENG-426 Expository Writing GER 3(3-0)
6 ISL-321 Islamic Studies GER 2(2-0)
17(14-3)
Semester 5
1 CCC-503 Operating Systems Core 3(2-1)
2 CSI-507 Computer Architecture Domain Core 3(2-1)
3 CSI-509 Digital Image Processing Domain Core 3(2-1)
4 CCC-501 Analysis of Algorithms Core 3(3-0)
5 CSI-513 Mobile Application Development Domain Elective 3(2-1)
6 BAM-301 Introduction to Management GER 3(3-0)
7 *THQ-511 Translation of The Holy Quran-III GER 1(1-0)
 18(13-5)
Semester 6
1 CCC-502 Artificial Intelligence Core 3(2-1)
2 CSI-504 Parallel and Distributed Computing Domain Core 3(2-1)
3 CSI-506 Numerical Computing Domain Elective 3(2-1)
4 CSI-508 Compiler Construction Domain Core 3(2-1)
5 CSI-512 Web Engineering Domain Elective 3(2-1)
6 CSI-514 Cyber Security Domain Elective 3(2-1)
18(12-6)
Semester 7
1 CSI-603 Introduction to Data Science Domain Elective 3(2-1)
2 BAM-601 Entrepreneurship GER 3(3-0)
3 CSI-608 HCI & Computer Graphics Domain Core 3(2-1)
4 *THQ-611 Translation of The Holy Quran-IV GER 1(1-0)
5 ENG-422 Technical Writing EN 3(3-0)
6 BAM-302 Principles of Marketing SS 3(3-0)
7 CSI-631 Final Year Project - I Core 2(0-2)
17(14-3)
Semester 8
1 CSI-606 Professional Practices GER 2(2-0)
2 SOC-407 Community Development GER 2(2-0)
3 PST-506 Constitutional Developments in Pakistan GER 3(3-0)
4 CSI-632 Final Year Project - II Core 4(0-4)
11(7-4)
* Non-Credit Course
** Deficiency Course (Non-Credit) for students who have not studied Mathematics at HSSC.
Grand Total= 133
 Semester-1
Course Name: Discrete Structures
Course Structure: Lectures: 3, Labs: 0 Credit Hours: 3
Prerequisites:
Objectives:
Introduces the foundations of discrete mathematics as they apply to computer Science,
focusing on providing a solid theoretical foundation for further work. Further, this course
aims to develop understanding and appreciation of the finite nature inherent in most
Computer Science problems and structures through study of combinatorial reasoning,
abstract algebra, iterative procedures, predicate calculus, tree and graph structures. In this
course more emphasis shall be given to statistical and probabilistic formulation with
respect to computing aspects
Course Outline:
Introduction to logic and proofs: Direct proofs; proof by contradiction, Sets,
Combinatorics, Sequences, Formal logic, Prepositional and predicate calculus, Methods
of Proof, Mathematical Induction and Recursion, loop invariants, Relations and
functions, Pigeonwhole principle, Trees and Graphs, Elementary number theory,
Optimization and matching. Fundamental structures: Functions; relations (more
specifically recursions); pigeonhole principle; cardinality and countability, probabilistic
methods
Reference Material:
1. Kenneth H. Rosen, Discrete Mathematics and Its Applications, 6TH edition, 2006,
Mcgraw Hill Book Co.
2. Richard Johnsonbaugh, Discrete Mathematics, 7TH edition, 2008, Prentice Hall
Publishers.
3. Kolman, Busby & Ross, Discrete Mathematical Structures, 4th edition, 2000,
Prentice-Hall Publishers.
4. Ralph P. Grimaldi, Discrete and Combinatorial Mathematics: An Applied
Introduction, Addison-Wesley Pub. Co., 1985

Course Name: Programming Fundamentals

Course Structure: Lectures: 3, Labs: 1 Credit Hours: 4
Prerequisites: None
Objectives: The course is designed to familiarize students with the basic structured
programming skills. It emphasizes upon problem analysis, algorithm designing, and
program development and testing.
Course Outline:
Overview of computers and programming. Overview of language for e.g. C language C.
Basics of structured and Modular programming. Basic Algorithms and problem solving,
development of basic algorithms, analyzing problem, designing solution, testing designed
solution. Fundamental programming constructs, translation of algorithms to programs,
data types, control structures, functions, arrays, records, files, testing programs
Reference Material:
1. Problem Solving and Program Design in C / 6E Hanly & Koffman Addison-Wesley |
Published: 02/06/2009 ISBN-10: 0321535421 | ISBN-13: 9780321535429
2. C How to Program, 5/E (Harvey & Paul) Deitel & Deitel, ISBN-10: 0132404168
ISBN-13: 9780132404167 Publisher: Prentice Hall Copyright: 2007
Course Name: Introduction to Computing Applications
Course Structure: Lectures: 2, Labs: 1 Credit Hours: 3
Prerequisites: None (first semester course)
Objectives:
This course focuses on a breadth-first coverage of the use of computing and communication
technologies to solve real life problems; including computing environments, general
application software like word processing, visual presentation applications, tabular data
manipulation, DBMS, WWW, Email management systems, Virus, Anti-Virus and Spam
Protection; Introduction to the basic computing hardware (main building blocks), operating
systems, data networks; software engineering and communication technology along with
social and ethical issues. An introduction of the program of study in computing for which
this course is being taught (CS, IT, SE etc.). The course attempts to provide every student a
set of productivity tools that they will be able to use for the rest of their lives.
Course Outline:
Number Systems, Binary numbers, Boolean logic, History computer system, basic machine
organization, Von Neumann Architecture, Algorithm definition, design, and implementation,
Programming paradigms and languages, Graphical programming, Overview of Software
Engineering and Information Communication Technology, Operating system, Compiler,
DBMS, Computer networks and internet, WWW, web mail applications, Computer graphics,
AI, Viruses and Anti-Viruses, Use of office productivity tools, such as word processors,
spreadsheets, presentation applications, etc., Social, Ethical, Professional and Legal Issues,
and overview of the complete program of studies in computing and its structure.
Suggested Text Book:
1. Introduction to Computers by Peter Norton, 6th Edition, McGraw-Hill SiE, ISBN 0-07-
059374-4.
Reference Material:
1. Computers: Information Technology in Perspective, 9/e by Larry Long and Nancy Long,
Prentice Hall, 2002/ISBN: 0130929891.
2. An Invitation to Computer Science, Schneider and Gersting, Brooks/Cole Thomson
Learning, 2000.
3. Information System Today by Leonard Jessup, Joseph Valacich.
4. Computers Today by Suresh K. Basandra.
5. Computer Science: An overview of Computer Science, Sherer.
Course Name: Calculus and Analytic Geometry
Course Structure: Lectures: 3, Labs: 0 Credit Hours: 3
Prerequisites: None
Objectives: To provide foundation and basic ground for calculus and analytical geometry
background.
Course Outline: Complex Numbers, DeMoivre‟s Theorem and its Applications, Simple
Cartesian Curves, Functions and Graphs, Symmetrical Properties, Curve Tracing, Limit
and Continuity, Differentiation of Functions. Derivative as Slope of Tangent to a Curve
and as Rate of Change, Application to Tangent and Normal, Linearization,
Maxima/Minima and Point of Inflexion, Taylor and Maclaurin Expansions and their
convergence. Integral as Anti-derivative, Indefinite Integration of Simple Functions.
Methods of Integration: Integration by Substitution, by Parts, and by Partial Fractions,
Definite Integral as Limit of a Sum, Application to Area, Arc Length, Volume and
Surface of Revolution.
Reference Material:
1. Swokowski, Olinick and Pence, Calculus and Analytical Geometry, 6th edition, 1994,
Brooks/Cole Publishers.
2. Howard Anton, Calculus, 7th edition. 2002, John Wiley and Sons (WIE).
3. William E. Boyce Richard C. Diprima, Calculus, John Wiley & Sons, ISBN:
0471093335.
4. Thomas Finny, Calculus and Analytical Geometry, 10th edition, John Wiley and
Sons.
5. Erwin Kreyzig, Advanced Engineering Mathematics, 7th edition, 1993, John Wiley &
Sons Inc.
 Semester-2
Course Name: Digital Logic and Design
Course Structure: Lectures: 3, Labs: 1 Credit Hours: 4
Prerequisites: Discrete Structures, Introduction to Computing
Objectives: This course introduces the concept of digital logic, gates and the digital
circuits. Further, it focuses on the design and analysis combinational and sequential
circuits. It also serves to familiarize the student with the logic design of basic computer
hardware components.
Course Outline:
Overview of Binary Numbers, Boolean Algebra, switching algebra, and logic gates,
Karnaugh Map and Quin-McCluskey methods, simplification of Boolean functions,
Combinational Design; two level NAND/NOR implementation, Tabular Minimization,
Combinational Logic Design: adders, subtracters, code converters, parity checkers,
multilevel NAND/NOR/XOR circuits, MSI Components, design and use of encoders,
decoders, multiplexers, BCD adders, and comparators, Latches and flip-flops,
Synchronous sequential circuit design and analysis, Registers, synchronous and
asynchronous counters, and memories, Control Logic Design, Wired logic and
characteristics of logic gate families, ROMs, PLDs, and PLAs, State Reduction and good
State Variable Assignments, Algorithmic State Machine (ASM) Charts, Asynchronous
circuits, Memory systems, Functional organization, Multiprocessor and alternative
architectures: Introduction to SIMD, MIMD, VLIW, EPIC; systolic architecture;
interconnection networks; shared memory systems; cache coherence; memory models
and memory consistency, Performance enhancements, Contemporary architectures
Reference Material:
1. Digital Design, 2nd Ed., M. Morris Mano, Prentice Hall, 1991.
2. Practical Digital Logic Design and Testing, P K Lala, Prentice Hall, 1996

Course Name: Database Systems

Course Structure: Lectures: 3, Labs: 1 Credit Hours: 4
Prerequisites: Data Structures and Algorithms
Objectives: The course aims to introduce basic database concepts, different data models,
data storage and retrieval techniques and database design techniques. The course primarily
focuses on relational data model and DBMS concepts.
Course Outline: Basic database concepts; Entity Relationship modelling, Relational data
model and algebra, Structured Query language; RDBMS; Database design, functional
dependencies and normal forms; Transaction processing and optimization concepts;
concurrency control and recovery techniques; Database security and authorization. Small
Group Project implementing a database. Physical database design: Storage and file
structure; indexed files; b-trees; files with dense index; files with variable length records;
database efficiency and tuning.
Reference Material:
1. Database Systems 8E, C.J.Date, Addison Wesley Pub. Co. (2004).
2. Database Systems: A Practical Approach to Design, Implementation and Management
5E, R.Connolly and P.Begg, Addison-Wesley Pub. Co (2009).
3. Fundamentals of Database Systems, 5/E, Elmasri and Navathe, Addison-Wesley, ISBN:
0-201-74153-9.
Course Name: Object Oriented Programming
Course Structure: Lectures: 3, Labs: 1 Credit Hours: 4
Prerequisites: Programming Fundamentals
Objectives: The course aims to focus on object-oriented concepts, analysis and software
development.
Course Outline:
Evolution of Object Oriented (OO) programming, OO concepts and principles, problem
solving in OO paradigm, OO programme design process, classes, methods, objects and
encapsulation; constructors and destructors, operator and function overloading, virtual
functions, derived classes, inheritance and polymorphism. I/O and file processing,
exception handling
Reference Material:
1. C++ How to Program, 6/E (Harvey & Paul) Deitel & Deitel ISBN-10: 0136152503
ISBN-13: 9780136152507 Publisher: Prentice Hall
2. Java How to Program, 7/E
(Harvey & Paul) Deitel & Deitel ISBN-10: 0132222205 ISBN-13: 9780132222204
Publisher: Prentice Hall

Course Name: Multivariate Calculus

Course Structure: Lectures: 3, Labs: 0 Credit Hours: 3
Prerequisites: Calculus and Analytical Geometry
Objectives: The goals are to develop the skills to have ground knowledge of multivariate
calculus and appreciation for their further computer science courses
Course Outline:
Functions of Several Variables and Partial Differentiation. Multiple Integrals, Line and
Surface Integrals. Green‟s and Stoke‟s Theorem. Fourier Series: periodic functions,
Functions of any period P-2L, Even & odd functions, Half Range expansions, Fourier
Transform. Laplace Transform, Z-Transform.
Reference Material:
1. James Stewart, Multivariable Calculus, 6th edition, 2007, Cengage Learning
publishers.
2. Swokowski, Olinick and Pence, Calculus and Analytical Geometry, 6th edition, 1994,
Thomson Learning EMEA, Ltd.
3. Bernard Kolman, William F. Trench, Elementary Multivariable Calculus, 1971,
Academic Press.
4. Howard Anton, Albert Herr, Multivariable Calculus, 5th edition, 1995, John Wiley
Course Name: Linear Algebra
Course Structure: Lectures: 3, Labs: 0 Credit Hours: 3
Prerequisites: None
Objectives: To provide fundamentals of solution for system of linear equations,
operations on system of equations, matrix properties, solutions and study of their
properties.
Course Outline: Vectors, Vector Spaces, Matrices & Determinants, Cofactor and Inverse,
Rank, Linear Independence, Solution of system of Linear systems, Positive Definite
matrix, Linear Transformations, Operations on matrices, Inner products, orthgonality and
least squares, Eigenvalue & Eigenvectors. Applications to Systems of Equations and to
Geometry, Singular Value Decomposition.
Reference Material:
1. Bernard Kolman, David Hill, Elementary Linear Algebra with Applications, 9th
edition, Prentice Hall PTR, 2007.
2. Gilbert Strang, Strang, Brett Coonley, Andy Bulman-Fleming, Andrew Bulman-
Fleming, Strang's Linear Algebra And Its Applications, 4th edition, Brooks/Cole, 2005
3. Howard Anton, Chris Rorres, Elementary Linear Algebra: Applications Version, 9th
edition, Wiley, 2005.
4. David C. Lay, Linear Algebra and Its Applications, 2nd edition, Addison-Wesley,
2000.
 Semester-3
Course Name: Information Security
Course Structure: Lectures: 3 / Labs: 0 Credit Hours: 3
Prerequisites: Data Communication and Computer Networks
Objectives:
Course Outline:
Basic notions of confidentiality, integrity, availability; authentication models; protection
models; security kernels; Encryption, Hashing and Digital 33 Signatures; audit; intrusion
detection and response; database security, host based and network-based security issues
operational security issues; physical security issues; personnel security; policy formation
and enforcement; access controls; information flow; legal and social issues; identification
and authentication in local and distributed systems; classification and trust modeling; risk
assessment
Reference Material:
1. Computer Security: Art and Science, Matthew Bishop
2. Cryptography and Network Security by William Stalling 6th Edition, 2012
3. Principles of Information Security 3rd E by Michael E. Whitman and Herbert J. Mattord

Course Name: Software Engineering

Course Structure: Lectures: 3, Labs: 0 Credit Hours: 3
Prerequisites: Object Oriented Paradigm/Programming
Objectives: To study various software development models and phases of software
development life cycle. The concepts of project management, change control, process
management, software development and testing are introduced through hands-on Team
Projects.
Course Outline: Introduction to Computer-based System Engineering; Project
Management; Software Specification; Requirements Engineering, System Modelling;
Requirements Specifications; Software Prototyping; Software Design: Architectural
Design, Object-Oriented Design, UML modelling, Function-Oriented Design, User
Interface Design; Quality Assurance; Processes & Configuration Management;
Introduction to advanced issues: Reusability, Patterns; Assignments and projects on
various stages and deliverables of SDLC.
Reference Material:
1. Software Engineering 8E by Sommerville Addison Wesley, 2006
2. Software Engineering: A Practitioner's Approach /7E, Roger Pressman, McGraw-Hill,
2009

Course Name: Data Structures

Course Structure: Lectures: 3, Labs: 1 Credit Hours: 4
Prerequisites: Object Oriented Paradigms
Objectives: The course is designed to teach students structures and schemes, which
allow them to write programs to efficiently manipulate, store, and retrieve data. Students
are exposed to the concepts of time and space complexity of computer programs
Course Outline:
Introduction to data structures; Arrays, Stacks, Queues, Priority Queues, Linked Lists,
Trees, and Graphs. Recursion, sorting and searching algorithms, Hashing, Storage and
retrieval properties and techniques for the various data structures. Algorithm Complexity,
Polynomial and Intractable Algorithms, Classes of Efficient Algorithms, Divide and
Conquer, Dynamic, Greedy
Reference Material:
1. Data Abstraction and Problem Solving with C++, 2nd ed, Frank M. Carrano, Paul
Helman, Robert Veroff, Addison-Wesley, 1998.
2. Data Structures and Algorithms (SAMS teach yourself), Lafore, Sams Publishing,
1999.
3. Fundamentals of Data Structures in C++, Horowitz, Sahni, and Mehta, Computer
Science Press, 1995.
4. Data Structures in JAVA, Standish, Addison Wesley, 2000
Course Name: Advanced Programming
Course Structure: Lectures: 2, Labs: 1 Credit Hours: 3
Prerequisites: Object Oriented Paradigms
Course Outline:
Visual Programming Basics; Introduction to Events; Fundamentals of Event-driven
Programming, message handling, user interfaces, graphics device interface, painting and
drawing, windows management, input devices, resources, string and menu resource,
dialogs and windows controls, common controls, dynamic link libraries, threads and
synchronization, network programming, Building Class Libraries at the Command Line,
Class Libraries, Using References, Assemblies, Private Assembly Deployment, Shared
Assembly Deployment, Configuration Overview, Configuration Files, Programmatic
Access to Configuration, Using SDK Tools for Signing and Deployment, Metadata,
Reflection, Late Binding, Directories, Files, Serialization, Attributes, Memory
Management and Garbage Collection, Threading and Synchronization, Asynchronous
Delegates, Application Domains, Marshal by Value, Marshal by Reference,
Authentication and Authorization, Configuring Security, Code Access Security, Code
Groups, Evidence, Permissions, Role-Based Security, Principals and Identities, Using
Data Readers, Using Data Sets, Interacting with XML Data, Tracing Event Logs, Using
the Boolean Switch and Trace Switch Classes, Print Debugging Information with the
Debug Class, Instrumenting Release Builds with the Trace Class, Using Listeners, and
Implementing Custom Listeners
Reference Material:
1. Visual C#: How to Program, Deitel and Deitel, 6/e Edition, Prentice Hall / Pearson
Education, 2017.
2. Programming in C# .NET, J.C. Bradley, A.C. Millspaugh, McGraw-Hill, 2014
3. Microsoft Visual C# 2013 Step by Step (Step by Step Developer), Sharp, J., 1st Edition
(2013), Microsoft Press.
Course Name: Computer Networks
Course Structure: Lectures: 2, Labs: 1 Credit Hours: 3
Prerequisites: None
Objectives: To introduce students to the concept of computer communication. Analogue
& digital transmission. Network Layers, Network models (OSI, TCP/IP) and Protocol
Standards. Emphasis is given on the understanding of modern network concepts.
Course Outline: Analogue and digital Transmission, Noise, Media, Encoding,
Asynchronous and Synchronous transmission, Protocol design issues. Network system
architectures (OSI, TCP/IP), Error Control, Flow Control, Data Link Protocols (HDLC,
PPP). Local Area Networks and MAC Layer protocols (Ethernet, Token ring),
Multiplexing, Switched and IP Networks, Inter-networking, Routing, Bridging, Transport
layer protocols TCP/IP, UDP. Network security issues. Programming exercises, labs or
projects involving implementation of protocols at different layers.
Reference Material:
1. Introduction to Computer Networks /4, A. S. Tanenbaum, Prentice Hall 2003
2. Computer Networks and Internets, 5/E, 2008
Douglas E. Comer, Purdue University ISBN-10: 0136061273 ISBN-13:
9780136061274 Publisher: Prentice Hall
3. Data and Computer Communications By William Stallings Published by Macmillan
Pub. Co., 8th Edition 2006
Course Name: Probability and Statistics
Course Structure: Lectures: 3, Labs: 0 Credit Hours: 3
Prerequisites: None
Objectives: To introduce the concepts of data analysis, presentation, counting techniques,
probability and decision making.
Course Outline:
Introduction to Statistics and Data Analysis, Statistical Inference, Samples, Populations,
and the Role of Probability. Sampling Procedures. Discrete and Continuous Data.
Statistical Modeling. Types of Statistical Studies. Probability: Sample Space, Events,
Counting Sample Points, Probability of an Event, Additive Rules, Conditional Probability,
Independence, and the Product Rule, Bayes‟ Rule. Random Variables and Probability
Distributions. Mathematical Expectation: Mean of a Random Variable, Variance and
Covariance of Random Variables, Means and Variances of Linear Combinations of
Random Variables, Chebyshev‟s Theorem. Discrete Probability Distributions. Continuous
Probability Distributions. Fundamental Sampling Distributions and Data Descriptions:
Random Sampling, Sampling Distributions, Sampling Distribution of Means and the
Central Limit Theorem. Sampling Distribution of S2, t-Distribution, FQuantile and
Probability Plots. Single Sample & One- and Two-Sample Estimation Problems. Single
Sample & One- and Two-Sample Tests of Hypotheses. The Use of PValues for Decision
Making in Testing Hypotheses (Single Sample & One- and TwoSample Tests), Linear
Regression and Correlation. Least Squares and the Fitted Model, Multiple Linear
Regression and Certain, Nonlinear Regression Models, Linear Regression Model Using
Matrices, Properties of the Least Squares Estimators.
Reference Material:
1. Probability and Statistics for Engineers and Scientists by Ronald E. Walpole, Raymond
H. Myers, Sharon L. Myers and Keying E. Ye, Pearson; 9th Edition (January 6, 2011).
ISBN-10: 0321629116
2. Probability and Statistics for Engineers and Scientists by Anthony J. Hayter, Duxbury
Press; 3rd Edition (February 3, 2006), ISBN-10:0495107573
3. Schaum's Outline of Probability and Statistics, by John Schiller, R. Alu Srinivasan and
Murray Spiegel, McGraw-Hill; 3rd Edition (2008). ISBN-10:0071544259
 Semester- 4
Course Name: Theory of Automata
Course Structure: Lectures: 3 Labs: 0 Credit Hours: 3
Prerequisites: Discrete Structures
Objectives: The course aims to develop an appreciation of the theoretical foundations of
computer science through study of mathematical & abstract models of computers and the
theory of formal languages. Theory of formal languages and use of various abstract
machines as „recognizers‟ and parsing will be studied for identifying/validating the
synthetic characteristics of programming languages. Some of the abstract machines shall
also study as „Transducers‟.
Course Outline: Finite State Models: Language definitions preliminaries, Regular
expressions/Regular languages, Finite automata (FAs), Transition graphs (TGs), NFAs,
Kleene‟s theorem, Transducers (automata with output), Pumping lemma and non regular
language Grammars and PDA: Context free grammars, Derivations, derivation trees and
ambiguity, Simplifying CFLs , Normal form grammars and parsing, Decidability,
Chomsky‟s hierarchy of grammars Turing Machines Theory: Turing machines, Post
machine, Variations on TM, TM encoding, Universal Turing Machine, Context sensitive
Grammars, Defining Computers by TMs.
Text Books/Reference Books:
1. An Introduction to Formal Languages and Automata, By Peter Linz, 4th edition, Jones
& Bartlett Publishers, 2006
2. Theory of Automata, Formal Languages and Computation, By S. P. Eugene, Kavier,
2005, New Age Publishers, ISBN (10): 81-224-2334-5, ISBN (13) : 978-81-224-
2334-1.
3. John Hopcroft and Jeffrey Ullman, Introduction to Automata Theory, Languages, and
Computation, 2nd edition, 2001, Addison-Wesley.
4. Introduction to Languages and the Theory of Computation, By John C. Martin3rd
edition, 2002, McGraw-Hill Professional.
Course Name: Advance Database Management Systems
Course Structure: Lectures: 2 Labs: 1 Credit Hours: 3
Prerequisites: Database Systems
Objectives:
Advanced Database Management Systems is an extension to “Database Systems” course.
The aim of the course is to enhance the previous knowledge of database systems by
deepening the understanding of the theoretical and practical aspects of the database
technologies, and showing the need for distributed database technology to tackle
deficiencies of the centralized database systems. Moreover, it focuses to introduce the
basic principles and implementation techniques of distributed database systems, and
expose emerging research issues in database systems and application development
Course Outline:
Introduction to advance data models such as object relational, object oriented. File
organizations concepts, Transactional processing and Concurrency control techniques,
Recovery techniques, Query processing and optimization, Database Programming
(PL/SQL, T-SQL or similar technology), Integrity and security, Database Administration
(Role management, managing database access, views), Physical database design and
tuning, Distributed database systems, Emerging research trends in database systems,
MONGO DB, NO SQL (or similar technologies)
Text Books/Reference Books:
1. Database Systems: A Practical Approach to Design, Implementation, and
Management, 6th Edition by Thomas Connolly and Carolyn Begg
2. Database Management Systems, 3rd Edition by Raghu Ramakrishnan, Johannes
Gehrke 3. Database System Concepts, 6th Edition by Avi Silberschatz, Henry F. Korth
and S. Sudarshan.
4. Database Systems: The Complete Book, 2nd Edition by Hector Garcia-Molina, Jeffrey
D. Ullman, Jennifer Widom
Course Name: Computer Organization and Assembly Language
Course Structure: Lectures: 2, Labs: 1 Credit Hours: 3
Prerequisites: Digital Logic Design
Objectives: The main objective of this course is to introduce the organization of computer
systems and usage of assembly language for optimization and control. Emphasis should be
given to expose the low-level logic employed for problem solving while using assembly
language as a tool. At the end of the course the students should be capable of writing
moderately complex assembly language subroutines and interfacing them to any high
level language.
Course Outline: Microprocessor Bus Structure: Addressing, Data and Control, Memory
Organization and Structure (Segmented and Linear Models), Introduction to Registers and
Flags, Data Movement, Arithmetic and Logic, Programme Control, Subroutines, Stack
and its operation, Peripheral Control Interrupts, Interfacing with high level languages,
Real-time application. Objectives and Perspectives of Assembly Language, Addressing
Modes, Introduction to the Assembler and Debugger, Manipulate and translate machine
and assembly code, Describe actions inside the processing chip, Discuss operations
performed by an instruction set, Write a fully documented program, Using an assembler of
choice.
Reference Material:
1. Stallings, "Computer Organization & Architecture", 7th ed, Prentice HALL, 2006.
2. Irvine, Assembly Language for Intel-based Computers, 5th ed, Prentice Hall, 2007.
3. Computer Organization and Design, The Hardware/Software Interface, 4th ed, by
David A. Patterson and John L. Hennessy, 2008. Elsevier Publishers.

Course Name: Applied Physics

Course Structure: Lectures: 2, Labs: 1 Credit Hours: 3
Prerequisites: None
Objectives:
The course introduces students with the basic concept of Physics and electronics. Students
are also taught Physics laws and other associate topics to prepare them for the advanced
level courses in this area. The focus of the course on electric force and its applications and
related problems, conservation of charge, charge quantization, Electric fields due to point
charge and lines of force and many other useful topics
Course Outline:
Electric force and its applications and related problems, conservation of charge,
charge quantization, Electric fields due to point charge and lines of force. Ring of
charge, Disk of charge, A point charge in an electric field, Dipole in a n electric field, The
flux of vector field, The flux of electric field, Gauss‟ Law, Application of Gauss‟ Law,
Spherically symmetric charge distribution, A charge isolated conductor, Electric potential
energy, Electric potentials, Calculating the potential from the field and related problem
Potential due to point and continuous charge distribution, Potential due to dipole,
equipotential surfaces, Calculating the field from the potential , Electric current, Current
density, Resistance, Resistivity and conductivity, Ohm‟s law and its applications, The Hall
effect, The magnetic force on a current, The Biot- Savart law, Line of B, Two parallel
conductors, Amperes‟ s Law, Solenoid, Toroids, Faraday‟s experiments, Faraday‟s Law of
Induction, Lenz‟s law, Motional emf, Induced electric field, Induced electric fields, The
basic equation of electromagnetism, Induced Magnetic field, The displacement current,
Reflection and Refraction of light waves, Total internal reflection, Two source
interference, Double Slit interference, related problems, Interference from thin films,
Diffraction and the wave theory, related problems, Single-Slit Diffraction, related
problems, Polarization of electromagnetic waves, Polarizing sheets, related problems.
Reference Material:
1. Fundamentals of Physics (Extended), 10th edition, Resnick and Walker
2. Narciso Garcia, Arthur Damask, Steven Schwarz., “Physics for Computer Science
Students”, Springer Verlag, 1998
 Semester- 5
Course Name: Operating Systems
Course Structure: Lectures: 2, Labs: 1 Credit Hours: 3
Prerequisites: None
Objectives: To help students gain a general understanding of the principles and concepts
governing the functions of operating systems and acquaint students with the layered
approach that makes design, implementation and operation of the complex OS possible.
Course Outline: History and Goals, Evolution of multi-user systems, Process and CPU
management, Multithreading, Kernel and User Modes, Protection, Problems of cooperative
processes, Synchronization, Deadlocks, Memory management and virtual memory,
Relocation, External Fragmentation, Paging and Demand Paging, Secondary storage,
Security and Protection, File systems, I/O systems, Introduction to distributed operating
systems. Scheduling and dispatch, Introduction to concurrency. Lab assignments involving
different single and multithreaded OS algorithms.
Reference Material:
1. Applied Operating Systems Concepts, 7th Edition, Silberschatz A., Peterson, J.L., &
Galvin P.C. 2004.
2. Modern Operating Systems, 3rd Edition, Tanenmaum A.S., 2008.

Course Name: Computer Architecture

Course Structure: Lectures: 2, Labs: 1 Credit Hours: 3
Prerequisites:
Course Outline:
The design of computer systems and components. Processor design, instruction set design,
and addressing; control structures and microprogramming; memory management, caches,
and memory hierarchies; and interrupts and I/O structures. Pipelining of processor Issues
and Hurdles, exception handling, Parallelism, Multiprocessor Systems
Reference Material:
1. Computer Architecture: A Quantitative Approach by Hennessy & Patterson, Morgan &
Kauffman Series (2006) 4th Edition.
2. Computer Organization & Design: The Hardware/Software Interface By Patterson &
Hennessy, Morgan & Kauffman Series (2008) 4th Edition
Course Name: Digital Image Processing
Course Structure: Lectures: 2, Labs: 1 Credit Hours: 3
Prerequisites:
Course Outline:
The human visual system, electromagnetic system, working and components inside digital
camera, pixels, image representation, sampling, quantization, mathematics of image
formation, convolution, camera projection, point-based image processing, Fourier theory,
image filtering in spatial and frequency domain, wavelets, image registration,
morphological operations, color models, multispectral images, feature detection, image
segmentation, Pattern recognition, etc

Reference Material:

1. Gonzalez R. C., Woods R. E., Eddins S. L., Digital Image Processing Using Matlab,
Pearson Education, 2nd edition, 2009.
2. Gonzalez R. C., Woods R. E., Digital Image Processing, Pearson Education, 3rd edition,
2008.
3. Understanding Digital Signal Processing by Richard G. Lyons, Prentice Hall; 3rd edition,
2010.
Course Name: Analysis of Algorithms
Course Structure: Lectures: 3 / Labs: 0 Credit Hours: 3
Prerequisites: Discrete Structure, Data Structures and Algorithms
Objectives: Detailed study of the basic notions of the design of algorithms and the
underlying data structures. Several measures of complexity are introduced. Emphasis on the
structure, complexity, and efficiency of algorithms.
Course Outline: Introduction; Asymptotic notations; Recursion and recurrence relations;
Divide-and-conquer approach; Sorting; Search trees; Heaps; Hashing; Greedy approach;
Dynamic programming; Graph algorithms; Shortest paths; Network flow; Disjoint Sets;
Polynomial and matrix calculations; String matching; NP complete problems;
Approximation algorithms.
Reference Material:
1. Introduction to Algorithms /2E, T. H. Cormen, C. E. Leiserson, and R. L. Rivest, MIT
Press, McGraw-Hill, New York, NY, 2001.
2. Algorithms in C++; Robert Sedgewick

Course Name: Mobile Application Development

Course Structure: Lectures: 2 / Labs: 1 Credit Hours: 3
Prerequisites: Web Technologies
Objectives:
Course Outline:
What is Android? Installing and Configuring the Android SDK Manager, Creating Android
Application, Anatomy of an Android Application. Eclipse. Fragments, Calling Built-In
Applications Using Intents, Displaying Notifications. Components of a Screen, Adapting to
Display Orientation, Managing Changes to Screen Orientation, Utilizing the Action Bar,
Creating the User Interface. Listening for UI Notifications. Views, User Preferences.
Persisting Data. Sharing Data. Sending SMS Messages. Getting Feedback. Sending E-mail.
Displaying Maps, Consuming Web Services Using HTTP, Accessing Web Services.
Creating Services. Threading. Android games Development, Publishing Android
Applications. Handling Telephone Calls, Fonts
Reference Material:
1. Beginning Android 4 Application Development by Wei-Menge Lee, John Wiley &
Sons, 2012
2. Beginning Android 4 by Grant Allen, Apress, (2011), ISBN: 1430239840.
3. Beginning Android games by Mario Zechner, Apress, (2011), ISBN:1430230428
4. Pro Android 4 by Satya Komatineni and Dave MacLean, (2012), ISBN:1430239301
Apress
5. Professional Android 4 Application Development by Reto Meier, Wiley, (2012),
ISBN:1118237226
Course Name: Introduction to Management
Course Structure: Lectures: 3 / Labs: 0 Credit Hours: 3

Overall Aims of the Course

Course Description:
This is an introductory course about the management of organizations. It
provides instructions on principles of management that have general
applicability to all types of enterprises; basic management philosophy and
decision making; principles involved in planning, organizing, leading, and
controlling; and recent concepts in management. The principles learned in this
course will allow the student to effectively work with and through others in an
organization. The course will also encourage the students to explore and inquire
the applicability of western management principles and theories in local settings.
Besides, the course will discuss the Islamic perspective of managing businesses
and organizations.

This course will cover the basic managerial functions of planning, organizing,
leading, and controlling, We will also try to learn the evolution of management
and best practices which are being used in today‟s modern era.

Course Objectives:
Theoretical Objectives: To understand the book and case studies mentioned in
the book Management by Stephen P. Robbins and Mary Coulter

Practical Objectives: To understand and present practices of Management in any

organization.
Learning Outcomes:

On completion of this course, the student should be able to:

1. Hold informed conversations with functional specialists and understand how

to draw effectively on their expertise in managing organizations.

2.Understand the relevance of the western management principles and theories,

for local settings.

3. Understand the Islamic perspective of managing businesses and

organizations.

4. Apply course concepts and theory in a practical context.

5. Integrate several of the disciplines studied.

6. Demonstrate empirical investigative skills by producing an in-depth analysis

of a management situation usually presented through case studies, resulting
in recommendations for a programme of action.

7. Recognize the need to take a holistic approach to performance improvement

rather than a narrowly functional approach.

Class Format & Weekly Work Plan:

Principles of Management is a theoretical course; thus, the majority of our classes will be
focused on concepts and practical example discussion.

Our weekly class Instructions and discussions will follow this format:

1st – 2nd Week

Chapter – 1: Managers and You in the Workplace. Management History

Module. What are management and a manager? Four functions of a manager?
Ten roles of a manager by Henry Mintzberg. Layers of management. Skills
required by managers. Importance of innovation, diversity, and customers for a
manager. Early History of management. Early theories and approaches to
management; the classical approach, behavioral approach, quantitative
approach, contingency approach and contemporary approaches (Page 34 – 67)
(Management by Stephan P. Robbins & Mary Coulter, 15th Edition)
5th Week – 6th Week

Chapter 8: Foundations of Planning. Define the nature and purposes of

planning. Classify the types of goals organizations might have and the plans they
use. Compare and contrast approaches to goal-setting and planning. Discuss
contemporary issues in planning. (Page 232-245) (Management by Stephan P. Robbins
& Mary Coulter, 15th Edition).

Seminar 1

7th Week – 8th Week

Chapter 9: Managing Strategy. Define strategic management and explain why

it‟s important. Explain what managers do during the six steps of the strategic
management process. Describe the three types of corporate strategies. Describe
competitive advantage and the competitive strategies organizations use to get it.
Discuss current strategic management issues. (Page 252-265) (Management by
Stephan P. Robbins & Mary Coulter, 15th Edition).

Mid Semester Examination

10th Week – 11th Week

Chapter – 11: Designing Organizational Structure. Describe six key elements in

organizational design. Contrast mechanistic and organic structures. Discuss the
contingency factors that favor either the mechanistic model or the organic model
of organizational design. Describe traditional organizational design options.
Discuss organizing for flexibility in the twenty-first century. (Page 306-324)
(Management by Stephan P. Robbins & Mary Coulter, 15th Edition).

12th Week – 13th Week

Chapter – 16: Motivating Employees. What is motivation? Early theories of

motivation. Maslow‟s Hierachy of Needs theory, McGregor‟s Theory X and
Theory Y, Herzberg‟s Two-Factor Theory. Contemporary theories of motivation.
Goal-setting theory, Reinforcement theory, Designing motivating jobs, Equity
theory, Expectancy theory, Integrating contemporary theories of motivation.
Current issues in motivation. (Page 448-468) (Management by Stephan P. Robbins &
Mary Coulter, 15th Edition).

Case study: Redefining norms in a conservative culture

14th Week – 15th Week

Chapter – 17: Being an Effective Leader. Define leader and leadership. Compare
and contrast early theories of leadership. Describe the three major contingency
theories of leadership. Describe contemporary views of leadership. Compare the
various theories of leadership for their validity. Discuss twenty-first century
issues affecting leadership. (Page 480-500) (Management by Stephan P. Robbins & Mary
Coulter, 15th Edition).

Seminar 2

16th Week

Chapter – 18: Monitoring and Controlling. Explain the nature and importance
of control. Describe the three steps in the control process. Explain how
organizational and employee performance are measured. Describe tools used to
measure organizational performance. Discuss contemporary issues in control.
(Page 516-535) (Management by Stephan P. Robbins & Mary Coulter, 15th Edition).

Final Semester Examination

Weekly Course Objectives

Week Module Intended Learning Objectives

 To understand management History Module. What
are management and a manager?
 To explain four functions of a manager?
 To explain ten roles of a manager by Henry
Mintzberg.
 To understand layers of management. Skills
Managers and You in the required by managers.
1-2
Workplace.  To understand importance of innovation, diversity,
and customers for a manager.
 To understand early History of management.
 To understand early theories and approaches to
management; the classical approach, behavioral
approach, quantitative approach, contingency
approach and contemporary approaches
 To explain the manager‟s role as a decision maker.
 To explain the 8-step process of decision making,
Explain the four ways managers make decisions,
Evidence based and intuitive decision making,
Making Decisions
3-4  To classify decisions and decision-making
conditions.
 To describe how biases affect decision making and
Know how to recognize when you‟re using
decision-making errors and biases and what to do
about it.
 To define the nature and purposes of planning.
 To define the nature and purposes of planning.
5-6 Foundations of Planning  To identify the key contingency factors in planning.
 To compare and contrast approaches to objective
setting.
 To discuss contemporary issues in planning.
 To define strategic management and explain why
it‟s important.
 To explain what managers do during the six steps of
7-8 the strategic management process?
Managing Strategy
 To describe the three types of corporate strategies.
 To describe competitive advantage and the
competitive strategies organizations use to get it.
 To discuss current strategic management issues.
 To describe six key elements in organizational
design.
 To contrast mechanistic and organic structures.
 Discuss the contingency factors that favor either the
mechanistic model or the organic model of
organizational design.
Designing Organizational
10 - 11  To describe traditional organizational design
Structure options.
 To discuss organizing for flexibility in the twenty-
first century.
 To develop your skill at acquiring and using power
and Know how to stay connected and “in the loop”
when working remotely
 To define motivation
 To compare and contrast early theories of
motivation.
12 - 13 Motivating Employees
 To compare and contrast early theories of
motivation.
 To discuss current issues in motivation
Being an Effective  To discuss current issues in motivation
14 - 15  To compare and contrast early theories of
Leader leadership.
  To describe the three major contingency theories of
leadership.
 To describe the three major contingency theories of
leadership.
 To describe the three major contingency theories of
leadership.
 To describe twenty-first century issues affecting
leadership.
 To explain the nature and importance of control.
 To describe the three steps in the control process
Monitoring and  To explain how organizational and employee
16 performance are measured.
Controlling
 To describe tools used to measure organizational
performance.
 To discuss contemporary issues in control

Required Learning Resources

Textbook  Stephen P. Robbins & Mary Coulter, Management,
(Student must buy this book) Pearson Publisher, 15th Edition.

(Author, Title, Publisher, Edition)

Reference Book(s):  Griffin, T.O., Management, Houghton Mifflin Company,

(Author, Title, Publisher, Edition) Boston, USA, 8th Edition.
 Daft, R. L. & Marcic, D., Understanding Management,
Dallas: South–Western Cengage, 12th Edition.
 Oliver Laasch, Principles of Management, Sage publisher,
2nd Edition.
Facilities Required for Teaching and Learning

White Board / Multimedia (In case of Physical Classes)

Zoom Online Meetings (In case of Online classes)
 Semester- 6
Course Name: Artificial Intelligence
Course Structure: Lectures: 2 / Labs: 1 Credit Hours: 3
Prerequisites: Data Structures
Objectives: This course focuses on the set of computational tools and techniques, which
mimic the human decision-making process and capability.
Course Outline: Introduction to Common Lisp. AI classical systems: General Problem
Solver, rules, simple search, means-ends analysis. ELIZA, pattern matching, rule based
translators, OPS-5. Knowledge Representation: Natural language, rules, productions,
predicate logic, semantic networks, frames, objects, scripts. Search: Depth first search,
breadth first search, best first search, hill climbing, min-max search, A* search. Symbolic
Mathematics: student, solving algebra problems, translating English equations, solving
algebraic equations, simplification rules, re-write rules, meta-rules, Macsyma, PRESS,
ATLAS. Logic Programming: Resolution, unification, horn-clause logic, Prolog, Prolog
programming. Sample case studies of shells and Knowledge Based Systems. A brief
appreciation of state of the art computational techniques like neural networks, genetic
algorithm, fuzzy sets.
Reference Material:
1. Artificial Intelligence by Luger, 4th edition Pearson Education.
2. Russell and Norvig, Artificial Intelligence: A Modern Aproach, 2nd ed, Pearson
Education.

Course Name: Parallel and Distributed Computing

Course Structure: Lectures: 2 / Labs: 1 Credit Hours: 3
Prerequisites: Data Communications and Computer Networks
Objectives:
Course Outline:
Why use parallel and distributed systems? Why not use them? Speedup and Amdahl's Law,
Hardware architectures: multiprocessors (shared memory), networks of workstations
(distributed memory), clusters (latest variation). Software architectures: threads and shared
memory, processes and message passing, distributed shared memory (DSM), distributed
shared data (DSD). Possible research and project topics, Parallel Algorithms, Concurrency
and synchronization, Data and work partitioning, Common parallelization strategies,
Granularity, Load balancing, Examples: parallel search, parallel sorting, etc. Shared-Memory
Programming: Threads, Pthreads, Locks and semaphores, Distributed-Memory
Programming: Message Passing, MPI, PVM. Other Parallel Programming Systems,
Distributed shared memory, Aurora: Scoped behavior and abstract data types, Enterprise:
Process templates. Research Topics
Reference Material:
1. B. Wilkinson and M. Allen, Parallel Programming: Techniques and Applications Using
Networked Workstations and Parallel Computers, 1/e, Prentice Hall, 1999.
2. W. Stevens, Advanced Programming in the Unix Environment, Addison Wesley, 1993

Course Name: Numerical Computing

Course Structure: Lectures: 2 / Labs: 1 Credit Hours: 3
Prerequisites: Calculus and Analytical Geometry
Objectives: On completion of this unit, students will be able to demonstrate programming
proficiency using structured programming techniques to implement numerical methods for
solutions using computer-based programming techniques .using Matlab for all methods. The
course must serve the purpose of scientific software development for science and engineering
problems.
Course Outline: The concepts of efficiency, reliability and accuracy of a method.
Minimising computational errors. Theory of Differences, Difference Operators, Difference
Tables, Forward Differences, Backward Differences and Central Differences. Mathematical
Preliminaries, Solution of Equations in one variable, Interpolation and Polynomial
Approximation, Numerical Differentiation and Numerical Integration, Initial Value Problems
for Ordinary Differential Equations, Direct Methods for Solving Linear Systems, Iterative
Techniques in Matrix Algebra, Solution of non-linear equations.
Reference Material:
1. Numerical Methods in Scientific Computing Germund Dahlquist and Åke Björck
2. Numerical Methods for Scientific Computing : J.H. Heinbockel
3. Numerical Analysis: I.A. Khubaza
4. Numerical Analysis and Programming : Shan S Kuo
5. Numerical Analysis by Berden Fairs
6. Numerical Analysis by Gerald

Course Name: Compiler Construction

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

Course Name: Web Engineering

Course Structure: Lectures: 2 / Labs: 1 Credit Hours: 3
Prerequisites: Fundamentals of Information Technology (required)
Objectives: This course will extend the WWW Technologies and Web Based Applications
architecture, development, deployment and management concepts studied in the course of
Fundamentals of Information Technology. The instructor is expected to cover an in-depth
treatment of the web technology and applications related topics including web standards,
protocols, web applications architecture, web services, search engine architectures, content
management, web2, and semantic web, to explore some of the technologies used for
display, data access and processing, and to give the students practice in integrating these to
produce a functional web-based system.
Course Outline:
In-depth study of World Wide Web architectures, protocols and standards (HTTP, HTML,
xHTML, CGI, XML, WML, cHTML, etc.), Web Technologies and Tools (such as
scripting tools) for web application development and deployment (web servers, application
servers, etc.), Web Based Applications including search engines and content management,
management of large scale web based information systems, Web Services, Web2, Semantic
Web, and Web3, principles of web site design, practical exercise in web site development.
Reference Material:
Suggested Text Books:
1. Nuckles, Craig, Web Applications: Concepts and Real World Design, Wiley 2006
2. Programming the World Wide Web (4th Edition) (Paperback), by Robert W. Sebesta
(Author), Paperback: 752 pages, Publisher: Addison Wesley; 4th edition (August 17,
2007), ISBN-10: 0321489691
Reference Material:
1. Gosselin, Dan, et. al., The Web Warrior Guide to Web Design Technologies, Cengage
Learning, 2003
2. Zak, Diane, et. al., The Web Warrior Guide to Web Programming, Cengage Learning,
2003
3. Leasure, T., Bob Leasure and James Leasure, The Web Warrior Guide to Web
Database Technologies, Cengage Learning, 2003
4. Morrison, Mike and Joline Morrison, Database Driven Websites, 2/e, Cengage
Learning, 2002
5. Web Wizard series for various technologies, Addison-Wesley
6. Jackson, J. C., Web Technologies: A Computer Science Perspective, Pearson (LPE),
2008
7. Web Application Architecture: Principles, Protocols and Practices by Leon Shklar and
Richard Rosen (Paperback - Oct 31, 2008), Paperback: 420 pages, Publisher: Wiley; 2
edition (October 31, 2008), ISBN-10: 047051860X
8. Web Engineering: The Discipline of Systematic Development of Web Applications by
Gerti Kappel, Birgit Prýýll, Siegfried Reich, and Werner Retschitzegger (Paperback -
Jul 5, 2006)

Course Name: Cyber Security

Course Structure: Lectures: 2 / Labs: 1 Credit Hours: 3
Prerequisites: Information Security
Objectives: This course provides students an introduction to common cyber security
threats, vulnerabilities, and risks related to web applications, networks, software and mobile
applications. The course provides basic concepts and terminology used in the information
and cyber security fields. Moreover, it will also enable students to differentiate between the
various forms of malware and how they affect computers and networks
Course Outline:
Introduction to Cyber security; Networks and the Internet; cyber threat landscape;
understanding security; information security Principles (Confidentiality, Integrity,
Availability); Information Security Terminology; Who are the attackers; Advanced
Persistent Threat (APT); Malware, types of malware; Attacks using malware; Malware
Attack Lifecycle: Stages of Attack; Social engineering attacks; types of payload; Industrial
Espionage in Cyberspace; Basic cryptography; Web application attacks; Database security;
Cyber kill chain; Privacy and anonymity; Network security; Software security; Mobile
device security; Mobile app security; Cyber Terrorism and Information Warfare;
Introduction to Digital Forensics; Digital Forensics Categories
Reference Material:
1. Computer Security Fundamentals by Chuck Easttom, 4th edition or latest
2. Security+ Guide to Network Security Fundamentals, by Mark Ciampa, 5th Edition
3. Security in Computing by C.P. Pfleeger, Prentice-Hall, 4th Edition or Latest
 Semester- 7
Course Name: Introduction to Data Science
Course Structure: Lectures: 2 / Labs: 1 Credit Hours: 3
Prerequisites: Artificial Intelligence
Objectives:
Data Science is the study of the generalizable extraction of knowledge from data. Being a
data scientist requires an integrated skill set spanning mathematics, statistics, machine
learning, databases and other branches of computer science along with a good
understanding of the craft of problem formulation to engineer effective solutions. The aim
of this course is to: Introduce students to this rapidly growing field and equip them with
some of its basic principles and tools as well as its general mindset. Explain the significance
of exploratory data analysis in data science. Identify common approaches used for Feature
Generation as well as Feature Selection, and finally discuss the Ethical and Privacy issues.
Programming language Python has been proposed for the practical work of this course
Course Outline:
Introduction: What is Data Science? Big Data and Data Science hype, Datafication, Current
landscape of perspectives, Skill sets needed; Statistical Inference: Populations and samples,
Statistical modeling, probability distributions, fitting a model, Intro to Python; Exploratory
Data Analysis and the Data Science Process; Basic Machine Learning Algorithms: Linear
Regression, k-Nearest Neighbors (k-NN), k-means, Naive Bayes; Feature Generation and
Feature Selection; Dimensionality Reduction: Singular Value Decomposition, Principal
Component Analysis; Mining Social-Network Graphs: Social networks as graphs,
Clustering of graphs, Direct discovery of communities in graphs, Partitioning of graphs,
Neighborhood properties in graphs; Data Visualization: Basic principles, ideas and tools for
data visualization; Data Science and Ethical Issues: Discussions on privacy, security, ethics,
Next-generation data scientists
Reference Material:
1. Foundations of data science, Blum, A., Hopcroft, J., & Kannan, R., Vorabversion eines
Lehrbuchs, 2016.
2. An Introduction to Data Science, Jeffrey S. Saltz, Jeffrey M. Stanton, SAGE
Publications, 2017.
3. Python for everybody: Exploring data using Python 3, Severance, C.R., CreateSpace
Independent Pub Platform. 2016.
4. Doing Data Science, Straight Talk from the Frontline, Cathy O'Neil and Rachel Schutt,
O'Reilly. 2014.
5. Data Science and Big Data Analytics: Discovering, Analyzing, Visualizing and
Presenting Data, EMC Education Services, John Wiley & Sons, 2015

Course Name: Entrepreneurship

Course Structure: Lectures: 3 / Labs: 0 Credit Hours: 3
Prerequisites:
Objectives:

Course Outline:
Entrepreneurship and the Entrepreneurial Mind-Set. Entrepreneurial Intentions and
Corporate Entrepreneurship. Entrepreneurial Strategy. Generating and Exploiting New
Entries. Creativity and the Business Idea. Identifying and Analyzing Domestic and
International Opportunities. Intellectual Property and Other Legal Issues for the
Entrepreneur. The Business Plan. Creating and Starting the Venture. The Marketing Plan.
The Organizational Plan. The Financial Plan. Sources of Capital. Informal Risk 146 Capital,
Venture Capital, and Going Public. Strategies for Growth and
Managing the Implication of Growth. Succession Planning and Strategies for Harvesting
and Ending the Venture
Reference Material:
1. Entrepreneurship by Robert Hisrich, Michael Peters and Dean Shepherd, McGraw-
Hill/Irwin; 9th Edition (September 27, 2012). ISBN-10: 0078029198
2. Entrepreneurship: Ideas in Action by Cynthia L. Greene, South-Western Educational
Pub; 5th Edition (January 6, 2011). ISBN-10: 0538496894
3. Entrepreneurship by William D. Bygrave and Andrew Zacharakis, Wiley; 2nd Edition
(October 12, 2010). ISBN-10: 0470450371
4. Entrepreneurship: Theory, Process, and Practice by Donald F. Kuratko, South-Western
College Pub; 8th Edition (November 14, 2008). ISBN-10: 0324590911
5. Entrepreneurship: Successfully Launching New Ventures by Bruce R. Barringer and
Duane Ireland, Prentice Hall; 4th Edition (October 27, 2011)

Course Name: HCI & Computer Graphics

Course Structure: Lectures: 3 / Labs: 0 Credit Hours: 3
Prerequisites: Software Engineering
Objectives:

Course Outline:
Contexts for HCI, Psychology of usable things, Processes for User-Centered Design,
Metrics and Measures for Evaluation, Usability heuristics and principles of Usability
testing, Physical capabilities, Cognitive and social models for interaction design, Principles
of good interaction design, Accessibility, Principles of GUI, Visual design elements, Data
gathering, Task analysis, Prototyping, Help and user documentation, Internationalization,
Usability inspection methods, Usability testing methods, New Interaction Technologies,
Usability in practice, Visual Design and Typography, Icon Design, Ubiquitous, Augmented
and Virtual Reality

Reference Material:
1. Designing the User Interface: Strategies for Effective Human-Computer Interaction, Ben
Shneiderman and Catherine Plaisant, 6th Ed, Pearson Inc, 2016.
2. Designing Interactive Systems: A Comprehensive Guide to HCI, UX and Interaction
Design, Benyon, D. 3rd Ed., Pearson. 2013
3. About Face: The Essentials of Interaction Design, Alan Cooper, Robert Reimann, David
Cronin, Christopher Noessel, 4th Ed, Wiley, 2014

Course Name: Technical Writing

Course Structure: Lectures: 3, Labs: 0 Credit Hours: 3
Prerequisites:
Objectives:
Course Outline:
Characteristics of Academic, Public, Work and Electronic Communities. Myths and
Realities about Writing. Effective Writing: Discovering and Planning; Purpose, Thesis,
and Audience; Drafting: Drafting Collaboratively, Drafting in Digital Environments;
Revising, Editing, and Proofreading.
Paragraphs: Unfocused Paragraphs, Incoherent Paragraphs, Poorly Developed
Paragraphs, Special-Purpose Paragraphs. Unclear, Clear and Emphatic Sentences.
Reasoning Critically. Reading Critically. Arguing Persuasively & Logically. Designing
Documents. Writing in Online Communities.
Presentation skills: Speaking Effectively. Interviews , telephonic, face to face, different
kinds of interviews. Techniques and strategies for making and delivering a presentation,
use of AV aids
Academic Writing for Social and Natural Sciences: Goals of Writing, Audiences, Writing
Tasks, Types of Writing: Abstract, Informative Report, Lab Report, Research Report,
Project Reports, Technical report, short and long report, progressive report.
Business letters of different kinds, good news, bad news, invitations, adjustments,
resignation, letter for joining. Cover letter. CV and Resume with different types.
Public Writing: Goals of Public Writing, Public Audiences, Public Writing Tasks, Types
of Public Writing, Public Flyer, Letter to the Editor.
 Researching and Writing: Types of Research Writing, Developing a Research Question,
proposal for a research, Developing a Preliminary Thesis, Creating a Research File and a
Timeline, Reading and Note taking, Summarizing, Paraphrasing, and Synthesizing.
Writing a Position Paper
Reference Material:
1. Writer's Companion – The Longman by Chris M. Anson, Robert A. Schwegler and
Marcia F. Muth, Pearson Longman, 4th Edition 2007. ISBN10: 0-20556-252-3
2. Technical English: Writing, Reading, and Speaking by Pickett and Laster. 8th Edition
3. The Technical Writer‟s Companion by Alred, Gerald, Charles T. Brusaw and Walter
E. Oliu, 3rd Edition. ISBN 0-312-25978-6.
4. Mecnakshi Raman & Sangeeta Technical Communication

Course Name: Principals of Marketing

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

Overall Aims of the Course

Course Description:

This course is designed to provide students with an understanding of the principles of

Marketing. There will be a focus on the management of the marketing activities and
how marketing relates to overall organizational functioning, including the management
of exchange processes between business units and consumers and between firms. It will
include topics such as environmental analysis, industry and competitor analysis,
objective setting, marketing strategies, market mix components, and finally
implementation and control mechanisms. Additionally, the course will provide
opportunities for the practical implementation of the concepts covered and the
development of problem solving skills by means of face-to-face seminars and tutorials,
online learning and a marketing practice simulation. Marketing is the business function
that identifies customer needs and wants, determines which target markets the
organization can serve best, and designs appropriate products, services, and programs
to serve these markets. It guides the entire organization. The goal of marketing is to
create customer satisfaction by building value-based relationships with customers, in
conjunction with other internal and external business units.

Course Objectives are:

 Understand the role of marketing within society and within an economic system
 To understand how organizations identify customers and their wants/needs.
 To recognize and suggest applications of the marketing concept.
 To comprehend marketing decisions, based upon the combination of
product, price, promotion, and distribution elements. In this course, you will
study consumer and industrial markets and understand the value of the
marketing mix in the marketing planning process.
  To understand marketing is carried out by an organization to meet the
requirements of domestic and international buyers, both households and
businesses, within the bounds of ethics and the legal environment.
 To apply key frameworks and methods, and develop analytical skills to
solve marketing problems.
 To provide you with a firm foundation in marketing theory and marketing
lexicon.
 Another course objective is to relate the impact of marketing and its
integration with your own major or field of interest.
The most important element you will acquire from this course is not a list of
formulas, definitions, and properties. It is the gain of a cognitive approach to
synthesize information about various alternatives to economic decisions

Learning Outcomes:
On completion of this course, the student will be able to

 Understand the fundamental principles of marketing

 Explain marketing concepts and ideas in their own words

 Develop an organization‟s marketing strategy and implementation as part of a

simulation

 Think strategically about marketing issues

 Develop an argument and express themselves clearly in written and oral

communication

 Consider ethical issues

Class Format:

Our weekly class Instructions and discussions will follow this format:

Weekly Course Objectives

Week Module In This Chapter, We Will Address the Following
Questions.

 Know what marketing is and why you should

Chapter – 1:
(Page 04 –29 learn about it.
of TEXT  Understand the difference between marketing
BOOK) and macro marketing.
Marketing’s  Understand what a market driven economy is
1-2
Value To and how it adjusts the macro-marketing system.
Consumers,
 Understand what customer value is and why it
Firms And
is important to customer satisfaction.
Society
 Understand the important new terms.
  How does marketing affect customer value?
 How strategic planning is carried out at different
Chapter – 2: levels of the organization?
Marketing  What does a marketing plan include?
Concepts and  Know what the marketing concept is –and how
Definitions it should guide a firm or nonprofit major
3
Management organization.
Philosophy
(Page 30 – 55)  Relationship Marketing Establishing Profitable
TEXT BOOK Customer Relations

 Know the variables that shape the environment of

Chapter – 3: marketing strategy planning.
(Page 56 –85  Understand why company objectives are
of TEXT important in guiding marketing strategy planning.
BOOK)  Understand how the economic and technological
Evaluating environments can affect strategy planning.
4-5 Opportunities  Know how elements of the political and legal
In The environment affect marketing strategy planning.
Changing  Understand the cultural and social environment
Marketing and how demographic trends affect strategy
Environment planning.
 Understand how to screen and evaluate marketing
strategy opportunities.
Chapter – 4:  Know about defining generic markets and
6 –7 (Page 86 –114 product markets.
of TEXT  Know what market segmentation is and how to
BOOK) segment product markets in to submarkets.
Focusing  Recognize how some computer aided methods
Marketing
are used in segmenting.
Strategy With
 Know dimensions that may be useful for
Segmentation
segmenting markets.
And Positioning
Know what positioning is and why it is useful.
Chapter – 5:  Internal and External Analysis of the Company
(Page 115 –  See why business and organizational purchase
141 of TEXT decisions often involve multiple influences.
BOOK)  The Competition Competitor Analysis-
8 introduction
The MKT
Environments
 Describe who the business and organization
Chapter – 6: buyers are.
(Page 142 –  See why business and organizational purchase
166 of TEXT decisions often involve multiple influences.
BOOK)
 Understand the different types of buyer seller
relationships and their benefits and limitations.
10 - 11 Business and  Know about the number and distribution of
Organizational manufacturers and why they are important
Customers and customer group.
Their Buying
 Know how buying by service firms, retailers,
Behavior
wholesalers and governments similar to-and
different from-buying by manufacturers.
Chapter – 8:  Understand what “product” really means.
(Page 196 –  Know the key difference between goods and
12 - 13 223 of TEXT services.
BOOK)  Understand the importance of packaging in
strategy planning.
  Understand the role of warranties in strategy
Elements of planning.
Product  Know the differences among various consumer
Planning for and business product classes.
Goods and  Understand how product classes can help a
Services marketing manager plan marketing strategies.

14 – 15  Understand what product classes suggest about

place objectives.
Chapter – 10:
(Page 253 –  Understand why some firms use direct channel
277 of TEXT systems while others work with intermediaries
BOOK) and indirect systems.
 Know how to channel members in vertical
marketing systems shift and share functions to
Place and
meet customer needs.
Development of
Channel  Know how multichannel distribution and
Systems reverse channels operate.
 Know the main approaches firms use to reach
customers in international markets

16
 Know the advantages and disadvantages of the
promotion methods a marketing manager can
use in strategy planning.
Chapter – 13:  Understand the importance of promotion
(Page 328 – objectives.
355 of TEXT  Know how the traditional communication
BOOK) process affects promotion planning.
 Understand how customer initiated interactive
Promotion - communication is different.
Introduction to  Understand how promotion blends typically
Integrated vary over the adoption curve and product life
17
Marketing cycle
Communication  Understand how pricing objectives should guide
strategy planning for pricing decisions.
Chapter – 16:  Know what a marketing manager should
(Page 418 – consider when setting the price level for a
445 of TEXT product in the early stages of product life cycle.
BOOK)  Understand the many possible variations of a
Pricing price structure, including discounts, allowances,
Objectives and and who pays transportation costs.
Policies  Understand the value pricing concept and its
role in obtaining a competitive advantage and
offering target customers superior value.
Required Learning Resources
Text Book(s): “Basic Marketing: A Marketing Strategy Planning
(Title, Author, Edition, Publisher) Approach” By William D. Perreault, Jr., Joseph P.
Cannon, E. Jerome McCarthy, (19th Edition)
McGraw-Hill Irwin Publisher.
Reference Book(s): „„Principles of Marketing” By Philip Kotler, Gary
(Title, Author, Edition, Publisher) Armstrong, Agnihotri, Ehsan ul Haque, (13th
Edition): A south Asian Perspective, Pearson
Publisher.
 Semester- 8
Course Name: Professional Practices
Course Structure: Lectures: 3 / Labs: 0 Credit Hours: 3
Prerequisites: None

Objectives: A Computing graduate as professional has some responsibilities with respect

to the society. This course develops student understanding about historical, social,
economic, ethical, and professional issues related to the discipline of Computing. It
identifies key sources for information and opinion about professionalism and ethics.
Students analyze, evaluate, and assess ethical and professional computing case studies.
Course Outline: Introduction, Computing Ethics, Philosophy of Ethics, Ethics and the
Internet. Intellectual Copy Right, Accountability and Auditing, Social Application of
Ethics.
Resources:
1. Deborah G. Johnson, “Computer Ethics”, Pearson Education (2001) 3rd edition.
2. Professional Issues in Software Engineering, M.F. Bott et. al.