Multimedia Computing

Course Title: Multimedia Computing Full Marks: 60 + 20 + 20

Course No: CSC319 Pass Marks: 24 + 8 + 8
Nature of the Course: Theory + Lab Credit Hrs: 3
Semester: V

Course Description: This course covers the basic concepts of Multimedia system including
introduction, Sound / Audio System, Images and Graphics, Video and Animation, Data
Compression, User Interfaces, Abstractions for programming and Multimedia Application

Course Objectives: This course covers three main objectives on multimedia system these are
devices, systems and applications

Detail Syllabus:
Unit 1 Introduction to Computers Teaching
Hours (3)
Introduction Introduction To multimedia system , history and 1 hr
applications
Global structure of Device domain, system domain, application domain,
Multimedia cross domain with diagram

Multimedia Application Basic applications of multimedia system in all

sectors
Medium The perception medium, the representation medium,
the presentation medium, the storage medium, the
transmission medium, the information exchange
medium, representation values and representation
spaces, representation dimensions
Multimedia system and Combination of media, independence ,computer 1 hr
properties support integration

Characteristics of a Multimedia systems must be computer controlled,

Multimedia System Multimedia systems are integrated, the information
they handle must be represented digitally, the
interface to the final presentation of media is usually
interactive.

Challenges for Synchronization, Sequencing, Distributed Network, 1hr

Multimedia Systems Inter-media Scheduling

Components of a Capture devices, Storage Devices,

Multimedia System Communication Networks, Computer Systems,
Display Devices,
Unit 2 Sound / Audio System Teaching
Hours (6)
Concepts of sound Frequency, amplitude, Computer representation of 4
system sound, sampling rate, quantization, sound hardware

Music and speech Basic MIDI concepts, MIDI devices, MIDI

 messages, MIDI and SMPTE timing standards,
MIDI software
Speech Generation Basic Notions, Reproduced Speech output, Time
dependent sound concatenation, frequency –
dependent sound concatenation
Speech Analysis Research area of speech analysis, speech 2 hr
recognition,
Speech Transmission Signal form coding, source coding in parametrized
systems, recognition and synthesis systems
Unit 3 Images and Graphics Teaching
Hours (5)
Digital Image Image format, storage image format 5 hrs
Representation

Image and graphics Introduction about different Image and graphics

Format Format

Image Synthesis , Computer Image processing, dynamics in graphics,

analysis and the framework of interactive graphics systems,
Transmission Graphics input/ output hardware, dithering, image
analysis, Image recognition, Image recognition
steps, Image transmission
Unit 4 Video and Animation Teaching
Hours (6)
Video signal Visual representation, Transmission, digitalization, 3 hr
representation

Computer Video Format Introduction to Computer video format

Computer- Based Input process, composition stage, inbetween process,

animation Changing colours,

Animation Language Linear list notations, General purpose language,

Graphical Languages,
Methods of controlling Full explicit control, procedural control, constraint 2 hr
Animation based systems, tracking live action, kinematics and
dynamics,
Display of Animation Basic knowledge about Display of Animation

Transmission of Basic knowledge about Transmission of Animation 1 hr

Animation

Unit 5 Data Compression Teaching

Hours 8)
Storage Space Basic knowledge about Storage Space 4hr

Coding Requirements Basic knowledge about Coding Requirements

Source, Entropy and Entropy coding, source coding- Huffman Encoding,

Hybrid Coding
 Arithmetic encoding (introduction only), Run length
encoding,
Lossy Sequential DCT- Steps of Lossy Sequential DCT- based Mode 4 hr
based Mode

Expanded Lossy DCT- Steps of Expanded Lossy DCT-based Mode

based Mode

JPEG and MPEG JPEG and MPEG compression process

Unit 6 User Interfaces Teaching

Hours (5)
Basic Design Issues Architectural issues, information characteristics for 5 hr
presentation, presentation function, presentation
design knowledge, effective human computer
interaction
Video and Audio at the Classification of software: system software and
User Interface application software, audio and video at the user
interface
User- friendliness as the Easy to learn instruction, presentation, Dialogue
Primary Goal boxes, additional design criteria, design specific
criteria
Unit 7 Abstractions for programming Teaching
Hours (5)
Abstractions Levels Abstraction level of the programming of multimedia 2 hr
systems
Libraries Introduction to Libraries

System Software Data as Time capsules, data as Streams,

Toolkits Introduction to toolkits 3 hr

Higher Programming Media as types, Media as files, Media as processes,

Languages programming language requirements, Interprocess
communication Mechanism, language,
Object –oriented Class, object, Inheritance, Polymorphism,
approaches application-specific metaphors as classes,
application-generic Metaphors as classes, devices as
classes, processing units as classes, Distribution of
BMOs and CMOS, Media as classes,
Communication-specific Metaphors as classes
Unit 8 Multimedia Application Teaching
Hours (5)
Media preparation and Means, video support, scanner devices, recognition 2 hr
composition devices, tracking devices, motion based devices,

Media integration and Multimedia editors, Hypermedia/ Hypertext editors,

communication authoring tools, tele-services, interactive services,
Distributed services, Media Consumtion
Media Entertainment Virtual Reality, Interactive video, Interactive audio,
 Games
Telemedicine Application of Telemedicine in Multimedia

E-learning Application of e-Learning in Multimedia 3 hr

Digital video editing and Application of in Digital video editing and production
production systems systems in Multimedia

Video conferencing Application of Video conferencing

in Multimedia

Video-on-demand Application of Video-on-demand

in Multimedia

Laboratory Works:
After completing this course, students should have practical knowledge of different
components of multimedia system, multimedia tools and applications
The laboratory work includes:

Macromedia FreeHand
Macromedia Flash
Swish Max
Macromedia Director
Morphing techniques
Audio and Video editing software
Data compression

Text Books:
1. Multimedia: Computing, Communications and Applications, Ralf Steinmetz and Klara Nahrstedt,
Pearson Education Asia

Reference Books:
2. Multimedia Communications, Applications, Networks, Protocols and Standards, Fred Halsall,
Pearson Education Asia
3. Multimedia Systems, John F. Koegel Buford, Pearson Education Asia
Course Title: Web Technology Full Marks: 60+20+20
Course No: CSC318 Pass Marks: 24+8+8
Nature of the Course: Theory + Lab Credit Hours: 3
Year: Third, Semester: Fifth

Course Description: This course covers the fundamental concepts of HTML, CSS, JavaScript,
XML, and PHP.

Course Objectives: The main objective of this course is to provide basic knowledge of web design
using HTML and CSS, client side scripting using JavaScript, handling web data using XML and
server side scripting using PHP.

Detail Syllabus

Chapters / Units Teaching Teaching Hours

Methodology
Unit I: Introduction Class Lecture 3 Hours

1.1.Web Basics: Internet, Intranet, WWW, Static and

Dynamic Web Page; Web Clients; Web Servers

1.2.Client Server Architecture: Single Tier, Two-Tier,

Multi-Tier

1.3.HTTP: HTTP Request and Response; URL

1.4.Client Side Scripting, Server Side Scripting,

1.5.Web 1.0, Web 2.0

Unit II: Hyper Text Markup Language Class Lecture 10 Hours

+
2.1. Introduction to HTML; Elements of HTML Lab Session
Document; HTML Elements and HTML
Attributes, Headings, Paragraph, Division ,
Comments in HTML

2.2. Formatting: b, i, small, sup, sub; Spacing: Pre,

Br; Formatting Text Phrases: span, strong, tt

2.3. Image element; Anchors; Lists: Ordered and

Unordered and Definition;

2.4. Tables(table, tr, td colspan, rowspan, thead,

tbody,tfoot); Frames (iframe)

2.5. Forms: Form Elements, ID attributes, Class

Attributes of HTML Elements
2.6. Meta Tag, Audio (src, controls, autoplay,
preload, loop), Video (src, controls, autoplay,
poster, loop), Canvas, Main, Section, Article,
Header, Footer, Aside, Nav, Figure Tags

2.7. HTML Events: Window Events, Form Element

Events, Keyboard Events, Mouse Events

Unit III: Cascading Style Sheets Class Lecture 8 Hours

+
3.1. Introduction; Cascadding Style Sheets (CSS); Lab Session
CSS Syntax

3.2. Inserting CSS: Inline, Internal, External

3.3. CSS ID and Class Selectors

3.4. Colors; Backgrounds; Borders; Text; Font; List;

Table

3.5. CSS Box Model; Normal Flow Box Layout:

Basic Box Layout

3.6. Display Property, Padding, Margin; Positioning:

Relative, Float, Absolute

3.7. CSS3 Borders, Box Shadows, Text Effects and

shadow

3.8. Basics of Responsive Web Designs; Media

Queries (Media Types, Viewport)

3.9. Introduction to Bootstrap (Basic concepts and

installation)

Unit IV: Client Side Scripting with JavaScript Class Lecture 9 Hours
+
4.1. Structure of JavaScript Program Lab Session

4.2. Variables and Data Types; Statements:

Expression, Keyword, Block; Operators

4.3. Flow Controls, Looping

4.4. Functions; Popup Boxes: Alert, Confirm, Prompt

4.5. Objects and properties; Constructors

4.6. Arrays

4.7. Built-in Objects: Window, String, Number,

Boolean, Date, Math, RegExp, Form, DOM

4.8. User Defined Objects; Event Handling and Form

Validation

4.9. Error Handling (Try/Catch),

4.10. Handling Cookies

4.11. jQuery Syntax; jQuery Selectors (Element, Id,

Class), jQuery Events (Mouse, Keyboard, Form,
Document/Window) and jQuery Effects
(Hide/Show, Fade, Slide, Animate, Stop,
Callback, Chaining )

4.12. Introduction to JSON (Syntax, Data types,

Parsing JSON)

Unit V: AJAX and XML Class Lecture 7 Hours

+
5.1. Basics of AJAX Lab Session

5.2. Introduction to XML and its Application

5.3. Syntax Rules for creating XML document

5.4. XML Elements; XML Attributes; XML Tree

5.5. XML Namespace

5.6. XML schema languages: Document Type

Definition(DTD), XML Schema Definition
(XSD); XSD Simple Types, XSD Attributes;
XSD Complex Types

5.7. XML Style Sheets (XSLT)

5.8. Xquery

Unit VI: Server Side Scripting using PHP Class Lecture 8 Hours
+
6.1. PHP Syntax Lab Session

6.2.Variables, Data Types , Strings, Constants

6.3.Operators, Control structure, Functions, Array

 6.4.Creating Class and Objects

6.5.PHP Forms, Accessing Form Elements, Form

Validation, Events

6.6.Cookies and Sessions

6.7.Working with PHP and MySQL, Connecting to

Database, Creating, Selecting, Deleting, Updating
Records in a table, Inserting Multiple Data

6.8. Introduction to CodeIgniter, Laravel, Wordpress

(Basic concepts and Installation)

Text Books:
1. Web Design with HTML, CSS, JavaScript and jQuery Set, Jon Duckett, John Wiley & Sons
2. Web Technologies: A Computer Science Perspective, Jeffrey C. Jackson , Pearson Prentice
Hall
3. Learning PHP, MySQL & JavaScript: with jQuery, CSS & HTML5, Robin Nixon, O’Reilly
4. PHP & MySQL: Server-side Web Development, Jon Ducket, Wiley

Reference Books:
1. HTML5 and CSS3 for the Real World”, Estelle Weyl, Louis Lazaris, Alexis Goldstein,
Sitepoint
2. HTML & CSS: Design and Build Websites, Jon Duckett, John Wiley & Sons
3. Dynamic Web Programming and HTML5, Paul S. Wang, CRC Press
4. HTML5 Programming with JavaScript for Dummies, John Paul Mueller
5. JavaScript and JQuery: Interactive Front-end Web Development, Jon Duckett, Wiley
6. The Complete Reference: HTML and CSS, Thomas A. Powell, Mc Graw Hill
7. JavaScript: The Web Technologies Series, Don Gosseli, Course Technology Cengage Learning
8. Web Technologies: HTML, JAVASCRIPT, PHP, JAVA, JSP, ASP.NET, XML and AJAX,
Black Book, Dreamtech Press
9. An Introduction to XML and Web Technologies, Anders Møller and Michael I. Schwartzbach,
Addison-Wesley
10. PHP and MySQL Web Development, Luke Welling, Addison Wesley
11. www.w3schools.com
 Simulation and Modelling

Course Title: Simulation and Modelling Full Marks: 60 + 20 + 20

Course No: CSC317 Pass Marks: 24 + 8 + 8
Nature of the Course: Theory + Lab Credit Hrs: 3
Semester: V

Course Description: The syllabus consists of introduction to system, modelling and simulation
of different types of systems. It includes the modelling of systems, its validation, verification and
analysis of simulation output. It comprises the concept of queuing theory, random number
generation as well as study of some simulation languages.

Course Objective: To make students understand the concept of simulation and modelling of real
time systems.

Detailed Syllabus:

Unit 1 Introduction to Simulation 6 Hours

System and System Concept of system and system environment 1 hour
Environment
Components of System System, entities, attributes, events, state variables
and other terms related to system
Discrete and Continuous Introduction and examples
System
System Simulation, Model of Introduction to system simulation and system 2 hours
a System, Types of Model model, different types of models and examples
(physical/ mathematical, static/dynamic,
discrete/continuous, deterministic/stochastic)
Use of Differential and Partial Brief review of how differential and partial 1 hour
differential equations in differential equations can be used in system-
Modelling modelling
Advantages, Disadvantages Advantages, Disadvantages, Limitations and 1 hour
and Limitations of Simulation, Applications of system simulation
Application Areas
Phases in Simulation Study Study of different phases during simulation 1 hour

Unit 2 Simulation of Continuous and Discrete System 7 Hours

Continuous System Models Concept, examples, use of differential equations 2 hours
Analog Computer, Analog for modelling continuous system
Methods,
Hybrid Simulation,
Digital-Analog Simulators,
Feedback Systems

1
Discrete Event Simulation, Concept of discrete event simulation, time 1 hour
Representation of time, representation and management
Simulation Clock and Time
Management
Arrival Processes - Poisson Concept of arrival pattern, generation of arrival 2 hours
Processes, Non-stationary pattern using Poisson and Non-stationary Poisson
Poisson Processes, Batch with example, Introduction to batch arrival
Arrivals processes
Models of Gathering statistics
Different statistics (like counts, summary 1 hour
measures, utilization, occupancy, distributions etc)
that are needed to generate report and methods to
gather such statistics
Probability and Monte Carlo Concept with an example 1 hour
Simulation

Unit 3 Queuing System 6 Hours

Characteristics and StructureConcept of Basic Queuing System, Its 2 hours
of Basic Queuing System, Characteristics, Discipline, Models and related
Models of Queuing System terms
Queuing notation Kendall’s notation for queuing system
Single server and Multiple Concept and examples of single server and 1 hour
server Queuing Systems multiple server queue
Measurement of Queuing Performance evaluation of queuing system 3 hours
System Performance, (M/M/1) in terms of parameters like average
number of customers, average time spent in
Elementary idea about system and in queue per customer, server
networks of Queuing with utilization, cost of waiting time and idle time, with
particular emphasis to numerical examples
computer system,

Elementary idea about Introduction of network of queues

network of queuing with
particular emphasis to
computer system

Applications of queuing Examples of computer system related queuing

system systems and other applications of queuing system
Unit 4 Markov Chains 2 Hours
Features, Process Examples, Concept, Features, Examples, Applications of 2 hours
Applications Markov Chains

Unit 5 Random Numbers 7 Hours

Random Numbers and its Concept, properties and types of random numbers 1 hour
properties,
Pseudo Random Numbers
Methods of generation of Linear Congruential Method (mixed and 2 hours

2
Random Number multiplicative), Mid square method
Tests for Randomness - - Uniformity testing – K-S Test and Chi – square 2 hours
Uniformity and independence test
- Independent testing – Gap test, Auto correlation
test, Poker test upto 4 digits
Random Variate Generation Random variate generation via inverse transform 2 hours
technique and acceptance-rejection technique

Unit 6 Verification and Validation 4 Hours

Design of Simulation Models Concept of Model Building; verification; 4 hours
Verification of Simulation validation and calibration; three step approach,
Models, Introduction to accreditation of models
Calibration and Validation of
the models,
Three-Step Approach for
Validation of Simulation
Models,
Accreditation of Models

Unit 7 Analysis of Simulation Output 4 Hours

Confidence Intervals and Hypothesis Testing, Estimation Methods (Point 4 hours
Estimation and confidence interval with examples), Simulation run statistics,
Replication of runs, Elimination of initial bias

Unit 8 Simulation of Computer Systems 9 Hours

Simulation Tools 1 hour
Simulation Languages - GPSS 5 hours
- study and use of language with related problem
- study of different blocks of GPSS blocks
- concept of queue, storage, facility, multi-server queue, decision making

Case Studies of different types of Simulation Models, Construction of sample 3 hours

mathematical models

Laboratory Work:
After completing this course, students should have practical knowledge regarding simulation of
some real time systems (continuous and discrete event systems), Queuing Systems, Random
Number generations as well as study of Simulation Tools and Language. Verification and
validation of models can be done, the analysis of outputs produced in the laboratory exercise can
also be performed. The laboratory work should include:
 Implement different methods of random number generation

3
Course Title: Cryptography Full Marks: 60+20+20
Course No: CSC316 Pass Marks: 24+8+8
Nature of the Course: Theory + Lab Credit Hours: 3
Year/Semester: Third/Fifth

Course Description: The course introduces the underlying the principles and design of
cryptosystems. The course covers the basics concepts of cryptography including: traditional ciphers,
block ciphers, stream ciphers, public and private key cryptosystems. The course also includes the
theory of hash functions, authentication systems, network security protocols and malicious logic.

Course Objectives: The objectives of this course are to familiarize the students with cryptography
and its applications. The students will be able to develop basic understanding of cryptographic
mechanisms.

Detail Syllabus

Chapters / Units Teaching Teaching Hours

Methodology
Unit I: Introduction and Classical Ciphers Class Lecture 7 Hours
+
1.1. Security: Computer Security, Information Lab Session
Security, Network Security,
CIA Triad: Confidentiality, Integrity,
Availability,
Cryptography, Cryptosystem, Cryptanalysis,
Security Threats:,
Attacks: Passive (Release of message, Traffic
analysis), Active (Replay, Denial of service)
Security Services: Authentication, Access
Control, Nonrepudiation
Security Mechanisms, Policy and Mechanism

1.2. Classical Cryptosystems:

Hierarchy of cipher
Substitution Techniques:
- Monoalphabetic: Ceasar Cipher, Hill
- Polyalphabetic: Vigenere Cipher (Variants:
vernam, one time pad), Playfair

Transposition Techniques: Rail Fence Cipher

1.3. Modern Ciphers: Block Ciphers, Stream

Ciphers,Symmetric Ciphers, Asymmetric
Ciphers
Unit II: Symmetric Ciphers Class Lecture 10Hours
+
2.1. Fiestel Cipher Structure, Substitution Lab Session
Permutation Network (SPN)

2.2. Data Encryption Standards (DES): Key

Generation, Encryption and Decryption Process,
Weak Keys in DES, Double DES, Meet in
Middle Attack, Triple DES

2.3. Finite Fields: Basic concepts of Groups, Rings,

and Fields, GCD, Euclidean Algorithm, Modular
Arithmetic, Set of Residue (Zn), Congruence,
Residue classes, Quadratic residue, Operations
on Zn (Addition, Subtraction, Multiplication),
Properties of Zn, Inverses: Additive Inverse,
Multiplicative Inverse, Relatively Prime,
Extended Euclidean Algorithm, Galois Fields
(GF(p) & GF(2n)), Polynomial Arithmetic :
Addition, Multiplication and Division over
Galois Field

2.4. International Data Encryption Standard (IDEA):

Key Generation, Encryption and Decryption
Process

2.5. Advanced Encryption Standards (AES): Key

Generation, Encryption and Decryption Process

2.6. Modes of Block Cipher Encryptions (Electronic

Code Book, Cipher Block Chaining, Cipher
Feedback Mode, Output Feedback Mode,
Counter Mode)

Unit III: Asymmetric Ciphers Class Lecture 8 Hours

+
3.1. Number Theory: Prime Numbers, Primality Lab Session
Testing, Miller-Rabin Algorithm,Fermat’s
Theorem, Euler’s Totient Function andEuler’s
Theorem, Primitive Root, Discrete Logarithms

3.2. Public Key Cryptosystems, Applications of

Public Key Cryptosystems

3.3. Distribution of public key, Distribution of secret

key by using public key cryptography, Diffie-
Hellman Key Exchange, Man-in-the-Middle
Attack

3.4. RSA Algorithm: Key Generation, Encryption

and Decryption Process
3.5. Elgamal Cryptographic System: Key Generation,
Encryption and Decryption Process

Unit IV: Cryptographic Hash Functions and Class Lecture 8Hours

Digital Signatures +
Lab Session
4.1. Message Authentication, Message
Authentication Functions, Message
Authentication Codes

4.2. Hash Functions, Properties of Hash functions,

Applications of Hash Functions

4.3. Message Digests: Details of MD4 and MD5

algorithms

4.4. Secure Hash Algorithms: Details of SHA-1 and

SHA-2 algorithms, Comparison of SHA
parameters, SHA-512

4.5. Digital Signatures: Direct Digital Signatures,

Arbitrated Digital Signature

4.6. Digital Signature Standard: The DSS Approach,

Digital Signature Algorithm(DSA)

4.7. Digital Signature Standard: The RSA Approach

Unit V: Authentication Class Lecture 3 Hours

+
5.1. Authentication System, Lab Session

5.2. Password Based Authentication, Dictionary

Attacks (Online and Offline),

5.3. Challenge Response System, One Way

Authentication, Mutual Authentication

5.4. Biometric System

5.5. Needham-Schroeder Scheme, Kerberos Protocol,

Kerberos 5
 Unit VI: Network Security and Public Key Class Lecture 6 Hours
Infrastructure +
Lab Session
6.1. Overview of Network Security

6.2. Digital Certificates and X.509 certificates,

Certificate Life Cycle Management

6.3. PKI trust models, PKIX

6.4. Email Security: Pretty Good Privacy (PGP),

Services provided by PGP
6.5. Secure Socket Layer (SSL) Protocol

6.6. Transport Layer Security (TLS) Protocol

6.7. IP Security (IPSec) Protocol

6.8. Firewalls, Firewall Characteristics, Types of

Firewalls: Packet filtering firewall, Circuit-level
gateway, Stateful inspection firewall, Proxy
firewall, Next-generation firewall

Unit VII: Malicious Logic (3 Hrs) Class Lecture 6 Hours

+
7.1.Malicious Logic, Types of Malicious Logic: Lab Session
Virus, Worm, Trojan Horse, Zombies, Denial of
Service Attacks,

7.2. Intrusion, Intruders and their types (Masquerader,

Misfeasor, Clandestine),Intrusion Detection
System: Statisticalanomaly detection, Rule-based
detection

Text Book:
1. W. Stallings, Cryptography and Network Security: Principles and Practice

Reference Books:
1. William Stallings, Network Security Essentials: Applications and Standards
2. Matt Bishop, Computer Security, Art and Science.
3. Mark Stamp, Information Security: Principles and Practices.
4. Bruce Schneier, Applied Cryptography.
5. Douglas. R. Stinson. Cryptography: Theory and Practice.
6. B. A. Forouzan, Cryptography & Network Security, Tata Mc Graw Hill.
 System Analysis and Design

Course Title: System Analysis and Design Full Marks: 60 + 20 + 20

Course No: CSC315 Pass Marks: 24 + 8 + 8
Nature of the Course: Theory + Lab Credit Hrs: 3
Semester: V

Course Description: This course familiarizes students with the concepts of information
systems development including systems development life cycle, different approaches to
systems development, project management, planning, analysis, design, implementation and
maintenance. This course also covers some fundamental concepts of object oriented systems
analysis and design.

Course Objectives: The main objective of this course is to provide knowledge of different
concepts of system analysis and design so that students will be able to develop information
systems using different methodologies, tools, techniques, and approaches.

Detail Syllabus:
Unit 1 Foundations for Systems Development Teaching
Hours (10)
Unit 1.1 The Systems Introduction (Information System and its Types, 3 Hrs.
Development System Analysis and Design) ; A Modern
Environment Approach to Systems Analysis and Design;
Developing Information Systems and the Systems
Development Life Cycle; The Heart of the Systems
Development Process and Traditional Waterfall
SDLC; CASE Tools
Unit 1.2 Other Prototyping; Spiral; Rapid Application 3 Hrs.
Approaches Development; Introduction to Agile Development
Unit 1.3 Managing the Introduction; Managing the Information Systems 4 Hrs.
Information Systems Project (Project Management and it’s Phases);
Project Representing and Scheduling Project Plans (Gantt
Charts, Network Diagrams, Representing Project
Plans, Calculating Expected Time Duration using
PERT); Using Project Management Software
Unit 2 Planning Teaching
Hours (5)
Unit 2.1 Identifying Introduction; Identifying and Selecting Systems 2 Hrs.
and Selecting Systems Development Projects (The Process of Identifying
Development Projects and Selecting IS Development Projects,
Deliverables and Outcomes); Corporate and
Information Systems Planning
Unit 2.2 Initiating and Introduction; Initiating and Planning Systems 3 Hrs.
Planning Systems Development Projects (Process of Initiating and
Development Projects Planning IS Development Projects, Deliverables
and Outcomes), Assessing Project Feasibility
(Accessing Economic, Technical, Operational,
Scheduling, Legal and contractual, and Political
Feasibility); Commonly used Cost-Benefit
 Analysis Techniques (Net Present Value, Return
on Investment, Break-Even Analysis); Building
and Reviewing the Baseline Project Plan
Unit 3 Analysis Teaching
Hours (13)
Unit 3.1 Determining Introduction; Performing Requirements 3 Hrs.
System Requirements Determination (Process and Deliverables);
Traditional Methods for Determining Requirements
(Interviewing and Listening, Interviewing Groups,
Directly Observing Users, Analyzing Procedures
and other Documents); Contemporary Methods for
Determining System Requirements (Joint
Application Design, Prototyping); Radical Methods
for Determining System Requirements (Business
Process Reengineering, Identifying Process to
Reengineer, Disruptive Technology)
Unit 3.2 Structuring Introduction; Process Modeling (Modeling a 6 Hrs.
System Process System’s Process for Structured Analysis,
Requirements Deliverables and Outcomes); Data Flow Diagrams
(Context Diagram and DFD, Data Flow
Diagramming Rules, Decomposition and
Balancing DFDs); Modeling Logic with Decision
Tables, Decision Trees, and Pseudocodes
Unit 3.3 Structuring Introduction; Conceptual Data Modeling (Process, 4 Hrs.
System Data Deliverables and Outcomes); Gathering
Requirements Information for Conceptual Data Modeling;
Introduction to E-R Modeling (Entities, Attributes,
Keys and Identifiers, Relationships: Degree,
Cardinality, Naming and Defining Relatioships,
Associative Entity )
Unit 4 Design Teaching
Hours (7)
Unit 4.1 Designing Introduction; Database Design (Process, 3 Hrs.
Databases Deliverables and Outcomes, Relational Database
Model, Well-structured Relations); Normalization
(Normalization up to 3NF); Transforming E-R
Diagrams Into Relations; Merging Relations;
Physical File and Database Design; Designing
Fields; Designing Physical Tables
Unit 4.2 Designing Introduction; Designing Forms and Reports 2 Hrs.
Forms and Reports (Process, Deliverables and Outcomes); Formatting
Forms and Reports (General Formatting
Guidelines, Highlighting Information, Color vs.
No-Color, Displaying Text, Designing Tables and
Lists, Paper vs. Electronic Reports); Assessing
Usability (Usability Success Factors, Measures of
Usability)
Unit 4.3 Designing Introduction; Designing Interfaces and Dialogues 2 Hrs.
Interfaces and (Process, Deliverables and Outcomes); Interaction
Dialogues Methods and Devices (Methods of Interacting,
 Hardware Options for System Interaction);
Designing Interfaces (Designing Layouts,
Structuring Data Entry, Controlling Data Input,
Providing Feedback, Providing Help); Designing
Dialogues; Designing Interfaces and Dialogues in
Graphical Environments
Unit 5 Implementation and Maintenance Teaching
Hours (4)
Unit 5.1 System Introduction, System Implementation (Coding, 2 Hrs.
Implementation Testing and Installation Process, Deliverables and
Outcomes from Coding, Testing, Installation,
Documenting, and Training and Supporting
Users), Software Application Testing (Different
Types of Testing, the Testing Process), Installation
(Installation and its Types), Documenting the
System, Training and Supporting Users,
Organizational Issues in Systems Implementation
Unit 5.2 Maintaining Introduction, Maintaining Information 2 Hrs.
Information Systems Systems(Process, Deliverables and Outcomes),
Conducting Systems Maintenance (Types and Cost
of Maintenance, Managing Maintenance, Using
Automated Tools)
Unit 6 Introduction to Object-Oriented Development Teaching
Hours (6)
Introduction to Basic Characteristics of Object-Oriented Systems; 6 Hrs.
Object-Oriented Object-Oriented System Analysis and Design
Development (OOSAD); Introduction to Unified Modeling
Language, Structural (Class, Object, Deployment,
and Component Diagram) and Behavioral (Use
Case, Activity, Sequence, and State) Diagrams

Laboratory / Project Work: In the practical session, students will learn to use project
management, CASE, and modeling tools. They also prepare a project report that includes at
least analysis, design, and implementation phases of system analysis and design. The project
can be done in groups with at most four members in each group using any suitable database,
programming, and interfacing technologies.

Text Books:
1. Joseph S. Valacich and Joey F. George, Modern Systems Analysis and Design, 8th
Edition, Pearson
2. Alan Dennis, Barbara Haley Wixom, and David Tegarden, Systems Analysis and Design
– An Object-Oriented Approach with UML, 5th Edition, Wiley

References Books:
1. Kenneth E. Kendall and Julie E. Kendall, System Analysis and Design, 9th Edition,
Pearson
2. Jeffrey Whitten and Lonnie Bently, System Analysis and Design Methods, 7th Edition
Scott Tilley and Harry J. Rosenblatt, System Analysis and Design, 11th Edition
 Design and Analysis of Algorithms

Course Title: Design and Analysis of Algorithms Full Marks: 60 + 20 + 20

Course No: CSC314 Pass Marks: 24 + 8 + 8
Nature of the Course: Theory + Lab Credit Hrs: 3
Semester: V

Course Description:This course covers the basic concepts of computers and information
technology including introduction, hardware, software, memory, input/output, data
representation, database, networks and data communication, Internet, multimedia, and
computer security.

Course Description: This course introduces basic elements of the design and analysis of
computer algorithms. Topics include asymptotic notations and analysis, divide and conquer
strategy, greedy methods, dynamic programming, basic graph algorithms, NP-completeness,
and approximation algorithms. For each topic, beside in-depth coverage, one or more
representative problems and their algorithms shall be discussed.

Course Objectives:
 Analyze the asymptotic performance of algorithms.
 Demonstrate a familiarity with major algorithm design techniques
 Apply important algorithmic design paradigms and methods of analysis.
 Solve simple to moderately difficult algorithmic problems arising in applications.
 Able to demonstrate the hardness of simple NP-complete problems

Detail Syllabus:
Unit 1 Foundations of Algorithm Analysis Teaching
Hours (4)
Algorithms and its Definition of algorithms and brief explanation about 1 hr
properties the basic properties of algorithms
RAM model Explanation of the RAM model and its use for
algorithm analysis.
Time and Space Concepts of Time and Space Complexity with best
Complexity case, worst case , average case
Detailed Analysis of Detailed Analysis with examples like factorial of an
algorithms integer using RAM model.
Concept of Aggregate Definition, brief explanation of Aggregate Analysis
Analysis with example.
Asymptotic Notations: Concept, definition of Asymptotic notation: Big-O, 1 hr
Big-Ω and Big-Ө Notations and their Geometrical
Interpretation and Examples.
Recursive Algorithms Brief overview of recursion and , Recursive 2 hrs
Algorithms
Recurrence Relations Definitions of Recurrence Relations with example.
Uses of Recurrence Relations in Algorithm
Analysis.
Solving Recurrences Recursion Tree Method, Substitution Method,
Application of Masters Theorem for solving
recurrence relations. Examples
Unit 2 Iterative Algorithms Teaching
Hours (4)
Basic Algorithms Algorithm for GCD, Fibonacci Numbers and 1 hr
analysis of their time and space complexity.
Searching Algorithms: Sequential Search and its analysis 3 hrs
Sorting Algorithms: Description of Bubble Sort, Selection Sort and
Insertion Sort with their complexity analysis.
Unit 3 Divide and Conquer Algorithms Teaching
Hours (8)
Concepts Concept and applications of divide and conquer 2 hr
approach in algorithm design.
Searching Algorithms: Concept and detail description of Binary Search
algorithms and its analysis, Finding Minimum and
maximum element in a list of items(Min-Max
algorithm) and their analysis.
Sorting Algorithms: Merge Sort algorithm, examples and its time and 1 hrs
space complexity
Concepts of partitioning, Quick Sort algorithm and 2 hrs
its analysis ( Best Case, Worst Case and Average
Case ). Examples, Randomized Quick Sort and its
analysis.
Concept of Heap Data Structures(max , min). Heap 1 hr
Sort Algorithm ( with Build Heap and Heapify )
and its complexity analysis.
Order Statistics Concepts of Order statistics, Median order. Brute- 1hrs
force approach for selection
Selection in Expected Linear Time and its analysis.
Selection in Worst Case Linear Time algorithm and 1 hr
its complexity analysis.
Unit 4 Greedy Algorithms Teaching
Hours (6)
Introduction to Greedy Concept of Optimization Problems and Optimal 1 hr
Approach solution. Introduction of Greedy Strategy for
algorithm design. Elements of Greedy
Strategy(Greedy Choice Property, Optimal
Substructure Property)
Greed Algorithms: Concept of Knapsak problem, Algorithm for 1 hr
Fractional Knapsack Problem examples and
analysis of its complexity.
Concept of Job Sequencing Problem with deadline. 1 hr
Algorithm for Job Sequencing with deadline and its
time complexity.
Kruskal’s and Prim’s algorithms for Minimum 2 hr
Spanning Tree, their examples and complexity
analysis. Correctness .Dijkastra Shortest Path
Algorithms , example and its time complexity.
Huffman Coding: Purpose of Huffman Coding, Prefix Codes, 1hr
Huffman Tree, Huffman Coding Algorithm,
example and its Analysis.
Unit 5 Dynamic Programming Teaching
Hours (8)
Introduction Concepts of Dynamic Programming approach for 1.5hrs
algorithm design, Greedy Algorithm vs Dynamic
Programming, Recursion vs Dynamic
Programming. Elements of Dynamic Programming
Approach
D P Algorithms: Concept of Matrix Chain Multiplication, its 1.5 hrs
Algorithm ,examples and complexity analysis
String Editing Algorithm(edit distance problem 1 hr
with insertion, deletion, replace operation) and its
complexity analysis
0-1 Knapsack problem and its complexity analysis. 3hr
Floyd Warshall Algorithms for all pair shortest path
problem, example and its complexity analysis.
Travelling Salesman Problem and its analysis
Memoization Strategy Concept of Memoization. Dynamic Programming 1hr
vsMemoization.
Unit 6 Backtracking Teaching
Hours (5)
Introduction Concept of Backtracking Approach. Recursion vs 1hr
Backtracking
Backtracking Concept of Subset Sum, Algorithm for Subset-Sum, 4 hrs
Algorithms its example and Complexity Analysis.
Zero-One Knapsack Problem, algorithm with
backtracking approach and its analysis.
N-Queen Problem and their Analysis
Unit 7 Number Theoretic Algorithms Teaching
Hours (5)
Introduction Concept of Number Theoretic Notation. 2 hrs
Concept of Modular Linear Equations. Chinese
Remainder Theorem.
Solving Modular Euclid’s and Extended Euclid’s Algorithms for 2 hrs
Linear Equations solving Modular Linear Equations.
Primility Testing Miller-Rabin Randomized Primility Test and 1hr
Analysis
Unit 8 NP Completeness Teaching
Hours (5)
Tractable and Concept of tractable and intractable problems, 2 hr
Intractable Problems, Polynomial Time and Super Polynomial Time
Complexity Classes complexity.
P , NP , NP Complete, NP Hard with Examples
NP Complete Problems NP Completeness and Problem Reducibility, 2 hrs
Concept of Cooks Theorem(Without Proof). Proof
of NP Completeness( CNF-SAT, Vertex Cover and
Subset-Sum Problem)
Approximation Concept and Application, Vertex Cover Problem, 1hr
Algorithms Subset Sum Problem