COMPUTER SCIENCE AND ENGINEERING

SEMESTER VIII
PROGRAM ELECTIVE IV
 Year of
CATEGORY L T P Credits
CCT416 CYBER LAW Introduction

PEC 2 1 0 3 2019

Preamble: This course provides a solid foundation that furnishes the learner with in depth
knowledge of current Cyber laws. The course provides an insight into the laws keeping in view of
the latest developments in IPRs related to computer field and growing cyber related crimes. The
course also helps to create an understanding on Intellectual Properties and the importance of it,
trademarks and Trade secrets and to create awareness of unfair competition and its methods.

Course Outcomes: After the completion of the course the student will be able to

CO# Course Outcomes

Highlight the basics and importance of Cyber space and IT act. (Cognitive
CO1
Knowledge Level: Understand)
Comprehend the importance and need for Electronic Governance, internet service
CO2
providers and their liability. (Cognitive Knowledge Level: Understand)
Use the provision of Cyber law to deal with types of Cyber Crimes, Cybercrime
CO3 Complaints and National cyber security policy. (Cognitive Knowledge Level:
Apply)
Explain the procedure for registration, characteristics, publication, infringement
CO4 and term of copyright and also know the other forms of IPR (Cognitive
Knowledge Level: Understand)
Deduce the legal aspects of Domain name and other cyber related disputes.
CO5
(Cognitive Knowledge Level: Apply)

Mapping of course outcomes with program outcomes

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1

CO2
CO3

CO4

CO5

Abstract POs defined by National Board of Accreditation

PO# Broad PO PO# Broad PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of solutions PO9 Individual and team work

Conduct investigations of complex

PO4 PO10 Communication
problems

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Lifelong learning

Assessment Pattern

Continuous Assessment Tests End Semester

Bloom’s Category Examination
Test1 (%) Test2 (%) Marks (%)
Remember 30 30 30
Understand 30 30 30
Apply 40 40 40

Analyze

Evaluate
Create
Mark Distribution

Total Marks CIE Marks ESE Marks ESE Duration

150 50 100 3 hours

Continuous Internal Evaluation Pattern:

Attendance : 10 marks

Continuous Assessment Tests : 25 marks

Continuous Assessment Assignment : 15 marks

Internal Examination Pattern:

Each of the two internal examinations has to be conducted out of 50 marks. First Internal Examination
shall be preferably conducted after completing the first half of the syllabus and the Second Internal
Examination shall be preferably conducted after completing the remaining part of the syllabus. There
will be two parts: Part A and Part B. Part A contains 5 questions (preferably, 2 questions each from the
completed modules and 1 question from the partly covered module), having 3 marks for each question
adding up to 15 marks for part A. Students should answer all questions from Part A. Part B contains 7
questions (preferably, 3 questions each from the completed modules and 1 question from the partly
covered module), each with 7 marks. Out of the 7 questions in Part B, a student should answer any 5.

End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contain 10 questions with 2 questions from each
module, having 3 marks for each question. Students should answer all questions. Part B contains 2
questions from each module of which a student should answer any one. Each question can have a
maximum 2 subdivisions and carries 14 marks.

Syllabus
Module 1 (Cyber Space)

Fundamental definitions -Interface of Technology and Law – Jurisprudence and-Jurisdiction in Cyber

Space - Indian Context of Jurisdiction - Enforcement agencies – Need for IT act - UNCITRAL – E-
Commerce basics .Information Technology Act, 2000 - Aims and Objects — Overview of the Act –
Jurisdiction

Module 2 (Electronic Governance)

Legal Recognition of Electronic Records and Electronic Evidence -Digital Signature Certificates -
Securing Electronic records and secure digital signatures - Duties of Subscribers - Role of Certifying
Authorities - Regulators under the Act -The Cyber Regulations Appellate Tribunal - Internet Service
Providers and their Liability– Powers of Police under the Act – Impact of the Act on other Laws . Cyber
Crimes -Meaning of Cyber Crimes –Different Kinds of Cyber crimes – Cyber crimes under IPC

Module 3 (Cr.P.C and Indian Evidence Law)

Cybercrimes under the Information Technology Act 2000 - Cyber crimes under International Law –
Hacking, Child Pornography, Cyber Stalking, Denial of service Attack, Virus Dissemination, Software
Piracy, Internet Relay Chat (IRC) Crime, Credit Card Fraud, Net Extortion, Phishing etc - Cyber
Terrorism Violation of Privacy on Internet - Data Protection and Privacy – Indian Court cases

Module 4 (Intellectual Property Rights)

Copyrights- Software – Copyrights vs Patents debate - Authorship and Assignment Issues - Copyright in Internet
- Multimedia and Copyright issues - Software Piracy - Trademarks - Trademarks in Internet – Copyright and
Trademark cases.

Module 5 (Patents and Legal aspects)

Understanding Patents - European Position on Computer related Patents, Legal position on Computer related
Patents - Indian Position on Patents – Case Law, Domain names -registration - Domain Name Disputes-Cyber
Squatting-IPR cases.

Text books

1. Justice Yatindra Singh,” Cyber Laws”, Universal Law Publishing Co., New Delhi, 2020
2. Farouq Ahmed,”Cyber Law in India”, New Era publications, New Delhi,2017
3. S.R.Myneni, “Information Technology Law(Cyber Laws)”, Asia Law House, Hyderabad,3rd
Edition, 2023

References

1. Chris Reed, “Internet Law-Text and Materials”, Cambridge University Press, 2nd Edition,2004
2. Pawan Duggal,” Cyber Law- the Indian perspective”, Universal Law Publishing Co., New
Delhi,2016.

Course Level Assessment Questions

Course Outcome 1 (CO1):

1. What is a cyber space? Explain the interface of technology and law

2. Write down the need for IT act and explain IT act 2000.
Course Outcome 2 (CO2):

1. Define the term cybercrime. List and explain the cybercrimes under IPC.

Course Outcome 3 (CO3):

1. What is cyberstalking? What are its implications and how the case laws are applied?

Course Outcome 4 (CO4):

1. Describe the various types of intellectual property rights and state its objectives
2. Explain authorship and assignment issues.

Course Outcome 5 (CO5):

1. Differentiate between Legal position on Computer related Patents and Indian Position on Patents.
2. How laws are applied on infringement of Domain name disputes?

MODEL QUESTION PAPER

QP CODE: Reg No:______________

Name :______________ PAGES : 3

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

EIGHTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR
Course Code: CCT 416
Course Name: Cyber Law
Max.Marks:100 Duration: 3 Hours
PART A
Answer all Questions. Each question carries 3 Marks
1. Define the terms jurisprudence and jurisdiction in cyber space.
2. What are the aims and objectives of IT Act 2000?
3. Write down the the role of Certifying Authorities in digital signature.
4. Define a cybercrime.
5. Differentiate between software piracy and phishing.
6. What is the role of an ISP?
7. Elucidate trademark in internet with example.
8. How is copyright issues identified and handled ?
 9. Describe European Position on Computer related Patents
10. What is Cybersquatting?
(10*3=30 Marks)

PART B
Answer any Two Question from each module. Each question carries 14 Marks

11(a) Explain the interface of technology and law in the context of cyberspace. (8 marks)
(b) Write down the need of IT Act. (6 marks)
OR
12(a) Explain Jurisdiction in Cyber Space. (8 marks)
(b) Write down the role of enforcement agencies. (6 marks)

13(a) Give a detailed description on Digital Signature Certificate. . (8marks)

(b) Explain the different kinds of cyber crimes with possible scenarios. (6 marks)
OR
14(a) Explain the role of Certifying Authorities. (6marks)
(b) What are the duties performed by the Cyber Regulations Appellate Tribunal? (8 marks)

15(a) What is Denial of service Attack? Give an example (6 marks)

(b) What is Internet Relay Chat (IRC) Crime? How is it identified? (8marks)
OR
16(a) What is cyber terrorism?. (6marks)
(b)Write down the scenarios in which data privacy is violated? (8marks)

17(a)Differentiate between copyright and patents?. (8marks)

(b)Write down the different copyright issues?. (6marks)
OR
18(a)What is a trademark? How is it achieved?. (6marks)
(b)Write down the cases which involve infringement of trademarks. (8 marks)

19(a) What is a Case Law? Explain (6marks)

(b)What are the steps involved in the registration of a Domain Name? (8marks)
OR
20(a)Explain the Legal positions on Computer related Patents. (8marks)
(b)What is IPR? Write down the different IPR cases (6 marks)
 TEACHING PLAN
No.of Lecture
Sl.No Contents Hrs
(36)
Module 1 (Cyber Space) ( 6 hrs)
1.1 Fundamental definitions ,Interface of Technology and Law 1
1.2 Jurisprudence and-Jurisdiction in Cyber Space ,Indian Context of
1
Jurisdiction
1.3 Enforcement agencies 1
1.4 Need for IT act ,UNCITRAL, E-Commerce basics 1
1.5 Information Technology Act, 2000 1
1.6 Aims and Objects — Overview of the Act, Jurisdiction 1
Module 2 (Electronic Governance) ( 8 hrs)
2.1 Legal Recognition of Electronic Records and Electronic Evidence 1
2.2 Digital Signature Certificates - Securing Electronic records and secure
1
digital signatures
2.3 Duties of Subscribers - Role of Certifying Authorities 1
2.4 Regulators under the Act 1
2.5 The Cyber Regulations Appellate Tribunal, Internet Service Providers and
1
their Liability
2.6 Powers of Police under the Act, Impact of the Act on other Laws 1
2.7 Meaning of Cyber Crimes –Different Kinds of Cyber crimes 1
2.8 Cybercrimes under IPC 1
Module 3 (Cr.P.C and Indian Evidence Law) ( 8 hrs)
3.1 Introduction 1
3.2 Cybercrimes under the Information Technology Act 2000 1
3.3 Cyber crimes under International Law 1
3.4 Hacking, Child Pornography, Cyber Stalking, 1
3.5 Denial of service Attack , Virus Dissemination, Software Piracy 1
Internet Relay Chat (IRC) Crime, Credit Card Fraud, Net Extortion,
3.6 Phishing
1

3.7 Cyber Terrorism Violation of Privacy on Internet 1

3.8 Data Protection and Privacy – Indian Court cases 1
Module 4 (Intellectual Property Rights)( 7 hrs)
4.1 Introduction . 1
4.2 Copyrights, Copyrights vs Patents debate 1
4.3 Authorship and Assignment Issues 1
4.4 Copyright in Internet 1
4.5 Multimedia and Copyright issues 1
4.6 Software Piracy - Trademarks 1
4.7 Trademarks in Internet, Copyright and Trademark cases 1
Module 5 (Patents and Legal aspects) (7 hrs)
5.1 Understanding Patents - European Position on Computer related 1
Patents
5.2 Legal position on Computer related Patents 1
5.3 Indian Position on Patents 1
5.4 Case Law, Domain names 1
5.5 Domain name registration, Domain Name Disputes 1
5.6 Cyber Squatting 1
5.7 IPR cases 1
 YEAR OF
BIG DATA CATEGORY L T P CREDIT
CCT 456 INTRODUCTION
SECURITY
PEC 2 1 0 3 2019

Preamble:
The course explores the foundations of big data, including its foundations in computing technology
and statistics. The course also gives an understanding of the nature of underlying technical challenges
and statistical assumptions used to understand relationships in a variety of applied fields, with a focus
on the fields of fraud detection and communication monitoring.

Course Outcomes: After the completion of the course, the student will be able to

CO# Course Outcomes

Explain the basics of Big Data and their challenges. (Cognitive knowledge level:
CO1
Understand)
Explain the difference between predictive analytics and descriptive analytics
CO2
(Cognitive knowledge level: Understand)
Trace out the role played by authentication in security(Cognitive knowledge level:
CO3
Apply)

CO4 Describe the security concerns of big-data. (Cognitive knowledge level: Understand)

CO5 Escalate the applications of security analytics. (Cognitive knowledge level: Apply)

Mapping of course outcomes with program outcomes

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 P10 P11 P12

CO1

CO2

CO3
 CO4

CO5

Abstract POs defined by National Board of Accreditation

PO# Broad PO PO# Broad PO
PO1 Engineering Knowledge PO7 Environment and Sustainability
PO2 Problem Analysis PO8 Ethics
PO3 Design/Development of solutions PO9 Individual and teamwork
PO4 Conduct investigations of complex PO10 Communication
problems
PO5 Modern tool usage PO11 Project Management and Finance
PO6 The Engineer and Society PO12 Lifelong learning

Assessment Pattern

End Semester
Test 1 (Marks in Test 2 (Marks in
Bloom’s Category Examination (Marks
percentage) percentage)
in percentage)
Remember 30 30 30
Understand 30 30 30
Apply 40 40 40
Analyze
Evaluate
Create

Mark Distribution

Total Marks CIE Marks ESE Marks ESE Duration

150 50 100 3
Continuous Internal Evaluation Pattern:
Attendance : 10 marks
Continuous Assessment Test : 25 marks
Continuous Assessment Assignment : 15 marks

Internal Examination Pattern: Each of the two internal examinations has to be conducted out of 50
marks. The first series test shall be preferably conducted after completing the first half of the
syllabus. The second series test shall be preferably conducted after completing the remaining part of
the syllabus. There will be two parts: Part A and Part B. Part A contains 5 questions (preferably, 2
questions each from the completed modules and 1 question from the partly completed module),
having 3 marks for each question adding up to 15 marks for part A. Students should answer all
questions from Part A. Part B contains 7 questions (preferably, 3 questions each from the completed
modules and 1 question from the partly completed module), each with 7 marks. Out of the 7
questions, a student should answer any 5.

End Semester Examination Pattern: There will be two parts; Part A and Part B. Part A contains 10
questions with 2 questions from each module, having 3 marks for each question. Students should
answer all questions. Part B contains 2 questions from each module of which a student should answer
anyone. Each question can have a maximum 2 subdivisions and carries 14 marks.

Syllabus

Module 1 (Introduction to Big Data)

Introduction to Big Data, Evolution of Big data, Characteristics. Big Data Analytics, Big Data
framework - fundamental concepts of Big Data management and analytics - Current challenges and
trends in Big Data Acquisition.

Module 2 (Data Analytics)

Predictive Analytics: Regression, Decision Tree, Neural Networks - Descriptive Analytics:

Association Rules, Sequence Rules, Survival Analysis: Survival Analysis Measurements, Kaplan
Meir Analysis, Parametric Survival Analysis - Social Network Analytics: Social Network Learning
Relational Neighbor Classification

Module 3 (Introduction to Security Analytics)

Introduction to Security Analytics – Techniques in Analytics – Analysis in everyday life – Challenges

in Intrusion and Incident Identification – Simulation and Security Process, Analytical Software’s and
tools, Malware Analysis – static and dynamic analysis - Security Intelligence – Security Breaches
Module 4(Applications of Security Analytics)

Access Analytics – Analysis of Log file -Security analysis with text mining –Machine Learning and
data mining applications for security: Intrusion detection and network anomaly detection. Big data
analytics for security: Analyzing DDOS – Distributed Denial of Service attack: counter based
method, and access pattern based method – Machine learning for Ransomware detection and
prevention.

Module 5 (Big Data Privacy and Applications)

Data Masking – Privately Identified Information (PII) -Privacy preservation in Big Data- Popular Big
Data Techniques and tools- Map Reduce paradigm and the Hadoop system – Applications- Social
Media Analytics- Recommender Systems- Fraud Detection.

Text Books

1. Bart Baesens, "Analytics in a Big Data World: The Essential Guide to Data Science and its
Applications", John Wiley & Sons, 2014
2. Min Chen, Shiwen Mao, Yin Zhang, Victor CM Leung, “Big Data: Related Technologies,
Challenges and Future Prospects” , Springer, 2014.
3. Michael Minelli, Michele Chambers, AmbigaDhiraj ,“Big Data, Big Analytics: Emerging
Business Intelligence and Analytic Trends”, John Wiley & Sons, 2013.

References

1. Raj, Pethuru, “Handbook of Research on Cloud Infrastructures for Big Data Analytics”, IGI
Global.
2. Douglas R. Stinson ,“Cryptography Theory and Practice ”, Chapman & Hall/CRC, 3rd Edition,
2006.
3. Mark Talabis, Robert McPherson, I Miyamoto and Jason Martin, “Information Security
Analytics: Finding Security Insights, Patterns, and Anomalies in Big Data”, Syngress Media,
U.S., 2014.
Sample Course Level Assessment Questions

Course Outcome 1 (CO1):

1. Explain the Evolution of Big Data and their characteristics

2. Describe any five characteristics of Big Data.

Course Outcome 2 (CO2):

1. Describe the prediction error and regression techniques

2. Explain the three categories of Prediction methodologies.

Course Outcome 3 (CO3):
1. Identify the various challenges in Intrusion and Incident Identification.

Course Outcome 4 (CO4):

1. How machine learning helps in Ransom ware detection and prevention.

Course Outcome 5 (CO5):

1. What is Privacy preservation? Discuss its importance in Big Data.

Model Question Paper

QP CODE:
Reg No:______________
Name :______________ PAGES : 3

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

EIGTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR

Course Code: CCT 456

Course Name: BIG DATA SECURITY

Max.Marks:100 Duration: 3 Hours

PART A

Answer all Questions. Each question carries 3 Marks

1. Explain the Evolution of Big Data.

2. Describe any five characteristics of Big Data
3. How decision trees aid in big data analytics.

4. What is regression analysis? How is it done?

5. Why data Analytics is needed?

6. How is security analytics done?

7. Explain DDOS attack.

8. How does analysis of log files assist in security analytics?

9. Define Data masking.

10. How map reduce is performed in hadoop?

PART B

Answer any one Question from each module.

Each question carries 14 Marks

11. a) Illustrate the various phases involved in Big Data Analytics with a neat diagram. (7)
b) Explain the trends in big data acquisition. (7)
OR
12. a) Describe the challenges in big data acquisition (7)

b) Explain Big data framework. (7)

13. a) Illustrate Kaplan Meir Analysis with an example (8)
b) Describe Social network Analytics (6)
OR
14. a) Compare predictive and descriptive analysis. (7)
b) Describe Parametric Survival Analysis. (7)

15. a) Compare and contrast static and dynamic malware analysis. (7)
b) Describe the various security breaches possibilities in big data scenarios. (7)
OR

16. a) Summarize various challenges in Intrusion and Incident Identification. (8)

b) Briefly explain various methods used in security analytics. (6)
17. a) Differentiate between counter based method and access pattern based method. (8)
 b) Describe how network anomaly detection is done (6)

OR

18. a) How machine learning helps in Ransomware detection and prevention. (8)

b) Explain the scope of Security analysis with text mining. (6)

19. a)Describe Popular Big Data Techniques and tools. (8)

b) Explain the significance of Privately Identified Information. (6)

OR
20.a) How is Privacy preservation in Big Data achieved (8)
b) Describe the role of Recommender Systems (6)

TEACHING PLAN

No of
Sl.No. Contents Lecture Hrs
(35)

Module 1 (Introduction to Big Data) (6 hrs)

1.1 Introduction to Big Data 1 hour

1.2 Evolution of Big data, Characteristics 1 hour

1.3 Big Data Analytics, Big Data framework 1 hour

1.4 Fundamental concepts of Big Data management and analytics 1 hour

1.5 Current challenges in Big Data Acquisition 1 hour

1.6 Trends in Big Data Acquisition 1 hour

Module 2 (Data Analytics) (8 hrs)

2.1 Predictive Analytics: Regression, Decision Tree 1 hour

2.2 Neural Networks 1 hour

2.3 Descriptive Analytics: Association Rules, Sequence Rules. 1 hour

2.4 Survival Analysis: Survival Analysis Measurements 1 hour

2.5 Kaplan Meir Analysis 1 hour

2.6 Parametric Survival Analysis 1 hour

2.7 Social Network Analytics 1 hour

2.8 Social Network Learning Relational Neighbor Classification 1 hour

Module 3 (Introduction to Security Analytics) (8 hrs)

3.1 Introduction to Security Analytics 1 hour

3.2 Techniques in Analytics – Analysis in everyday life 1 hour

3.3 Challenges in Intrusion and Incident Identification 1 hour

3.4 Simulation and Security Process 1 hour

Analytical Softwares and tools

3.5 1 hour

3.6 Malware Analysis 1 hour

3.7 Static and dynamic analysis 1 hour

3.8 Security Intelligence – Security Breaches 1 hour

Module 4(Applications of Security Analytics) (7 hrs)

4.1 Access Analytics – Analysis of Log file 1 hour

4.2 Security analysis with text mining. 1 hour

4.3 Machine Learning and data mining applications for security: 1 hour

4.4 Intrusion detection and network anomaly detection. 1 hour

4.5 Big data analytics for security: Analyzing DDOS – 1 hour

Distributed Denial of Service attack: counter based method, and

4.6 1 hour
access pattern based method

4.7 Machine learning for Ransom ware detection and prevention. 1 hour

Module 5 (Big Data Privacy and Applications) (6 hrs)

5.1 Data Masking – Privately Identified Information (PII). 1 hour

5.2 Privacy preservation in Big Data. 1 hour

5.3 Popular Big Data Techniques and tools- Map Reduce paradigm 1 hour

5.4 Hadoop system. 1 hour

5.5 Applications- Social Media Analytics 1 hour

5.6 Recommender Systems- Fraud Detection. 1 hour

 COMPUTER SCIENCE AND ENGINEERING

YEAR OF
CLIENT SERVER CATEGORY L T P CREDIT INTRODUCTION
CST426
ARCHITECTURE
PEC 2 1 0 3 2019

Preamble: The syllabus is prepared with the view of preparing the Engineering Graduates to
build effective Client/Server applications. This course aims at providing a foundation in
decentralized computer systems, using the client/server model. The course content is decided to
cover the essential fundamentals which can be taught within the given slots in the curriculum.

Prerequisite: Computer Networks

Course Outcomes: After the completion of the course the student will be able to

Explain the basics of client/server systems and the driving force behind the
development of client/server systems (Cognitive Knowledge Level:
CO 1 Understand)
Outline the architecture and classifications of client/server systems (Cognitive
CO 2 Knowledge Level: Understand)
Choose the appropriate client/server network services for a typical application
CO 3 (Cognitive Knowledge Level: Understand)
Describe management services and issues in network (Cognitive Knowledge
CO 4 Level: Understand)
Compare and summarize the web extensions and choose appropriate web services
CO 5
standards for an application (Cognitive Knowledge Level: Understand)

Mapping of course outcomes with program outcomes

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1

CO2

CO3

CO4

CO5
 COMPUTER SCIENCE AND ENGINEERING

Abstract POs defined by National Board of

Accreditation

PO# Broad PO PO# Broad PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of solutions PO9 Individual and team work

Conduct investigations of
PO4 complex problems PO10 Communication

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Life long learning

Assessment Pattern

Continuous Assessment Tests End Semester

Bloom’s Category Examination Marks
Test 1 (Marks) Test 2 (Marks)

Remember 30 30 30
Understand 70 70 50
Apply
Analyse

Evaluate

Create

Mark distribution

Total CIE ESE ESE

Marks Duration
Marks Marks
150 50 100 3 hours

Continuous Internal Evaluation Pattern:

Attendance : 10 marks
Continuous Assessment Test 1 (for theory, for 2 hrs) : 20 marks
Continuous Assessment Test 2 (for lab, internal examination, for 2hrs) : 20 marks
 COMPUTER SCIENCE AND ENGINEERING
Internal Examination Pattern: There will be two parts; Part A and Part B. Part A
contains 5 questions with 2 questions from each module (2.5 modules x 2 = 5), having 3
marks for each question. Students should answer all questions. Part B also contains 5
questions with 2 questions from each module (2.5 modules x 2 = 5), of which a student
should answer any one. The questions should not have sub- divisions and each one carries
7 marks.

End Semester Examination Pattern: There will be two parts; Part A and Part B. Part A
contain 10 questions with 2 questions from each module, having 3 marks for each
question. Students should answer all questions. Part B contains 2 questions from each
module of which a student should answer any one. Each question can have maximum 2
sub-divisions and carry 14 marks.

Sample Course Level Assessment Questions

Course Outcome 1 (CO1):

1. Explain the driving forces behind the development of Client/ Server system from
different perspectives.

Course Outcome 2 (CO2):

1. How two-tier computing and three-tier computing improves the performance of
Client/Server system.

Course Outcome 3(CO3):

1. Explain the role of client in Client/Server computing and also explain the various
services provided by client.
2. What is the primary motivation behind the RPC facility ? How does a RC facility
makes the job of distributed application programmers simpler?
3. Implement RPC concept using suitable language/tool(Assignment)

Course Outcome 4 (CO4):

1. Explain Connectivity and Communication Interface Technology in Client/Server
application. How does transmission protocol work in Client/Server application?

Course Outcome 5 (CO5):

1.Discuss the role of web browser for providing web service in Client/Server
environment.
2. Identify and explain the social relevance of web services (Assignment)
 COMPUTER SCIENCE AND ENGINEERING
Syllabus
Module – 1 (Introduction)

Introduction to Client/Server computing - Driving forces behind Client/ Server, Client/

Server development tools, Development of client/server systems, Client/Server security,
Organizational Expectations, Improving performance of client/server applications, Single
system image, Downsizing and Rightsizing, Advantages of client server computing,
Applications of Client/Server.

Module -2 (Client/Server Application Components)

Classification of Client/Server Systems- Two-Tier Computing, Middleware, Three-Tier

Computing- Model View Controller (MVC), Principles behind Client/Server Systems.
Client/Server Topologies. Existing Client/Server Architecture. Architecture for Business
Information System.

Module -3 (Client/Server Network)

Client- Services, Request for services, RPC, Windows services, Print services, Remote
boot services, other remote services, Utility Services. Dynamic Data Exchange (DDE).
Object Linking and Embedding (OLE). Common Object Request Broker Architecture
(CORBA).

Server- Detailed server functionality, Network operating system, Available platforms,

Server operating system.

Module -4 (Client/ Server Systems Development)

Services and Support- System administration, Availability, Reliability, Scalability,

Observability, Agility, Serviceability. Software Distribution, Performance, Network
management. Remote Systems Management- RDP, Telnet, SSH, Security. LAN and
Network Management issues, Training, Connectivity, Communication interface
technology, Interprocess communication, Wide area network technologies, Network
Acquisition, PC-level processing unit, X-terminals, Server hardware.

Module -5 (Client/Server Technology and Web Services)

Web Services History. Web Server Technology- Web Server, Web Server Communication,
Role of Java for Client/Server on Web. Web Services- MicroServices, APIs, API
Gateway, Authentication of users/clients, Tokens/Keys for Authentication, Service Mesh,
Message Queues, SaaS, Web Sockets.
Client/Server/Browser – Server Technology, Client/Server Technology and Web
Applications, Balanced Computing and the Server’s Changing Role. Thin client computing
- Computing models-Comparison-Computing Environment.
Future of client/ server Computing Enabling Technologies, Transformational system.
 COMPUTER SCIENCE AND ENGINEERING

Text Books

1. Patrick Smith & Steave Guengerich, “Client / Server Computing”, PHI

2. Dawna Travis Dewire, “Client/Server Computing”, TMH

Reference Books

1. Jeffrey D.Schank, “Novell’s Guide to Client-Server Application & Architecture” Novell

Press
2. Robert Orfali, Dan Harkey, Jeri Edwards, Client/Server Survival Guide, Wiley-
India Edition, Third Edition
3. W. H. Inman, Developing Client Server Applications, BPB

Model Question Paper

QP CODE:

Reg No: _______________

Name: _________________ PAGES : 4

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

EIGHTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR

Course Code: CST426

Course Name : Client Server Architecture

Max. Marks : 100 Duration: 3 Hours

PART A

Answer All Questions. Each Question Carries 3 Marks

1. How client/server computing environment is different from mainframe based

computing environment?

2. Write short notes on single system image and downsizing.

3. Discuss the topologies of Clients/Server system with suitable examples.

4. Discuss the relevance of Clients/Server system in adopting open system standards.

Justify your answer.
 COMPUTER SCIENCE AND ENGINEERING

5. Enumerate the services provided in a client/server system.

6. List out the features of network operating system.

7. How interposes communication is established?.

8. Write short note on x-terminals.

9. Explain the history of web services.

10. With an example, explain the role of java for client/server on web (10x3=30)

Part B
(Answer any one question from each module. Each question carries 14 Marks)

11. (a) Explain the driving forces behind the development of Client/ Server system (10)
from different perspectives.

(b) Explain the various Clients/Server system development tools. (4)

OR

12. (a) Explain Client/Server System development methodology and explain various (10)
phases and their activities involved in System Integration Life Cycle.

(b) Write short notes on the following. (a) Single system image. (b) Downsizing (4)
and Client/Server computing.

13. (a) How two-tier computing and three-tier computing improves the performance (10)
of Client/Server system.

(b) List out the principles behind client/server systems . (4)

OR

14. (a) Explain the architecture of Business Information System. (10)

(b) Explain different ways to improve performance in Client/Server developed (4)

applications.

15. (a) In Client/Server computing, explain the following with example in detail (a) (10)
Dynamic Data Exchange (b) RPC (c) Remote Boot Service (d) Object-
linking and embedding.
 COMPUTER SCIENCE AND ENGINEERING

(b) Explain the role of client in Client/Server computing and also explain the (4)
various services provide by client.

OR

16. (a) Explain the architecture of CORBA. (10)

(b) Explain the server functionality in detail, for Client/Server computing. (4)

17. (a) Explain Connectivity and Communication Interface Technology in (10)

Client/Server application. How does transmission protocol work in
Client/Server application?

(b) Comment on the network service acquisition mechanism for the client/service (4)
model.

OR

18. (a) In client server architecture, what do you mean by Availability, Reliability, (10)
Serviceability and Security? Explain with examples

(b) How remote systems management security is ensured in a Client/Server (4)

application.

19. (a) What is the future of Client/Server computing in the following technologies (10)
(i) Electronic Document Management. (ii) Full Text Retrieval. (iii)
Geographic Information System.

(b) Discuss the role of web browser for providing web service in Client/Server (4)
environment.

OR

20. (a) Explain end-to-end working of Client/Server web model. (10)

(b) Explain the architecture of Transformational system. (4 )

 COMPUTER SCIENCE AND ENGINEERING
Teaching Plan

Sl Contents No. of
No Lecture
Hours (35)
Module- 1( Introduction) (7 hours)

Driving forces behind Client/ Server

1.1 1 hour
1.2 Client Server development tools 1 hour
1.3 Development of client/server systems
1 hour
1.4 Client/Server security, Organizational Expectations 1 hour

1.5 Improving performance of client/server applications 1 hour

1.6 Single system image, Downsizing and Rightsizing 1 hour
1.7 Advantages and Applications of client server computing 1 hour

Module- 2(Client/Server Application Components) (8 hours)

2.1 Classification of Client/Server Systems

1 hour
2.2 Open System Standards 1 hour

2.3 Two-Tier Computing 1 hour

2.4 Three-Tier Computing, Middleware 1 hour
2.5 Principles behind Client/Server Systems 1 hour

2.6 Client/Server Topologies 1 hour

2.7 Existing Client/Server Architecture 1 hour

2.8 Architecture for Business Information System 1 hour

Module- 3(Client/Server Network) (6 hours)

3.1 The client: Services, Request for services, RPC, Windows services, Print 1 hour
services

3.2 Remote boot services, Utility Services & Other Services 1 hour

3.3 Dynamic Data Exchange (DDE), Object Linking and Embedding (OLE) 1 hour
3.4 Common Object Request Broker Architecture (CORBA) 1 hour
 COMPUTER SCIENCE AND ENGINEERING
3.5 The server: Detailed server functionality, the network operating system 1 hour

3.6 Available platforms, the server operating system 1 hour

Module- 4( Client Server Systems Development) (7 hours)

4.1 Services and Support, System administration 1 hour

4.2 Availability, Reliability, Scalability, Observability, Agility Serviceability, 1 hour

Software Distribution, Performance

4.3 Network management, Remote Systems Management, RDP,Telnet,SSH 1 hour

4.4 Security ,LAN and Network Management issues 1 hour
4.4 Training, Connectivity, Communication interface technology 1 hour

4.5 Interposes communication, wide area network technologies 1 hour

4.6 Network Acquisition, PC-level processing unit, x-terminals, server 1 hour

Hardware

Module -5(Client/Server Technology And Web Services) (7 hours)

5.1 Web Services History , Web Server Technology , Web Server 1 hour

5.2 Web Server Communication , Role of Java for Client/Server on Web 1 hour
5.3 Web Services , MicroServices, APIs, API Gateway, Authentication of 1 hour
users/clients
5.4 Tokens/Keys for Authentication ,Service Mesh, Message Queues 1 hour

5.5 SaaS, Web Sockets ,Client/Server Technology and Web Applications

1 hour
5.6 Balanced Computing and the Server’s Changing Role ,Thin client computing , 1 hour
Computing models, Computing Environment

5.7 Future of client/ server Computing Enabling Technologies, Transformational

system 1 hour
 COMPUTER SCIENCE AND ENGINEERING

YEAR OF
PARALLEL CATEGORY L T P CREDIT INTRODUCTION
CST436
COMPUTING
PEC 2 1 0 3 2019

Preamble: This course helps the learners to understand basic and advanced concepts of parallel
computing. It covers Principles of Parallel Algorithm Design, Communication operations,
Programming Using the Message Passing Paradigm, Programming Shared Address Space
Platforms Thread Basics, and GPU Programming. This course enables a learner to design
solutions to complex real world problems using parallel computing paradigms including thread
parallelism, shared memory program, message passing interfaces, and vector processing.

Prerequisite: Knowledge in Computer Organization and Architecture.

Course Outcomes: After the completion of the course the students will be able to

Summarize the key parallel computational models (Cognitive Knowledge Level :

CO1
Understand)
Appreciate and apply parallel and distributed algorithms in problem Solving (Cognitive
CO2
Knowledge Level :Apply)
Appreciate the communication models for parallel algorithm development (Cognitive
CO3
Knowledge Level : Understand)
Develop parallel algorithms using message passing paradigm (Cognitive Knowledge
CO4
Level : Apply)
Formulate parallel algorithms for shared memory architectures. (Cognitive
CO5
Knowledge Level : Apply)
Demonstrate the fundamental skills of heterogeneous computing with GPUs(Cognitive
CO6
Knowledge Level : Apply)

Mapping of course outcomes with program outcomes

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1

CO2

CO3

CO4
 COMPUTER SCIENCE AND ENGINEERING

CO5

CO6

Abstract POs Defined by National Board of Accreditation

PO# Broad PO PO# Broad PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of solutions PO9 Individual and teamwork

Conduct investigations of
PO4 PO10 Communication
complex problems

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Lifelong learning

Assessment Pattern

Blooms Category Continuous Assessment Tests End Semester

Examination Marks

Test 1 (Percentage) Test 2 (Percentage)

Remember 30 20 20

Understand 50 40 40

Apply 20 40 40
 COMPUTER SCIENCE AND ENGINEERING

Analyze

Evaluate

Create

Mark Distribution

Total Marks CIE Marks ESE Marks ESE Duration

150 50 100 3 Hours

Continuous Internal Evaluation Pattern:

Attendance 10 marks
Continuous Assessment Tests 25 marks
Continuous Assessment Assignment 15 marks

Internal Examination Pattern:

Each of the two internal examinations has to be conducted out of 50 marks. First Internal
Examination shall be preferably conducted after completing the first half of the syllabus, and the
Second Internal Examination shall be preferably conducted after completing the remaining part of
the syllabus. There will be two parts: Part A and Part B. Part A contains 5 questions (preferably, 2
questions each from the completed modules and 1 question from the partly covered module),
having 3 marks for each question adding up to 15 marks for part A. Students should answer all
questions from Part A. Part B contains 7 questions (preferably, 3 questions each from the
completed modules and 1 question from the partly covered module), each with 7 marks. Out of
the 7 questions in Part B, a student should answer any 5.

End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions from
each module, having 3 marks for each question. Students should answer all questions. Part B
contains 2 questions from each module of which a student should answer anyone. Each question
can have a maximum 2 subdivisions and carries 14 marks.
 COMPUTER SCIENCE AND ENGINEERING

Syllabus
Module- 1 (Principles of Parallel Algorithm Design)

Basic Introduction to Parallel Processing platforms. Preliminaries, Decomposition Techniques,

Characteristics of Tasks and Interactions, Mapping Techniques for Load Balancing, Methods for
Containing Interaction Overheads, Parallel Algorithm Models.

Module- 2 (Communication Operations)

Basic Communication Operations - One-to-All Broadcast and All-to-One Reduction, All-to-All

Broadcast and Reduction, All-Reduce and Prefix-Sum Operations, Scatter and Gather, All-to-All
Personalized Communication, Circular Shift, Improving the Speed of Some Communication
Operation

Module-3 (Programming Using the Message Passing Paradigm)

Principles of Message-Passing Programming, The Building Blocks: Send and Receive

Operations, MPI: The Message Passing Interface, Overlapping Communication with
Computation, Collective Communication and Computation Operations, Groups and
Communicators.

Module 4 (Programming Shared Address Space Platforms Thread Basics)

Thread Basics, Why Threads? The POSIX Thread Application Programme Interface,
Synchronization Primitives in POSIX, Controlling Thread and Synchronization Attributes,
Thread Cancellation, Composite Synchronization Constructs, OpenMP: a Standard for Directive
Based Parallel Programming, Specifying Concurrent Tasks in OpenMP, Synchronization
Constructs in OpenMP, Data Handling in OpenMP, OpenMP Library Functions, OpenMP
Applications: Parallel algorithm development for Matrix multiplication

Module 5 (GPU Programming)

Heterogeneous Parallel Computing, Architecture of a Modern GPU, Speeding up Real
Applications, Data parallel computing, CUDA C Program Structure, A Vector Addition Kernel,
Device Global Memory and Data Transfer, Kernel Functions and Threading, Kernel Launch,
CUDA Thread Organization, Mapping Threads to Multidimensional Data, Synchronization and
Transparent Scalability, Resource Assignment, Querying Device Properties, Thread Scheduling
and Latency Tolerance, Importance of Memory Access Efficiency, Cuda Memory Types, Tiling
for Reduced Memory Traffic, Tiled Matrix Multiplication Kernel, Boundary Checks
 COMPUTER SCIENCE AND ENGINEERING

Text Books
1. Ananth Grama, Anshul Gupta, George Karypis, Vipin Kumar, Introduction to Parallel
Computing, 2nd Ed, Addison-Wesley, 2003
2. David B. Kirk, Wen-mei W. Hwu, Programming Massively Parallel Processors: A
Hands-on Approach, 3rd Ed., Morgan Kaufman, 2016.
References

1. Steven Brawer, Introduction to Parallel Computing, Academic Press, (1989)

2. Barbara Chapman, Gabriele Jost, Ruud van der Pas, Using OpenMP: Portable Shared
Memory Paralwlel Programming , MIT Press, 2008.

3. William Gropp, Ewing Lusk, Anthony Skjellum Using MPI: Portable Parallel
Programming with the Message-Passing Interface, 3rd Ed, MIT Press, 2014.

4. Thomas Rauber, Gudula Rünger, Parallel Programming for Multicore and Cluster
Systems, Springer, 2010

Sample Course Level Assessment Questions

Course Outcome 1 (CO1):
1. Differentiate between static and dynamic task mapping
2. Explain partitioning of data with an example
Course Outcome 2 (CO2):
1. Explain the handshaking sequence of Blocking Non-Buffered Send/Receive operation
with a neat diagram.
2. In the algorithm, assume a decomposition such that each execution of Line 7 is a task.
Draw a task-dependency graph and a task-interaction graph.
1. procedure FFT_like_pattern(A, n)
2. begin
3. m := log2 n;
4. for j := 0 to m - 1 do
5. k := 2j;
6. for i := 0 to n - 1 do
7. A[i] := A[i] + A[i XOR 2j];
8. end // for
9. end // FFT_like_pattern
 COMPUTER SCIENCE AND ENGINEERING

Course Outcome 3 (CO3):

1. Write a procedure for performing all-to-all reduction on a mesh
2. Give a hypercube algorithm to compute prefix sums of n numbers if p is the number of
nodes and n/p is an integer greater than 1. Assuming that it takes time tadd to add two
numbers and time ts to send a message of unit length between two directly-connected
nodes, give an exact expression for the total time taken by the algorithm.
Course Outcome 4(CO4):
1. Show how the two-dimensional matrix-vector multiplication program needs to be changed
so that it will work correctly for a matrix of size n x m on a q x r process grid
2. One of the advantages of non-blocking communication operations is that they allow the
transmission of the data to be done concurrently with computations. Discuss the type of
restructuring that needs to be performed on a program to allow for the maximal overlap of
computation with communication. Is the sending process in a better position to benefit
from this overlap than the receiving process
Course Outcome 5(CO5):
1. Implement a multi-access threaded queue with multiple threads inserting and multiple
threads extracting from the queue. Use mutex-locks to synchronize access to the queue.
Document the time for 1000 insertions and 1000 extractions each by 64 insertion threads
(producers) and 64 extraction threads (consumers).
2. Implement a producer-consumer framework in OpenMP using sections to create a single
producer task and a single consumer task. Ensure appropriate synchronization using locks.
Course Outcome 6 (CO6):
1. Consider a hypothetical block with 8 threads executing a section of code before reaching a
barrier. The threads require the following amount of time (in microseconds) to execute the
sections: 2.0, 2.3, 3.0, 2.8, 2.4, 1.9, 2.6, and 2.9 and to spend the rest of their time waiting
for the barrier. What percentage of the total execution time of the thread is spent waiting
for the barrier?
2. Write and explain the CUDA program for vector addition.
 COMPUTER SCIENCE AND ENGINEERING

Model Question Paper

QP CODE: PAGES :3
Reg No: _______________
Name: _________________
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
EIGHTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR
Course Code: CST436
Course Name: PARALLEL COMPUTING
Max.Marks:100 Duration: 3 Hours
PART A
Answer All Questions. Each Question Carries 3 Marks

1. Explain partitioning of data with an example

2. Which are the characteristics of tasks influencing the selection of mapping scheme?

3. Describe the scatter - gather communication.

4. Explain the Circular Shift operation.

5. Explain the handshaking sequence of Blocking Non-Buffered Send/Receive

operation with a neat diagram.

6. Describe the six fundamental routines of MPI.

7. Explain thread cancellation.

8. Explain how concurrent tasks are specified in openMP

9. Explain the architecture of modern GPU with a diagram.

10. Describe how the data transfer between GPU device and the host memories are (10x3=30)
managed.

Part B
(Answer any one question from each module. Each question carries 14 Marks)

11. (a)
Describe recursive decomposition with an example.
(8)
 COMPUTER SCIENCE AND ENGINEERING

(b)
Compare various parallel algorithm models
(6)

OR

12. (a) (8)

Differentiate between static and dynamic task mapping

(b) In the algorithm, assume a decomposition such that each execution of Line 7 is (6)
a task. Draw a task-dependency graph and a task-interaction graph.
1. procedure FFT_like_pattern(A, n)
2. begin
3. m := log2 n;
4. for j := 0 to m - 1 do
5. k := 2j;
6. for i := 0 to n - 1 do
7. A[i] := A[i] + A[i XOR 2j];
8. end // for
9. end // FFT_like_pattern

13. (a)
Illustrate the All-to-All Broadcast and Reduction with an example
(8)

(b) (6)
Explain any three techniques to improve the speed of communication
operations

OR

14. (a) (8)

Explain the One-to-All Broadcast and All-to-One Reduction with an example

(b) Explain the Ring and Mesh techniques of All-to-All Personalized (6)
communication.

15. (a) Explain Collective Communication and Computation Operations in MPI (9)

(b) Show the impact of finite buffers in message passing. (5)

OR

16. (a) Write algorithm for Collective Communication and Computation Operations
(9)
 COMPUTER SCIENCE AND ENGINEERING

using MPI.

(b) How is deadlock avoided in MPI_Send and MPI_Recv (5)

17. (a) Explain how mutual exclusion for shared variables are accomplished in (6)
threads.

(b) Explain the nesting of parallel directives with a suitable example. (8)

OR

18. (a) Explain the compilation operations of an example openMP program along (4)
with its pThread translations.

(b) Explain the parallel matrix multiplication using openMP (10)

19. (a) (6)

Describe the CUDA Kernel functions.

(b) (8)
How is synchronization between CUDA threads achieved?

OR

20. (a) (10)

Explain the two-level hierarchical organization of CUDA threads.

(b) Write and explain the CUDA program for vector addition. (4 )
 COMPUTER SCIENCE AND ENGINEERING

TEACHING PLAN

No Contents No of
Lecture
Hrs (37)

Module – 1 (Basic Introduction to Parallel Processing ) (TB-1, Ch. 3) (7 hrs)

1.1 Basic Introduction to Parallel Processing platforms. Preliminaries 1

1.2 Decomposition Techniques – Recursive, Data 1

1.3 Decomposition Techniques – Exploratory, Speculative, Hybrid 1

1.4 Characteristics of Tasks and Interactions 1

1.5 Mapping Techniques for Load Balancing -Static 1

1.6 Mapping Techniques for Load Balancing - Dynamic 1

1.7 Methods for Containing Interaction Overheads, Parallel Algorithm Models. 1

Module- 2 (Basic Communication Operations ) (TB-1, Ch. 4) (6hrs)

2.1 One-to-All Broadcast and All-to-One Reduction 1

2.2 All-to-All Broadcast and Reduction 1

2.3 All-Reduce and Prefix-Sum Operations, Scallter Gather 1

2.4 All-to-All Personalized Communication 1

2.5 Circular Shift 1

2.6 Improving the Speed of Some Communication Operation 1

Module- 3 ( Programming Using the Message Passing Paradigm) (TB-1, Ch. 6 ) (7 hrs)

Principles of Message-Passing Programming, The Building Blocks: Send and

3.1 1
Receive Operations

3.2 MPI: The Message Passing Interface 1

3.3 MPI: The Message Passing Interface : Illustration 1

 COMPUTER SCIENCE AND ENGINEERING

3.4 Overlapping Communication with Computation 1

3.5 Overlapping Communication with Computation : Illustration 1

3.6 Collective Communication and Computation Operations 1

3.7 Collective Communication and Computation Operations : Illustration 1

Module 4 (Programming Shared Address Space Platforms) (TB-1, Ch. 7, 8 ) (8hrs)

4.1 Thread Basics, Why Threads? The POSIX Thread API 1

4.2 Synchronization Primitives in POSIX 1

4.3 Controlling Thread and Synchronization Attributes 1

4.4 Thread Cancellation, Composite Synchronization Constructs, 1

4.5 OpenMP: a Standard for Directive Based Parallel 1

Programming

4.6 Specifying Concurrent Tasks in OpenMP, Synchronization Constructs in 1

OpenMP

4.7 Data Handling in OpenMP, OpenMP Library Functions 1

4.8 OpenMP Applications: Parallel algorithm development for Matrix 1

multiplication

Module 5 (GPU Programming) (TB-2, Ch. 1, 2 ) (9 hrs)

5.1 Heterogeneous Parallel Computing, Architecture of a Modern GPU, Speeding 1

up Real Applications

5.2 Data parallel computing – CUDA C Program Structure 1

5.3 Vector Addition Kernel, Device Global Memory and Data Transfer 1

5.4 Kernel Functions and Threading, Kernel Launch 1

 COMPUTER SCIENCE AND ENGINEERING

5.5 CUDA Thread Organization, Mapping Threads to Multidimensional Data 1

5.6 Synchronization and Transparent Scalability, Resource Assignment, 1

Querying Device Properties, Thread Scheduling and Latency Tolerance

5.7 Importance of Memory Access Efficiency, Cuda Memory Types 1

5.8 Tiling for Reduced Memory Traffic 1

5.9 Tiled Matrix Multiplication Kernel, Boundary Checks 1

 COMPUTER SCIENCE AND ENGINEERING

YEAR OF
DATA COMPRESSION CATEGORY L T P CREDIT INTRODUCTION
CST446
TECHNIQUES
PEC 2 1 0 3 2019

Preamble: This course helps the learners to understand compression techniques on text, image,
audio and video data. It covers lossy &lossless compression, RLE, JPEG, MPEG and its variants.
This course enables the students to develop and implement compression algorithms on different
domains.

Prerequisite: Knowledge of probability theory, computation on matrices, basic topics in data

structures, storage and efficiency
Course Outcomes: After the completion of the course the student will be able to

CO# CO
Describe the fundamental principles of data compression(Cognitive Knowledge
CO1 level: Understand)

Make use of statistical and dictionary based compression techniques for various
CO2 applications (Cognitive Knowledge level: Apply)

Illustrate various image compression standards. (Cognitive Knowledge level:

CO3 Apply)

Summarize video compression mechanisms to reduce the redundancy in

CO4 video.(Cognitive Knowledge level: Understand)

Use the fundamental properties of digital audio to compress audio

CO5 data.(Cognitive Knowledge level: Understand)

Mapping of course outcomes with program outcomes

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1
CO2

CO3
CO4

CO5
 COMPUTER SCIENCE AND ENGINEERING

Abstract POs defined by National Board of Accreditation

PO# Broad PO PO# Broad PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of solutions PO9 Individual and team work
Conduct investigations of complex
PO4 problems PO10 Communication

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Life long learning

Assessment Pattern
Continuous Assessment Tests
Bloom’s End Semester Examination
Category Marks (%)
Test 1 (%) Test 2 (%)
Remember 30 30 30
Understand 40 40 40
Apply 30 30 30
Analyze
Evaluate
Create

Mark Distribution

Total Marks CIE Marks ESE Marks ESE Duration

150 50 100 3

Continuous Internal Evaluation Pattern:

Attendance 10 marks
Continuous Assessment Tests(Average of SeriesTests1& 2) 25 marks

Continuous Assessment Assignment 15 marks

 COMPUTER SCIENCE AND ENGINEERING

Internal Examination Pattern:

Each of the two internal examinations has to be conducted out of 50 marks. First series test shall
be preferably conducted after completing the first half of the syllabus and the second series test
shall be preferably conducted after completing remaining part of the syllabus. There will be two
parts: Part A and Part B. Part A contains 5 questions (preferably, 2 questions each from the
completed modules and 1 question from the partly completed module), having 3 marks for each
question adding up to 15 marks for part A. Students should answer all questions from Part A.
Part B contains 7 questions (preferably, 3 questions each from the completed modules and 1
question from the partly completed module), each with 7 marks. Out of the 7 questions, a student
should answer any5.

End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions from
each module, having 3 marks for each question. Students should answer all questions. Part B
contains 2 full questions from each module of which student should answer any one. Each
question can have maximum 2 sub-divisions and carries 14 marks.

Syllabus
Module-1 (Modelling and types of compression)) 1
Introduction to Compression Techniques- Lossy compression & Lossless compression, Measures
of Performance, Modeling and coding. Mathematical modelling for Lossless and lossy compression
- Physical models and probability models.

Module – 2 (Basic Compression Methods)

Basic Compression Technique- Run length encoding, RLE Text compression. Statistical Methods-
Prefix Codes, Binary Huffman coding, non-binary Huffman Algorithms, Arithmetic Coding.
Module - 3 (Text & Image Compression)
Dictionary based Coding- LZ77, LZ78 and LZW compression.Image Compression- Image
standards, JPEG image Compression- Baseline JPEG, JPEG-LS.

Module - 4 (Video Compression)

Video Compression- Analog video, Digital Video, Motion Compensation. MPEG standards-
MPEG 1, MPEG 4

Module - 5 (Audio Compression)

Audio Compression- Basics of Digital Audio, Basic Audio Compression Techniques, MPEG
Audio Compression-Layer 1 coding, Layer 2 coding and Layer 3 coding.
 COMPUTER SCIENCE AND ENGINEERING

Text Book
1. David Solomon, Data compression: the complete reference, 4/e, Springer, January 2007
2. Khalid Sayood, Introduction to data compression, Morgan Kaufmann Publishers,2003.
References
1) Stephen Welstead, Fractal and wavelet Image Compression techniques, PHI, 1999.
2) Sleinreitz, Multimedia System, Addison Wesley.
3) Mark Nelson and Jean-loup Gailly, The Data Compression Book, M&T Books.

Course Level Assessment Questions

Course Outcome 1 (CO1):

1. Discuss different types of compression performance metrics

2. Explain mathematical model for lossless compression

Course Outcome 2 (CO2):

1. Explain RLE based text compression and identify a example with compression ratio of 2.
2. Given the eight symbols A, B, C, D, E, F, G, and H with probabilities 1/30, 1/30, 1/30,
2/30, 3/30, 5/30, 5/30, and 12/30, draw three different Huffman trees with heights 5 and 6
for these symbols and calculate the average code size for each tree.

Course Outcome 3 (CO3):

1. Differentiate the LZ77 and LZ78 performance with the input given as
‘sirsideastmaneasilyteasesseasickseals’
2. Explain why the continuous-tone images is required for JPEG and the main steps used in
image compression.

Course Outcome 4 (CO4):

1. Briefly explain MPEG-4 video compression standard

2. How H.261 video compression is completed.

Course Outcome 5 (CO5):

1. Explain critical bands, thresholding and masking related to audio compression

2. Explain the working of -law encoder and decoder with an example
 COMPUTER SCIENCE AND ENGINEERING

Model Question Paper

QP CODE:

Reg No: _______________

Name: _________________ PAGES : 2

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

EIGHTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR

Course Code: CST446

Course Name: Data Compression Techniques

Max.Marks:100 Duration: 3 Hours

PART A

Answer All Questions. Each Question Carries 3 Marks

1. Specify different quantities used to measure the performance of a data

compression technique

2. Explain mathematical model for lossless compression

3. State and prove Kraft-McMillan inequality

4. Compare Huffman and Arithmetic coding

5. Describe LZ77 approach of encoding a string with the help of an example

6. Compare and contrast JPEG and JPEG-LS differences in working.

7. Discuss different components of video

8. Identify the advantage of MPEG-4 over MPEG

9. Explain critical bands, thresholding and masking related to audio compression

10. Explain the working of -law encoder and decoder with an example
(10x3=30)
 COMPUTER SCIENCE AND ENGINEERING

Part B
(Answer any one question from each module. Each question carries 14 Marks)

11. (a) Explain mathematical model for lossy compression and lossless compression (10)
(b) Define compression ratio with an example (4)
OR

12. (a) Discuss any probability model and identify the shortcoming of the solution. (7)

(b) Identify the mathematical preliminaries for Lossless Compression (7)

13. (a) With a help of flowchart discuss the RLE text compression for text data given (10)
below
‘ABBBBBBBBBCDEEEEF’
(b) calculate the compression ratio for the example while taking repetitions = 4 (4)

OR
14. (a) Illustrate with a example why Huffman coding is preferred than Shannon (10)
Fano Algorithm for compression
(b) How Huffman coding is handling the unpredictability of input data stream (4)

15. (a) Explain in detail the working of LZ78 with example and dictionary Tree (10)

(b) Illustrate with example, how the compression factor LZW differ from the (4)
LZ78

OR
16. (a) How quantization and coding helps in compression and their role in JPEG. (6)

(b) With the help of the given example illustrate the compression ratio of JPEG (8)
and JPEG-LS

17. (a) With the help of equations discuss Composite and Components Video (7)

(b) Differentiate the major changes in MPEG - 2 and MPEG-4 Video (7)

OR
18. (a) Describe in details about functionalities for MPEG-4 (8)

(b) How Motion Compensation help in video compression (6)

19. (a) How The Human Auditory System limitations can be taken in audio (7)
 COMPUTER SCIENCE AND ENGINEERING

compressions
(b) Discuss the complexity of Layer III compared to others in MPEG Audio (7)
Coding

OR
20. (a) Discuss Format of Compressed Data and encoding in layer I and II (9)

(b) Differentiate Spectral and Temporal Masking (5)

TEACHING PLAN

No Contents No of
Lecture
Hrs (36
Hours)

Module – 1 (Modelling and types of compression) (7 hrs)

1.1 Introduction to Compression Techniques- Lossy compression & Lossless 2

compression, Measures of Performance

1.2 Modelling and coding. 1

1.3 Physical model for lossless compression 1

1.4 Physical model for lossy compression 1

1.5 Probability model for lossless compression 1

1.6 Probability model for lossly compression 1

Module - 2 (Basic Compression Methods) (8 hrs)

2.1 Run length encoding, RLE Text compression 1

2.2 Statistical methods-Prefix Codes 1

2.3 Binary Huffman coding 1

2.4 Illustration of Binary Huffman coding 1

2.5 Non-binary Huffman Algorithms 1

2.6 Arithmetic Coding algorithm 1

2.7 Illustration of Arithmetic Coding algorithm 2

 COMPUTER SCIENCE AND ENGINEERING

Module - 3 (Text & Image Compression) (8 hrs)

3.1 LZ77 compression 2

3.2 LZ78 Compression 1

3.3 LZW Compression 1

3.4 Basics of Image compression and Image standards 1

3.5 Baseline JPEG Image compression 1

3.6 JPEG-LS Image compression 1

Module - 4 (Video Compression) (7 hrs)

4.1 Basics of Video Compression- Analog video and Digital Video. 2

4.2 Motion Compensation 1

4.3 MPEG-1 standard and Video Syntax 1

4.4 MPEG-1 Pel Reconstruction 1

4.5 MPEG-4 standard 1

4.6 Functionalities for MPEG-4 1

Module - 5 (Audio Compression) ( 6 hrs)

5.1 Basics of Audio Compression, Digital Audio 1

5.2 Basic Audio Compression Techniques 1

5.3 MPEG Audio Compression basics- Frequency Domain Coding 1

5.4 Encoding: Layers I and II 1

5.5 Encoding: Layer II -Psychoacoustic Models 1

5.6 Psychoacoustic Models - Encoding: Layer III 1

 COMPUTER SCIENCE AND ENGINEERING

YEAR OF
CATEGORY L T P CREDIT INTRODUCTION
CST466 DATA MINING
PEC 2 1 0 3 2019

Preamble: This course helps the learner to understand the concepts of data mining and data
warehousing. It covers the key processes of data mining, data preprocessing techniques,
fundamentals and advanced concepts of classification, clustering, association rule mining, web
mining and text mining. It enables the learners to develop new data mining algorithms and apply
the existing algorithms in real-world scenarios.
Prerequisite: NIL

Course Outcomes: After the completion of the course the student will be able to

CO# CO

CO1 Employ the key process of data mining and data warehousing concepts in application
domains. (Cognitive Knowledge Level: Understand)

CO2 Make use of appropriate preprocessing techniques to convert raw data into suitable
format for practical data mining tasks (Cognitive Knowledge Level: Apply)

CO3 Illustrate the use of classification and clustering algorithms in various application
domains (Cognitive Knowledge Level: Apply)

CO4 Comprehend the use of association rule mining techniques. (Cognitive Knowledge
Level: Apply)

CO5 Explain advanced data mining concepts and their applications in emerging domains
(Cognitive Knowledge Level: Understand)

Mapping of course outcomes with program outcomes

PO PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO1 PO11 PO1
1 0 2

CO1

CO2

CO3
 COMPUTER SCIENCE AND ENGINEERING

CO4

CO5

Abstract POs defined by National Board of Accreditation

PO# Broad PO PO# Broad PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of solutions PO9 Individual and team work

Conduct investigations of
PO4 complex problems PO10 Communication

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Lifelong learning

Assessment Pattern

Continuous Assessment Tests

Bloom’s End Semester Examination
Category Marks (%)
Test 1 (%) Test 2 (%)

Remember 20 20 20

Understand 30 30 30

Apply 50 50 50

Analyze

Evaluate
Create

Mark Distribution

Total Marks CIE Marks ESE Marks ESE Duration

150 50 100 3
 COMPUTER SCIENCE AND ENGINEERING

Continuous Internal Evaluation Pattern:

Attendance 10 marks
Continuous Assessment Test(Average of Internal Test1&2) 25 marks

Continuous Assessment Assignment 15 marks

Internal Examination Pattern
Each of the two internal examinations has to be conducted out of 50 marks. First series test shall
be preferably conducted after completing the first half of the syllabus and the second series test
shall be preferably conducted after completing the remaining part of the syllabus. There will be
two parts: Part A and Part B. Part A contains 5 questions (preferably, 2 questions each from the
completed modules and 1 question from the partly completed module), having 3 marks for each
question adding up to 15 marks for part A. Students should answer all questions from Part A. Part
B contains 7 questions (preferably, 3 questions each from the completed modules and 1 question
from the partly completed module), each with 7 marks. Out of the seven questions, a student
should answer any five.
End Semester Examination Pattern:
There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions from
each module, having 3 marks for each question. Students should answer all questions. Part B
contains 2 full questions from each module of which student should answer any one. Each
question can have a maximum 2 subdivisions and carries 14 marks.

Syllabus
Module – 1 (Introduction to Data Mining and Data Warehousing)
Data warehouse-Differences between Operational Database Systems and Data Warehouses,
Multidimensional data model- Warehouse schema, OLAP Operations, Data Warehouse
Architecture, Data Warehousing to Data Mining, Data Mining Concepts and Applications,
Knowledge Discovery in Database Vs Data mining, Architecture of typical data mining system,
Data Mining Functionalities, Data Mining Issues.

Module - 2 (Data Preprocessing)

Data Preprocessing-Need of data preprocessing, Data Cleaning- Missing values, Noisy data, Data
Integration and Transformation, Data Reduction-Data cube aggregation, Attribute subset selection,
Dimensionality reduction, Numerosity reduction, Discretization and concept hierarchy generation.
 COMPUTER SCIENCE AND ENGINEERING

Module - 3 (Advanced classification and Cluster analysis)

Classification- Introduction, Decision tree construction principle, Splitting indices -Information
Gain, Gini indexDecision tree construction algorithms-ID3, Decision tree construction with
presorting-SLIQ, Classification Accuracy-Precision, Recall.
Introduction to clustering-Clustering Paradigms, Partitioning Algorithm- PAM, Hierarchical
Clustering-DBSCAN, Categorical Clustering-ROCK

Module 4: (Association Rule Analysis)

Association Rules-Introduction, Methods to discover Association rules, Apriori(Level-wise
algorithm), Partition Algorithm, Pincer Search Algorithm, Dynamic Itemset Counting Algorithm,
FP-tree Growth Algorithm.

Module 5 (Advanced Data Mining Techniques)

Web Mining - Web Content Mining, Web Structure Mining- Page Rank, Clever, Web Usage
Mining- Preprocessing, Data structures, Pattern Discovery, Pattern Analysis. Text Mining-Text
Data Analysis and information Retrieval, Basic measures for Text retrieval, Text Retrieval
methods, Text Indexing Techniques, Query Processing Techniques.

Text Books

1. Dunham M H, “Data Mining: Introductory and Advanced Topics”, Pearson Education, New
Delhi, 2003.
2. Arun K Pujari, “Data Mining Techniques”, Universities Press Private Limited,2008.
3. Jaiwei Han and Micheline Kamber, “Data Mining Concepts and Techniques”, Elsevier,
2006
Reference Books

1. M Sudeep Elayidom, “Data Mining and Warehousing”, 1st Edition, 2015, Cengage
Learning India Pvt. Ltd.
2. MehmedKantardzic, “Data Mining Concepts, Methods and Algorithms”, John Wiley and
Sons, USA, 2003.
3. Pang-Ning Tan and Michael Steinbach, “Introduction to Data Mining”, Addison Wesley,
2006.
 COMPUTER SCIENCE AND ENGINEERING

Course Level Assessment Questions

Course Outcome 1 (CO1):

1. (a) Explain the OLAP operations in a multidimensional model.

(b) Compare the techniques used in ROLAP, MOLAP and HOLAP
2. Explain the various data mining issues with respect to mining methodology, user
interaction and diversity of data types.
3. Suppose that a data warehouse consists of the three dimensions time, doctor, and patient,
and the two measures count and charge, where charge is the fee that a doctor charges a
patient for a visit.
a) Draw star and snowflake schema diagrams for the data warehouse.
b) Starting with the base cuboid [day; doctor; patient], what specific OLAP operations
should be performed in order to list the total fee collected by each doctor in 2004?

Course Outcome 2 (CO2):

1. Use the methods below to normalize the following group of data:100, 200, 300, 400,550,
600, 680, 850, 1000
(a) min-max normalization by setting min = 0 and max = 1
(b) z-score normalization
(c) Normalization by decimal scaling
Comment on which method you would prefer to use for the given data, givingreasons as to
why.
2. Identify a suitable dataset from any available resources and apply different preprocessing
steps that you have learned. Observe and analyze the output obtained. (Assignment)

Course Outcome 3 (CO3):

1. Illustrate the working of ID3 algorithm with the following example

2. Illustrate the working of K medoid algorithm for the given dataset. A1=(3,9), A2=(2,5),
A3=(8,4), A4=(5,8), A5=(7,5), A6=(6,4), A7=(1,2), A8=(4,9).
 COMPUTER SCIENCE AND ENGINEERING

3. Take a suitable dataset from available resources and apply all the classification and clustering
algorithms that you have studied on original and preprocessed datasets. Analyze the
performance variation in terms of different quality metrics. Give a detailed report based on
the analysis. (Assignment)

Course Outcome 4 (CO4):

1. A database has five transactions. Let min sup = 60% and min con f = 80%.

a) Find all frequent item sets using Apriori and FP-growth, respectively. Compare the
efficiency of the two mining processes.
b) List all of the strong association rules (with support s and confidence c) matching the
following metarule, where X is a variable representing customers, and𝑖𝑖𝑖𝑖𝑖𝑖𝑖𝑖𝑖𝑖 denotes
variables representing items (e.g., “A”, “B”, etc.)
∀𝑥𝑥 ∈ 𝑡𝑡𝑡𝑡𝑡𝑡𝑡𝑡𝑡𝑡𝑡𝑡𝑡𝑡𝑡𝑡𝑡𝑡𝑡𝑡𝑡𝑡, 𝑏𝑏𝑏𝑏𝑏𝑏𝑏𝑏(𝑋𝑋, 𝑖𝑖𝑖𝑖𝑖𝑖𝑖𝑖1 ) ∧ 𝑏𝑏𝑏𝑏𝑏𝑏𝑏𝑏(𝑋𝑋, 𝑖𝑖𝑖𝑖𝑖𝑖𝑖𝑖2 ) ⇒ 𝑏𝑏𝑏𝑏𝑏𝑏𝑏𝑏 (𝑋𝑋, 𝑖𝑖𝑖𝑖𝑖𝑖𝑖𝑖3 ) [𝑠𝑠, 𝑐𝑐]

2. Identify and list some scenarios in which association rule mining can be used, and then use at
least two appropriate association rule mining techniques in one of the two scenarios.
(Assignment)

Course Outcome 5 (CO5):

1. Consider an e-mail database that stores a large number of electronic mail (e-mail)
messages. It can be viewed as a semi structured database consisting mainly of text data.
Discuss the following.
a. How can such an e-mail database be structured so as to facilitate multidimensional
search, such as by sender, by receiver, by subject, and by time?
b. What can be mined from such an e-mail database?
c. Suppose you have roughly classified a set of your previous e-mail messages as junk,
unimportant, normal, or important. Describe how a data mining system may take this
as the training set to automatically classify new e-mail messages or unclassified ones.
2. Precision and recall are two essential quality measures of an information retrieval system.
(a) Explain why it is the usual practice to trade one measure for the other.
(b) Explain why the F-score is a good measure for this purpose.
 COMPUTER SCIENCE AND ENGINEERING

(c) Illustrate the methods that may effectively improve the F-score in an information
retrieval system.
3. Explain HITS algorithm with an example.

Model Question Paper

QP CODE:

Reg No: _______________

Name: _________________ PAGES : 4

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

EIGHTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR

Course Code: CST466

Course Name: Data Mining

Max.Marks:100 Duration: 3 Hours

PART A

Answer All Questions. Each Question Carries 3 Marks

1. Differentiate between OLTP and OLAP.

2. Compare the techniques of ROLAP, MOLAP and HOLAP

3. Explain Concept hierarchy with an example.

4. Explain heuristic methods of attribute subset selection techniques.

5. Consider a two-class classification problem of predicting whether a photograph

contains a man or a woman. Suppose we have a test dataset of 10 records with
expected outcomes and a set of predictions from our classification algorithm.
 COMPUTER SCIENCE AND ENGINEERING

Calculate precision, recall of the data.

6. Given two objects represented by the tuples (22,1,42,10) and (20,0, 36,8).
Compute the Euclideanand Manhattan distance between the two objects.

7. The pincer search algorithm is a bi-directional search, whereas the level wise
algorithm is a unidirectional search. Express your opinion about the statement.

8. Define support, confidence and frequent set in association data mining context.

9. Distinguish between focused crawling and regular crawling.

10. Describe any two-text retrieval indexing techniques. (10x3=30)

Part B
(Answer any one question from each module. Each question carries 14 Marks)

11. (a) Suppose a data warehouse consists of three measures: customer, account (7)
and branch and two measures count (number of customers in the branch)
and balance. Draw the schema diagram using snowflake schema and star
schema.

(b) Explain three- tier data warehouse architecture with a neat diagram. (7)

OR

12 (a) Illustrate different OLAP operations in multidimensional data model (7)

(b) Describe different issues in data mining (7)

13 (a) Suppose that the data for analysis includes the attribute age. The age values (8)
for the data tuples are (in increasing order) 13, 15, 16, 16, 19, 20, 20, 21, 22,
22, 25, 25, 25, 25, 30, 33, 33, 35, 35, 35, 35, 36, 40, 45, 46, 52, 70.
(a) Use min-max normalization to transform the value 35 for age onto
 COMPUTER SCIENCE AND ENGINEERING

the
range [0-1].
(b) Use z-score normalization to transform the value 35 for age, where
the standard deviation of age is 12.94 years.
(c) Use normalization by decimal scaling to transform the value 35 for
age.
(d) Use smoothing by bin means to smooth the above data, using a bin
depth of 3. Illustrate your steps. Comment on the effect of this
technique for the given data.

(b) With proper illustration, explain how PCA can be used for dimensionality (6)
reduction? Explain

OR

14 (a) Suppose a group of 12 sales price records has been sorted as follows: 5, 10, (8)
11, 13, 15, 35, 50, 55, 72, 92, 204, 215. Sketch examples of each of the
following sampling techniques: SRSWOR, SRSWR, cluster sampling,
stratified sampling. Use samples of size 5 and the strata “youth,” “middle-
aged,” and “senior.”
(b) Partition the above data into three bins by each of the following methods: (6)
(i) equal-frequency (equi-depth) partitioning
(ii) equal-width partitioning

15 (a) Explain the concept of a cluster as used in ROCK. Illustrate with examples (9)

(b) Consider the following dataset for a binary classification problem. (5)

A B Class
Label
T F +
T T +
T T +
T F -
T T +
F F -
F F -
F F -
T T -
T F -
Calculate the gain in Gini index when splitting on A and B respectively.
Which attribute would the decision tree induction algorithm choose?
 COMPUTER SCIENCE AND ENGINEERING

OR

16 (a) For a sunburn dataset given below, find the first splitting attribute for the (10)
decision tree by using the ID3 algorithm.

Name Hair Height Weight Lotion Class

Sarah Blonde Average Light No Sunburn
Dana Blonde Tall Average Yes None
Alex Brown Tall Average Yes None
Annie Blonde Short Average No Sunburn
Emily Red Average Heavy No Sunburn
Pete Brown Tall Heavy No None
John Brown Average Heavy No None
Katie Blonde Short Light Yes None

(b) Explain the working of SLIQ algorithm. (4)

17 (a) Illustrate the working of Pincer Search Algorithm with an example. (7)

(b) Describe the working of dynamic itemset counting technique? Specify when (7)
to move an itemset from dashed structures to solid structures?

OR

18 (a) A database has six transactions. Let min_sup be 60% and min_conf be (9)
80%.

TID items_bought

T1 I1, I2, I3

T2 I2, I3, I4

T3 I4, I5

T4 I1, I2, I4

T5 I1, I2, I3, I5

T6 I1, I2, I3, I4

Find frequent itemsets using FP Growth algorithm and generate strong

association rules from a three item dataset.

(b) Write partitioning algorithm for finding large itemset and compare its (5)
efficiency with apriori algorithm
 COMPUTER SCIENCE AND ENGINEERING

19 (a) Describe web content mining techniques. (7)

(b) Write an algorithm to find maximal frequent forward sequences to mine log (7)
traversal patterns. Illustrate the working of this algorithm.

OR

20 (a) Explain how web structure mining is different from web usage mining and (7)
web content mining? Write a CLEVER algorithm for web structure mining.
(b) Describe different Text retrieval methods. Explain the relationship between (7)
text mining and information retrieval and information extraction.

Teaching Plan

No. of
No Contents lecture
hours
(36
Hrs)

Module 1(Introduction to Data Mining and Data Warehousing) (Text3) (6 hours)

1.1 Data warehouse-Differences between Operational Database Systems and

Data Warehouses, Multidimensional data model- Warehouse schema 1

1.2 OLAP Operations 1

1.3 DataWarehouse Architecture, Data Warehousing to Data Mining 1

1.4 Datamining Concepts and Applications, Knowledge Discovery in Database 1

Vs Data mining

1.5 Architecture of typical data mining system,Data Mining Functionalities 1

1.6 Data Mining Functionalities, Data Mining Issues 1

Module 2(Data Preprocessing) (6 hours) (Text3)

2.1 Data Preprocessing: Need of Data Preprocessing, Data Cleaning- Missing 1

values, Noisy data.

2.2 Data integration 1

2.3 Data transformation 1

2.4 Data Reduction-Data cube aggregation, Attribute subset selection 1

2.5 Data Reduction-Dimensionality reduction 1

 COMPUTER SCIENCE AND ENGINEERING

2.6 Numerosity reduction, Discretization and concept hierarchy generation 1

Module 3(Advanced classification and Cluster analysis)(9 hours)(Text2,Text3)

3.1 Classification- Introduction, Decision tree construction principle, Splitting 1

indices-Information Gain, Gini index

3.2 Decision Tree- ID3 1

3.3 Decision Tree- ID3 1

3.4 Decision tree construction with presorting- SLIQ 1

3.5 Accuracy and error measures, evaluation 1

3.6 Introduction to clustering, Clustering Paradigms 1

3.7 Partitioning Algorithm- PAM 1

3.8 Hierarchical Clustering-DBSCAN 1

3.9 Categorical Clustering-ROCK 1

Module 4(Association Rule Analysis) (8 hours) (Text2,Text3,Text1)

4.1 Association Rules: Introduction, Methods to discover association rules 1

4.2 A priori algorithm (Level-wise algorithm) 1

4.3 A priori algorithm (Level-wise algorithm) 1

4.4 Partition Algorithm 1

4.5 Pincer Search Algorithm 1

4.6 Pincer Search Algorithm 1

4.7 Dynamic Itemset Counting Algorithm 1

4.8 FP-tree Growth Algorithm 1

Module 5(Advanced Data Mining Techniques) (7 hours) (Text1, Text3

5.1 Web Mining - Web Content Mining 1

5.2 Web Structure Mining- Page Rank 1

5.3 Web Structure Mining –Clever algorithm 1

5.4 Web Usage Mining- Preprocessing, Data structures 1

 COMPUTER SCIENCE AND ENGINEERING

5.5 Web Usage Mining -Pattern Discovery, Pattern Analysis 1

5.6 Text Mining-Text Data Analysis and information Retrieval, Basic 1

measures for Text retrieval

5.7 Text Retrieval methods, Text Indexing Techniques 1

Query Processing Techniques
 COMPUTER SCIENCE AND ENGINEERING

YEAR OF
CATEGORY L T P CREDIT INTRODUCTION
CST476 MOBILE COMPUTING
PEC 2 1 0 3 2019

Preamble: The course is designed with the view of preparing the engineering students
capable of understanding the communication protocols, various architectures and security
features used in mobile computing. This course covers basics of mobile computing,
architecture of wireless transmission systems and next generation networks. This course
enables the learners to acquire advanced concepts on wireless communication systems and
mobile ad-hoc networks.

Prerequisite: A sound knowledge of computer networks.

Course Outcomes: After the completion of the course the student will be able to

CO# Course Outcomes

CO1 Explain the various mobile computing applications, services, design

considerations and architectures (Cognitive knowledge: Understand)
CO2 Describe the various technology trends for next generation cellular wireless
networks and use the spreading concept on data transmission (Cognitive
knowledge: Apply)
CO3 Summarize the architecture of various wireless LAN technologies
(Cognitive knowledge: Understand)
CO4 Identify the functionalities of mobile network layer and transport layer
(Cognitive knowledge: Understand)

CO5 Explain the features of Wireless Application Protocol (Cognitive

knowledge: Understand)
CO6 Interpret the security issues in mobile computing and next generation
technologies (Cognitive knowledge: Understand)

Mapping of course outcomes with program outcomes

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1

CO2

CO3

CO4
 COMPUTER SCIENCE AND ENGINEERING

CO5

CO6

Abstract POs defined by National Board of Accreditation

PO# Broad PO PO# Broad PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of solutions PO9 Individual and team work

PO4 Conduct investigations of complex problems PO10 Communication

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Life long learning

Assessment Pattern

End Semester Examination

Bloom’s Category Test 1 (%) Test 2 (%)
(%)

Remember 30 30 30
Understand 50 50 50
Apply 20 20 20
Analyse
Evaluate
Create

Mark Distribution

Total Marks CIE Marks ESE Marks ESE Duration

150 50 100 3
 COMPUTER SCIENCE AND ENGINEERING

Continuous Internal Evaluation Pattern:

Attendance : 10 marks
Continuous Assessment Test : 25 marks
Continuous Assessment Assignment : 15 marks

Internal Examination Pattern:

Each of the two internal examinations has to be conducted out of 50 marks. First series test shall be
preferably conducted after completing the first half of the syllabus and the second series test shall
be preferably conducted after completing remaining part of the syllabus. There will be two parts:
Part A and Part B. Part A contains 5 questions (preferably, 2 questions each from the completed
modules and 1 question from the partly completed module), having 3 marks for each question
adding up to 15 marks for part A. Students should answer all questions from Part A. Part B
contains 7 questions (preferably, 3 questions each from the completed modules and 1 question
from the partly completed module), each with 7 marks. Out of the 7 questions, a student should
answer any 5.

End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions from
each module, having 3 marks for each question. Students should answer all questions. Part B
contains 2 questions from each module of which a student should answer any one. Each question
can have maximum 2 sub-divisions and carries 14 marks.

Syllabus

Module - 1 (Mobile Computing Basics)

Introduction to mobile computing – Functions, Middleware and Gateways, Application
and services. Mobile computing architecture – Internet: The Ubiquitous network, Three-
tier architecture for Mobile Computing, Design considerations for mobile computing.

Module – 2 (Wireless Transmission and Communication Systems)

Spread spectrum – Direct sequence, Frequency hopping. Medium Access Control – Space
Division Multiple Access (SDMA), Frequency Division Multiple Access (FDMA), Time
Division Multiple Access (TDMA), Code Division Multiple Access (CDMA). Satellite
Systems – Basics, Applications, Geostationary Earth Orbit (GEO), Low Earth Orbit
(LEO), Medium Earth Orbit (MEO), Routing, Localization, Handover.
Telecommunication Systems - Global System for Mobile Communication (GSM)
 COMPUTER SCIENCE AND ENGINEERING

services, Architecture, Handover, Security.

Module – 3 (Wireless LANs)

Wireless LAN - Advantages, Design goals, Applications, Infrastructure Vs Ad-hoc mode,
IEEE 802.11 System Architecture, Protocol Architecture, Physical layer, Medium Access
Control layer, HIPERLAN-1, Bluetooth.

Module – 4 (Mobile Network and Transport Layer)

Mobile network layer – Mobile Internet Protocol (IP), Dynamic Host Configuration
Protocol (DHCP), Mobile ad-hoc networks – Routing, Dynamic Source Routing (DSR),
Destination Sequence Distance Vector (DSDV), Ad-hoc routing protocols. Mobile
transport layer – Traditional Transmission Control Protocol (TCP), Improvements in
Classical TCP. Wireless Application Protocol (WAP) - Architecture, Wireless Datagram
Protocol (WDP), Wireless Transport Layer Security (WTLS), Wireless Transaction
Protocol (WTP), Wireless Session Protocol (WSP).

Module – 5 (Mobile Security and Next Generation Networks)

Security issues in mobile computing - Information security, Security techniques and
algorithms, Security models. Next generation networks - Orthogonal Frequency Division
Multiplexing (OFDM), Wireless Asynchronous Transfer Mode (WATM), Multi Protocol
Label Switching (MPLS), 10 pillars of 5G, Security for 5G communication.

Text Books
1. Asoke K. Talukder, Hasan Ahmad, Roopa R Yavagal, Mobile Computing Technology-
Application and Service Creation, 2/e, McGraw Hill Education.
2. Jochen Schiller, Mobile Communications, Pearson Education Asia, 2008.
3. Jonathan Rodriguez, Fundamentals of 5G Mobile Networks, Wiley Publishers, 2015.

Reference Books
1. Raj Kamal, Mobile Computing, 2/e, Oxford University Press.
2. Andrew S. Tanenbaum, Computer Networks, PHI, 3/e, 2003
3. Theodore S. Rappaport, Wireless Communications Principles and Practice, 2/e, PHI, New
Delhi, 2004.
4. Curt M. White, Fundamentals of Networking and Communication 7/e, Cengage learning.

Course Level Assessment Questions

Course Outcome 1 (CO1):
1. Give examples for five mobile computing applications.
2. Identify any three differences between middleware and gateways.

Course Outcome 2 (CO2):

1. There are four stations sending data 1,1,1,0 respectively. Station 3 receives station 1’s
 COMPUTER SCIENCE AND ENGINEERING

data. Show the encoding, decoding and channel sharing mechanisms using CDMA.
2. Compare the influence of near/far effect and its countermeasures in TDMA and
CDMA systems.

Course Outcome 3 (CO3):

1. Compare IEEE 802.11 and Bluetooth with respect to their ad-hoc capabilities.
2. Describe with neat sketch the major baseband states of a Bluetooth device.

Course Outcome 4 (CO4):

1. With the help of an example, show how routing process is handled by Dynamic Source
Routing protocol.
2. Describe the major differences between AODV and the standard Distance Vector
Routing algorithm. Why are extensions needed?
3. Simulate routing protocols using NS2.

Course Outcome 5 (CO5):

1. How does WAP push operation differ from pull operation?
2. With the help of a neat sketch explain the secure session establishment using WTLS.

Course Outcome 6 (CO6):

1. Explain the 3GPP security framework for mobile security.
2. Explain the features of policy-based security model.

Model Question Paper

QP CODE: PAGES: 3

Reg No:_______________
Name:_________________

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

EIGHTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR

Course Code: CST476

Course Name : Mobile Computing
Max Marks: 100 Duration: 3 Hours
PART-A
(Answer All Questions. Each question carries 3 marks)

1. Explain the different types of middleware and gateways in the architecture of

mobile computing.

2. Explain the major segments to support mobile computing functions.

 COMPUTER SCIENCE AND ENGINEERING

3. Compare and contrast the satellite systems – GEO, LEO and MEO.

4. Assume all stations can hear all other stations. One station wants to transmit
and senses the carrier idle. Why can a collision still occur after the start of
transmission?

5. List any three advantages and disadvantages of wireless LANs.

6. Compare the features of infrastructure and ad-hoc networks.

7. Mention the basic purpose of DHCP. Also list the entities of DHCP.

8. Identify the benefits of location information for routing in ad-hoc networks.

9. List any six pillars of 5G.

10. How does multifactor security model provide security in a mobile network?
(10x3=30)
Part B
(Answer any one question from each module. Each question carries 14 Marks)

11. (a) Describe the design considerations of three tier architecture of mobile (6)
computing.

(b) Explain any four functions and applications of mobile computing. (8)
OR
12. (a) Explain Internet-Ubiquitous networks mentioning the significance and (6)
functions of core, edge and access network.
(b) With the help of a neat sketch explain the three-tier architecture of mobile (8)
computing.

13. (a) Check to see if the following set of chips can belong to an orthogonal system. (6)
[+1, +1, +1, +1] , [+1, -1, -1, +1] , [-1, +1, +1, -1] , [+1, -1, -1, +1]

(b) Summarize the routing and localization process in satellite systems. (8)

OR
14. (a) Apply Direct Sequence Spread Spectrum to the data 101 using Barker (6)
sequence 10110111000. Show the encoding and decoding steps.
(b) Describe the system architecture of GSM networks. (8)

15. (a) How is Quality-of-Service provided in Bluetooth? (6)

 COMPUTER SCIENCE AND ENGINEERING

(b) Explain the phases in Elimination-yield non-preemptive priority multiple (8)

access of HIPERLAN-1.

OR
16. (a) Describe the protocol architecture of IEEE 802.11. (6)

(b) Explain the Medium Access Control management features provided in an (8)
IEEE 802.11 station.

17. (a) With the help of an example, show the routing table creation using (7)
Destination Sequence Distance Vector Routing protocol in mobile ad-hoc
networks.

(b) Describe the router discovery methods used in mobile IP. (7)

OR

18. (a) Compare the features of flat routing and hierarchical routing. (6)

(b) List the entities of a mobile IP. With the help of an example, explain how (8)
packet delivery is done to and from a fixed node.

19. (a) How is orthogonality helpful in Orthogonal Frequency Division (4)

Multiplexing?
(b) Explain the functioning of Multi Protocol Label Switching technology. (10)

OR

20. (a) Describe the services of Wireless Asynchronous Transfer Mode. (6)

(b) Explain the different security models in mobile computing. (8)

TEACHING PLAN
No Contents No.of
Lecture
Hrs
(35 hrs)
Module – 1 (Mobile Computing Basics) (6 hrs)

1.1 Introduction to mobile computing – Functions 1

1.2 Middleware and Gateways 1

1.3 Application and services 1

1.4 Internet: The Ubiquitous network 1

 COMPUTER SCIENCE AND ENGINEERING

1.5 Three-tier architecture for Mobile Computing 1

1.6 Design considerations for mobile computing 1

Module – 2 (Wireless Transmission and Communication Systems) (8 hrs)

Direct sequence spread spectrum, Frequency hopping spread

2.1 1
spectrum

Space Division Multiple Access (SDMA), Frequency Division 1

2.2
Multiple Access (FDMA)

2.3 Time Division Multiple Access (TDMA) 1

2.4 Code Division Multiple Access (CDMA) 1

2.5 Satellite Systems Basics, Applications, Geostationary Earth Orbit 1

(GEO), Low Earth Orbit (LEO), Medium Earth Orbit (MEO)

2.6 Routing, Localization, Handover 1

2.7 Global System for Mobile Communication (GSM) services, 1

Architecture

2.8 Handover, Security 1

Module - 3 (Wireless LANs) (7 hrs)

3.1 Wireless LAN - Advantages, Design goals, Applications, 1

Infrastructure Vs Ad-hoc mode
3.2 IEEE 802.11 System Architecture 1

3.3 Protocol Architecture 1

3.4 Physical layer 1

3.5 Medium Access Control layer 1

3.6 HIPERLAN-1 1

3.7 Bluetooth 1

Module - 4 (Mobile Network and Transport Layer) (8 hrs)

Mobile Internet Protocol (IP), Dynamic Host Configuration

4.1 1
Protocol (DHCP)

4.2 Mobile ad-hoc networks – Routing, Dynamic Source Routing (DSR) 1

 COMPUTER SCIENCE AND ENGINEERING

Destination Sequence Distance Vector (DSDV)

4.3 1
Ad-hoc routing protocols
4.4 1
4.5 Traditional Transmission Control Protocol (TCP), Improvements in 1
Classical TCP

4.6 Wireless Application Protocol (WAP) – Architecture, Wireless 1

Datagram Protocol (WDP)

4.7 Wireless Transport Layer Security (WTLS) 1

4.8 Wireless Transaction Protocol (WTP), Wireless Session Protocol 1

(WSP)

Module - 5 (Mobile Security and Next Generation Networks) (6 hrs)

Information security, Security techniques

5.1 1

5.2 Security algorithms, Security models 1

5.3 Introduction to Next generation networks, Orthogonal Frequency 1
Division Multiplexing (OFDM)

5.4 Wireless Asynchronous Transfer Mode (WATM) 1

5.5 Multi Protocol Label Switching (MPLS) 1

5.6 10 pillars of 5G, Security for 5G communication 1