(An

Autonomous Institution approved by UGC and affiliated to JNTUH))

(Accredited by NAAC with ‘A” Grade, Accredited by NBA of AICTE and
Recipient of World Bank under TEQIP-I and II )
Yamnampet, Ghatkesar Mandal, Hyderabad - 501 301

COURSE FILE

B. Tech. IV year - I Semester

COMPUTER SCIENCE ENGINEERING

DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

2022
 SREENIDHI INSTITUTE OF SCIENCE AND TECHNOLOGY
AN AUTONOMOUS INSTITUTION

COURSE FILE FOR

CSE BRANCH
4 Year 1st Sem
th

CONTENTS

SL. SUBJECT
SUBJECT PAGE NO
NO CODE
PROFESSIONAL ELECTIVE-III:
1 7EC18 6
BIG DATA ANALYTICS
PROFESSIONAL ELECTIVE-IV:
2 7FC12 17
AGILE SOFTWARE DEVELOPMENT
SOFTWARE AUTOMATION AND
3 7F719 28
TESTING

4 7EC08 INFORMATION SECURITY 44

5 7F708 LINUX PROGRAMMING 60

6 7EC20 ARTIFICIAL INTELLIGENCE 81

7 7FC20 CYBER SECURITY 98

Previous Question Papers, Course Files and Lab

Manuals visit at //10.4.10.5 (through Intranet SNIST
CAMPUS ONLY)

1|Page
B. Tech (Computer Science and Engineering)
Program objective:
B. Tech in Computer Science and Engineering program emphasizes the use of computer as a
sophisticated problem solving tool.

The first two years of this program begins with a set of introductory courses, like Mathematics,
physics, English, computer languages (C,C++,Java), Database Management Systems, which provide
students with a firm foundation in mathematics, computer science, as well as communication skills.
These courses include weekly labs in which students use state-of-the art software development
techniques to create solutions to interesting problems.

The last two years of study focuses on the concepts and techniques used in the design and
development of advanced software systems. In addition, students choose from a rich set of electives,
which covers skills in demand. These advanced courses give broad opening for research and help
them to choose specialization in their higher studies. A generous allotment of open electives allows
students to learn foreign languages like French, German, Spanish; and it includes computing with a
business focus.

Students in this program pursue an inter-disciplinary course of study that combines strong foundation
in computer science with a focus on interdisciplinary areas. This program is designed for students
who seek to blend their computer science abilities with skills in demand and skills specific to another
domain to solve problems in that domain.

Having completed this course, a student is prepared to work independently within a well structured
design frame work in the job and for higher studies.

2|Page
DEPARTMENT OF COMPUTER SCIENCE and ENGINEERING

Vision
To emerge as a leading department in Technical Education and Research in Computer Science
and Engineering with focus to produce professionally competent and socially sensitive engineers
capable of working in global environment.
Mission
I. To prepare Computer Science and Engineering graduates to be a life long learner with
competence in basic science & engineering and professional core, multidisciplinary areas ,
with continuous update of the syllabus, so that they can succeed in industry as an individual
and as a team or to pursue higher studies or to become an entrepreneur.

II. To enable the graduates to use modern tools, design and create novelty based products
required for the society and communicate effectively with professional ethics.

III. To continuously engage in research and projects development with financial management to
promote scientific temper in the graduates and attain sustainability.

Programme Educational Objectives

I    Graduates will have a strong foundation in fundamentals of mathematics, science, computer

science and basic engineering with abilities to analyze problems, design and development of
optimal solutions to address societal problems.

II   Apply knowledge of modern tools to solve the complex problems and enable graduates to be
professionally competent engineers to sensitize towards societal, health, safety legal,
environmental and sustainable issues by following the ethical ideologies and makes them globally
employable.

III  Ability to work effectively as an individual, team member or a leader or pursue entrepreneurial

skills and be aware of gender sensitization with good communication, practice project and finance
management skills.

IV  Encouraging students to pursue higher studies in internationally reputed institutes thus making
them life-long learners.

3|Page
Programme Outcomes
The Programme Outcomes (POs) of the B.Tech (CSE) programme as stated by the NBA, India are
listed below:

Engineering Graduates will be able to:

1. Engineering knowledge: Apply the knowledge of mathematics, science, engineering
fundamentals, and an engineering specialization to the solution of complex engineering problems.

2. Problem analysis: Identify, formulate, review research literature, and analyze complex
engineering problems reaching substantiated conclusions using first principles of mathematics,
natural sciences, and engineering sciences.

3. Design/development of solutions: Design solutions for complex engineering problems and design
system components or processes that meet the specified needs with appropriate consideration for
the public health and safety, and the cultural, societal, and environmental considerations.

4. Conduct investigations of complex problems: Use research-based knowledge and research

methods including design of experiments, analysis and interpretation of data, and synthesis of the
information to provide valid conclusions.
5. Modern tool usage: Create, select, and apply appropriate techniques, resources, and modern
engineering and IT tools including prediction and modeling to complex engineering activities with
an understanding of the limitations.

6. The engineer and society: Apply reasoning informed by the contextual knowledge to assess
societal, health, safety, legal and cultural issues and the consequent responsibilities relevant to the
professional engineering practice.

7. Environment and sustainability: Understand the impact of the professional engineering solutions
in societal and environmental contexts, and demonstrate the knowledge of, and need for
sustainable development.

8. Ethics: Apply ethical principles and commit to professional ethics and responsibilities and norms
of the engineering practice.

9. Individual and team work: Function effectively as an individual, and as a member or leader in
diverse teams, and in multidisciplinary settings.

10. Communication: Communicate effectively on complex engineering activities with the

engineering community and with society at large, such as, being able to comprehend and write
effective reports and design documentation, make effective presentations, and give and receive
clear instructions.

11. Project management and finance: Demonstrate knowledge and understanding of the
engineering and management principles and apply these to one’s own work, as a member and
leader in a team, to manage projects and in multidisciplinary environments.

4|Page
 12. Life-long learning: Recognize the need for, and have the preparation and ability to engage in
independent and life-long learning in the broadest context of technological change.

Correlation between the POs and the PEOs

Programme Outcomes
PEOs
1 2 3 4 5 6 7 8 9 10 11 12
I    
II      
III   
IV  
B.Tech Programme Specific Outcomes (PSOs)

Program Specific Outcomes (PSOs) are statements that describe what the graduates of
a specific engineering program should be able to do. On completion of the B.Tech.
(Computer Science & Engineering) program the graduates will be able to

1. Apply the knowledge of computer architecture, software development life cycle, networking,
database, web designing with emphasis on data structures and algorithms using programming lan-
guages and appropriate software tools to solve the specified needs of engineering problems. 
2. Acquaintance of knowledge on the thrust areas such as Cloud Computing, Internet of
Things(IoT), Data Science, Machine Learning, Network Security, Artificial Intelligence for solving
societal and local problems with varying complexities.
3. Design and develop innovative prototypes or projects individually or in a team to solve the ex-
isting industrial problems using effective communication skills with due consideration to professional
ethics, security, cultural and environmental contexts for sustainable professional development.

5|Page
 SREENIDHI INSTITUTE OF SCIENCE & TECHNOLOGY

(An Autonomous Institution approved by UGC and affiliated to JNTUH)

(Accredited by NAAC with ‘A” Grade, Accredited by NBA of AICTE and
Recipient of World Bank under TEQIP-I and II)
Yamnampet, Ghatkesar Mandal, Hyderabad - 501 301.

COURSE FILE

FOR

BIG DATA ANALYTICS

FOR

B.Tech - IV year - I Semester

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

SEPTEMBER 2021

6|Page
Prepared by Dr. PRASANTA KUMAR SAHOO, Professor Department of Computer
Science & Engineering
 PO 1 2 3 4 5 6 7 8 9 10 11 12
Level M L H

Syllabus for B. Tech. IV Year I semester

Computer Science and Engineering
BIG DATA ANALYTICS
(Professional Elective –III)

L T P C
3 - - 3

Code: 7EC18

Prerequisite : Machine Learning

Course Objectives: Understanding about big data for business intelligence, learning business case
studies for big data analytics, learning about the cloud and big data, Knowledge about risk
management involved in big data, Understanding NoSql for big data management, Understanding
about map reduces work flows. Capability to perform map-reduce analytics using Hadoop and related
tools.

Course outcomes: At the end of this course the student will be able to

1. Learn the importance of big data.

2. Interpret the challenges with big data; elaborate the knowledge about the technological develop-
ments in big data environment.
3. Knowledge about NOSQL data environment.
4. Capability of understanding the usage of big data in context to cloud and other technologies.
5. Justify about map reduce work flows.
6. Implement Data Analysis with Hadoop and related tools.

UNIT-I INTRODUCTION TO BIG DATA What is big data, why big data, convergence of key
trends , unstructured data ,industry examples of big data ,web analytics, big data and marketing, fraud
and big data ,risk and big data ,credit risk management, big data in medicine, introduction to Hadoop
open source technologies , cloud and big data

UNIT-II UNDERSTANDING BIG DATA Types of digital data, characteristics of data, challenges
with big data, definition of big data, big data analytics, data science, technologies in big data
environments, CAP theorem.

UNIT-III NOSQL DATA MANAGEMENT Introduction to NoSQL, aggregate data models,

aggregates, key-value and document data Models, relationships, graph databases , schemaless
databases, materialized views, distribution models, sharding, master-slave replication, peer-peer
replication, sharing and replication

7|Page
UNIT-IV BASICS OF HADOOP Data format, features of Hadoop, analyzing data with Hadoop ,
design of Hadoop distributed file system (HDFS) ,HDFS concepts, scaling out ,Hadoop streaming ,
Hadoop pipes, Hadoop related tools.

UNIT- V MAPREDUCE APPLICATIONS MapReduce workflows, unit tests with MRUnit , test
data and local tests, anatomy of MapReduce job run ,classic Map-reduce, YARN ,failures in classic
Mapreduce and YARN , job scheduling , shuffle and sort ,task execution, MapReduce types ,input
formats, output formats

UNIT-VI SOCIAL MEDIA ANALYTICS AND TEXT MINING: Introducing Social Media;
Keyelements of Social Media; Text mining; Understanding Text Mining Process; Sentiment Analysis,
Performing Social Media Analytics and Opinion Mining on Tweets;

TEXT BOOKS:

1. Seema Acharya, S.Chellappan,”Big Data and Analytics”,Wiley,2014

2. BIG DATA, Black Book TM, Dream Tech Press, 2015 Edition.

REFERENCE BOOKS:

1. Michael Minelli, Michelle Chambers, and AmbigaDhiraj, "Big Data, Big Analytics:
Emerging Business Intelligence and Analytic Trends for Today's Businesses", Wiley,
2013.
2. P. J. Sadalage and M. Fowler, "NoSQL Distilled: A Brief Guide to the Emerging World of
Polyglot Persistence", Addison-Wesley Professional, 2012.
3. Tom White, "Hadoop: The Definitive Guide", Third Edition, O'Reilley, 2012.
4. Eric Sammer, "Hadoop Operations", O'Reilley, 2012.

8|Page
 LECTURE SCHEDULE

No. OF No. OF
S.No
UNIT PERIOD PERIODS &
.
S TOPICS TO BE COVERED
1. INTRODUCTION TO BIG DATA, Introduction to Big Data Plat-
form, Traits of Big data
2. why big data, convergence of key trends
3. unstructured data
1
4. industry examples of big data
5. web analytics
Unit-I 09 6. Applications: big data and marketing, fraud and big data
7. Applications: risk and big data, credit risk management. big
data in medicine
8. introduction to Hadoop open source technologies
9. Cloud and big data.

1. Types of digital data

2. Characteristics of data
3. challenges with big data
4. definition of big data
2 Unit-II 07 5. Big data analytics
6. Data science, technologies in big data environments
7. CAP theorem

1. Introduction to NoSQL
2. aggregate data models, aggregates
3. key-value and document data Models, relationships, graph
databases
4. schema less databases
3 UNIT III 08 5. materialized views
6. distribution models
7. sharding, master-slave replication
8. peer-peer replication, sharing and replication

9|Page
 1. Understanding Data format
2. features of Hadoop
3. analyzing data with Hadoop
4. design of Hadoop distributed file system (HDFS)
5. HDFS concepts
4 UNIT IV 09
6. scaling out ,Hadoop streaming
7. Hadoop pipes
8. Hadoop related tools
9. Review of Tools

1. The Map Reduce Framework

2. Map Reduce workflows
3. unit tests with MRUnit
4. test data and local tests
5. anatomy of MapReduce job run
6. classic Map-reduce
5 UNIT V 11
7. YARN ,failures in classic Mapreduce and YARN
8. job scheduling
9. shuffle and sort ,task execution
10. Map Reduce types
11. input formats, output formats

1. Social Media Analytics and Text Mining:

2. Introducing Social Media
3. Key elements of Social Media; Text mining;
6 UNIT VI 06 4. Understanding Text Mining Process
5. Sentiment Analysis, Performing Social Media Analytics
6. Opinion Mining on Tweets.

Total Periods: 09+07+08+09+11+06+ 5 extra for review = 55

10 | P a g e
UNIT-1

1. Define big data.

2. Explain the role of Big Data in today’s life.
3. Explain at least 3 applications of Big Data.
4. What are the five V’s of Big Data?
5. Explain web analytics.
6. Explain role of cloud in big data.
7. Explain credit risk management.
8. Write four computing resources for Big Data storage.
9. Why traditional analytics fail to deliver timely results?
10. Discuss big data used for fraud detection.

UNIT-2

1. Summarize the data types for big data.

2. List the main characteristics of Big Data.
3. Differentiate between structured data and unstructured data.
4. Illustrate the challenges with big data.
5. Explain big data analytics.
6. Explain the source of unstructured data.
7. Discuss big data environments.
8. Explain Atomicity.
9. Explain consistency.
10. Illustrate CAP theorem.

UNIT-3

1. Explain NoSql database.

2. Illustrate data model.
3. Illustrate key-value and document data Models.
4. Discuss schema less databases.
5. Discuss BigTable (Google).
6. Discuss Dynamo (Amazon).
7. Discuss sharding.
8. Explain master-slave replication.
9. Explain peer to peer replication.

UNIT- 4

1. Show how data can be stored in Hadoop with suitable example.

2. What do you understand by HDFS?
3. Give the Architecture of HDFS.
4. What are HDFC Files?
5. Discuss Hadoop Streaming.
11 | P a g e
 6. Discuss Hadoop pipes.
7. Mention the various types of HDFC File System and give the associated Commands.
8. How can Apache Hadoop IO Package be organized using HDF?
9. Write in detail about HDFS and its High Availability for data analytic applications.
10. Explain the various Visual Data Analysis Techniques.

UNIT- 5

1. Illustrate the Map Reduce Framework with suitable example.

2. Explain the various techniques to Optimize Map Reduce Jobs.
3. What are the uses of Map Reduce?
4. Give the Architecture of Map Reduce.
5. Explain YARN.
6. Explain the Meta data of name node.
7. Illustrate the role of Job Tracker.
8. Illustrate the role of Task Tracker.
9. State the limitations of Map Reduce.
10. Define the Map function.
11. Define the reduce function.
12. Discuss Shuffle and Sort.

UNIT- 6

1. Illustrate Social Media Analytics using Text Mining.

2. What are the Key elements of Social Media?
3. Explain in detail about Text Mining Process.
4. Discuss Sentiment Analysis in detail.
5. Discuss social Media Analytics.
6. Discuss Opinion Mining on Tweets.

12 | P a g e
 H.T No
Sreenidhi Institute of Science and Technology
Regulations
(An Autonomous Institution) :
Code No: 5FC17 Date: 01-July-2021(AN) A15
B.Tech IV-Year I- Semester Pending External Examination, July - 2021
(Supplementary)
BIG DATA ANALYTICS (CSE, IT and ECM)
Time: 3 Hours Max.Marks:75
Note: a) No additional answer sheets will be provided.
b) All sub-parts of a question must be answered at one place only, otherwise it will not be
valued.
c) Missing data can be assumed suitably.

ANSWER ANY 5 OUT OF 8 QUESTIONS. EACH QUESTION CARRIES 15 MARKS.

Bloom's Cognitive Levels of Learning (BCLL)

Remember L1 Apply L3 Evaluate L5
Understand L2 Analyze L4 Create L6

BC CO(s) Marks
LL
1. a) Discuss Hadoop open source technologies. L4 CO1 [8M]
b) Explain big data and marketing. L4 CO1 [7M]

2. a) Illustrate the technologies in big data environment. L3 CO2 [8M]

b) Explain the challenges with big data. L4 CO2 [7M]

3. a) Describe characteristics of a NoSQL database. L3 CO3 [8M]

b) Discuss master slave replication in NoSQL. L3 CO3 [7M]

4. a) Differentiate “Scale up and Scale out”. L5 CO4 [8M]

b) Explain with an example How Hadoop uses Scale out feature to L4 CO4 [7M]
improve the Performance.

5. a) Illustrate MapReduce data flow with multiple reduce tasks L3 CO5 [8M]
b) Explain the role of driver code, mapper code and reducer code within L4 CO5 [7M]
a map reduce program model by a suitable example.

6. a) Demonstrate the steps to perform text mining. L6 CO6 [8M]

b) Discuss performing social media analytics on tweets. L3 CO6 [7M]

7. a) Discuss web analytics. L2 CO1 [5M]

b) Write the responsibilities of a data scientist. L2 CO2 [5M]
c) Explain sharding. L3 CO3 [5M]

8. a) Discuss the anatomy of file write in HDFS. L3 CO4 [5M]

b) Discuss MapReduce features. L3 CO5 [5M]
c) List some common online tools used to perform sentiment analysis. L1 CO6 [5M]

13 | P a g e
 H.T No Regulations:
Sreenidhi Institute of Science and Technology A15
(An Autonomous Institution)
Code No: 5FC17 DAte: 16-May-2019 (AN)
B.Tech IV-Year I-Semester External Examination, May-2019 (Supplementary)
BIG DATA ANALYTICS (CSE and ECM)
Time: 3 Hours Max.Marks:75
Note: a) No additional answer sheets will be provided.
b) All sub-parts of a question must be answered at one place only, otherwise it will not be
valued.
c) Missing data can be assumed suitably.

Part - A Max.Marks:25
ANSWER ALL QUESTIONS.
1. Write three characteristics of Big Data, and what are the main considerations while [3M]
processing Big Data?
2. Define NON-Linear Dynamics in Data Analysis. [3M]
3. Define RTAP. [3M]
4. Define TEXT Analytics. [3M]
5. List the uses of MAP REDUCE. [3M]
6. Define sentiment Analysis. [2M]
7. What are the key skill sets and behavioral characteristics of a data scientist? [2M]
8. Define Stream Data Model. [2M]
9. List the various Commands of HDFS. [2M]
10. Define Mobile Analytics. [2M]

Part – B Max.Marks:50
ANSWER ANY FIVE QUESTIONS. EACH QUESTION CARRIES 10 MARKS.
11. a) Illustrate with examples various challenges of conventional systems. [5M]
b) Elaborate various open source Analytics Tools that deals with Big Data. [5M]

12. a) Explain Principal Component Analysis with an illustration. [5M]

b) Explain various types of Neural Networks with an Example. [5M]

13. a) Illustrate Real time stock market predictions with a case study. [5M]
b) Explain in detail the Architecture of Stream Data Model [5M]

14. a) Write various points to consider during Analysis. [5M]

b) compare and contrast various Analytical TOOLS. [5M]

15. a) Give the various techniques to optimize Map Reduce jobs. [5M]
b) Explain in detail HDFS Architecture. [5M]

16. a) Write about Opinion Mining on Tweets. [5M]

14 | P a g e
 b) Explain Various Applications of Mobile Analytics. [5M]

17. a) Write a note on Classification of Analytics. [3M]

b) Write about Bayesian Modelling. [3M]
c) Write in detail about filtering streams. [4M]

18. a) Explain in Detail TEXT Analytics. [3M]

b) Discuss the Role of HBASE in Big Data Processing. [4M]
c) Write about Various Mobile Analytics Tools. [3M]
-- 00 -- 00 –

Sreenidhi Institute of Science and Technology Regulations:

(An Autonomous Institution) A14
Code No: 4FC22 Date: 22-Dec-2017 (FN)
B.Tech IV-Year I-Semester External Examination, Dec - 2017 (Regular)
BIG DATA ANALYTICS (IT)
Time: 3 Hours Max.Marks:70
Note: a) No additional answer sheets will be provided.
b) All sub-parts of a question must be answered at one place only, otherwise it will not be valued.
c) Missing data can be assumed suitably.

Part - A Max.Marks:20
ANSWER ALL QUESTIONS.
1 What is Re sampling and why do we need it? [2M]
2 Explain Fuzzy Decision tree. [2M]
3 Explain Stream Data model. [2M]
4 Define streams in the context of clustering. [2M]
5 What is Hive? [2M]
6 Explain different statistical packages. [2M]
7 Define stochastic search method and write its applications. [2M]
8 What is clustering and explain any two clustering strategies? [2M]
9 Define and explain MapReduce. [2M]
10 Explain Industry challenges and applications of analytics. [2M]

Part – B Max.Marks:50
ANSWER ANY FIVE QUESTIONS. EACH QUESTION CARRIES 10 MARKS.

1 a) Define Big Data and state the role and its importance of it. [5M]
b) Explain Analysis vs Reporting with illustrations. [5M]

2 a) Discuss the significance of time series in the data analysis. [5M]

b) What is the difference between Principal component analysis and Neural [5M]
15 | P a g e
 networks?

3 a) Explain counting oneness in a window and Decaying Window. [5M]

b) Analyze stock market predictions with one case study. [5M]

4 a) Discuss Frequent pattern based clustering method with example. [5M]

b) Write Apriori algorithm and explain it with sample data. [5M]

5 a) Analyze in detail about NoSQL databases. [5M]

b) Discuss about Hadoop Distributed File system. [5M]

6 a) Explain correlation and regression techniques in detail. [5M]

b) Define and differentiate classification and association. [5M]

7 a) Explain about the challenges of conventional systems and web data. [5M]
b) Define support vector machines and explain its importance. [5M]

8 a) Describe K-means algorithm. [5M]

b) Write in brief about correlation & regression. [5M]
-- 00 -- 00 –

16 | P a g e
SREENIDHI INSTITUTE OF SCIENCE AND TECHNOLOGY
(An Autonomous Institution)
Yamnampet, Ghatkesar, Hyderabad – 501 301.

Agile Software Development

Course File

B.Tech (CSE) - IV Year I Semester

Academic Year 2021-22

Subject code: 7FC12

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

SCHOOL OF COMPUTER SCIENCE AND ENGINEERING

17 | P a g e
 1 2 3 4 5 6 7 8 9 10 11 12
H M H

Syllabus for B. Tech. IV Year I semester

Computer Science and Engineering
AGILE SOFTWARE DEVELOPMENT
(Professional Elective –V)
Code: 7FC12 L T P/D C
3 1 - 3
Course Objectives:
•To understand how an iterative, incremental development process leads to faster delivery of more
useful software
Course Outcomes: After completing this course, student shall be able to
1. Understand the essence of agile development methods
2. Apply the principles and practices of extreme programming in real world problems.
3. Incorporate proper coding standards and guidelines in an agile process.
4. Optimize an agile process by exploring the possible risks and threats in the software process
5. Improve the process by eliminating waste
6. Design an agile process for a business application and deal with appropriate tradeoff.

UNIT I
Why Agile?: Understanding Success, Beyond Deadlines, The Importance of Organizational Success,
Enter Agility, How to Be Agile?: Agile Methods, Don’t Make Your Own Method, The Road to
Mastery, Find a Mentor

UNIT II
Understanding XP: The XP Lifecycle, The XP Team, XP Concepts, Adopting XP: Is XP Right for
Us?, , Assess Your Agility

UNIT III
Practicing XP:
Thinking: Pair Programming, Energized Work, Informative Workspace, Root-Cause Analysis,
Retrospectives, Collaborating: Trust, Sit Together, Real Customer Involvement, Ubiquitous
Language, Stand-Up Meetings, Coding Standards, Iteration Demo, Reporting, Releasing:“Done
Done”, No Bugs, Version Control, Ten-Minute Build, Continuous Integration, Collective Code
Ownership, Documentation.

UNIT IV
Planning: Vision, Release Planning, The Planning Game, Risk Management, Iteration Planning,
Slack, Stories, Estimating. Developing: Incremental requirements, Customer Tests, Test-Driven
Development, Refactoring, Simple Design , Incremental Design and Architecture, Spike Solutions,
Performance Optimization, Exploratory Testing

18 | P a g e
UNIT V
Mastering Agility
Values and Principles: Commonalities, About Values, Principles, and Practices, Further Reading,
Improve the Process: Understand Your Project, Tune and Adapt, Break the Rules, Rely on
People :Build Effective Relationships, Let the Right People Do the Right Things, Build the Process
for the People, Eliminate Waste :Work in Small, Reversible Steps, Fail Fast, Maximize Work Not
Done, Pursue Throughput

UNIT VI
Deliver Value: Exploit Your Agility, Only Releasable Code Has Value, Deliver Business Results,
Deliver Frequently, Seek Technical Excellence :Software Doesn’t Exist, Design Is for Understanding,
Design Tradeoffs, Quality with a Name, Great Design, Universal Design Principles, Principles in
Practice, Pursue Mastery

Text Books: 1. James Shore and Shane Warden, “ The Art of Agile Development”, O’REILLY, 2007.

Reference Books:
1. Robert C. Martin, “Agile Software Development, Principles, Patterns, and Practices”, PHI, 2002.
2. Angel Medinilla, “Agile Management: Leadership in an Agile Environment”, Springer,
2012.
3. Bhuvan Unhelkar, “The Art of Agile Practice: A Composite Approach for Projects and
Organizations”, CRC Press.
4. Jim Highsmith, “Agile Project Management”, Pearson education, 2004.
5. Elisabeth Hendrickson, “Agile Testing” Quality Tree Software Inc., 2008.

Course Objectives:
To understand how an iterative, incremental development process leads to faster delivery of more
useful software.

Course Outcomes:
7. To understand the essence of agile development methods
8. To apply the principles and practices of extreme programming in real world problems.
9. To incorporate proper coding standards and guidelines in an agile process.
10. To optimize an agile process by exploring the possible risks and threats in the software process
11. To improve the process by eliminating waste
12. To design an agile process for a business application and deal with appropriate trade-off.

19 | P a g e
 Lesson Plan

S. No of
UNIT TOPIC BOOK
No. Lectures
1 Introduction to Agile Software Development 1 T1
2 Why Agile? Understanding success, Beyond
deadlines, The importance of organizational 1 T1
success, Enter agility
Unit-I
3 How to be Agile? Agile methods 1 T1
4 Agile Principles, Agile manifesto 1 T1
5 Don’t make your own method, The road to
1 T1
mastery, Find a mentor
Revision of concepts 1
Sub-Total 6
6 Understanding XP: The XP lifecycle 1 T1
7 XP Lifecycle: Planning, Analysis, Design,
2 T1
Coding, Testing
8 Unit - II The XP team, The Project Community 1 T1
9 XP concepts 1 T1
10 Adopting XP: Is XP right for us? Prerequisites,
2 T1
Recommendations, Assess your agility
Revision of concepts 1
Sub-Total 8
11 Unit -III Practicing XP. Thinking: Pair programming, 2 T1
12 Energized work 1 T1
13 Informative workspace, 1 T1
14 Root-Cause analysis, Retrospectives 1 T1
15 Collaborating: Trust 1 T1
16 Sit together 1 T1
17 Real customer involvement, Ubiquitous language,
1 T1
Stand-up meetings
18 Coding standards, Iteration demo, reporting 1 T1
19 Releasing: “Done Done”, No bugs, 1 T1
20 Version control, Ten-minute build 1 T1
21 Continuous integration, 1 T1

20 | P a g e
22 Collective code ownership, documentation 1 T1
Revision of concepts 2
Sub-Total 15

23 Planning: Vision, Release planning, 2 T1

24 The planning game 1 T1
25 Risk management 2 T1
26 Iteration planning 1 T1
27 Slack, Stories, Estimating 2 T1
28 Developing: Incremental requirements 1 T1
29 Unit-IV Customer tests 1 T1
30 Test-driven development 2 T1
31 Refactoring 1 T1
32 Simple design, Incremental design and
2 T1
architecture
33 Spike solutions, Performance optimization,
1 T1
Exploratory testing
Revision of concepts 2
Sub-Total 18
34 Mastering Agility. Values and Principles:
Commonalities, About values, principles, and 1 T1
practices
35 Improve the process: Understand your project,
1 T1
Tune and Adapt, Break the Rules
Unit-V
36 Rely on People: Build effective relationships 1 T1
37 Let the right people do the right things, Build the
1 T1
process for the people
38 Eliminate Waste: Work in small, reversible steps,
1 T1
Fail fast
39 Maximize work not done, Pursue throughput 1 T1
Revision of concepts 1
Sub-Total 7
35 Unit-VI Deliver Value: Exploit your agility, Only releasable
1 T1
code has value
36 Deliver business results, Deliver frequently 1 T1
37 Seek Technical Excellence: Software doesn’t exist, 1 T1
Design is for understanding

21 | P a g e
 38 Design trade-offs, Quality with a name, Great
1 T1
design,
39 Universal design principles, Principles in practice,
1 T1
Pursue mastery
Revision of concepts 1
Sub-Total 6
Total Lectures 60

Legend
T1: James Shore and Shane Warden, “The Art of Agile Development”, O’REILLY, 2007.

22 | P a g e
 REVIEW QUESTIONS

UNIT-I

1. What is Agile Software Development?

2. Briefly discuss the three areas that agile development focuses on for successful development of a
project?
3. Comment on the statement: Agile development isn’t a silver bullet.
4. What does it mean to “be agile”?
5. What are agile methods?
6. Enumerate the principles behind the agile manifesto.
7. Discuss the role of a mentor in agile development. List a few sources for identifying a mentor.
8. Identify two types of system development where agile methodology shall be very successful.

UNIT-II

1. Compare agile software development with traditional software development life cycle.
2. What is Extreme Programming?
3. Explain XP (eXtreme Programming) Lifecycle in detail with illustration.
4. Tabulate the principles and practices involved in Extreme Programming.
5. What should be the composition of the XP team? Analyze.
6. Justify the need of Domain Experts in an XP team.
7. What is the rule of thumb for including software testers in the XP team?
8. Discuss a situation in which customer involvement makes a huge difference in product success.
9. Typically, what is the length and frequency of iteration in XP? Justify.
10. List the important concepts in XP. Define an XP story.
11. Summarize the prerequisites that are to be met for effectively practicing XP.
12. What recommendations do you propose in order to achieve success in XP?
13. Develop a framework to assess your approach to XP (that is, are you properly applying agile practices
in your project?).

UNIT-III

1. Define ‘Pair Programming’.

2. Summarize the roles of Driver and Navigator in Pair Programming.
3. Critically examine the practice of ‘Energized Work’.
23 | P a g e
4. What do you understand by the term ‘Informative Workspace’?
5. Discuss ways to find and fix Root-Cause in a project.
6. What are the different types of retrospectives in XP? Explain how ‘Iteration Retrospective’ is
conducted.
7. Enumerate the eight practices that help the XP team and its stakeholders collaborate efficiently and
effectively.
8. Suggest some strategies by which trust among team members can be built over time.
9. What are the secrets of ‘Sitting Together’?
10. Bring out the importance of ubiquitous language among XP team members.
11. How to hold a ‘Stand-Up Meeting’?
12. Discuss the type of reports and its intended persons.
13. Explain the term ‘Done Done’ in XP.
14. Summarize the techniques in XP to achieve nearly zero bugs in your code.
15. What the benefits of collective code ownership?

UNIT-IV

1. What is a Vision Statement? Elaborate.

2. What are the approaches followed in Release Planning? Discuss.
3. Discuss the role of programmers and customers in a planning game.
4. Suggest ways to overcome disagreements during planning in XP.
5. Suppose your product manager doesn’t want to prioritize. He says everything is important. What will
be your strategy in such a situation in agile development?
6. What do you mean by ‘miracle of collaboration’ with respect to planning?
7. Define the terms: transition indicators, mitigation activity, contingency activity, and risk exposure.
8. How do we plan an Iteration in XP?
9. If we don’t estimate stories during iteration planning, when do we estimate stories?
10. How do you reduce the need for Slack in XP?
11. What are ‘Story Cards’/ Explain with an example.
12. How can we encourage stakeholders to use stories for requesting features?
13. Is it not a waste of time for all the programmers to estimate stories together?
14. Explain Test-Driven Development in detail.
15. Explain why test-first development helps the programmer to develop a better understanding of the
system requirements. What are the potential difficulties with test-first development?

24 | P a g e
16. What do you mean by ‘Spike Solutions’?

UNIT-V

1. List XP’s Values.

2. Suggest an easy way to reduce waste in software development.
3. Discuss the ways by which the agile process may be improved.
4. Comment on this agile principle: “Let the Right People Do the Right Things”.
5. Elaborate on the agile concept: “Fail fast”.
6. How do we minimize partially done work and wasted effort in agile development?

UNIT-VI

1. How does XP exploit agility? Give examples.

2. Do you agree with the statement “the most beautiful code in the world matters very little unless it does
what the customer wants”?
3. Using an example, demonstrate delivery of business results.
4. Comment: ‘Deliver small, deliver often’.
5. Briefly explain the following terms.
a. Software doesn’t exist
b. Design is for understanding
6. Bring out the qualities of good design.

25 | P a g e
 H.T No Regulations:
A15
Sreenidhi Institute of Science and Technology
(An Autonomous Institution)
Code No: 5EC24 Date: 23-Dec-2019 (AN)
B.Tech IV-Year I-Semester External Examination, December - 2019 (Supplementary)
AGILE SOFTWARE DEVELOPMENT (CSE)
Time: 3 Hours
Max.Marks:75
Note: a) No additional answer sheets will be provided.
b) All sub-parts of a question must be answered at one place only, otherwise it will not be
valued.
c) Missing data can be assumed suitably.

Part - A Max.Marks:25
ANSWER ALL QUESTIONS.
1. How will you measure the success of software development? [3M]
2. What is the need of continuous integration? [3M]
3. When we will go for automation? [3M]
4. How to create a vision statement? [3M]
5. List down the XP’s values. [3M]
6. Relate the term design and understanding. [2M]
7. Mention the role of Mentor in software development. [2M]
8. What is called ten-minute build? [2M]
9. Explain the term don’t repeat yourself. [2M]
10. Why we need to organize the backlog? [2M]

Part – B
Max.Marks:50
ANSWER ANY FIVE QUESTIONS. EACH QUESTION CARRIES 10 MARKS.
11. a) How will you achieve a personal success? [5M]
b) Write about Technical success. [5M]

12. a) Explain the steps in applying XP in a phase-based organization. [6M]

b) When will you recommend a new code base? [4M]

13. a) Why we need to make work-in progress documentation? [5M]

b) Write about collective code ownership. [5M]

14. a) How will you track the iterations? [6M]

b) Why we need to fail fast? [4M]

15. a) Explain the term “Right people do the right things”. [5M]

26 | P a g e
 b) What is the need for building effective relationships? [5M]

16. a) Write the various universal design principles. [5M]

b) Discuss about only releasable code has value. [5M]

17. a) How agility helps in organizational success? [4M]

b) What is the role of XP team in software development? [3M]
c) How to achieve nearby zero bugs? [3M]

18. a) Write about once and only once related to software development. [4M]
b) Why we need to break the rules? [3M]
c) How to eliminate technical debt? [3M]
-- 00 -- 00 –

27 | P a g e
SREENIDHI INSTITUTE OF SCIENCE & TECHNOLOGY
(AN AUTONOMOUS INSTITUTION UNDER JNTUH)
(Approved by AICTE & Aided by World Bank under TEQIP )
Yamnampet, Ghatkesar Mandal, Hyderabad - 501 301.

COURSE FILE

For

SOFTWARE AUTOMATION AND TESTING

For

B. Tech. IV year - I Semester

CSE BRANCH

DEPARTMENT
OF
COMPUTER SCIENCE AND ENGINEERING

28 | P a g e
 1 2 3 4 5 6 7 8 9 10 11 12
H M M M
H: High M: Medium L: Low
Syllabus for B. Tech. IV Year I semester
Computer Science and Engineering
SOFTWARE AUTOMATION AND TESTING

Code: 7F719 L T P C
Course Objectives: 2 1 - 3
To Understand the Basic concepts in Software testing, concepts
of Flow graphs, Path testing and  Data Flow Testing, understand the concept of metrics and their
types. Understand and implement various testing techniques and to make a thorough study on various
testing tools. Set a strategy for testing environment and to learn the testing methodologies in detail.
Course Outcomes:
At the end of this course, the student will be able to
1. Describe concepts of Software testing
2. Describe and apply the concepts Flow graphs, Path testing and Data Flow Testing.
3. Practice Software testing strategy and Environment with economics and apply Software Metrics
useful in software development and maintenance.
4. Software Testing Methodology, finding defects hard to find, Verification and validation, Func-
tional and structural, Workbench concept, Eight Consideration of software testing methodology,
checklist. Describe Agile computing with agile testing
5. Demonstrate Software Testing Techniques such as JADs, Pareto Analysis , Regression Tasting,
Structured walkthroughs, Thread testing , Performance testing and White box testing.
6. Describe Graph matrices and applications, and practice and apply automated testing tools such
load Runner, UFT and QTP.

UNIT I
What is Testing, Characteristics of Test Engineers, Software Testing Life Cycle, Levels of Testing,
Testing Approaches, Test Cases: Format for Writing Test Case, Test plan: Format to prepare Test
plan
Purpose of testing, Dichotomies, Consequences of bugs

UNIT II
Flow graphs and Path testing: Basics concepts of path testing, predicates, path predicates
and achievable paths, application of path testing. 
Data Flow Testing: Basics of Data flow Testing
Logic Based Testing : Decision Tables

UNIT III
Software testing strategy and Environment, Establishing testing policy, structured approach to testing,
Test factors, Economics of SDLC testing.
29 | P a g e
Software Metrics:  Software Quality, Metrics for Analysis Model, Metrics for Design Model, Metrics
for source code, Metrics for testing, Metrics for maintenance.

UNIT IV
Software Testing Methodology, Defects hard to find, Verification and validation, Functional and
structural, Defects and Failures, Testing that parallels the software Development process, Workbench
concept, Eight Consideration of software testing methodology, testing tactics checklist. Importance of
Agility, Building an Agile Testing Process

UNIT V
Software Testing Techniques, Black-box, Boundary value, Branch coverage, Cause Effect graphing,
CRUD, Database, Histogram, Gray box, Inspections, JADs, Pareto Analysis , Prototyping , Random
Testing, Risk based testing , Regression Testing, Structured walkthroughs, Thread testing ,
Performance testing, Stress Testing, Accepting Testing, White box testing, Alpha and Beta Testing.

UNIT VI
Graph matrices and application: Motivational overview, matrix of graph, relations, power of a matrix,
node reduction algorithm.
Need for Automated testing tools, Taxonomy of Testing Tools, Exposure to Software Testing Tools:
Load Runner, UFT and QTP.

TEXT BOOKS
1. Software testing techniques – Boris Beizer, Dreamtech, second edition.(Unit 1,2,6)
2. Software testing tools – by Dr. K.V.K.K Prasad Dreamtech (Unit 1,6)
3. Effective Methods for Software Testing, 2nd Edition by William E.Perry, Wiley publications.(Unit
3,4)
4. Software Testing and continuous Quality Improvement, by William E.Lewis,Gunasekaran,2nd Edi-
tion Auerbach publications (Unit 5,Refer Internet)
5. Software Engineering A practitioner’s Approach, Roger S Pressman, 6th edition. McGrawHill In-
ternational Edition (Unit 3) 

REFERENCES
1. Software Testing Techniques ,by Bories Beizer, Second Edition,Dreamtech Press
2. Testing and Quality Assurance for Component based software ,by Gao,Tsao and Wu,Artech
House Publishers
3. Managing the Testing Process,by Rex Black,Wiley.
4. Handbook of Software Quality Assurance, by G.Gordon Schulmeyer,James I.McManus,2 nd
Edition,International Thomson Computer Press

30 | P a g e
 Department of Computer Science & Engineering
Teaching Schedule
SOFTWARE AUTOMATION AND TESTING

Lecture Schedule

Unit – 1
S.N No. of
o. Lectures Name of the Topic
1 1 Introduction, What is Testing
2 1 Characteristics of Test Engineers
3 2 Software Testing Life Cycle, Levels of Testing.
4 1 Testing Approaches
5 2 Test Cases: Format for Writing Test Case
6 1 Test plan: Format to prepare Test plan
7 2 Purpose of testing
8 2 Dichotomies, Consequences of bugs
Unit – 2
9 1 Basics concepts of path testing,
Predicates, path predicates and 
10 3 achievable paths, application of path testing

11 3 Data Flow Testing: Basics of Data flow Testing

Logic Based Testing : Decision Tables
12 3

Unit - 3
Software testing strategy and Environment, Establishing testing policy
13 2

14 1 Structured approach to testing

Test factors, Economics of SDLC testing.
15 2

16 1 Software Metrics :Software Quality, Metrics for Analysis Model

Metrics for Design Model, Metrics for source code, Metrics for testing,
17 3 Metrics for maintenance

Unit – 4
Software Testing Methodology: Defects hard to find, Verification and
18 1 validation.

31 | P a g e
19 1 Functional and structural, Defects and Failures
20 1 Testing that parallels the software Development process
21 1 Workbench concept, testing tactics checklist
Eight considerations in developing testing methodologies,
22 3
IImportance of Agility, Building an Agile Testing Process
23 2
Unit – 5

24 1 Black-Box, Boundary value,

25 1 Bottom-up, Branch coverage

26 1 Cause-Effect graphing, CRUD,

27 1 Database, Gray-Box,

28 2 Inspections, JADs, Alpha and Beta testing

29 1 Prototyping, Random Testing

30 1 Histograms, Pareto Analysis
31 1 Structured Walkthroughs, Thread Testing
32 1 Performance Testing, Regression Testing
33 1 White-Box Testing, Risk based Testing
Unit -6
34 2 Graph Matrices and Application: Motivational Overview
35 1 Matrix of Graph
36 2 Relations and Power of Matrix
37 2 Node Reduction Algorithm
38 3 Exposure to SoftwareTesting Tools: Load Runner
39 3 WinRunner and QTP

Total No. of classes : 64

Available Classes : 65

32 | P a g e
 SOFTWARE AUTOMATION AND TESTING

Course Objectives:

To Understand the Basic concepts in Software testing, concepts of Flow graphs, Path testing and
Data Flow Testing, understand the concept of metrics and their types. Understand and implement
various testing techniques and to make a thorough study on various testing tools. Set a strategy for
testing environment and to learn the testing methodologies in detail.

Course Outcomes: After completing this course, student shall be able to

1. Describe concepts of Software testing
2. Describe and apply the concepts Flow graphs, Path testing and Data Flow Testing.
3. Practice Software testing strategy and Environment with economics and apply Software
Metrics useful in software development and maintenance.
4. Software Testing Methodology, finding defects hard to find, Verification and validation,
Functional and structural, Workbench concept, Eight Consideration of software testing
methodology, checklist. Describe Agile computing with agile testing
5. Demonstrate Software Testing Techniques such as JADs, Pareto Analysis , Regression
Tasting, Structured walkthroughs, Thread testing , Performance testing and White box test-
ing.
6. Describe Graph matrices and applications, and practice and apply automated testing tools
such load Runner, UFT and QTP.

33 | P a g e
 SOFTWARE AUTOMATION AND TESTING

Unit-1
Short Questions

1. Define Testing ?
2. Explain the characteristics of Testing ?
3. Who are involved in Testing ?
4. Define Test Case ?
5. What is the Test Plan?
6. Give the Levels of Testing?
7. In Requirement phase, what are the different validation activities to be performed?
8. What is the difference between the Testing and Debugging?
9. In Test phase, what are the different validation activities to be performed?
10. In Program phase, what are the different validation activities to be performed
11. In Maintenance phase, what are the different validation activities to be performed?
12. Give the IEEE format to prepare the test cases?
13. Define bug?
14. What is the difference between normal SDLC and SDLC Testing?
15. What are the goals of Testing
16. What are Different phases of Testing?

Essay Questions
1. What is the purpose of testing? List out the various dichotomies and explain.
2. List out the nightmares and explain when to stop testing.
3. What are the principles of test case design? Explain.
4. What is meant by Software Testing? Discuss clearly the purpose of testing.
5. Discuss in detail various phases in a Tester’s Mental life.

6. Explain the importance of bugs.

7 . Write the test plan document for known application.

34 | P a g e
8. What is test case? Write the test cases to Validate the ATM CARD.
9. Discuss in detail how the consequences of bugs are measured?
10. What are the possible consequences of bugs?
11. Explain in details the factors on which the importance of bugs depend
12. Explain Software Testing Life Cycle(STLC)

Software Testing
Unit-II
Short Questions
1. Define Path Testing.
2. What is Statement Coverage?
3. Define Branch Coverage?
4. What is Data flow Testing
5. What is Decision Tables?
6 Define Predicate and Path Predicate?
7. Define the term Module.
8. What is the accumulated cost for normal SDLC and SDLC testing? Which one is
preferable?

Essay Questions

1. Compare and contrast between control flow graphs and flow charts.
2. Give a detailed note on path testing.
3. Explain applications of paths, path products and regular expressions.
4. What is meant by statement coverage and branch coverage?
5. Discuss the role of decision table in a test case design.
6. Explain in Details about Data flow testing with neat sketch
7. Explain the expansion of the immaterial cases in the decision table. ?

35 | P a g e
 Software Testing
Unit-III
Short Questions

1. What are the two purposes of Testing Policy ?

2. What is the criteria for a Testing Policy ?
3. How many people involved in preparing Testing Policy?
4. How many methods are there to establish a policy?
5. What is the disadvantage of Organizational policy?
6. User Meeting is a what type of policy?
7. In Requirement phase, what are the different verification activities to be performed?
8. In Design phase, what are the different verification activities to be performed?
9. Give the examples for the Factors that can be directly measured?
10. Give the examples for the Factors that can be indirectly measured?
11. Define the terms metric, measurement and measure?
12. Abbreviate FP?
13. Who proposed FP?
14. What are the different parameters for computing FP?
15. Give the formula for FP?
16. What are the different value adjustment factors?
17. Compute the formula for Structural complexity?
18. Compute the formula for Data complexity?
19. Compute the formula for System complexity?
20. Compute the formula for Shape complexity?
21. Abbreviate DSQI?
22. Give the formula for DSQI?
23. Give the formula to compute Overall program length N ?
24. How Program Volume may be defined?
25. Who Proposed the Metrics for source code?
26. Give the formula for Program Level and Effort?
27. Give the formula for Product metric for maintenance?

36 | P a g e
28. Abbreviate SMI? And give the formula for SMI?
29. What is mean by LOC and KLOC?
30. Formula for DRE?
31. Abbreviate DRE?

Essay Questions
1. Explain how to establish the Testing Policy?
2. Explain various ways to establish a Testing Policy?
3. Explain the Criteria and methods used to establish a Testing Policy?
4. Explain Structured Approach to testing?
5. Explain the Economics of System Development Life Cycle testing?
6. What are the different Test Factors and explain in detail?
7. Explain in detail about Products metrics for Analysis,design, coding, testing and
maintenance?
8. Explain Process Measurements? And give the reasons for measurements?
9. Explain Size oriented Metrics with suitable example?
10. Define FP? And explain the computation of FP?
11. Explain in detail about Metrics for software Quality?
12. Compute the Cyclomatic Complexity with suitable example?
13. Explain how to establish the software quality requirements? And explain how to
implement the collected data?

Software Testing
Unit-IV
Short Questions
1. Give two reasons for defect go undetected?
2. What is mean by user specify the wrong requirements? Justify it
3. What is V & V?
4. Requirement review is performed by whom?
5. Design review is performed by whom?
37 | P a g e
6. Code inspection review is performed by whom
7. Unit testing is performed by whom?
8. Integration Testing is performed by whom?
9. System Testing is performed by whom?
10. User Acceptance Testing is performed by whom?
11. Functional testing takes whose point of view?
12. What are the components of Workbench?

Essay Questions

1. Explain in detail why Defects hard to find?.

2. Give the differences between below terms
i) Verification Vs Validation
ii) Functional Vs Structural Testing
3. Explain the below terms?
a) Code Walkthrough b) Code inspection c) Unit Testing
d) Integration testing e) System testing f) Formal Review
g) Technical Review
4. Explain in detail about Workbench concept?
5. Explain the Programmer’s workbench concept and list the steps involved in it?
6. Explain the Eight Considerations in Developing Testing Methodology
7. With neat sketch explain Agile Testing process

Software Testing
Unit-V
Short questions

1. What is black box testing?

2. What are the advantages of Black box testing?
3. Black box testing is done by whom?
4. What is white box testing?
5. What is the differences between white box and black box testing ?
6. Black box testing also known as?

38 | P a g e
7. What is gray box testing?
8. What is white box testing?
9. What is Sandwitch testing?
10. What is performance testing?
11. Abbreviate BVA and EP?
12. What is incremental integration testing?
13. What is Regression Testing?
14. What is Alpha and Beta Testing?
15. What is bottom-up integration testing?
16. What is top-down integration testing?
17. what is thread testing?
18. what is Random testing
19. What is Risk based testing?
20. Define the term ‘UNIT TESTING’.
21. Define the term ‘COMPONENT TESTING’.
22. Define the term ‘INTEGRATION TESTING’.
23. Define the term ‘SYSTEM TESTING’

Essay Questions

1. Explain different software testing techniquces?

2. Explain the below terms
i) White box testing ii) Black box testing iii) Gray box testing
3. Explain Cause Effect Graphing with suitable example?
4. What is integration testing? And explain the different types of integration testing?
5. Abbrevate CRUD and explain?

6. Give the brief note for the following

a) Histograms
b) Pareto Analysis
7. What is system testing? And explain different techniques used to perform system testing?

39 | P a g e
 .
Software Testing
Unit-VI
Short Questions
1. What is a graph matrix?
2. Write the node reduction algorithm.
3. What is partitioning algorithm?
4. What are matrix operations?
5. What are partial order relations?
6. What is Ad-hoc testing?
7. What is usability testing?
8. What is User-Acceptance testing?
9. What is Automation?
10. What does a predicate calculator do ?
11. What does a logic analyzer do ?
12. What does a domain processor do ?
13. Advantages of Automation testing?
14. Differences between Manual and Automation testing?
15. What are the different bug tracking tools?
16. What are the different test management tools?
17. What is SRS?
Essay Questions

1. Explain in detail the node reduction algorithm.

2. Explain all the relations that exist in matrix of a graph.
3. Explain partitioning algorithm.
4. Explain the different categories of testing tools available in market?.
5. Explain the Methodology to evaluate automated testing tools?
6. Majority of testing is done manually why? What is the difference between manual testing
and Automation testing?
7. Write the node-by-node removal algorithm for converting a flow graph into path expression

40 | P a g e
41 | P a g e
 H.T No
Sreenidhi Institute of Science and Technology Regulations:
(An Autonomous Institution) A17
Code No:6EC11 Date: 15-Mar-2021(FN)
B.Tech IV-Year I- Semester External Examination, March/April - 2021 (Regular)
SOFTWARE AUTOMATION AND TESTING (CSE and IT)
Time: 3 Hours Max.Marks:75
Note: a) No additional answer sheets will be provided.
b) All sub-parts of a question must be answered at one place only, otherwise it will not be
valued.
c) Missing data can be assumed suitably.

ANSWER ANY 5 OUT OF 8 QUESTIONS. EACH QUESTION CARRIES 15 MARKS.

Bloom's Cognitive Levels of Learning (BCLL)

Remember L1 Apply L3 Evaluate L5

Understand L2 Analyze L4 Create L6

BC CO(s) Marks
LL
1. a) Discuss the various levels of testing in detail. L2 CO1 [8M]
b) Summarize the beliefs that many programmers and testers have L2 CO1 [7M]
about bugs?

2. a) What is data flow testing? Explain with a sample snippet of code. L2 CO2 [8M]
b) Discuss the various cases in loops for performing path testing. L2 CO2 [7M]

3. a) Define metric. Discuss in detail the various metrics for analysis L2 CO3 [8M]
model.
b) Devise a testing strategy taking into consideration a case study like L6 CO3 [7M]
an online shopping cart application.

4. a) What are the steps involved in building an agile testing process? L2 CO4 [8M]
Discuss.
b) Explain in detail the eight considerations of software testing L2 CO4 [7M]
methodology.

5. a) Discuss the various black box testing techniques with appropriate L2 CO5 [8M]
examples.
b) What is cyclomatic complexity? Discuss its use in statement L2 CO5 [7M]
coverage testing.

6. a) Explain the node reduction algorithm using an example. L2 CO6 [8M]

b) Give the taxonomy of automated testing tools. L2 CO6 [7M]

7. a) Write a brief note on the consequences of bugs. L1 CO1 [5M]

b) Describe fundamentals of Path Selection Criteria with example. L1 CO2 [5M]
42 | P a g e
 c) Write short notes on metrics for maintenance of software. L1 CO3 [5M]

8. a) Discuss the importance of Agility in testing. L2 CO4 [5M]

b) What is Regression Testing? Explain how and when is it performed? L2 CO5 [5M]
c) Write short notes on QTP. L1 CO6 [5M]

43 | P a g e
SREENIDHI INSTITUTE OF SCIENCE & TECHNOLOGY
(An Autonomous Institution approved by UGC and affiliated to JNTUH))
(Accredited by NAAC with ‘A” Grade, Accredited by NBA of AICTE and
Recipient of World Bank under TEQIP-I and II )
Yamnampet, Ghatkesar Mandal, Hyderabad - 501 301.

COURSE FILE

FOR

INFORMATION SECURITY
FOR

B. Tech. IV year - I Semester

CSE Branch

DEPARTMENT OF

COMPUTER SCIENCE & ENGINEERING

September -2021

44 | P a g e
 1 2 3 4 5 6 7 8 9 10 11 12
H H
Syllabus for B. Tech. IV Year I semester
Computer Science and Engineering
Information Security
L T P C
Code: 7EC08
2 1 0 3
Prerequisite : Computer Networks

Course Objectives: To learn the fundamental concepts of security attacks, security services.To apply
conventional cryptographic techniques in order to do encryption.To apply Public key cryptography
techniques in order to do encryption.To learn IP security Architecture and its role in security
framework.To apply SSL and TLS for Web Security.To design and develop Intrusion Detection
Systems and Firewall.

Course Outcomes

At the end of this course, the student will be able to

1. Get familiarized with the fundamental concepts of security attacks, security services.
2. Implement the conventional cryptographic techniques.
3. Simulate the Public key cryptography techniques.
4. Comprehend IP security Architecture and its role in security framework.
5. Implement SSL and TLS for Web Security.
6. Design Intrusion Detection Systems and Firewall.

UNIT – I: Security Attacks (Interruption, Interception, Modification and Fabrication), Security

Services (Confidentiality, Authentication, Integrity, Non-repudiation, access Control and Availability)
and Mechanisms, A model for Internetwork security, Internet Standards and RFCs.

UNIT – II : Conventional Encryption Principles, Conventional encryption algorithms: DES, TDES,

AES, cipher block modes of operation, location of encryption devices, key distribution, Approaches
of Message Authentication, Secure Hash Functions: SHA1 and HMAC.

UNIT – III : Public key cryptography principles, public key cryptography algorithms: RSA, DIFFIE
HELL MAN, digital signatures, digital Certificates, Certificate Authority and key management
Kerberos, X.509 Directory Authentication Service. Email privacy: Pretty Good Privacy (PGP) and
S/MIME.

UNIT - IV
IP Security Overview, IP Security Architecture, Authentication Header, Encapsulating Security
Payload, Combining Security Associations and Key Management.
45 | P a g e
UNIT – V
Web Security Requirements, Secure Socket Layer (SSL) and Transport Layer Security (TLS), Secure
Electronic Transaction (SET). Intruders, Viruses and related threats.

UNIT – VI: Firewall Design principles, Trusted Systems. Intrusion Detection Systems.

TEXT BOOKS:
1. Network Security Essentials (Applications and Standards) by William Stallings Pear-
son Education, 4th Edition.
2. Hack Proofing your network by Ryan Russell, Dan Kaminsky, Rain Forest Puppy, Joe
Grand, David Ahmad, Hal Flynn Ido Dubrawsky, Steve W.Manzuik and Ryan Permeh, wiley
Dreamtech

REFERENCES:
1. Fundamentals of Network Security by Eric Maiwald (Dreamtech press)
2. Network Security - Private Communication in a Public World by Charlie
Kaufman, Radia Perlman and Mike Speciner, Pearson/PHI.
3. Cryptography and network Security, Third edition, Stallings, PHI/Pearson
4. Principles of Information Security, Whitman, Thomson.
5. Network Security: The complete reference, Robert Bragg, Mark Rhodes,
TMH
6. Introduction to Cryptography, Buchmann, Springer.

46 | P a g e
 Lecture Schedule

Sl. No. Number of Periods

Unit
No. Topics to be covered
1 Security Attacks (Interruption, Interception,
(Modification and Fabrication)
2 Security Services (Confidentiality, Authentication,
Integrity, Non–Repudiation, Access Control and
I 10 Availability)
3. Mechanisms, A model for Inter network security
4. Internet Standards and RFCs
5 Conventional Encryption Principles,
6 Conventional encryption algorithms,

7 cipher block modes of operation,

8 15 location of encryption devices,

9 II key distribution Approaches of Message
Authentication,
10 Secure Hash Functions
11 HMAC
12 Public key cryptography principles
13 Public key cryptography algorithms
14 digital signatures
15 digital Certificates
16 Certificate Authority
17 key management Kerberos
III 20
18 X.509 Directory Authentication Service
Email Privacy
19
20 Pretty Good Privacy(PGP)
21 S/MIME

47 | P a g e
22 IP Security Overview
23 IP Security Architecture
24 Authentication Header
10
25 Encapsulating Security Payload
26 Combining Security Associations
27 Key Management
IV
28 Web Security Requirements

29 Secure Socket Layer (SSL) and

15
30 Transport Layer Security (TLS)
31 Secure Electronic Transaction (SET)
32 Intruders
V
33 Viruses
34 related threats
35 Firewall Design principles,

36
8 Trusted Systems
37 Intrusion Detection Systems

VI

48 | P a g e
 UNIT I

1. What is the difference between threat and attack?

2. What is the difference between passive attacks and active attacks?
3. Define the terms: Confidentiality, Authentication, Integrity, Non-repudiation, access Control
and Availability?
4. What is Inter network security model?
5. Explain Security Services.
6. Illustrate model for Network Security.
7. Differentiate between Specific Security mechanisms and Pervasive security mechanisms.

UNIT-II

1. Explain DES algorithm. Write notes on Cryptanalysis and Brute Force attack.
2. Write notes on Cipher Block Chaining (CBC) mode and Cipher Feedback Mode (CFB) of op-
eration
3. Explain the operations of AES in detail with neat sketch.
4. Explain SHA algorithm. Also deliberate on SHA compression function.

UNIT-III

1. Mention the principles/requirements of Public key cryptography

2. Explain public key cryptography algorithms of RSA or Diffie-Hellman with examples.
3. Write notes on X.509 Directory Authentication Service.
4. Write notes on Digital Signatures.
5. a) Explain the five principal services provided by PGP.
b) Discuss the functions provided by S/MIME.

Unit IV
1 What parameters identify an SA and what parameters characterize the nature of a particular
SA?
2 Explain IPSec Authentication Header with a neat diagram.
3 Explain IPSec ESP Header with a neat diagram.
4 Explain the benefits of IPSec.
5 Explain the routing applications of IPSec.
6 Explain IPSec Document Overview with a neat diagram.
7 What are the services provided by IPSec? Explain.
49 | P a g e
8 Briefly explain Transport mode and Tunnel mode.
9 What parameters identify SA and what parameters characterize the particular nature of SA?
10 Write short notes on
a. ISAKMP
b. OAKLEY

UNIT V
1. Explain the Handshake protocol of SSL.
2. What are the various services provided by SSL? Explain.
3. Explain SSL Architecture?
4. What is the difference between Connection and Session?
5. Explain SSL record protocol with operation (diagram)?
6. What is a dual signature and what is its purpose?
7. Write notes on TLS.
8. Compare SSL and TLS.
9. Write short note on SET.
10. Explain how payment is processed with the help of dual signature in SET.
11. Describe the components of SET.
12. List the key features of SET and explain the same.
13. What are two common techniques used to protect a password file?
14. What are the typical phases of operation of a Virus?

UNIT-VI

1. Explain the measures that may be used for intrusion detection for the following activities:
a) Login and session activity
b) Command or program execution activity
c) File access activity.
2. List and briefly define three classes of Intruders.
3. Write short notes on Intrusion Detection Techniques.
4. Briefly explain Rule-Based Intrusion detection.
5. Explain circuit-level gateway firewall.
6. Write short notes on Data Access Control of a Trusted System.
7. What are the design goals of a firewall?
8. Explain Firewalls and its types.
9. What four techniques used by the firewalls to control access and enforce a security policy?
10. Explain Configuration of Firewall.
11. Explain trusted systems.
12. Explain Trojan Hores Defense system?

50 | P a g e
Exercises:

1) a) Perform Encryption & Decryption of RSA algorithm for the following

i) p =3 ,q=11,e=7,M=5
ii) p =5 ,q=11,e=3 ,M=9
iii) p =7 ,q=11,e=17,M=8
b) In a public-key system using RSA,you intercept the ciphertext C = 10 sent to a user whose
public key is e=5,n=35.What is the plaintext M?
c) In RSA system ,the public key of a given user is e = 31,n = 3599.What is the private key of
this user?

2) a) If user A has private key XA = 5,use Diffie-Hellman key exchange algorithm where
α = 7 & common prime q = 71.Find A’s public key.
b) If user B has private key XB = 12.Use above α & q and find B’s public key.
c)Use above (a) & (b) and find shared secret key.

3) Use Diffie-Hellman key exchange algorithm with α = 2,q =11,show that 2 is a primitive root
of 11.
If YA = 9 What is XA ?
If YB = 3 What is XB & find secret key.

4) Explain Digital Certificate.

5) Explain Kerberos version 4 dialogue.
6) End-to-End Authentication & Encryption are desired between two hosts.Draw figures showing
Headers and packets for the following.
a) Transport SA bundle inside a Tunnel SA, with Encryption applied before Authentication.
b) Transport SA bundle inside a Tunnel SA, with Authentication applied before Encryption .
c) Transport adjacency with Encryption applied before Authentication.
7) What is Dual Signature?
8) What is the purpose of Dual Signature? Explain sequence of operatios in SET.

51 | P a g e
 Sreenidhi Institute of Science & Technology A12
(An Autonomous Institution)
Code No: 3FC11
B. TECH. III – Year II – Semester Examinations, May 2015 (Regular)
INFORMATION SECURITY (CSE)
Time: 3 Hours Max. Marks: 70

Note: No additional answer sheets will be provided.

Part - A Max.Marks:20
ANSWER ALL QUESTIONS.
1. What is Authentication?
2. What do you mean by Encryption?
3. What is Cryptography?
4. What are the different fields of authentication header?
5. List the four protocols in SSL.
6. What is an intrusion detection system?
7. What are the approaches of message authentication?
8. What is a digital certificate?
9. What are the different types of viruses?
10. Explain RFC?
Part – B Max.Marks:50
ANSWER ANY FIVE QUESTIONS. EACH QUESTION CARRIES 10 MARKS.

1. What are the different security attacks and services? Explain them.

2. (a) How the hash function is generated using SHA-1?

(b) Explain the various steps involved in the HMAC algorithm.
3. (a)  Compare and contrast between Cryptography and Cryptology.
(b) Discuss the services of PGP with neat figures.

4. (a) Explain briefly about encapsulating security payload.

(b) Explain the key management in IP security.
5. (a) Explain the different intruders in detail?
(b) What are the features of SET? Show diagrammatically how the customer makes a
purchase request to the merchant.

6. (a)  What is a firewall? Explain the capabilities that are within the scope of a firewall.
(b) What are the measures that may be used for intrusion detection?

7. Discuss in detail the process of encryption and decryption in AES algorithm.

8. (a) Explain briefly about Trusted systems.
(b) How web security is provided by SSL and TLS?
-- 00 -- 00 --

52 | P a g e
 SET-2
H.T No Regulations:
Sreenidhi Institute of Science and Technology A15
(An Autonomous Institution)
Code No: 5FC11 Date: 15-Dec-2018 (FN)
B.Tech IV-Year I-Semester End External Examination, Nov/Dec - 2018 (Regular)
INFORMATION SECURITY (IT)
Time: 3 Hours Max.Marks:75
Note: a) No additional answer sheets will be provided.
b) All sub-parts of a question must be answered at one place only, otherwise it will not be
valued.
c) Missing data can be assumed suitably.

Part - A Max.Marks:25
ANSWER ALL QUESTIONS.
1. Give examples of applications of IPsec. [3M]
2. What is the difference between an SSL connection and an SSL session? [3M]
3. Differentiate between modification and fabrication. [3M]
4. Distinguish between stream cipher and block ciphers. [3M]
5. Enumerate uses of public key cryptography. [3M]
6. Define virus. [2M]
7. Write three design goals for a firewall. [2M]
8. What are three benefits that can be provided by an intrusion detection system? [2M]
9. What is the significance of RFC? [2M]
10. List MIME content types. [2M]
Part – B Max.Marks:50
ANSWER ANY FIVE QUESTIONS. EACH QUESTION CARRIES 10 MARKS.
11. a) Describe IPSec architecture with neat diagram. [7M]
b) Mention different techniques defined by IPSEC for key management? [3M]
12. a) What is web security? Discuss web security considerations. [5M]
b) Explain how SSL provide confidentiality using symmetric encryption and [5M]
message integrity using MAC.
13. a) Explain packet filtering router with merits and demerits. [5M]
b) Describe the working principle of HIDPS. [5M]
14. a) List and define categories of security mechanisms. [5M]
b) Describe the model for network security with neat sketch. [5M]
15. a) Why do some block cipher modes of operation only use encryption while [5M]
others use both encryption and decryption?
b) Explain how secure hash function is alternative to MAC. [5M]

53 | P a g e
16. a) Discuss RSA algorithm with an example. [5M]
b) Explain about pretty good privacy method for electronic mail security. [5M]
17. a) Explain man in-middle attack in network. [3M]
b) What properties must a hash function have to be useful for message [3M]
authentication?
c) Write notes on digital signature. [4M]
18. a) What are the basic approaches to bundling Security Associations? Explain in [3M]
brief.
b) List and explain SET transaction types. [4M]
c) Write short notes on honeypot. [3M]
-- 00 -- 00 –

54 | P a g e
 Sreenidhi Institute of Science and Technology Regulations:
(An Autonomous Institution) A14
Code No: 4F711 Date: 15-Dec-2018 (FN)
B.Tech IV-Year I-Semester External Examination, Nov/Dec - 2018 (Supplementary)
INFORMATION SECURITY (IT)
Time: 3 Hours Max.Marks:70
Note: a) No additional answer sheets will be provided.
b) All sub-parts of a question must be answered at one place only, otherwise it will not be valued.
c) Missing data can be assumed suitably.

Part - A Max.Marks:20
ANSWER ALL QUESTIONS.
1. Differentiate between modification and fabrication. [2M]
2. Distinguish between stream cipher and block ciphers. [2M]
3. Enumerate uses of public key cryptography. [2M]
4. Give examples of applications of IPsec. [2M]
5. What is the difference between an SSL connection and an SSL session? [2M]
6. What are three benefits that can be provided by an intrusion detection system? [2M]
7. What is the significance of RFC? [2M]
8. List MIME content types. [2M]
9. Define virus. [2M]
10. Write three design goals for a firewall. [2M]
Part – B Max.Marks:50
ANSWER ANY FIVE QUESTIONS. EACH QUESTION CARRIES 10 MARKS.

11. a) List and define categories of security mechanisms. [5M]

b) Describe the model for network security with neat sketch. [5M]
12. a) Why do some block cipher modes of operation only use encryption while others [5M]
use both encryption and decryption?
b) Explain how secure hash function is alternative to MAC. [5M]
13. a) Discuss RSA algorithm with an example. [5M]
b) Explain about pretty good privacy method for electronic mail security. [5M]
14. a) Describe IPSec architecture with neat diagram. [7M]
b) Mention different techniques defined by IPSEC for key management? [3M]
15. a) What is web security? Discuss web security considerations. [5M]
b) Explain how SSL provide confidentiality using symmetric encryption and message [5M]
integrity using MAC.
16. a) Explain packet filtering router with merits and demerits. [5M]
b) Describe the working principle of HIDPS. [5M]
17. a) Explain man in-middle attack in network. [3M]
55 | P a g e
 b) What properties must a hash function have to be useful for message [3M]
authentication?
c) Write notes on digital signature. [4M]
18. a) What are the basic approaches to bundling Security Associations? Explain in brief. [3M]
b) List and explain SET transaction types. [4M]
c) Write short notes on honeypot. [3M]
-- 00 -- 00 –

H.T No 56 |Page
Regulations:
A15
 Sreenidhi Institute of Science and Technology
(An Autonomous Institution)
Code No: 5FC11 Date: 14-Dec-2019 (AN)
B.Tech IV-Year I-Semester External Examination, December - 2019 (Supplementary)
INFORMATION SECURITY (CSE & IT)
Time: 3 Hours Max.Marks:75
Note: a) No additional answer sheets will be provided.
b) All sub-parts of a question must be answered at one place only, otherwise it will not be
valued.
c) Missing data can be assumed suitably.

Part - A Max.Marks:25
ANSWER ALL QUESTIONS.
1. Enumerate the mechanisms implemented for confidentiality. [3M]
2. Compare stream cipher and block cipher with an example. [3M]
3. In an RSA system, the public key of a given user is e = 31, n = 3599. What is the private [3M]
key of this user?
4. What services are provided by IPsec? [3M]
5. Define Intruders. [3M]
6. List the design principles of firewall. [2M]
7. What characteristics are needed in a secure hash function? [2M]
8. What is the significance of the X.509 standard? [2M]
9. Give any two benefits that can be provided by an intrusion detection system. [2M]
10. Why do some block cipher modes of operation only use encryption while others use both [2M]
encryption and decryption?

Part – B Max.Marks:50
ANSWER ANY FIVE QUESTIONS. EACH QUESTION CARRIES 10 MARKS.
11. a) Discuss the security services required to counter various types of Active and [5M]
Passive attacks.
b) Describe the model for internetwork security with neat Diagram. [5M]
12. a) Draw the general structure of DES. Explain the encryption and decryption [5M]
process.
b) Describe HMAC algorithm. [5M]
13. a) Briefly explain Deffie Hellman key exchange with an example. [5M]
b) Explain how S/MIME is better than MIME. [5M]
14. a) With a neat sketch, describe IP Security architecture. [6M]
b) What are the basic approaches of building Security Associations? Explain in [4M]
brief.
15. a) Write the methodology involved in computing the keys in SSL protocol. [5M]
b) Discuss how SET is designed to protect credit card transactions on the [5M]
internet in brief
16. a) What is host-based firewall? Why is it useful to have host-based firewalls? [4M]
b) Explain Host-Based Intrusion Detection Systems [6M]
57 | P a g e
17. a) What is the significance of RFC? [4M]
b) Define weak collision property of a hash function. [3M]
c) Differentiate digital signature from digital certificate. [3M]
18. Write short notes on the following
a) Tunnel mode of IPSec. [3M]
b) Web security requirements. [3M]
c) Signature based IDS. [4M]

58 | P a g e
 H.T No
Sreenidhi Institute of Science and Technology Regulations:
(An Autonomous Institution) A15
Code No: 5FC11 Date: 03 Oct-2020 (AN)
B.Tech IV-Year I-Semester External Examination, October - 2020 (Supplementary)
INFORMATION SECURITY (CSE & IT)
Time: 2 Hours Max.Marks:75
Note: a) No additional answer sheets will be provided.
b) All sub-parts of a question must be answered at one place only, otherwise it will not be
valued.
c) Missing data can be assumed suitably.

ANSWER ANY FIVE QUESTIONS. EACH QUESTION CARRIES 15 MARKS.

1. a) Enumerate the security attacks and explain each in brief. [8M]
b) Discuss how internet standards have been standardized by using RFC? [7M]

2. a) Describe Advanced Encryption Standard with neat sketch. [8M]

b) It is possible to use a hash function to construct a block cipher with a structure [7M]
similar to DES. Because a hash function is one way and a block cipher must
be reversible (to decrypt), how is it possible?

3. a) Identify the possible threats for RSA algorithm and list their counter measures. [8M]
b) Give the structure of PGP message generation. Explain with a diagram. [7M]

4. a) Explain the major security services provided by Authentication Header and [8M]
ESP respectively.
b) How are security associations combined? [7M]

5. a) What is the need for security services at transport layer of Internet Protocol? [8M]
b) Explain the four protocols defined by Secure Socket Layer. [7M]

6. a) What is application level gateway? List the merits of application level gateway. [8M]
b) Explain Network-Based Intrusion Detection Systems. [7M]

7. a) Distinguish between denial of service and distributed denial of service. [8M]

b) Give a detailed view on model for Internetwork security. [7M]

8. a) Compare Substitution and Transposition ciphers. [8M]

b) Explain about cipher block modes of operation. [7M]

59 | P a g e
 SREENIDHI INSTITUTE OF SCIENCE & TECHNOLOGY
(AN AUTONOMOUS INSTITUTION UNDER JNTUH)

(Approved by AICTE & Aided by World Bank under TEQIP )

Yamnampet, Ghatkesar Mandal, Hyderabad - 501 301.

COURSE FILE
For
LINUX PROGRAMMING
For

B. Tech. IV year - I Semester

CSE BRANCH

DEPARTMENT OF
COMPUTER SCIENCE AND ENGINEERING
September 2021

60 | P a g e
 L T P C
3 - - 3

PO 1 2 3 4 5 6 7 8 9 10 11 12

Level M M M

Syllabus for B. Tech. IV Year I se-

mester Computer Science and En-
gineering LINUX PROGRAMMING

Code: 7F708

Course Objectives: To Induce working principles of Linux operating system, usage of

File handling utilities, Security by file permissions, process utilities, Disk utilities, Net-
working utilities. To impart the shell responsibilities and meta-characters of it, control
structures, shell interrupt processing, functions, debugging shell scripts. To impart basics
of file concepts kernel support for file, file structure and low-level I/O functions, system
calls (file API’s). Induce knowledge regarding Directory management and its API.To
demonstrate basics of process creation, execution and synchronization mechanisms. Give
knowledge regarding a signal, need for having them, usage of various signals.To narrate
the need for Inter Process Communication. Explore the possible mechanisms to imple-
ment System V APIs. To demonstrate the usage of Message queues. To incorporate im-
plementation for semaphore API and shared memory API. To explain the need for using
a basic Client-Server model.

Course Outcomes:
At the end of this course, the student will be able to

1. Describe the basic Linux commands

2. Write Shell Scripts
3. Enlist various System Calls in Linux
4. Classify various system calls to handle the processes and signal the process
5. Elaborate the working of IPC
6. Demonstrate the significance of Semaphores for Kernel support and simulate
program using the same.

61 | P a g e
UNIT-I : Linux Utilities-File handling utilities, Security by file permissions, Process
utilities, Disk utilities, Networking commands, Filters, Text processing utilities and
Backup utilities, sed – scripts, operation, addresses, commands, applications, awk –
execution, fields and records, scripts, operation, patterns, using system commands in awk.
(Applications: Determining what types of files are present in a system, debugging issues
with file accessibility, finding a process troubling for a task and discarding from its
existing, Write and extract necessary information from huge test files.)

UNIT – II Working with the Bourne again shell(bash): Introduction, shell

responsibilities, pipes and input Redirection, output redirection, running a shell script, the
shell as a programming language, shell meta characters, file name substitution, shell
variables, command substitution, shell commands, the environment, quoting, test
command, control structures, arithmetic in shell, shell script examples, interrupt
processing, functions, debugging shell scripts.

(Applications: Writing shell scripts for automating most of the regular jobs, taking
backup on regular basis and restoring the same)

UNIT-III: Files: File Concept, File System Structure, I nodes, File Attributes, File types,
Library functions, the standard I/O and formatted I/O in C, stream errors, kernel support
for files, System calls, file descriptors, low level file access – File structure related system
calls(File APIs), file and record locking, file and directory management – Directory file
APIs, Symbolic links & hard links. (Applications: write some system programs to interact
with file system, developing small systemsoftwares to work with files and devices,
Developing program’s on directory management system)

UNIT-IV: Process – Process concept, Kernel support for process, process attributes,
process control - process creation, waiting for a process, process termination, zombie
process, orphan process, Process APIs. Signals– Introduction to signals, Signal
generation and handling, Kernel support for signals, Signal function, unreliable signals,
reliable signals, kill, raise , alarm, pause, abort, sleep functions.

(Applications: Applications to find number of typical processes are under different

context and controlling them in synchronous manner. Develop user defined modules for
handling a signal and controlling several issues with signals.)

62 | P a g e
 UNIT-V: Interprocess Communication: Introduction to IPC, Pipes, FIFOs, Introduction
to three types of IPC-message queues, semaphores and shared memory. Message Queues
Kernel support for messages, Unix system V APIs for messages, client/server example.

(Applications: Developing applications complying with IPC mechanisms, Developing an

application that exchanges a set of messages among different processes. Write a client
server application to go with any concurrent approach)

UNIT- VI : Semaphores-Kernel support for semaphores, Unix system V APIs for

semaphores. Shared Memory- Kernel support for shared memory, Unix system V APIs
for shared memory, semaphore and shared memory example.

(Applications: Develop critical section handling mechanisms to deal with any real
problems. Building applications to share a piece of memory resource among processes
concurrently)

TEXT BOOKS:

1. Unix System Programming using C++, T.Chan, PHI.

2. Unix Concepts and Applications, 4th Edition, Sumitabha Das, TMH,2006.
3. Beginning Linux Programming, 4th Edition, N.Matthew, R.Stones,Wrox, Wiley India Edi-
tion,rp-2008

REFERENCES:

1. Linux System Programming, Robert Love, O’Reilly, SPD.

2. Advanced Programming in the Unix environment, 2nd Edition, W.R.Stevens, Pearson
Education.
3. Unix Network Programming ,W.R.Stevens,PHI.

Unix for programmers and users, 3rd Edition, Graham Glass, King Ables, Pearson
Education

LINUX PROGRAMMING
Code: 7F708
63 | P a g e
 Lecture Schedule
Unit – 1
S.No. No. of Name of the Topic
Lectures
1 1 Linux Utilities-File handling utilities, Security by file permissions.
2 1 Process utilities, Disk utilities.
3 1 Networking commands.

64 | P a g e
4 1 Filters, Text processing utilities and Backup utilities.
5 1 sed – scripts, operation, addresses, commands, applications.
6 1 awk – execution, fields and records.
7 1 scripts, operation, patterns, using system commands in awk.
8 1 Applications.
Unit – 2
9 1 Working with the Bourne again shell(bash): Introduction, shell
responsibilities.
10 1 pipes and input Redirection, output redirection.
11 1 running a shell script, the shell as a programming language.
12 2 shell meta characters, shell commands, the environment.
13 1 file name substitution, shell variables, command substitution.
14 1 quoting, test command, control structures, arithmetic in shell, shell script ex-
amples.
15 1 debugging shell scripts, interrupt processing, functions.

Unit – 3
16 1 Files: File Concept, File System Structure, I nodes, File Attributes, File
types.
17 2 Library functions, the standard I/O and formatted I/O in C.
18 2 stream errors, kernel support for files, System calls, file descriptors, low
level file access.
19 2 Directory file APIs, Symbolic links & hard links.
20 1 Applications.
Unit – 4
21 4 Process – Process concept, Kernel support for process, process attributes,
process control - process creation, waiting for a process, process termination.

22 1 zombie process, orphan process, Process APIs. Signals– Introduction to sig-

nals, Signal generation and handling, Kernel support for signals.
23 3 Signal function, unreliable signals, reliable signals, kill, raise , alarm, pause,
abort, sleep functions.

Unit – 5
24 4 Interprocess Communication: Introduction to IPC, Pipes, FIFOs, Introduc-
tion to three types of IPC-message queues, semaphores and shared memory.

25 2 Message Queues Kernel support for messages, Unix system V APIs for
messages, client/server example.
26 2 Applications.
Unit – 6
27 3 Semaphores-Kernel support for semaphores, Unix system V APIs for

65 | P a g e
 semaphores.
28 2 Shared Memory- Kernel support for shared memory, Unix system V APIs
for shared memory, semaphore and shared memory example.
29 3 Applications.
Total Periods: 8+8+8+8+8+8=48+(6 Units * 3 = 18 Exercise Sessions) (Max 4 Lec-
tures/week *16 weeks=64)

66 | P a g e
 Questions
Unit 1:
1. What Is a Shell?
2. Explain File handling utilities.
3. How a script is created and executed
4. Explain Process utilities an example.
5. Explain sed – scripts, operation, addresses, commands, applications.
6. Explain awk – execution, fields and records, scripts, operation, patterns, using system
commands.
7. What is the use of Backup utilities.

Unit 2:
1. Explain Bourne again shell in detail.
2. What are the shell responsibilities.
3. Explain pipes and input Redirection
4. Explain pipes and input Redirection
5. Explain shell meta characters.
6. Write about file name substitution.
7. Write about shell variables.
8. Explain about command substitution
9. What is interrupt processing. 10.Explain
about debugging shell scripts.

Unit 3:
1. Explain File System Structure.
2. Explain I nodes in detail.
3. System calls.
4. Explain in detail about File structure related system calls.
5. write some system programs to interact with file system.
6. Explain in detail about Symbolic links & hard links.
7. Explain in detail about file and record locking.
8. Write about file and directory management.

67 | P a g e
Unit 4:
1. What Is a Process?
2. Write a program to start a process and duplicate a process.
3. What is a Zombie Process.
4. Explain how signals are handled in detail.
5. Explain the Signal sets used in sigaction and other functions to modify process behav-
ior on receipt of signals.
6. What Is a Thread?What are the Advantages and Drawbacks of Threads
7. Write a Simple threaded Program.
8. Write a program for executing two threads simultaneously.
9. What is Synchronization? And write a program for a thread semaphore. 10.How a
synchronizing access in multithreaded programs is done . Explain in
detail with program.
11.What are the Thread attributes

Unit 5:
1. What Is a Pipe?
2. How data can be passed between two programs.
3. Write a program to capture output from external program.
4. Write a program that reads all of the data from a pipe.
5. What is Named Pipe? Explain with a program.
6. Give an example for Client/Server Application using FIFOs.

Unit 6:
1. What is IPC and what are different kinds of IPC
2. What is Semaphores.
3. Explain the different functions in Semaphore.
4. What is Shared Memory.
5. Explain the different functions in Shared Memory.
6. What is Message Queues.
7. Explain the different functions in Message Queues.
8. Write short note and syntax of following functions:
a. shmget, shmat, shmdt, shmctl
b. msgget, msgsnd, msgrcv, msgctl
9. Write a program for displaying
a) Semaphore Status
b) Shared Memory Status
c) Message Queue Status

68 | P a g e
 H.T No
Regulations:
Sreenidhi Institute of Science and Technology A15
(An Autonomous Institution)
Code No: 5FC06 Date: 15-July-2021(FN)
B.Tech III-Year II- Semester Pending External Examination, July-2021 (Supplementary)
LINUX PROGRAMMING (CSE)
Time: 3 Hours Max.Marks:75
Note: a) No additional answer sheets will be provided.
All sub-parts of a question must be answered at one place only, otherwise it will not be valued.
Missing data can be assumed suitably.

ANSWER ANY 5 OUT OF 8 QUESTIONS. EACH QUESTION CARRIES 15 MARKS.

Bloom's Cognitive Levels of Learning (BCLL)

Remember L1 Apply L3 Evaluate L5

Understand L2 Analyze L4 Create L6

1. a) Explain various filters available in Linux with syntax and examples. L3 CO1
[8M]
b) Write an awk
script to check whether a given number is prime number or not? L2 CO1 [7M]

2. a) Write a shell program to print a multiplication table of a number given from com- L4 CO2
mand line. [8M]
b) Describe any four built in variables in Shell and demonstrate their use giving
an example for each.
L3 CO2
[7M]

3. a) Draw and explain the file system architecture in detail. L3 CO3

[8M]
b) List and ex-
plain directory file APIs. L3 CO3 [7M]

4. a) Define orphan process. Write a program to illustrate the orphan process concept. L4 CO4
b) What are reliable signals? Explain about the primary features of reliable func- [8M]
tions.
L3 CO4
[7M]

5. a) Define unnamed pipe? How do we create unnamed pipe? Explain the limitations of L4 CO5
unnamed pipe. [8M]
b) Write a program and explain how to transfer a large amount of data between
two processes using Message queues.
L4 CO5
[7M]

6. a) Describe the API provided by Linux for semaphores. L3 CO6

[8M]
69 | P a g e
 b) Explain the
kernel data structure for shared memory with a neat diagram. L3 CO6 [7M]

7. a) List and ex-

plain any three networking commands. L3 CO1
[5M]
b) Explain the sig-
nificance of single quote and double quote L3 CO2 [5M]
c) Explain stream
errors. L3 CO3 [5M]

8. a) Explain the
process of signal generation. L5 CO4
[5M]
b) Write a program
to illustrate client/server application using named pipes. L2 CO5 [5M]
c) Write a C pro-
gram that illustrates file locking using semaphore. L4 CO6 [5M]

-- 00 -- 00 –

Page 1 of 1

70 | P a g e
 H.T No Regulations:
A14
Sreenidhi Institute of Science and Technology
(An Autonomous Institution)
Code No: 4EC19 Date: 18-Apr-2018 (FN)
B.Tech III-Year II-Semester External Examination, April - 2018 (Supplementary) LINUX
PROGRAMMING (CSE)
Time: 3 Hours Max.Marks:70
Note: a) No additional answer sheets will be provided.
All sub-parts of a question must be answered at one place only, otherwise it will not be valued.
Missing data can be assumed suitably.

Part - A Max.Marks:20
ANSWER ALL QUESTIONS.

1. What is GNU? [2M]

2. Write the syntax of fcntl sytem call. [2M]
3. What is null pointer? [2M]
4. Write about Zombie process. [2M]
5. What is IPC? List different forms of IPC. [2M]
6. Define semaphore. [2M]
7. What is device driver? [2M]
8. Write about ‘mkdir’ command. [2M]
9. Write the syntax for creation of FIFO. [2M]
10. List some directory handling system calls. [2M]

Part – B Max.Marks:50
ANSWER ANY FIVE QUESTIONS. EACH QUESTION CARRIES 10 MARKS.

11. a) Explain in brief about Here documents. [5M]

b) Write a shell script to check whether the given number is prime of not. [5M]

12. a) Differentiate Library functions and system calls. [5M]

b) Explain in brief file access permissions. [5M]

13. a) What is the use of environment variables? List and explain any [6M
three environment variables. ]
b) Explain about dbm routines. [4M]

14. a) What is a process? Explain about process structure. [5M]

b) How to achieve synchronization with semaphores? Explain. [5M]

15. Write a program for client/server communication using FIFO’s.

[10M]

16. a) List and explain any three IPC status commands. [6M]
b) Explain
about shmctl system call. [4M]
17. a) Write a short note on control structures. [4M]
b) Explain
fread(), fwrite() and fseek() functions. [6M]

18. a) Explain about wait and waitpid functions. [6M]

b) Explain
about thread creation and its termination. [4M]
-- 00 -- 00 –

Page 1 of 1
 H.T
No Regulations:
A15
Sreenidhi Institute of Science and Technology
(An Autonomous Institution)
Code No: 5FC06 Date: 18-Apr-2018 (FN)
B.Tech III-Year II-Semester End External Examination, April - 2018 (Regular) LINUX
PROGRAMMING (CSE)
Time: 3 Hours Max.Marks:75
Note: a) No additional answer sheets will be provided.
All sub-parts of a question must be answered at one place only, otherwise it will not be valued.
Missing data can be assumed suitably.

Part - A Max.Marks:25
ANSWER ALL QUESTIONS.
1. Write briefly about text processing utilities. [3M]
2. List out any three examples for control structures in shell program- [3M]
ming.
3. Define symbolic links. How is it different from hard links? [3M]
4. Define a system call. [3M]
5. Explain about Message queue. [3M]
6. List out some APIs associated for shared memory. [2M]
7. Draw the architecture of UNIX file systems. [2M]
8. Explain zombie process. [2M]
9. Differentiate stream sockets and raw sockets. [2M]
10. Illustrate ‘rlogin’ command with example. [2M]
Part – B Max.Marks:50
ANSWER ANY FIVE QUESTIONS. EACH QUESTION CARRIES 10 MARKS.
11. a) Explain the following Unix commands with example. Cal, date, echo, printf, script
[5M]
b) Explain ftp and its importance in Linux. [5M]
a) Explain about shell meta characters. [5M]
b)Discuss about shell variables in Unix shell syntax.[5M]
a) Explain how the system call differs from that of the library functions? [4M]
b) Write the syntax for the following: [6M]
i) opendir ii) readdir iii) closedir iv) rewinddir
12. a)What is Unix process status (ps)? [5M]
b) Explain the procedures for process creation, replacing a process image, wait- 5
ing for a process, process termination. M
]
13. a) What is meant by name space? Give the name spaces of various IPC mecha-
nisms in Unix.
[
5
M
]
 b) Differentiate Unix system and API for messages. [5M]
14.a) Explain how to attach and detach a shared-memory segment?
[5M]
b) Explain the working of ‘fork’ and ‘join’ in TCP/IP sockets.
[5M]
 15. a)Explain the following commands with syntax, options [3M
and examples:
(i) head (ii) tail.
b) Define an orphan process. Write a program to illustrate orphan process. [3M]
c) Explain about symlink ( ) function with example program. [4M]
16. a) Define FIFOs. How they are different from pipes? [3M]
b) Discuss about name space. Give the name spaces of various IPC mech- [3M
anisms in unix. ]
c) Explain briefly about the following socket APIs with clear syntax:
i) bind( ) ii) listen( )
[4M
]
 H.T No
Regulations:
Sreenidhi Institute of Science and Technology A14
(An Autonomous Institution)
Code No: 4EC19 Date: 20-May-2019 (FN)
B.Tech III-Year II-Semester External Examination, May/June-2019 (Supplementary)
LINUX PROGRAMMING (CSE)
Time: 3 Hours Max.Marks:70
Note: a) No additional answer sheets will be provided.
b) All sub-parts of a question must be answered at one place only, otherwise it will not
be valued.
c) Missing data can be assumed suitably.

Part - A Max.Marks:20
ANSWER ALL QUESTIONS.
1. What is GNU? [2M]
2. Write about fgetc () Function. [2M]
3. Define dbm access funtions. [2M]
4. What is a Orphan process? [2M]
5. What is named pipe? [2M]
6. Define shared memory. [2M]
7. What is a shell? [2M]
8. Define file. What are some low level file access system calls? [2M]
9. Explain the following commands with syntax i) link ii) sprintf [2M]
10. Explain the following system calls with syntax: i) chdir( ) ii)chown( ) [2M]
Part – B Max.Marks:50
ANSWER ANY FIVE QUESTIONS. EACH QUESTION CARRIES 10 MARKS.
11. a) Write a shell script to check a given number is palindrome or not. [6M]
b) Explain how to declare variables and conditions in shell programming? [4M]

12. Explain the following system calls with syntax: [10M]

i) fflush( ) ii) getc( ) iii) seekdir( ) iv) telldir( ) v)
fwrite( )

13. a) Write about memory allocation methods. [5M]

b) What is null pointer and Abusing memory? [5M]

14. a) What is meant by a process scheduling ? Explain about input output [4M]
redirection.
b) Define Thread. What are thread attributes and canceling a thread ? [6M]

15. Explain in detail about the client - server communication using FIFOS. [10M]
16. a) Explain about the semget( ), semctl( ) and semop( ) functions. [5M]
b) What is the use of environment variables? List any three environment [5M]
variables.

17. a) Explain about system calls. [4M]

b) Explain the following system calls with syntax: [3M]
i) fread( ) ii) fseek( )
c) Explain how process synchronization can be achieved using semaphores? [3M]

18. a) Differentiate between pipe and FIFO. [4M]

b) How to kill a process? [3M]
c) Explain about IPC status commands. [3M]
-- 00 -- 00 –

76
 H.T No Regulations:
Sreenidhi Institute of Science and Technology A15
(An Autonomous Institution)
Code No: 5FC06 Date: 20-May-2019 (FN)
B.Tech III-Year II-Semester External Examination, May/June-2019 (Regular)
LINUX PROGRAMMING (CSE)
Time: 3 Hours Max.Marks:75
Note: a) No additional answer sheets will be provided.
b) All sub-parts of a question must be answered at one place only, otherwise it will not
be valued.
c) Missing data can be assumed suitably.

Part - A Max.Marks:25
ANSWER ALL QUESTIONS.
1. What are filters? List out various filters available in linux. [3M]
2. Explain the significance of single quote and double quote. [3M]
3. List the library functions for files. [3M]
4. Explain zombie process. [3M]
5. Explain about Message queue. [3M]
6. List out some APIs associated for shared memory. [2M]
7. What are the responsibilities of shell? [2M]
8. What is the difference between wait() and waitpid()? [2M]
9. Define semaphore. [2M]
10. Explain how to perform IPC between processes over a network. [2M]

Part – B Max.Marks:50
ANSWER ANY FIVE QUESTIONS. EACH QUESTION CARRIES 10 MARKS.
11. a) Explain various process utilities available in linux. [5M]
b) Explain briefly about text processing and process utilities. [5M]
12. a) Explain in detail about interrupt processing. [5M]
b) How to run shell script? Explain with example. [5M]
13. a) Write the syntax of the following system calls and explain with an example [5M]
code.
i) telldir ii) mkdir
b) Differentiate between fork( ) and vfork( ). [5M]

14. a) What are process identifiers? Mention the commands for getting different [5M]
IDs of calling process.
b) Explain clearly the Signal concept with a suitable example. [5M]
15. a) Give the advantages and disadvantages of IPC_PERM structure. [5M]
b) Describe the operations of semctl( ) with a sample C program. [5M]

77
16. a) Describe the API provided by linux for semaphores. [5M]
b) Write a program for locking a file using semaphore. [5M]
17. a) Explain briefly about text processing utilities in linux. [4M]
b) Write a shell script to count the number of lines in a text file without using [3M]
wc command.
c) Differentiate soft link and hard link with examples. [3M]
18. a) Describe SIGKILL and SIGINT with example. [4M]
b) Explain API’s for semaphores. [3M]
c) Write in brief about Kernel support for shared memory. [3M]

-- 00 -- 00 –

78
 H.T No Regulations:
Sreenidhi Institute of Science and Technology A15
(An Autonomous Institution)
Code No: 5FC06 Date: 20-May-2019 (FN)
B.Tech III-Year II-Semester External Examination, May/June-2019 (Supplementary)
LINUX PROGRAMMING (CSE)
Time: 3 Hours Max.Marks:75
Note: a) No additional answer sheets will be provided.
b) All sub-parts of a question must be answered at one place only, otherwise it will not
be valued.
c) Missing data can be assumed suitably.

Part - A Max.Marks:25
ANSWER ALL QUESTIONS.
1. What are filters? List out various filters available in linux. [3M]
2. Explain the significance of single quote and double quote. [3M]
3. List the library functions for files. [3M]
4. Explain zombie process. [3M]
5. Explain about Message queue. [3M]
6. List out some APIs associated for shared memory. [2M]
7. What are the responsibilities of shell? [2M]
8. What is the difference between wait() and waitpid()? [2M]
9. Define semaphore. [2M]
10. Explain how to perform IPC between processes over a network. [2M]

Part – B Max.Marks:50
ANSWER ANY FIVE QUESTIONS. EACH QUESTION CARRIES 10 MARKS.
11. a) Explain various process utilities available in linux. [5M]
b) Explain briefly about text processing and process utilities. [5M]
12. a) Explain in detail about interrupt processing. [5M]
b) How to run shell script? Explain with example. [5M]
13. a) Write the syntax of the following system calls and explain with an [5M]
example code.
i) telldir ii) mkdir
b) Differentiate between fork( ) and vfork( ). [5M]

14. a) What are process identifiers? Mention the commands for getting [5M]
different IDs of calling process.
b) Explain clearly the Signal concept with a suitable example. [5M]
15. a) Give the advantages and disadvantages of IPC_PERM structure. [5M]
b) Describe the operations of semctl( ) with a sample C program. [5M]

79
16. a) Describe the API provided by linux for semaphores. [5M]
b) Write a program for locking a file using semaphore. [5M]
17. a) Explain briefly about text processing utilities in linux. [4M]
b) Write a shell script to count the number of lines in a text file without [3M]
using wc command.
c) Differentiate soft link and hard link with examples. [3M]
18. a) Describe SIGKILL and SIGINT with example. [4M]
b) Explain API’s for semaphores. [3M]
c) Write in brief about Kernel support for shared memory. [3M]

-- 00 -- 00 –

Page 1 of 1

80
SREENIDHI INSTITUTE OF SCIENCE & TECHNOLOGY
(AN AUTONOMOUS INSTITUTION UNDER JNTUH)
(Approved by AICTE & Aided by World Bank under TEQIP )
Yamnampet, Ghatkesar Mandal, Hyderabad - 501 301.

COURSE FILE

For

ARTIFICIAL INTELLIGENCE
B. Tech. IV Year – I Semester
Computer Science and Engineering

DEPARTMENT OF
Computer Science and Engineering
2021-2022

81
 Syllabus for B. Tech. IV Year I semester
Computer Science and Engineering
ARTIFICIAL INTELLIGENCE
(Mandatory Course)

Code: 7EC20 L T P C
2 - - 0

Course Objective:
To learn the distinction between optimal reasoning Vs. human like reasoning. To understand
the concepts of state space representation, exhaustive search, heuristic search together with the
time and space complexities. To learn different knowledge representation techniques. To
understand the applications of AI, namely game playing, theorem proving, and machine
learning.

Course Outcomes:
At the end of this course, the student is able to
1.Learn the distinction between optimal reasoning Vs human like reasoning and formulate
an efficient problem space for a problem expressed in natural language. Also select a
search algorithm for a problem and estimate its time and space complexities.
2.Apply AI techniques to solve problems of game playing, theorem proving, and machine
learning.
3.Learn different knowledge representation techniques.
4.Understand the concepts of state space representation, exhaustive search, heuristic search
together with the time and space complexities.
5.Comprehend the applications of Probabilistic Reasoning and Bayesian Networks.
6. Analyze Supervised Learning Vs. Learning Decision Trees

UNIT - I
Introduction to AI, Intelligent Agents, Problem-Solving Agents, Searching for Solutions,
Breadth-first search, Depth-first search, Hill-climbing search, Simulated annealing search,
Local Search in Continuous Spaces.

UNIT-II
Games, Optimal Decisions in Games, Alpha–Beta Pruning, Defining Constraint Satisfaction
Problems, Constraint Propagation, Backtracking Search for CSPs, Knowledge-Based Agents,
Logic, Propositional Logic, Propositional Theorem Proving: Inference and proofs, Proof by
resolution, Horn clauses and definite clauses.

UNIT-III
Representation, Syntax and Semantics of First-Order Logic, Using First Order Logic,
Knowledge Engineering in First-Order Logic. Inference in First-Order Logic: Propositional vs.
First-Order Inference, Unification and Lifting, Forward Chaining, Backward Chaining,
Resolution. Knowledge Representation: Ontological Engineering, Categories and Objects,
Events.

82
UNIT-IV
Definition of Classical Planning, Algorithms for Planning with State Space Search, Planning
Graphs, other Classical Planning Approaches, Analysis of Planning approaches. Hierarchical
Planning, Planning and Acting in Nondeterministic Domains, Multi agent Planning.

UNIT-V
Acting under Uncertainty, Basic Probability Notation Bayes’ Rule and Its Use, Probabilistic
Reasoning: Representing Knowledge in an Uncertain Domain, The
Semantics of Bayesian Networks, Efficient Representation of Conditional Distributions,
Approximate Inference in Bayesian Networks, Relational and First- Order Probability, Other
Approaches to Uncertain Reasoning; Dempster-Shafer theory.

Unit-VI
Learning: Forms of Learning, Supervised Learning, Learning Decision Trees.

TEXT BOOKS
1. Artificial Intelligence A Modern Approach, Third Edition, Stuart Russell and Peter Norvig,
Pearson Education.

REFERENCE BOOKS

1. Artificial Intelligence, 3rd Edn., E. Rich and K. Knight(TMH)

2. Artificial Intelligence, 3rd Edn., Patrick Henny Winston, PearsonEducation.
3. Artificial Intelligence, Shivani Goel, PearsonEducation.
4. Artificial Intelligence and Expert systems – Patterson, PearsonEducation.

83
 LECTURE SCHEDULE

No of
S.No Unit NO Topic Name Classes
UNIT-1:Introduc-
1 tion Introduction to AI 1
2   Intelligent agents: Agents and Environments 1
3   Problem-Solving Agents 1
4   Searching for Solutions 1
5   Breadth-first search 1
6   Depth-first search 1
7   Hill-climbing search, Simulated annealing search 2
8   Local Search in Continuous Spaces 2
UNIT II
9 Game Theory: Optimal Decisions in Games 1
10   Alpha–Beta Pruning 2
11   Defining Constraint Satisfaction Problems, 2
12   Constraint Propagation 2
13   Backtracking Search for CSPs 1
14   Knowledge-Based Agents 1
15   Logic, Propositional Logic 1
16   Propositional Theorem Proving. Inference and proofs, 2
17   Proof by resolution, Horn clauses and definite clauses 1
UNIT III: Knowledge Logical Agents,
Representation and
18 Reasoning : 1
19   Knowledge Based Agents, 1

20   Syntax and Semantics of First-Order Logic 1

Using First Order Logic, Knowledge Engineering in First-
21   Order Logic 2
22   propositional vs. First order inference, 1
Inference in First-Order Logic: Propositional vs. First-Order
Inference, Unification and Lifting, Forward Chaining, Back-
23   ward Chaining, Resolution 2
Ontological Engineering, Categories and Objects, Events.
24   2
Definition of Classical Planning, Algorithms for Planning
25 UNIT IV: Planning with State Space Search 3
26 Planning Graphs, other Classical Planning Approaches 2
27 Analysis of Planning approaches, 1
28   Hierarchical Planning, 1

84
 29   Planning and Acting in Nondeterministic Domains 1
30   Multi agent Planning. 2
UNIT – V: Uncer-
31 tainity Acting under Uncertainty 1
32 Basic Probability Notation Bayes’ Rule and Its Use 1
33 Probabilistic Reasoning 1
34   Representing Knowledge in an Uncertain Domain 1
35   The Semantics of Bayesian Networks 1
36   Efficient Representation of Conditional Distributions - 2
37   Approximate Inference in Bayesian Networks 1
38   Relational and First- Order Probability 1
39   Other Approaches to Uncertain Reasoning 1
40   Dempster-Shafer theory 2
41 UNIT VI: Learning Forms of Learning - 1
42 Supervised learning 1
43 Learning Decision Trees 1
44   Case studies 1
45   Algorithms of Decision trees 1
  Total No Of Classes   60

COURSE OUTCOMES:
COURSE OUTCOMES
1. Learn the distinction between optimal reasoning Vs human like reasoning and formulate an
efficient problem space for a problem expressed in natural language. Also select a search
algorithm for a problem and estimate its time and space complexities.

2. Apply AI techniques to solve problems of game playing, theorem proving, and machine learning
3. Learn different knowledge representation techniques
4. Understand the concepts of state space representation, exhaustive search, heuristic search together
with the time and space complexities
5. Comprehend the applications of Probabilistic Reasoning and Bayesian Networks
6 Analyze Supervised Learning Vs. Learning Decision Trees

Test your skills

UNIT - 1

85
1. Define Artificial Intelligence.
2. Define Artificial Intelligence in terms of Rational thinking
3. What is meant by Turing test.
4. Define Total Turing test.
5. Define Agent and Rational Agent
6. List various types of Agent program
7. List and explain the applications of Artificial Intelligence
8. Define Ideal Rational Agent
9. What are the different types of problems.
10. List the components of problem
11. List the steps involved in problem solving technique.
12. Explain the following uninformed search strategies with examples.
(a)Breadth First Search. (b) Uniform Cost Search
(c) Depth First Search (d) Depth Limited Search
13. Explain the following local search strategies with examples.
(i) Hill climbing (ii) Genetic Algorithms (iii) Simulated annealing
14. Discuss the characteristics of AI problem. Can Towers of Hanoi problem be considered as
AI problem? Justify your answer with suitable.

15. Explain in detail about Uninformed Search and Informed Search Strategies

UNIT - 2

1. Define constraint satisfaction problem (CSP). How CSP is formulated as a search

problem? Explain with an example.
2. Explain with examples
i) Adversarial search problem (ii) Game
3. Differentiate between forward and backward reasoning
4. Explain with algorithm and example :
(i). Minimax algorithm (ii). Alpha-Beta Pruning
5.(i) Define the syntactic elements of first-Order logic
6. Illustrate the use of first-order logic to represent knowledge.
7. Give a brief note on Alpha-Beta Pruning.
8.Explain with an example
(a) forward chaining (b) Backward chaining
9. Give resolution proof for example problem statement :
(a).“West is a criminal” (b) Curiosity killed the cat
10. Differentiate propositional logic with FOL. List the inference rules along with suitable
examples for first order logic

86
 11. Define game formally with important elements. 2 Explain how importance of optimal
decisions in games in breif 3 Explain following w.r.t. optimal decision in games. 1. Ply
2. Minimax 4 State and explain Minimax algorithm.
12. Explain how values are propagated in the game tree using MINIMAX
and ALPHA-BETA pruning. Show the nodes that will be pruned.

UNIT - 3

1. Write down logical representations for the following sentences suitable to use with
Generalized Modus Ponens: (a) Horses, cows and pigs are mammals (b) An offspring of a
horse is a horse (c) Bluebeard is a horse (d) Offspring and parent are inverse relations (e)
Every mammal has a parent. Draw the proof tree generated by an exhaustive back-ward
chaining algorithm for the query.
2. Give a detail note on models for first order logic. (b) Discuss inference rules for
quantifiers.
3. What are the limitations of Predicate logic as a tool for Knowledge representation?
Illustrate through examples.
4. What are the limitations in using propositional logic to represent knowledge base
5. Describe about types of Knowledge representation?
6. What do you mean by Game Playing?
7. What factors determine the selection of forward and backward reasoning approach
for an AI problem.
8. Define Knowledge Acquisition and Give two real time examples

UNIT - 4

1. Give an outline of a simple planning agent (b) Give partial-order planning algorithm.
2. Discuss about the language of planning problem briefly. (b) Explain partial order plan-

87
ning in detail.
3. Give a detailed account on planning with state space search
4. Explain uncertainty
5. Explain the use of planning graph in providing better heuristic estimation with suit-
able example?
6. Explain the basic plan generation in detail?
7. Explain about Hierarchical planning method with example?
8. Explain Planning Domain Definition Language.
9. What is meant by classical planning with example
10. Explain Analysis Of Planning Approaches. What is meant by Serializable Subgoal?
11. Explain Temporal And Resource Constraints.
12. What is Hierarchical planning and Hierarchical Task Network.
13. What is meant by Nondeterministic Domains? Explain Planning adaption for Nondeterminis-
tic Domains.
14. Explain General Characteristics Of Uncertain Environments.
15. Explain Categories of Planning And Acting In Nondeterministic Domains.
16. Write a short note on Sensor less planning or conformant planning.
17. Write a short note on Conditional planning or Contingency planning
18. Explain Online replanning in detail.
19. Explain different Categories of Planning.
20. Give demonstration for Algorithm of Multifactor Planning.

UNIT – 5

1. Explain instance based learning with an example

2. Explain Dempster-Shafer theory.
3. Explain inductive logic Programming
4. Describe a method for constructing Bayesian networks,
5. Explain inductive logic programming
6. What is a Bayesian networks?How is it used in representing the uncertainity about
knowledge. Explain the method of performing exact inference in baeysian net-

88
 works?
7. Define uncertain knowledge, prior probability and conditional probability .State the Baye’s
theorem. How it is useful for decision making under uncertainty about knowledge? Explain
the method of performing exact inference in Bayesian networks briefly.

UNIT - 6

1. Write short notes on Decision trees.

2. Discuss in detail about supervised learning?
3. Define and explain (i) Supervised learning (4M) (ii) Unsupervised learning (4M) (iii)
Reinforcement learning

4. Explain the process of inducing decision trees from example

Explain different forms of learning.

89
 Sreenidhi Institute of Science & Technology A 10
(An Autonomous Institution)
Code No: 101CS11
B. TECH. III – Year II – Semester Examinations, MAY, 2013 (Regular)
ARTIFICIAL INTELLIGENCE ( CSE )
Time: 3 Hours Max. Marks : 70

Note : No additional answer sheets will be provided.

Part-A (Objective Type)
Max.Marks:20
ANSWER ALL QUESTIONS.
1. What are the Characterstics of Artificial Intelligence ?

2. What is alpha-Beta Pruning ?

3. Write at least two differences between predicate logic and propositional logic ?

4. Differentiate between Forward chaining and Backward chaining ?

5. Define Induction Learning ?

6. Define briefly about goal based Agents ?

7. What are the limitations of Depth First Search Method ?

8. Write at least two characteristics for partial order planning ?

9. Define Artificial Neural Network ?

10. What are the Limitations of A* Search method ?

Part – B
Max. Marks: 50

ANSWER ANY FIVE QUESTIONS. EACH QUESTION CARRIES 10 MARKS.

1. a) Explain the applications of Artificial Intelligence. ( 5M)

b) Write about Model-based reflex Agents in detail. ( 5M)

2. a) Differentiate between Depth-First Search and Breadth First Search with
examples. ( 5M)

90
 b) What is Mini-Max Algorithm ? Write about optimal decisions in multiplayer
games (5M)

3. a) Write about Resolution Algorithm and explain ? ( 5 M)

b) Differentiate between Forward state-space search and backward state

space search with examples (5M)

4. a) Write about First order Logic and explain about inference in First Order
logic ? (6 M)

b) Write Single layer and multilayer Neural Networks. (4 M)

5. Write about planning with Propositional Logic and analyse the planning
Approaches.

6. What is Learning ? Write about different forms of Learning ? and explain about
statistical Learning Method.

7. What is mean by behaviour of the system? How the AI program will Design the
agent program Write about the structure & Classification of Agents in detail ?

8. Answer any Two of the Following

a) Design a neural network for Exclusive - OR by giving complete logic
b) Unification Algorithm
c) Learning with Hidden Variables

- 00 -- 00 --

91
 Sreenidhi Institute of Science & Technology A 10
(An Autonomous Institution)
Code No: 101CS11/111CS11
B. TECH. III – Year II – Semester Examinations, MAY, 2014 (Regular, Supple.)
ARTIFICIAL INTELLIGENCE ( CSE )
Time: 3 Hours Max. Marks : 70

Note : No additional answer sheets will be provided.

Part-A (Objective Type)
Max.Marks:20
ANSWER ALL QUESTIONS.
1. Define rationalagent?
2. What are the different branches of AI?
3. What are the differences between uninformed search and informed search?
4. Explain why problem formation must follow goal formulation.
5. What are planning graphs?
6. What are the limitations of propositional logic?
7. Define supervised learning?
8. Write a generic knowledge base agent algorithm?
9. What is linearly separable?
10. What is resolution?

Part – B
Max. Marks: 50
ANSWER ANY FIVE QUESTIONS. EACH QUESTION CARRIES 10 MARKS.
1. a) Briefly explain about leaning agent with neat diagram.
b) Explain fully observable VS partially observable environment.
2. a) What is Depth first search techniques and what are its drawbacks.
b) Write a Best fit algorithm.
3. a) Explain backward state space search with an example.
b) What do you mean by partial order planning?
4. a) Explain forward and backward chaining in propositional logic.
b) Consider the following axioms
P
(P ^ Q) -> R
(SVT) -> Q
T
Prove R using resolution in propositional logic.
5. a) Explain the various knowledge level of representation involved in the

92
 reasoning Process.
b) Explain the characteristics of procedural representation.
6. a) Write a decision tree learning algorithm.
b) Assess the performance of the above learning algorithm.
7. a) Explain various types of hill climbing with example.
b) Explain disadvantages of hill climbing.
8. a) Explain the use of planning graphs in providing better heuristic estimates
with suitable examples.
b) What is perceptron and how it is useful in learning ?
- 00 -- 00 --

93
 Sreenidhi Institute of Science and Technology Regulations:
(An Autonomous Institution) A15
Code No: 5EC15 Date: 10-Nov-2017 (FN)
B.Tech III-Year I-Semester External Examination, Nov - 2017 (Regular)
ARTIFICIAL INTELLIGENCE (CSE)
Time: 3 Hours Max.Marks:75
Note: a) No additional answer sheets will be provided.
b) All sub-parts of a question must be answered at one place only, otherwise it will not
be valued.
c) Missing data can be assumed suitably.

Part - A
Max.Marks:25
ANSWER ALL QUESTIONS.
1 What is Percept sequence? Define Agent Function? [3M
]
2 Write the Lifted version of Modus Ponens. [3M
]
3 What is Overfitting? [3M
]
4 Write Baye’s Formula. [3M
]
5 What is Linear Machine? [3M
]
6 What is Back Propagation? [2M
]
7 Write the four ways to evaluate an algorithm’s performance. [2M
]
8 What is Normal Density? [2M
]
9 Write about the Transfer Function in Neural Network. [2M
]
10 What is segmentation? [2M
]
Part – B
Max.Marks:50
ANSWER ANY FIVE QUESTIONS. EACH QUESTION CARRIES 10 MARKS.

1 a Write about the DFS Blind Search. [6M

) ]
b) Explain uniformed search strategy. [4M]
2 a) Write the Inference Rules for Quantifiers. [5M]

94
 b) Explain the Incremental forward chaining. [5M]
3 a) Explain various Sub-Problems in pattern classification. [5M]
b) Write the process in automating a machine. [5M]
4 a) Explain Minimax Criterion. [3M]
b) Explain Bayes Decision Theory for discrete features. [7M]
5 a) Explain Two-Category Linear Classifier. [8M]
b) Write Quadratic Discriminant function. [2M]
6 a) Explain Single Layer Neural Network and its classification [7M]
performance.
b) Explain Expressive power in Neural networks. [3M]
7 a) Write about the Resolution strategies. [5M]
b) Write the steps in Knowledge engineering process. [3M]
c) What is universal quantifier? [2M]
8 a) Explain different Pattern Classifiers with their representations. [6M]
b) Explain Bayes Risk. [2M]
c) What is Class-Conditional Probability function? [2M]
5. -- 00 -- 00 –

95
 H.T No Regulations:
Sreenidhi Institute of Science and Technology A15
(An Autonomous Institution)
Code No: 5EC15 Date: 29-Nov-2018 (FN)
B.Tech III-Year I-Semester End External Examination, November - 2018 (Regular)
ARTIFICIAL INTELLIGENCE (CSE)
Time: 3 Hours Max.Marks:75
Note: a) No additional answer sheets will be provided.
b) All sub-parts of a question must be answered at one place only, otherwise it will not be valued.
c) i) Missing data can be assumed suitably. ii) steam tables are to be permitted.

Part - A
Max.Marks:25
ANSWER ALL QUESTIONS.
6.
1. Describe rational agent. [3M
]
2. Summarize backward chaining. [3M
]
3. Explore feature extraction. [3M
]
4. Determine decision rule in Bayesian decision theory. [3M
]
5. Why quadratic discriminant function is used? [3M
]
6. Discuss learning rate in back propagation algorithm. [2M
]
7. Explain first order inference. [2M
]
8. What is meant by segmentation? [2M
]
9. What are Linearly Separable Cases? [2M
]
10 Define first order logic. [2M
. ]
Part – B
Max.Marks:50

96
 ANSWER ANY FIVE QUESTIONS. EACH QUESTION CARRIES 10 MARKS.
11 a Explain Depth First Search with an example. [5M
. ) ]
b) Explore Greedy best first search technique. [5M]

12. a) Describe inference in first order logic with an example. [5M]

b) Mention resolution patterns in propositional logic. [5M]

13. a) Write about connection of pattern recognition with related fields. [5M]
b) Brief the sub-problems in classification noise. [5M]

14. a) Analyze two-category classification. [5M]

b) Explain multi category case with suitable case study. [5M]

15. a) Discuss linear decision boundaries for a four-class problem. [5M]

b) Describe Gradient descent procedures. [5M]

16. a) Explain simple processing element with its features. [5M]

b) What is the importance of network learning? [5M]

17. a) Define AI problem with its characteristics. [4M]

b) What is the importance of Unification? [3M]
c) Describe segmentation and grouping. [3M]

18. a) How Bayes decision theory applied to discrete features? [4M]

b) What is generalized linear discriminant function? [3M]
c) Define training error with illustration [3M]

97
SREENIDHI INSTITUTE OF SCIENCE & TECHNOLOGY
(AN AUTONOMOUS INSTITUTION UNDER JNTUH)
(Approved by AICTE &Aided by World Bank under TEQIP)
Yamnampet, Ghatkesar Mandal, Hyderabad - 501 301.

COURSE FILE
For

Cyber Security

For

B. Tech. IV year - I Semester

Computer Science and Engineering

DEPARTMENT
OF
Computer Science and Engineering
2021

98
 PO 1 2 3 4 5 6 7 8 9 10 11 12
Level M M
Syllabus for B. Tech. IV Year I semester
Computer Science and Engineering
CYBER SECURITY
(Mandatory Course)
L T P C
2 - - 0
Code: 7FC20

Prerequisite : Nil
Course Objectives:
 To familiarize with network security, network security threats, security services, and
countermeasures.
 To be aware of computer security and Internet security.
 To study the defensive techniques against these attacks.
 To familiarize with cyber forensics.
 To be aware of cyber crime related to mobile and laptop etc.
 To acquire knowledge relating to Cyberspace laws and Cyber crimes.
 To understand ethical laws of computer for different countries, Offences under the Cy-
berspace and Internet in India.

Course Outcomes: At the end of this course the student will be able to
1. Understand cyber-attacks, types of cybercrimes.
2. Realize the importance of cyber security and various forms of cyber attacks and
countermeasures.
3. Get familiarity of cyber forensics.
4. Get familiar with obscenity and pornography in cyber space and understand the violation
of Right of privacy on Internet.

5. Appraise Cyber laws and also how to protect them self and ultimately the entire Internet
community from such attacks.
6. Elucidate the various chapters of the IT Act 2008, power of Central and State
Government to make rules under IT Act 2008.

99
UNIT-I: Introduction to cyber Security
Introduction to Cyber Security: Basic Cyber Security Concepts, layers of security, Vulnerability,
threat, Harmful acts, motive of attackers, active attacks, passive attacks, Software attacks,
hardware attacks, Spectrum of attacks, Taxonomy of various attacks, IP spoofing, Methods of
defense, Security Models, risk management, Cyber Threats-Cyber Warfare, Cyber Crime, Cyber
terrorism, Cyber Espionage, etc.,

UNIT-II: Cyber Forensics:

Introduction to cyber forensic, Historical background of Cyber forensics, Digital Forensics
Science, The Need for Computer Forensics, Cyber Forensics and Digital evidence, Forensics
Analysis of Email, Digital Forensics Lifecycle, Forensics Investigation, Challenges in Computer
Forensics, Special Techniques for Forensics Auditing.

UNIT-III: Cybercrime: Mobile and Wireless Devices:

Introduction, Proliferation of Mobile and Wireless Devices, Trends in Mobility, Credit card
Frauds in Mobile and Wireless Computing Era, Security Challenges Posed by Mobile Devices,
Registry Settings for Mobile Devices, Authentication service Security, Attacks on Mobile/Cell
Phones, Mobile Devices: Security Implications for Organizations, Organizational Measures for
Handling Mobile, Organizational Security Policies and Measures in Mobile Computing Era,
Laptops and desktop.

UNIT-IV: Cyber Security: Organizational Implications:

Introduction cost of cybercrimes and IPR issues, web threats for organizations, security and
privacy implications, social media marketing: security risks and perils for organizations, social
computing and the associated challenges for organizations.
Cybercrime and Cyber terrorism: Introduction, intellectual property in the cyberspace, the
ethical dimension of cybercrimes the psychology, mindset and skills of hackers and other cyber
criminals.

UNIT-V: Privacy Issues:

Basic Data Privacy Concepts: Fundamental Concepts, Data Privacy Attacks, Data linking and
profiling, privacy policies and their specifications, privacy policy languages, privacy in different
domains- medical, financial, etc.

UNIT-VI: Cyberspace and the Law &Miscellaneous provisions of IT Act.

Introduction to Cyber Security Regulations, International Law. The INDIAN Cyberspace,
National Cyber Security Policy. Internet Governance – Challenges and Constraints, Computer
Criminals, CIA Triad, Assets and Threats.
Other offences under the Information Technology Act in India, The role of Electronic Evidence
and miscellaneous provisions of the IT Act.2008.

100
Cybercrime: Examples and Mini-Cases
Examples: Official Website of Maharashtra Government Hacked, Indian Banks Lose Millions of
Rupees, Parliament Attack, Pune City Police Bust Nigerian Racket, e-mail spoofing instances.
Mini-Cases: The Indian Case of online Gambling, An Indian Case of Intellectual Property
Crime, Financial Frauds in Cyber Domain.

TEXT BOOKS:
1. Nina Godbole and Sunit Belpure, Cyber Security Understanding Cyber Crimes, Computer
Forensics and Legal Perspectives, Wiley
2. B. B. Gupta, D. P. Agrawal, Haoxiang Wang, Computer and Cyber Security: Principles, Algo-
rithm, Applications, and Perspectives, CRC Press, ISBN 9780815371335, 2018.

REFERENCE BOOKS:
1. Cyber Security Essentials, James Graham, Richard Howard and Ryan Otson, CRC Press.
2. Introduction to Cyber Security, Chwan-Hwa(john) Wu,J. David Irwin, CRC Press T&F
Group.
3. Debby Russell and Sr. G.T Gangemi, "Computer Security Basics (Paperback)”,
2ndEdition, O’ Reilly Media, 2006.
4. Wenbo Mao, “Modern Cryptography – Theory and Practice”, Pearson Education, New
Delhi, 2006.
5. Cyberspace and Cybersecurity, George Kostopoulos, Auerbach Publications, 2012.
6. Cyber Forensics: A Field Manual for Collecting, Examining, and Preserving Evidence of
Computer Crimes, Second Edition, Albert Marcella, Jr., Doug Menendez, Auerbach
Publications, 2007.
7. Cyber Laws and IT Protection, Harish Chander, PHI, 2013

101
Lecture Schedule

Total No. of lecture hours required = 42

No. of
Unit Classes Topic to be covered
required
Introduction to Cyber Security
Layers of Security
Unit-I 7
Taxonomy of various attacks
Cyber Threats-Cyber Warfare
Introduction to cyber forensic
Cyber Forensics and Digital evidence
7 Forensics Analysis of Email
Unit-II
Challenges in Computer Forensics
Forensics Auditing
Introduction to Cyber Crimes
Proliferation of Mobile and Wireless Devices
Security Challenges Posed by Mobile Devices
Unit -III 7 Attacks on Mobile/Cell Phones
Organizational Security Policies and Measures in Mobile
Computing Era
Cyber Security: Organizational Implications
IPR issues
security and privacy implications
Unit -IV social computing and the associated challenges
Cybercrime and Cyber terrorism
7 ethical dimension of cybercrimes the psychology
mindset and skills of hackers
Basic Data Privacy Concepts
Data Privacy Attacks
Unit-V Data linking and profiling
7 privacy policy and specifications
privacy in different domains
Cyber Security Regulations
International Law
The INDIAN Cyberspace
National Cyber Security Policy
Unit-VI Internet Governance – Challenges and Constraints
7 CIA Triad
Assets and Threats
Electronic Evidence and miscellaneous provisions of the IT
Act.2008
Cybercrime: Examples and Mini-Cases

102
Previous Question Papers from JNTUK

103
104
105
106
 Unit Wise Questions

CYBER SECURITY
UNIT I

(a) Explain in detail about various types of cyber crime and discuss brie?y about Web Server.
(b) Explain the n-tier web application architecture With an example.
(c) Explain about public key cryptography, its applications With an example.
(d) Describe the overview of cybercrime, nature and scope of cybercrime.

UNIT II

(a) Apply RSA algorithm to perform encryption and decryption for the p = 3; q = 11, e = 7;M=5.
(b) Describe briefly about mail bombs and exploitation and various web attacks.
(c) What are digital laws and legislation? What are the roles and responses of law enforcement?
Explain.
(d) Explain security management system in online shopping and payment gateway system.

UNIT III

(a) Differentiate between symmetric and asymmetric encryptions

(b) Explain briefly about cybercrime investigation tools.
(C) Explain about email tracking, IP tracking and digital evidence collection?
(d) What step you will take to conclude that a URL is malicious and steps Will you take When
you encounter a malicious URL.

UNIT IV

(a) What are the advanced tools used for forensics software and hardware analysis explain.
(b) Can a computer spoof a top connection to frame another computer in the same broadcast
domain? If so, explain in detail how? If not 7 explain Why not. .
(d) Explain briefly the concept of digital forensics with example.
(c) Explain in detail about how forensics helps in face ,iris, ?fingerprint recognition, audio Video
analysis.

UNIT V

a) Explain in detail how large scale applications are protected from unauthorized users.
b) Explain the digital evidence handling procedure and evidence control.
c) List and explain all the sections of the electronic communication privacy act. Give example
situation where a criminal is let free due to the drawbacks in electronic communication privacy
act.
d) Assume you are developing a website of a UNIVERSITY. List all the JDBC APIs and JDBC
drivers used to develop the software.

107
UNIT VI

a) Explain Cyber Security Regulations and International Law.

b) In detail explain National Cyber Security Policy.
c) Explain Internet Governance – Challenges and Constraints,
d) Explain Below Terms
1. Computer Criminals,
2. CIA Triad,
3. Assets and Threats.

108