Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

R22 Ii Cy Syll

Download as pdf or txt
Download as pdf or txt
You are on page 1of 37

ACHARYA NAGARJUNA UNIVERSITY

SCHEME OF INSTRUCTION AND EXAMINATION, w.e.f. 2022


DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
B.Tech. CYBER SECURITY (CYS)
II/IV B. Tech SEMESTER-I

Scheme of
Course Details Category Scheme of Examination
Instruction
S.No. Hours in a
Marks
Code Subject Name Week Credits
L T P Internal External
22CS/AM/
Probability &
1 CYS/DS ES 3 0 0 30 70 3
Statistics
211
22CS/CYS
2 Java Programming PC 3 0 0 30 70 3
212
22CS/CYS
3 Operating System PC 3 0 0 30 70 3
213
Introduction to Cyber
4 22CYS 214 PC 3 0 0 30 70 3
Security
22CS/AM/
Professional Ethics
5 CYS/DS MC 3 0 0 30 70 0
and Human Values
215
22CS/CYS
6 Java Lab 0 0 3 30 70 1.5
251 PC

22CS/CYS
7 Operating System Lab PC 2 0 0 30 70 1.5
252
22 CYS
8 Cyber Security Lab PC 0 0 3 30 70 1.5
253
22CS/AM/
Statistics Using R
9 CYS/DS Skill 0 0 3 30 70 2
LAB
254
Total Credits 18.5

S. No Category Abbreviation Required Credits Criteria


1 BSC Basic Science Course 3
2 PC Program Core Course 13.5
3 SC Skill Oriented Course 2
4 MC Mandatory Course 0
ACHARYA NAGARJUNA UNIVERSITY
SCHEME OF INSTRUCTION AND EXAMINATION, w.e.f. 2022
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
B.Tech. CYBER SECURITY (CYS)
II/IV B. Tech SEMESTER-II
Scheme of
Course Details Category Instruction Scheme of Examination
Hours in a
S.No.
Week Marks
Code Subject Name
L T P Internal External Credits
22CS/AM/
CYS/DS Discrete
1 221 Mathematics BSC 3 0 0 30 70 3
22CS/AM/ Essence of Indian
CYS/DS Traditional
2 222 Knowledge HSC 3 0 0 30 70 3
22CYS/CS Data Structures &
3 223 Algorithms PC 3 0 0 30 70 3
Database
22CS/CYS Management
4 224 Systems PC 3 0 0 30 70 3
22CS/CYS
5 225 Unix Programming PC 3 0 0 30 70 3

6 22CYS 226 Coding Theory PC 3 0 0 30 70 3


22CYS/CS Data Structures &
7 261 Algorithms Lab PC 0 0 2 30 70 1.5
22CS/CYS
8 262 DBMS Lab PC 0 0 2 30 70 1.5
22CS/CYS
9 263 UNIX Lab PC 0 0 2 30 70 1.5
22CS/AM/
CYS/DS Communicative
10 264 English Lab II SKILL 0 0 3 30 70 2
Total Credits 24.5
Internship 2 Months (Mandatory) during Summer vacation
Honors/Minor Courses ( The hours distribution can be 3-0-2 or 3-1-0 also) 4

S. No Category Abbreviation Required Credits


Criteria
1 BSC Basic Science Course 3
2 PC Program Core Course 16.5
3 SC Skill Oriented Course 2
4 HSC Humanities and Social Sciences 3
II/IV B. Tech SEMESTER-I
22CS/AM/CYS/DS 211 Probability & Statistics L T P M C
3 0 0 100 3

COURSE OBJECTIVES
To provide the students with sufficient knowledge in probability and statistics, this can be
used in their respective fields.

COURSE OUTCOMES
By the end of the semester, the student will be able to:

1. Remembering the theory and have practical knowledge of Statistics, Measures of


Central tendency, Variability, Skewness, Kurtosis, correlation, rank correlation,
regression coefficients, principle of least squares.
2. Understanding the clear conception of the terms Probability, random variables
(discrete and continuous), probability density functions, mathematical expectation.
3. Analysing evaluation of Probability distribution - Binomial, Poisson approximation to
the binomial distribution and normal distribution-their properties.
4. Evaluation about the Estimation- sampling distribution, point estimation, Formulation
of null hypothesis, Large Sample: Tests of significance and Confidence interval.
5. Evaluation of Student t-distribution, F-test, χ2 - test for goodness of fit, about test for
independence of attributes.

Syllabus:

Unit 1: Descriptive statistics


Statistics Introduction, Population vs Sample, Measures of Central tendency, Measures of
Variability (spread or variance) Skewness Kurtosis, correlation, correlation coefficient, rank
correlation, regression coefficients, principle of least squares, method of least squares,
regression lines.

UNIT 2: Probability
Probability, probability axioms, addition law and multiplicative law of probability,
conditional probability, Baye’s theorem, random variables (discrete and continuous),
probability density functions, properties, mathematical expectation, addition and
multiplication theorems on mathematical expectation.

UNIT 3: Probability distributions


Probability distribution - Binomial, Poisson approximation to the binomial distribution and
normal distribution-their properties. Central limit theorem applications.

Unit 4: Estimation and Testing of hypothesis, large sample tests


Estimation-parameters, statistics, sampling distribution, point estimation, Formulation of null
hypothesis, alternative hypothesis, the critical and acceptance regions, level of significance,
two types of errors and power of the test. Large Sample Tests: Test for single proportion,
difference of proportions, test for single mean and difference of means.
Unit 5: Small sample tests
Student t-distribution (test for single mean, two means and paired t-test), testing of equality of
variances (F-test), χ2 - test for goodness of fit, χ2 - test for independence of attributes.
Confidence interval for parameters in one sample and two sample problems, difference
between testing of hypothesis and interval estimation.

Reference Books:
1. Miller and Freunds, Probability and Statistics for Engineers,7/e, Pearson, 2008.
2. S.C. Gupta and V.K. Kapoor, Fundamentals of Mathematical Statistics, 11/e, Sultan
Chand & Sons Publications, 2012.
3. S. Ross, a First Course in Probability, Pearson Education India, 2002.
4. W. Feller, an Introduction to Probability Theory and its Applications, 1/e, Wiley,
1968.

Mapping of course outcomes with program outcomes:


CO's
No. PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 2 - 3 2 - - - - - - 1 - -

CO2 3 2 - 3 2 - - - - - - 1 - -

CO3 3 2 - 3 2 - - - - - - 1 - -

CO4 3 2 - 3 2 - - - - - - 1 - -

CO5 3 1 - 3 2 - - - - - - 1 - -
22CS/CYS 212 Java Programming L T P M C
3 0 0 100 3
COURSE OBJECTIVES:
1. Understand the fundamental concepts of Java programming language.
2. Design and implement object-oriented programs using Java.
3. Implement algorithms and data structures in Java.
4. Develop graphical user interfaces (GUIs) using Java Swing
5. Utilize exception handling and error handling techniques in Java programs.

COURSE OUTCOMES:
At the end of the course students will be able to:

1. Apply knowledge of basic syntax, data types, and control structures of Java.
2. Design and implement object-oriented programs using classes, objects, and inheritance.
3. Implement common algorithms and data structures using Java programming.
4. Develop GUI applications using Java Swing
5. Implement exception handling mechanisms and error handling techniques in Java
programs

Syllabus:
UNIT - I
OOP concepts – Data abstraction, encapsulation, inheritance, benefits of inheritance,
polymorphism, classes and objects, Procedural and object-oriented programming paradigms.

Java programming – History of Java, comments, data types variables constants, scope and
life time of variables, operators, operator hierarchy, expressions, type conversion and casting,
enumerated types, simple java stand along programs, arrays, console input and output,
formatting output, constructors, methods, parameter passing, static fields and methods, access
control, this reference, overloading methods and constructors, recursion, garbage collection,
building strings, exploring string class. .

UNIT - II
Inheritance – inheritance hierarchies, super and sub classes, Member access rules, super
keyword, preventing inheritance: final classes and methods, the Object class and its methods.
Polymorphism – dynamic binding, method overriding, abstract classes and methods.
Interfaces – interfaces vs. Abstract classes, defining an interface implementing interfaces,
accessing implementations through interface references, extending interface.
Inner classes – Uses of inner classes, local inner classes, anonymous inner classes, static
inner classes, examples.
Packages – Defining, Creating and Accessing a Package, Understanding CLASSPATH,
importing packages.

UNIT - III
Exception handling - Dealing with errors, benefits of exception handling, the classification of
exceptions – exception hierarchy, checked exceptions and unchecked exceptions, usage of try,
catch, throw, throws and finally, re-throwing exceptions, exception specification, built in
exceptions, creating own exception sub classes.
Multithreading - Differences between multiple processes and multiple threads, thread states,
creating threads, interrupting threads, thread priorities, synchronizing threads, inter-thread
communication, producer consumer pattern.

UNIT – IV
Collection Framework in Java - Introduction to Java Collections, Overview of Java Collection
Frame work, Generics, Commonly used Collection classes – Array List, Vector, Hash table,
Stack, Enumeration, Iterator, String Tokenizer, Random, Scanner, calendar and Properties
Files – Streams – byte streams, character streams, text input/output, binary input/output, random
access file operations, File management using File class.

UNIT – V
GUI Programming with Java – The AWT class hierarchy, introduction to Swing, Swing vs
AWT, Hierarchy for Swing components, Containers – JFrame, JApplet, JDialog, JPanel,
Overview of some swing components – Jbutton, JLabel, JTextField, JTestArea, Simple swing
applications, Layout management – Layout manger types – border, grid and flow
Event handling – Events, Event Sources, Event classes, Event Listeners, Relationship between
Event sources and Listeners, Delegation event model, Examples: handling a button click,
handling mouse events, Adapter classes.

TEXT BOOK:
1. Java Fundamentals – A comprehensive introduction, Herbert Schildt and Dale Skrien, TMH
REFERENCE BOOKS:
1. Java for Programmers, P.J.Deitel and H.M.Deitel, Pearson education (OR) Java: How to
program P.J.Deitel and H.M.Deitel, PHI.
2. Object Oriented Programming through Java, P. Radha Krishna Universities Press.
3. Thinking in Java, Bruce Eckel, Pearson Education.
4. Herbert Schildt (2010), The complete reference, 7th edition, Tata Mc graw Hill, New Delhi
5. Cay S. Horstmann and Gary Cornell, “Core Java: Volume I – Fundamentals”, Eighth
Edition, Sun Microsystems Press, 2008.
6. Head First Java, O’rielly publications
7. T. Budd (2009), An Introduction to Object Oriented Programming, 3rd edition, Pearson
Education, India.
8. Nino, F. A. Hosch (2002), An Introduction to programming and OO design using Java,
John Wiley & sons, New Jersey.
9. Y. Daniel Liang (2010), Introduction to Java programming, 7th edition, Pearson
education, India.

MAPPING OF CO’s &PO’s

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 1 1 1 1 1 1
CO2 1 3 1 1 1
CO3 1 1 3 1 1 1
C04 1 1 2 3 1 1
C05 1 1 2 1 2 1 1
22CS/CYS 213 Operating Systems L T P M C
3 0 0 100 3
Objectives of the course:
To learn the fundamentals of Operating Systems.
1. To learn the mechanisms of OS to handle processes and threads and their communication
2. To learn the mechanisms involved in memory management in contemporary OS.
3. To gain knowledge on distributed operating system concepts that includes architecture,
Mutual exclusion algorithms, deadlock detection algorithms and agreement protocols.
4. To know the components and management aspects of concurrency management.
5. To learn to implement simple OS mechanisms.

Course Outcomes:
After successful completion of the course, students will be able to:
1. Remembering the fundamental concepts of an operating system functionality, and
processes.
2. Apply the concepts of multithreading and IPC mechanisms and also analyse the
performance of CPU scheduling algorithms, page replacement algorithms, and disk
scheduling algorithms.
3. Understanding the methods to solve critical section problem and deadlock handling in a
system.
4. Analyse the effectiveness and the hardware support required for contiguous, non-
contiguous, and virtual memory management schemes.
5. Analyse various disk scheduling methods.

UNIT I:
Introduction: Concept of Operating Systems, Generations of Operating systems, Types of
Operating Systems, OS Services, System Calls, Structure of an OS-Layered, Monolithic,
Microkernel Operating Systems, Concept of Virtual Machine. Case study on UNIX and
WINDOWS Operating System.

UNIT II:
Processes: Definition, Process Relationship, Different states of a Process, Process State
transitions, Process Control Block (PCB), Context switching
Thread: Definition, Various states, Benefits of threads, Types of threads, Concept of
multithreads
Process Scheduling: Foundation and Scheduling objectives, Types of Schedulers,
Scheduling criteria: CPU utilization, Throughput, Turnaround Time, Waiting Time, Response
Time; Scheduling algorithms: Pre-emptive and Non pre-emptive, FCFS, SJF, RR;
Multiprocessor scheduling: Real Time scheduling: RM and EDF.

UNIT III:
Inter-process Communication: Critical Section, Race Conditions, Mutual Exclusion,
Hardware Solution, Strict Alternation, Peterson’s Solution, The Producer\ Consumer
Problem, Semaphores, Event Counters, Monitors, Message Passing, Classical IPC Problems:
Reader’s & Writer Problem, Dinning Philosopher Problem etc.
Deadlocks: Definition, Necessary and sufficient conditions for Deadlock, Deadlock
Prevention, Deadlock Avoidance: Banker’s algorithm, Deadlock detection and Recovery.
UNIT IV:
Memory Management: Basic concept, Logical and Physical address map, Memory
allocation: Contiguous Memory allocation – Fixed and variable partition–Internal and
External fragmentation and Compaction; Paging: Principle of operation – Page allocation –
Hardware support for paging, Protection and sharing, Disadvantages of paging.
Virtual Memory: Basics of Virtual Memory – Hardware and control structures – Locality of
reference, Page fault , Working Set , Dirty page/Dirty bit – Demand paging, Page
Replacement algorithms: Optimal, First in First Out (FIFO), Second Chance (SC), Not
recently used (NRU) and Least Recently used (LRU).

UNIT V:
File Management: Concept of File, Access methods, File types, File operation, Directory
structure, File System structure, Allocation methods (contiguous, linked, indexed), Free-
space management (bit vector, linked list, grouping), directory implementation (linear list,
hash table), efficiency and performance.
Disk Management: Disk structure, Disk scheduling - FCFS, SSTF, SCAN, C-SCAN, Disk
reliability, Disk formatting, Boot-block, Bad blocks.

Reference books:
1. Operating System Concepts Essentials, 9th Edition by AviSilberschatz, Peter Galvin, Greg
Gagne, Wiley Asia Student Edition.
2. Operating Systems: Internals and Design Principles, 5th Edition, William Stallings,
Prentice Hall of India.
3. Operating System: A Design-oriented Approach, 1st Edition by Charles Crowley, Irwin
Publishing
4. Operating Systems: A Modern Perspective, 2nd Edition by Gary J. Nutt, Addison-Wesley
5. Design of the Unix Operating Systems, 8th Edition by Maurice Bach, Prentice-Hall of
India
6. Understanding the Linux Kernel, 3rd Edition, Daniel P. Bovet, Marco Cesati,O'Reilly and
Associates.

MAPPING OF CO’s &PO’s:

Mapping of Course Outcomes with Program Outcomes

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

CO1 2 - 2 - - - - - - - 1 1 2

CO2 3 - 2 1 1 - - - - - - 1 1 2

CO3 2 - 2 1 1 - - - - - - 1 1 1

CO4 2 2 3 1 1 - - - - - - 1 1 2

CO5 2 2 2 - 1 - - - - - - 1 1 1
22CYS 214 Introduction To Cyber Security L T P M C
3 0 0 100 3
Course Objectives:

1. Understand the fundamental s of cyber security and cybercrimes.


2. Understand the tools and methods in cybercrimes and understanding computer
forensics
3. Learn the foundations of Cyber security and threat landscape.
4. To equip students with the technical knowledge and skills needed to protect and
defend against cyber threats.
5. To develop skills in students that can help them plan, implement, and monitor cyber
security mechanisms to ensure the protection of information technology assets.

COURSE OUT COMES:

1. After completion of this module, students would be able to understand the concept of
Cyber security and issues and challenges associated with it.
2. Students, at the end of this module, should be able to understand the cybercrimes,
their
nature ,legal remedies and as to how report the crimes through available platforms and
procedures
3. On completion of this module, students should be able to appreciate various privacy
and security concerns on online Social media and understand the reporting procedure
of inappropriate content, underlying legal aspects and best practices for the use of
Social media platforms.
4. After the completion of this module, students would be able to understand the basic
concepts related to E-Commerce and digital payments. They will become familiar
with various digital payment modes and related cyber security aspects, RBI guidelines
and preventive measures against digital payment frauds.
5. Students, after completion of this module will be able to understand the basic security
aspects related to Computer and Mobiles. They will be able to use basic tools and
technologies to protect their devices

UNIT-I
Introduction to Cyber security: Defining Cyberspace and Overview of Computer and Web-
technology, Architecture of cyberspace, Communication and web technology, Internet,
World wide web, Advent of internet, Internet infrastructure for data transfer and governance,
Internet society, Regulation of cyberspace, Concept of cyber security, Issues and challenges
of cyber security.

UNIT-II
Cybercrime and Cyber law: Classification of cybercrimes, Common cybercrimes- cyber-
crime targeting, computers and mobiles, cybercrime against women and children, financial
frauds, social engineering attacks, malware and ransom ware attacks, zero day and zero click
attacks, Cybercriminals modus-operandi ,Reporting of cybercrimes, Remedial and mitigation
measures, Legal perspective of cybercrime, IT Act 2000 and its amendments, Cybercrime
and offences, Organisations dealing with Cybercrime and Cyber security in India, Case
studies.

UNIT-III
Social Media Overview and Security: Introduction to Social networks, Types of Social
media, Social media platforms, Social media monitoring, Hash tag, Viral content, Social
media marketing, Social media privacy, Challenges, opportunities and pitfalls in online social
network, Security issues related to social media, Flagging and reporting of inappropriate
content, Laws regarding posting of inappropriate content, Best practices for the use of Social
media, Case studies.

UNIT-IV

E - Commerce and Digital Payments: Definition of E- Commerce, Main components of E-


Commerce, Elements of E-Commerce security, E-Commerce threats, E-Commerce security
best practices, Introduction to digital payments, Components of digital payment and stake
holders, Modes of digital payments- Banking Cards, Unified Payment Interface (UPI), e-
Wallets, Unstructured Supplementary Service Data (USSD), Aadhar enabled payments,
Digital payments related common frauds and preventive measures. RBI guidelines on digital
payments and customer protection in unauthorised banking transactions. Relevant provisions
of Payment Settlement Act, 2007.

UNIT -V

Digital Devices Security, Tools and Technologies for Cyber Security: End Point device
and Mobile phone security, Password policy, Security patch management, Data backup,
Downloading and management of third party software, Device security policy, Cyber
Security best practices, Significance of host firewall and Ant-virus, Management of host
firewall and Anti-virus, Wi-Fi security, Configuration of basic security policy and
permissions.

TEXTBOOKS:
1. SunitBelapure and Nina Godbole, “Cyber Security: Understanding Cyber Crimes,
Computer Forensics And Legal Perspectives”, Wiley India Pvt Ltd, 2013.
2. Dr. Surya PrakashTripathi, RitendraGoyal, Praveen Kumar Shukla, KLSI.
3. “Introduction to information security and cyber laws”.Dreamtech Press., 2015.
4. Cyber Crime Impact in the New Millennium, by R. C Mishra ,Auther Press. Edition
2010

References:
1. Cyber Security Understanding Cyber Crimes, Computer Forensics and Legal Perspectives
by SumitBelapure and Nina Godbole, Wiley India Pvt. Ltd. (FirstEdition, 2011)
2. Security in the Digital Age: Social Media Security Threats and Vulnerabilities by Henry
Oliver, Create Space Independent Publishing Platform. (Pearson , 13th November,2001)
3. Electronic Commerce by Elias M. Awad, Prentice Hall of India Pvt Ltd.
4. Cyber Laws: Intellectual Property & E-Commerce Security by Kumar K, Dominant
Publishers.
5. Network Security Bible, Eric Cole, Ronald Krutz, James W. Conley, 2nd Edition, Wiley
India Pvt. Ltd.
6. Fundamentals of Network Security by E. Maiwald, McGraw Hill.
7. Thomas J. Mowbray, “Cyber security: Managing Systems, Conducting Testing
Investigating Intrusions”, Copyright © 2014 by John Wiley & Sons, Inc, ISBN:78- 1-118 -
84965 -1.
8. James Graham, Ryan Olson, Rick Howard, “Cyber Security Essentials”, CRC Press, 15-
Dec 2010.
9. Anti- Hacker Tool Kit (Indian Edition) by Mike Shema, McGraw-Hill Publication

MAPPING OF CO’s &PO’s:

Mapping of Course Outcomes with Program Outcomes

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

CO1 2 - 2 - - - - - - - 1 1 2

CO2 3 - 2 1 1 - - - - - - 1 1 2

CO3 2 - 2 1 1 - - - - - - 1 1 1

CO4 2 2 3 1 1 - - - - - - 1 1 2

CO5 2 2 2 - 1 - - - - - - 1 1 1
22CS/AM/CYS/DS 215 Professional Ethics and Human Values L T P M C
3 0 0 100 0
Course Objectives:
 Understand the concept of ethics and its importance in professional life.
 Identify and analyze ethical issues and dilemmas in various professional domains.
 Develop ethical decision-making skills and strategies.
 Understand the role of values in shaping professional behavior.
 Foster ethical leadership and responsibility in professional settings.
 Reflect on personal ethical development and growth.
Course Outcomes:
1. Demonstrate knowledge of ethical theories and principles.
2. Analyze and evaluate ethical dilemmas in real-world scenarios.
3. Apply ethical decision-making models to resolve complex problems.
4. Examine the influence of personal and cultural values on professional conduct.
5. Demonstrate leadership skills with integrity and ethical behavior.
UNIT – I

Human Values: Morals, Values and Ethics – Integrity – Work Ethic – Service Learning –
Civic Virtue – Respect for Others – Living Peacefully – caring – Sharing – Honesty –
Courage – Valuing Time – Co-operation – Commitment – Empathy – Self-Confidence –
Character – Spirituality.

UNIT – II

Engineering Ethics: Senses of ‘Engineering Ethics’ – Variety of moral issues – Types of


inquiry – Moral dilemmas – Moral Autonomy – Kohlberg’s theory – Gilligan’s theory –
Consensus and Controversy – Professions and Professionalism – Professional Ideals and
Virtues – Theories about right action – Self-interest – Customs and Religion – Uses of
Ethical Theories.

UNIT – III

Engineering as Social Experimentation: Engineering as Experimentation – Engineers as


responsible Experimenters – Codes of Ethics – A Balanced Outlook on Law.
UNIT - IV
Safety, Responsibility and Rights: Safety and Risk – Assessment of Safety and Risk – Risk
Benefit Analysis and reducing risk.
Collegiality and Loyalty – Respect for Authority – Collective Bargaining – Confidentiality –
Conflicts of Interest – Occupational Crime – Professional Rights – Employee Rights –
Intellectual Property Rights (IPR) - Discrimination
UNIT – V

Global Issues: Multinational Corporations – Environmental Ethics – Computer Ethics –


Weapons Development – Engineers as Managers – Consulting Engineers – Engineers as
Expert Witnesses and Advisors – Moral Leadership – Sample Code of Ethics like ASME,
ASCE, IEEE, Institution of Engineers (India), Indian Institute of Materials Management,
Institution of electronics and telecommunication engineers (ISTE), India, etc.
Reference Books:

1. R.S. Naagarazan “A Textbook on Professional ethics and Human Values”, New Age
International Publihers, 2006.
2. Govindarajan. M, Natarajan. S, Senthilkumar. V.S, “Engineering Ethics”, Prentice
Hall of India, 2004.
3. Charles D Fleddermann, "Engineering Ethics", Prentice Hall, New Jersey, 2004
(Indian Reprint).
4. Charles E Harris, Michael S Pritchard and Michael J Rabins, "Engineering Ethics
Concepts and Cases", Thompson Learning, United States, 2000 (Indian Reprint now
available).
5. John R Boatright, “Ethics and the Conduct of Business”, Pearson Education, New
Delhi, 2003.
6. Edmund G Seebauer and Robert L Barry, “Fundamentals of Ethics for Scientists and
Engineers”, Oxford University Press, Oxford, 2001.

Mapping of CO’s & PO’s:

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

CO1 3 2 1 1 1 1 2 1
CO2 3 2 1 1 1 1 2 1
CO3 3 2 1 1 1 1 2 1
CO4 3 1 1 1 1 2 1
CO5 3 1 1 1 1 2 1
22CS/CYS 251 JAVA Lab L T P M C
0 0 3 100 1.5
COURSE OBJECTIVES:
1. To teach fundamentals of object oriented programming in Java. Understand various
concepts of JAVA.
2. To familiarize Java environment to create, debug and run simple Java programs.
3. To demonstrate java compiler and eclipse platform and learn how to use Net Beans IDE to
create Java Application.
COURSE OUTCOMES:
At the end of the course students will be able to:
1. Implement Object oriented features using Java
2. Apply the concept of polymorphism and inheritance.
3. Implement exception handling
4. Develop network and window application using awt and swings.
Programs:
1. Write a Java program that prompts the user for an integer and then prints out all prime
numbers up to that integer. (use Scanner class to read input)
2. Write a Java program that uses both recursive and non recursive functions to print the nth
value in the Fibonacci sequence.
3. Write a Java program to multiply two given matrices.
4. Write a Java program that checks whether a given string is a palindrome or not.
5. Write a Java program to create a Student class and find the grade of the student.
6. Write a java program to create an abstract class named Shape contains number Of Sides ( )
method and Trapezoid, Triangle and Hexagon classes extends the class Shape.
7. Write a Java program to read copy content of one file to other by handling all file related
exceptions.
8. Write a Java program that reads a file name from the user, and then displays information
about whether the file exists, whether the file is readable, whether the file is writable, the
type of file and the length of the file in bytes.
9. Write a Java program that reads a file and displays the file on the screen.
10. Write a Java program that displays the number of characters, lines and words in a text file.
11. Write a Java program that creates three threads. First thread displays “Good Morning”
everyone second, the second thread displays “Hello” every two seconds and the third
thread displays “Welcome” every three seconds.
12. Write a Java program that works as a simple calculator. Use a grid layout to arrange
buttons for the digits and for the +, -,*, % operations. Add a text field to display the result.
13. Write a Java program for handling mouse events.
14. Write a Java program for handling key events using Adapter classes
15. Develop simple calculator using Swings.
MAPPING OF CO’s &PO’s:
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 2 3 3 1 1 - - - - - - 1 1 1
CO2 2 3 3 1 1 - - - - - - 1 1 1
CO3 2 3 3 1 1 - - - - - - 1 1 1
C04 - - - - - - - 2 2 2 - - 1 1
22CS/CYS 252 Operating Systems Lab L T P M C
0 0 3 100 1.5
COURSE OBJECTIVES: To understand the functionalities of various layers of OSI model

 To explain the difference between hardware, software; operating systems, programs and
files.
 Identify the purpose of different software applications.

COURSE OUTCOMES: At the end of the course the students are able to:

 Ability to implement inter process communication between two processes.


 Ability to design and solve synchronization problems.
 Ability to simulate and implement operating system concepts such as scheduling, Deadlock
management, file management, and memory management.
List of Programs:

1. Simulate the following CPU scheduling algorithms. a) FCFS b) SJF c) Round Robin d)
Priority.

2. Write a C program to simulate producer-consumer problem using Semaphores

3. Write a C program to simulate the concept of Dining-philosophers problem.

4. Simulate MVT and MFT.

5. Write a C program to simulate the following contiguous memory allocation Techniques a)


Worst fit b) Best fit c) First fit.

6. Simulate all page replacement algorithms a)FIFO b) LRU c) OPTIMAL

7. Simulate all File Organization Techniques a) Single level directory b) Two level directory
8. Simulate all file allocation strategies a) Sequential b) Indexed c) Linked.

9. Simulate Bankers Algorithm for Dead Lock Avoidance.

10. Simulate Bankers Algorithm for Dead Lock Prevention.

11. Write a C program to simulate disk scheduling algorithms. a) FCFS b) SCAN c) C-SCAN

MAPPING OF CO’s &PO’s:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 2
CO2 1 1 2 2
CO3 1 1 2 1
22CYS 253 Cyber Security Lab L T P M C
0 0 3 100 1.5
Course Objectives:

The course is designed in a way that a candidate can identify, analyse and remediate
computer security breaches by learning and implementing the real-world scenarios in Cyber
Investigations Laboratory, Network Security Laboratory and in Security and Penetration
Testing Laboratory.

1. Exhibit knowledge to secure corrupted systems, protect personal data, and secure
computer networks in an Organization.
2. Practice with an expertise in academics to design and implement security solutions.
3. Understand key terms and concepts in Cryptography, Governance and Compliance.
4. Develop cyber security strategies and policies
5. Understand principles of web security and to guarantee a secure network by monitoring
and analyzing the nature of attacks through cyber/computer forensics software/tools.

Course Outcomes:

Upon successful completion of the programme, candidates will be familiar with cyber
security landscapes and able to

a) Analyze and evaluate the cyber security needs of an organization.


b) Determine and analyze software vulnerabilities and security solutions to reduce the risk
of exploitation.
c) Measure the performance and troubleshoot cyber security systems

LAB PROGRAMS

1. Study of different wireless network components and features of any one of the Mobile
Security Apps
2. Study of the features of firewall in providing network security and to set Firewall
Security in windows.
3. Steps to ensure Security of any one web browser (Mozilla Firefox/Google Chrome)
4. Study of different types of vulnerabilities for hacking a websites / Web Applications.
5. Analysis the Security Vulnerabilities of E-commerce services.
6. Analysis the security vulnerabilities of E-Mail Application

MAPPING OF CO’s &PO’s:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 1 1 2
CO2 1 1 2 2
CO3 1 1 2 1
22CS/AM/CYS/DS 254 STATISTICS USING R Lab L T P M C
0 0 3 100 2

List of practical’s using R-programming


1. Correlation Coefficient
2. Regression Coefficient
3.Curve fitting
4.Graphs of pmf, pdfs and cdfs of discrete and continuous distributions
5.Estimation
6. Z test
7. t test
8. F test
9. χ2 test
10.Interval Estimation
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
B.Tech. CYBER SECURITY (CYS)
II/IV B. Tech SEMESTER-II
22CS/AM/CYS/DS 221 Discrete Mathematics L T P M C
3 0 0 100 3
Course Objectives:
At the end of the course, the student will
1. Introduce the concepts of mathematical logic.
2. Understand the combinatorial problems using counting principles,
3. Create generating functions and solve recurrence relations.
4. Use Directed & Un-Directed Graphs concepts and its applications.

Course Outcomes:
At the end of the course, the student will be able to
1. Understand formal methods of proof and propositional & First order logic to validate the
propositional statements.
2. Apply techniques for counting the occurrences of discrete events including permutations,
combinations with or without repetitions.
3. Analyse generating function and recurrence relations.
4. Construct the real-world problems using directed and undirected graphs.

UNIT – I

Boolean Algebra, Properties, Boolean polynomials, fundamentals Normal forms, Disjunctive


Normal form, Complete and compliment of a Boolean expression in D.N.F, Conjunctive
Normal form, Complete C.N.F and compliment of a Boolean expression in C.N.F

UNIT – II

Foundations: Sets, Relations and Functions, Methods of Proof and Problem Solving
Strategies, Fundamentals of Logic, Logical Inferences, Methods of Proof of an implication,
First order Logic & Other methods of proof, Rules of Inference for Quantified propositions,
Disjunction normal forms, Conjunction normal forms, Mathematical Induction.

UNIT – III

Recurrence relations, Solving recurrence relations by Substitution and generating functions.


The methods of characteristic roots. Relations and digraphs, Special properties of binary
relations, Equivalence relations. Operations on relation.

UNIT – IV

Partial ordering relations, Poset, Hasse diagram, Lattices, Enumerations, Paths and Closures,
Directed Graphs and Adjacency Matrices, Application : Topological Sorting.
UNIT-V:

Graphs: Basic Concepts, Isomorphisms and Subgraphs, hand shaking theorem, Planar
Graphs, Euler’s Formula; Multigraphs and Euler Circuits, Hamiltonian Graphs, Chromatic
Numbers, The Four Color Problem.

TEXT BOOK:

1. Toe L.Mott, Abraham Kandel& Theodore P.Baker, Discrete Mathematics forComputer


Scientists & Mathematicians, PHI 2nd edition,2008.

2. J.P. Trembly and R. Manohar- Discrete Mathematics for Computer Scientists&


Mathematicians, PHI Ltd., New Delhi, 2nd Edition, 2008.

3. Narasinghdeo Graph Theory , Narosa Publishers

4. Satyanarayana Bhavanari and Syamprasad Kuncham. “Discrete Mathematics and Graph


Theory” by PHI, 2014 second edition.

5.SatyanarayanaBhavanari,T.V.PradeepKumar,Sk.Mohiddinshaw“Mathematical Foundations

for Computer Sciences” by BS Publications, first editions, 2016.

REFERENCE BOOKS:

1. T. Sengadir- Discrete Mathematics-Pearson Education

2. C.L. Liu and D.P. Mohapatra-Elements of Discrete Mathematics, TataMcGraw-Hill ,3rd


Edition, 2008.

3. Seymour Lipschutz, Lipson-Discrete Mathematics-Scaums outlines-TMH.

4. Santha-Discrete Mathematics-Cengage Learning

5. Kenneth H Rosen-Discrete Mathematics & its Applications , TMH, 6ht Edition,2009.

Mapping of Course Outcomes with Program Outcomes

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

CO1 3 3 3 2 - - - - - 2 - 3 1 1

CO2 3 3 2 2 - - - - - 2 - 2 1 1

CO3 3 3 3 2 - - - - - 2 - 2 1 1

CO4 3 3 3 2 - - - - - 2 - 3 1 1
22CS/AM/CYS/DS 222 Essence of Indian Traditional Knowledge L T P M C
3 0 0 100 3
Course Objectives:
The course will introduce the students to:
1. To get a knowledge in Indian Culture
2. To know Indian languages , literature and the fine arts in India.
3. To explore the science and scientists of Medieval and Modern India..

Course Outcomes:
After successful completion of the course the students will be able to
1. Understand philosophy of Indian culture.
2. Distinguish the Indian languages and literature.
3. Learn the philosophy of ancient, medieval and modern India.
4. Acquire the information about the fine arts in India
5. Know the contribution of scientists in different eras

UNIT I:
Introduction to Culture: Culture, civilization, culture and heritage, general characteristics
of culture, importance of culture in human literature, Indian Culture, Ancient India, Medieval
India, Modern India.

UNIT II:
Indian Languages, culture and Literature: The role of Sanskrit, Significance of scriptures
to current society, Indian philosophies, other Sanskrit literature, literature of South India.

UNIT III:
Religion and Philosophy: Religion and Philosophy in ancient India, Religion and
Philosophy in Medieval India, Religious reform movements in Modern India(selected
movements only).

UNIT IV:
Fine Arts in India: (Arts, Technology & Engineering): Indian painting, Indian handicrafts,
music, divisions of Indian classic music, modern Indian music, Dance and Drama, Indian
Architecture (Ancient, Medieval and Modern), Science and Technology in India,
development of science in ancient, medieval and modern India.

UNIT V:
Education system in India: Education in Ancient, Medieval and Modern India, aims of
Education, subjects, languages, science and scientists of Ancient India, Medieval and Modern
India.

Text Books:
1. Kapil Kapoor, “Text and Interpretation: The India Tradition”, ISBN: 81246033375, 2005
2. “Science and Samskrit”, Samskrita BhartiPublisher, ISBN 13:978-8187276333, 2007
3. NCERT, “Position paper on Arts, Music, Dance and Theatre”, ISBN: 81-7450 494- X, 200
MAPPING OF CO’s &PO’s:

Mapping of Course Outcomes with Program Outcomes

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

CO1 - - - - - 2 1 2 1 - - - 1 1

CO2 - - - - - 2 1 2 1 - - - 1 1

CO3 - - - - - 2 1 2 1 - - - 1 1

CO4 - - - - - 2 1 2 1 - - - 1 1

CO5 - - - - - 2 1 2 1 - - - 1 2
22CS/CYS 223 Data Structures & Algorithms L T P M C
3 0 0 100 3
Objectives of the course:
1. To impart the basic concepts of data structures and algorithms.
2. To understand concepts about searching and sorting techniques
3. To understand basic concepts about stacks, queues, lists, trees and graphs.
4. To enable them to write algorithms for solving problems with the help of fundamental data
structures.

Course Outcomes:
At the end of this course, the students will be able to
1. Remembering basic data structure operations and analyse the time and space
complexity of algorithms.
2. Understanding algorithms using the basic operations of stacks and queues and analyse
their complexity.
3. Understanding basic operations of linked lists and analyse their algorithm complexity.
4. Evaluate the performance of selection Sort, Bubble Sort, Insertion Sort, Quick Sort,
Merge Sort, Heap Sort algorithms in term of Space and Time complexity and
implementing the searching algorithms.
5. Constructing binary trees, binary search tress, AVL trees and B+ trees and Graphs.

UNIT I:
Introduction: Basic Terminologies: Elementary Data Organizations, Data Structure
Operations: insertion, deletion, traversal etc.; Analysis of an Algorithm, Asymptotic
Notations, Time-Space trade off.
Array Data Structure: Array ADT and its operations, Time complexity.

UNIT II:
Stacks and Queues: ADT Stack and its operations: Algorithms and their complexity
analysis, Applications of Stacks: Expression Conversion and evaluation – corresponding
algorithms and complexity analysis. ADT queue, Types of Queue: Simple Queue, Circular
Queue, Priority Queue; Operations on each types of Queues: Algorithms and their analysis.

UNIT III:
Linked Lists: Singly linked lists: Representation in memory, Algorithms of several
operations: Traversing, Searching, Insertion into, Deletion from linked list; Linked
representation of Stack and Queue, Header nodes, Doubly linked list: operations on it and
algorithmic analysis; Circular Linked Lists: all operations their algorithms and the
complexity analysis.

UNIT IV:
Sorting: Objective and properties of different sorting algorithms: Selection Sort, Bubble
Sort, Insertion Sort, Quick Sort, Merge Sort, Heap Sort; Performance and Comparison among
all the methods.
Searching: Linear Search and Binary Search Techniques and their complexity analysis.
Hashing: Hash function, Open addressing and separate chaining.

UNIT V:
Trees: Basic Tree Terminologies, Different types of Trees: Binary Tree, Threaded Binary
Tree, Binary Search Tree, AVL Tree; Tree operations on each of the trees and their
algorithms with complexity analysis, Tree traversals.
Graph: Basic Terminologies and Representations, Graph search and traversal algorithms and
complexity analysis.

Reference books:
1. Data Structures and Algorithms by Alfred V Aho,John E Hopcroft, Jeffrey D Uiiman,
Pearson Education.
2. “Fundamentals of Data Structures”, Illustrated Edition by Ellis Horowitz, Sartaj Sahni,
Computer Science Press.
3. Classic Data Structures by Debasis Samanta, PHI Publications.
3. Data Structures LIPSCHUTZ , Schaum publications.

MAPPING OF CO’s &PO’s:

Mapping of Course Outcomes with Program Outcomes

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

CO1 3 3 2 - 1 - - - - - - - 2 1

CO2 3 2 1 - 1 - - - - - - - 2 1

CO3 3 2 1 - 1 - - - - - - - 1 2

CO4 3 2 1 - 1 - - - - - - - 2 1

CO5 2 2 2 2 1 - - - - - - - 2 1
22CS/CYS 224 Database Management Systems L T P M C
3 0 0 100 3
COURSE OBJECTIVES:
 To understand the different issues involved in the design and implementation of a
database system.
 To study the physical and logical database designs, database modeling, relational,
hierarchical, and network models
 To understand and use data manipulation language to query, update, and manage a
database
 To develop an understanding of essential DBMS concepts such as: database security,
integrity, concurrency &Client/Server (Database Server).
 To design and build a simple database system and demonstrate competence with the
fundamental tasks involved with modelling, designing, and implementing a DBMS.

COURSE OUTCOMES:
At the end of the course students will be able to:

1. Understand the basic concepts of database management systems


2. Apply SQL or Relational Algebra operations to find solutions for a given application
3. Apply normalization techniques to improve database design
4. Analyze a real time scenario to use Conceptual and Relational data models for
designing the database

UNIT - I
Introduction to Databases: Characteristics of the Database Approach, Advantages of using
the DBMS Approach, A Brief History of Database Applications, Data Models, Schemas and
Instances, Three-Schema Architecture and Data Independence, Database Languages and
Interfaces, The Database System environment, Centralized and Client-Server Architecture for
DBMSs.

UNIT - II
Conceptual Data Modeling: High-Level Conceptual Data Models for Database Design, A
Sample Database Application, Entity Types, Entity Sets, Attributes and Keys, Relationship
Types, Relationship Sets, Roles, and Structural Constraints, Weak Entity Types, Refining the
ER Design, ER Diagrams, Naming Conventions and Design Issues, Relationship Types of
Degree Higher Than Two. Relational Database Design Using ER-to- Relational Mapping.

UNIT - III
Relational Model: The Relational Model Concepts, Relational Model Constraints and
Relational Database Schemas. Basic SQL: SQL Data Definition and Data Types, Specifying
Constraints in SQL, Basic retrieval Queries in SQL ,INSERT, DELETE AND UPDATE
Statements in SQL More SQL: More complex SQL retrieval queries Advanced Queries,
Specifying constraints on Actions as Triggers, procedures, functions, cursors, Views in SQL
Relational Algebra: Unary Relational Operations: Select and Project, Relational Algebra
Operations from SetTheory, Binary Relational Operations: Join and Division, Examples of
Queries in Relational Algebra.

UNIT - IV
Database Design Theory and Normalization: Functional Dependencies, Normal forms
based on Primary Keys, General definitions of Second and Third Normal Forms , Boyce-
Codd Normal Form, Multi valued Dependencies and Fourth Normal Form, Join
Dependencies and Fifth Normal Form.

UNIT - V
Transaction Processing: Introduction, Transaction and System Concepts, Desirable
Properties of Transactions, Characterizing Schedules Based on Recoverability &
Serializability, Transaction Support in SQL.

Introduction to Concurrency Control: Two-Phase Locking Techniques for concurrency


control: Types of Locks and System Lock Tables, Guaranteeing Serializability by Two-Phase
Locking.
Introduction to Recovery Protocols: Recovery Concepts, No- UNDO/REDO Recovery
Based on Deferred Update, Recovery Techniques Based on Immediate Update, Shadow
Paging.

TEXT BOOK:

1. Fundamentals of Database Systems, Ramez Elmasri,ShamkantB. Navathe, Seventh edition,


Pearson.

REFERENCE BOOKS:

1. Data base System Concepts, Abraham Silberschatz, Henry F Korth, S. Sudarshan,


FifthEdition,McGraw Hill.
2. Data base Management Systems, Raghurama Krishnan, Johannes Gehrke, Third
Edition,TMH.
3. Introduction to Database Systems, C.J.Date, Eigth Edition , Pearson

e-Resources and other Digital Material:

1. https://nptel.ac.in/courses/106/105/106105175/
2. https://onlinecourses.nptel.ac.in/noc21_cs04/
3. https://nptel.ac.in/courses/106/106/106106093/
MAPPING OF CO’s &PO’s:

Contribution of Course Outcomes towards achievement of Program Outcomes & Strength of correlations
(3:Substantial, 2: Moderate, 1:Slight)
PSO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO2
1
CO1 3
CO2 2

CO3 2

CO4 2 1 1 1
22CS/CYS 225 Unix Programming L T P M C
3 0 0 100 3
Course Objectives:
1. Written technical communication and effective use of concepts and terminology.
2. Facility with UNIX command syntax and semantics.
3. Ability to read and understand specifications, scripts and programs.
4. Individual capability in problem solving using the tools presented within the class.

Course Outcomes:
1. Understand the basic Unix architecture, commands and utilities of the UNIX
operating system and to work confidently in Unix/Linux environment and open
systems
2. Creating simple and complex shell scripts to automate various tasks using shell
programming.
3. Analyse file management system calls.
4. Understand various concepts of process and process related commands in UNIX.
5. Understand UNIX system administration and Inter Process Communication.

UNIT I
Introduction to unix: Unix architecture , Features of Unix, Vi editor.
Directory Related utilities- pwd, mkdir, ls, cd ,rmdir.
File Handling and Text Processing utilities-
cp, mv, rm, ln, unlink, lp, cat, more, pg, head, tail, sort ,nl, grep, egrep, fgrep, cut, paste, join,
tee, w ,chgrp, chmod, chown,find, cmp, diff, uniq, tr.
Disk utilities, Backup and other utilities-
du, df, mount, unmount, umask, ulimit,tar, cpio, dump , who, mail, compress, uncompress,
gzip, gunzip, crypt, sed, tty,
Networking utilities – finger, telnet, rlogin, ftp, write, talk, wall.

UNIT-II
Bourne Shell programming:
Shell, functions of the shell , Meta characters, Input redirection, Output redirection, pipes,
shell as programming language, shell variables, predefined local variables, predefined
environment variables, Arithmetic, conditional expressions, control structures, positional
parameters, passing command line arguments, Built – in Shell commands and shell programs.

UNIT-III
File management system calls:
Regular file management system calls – open( ),read( ), write( ) , lseek( ), Close(),unlink( ),
stat( ), getdents( ). Miscellaneous file management system calls – chown( ) and fchown( ),
chmod( ) ,fchmod( ), dup( ) ,dup2( ), fcntl( ), ioctl( ), link( ), mknod( ), sync( ),truncate( ) and
ftruncate( ).

UNIT IV:
Process Management:
Creating a new process – fork( ),orphan processes, terminating a process – exit( ), zombie
processes, waiting for child – wait( ),Differentiating a process – exec( ), changing directories
– chdir( ), changing priorities- nice( ).
UNIT V
Signals: The defined signals, A list of signals, terminal signals, Requesting on Alarm signal –
alarm( ), handling signals – signal( ), protecting critical code and chaining interrupt handlers,
sending signals – kill( ), Death of children, suspending and Resuming processes, process
Group’s and control terminals.
Inter process communication: Pipes, Sockets, shared memory, semaphores.

Reference Book:
1. “Unix for programmers and users” 3rd edition by Graham Glass, King Ables,
Pearson Education.
2. “Advanced programming in the unix environment” w- Richard Stevens 2ndEdition
Pearson education
3. “Unix programming environment”, Kernighan and pike, Pearson education.
4. “Your unix the ultimate guide” Sumitabha Das, TMH 2nd edition.
5. “Advanced unix programming” by Marc J. Rochkind, 2nd edition Pearso

MAPPING OF CO’s &PO’s:

Mapping of Course Outcomes with Program Outcomes

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

CO1 3 1 - 1 - - - - - - - - 1 2

CO2 2 2 1 2 - - - - - - - - 1 1

CO3 3 1 - 1 - - - - - - - - 1 1

CO4 2 1 1 1 - - - - - - - - 1 2

CO5 2 1 1 1 - - - - - - - - 1 1
22CYS 226 Coding Theory L T P M C
3 0 0 100 3

Course Objectives:

1. This is a first-level graduate course on coding theory, which will introduce students to
some of the classical methods in coding theory.
2. To have a complete understanding of error–control coding.
3. To understand encoding and decoding of digital data streams.
4. To introduce methods for the generation of these codes and their decoding techniques.

Course Out Comes:

1. Use algebraic techniques to construct efficient codes


2. Learn measurement of information and errors.
3. Obtain knowledge in designing various source codes and channel codes
4. Design encoders and decoders for block and cyclic codes
5. Understand the significance of codes in various applications

UNIT-I
Mathematical Background:
Algebra,Krawtchouk Polynomials, Combinatorial theory, probability theory

Source Codes: Shannon-fano coding, Huffman coding


UNIT-II
Linear Block codes:Introduction to Linear Block Codes, Syndrome and Error Detection,
Minimum Distance of a Block code, Error-Detecting and Error-correcting Capabilities of a
Block code, Standard array and Syndrome Decoding, Probability of an undetected error for
Linear Codes over a BSC, Hamming Codes. Applications of Block codes for Error

UNIT-III
Cyclic Codes :Description, Generator and Parity-check Matrices, Encoding, Syndrome
Computation and Error Detection, Decoding, Cyclic Hamming Codes, shortened cyclic
codes, Error-trapping decoding for cyclic codes, Majority logic decoding for cyclic codes.

UNIT-IV
Convolutional Codes: Encoding of Convolutional Codes- Structural and Distance
Properties, state, tree, trellis diagrams, maximum likelihood decoding, Sequential decoding,
Majority- logic decoding of Convolution codes. Application of Viterbi Decoding and
Sequential Decoding, Applications of Convolutional codes in ARQ system.

UNIT-V
BCH Codes: Minimum distance and BCH bounds, Decoding procedure for BCH codes,
Syndrome computation and iterative algorithms, Error locations polynomials for single and
double error correction.
TEXTBOOKS:
1. S. Roman, An Introduction to Coding and Information Theory, Springer-Verlag: New
York 1992
2. Ron M. Roth, Introduction to Coding Theory, Cambridge University Press, 2006,
ISBN-13: 978-0521845045.
3. Tom Richardson, RudigerUrbanke, Modern Coding Theory, Cambridge University
Press, 2009, ISBN-13: 978-052116576
References

1. J. A. Thomas and T. M. Cover: Elements of information theory, Wiley, 2006.


2. J. H. van Lint: Introduction to Codinhttps://nptel.ac.in/courses/117/108/117108044/g
Theory, Third Edition, Springer, 1998.
3. F. J. MacWilliams and N.J. Sloane: Theory of Error Correcting Codes, Parts I and II,
North-Holland, Amsterdam, 1977.Network coding: An instant primer
4. P. J. Cameron and J. H. van Lint: Designs, Graphs, Codes and their Links, Cambridge
University Press, 2010.
5. C. Fragouli, J. Le Boudec, J. Widmer:
6. Shu Lin, Daniel J. Costello, Error Control Coding: Fundamentals and Applications,
Prentice-Hall, 1982, ISBN-13: 978-0132837965.
7. W. Cary Huffman, Vera Pless, Fundamentals of Error-Correcting Codes, Cambridge
University Press, 2010, ISBN-13: 978-0521131704.
8. ParikshitGopalan, Cheng Huang, HuseyinSimitci, and Sergey Yekhanin, On the
locality of codeword symbols, IEEE Transactions on Information Theory, 58(11) pp
6925–6934, 2012.
9. P.Vijaykumar, Error Correcting Codes, NPTEL Course,
10. Error Correction Coding – Mathematical Methods and Algorithms – Todd K.Moon,
2006, Wiley India.
11. Information Theory, Coding and Cryptography – Ranjan Bose, 2nd Edition, 2009,
TMH.

CO PO MAPPING:

Mapping of Course Outcomes with Program Outcomes


PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 2 3 - - - - - - - - 2 1 1
CO2 3 2 3 - 1 1 - - - - - 2 1 1
CO3 3 3 2 - 2 - - - - - - 3 1 1
CO4 2 2 2 - 3 - - - - - - 2 1 1
CO5 3 1 1 - 1 - - - - - - 3 1 1
22CS/CYS 261 Data Structures & Algorithms Lab L T P M C
0 0 3 100 1.5
COURSE OBJECTIVES:

1. To understand the usage of algorithms in computing.


2. To learn and use hierarchical data structures and its operations
3. To learn the usage of graphs and its applications.
4. To select and design data structures and algorithms that is appropriate for problems.

COURSE OUTCOMES:
At the end of the course student will be able to:
1. Identify the appropriate data structure for a given problem.
2. Implement Dictionary by using hashing techniques.
3. Analyse various basic operations of AVL tree, B-tree, splay trees to improve the
efficiency.
4. Implement graphs to solve real world problems.
5. Build a Binary Heap using Priority queues.

1. Write Java program for Randomized Quick sort method to sort a given list of integers in
ascending order.
2. Write a C program that uses functions to perform the following:
i) Creating a SplayTree of integers ii) insertion iii) Traversing splay tree in preorder, inorder
and postorder.
3. Write a C program to implement priority queue using heap tree.
4. Write a C program to implement prim’s algorithm.
5. Write a C program to implement krushkal’s algorithm.
6. Write a C program for BFS and DFS traversals.
7. Write a C program for Edmonds-Karp algorithm.
8. Write a C program to perform various operations on Disjoint sets.
9. Write a C program for generating permutations and combinations.
10. Write a C program for construct a Trie data structure.
11. Write a C program for Rabin-Karp algorithm.

MAPPING:
Mapping of Course Outcomes with Program Outcomes
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 2 3 - - - - - - - - 2 1 1
CO2 3 2 3 - 1 1 - - - - - 2 1 1
CO3 3 3 2 - 2 - - - - - - 3 1 1
CO4 2 2 2 - 3 - - - - - - 2 1 1
CO5 3 1 1 - 1 - - - - - - 3 1 1
22CS/CYS 262 DBMS LAB L T P M C
0 0 3 100 1.5
COURSE OBJECTIVES:

1. The objective of the course is to present an introduction to database management


systems, with an emphasis on how to organize, maintain and retrieve - efficiently,
and effectively information from a DBMS.
2. This lab enables the students to practice the concepts learnt in the subject DBMS
by developing a database.
3. The student is expected to practice the designing, developing and querying a
database.
4. Students are expected to use “Mysql/Oracle” database

Course Outcomes

Upon successful completion of the course, the student will be able to

CO1 Apply database management techniques to solve problems L2

CO2 Conduct experiments by using modern tools like Oracle or MYSQL L3


L3
CO3 Develop an effective report based on various constructs implemented.
Apply technical knowledge for a given problem and express with an effective
CO4 oral communication. L3

CO5 Analyze outputs of queries for a given problem L4


Programs:

1. Introduction to MySQL Workbench. How to use MySql Workbench to run SQL


Statements
Or
How to create user Accounts in oracle and manage user accounts using SQL
Statements. & How to run SQL Statements in command prompt.
2. Examples on
i) DDL Commands: CREATE, ALTER, DROP and TRUNCATE a Table
ii) Implementation of Constraints PRIMARY KEY, FOREIGN KEY, CHECK,
NOT NULL, UNIQUE.
3. Examples on
i) DML Commands. INSERT, UPDATE and DELETE
ii) DCL Commands: COMMIT, ROLLBACK and SAVEPOINT.
4. Examples on retrieving data from a single table using
i) SELECT statement
ii) SELECT statement with where clause(Comparison Operators, AND, OR,
NOT, IN, BETWEEN,LIKE)
iii) ORDER BY clause (sort by column name) iv) LIMIT clause
5. Examples of Functions in SQL or MySQL: String, Numeric, Date, Time and Other
Functions.
6. Examples on Summary Queries: Queries using Aggregate functions, GROUP By and
Having Clauses, ROLLUP Operator.
7. Examples on Inner join, outer join using USING and NATURAL Keywords
8. Examples on SUB/SUMMARY Queries Using IN, ANY, SOME, ALL, EXISTS and
NOT EXISTS functions
9. Examples on
i) Creating INDEXES and VIEWS
ii) INSERT, DELETE and DROP on VIEWS
10. Examples on
i) Create and Call STORED PROCEDURE (IN, OUT, INOUT Parameters),
Drop a STORED PROCEDURE.
ii) Create, call and Drop a FUNCTION. iii) Create and Drop a TRIGGER
11. Case Study Using Real World Database Applications

Text Books

1. Oracle: The Complete Reference by Oracle Press

2.Murach‟s MySQL by JOEL MURACH, Shroff Publishers & Distributors Pvt.Ltd,


June 2012.

References

1. The Complete Reference MYSQL,VikramVaswani, 2017, McGrawHill Education.

2. Fundamentals of Database Systems, Ramez Elmasri,ShamkantB. Navathe, Seventh edition,


Pearson.

Contribution of Course Outcomes towards achievement of Program Outcomes & Strength of


correlations (3: Substantial, 2: Moderate, 1: Slight)
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO1 PO11 PO12 PSO PSO2
0 1
CO1 3

CO2 1 2

CO3 2

CO4 3

CO5 3
22CS/CYS 263 UNIX Lab L T P M C
0 0 3 100 1.5

COURSE OBJECTIVES:

This course introduces basic understanding of UNIX OS, UNIX commands and File
system and to familiarize students with the Linux environment. To make student learn
fundamentals of shell scripting and shell programming. Emphases are on making student
familiar with UNIX environment and issues related to it

COURSE OUTCOMES:
Upon completion of this course, the student will be able to:
1. Understand the basic concepts of UNIX Architecture and basic Commands.
2. Understand different types of Files, File system and basic file system commands.
3. Understand the commands related to Shell basics, vi editor and regular expression
commands.
4. Implement vi editor commands and shell programs
5. Understand the concepts of advance file concepts, commands related to Shell script
and filter commands.

1. Working with different Unix commands, Pipes, I/O redirection.


2. Write Shell Programs for the following
a) Display all the words which are entered as command line arguments.
b) Changes Permissions of files in PWD as rwx for users.
c) To print the list of all sub directories in the current directory.
d) Program which receives any year from the keyboard and determine whether the year is
leap year or not. If no argument is supplied the current year should be assumed.
e) Program which takes two file names as arguments, if their contents are same then delete
the second file.
3. Write shell scripts for the following
a) To print the given number in the reversed order.
b) To print first 25 Fibonacci numbers.
c) To print the Prime numbers between the specified range.
d) To print the first 50 Prime numbers.
4. Write shell scripts for the following
a) To delete all lines containing the word ‘Unix’ in the files supplied as arguments.
b) Menu driven program which has the following options.
i) contents of /etc. /passed
ii) list of users who have currently logged in.
iii) present working directory. iv) exit.
c) For sorting, searching and insertion, deletion of elements in the list
5. Program to transfer the data from one file to another file by using un-buffered I/O.
6. Program to create two processes to run a loop in which one process adds all even numbers
and the other adds all the odd numbers (Hint: use fork ( ) ).
7. Program to create to process ‘i’ and sends data to process ‘j’, prints the same after
receiving it. ( Hint: use fork( ) ).
8. Program to demonstrates orphan process .
9. Program which demonstrates how to avoid Zombie using wait( ) .
MAPPING:

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

CO1 3 2 2 1 2 1 2

CO2 3 2 2 1 2 2 1

CO3 3 2 2 1 2 1 1

C04 3 2 2 1 2 1 1

CO5 3 2 2 1 2 1 1
22CS/AM/CYS/DS 264 Communicative English Lab II L T P M C
0 0 3 100 1.5

Course Objectives:

The main course objective of Advanced English Communication Skills Lab is to


develop the student’s Non-Verbal Communication, Cognitive and Poignant Skills, Interview
Skills, Employability and Interpersonal skills, which relate to situations in the work place.
The skills imparted to the learners are body language, leadership, time management, team
management, assertive skills, group discussions, interview techniques and positive work
ethics ...etc.

The methodology includes Interactive sessions, Role Play, Team Work/Group


Work/Pair Work and Peer Evaluation. The emphasis is on learning by doing to improve the
learners’ life skills.

Course Outcomes:

CO1 To realize the importance of communication skills in job arena


To enhance the students ability to communicate
CO2 Able to learn vocabulary for GRE, TOEFL, IELTS,IES etc
CO3 Capable to participate in all recruitment procedures
CO4 Able to communicate effectively over a phone and proficient to demonstrate
telephoning skills
CO5 Able to describe procedures and improves analytical thinking
CO6 Able to know the importance of personality development

Syllabus:
Module-l Communication Skills

I. Verbal

a) Types of Communication
b) Barriers to Communication
c) Strategies for effective communication
II. Nonverbal Skills -

a) Body Language – Voluntary and Involuntary


b) Kinesics
c) Facial Expressions
d) Proxemics
e) Oculesics
f) Haptics and Chronemics

Module-2: Advanced Vocabulary

a) Word list (GRE & TOEFL related)


b) One Word Substitutes
c) Idioms

Module-3: Employability Skills (Ref: 6)

a) Interview Skills
b) Group Discussion
c) Resume Writing

Module-4: Telephonic Skills

a) Formal &Informal interaction


b) Receiving Messages & Complaints
c) Tone modulation

Module-5: Descriptions
a) Process Description
b) Pictures
c) Narration

Module-6: Behavioural Skills

a) Emotional Intelligence
b) Positive Attitude
c) Team Work
d) Organization Skills
MAPPING:

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

CO1 - - - 2 2 - - 2 3 - 3 3 1 1

CO2 - - - 2 2 2 3 - 3 3 1 1

CO3 - - - 2 2 - - 2 3 - 3 3 1 1

C04 - - - 2 2 2 3 - 3 3 1 1

CO5 - - - 2 2 - - 2 3 - 3 3 1 1

You might also like