CURRICULUM AND SYLLABUS

FOR

B.E. Degree Programme

In

Computer Science and Engineering

Academic Regulations – 2020

www.krct.ac.in

1|Page K. RAMAKRISHNAN COLLEGE OF TECHNOLOGY (AUTONOMOUS)

 K. RAMAKRISHNAN COLLEGE OF TECHNOLOGY
(An autonomous institution affiliated to Anna University, Chennai and approved by AICTE, New Delhi)

Kariyamanickam Road, Samayapuram, Tiruchirappalli – 621112

Curriculum and Syllabi

for

B.E. – Computer Science and Engineering

[CHOICE BASED CREDIT SYSTEM]

(This Curriculum and syllabi are applicable to the students admitted from the academic year 2020 – 21 onwards)

2|Page K. RAMAKRISHNAN COLLEGE OF TECHNOLOGY (AUTONOMOUS)

 Vision of the Institute

To serve the society by offering top – notch technical education on par with global standards

Mission of the Institute

We will strive to

1. Be a center of excellence for technical education in emerging technologies by

exceeding the needs of industry and society
2. Be an institute with world class research facilities
3. Be an institute nurturing talent and enhancing competency of students to transform
them as all – round personality respecting moral and ethical values

Quality Policy

We at K. Ramakrishnan College of Technology are committed to the society in making our

students to live a purpose as responsible citizens with ethical values through provision of
Quality Technical Education and continually improve to become a world class technological
University

3|Page K. RAMAKRISHNAN COLLEGE OF TECHNOLOGY (AUTONOMOUS)

 Vision of the Department

To be a center of eminence in creating competent software professionals with research and

innovative skills.

Mission of the Department

We will strive to

M1: Nurture students in working with various hardware and software platforms inclined with
the best practices of industry.
M2: Prepare students for research oriented activities.
M3: Empower students with the required skills to solve complex technological problems of
society.
Programme Educational Objectives

PEO 1: To produce graduates who have strong foundation of knowledge and skills in the
field of Computer Science and Engineering

PEO 2: To produce graduates who are employable in industries/public sector/research

organizations or work as an entrepreneur.

PEO 3: To develop leadership skills and ethically collaborate with society to tackle real-
world challenges.
Programme Specific Outcomes

PSO 1: To analyze, design and develop computing solutions by applying foundational

concepts of Computer Science and Engineering.

PSO 2: To apply software engineering principles and practices for developing quality
software for scientific and business applications.

PSO 3: To adapt to emerging Information and Communication Technologies (ICT) to

innovate ideas and solutions to existing/novel problems
4|Page K. RAMAKRISHNAN COLLEGE OF TECHNOLOGY (AUTONOMOUS)
 PROGRAMME OUTCOMES

PO ATTRIBUTE EXPLANATION
Apply the knowledge of mathematics, science, engineering fundamentals, and an
PO1 Engineering Knowledge:
engineering specialization to the solution of complex engineering problems.
Identify, formulate, review research literature, and analyze complex engineering
PO2 Problem Analysis: problems reaching substantiated conclusions using first principles of mathematics,
natural sciences and engineering sciences.
Design solutions for complex engineering problems and design system components
Design/Development of or processes that meet the specified needs with appropriate consideration for the
PO3
Solutions: public health and safety, and the cultural, societal, and environmental
considerations.
Use research-based knowledge and research methods including design of
Conduct Investigations of
PO4 experiments, analysis and interpretation of data, and synthesis of the information to
Complex Problems:
provide valid conclusions for complex problems:
that cannot be solved by straightforward application of knowledge, theories and techniques applicable to the engineering
discipline as against problems given at the end of chapters in a typical text book that can be solved using simple
engineering theories and techniques;
that require consideration of appropriate constraints / requirements not explicitly given in the problem statement such as
cost, power requirement, durability, product life, etc.;
which need to be defined (modeled) within appropriate mathematical framework; and
Create, select, and apply appropriate techniques, resources, and modern
PO5 Modern Tool Usage: engineering and IT tools including prediction and modeling to complex engineering
activities with an understanding of the limitations.
Apply reasoning informed by the contextual knowledge to assess societal, health,
PO6 The Engineer and Society: safety, legal and cultural issues and the consequent responsibilities relevant to the
professional engineering practice.
Understand the impact of the professional engineering solutions in societal and
Environment and
PO7 environmental contexts, and demonstrate the knowledge of, and need for
Sustainability:
sustainable development.
Apply ethical principles and commit to professional ethics and responsibilities and
PO8 Ethics:
norms of the engineering practice.
Function effectively as an individual, and as a member or leader in diverse teams,
PO9 Individual and Team Work:
and in multidisciplinary settings.
Communicate effectively on complex engineering activities with the engineering
community and with society at large, such as, being able to comprehend and write
PO10 Communication:
effective reports and design documentation, make effective presentations, and give
and receive clear instructions.
Demonstrate knowledge and understanding of the engineering and management
Project Management and
PO11 principles and apply these to one‘s own work, as a member and leader in a team, to
Finance:
manage projects and in multidisciplinary environments.
Recognize the need for, and have the preparation and ability to engage in
PO12 Life-long Learning:
independent and lifelong learning in the broadest context of technological change.

5|Page K. RAMAKRISHNAN COLLEGE OF TECHNOLOGY (AUTONOMOUS)

 ACADEMIC REGULATIONS
(As amended & approved in the 1st, 2nd and 3rd Academic Council)

6|Page K. RAMAKRISHNAN COLLEGE OF TECHNOLOGY (AUTONOMOUS)

 CURRICULUM
Semester 1
Sl. Course
Course Title Category L T P C TCH
No. Code
1 20HS1101 Communicative English AC 3 0 0 3 45

2 20MA1101 Mathematics-I AC 3 1 0 4 60

3 20PH1101 Engineering Physics AC 3 0 0 3 45

4 20CY1101 Engineering Chemistry AC 3 0 0 3 45

Problem Solving and Fundamentals
5 20GE1101 PC 3 0 0 3 45
Of C Programming
20BE1104 Basic Electrical, Electronics and
6 AC 3 0 0 3 45
Measurement Engineering
7 20BS1201 Physics and Chemistry Laboratory AC 0 0 3 1.5 45

8 20GE1201 C Programming Laboratory PC 0 0 3 1.5 45

Semester 2
Sl. Course
Course Title Category L T P C TCH
No. Code
1 20HS2102 Technical English AC 3 0 0 3 45

2 20MA2102 Mathematics – II AC 3 1 0 4 60

3 20PH2106 Physics for Information Science AC 3 0 0 3 45

Environmental Science and
4 20GE2104 AC 3 0 0 3 45
Engineering
5 20GE2102 Computational Thinking Using Python PC 3 0 0 3 45

6 20GE2103 Engineering Graphics AC 3 1 0 4 90

7 20GE2202 Python Programming Laboratory PC 0 0 3 1.5 45

8 20GE2203 Engineering Practices Laboratory AC 0 0 3 1.5 60

9 20GE2601 Professional Skills – I AC 2 0 0 1 30

7|Page K. RAMAKRISHNAN COLLEGE OF TECHNOLOGY (AUTONOMOUS)

 Semester 3
Sl. Course
Course Title Category L T P C TCH
No. Code
Transforms and Partial Differential
1 20MA3105 AC 3 1 0 4 60
Equations
2 20CS3301 Digital Principles and System Design AC 3 0 2 4 60

3 20CS3101 Data Structures using C PC 3 0 0 3 45

4 20CS3102 Object Oriented Programming PC 3 0 0 3 45

5 20CS3401 Database Technology PC 3 0 2 4 60

Computer Organization and
6 20CS3103 PC 3 0 0 3 45
Architecture
7 20CS3201 Data Structures Laboratory PC 0 0 3 1.5 45
Object Oriented Programming
8 20CS3202 PC 0 0 3 1.5 45
Laboratory
9 20GE3602 Professional Skills – II AC 2 0 0 1 30

Semester 4
Sl. Course
Course Title Category L T P C TCH
No. Code
1 20MA4107 Probability and Queuing Theory AC 3 1 0 4 60

2 20CS4101 Design and Analysis of Algorithms PC 3 0 0 3 45

3 20CS4102 Computer Networks PC 3 0 0 3 45

4 20CS4103 Software Engineering PC 3 0 0 3 45

5 20CS4402 Operating Systems PC 3 0 2 4 60

6 20CS4104 Internet Programming PC 3 0 0 3 45

7 20CS4201 Networks Laboratory PC 0 0 3 1.5 45

8 20CS4202 Internet Programming Laboratory PC 0 0 3 1.5 45

9 20GE4603 Professional Skills – III AC 2 0 0 1 30

8|Page K. RAMAKRISHNAN COLLEGE OF TECHNOLOGY (AUTONOMOUS)
 Semester 5
Sl. Course
Course Title Category L T P C TCH
No. Code
1 20MA5111 Discrete Mathematics AC 3 1 0 4 60

2 20CS5101 Theory of Computation PC 3 0 0 3 45

3 20CS5102 Artificial Intelligence PC 3 0 0 3 45

4 20CS5103 Object Oriented Analysis and Design PC 3 0 0 3 45

Mobile Computing and Application
5 20CS5104 PC 3 0 0 3 45
Development
6 - Professional Elective-I PE 3 0 0 3 45
Mobile Application Development
7 20CS5201 PC 0 0 3 2 60
Laboratory
Object Oriented Analysis and Design
8 20CS5202 PC 0 0 4 2 60
Laboratory
9 20CS5501 Design Project-1 PC 0 0 2 1 30

10 20GE5604 Professional Skills – IV AC 2 0 0 1 30

Semester 6
Sl. Course
Course Title Category L T P C TCH
No. Code
1 20CS6403 Compiler Design PC 3 1 0 4 60

2 20CS6101 Machine Learning PC 3 0 0 3 45

3 20CS6102 Cryptography and Network Security PC 3 0 0 3 45

4 - Professional Elective-II PE 3 0 0 3 45

5 20CS6201 Security Lab PC 0 0 4 2 60

6 - Open Elective I OE 3 0 0 2 45

7 20CS6502 Design Project-2 PC 0 0 2 1 30

8 20HS5201 Professional Communication AC 0 0 2 1 30

9 20CS6103 Comprehension PC 0 0 2 2 30

9|Page K. RAMAKRISHNAN COLLEGE OF TECHNOLOGY (AUTONOMOUS)

 Semester 7
Sl. Course
Course Title Category L T P C TCH
No. Code
1 20CS7101 Cloud Computing PC 3 0 0 3 45

2 20CS7102 Foundations of Data Science PC 3 0 0 3 45

3 - Open Elective-II OE 3 0 0 2 45

4 - Professional Elective-III PE 3 0 0 3 45

5 20CS7201 Cloud Computing Laboratory PC 0 0 4 2 60

20CS7202 Data Science Laboratory PC 0 0 3 2 60

6 20CS7503 Design Project-3 PC 0 0 2 1 30

Semester 8
Sl. Course
Course Title Category L T P C TCH
No. Code
1 - Professional Elective-IV PE 3 0 0 3 45

2 - Open Elective-III OE 3 0 0 2 45

3 20CS8504 Project Work PC 0 0 16 8 240

4 20CS8201 Internship AC 0 0 0 2 120

10 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 LIST OF PROFESSIONAL ELECTIVES

Semester 5
Sl. Course
Course Title Category L T P C TCH
No. Code
1 20CS5901 Introduction to Parallel Algorithms PE 3 0 0 3 45

2 20CS5902 Multimedia Systems PE 3 0 0 3 45

3 20CS5903 Principles of Distributed Systems PE 3 0 0 3 45

4 20CS5904 Fundamentals of Big Data PE 3 0 0 3 45

5 20CS5905 Ethical Hacking and Network Defence PE 3 0 0 3 45

6 20CS5906 Julia Programming PE 3 0 0 3 45

7 20CS5907 Deep Learning for Computer Vision PE 3 *0 0 3 45

8 20CS5908 Combinatory and Graph Theory PE 3 0 0 3 45

Semester 6
Sl. Course
Course Title Category L T P C TCH
No. Code
Software Project Management
1 20CS6901 PE 3 0 0 3 45
Techniques
2 20CS6902 Advanced Big Data Analytics PE 3 0 0 3 45

3 20CS6903 Fog Computing PE 3 0 0 3 45

4 20CS6904 Real Time Systems PE 3 0 0 3 45

5 20CS6905 Introduction to IoT PE 3 0 0 3 45

6 20CS6906 Digital Marketing PE 3 0 0 3 45

7 20CS6907 C# DotNet PE 3 0 0 3 45

8 20CS6908 Digital Image Processing PE 3 0 0 3 45

11 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 Semester 7
Sl. Course
Course Title Category L T P C TCH
No. Code
1 20CS7901 Human Computer Interaction PE 3 0 0 3 45
Service Oriented Architecture and
2 20CS7902 PE 3 0 0 3 45
Micro services
3 20CS7903 Ad hoc Networks PE 3 0 0 3 45

4 20CS7904 Block chain Architecture PE 3 0 0 3 45

5 20CS7905 Data Warehousing and Data Mining PE 3 0 0 3 45

6 20CS7906 Genetic Algorithm and Applications PE 3 0 0 3 45

7 20CS7907 Robotics PE 3 0 0 3 45

8 20CS7908 Natural Language Processing PE 3 0 0 3 45

Semester 8
Sl. Course
Course Title Category L T P C TCH
No. Code
1 20CS8901 Software Quality and Testing PE 3 0 0 3 45

2 20CS8902 Information Storage and Retrieval PE 3 0 0 3 45

3 20CS8903 Design Patterns PE 3 0 0 3 45

4 20CS8904 Design of Network Router PE 3 0 0 3 45

5 20CS8905 Software Defined Networks PE 3 0 0 3 45

6 20CS8906 System Software PE 3 0 0 3 45

7 20CS8907 Embedded System Development PE 3 0 0 3 45

8 20CS8908 Computer Graphics PE 3 0 0 3 45

12 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 LIST OF OPEN ELECTIVES

Semester 6,7,8

Sl. Course
Course Title Category L T P C TCH
No. Code
1 20AI6801 Software Engineering 2 0 0 1 2 30

2 20AI6802 Digital Marketing 2 0 0 1 2 30

3 20AI7801 Software Project Management 2 0 0 1 2 30

4 20AI7802 Soft Computing Techniques 2 0 0 1 2 30

5 20AI8801 Internet Of Things 2 0 0 1 2 30

6 20AI8802 Cloud Computing Using AWS 2 0 0 1 2 30

Fundamentals of Software
7 20CS6801 2 0 0 1 2 30
Engineering
8 20CS6802 Programming In Java 2 0 0 1 2 30

9 20CS7801 Fundamentals of Database Systems 2 0 0 1 2 30

10 20CS7802 Cloud Computing Fundamentals 2 0 0 1 2 30

Enterprise Resource Planning 30

11 20CS8801 2 0 0 1 2
Concepts
12 20CS8802 Information Security Fundamentals 2 0 0 1 2 30

13 20CE6801 Air pollution Control Management 2 0 0 1 2 30

14 20CE6802 Disaster management 2 0 0 1 2 30

15 20CE7801 Environment and Agriculture 2 0 0 1 2 30

16 20CE7802 Green Construction 2 0 0 1 2 30

17 20CE8801 Climate change and its Impact 2 0 0 1 2 30

18 20CE8802 Solid waste Management 2 0 0 1 2 30

13 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 Electrical engineering safety 30
19 20EE6801 2 0 0 1 2
measures and standards
20 20EE6802 Electric vehicles 2 0 0 1 2 30

21 20EE7801 Energy management and survey 2 0 0 1 2 30

22 20EE7802 Nonconventional energy systems 2 0 0 1 2 30

23 20EE8801 Utilization of electrical energy 2 0 0 1 2 30

24 20EE8802 Electrical wiring estimation 2 0 0 1 2 30

25 20EC6801 Electronics and microprocessor 2 0 0 1 2 30

26 20EC6802 Robotics 2 0 0 1 2 30

2 0 0 1 30
27 20EC7801 Consumer electronics 2

28 20EC7802 Introduction to embedded systems 2 0 0 1 2 30

29 20EC8801 Advanced microcontrollers 2 0 0 1 2 30

Telecommunication network 30
30 20EC8802 2 0 0 1 2
management
31 20ME6801 Nano Materials and its Application 2 0 0 1 2 30

32 20ME6802 Solar Energy Technologies 2 0 0 1 2 30

33 20ME7801 Design of Experiments 2 0 0 1 2 30

34 20ME7802 Fuel cell and Hydrogen Technology 2 0 0 1 2 30

Waste Management and Energy 30

35 20ME8801 2 0 0 1 2
Recovery
36 20ME8802 Ergonomics 2 0 0 1 2 30

14 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 CURRICULUM STRUCTURE – CREDIT DISTRIBUTION

CATEGORY SEM1 SEM2 SEM3 SEM4 SEM5 SEM6 SEM7 SEM 8

PC 4.5 4.5 16 19 17 15 11 8
AC 17.5 19.5 9 5 5 1 2
PE 3 3 3 3
OE 2 2 2
TOTAL 22 24 25 24 25 21 16 15
TOTAL CREDITS FOR THE B.E. DEGREE PROGRAMME - 172

15 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 SYLLABUS

SEMESTER 1
20HS1101 COMMUNICATIVE ENGLISH L T P S C
ASSESSMENT TYPE TYPE -1 3 0 0 1 3
OBJECTIVES

To inculcate the basic reading and writing skills and make them to comprehend engineering and
technology texts, guide learners, develop their listening skills and enable them to participate in
conversations, and listen to lectures and Comprehend them by asking question

COURSE OUTCOMES

Students will be able to

1. Read engineering and technology concepts and understand for better interpretation.
2. Participate effectively in informal conversations; introduce themselves and their friends and express
opinions in English.
3. Comprehend conversations and short talks delivered in English
4. Write short essays of a general kind and personal letters and emails in English.

UNIT 1 – SHARING IDEAS & VIEWS AMONG FAMILIES AND FRIENDS

Listening - Importance and Types - Differentiating Hearing and Listening - Listening to small talks short
formal and informal conversations
Speaking-introducing oneself in the Interview– exchanging personal information.
Reading- Practice in skimming-scanning and predicting the content with the cross-cultural case studies.
Writing- Sentence completion- developing hints. Free writing(Hobbies, favourite place, School life).
Language development- Parts of speech, Tenses (present, Past and Future), Articles.
Vocabulary development– Prefixes and Suffixes.
Total Periods :9
UNIT 2 – LEARNING THROUGH CROSS CULTURAL CASE STUDIES

Listening- listening to dialogues or conversations and completing exercises based on them.

Speaking– Achieving confidence, clarity and fluency - speaking in the interview following etiquettes.
Reading–Reading the Technical reports and note taking on the cross-cultural case studies.
Writing – Paragraph writing (Narrative, Analytical, Cause and Effect and Compare and Contrast)
Development of paragraph with the help of word links.
Language development– Prepositions and Conjunctions in sentence, Purpose Statement.
Vocabulary development –Abbreviations and Acronyms.
Total Periods :9
UNIT 3 – GRAMMAR AND LANGUAGE DEVELOPMENT

16 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 Listening-Watching videos/documentaries/Listeningtovariousinterviewsandassessingthem.
Speaking - Speaking about a simple process (example- Filling a form).
Reading - Critical reading - finding key information in a given case studies.
Writing-Writing short essays, Jumbled sentences, Definitions.
Language development –Active voice and Passive voice, Numerical Adjectives.
Vocabulary development –Single word substitutes.
Total Periods :9
UNIT 4 – READING AND LANGUAGE DEVELOPMENT

Reading-Comprehension-reading longer texts using stories and case studies.

Writing-Letter writing, Informal or Personal letters-e-mails-conventions of personal email.
Listening-Listening to different accents(Example: British/American/Indian).
Speaking-Speaking about one‗s friend-Role play/Extempore.
Language development Tenses-Connectives.
Vocabulary development -Collocation.
Total Periods :9
UNIT 5 – UNDERSTANDING & EXPERIMENTING VISUAL ELEMENTS

Reading- Interpreting visual materials (Bar chart, Pie chart, Table, Flowchart).
Writing- Developing an outline-identifying main and subordinate ideas-dialogue writing- Autobiography
writing.
Listening - Listening and Responding to video lectures –TED talks.
Speaking - Short group conversations - Telephonic conversations.
Language development- Embedded sentences.
Vocabulary development-Homophones, Homonyms.
Total Periods :9
TEXT BOOKS
1. Board of Editors. Using English-A Course book for Undergraduate Engineers and Technologists,
Hyderabad: Orient Black SwanPvt.Limited,2017.
2. Jack C.Richards. Interchange Students‘ Book-2,NewDelhi:CUP,2015.

REFERENCE BOOKS
1. .Bailey, Stephen. Academic Writing: A practical guide for students, NewYork:Rutledge,2011.
2.MeansL.Thomas and Elaine Langlois. English & Communication for Colleges, USA: Language Learning,
2007
3. Redston, Chris & Gillies Cunningham. Face2Face(Pre-intermediate Student‗s Book & Workbook), New
Delhi:Cambridge University Press, 2005.
4.Comfort Jeremy, Speaking Effectively :Developing Speaking Skills for Business English, Cambridge:
Cambridge University Press, Reprint 2011.
5.DuttP.Kiranmai and Rajeevan Geeta. Basic Communication Skills ,Foundation Books, 2013.

17 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 20MA1101 MATHEMATICS– I L T P S C
ASSESSMENT TYPE TYPE -1 3 1 0 0 4
OBJECTIVES

To develop mathematical curiosity and use inductive and deductive reasoning when solving
problems. become confident in using mathematics to analyse and solve problems in real-life situations.

COURSE OUTCOMES

Students will be able to

1. Understand Eigen values and eigenvectors of a matrix, and apply to diagonolise the matrix.
2. Fluency in differentiation of several variables and apply to solve extremum values.
3. Fluency in integration using standard methods, including the ability to find an appropriate method for a
given integral.
4. Evaluate integrals using techniques of integration and determine convergence and divergence of
improper integrals
5. Apply Integration to figure numerous integrals, area, volume, integrals in polar coordinates in adding
together to change of order and change of variables.

UNIT 1 – MATRICES

Eigen values and Eigenvectors of a real matrix – Characteristic equation – Properties of Eigen values and
Eigenvectors – Cayley Hamilton theorem–Diagonalization of matrices –Reduction of a quadratic form to
canonical form by orthogonal transformation–Nature of quadratic forms.
Total Periods :12
UNIT 2 – FUNCTIONS OF TWO VARIABLES

Partial differentiation–Homogeneous functions and Euler‘s theorem–Total derivative– Change of variables–

Jacobians Partial differentiation of implicit functions– Taylor‘s series for functions of two variables–Maxima
and minima of functions of two variables – Lagrange‘s method of undetermined multipliers.
Total Periods :12
UNIT 3 – INTEGRAL CALCULUS-I

Definite integrals-Indefinite integrals –Properties of definite integrals-Problems on properties –Substitution

rule –Algebraic function, Logarithmic function, Exponential function and Trigonometric function.
Total Periods :12

UNIT 4 – INTEGRAL CALCULUS-II

Techniques of Integration- Integration by parts, Trigonometric integrals, Trigonometric substitutions,

Integration of rational Functions by partial fraction, Integration of irrational functions-Improper integrals.
Total Periods :12
UNIT 5 – MULTIPLE INTEGRALS

18 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
Double integrals–Change of order of integration–Double integrals in polar coordinates–Area enclosed by
plane curves–Triple integrals–Volume of solids– Change of variables in double integrals.
Total Periods :12

TEXT BOOKS
1. Grewal B.S., “HigherEngineeringMathematics”,KhannaPublishers,NewDelhi,44rdEdition,2018.
2. JamesStewart,“Calculus,Early Transcendenta ‖l,CengageLearning,9thEdition,NewDelhi,2020.

REFERENCE BOOKS
1. VeerarajanT, “Engineering MathematicsI”, Tata Mcgraw Hill Education Pvt.
2 .Anton,H,Bivens,I and Davis,S,‖Calculus‖,Wiley,11thEdition,2017.
3.JainR.K.andIyengarS.R.K.,“AdvancedEngineeringMathematics”,NarosaPublications,NewDelhi,
5thEdition, 2016.
4.Narayanan,S.and ManicavachagomPillai,T.K., “Calculus Volume I and II”, S.Viswanathan Publishers Pvt.
Ltd.,Chennai,7thEdition,2007.
5.SrimanthaPalandBhunia,―EngineeringMathematics”,S.C, OxfordUniversityPress,2015.
6.Weir,M.DandJoelHass,―ThomasCalculus”,12thEdition, PearsonIndia,2016.

19 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 20PH1101 ENGINEERING PHYSICS L T P S C
ASSESSMENT TYPE TYPE -1 3 0 0 0 3
OBJECTIVES
To demonstrate competency and understanding of the concepts found in Mechanics, Harmonic
Oscillations, waves in one dimension, wave Optics, Lasers, Fiber Optics and a broad base of knowledge
in physics.
COURSE OUTCOMES
Students will be able to
1. Gain knowledge on the basics of properties of matter and its applications
2. Applying knowledge in the areas of waves and fiber optic technique.
3. Gaining knowledge about oscillations and waves
4. Have adequate knowledge on the concepts of thermal properties of materials and their applications in
expansion joints and heat exchangers
5. Analyze the different kind of crystal structures and gain knowledge about crystal growth.

UNIT 1 – PROPERTIES OF MATTER

Elasticity – Stress-strain diagram and its uses – factors affecting elastic modulus and tensile strength.
Torsional stress and deformations – twisting couple – torsional pendulum: theory and experiment –
bending of beams-Bending moment–cantilever: theory and experiment. Uniform and non-uniform
bending: theory and experiment–I- shaped girders.
Total Periods :9
UNIT 2 – LASER AND FIBER OPTICS
Lasers: Introduction, Basic concepts (absorption, spontaneous emission and Stimulated emission)
Einstein coefficients and their relations, Population inversion, Lasing action, - Characteristics of Lasers,
Working principle and components of laser –CO2 Laser- Semiconductor Laser (Homojunction and
Hetro junction) Applications of Laser in Industry, medicine. Numerical Problems.
Fiber Optics: Introduction, Basic structure of optical fibre, Principle of optical fibre- Acceptance angle,
acceptance cone and Numerical aperture - Types of optical fibres (Based on Refractive index profile and
Mode guiding) - Attenuation -Advantages and disadvantages of Optical fibres, Numerical problems.
Total Periods :9
UNIT 3 – OSCILLATIONS AND WAVES
OSCILLATIONS: Periodic and Oscillatory motion-Simple harmonic motion, differential equations of
S.H.M and its solution-L.C circuit (Non mechanical oscillation)damped oscillations: differential equation
and its solution – damped and forced oscillations: differential equation and its solution- coupled
oscillator.
Waves: Introduction-one dimensional wave - standing sound waves - Equation of progressive wave-
superposition of wave- two beam superposition-problem.
Total Periods :9
UNIT 4 – THERMAL PHYSICS

20 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
Transfer of heat energy – thermal expansion of solids and liquids – expansion joints – bimetallic strips –
thermal conduction, convection and radiation – heat conductions in solids – thermal conductivity-Forbes
& Lee‘s disc method: theory and experiment – conduction through compound media (series and parallel)
– thermal insulation – applications: heat exchangers, refrigerators, ovens and solar water heaters.
Total Periods :9
UNIT 5 – CRYSTALLOGRAPHY
Lattice – unit cell – Bravais lattices – lattice planes – Miller indices – ―d‖ spacing in cubic lattice –
calculation of number of atoms per unit cell – atomic radius – coordination number – packing factor for
SC, BCC, FCC and HCP structures –Determination of Cubic crystal Structure by X-ray Diffraction-Crystal
growth techniques- solution, melt (Czochralski) and vapour growth techniques(qualitative).
Total Periods :9
TEXT BOOKS
1. Rajendran, Engineering Physics, Tata Mc Graw-Hill ,New Delhi,2011.
2. K.Tamilarasan, K. Prabu, Engineering Physics I, Tata McGraw-Hill, New Delhi, 2011, 2ndedition.
3. Charles Kittle, Introduction to Solid State Physics,Willey India Pvt. Ltd 2008,7thEdition.
4. M.N.Avadhanuluetal.,A Textbook of Engineering Physics, S.Chand Company Ltd., NewDelhi, 2005.
REFERENCE BOOKS
1. Frank Träge, Springer Handbook of Lasers and Optics, Springer, 2012.
2.Kleppner, Kolenkow, An introduction to Mechanics, TataMcGraw-Hill, NewDelhi, 2011.
3.Rajendran, A.Marikani, PhysicsI, TMH, NewDelhi, 2004.
4.R.K.Gaur,S.L.Gupta ,Engineering Physics, Dhanpat Rai Publishers, NewDelhi, 2006.

21 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 ENGINEERING CHEMISTRY L T P S C
20CY1101
ASSESSMENT TYPE TYPE -1 3 0 0 0 3
OBJECTIVES

To acquaint the students with the basic phenomenon/concepts of chemistry, the student face
during course of their study in the industry and Engineering field.

COURSE OUTCOMES
Students will be able to
1. Understand the basic principles of water quality parameters, their analysis and various water treatment
processes for domestic and industrial applications.
2. Have a thorough knowledge on batteries.
3.Improve combustion equipment, raise energy utilization ratio, analyze the mechanism and formation of
harmful emission, prevent abnormal combustion phenomena, control and reduce harmful emission.
4. Understand the various laws and their applications
5. To analyze principles of recent trends of nano materials & nanoparticals.

UNIT 1 – WATER TECHNOLOGY

Hardness–types and estimation by EDTA method and problems, Boiler feed water– requirements–
disadvantages of using hard water in boilers – internal conditioning (Carbonate, phosphate, calgon ,
Colloidal, Sodium aluminate conditioning methods) – external conditioning – demineralization process and
Zeolite processes– desalination and reverse osmosis, Estimation of Dissolved Oxygen.
Total Periods :9
UNIT 2 – NON CONVENTIONAL ENERGY SOURCES AND STORAGE DEVICES

Nuclear fission- controlled nuclear fission-nuclear fusion- differences between nuclear fission and fusion-
nuclear chain reactions - nuclear energy - light water nuclear power plant - breeder reactor -solar energy
conversion - solar cells – wind energy. Batteries, fuel cells and super capacitors: Types of batteries –
primary battery (dry cell) secondary battery (lead acid battery, Nickel Cadmium, lithium-ion-battery)
fuelcells–H2-O2 fuel cell.
Total Periods :9
UNIT 3 – FUELS AND COMBUSTION

Calorific value–classification–Coal –proximate and ultimate analysis metallurgical coke–manufacture by

Otto-Hoffmann method – Petroleum processing and fractions – cracking – catalytic cracking and methods-
knocking – octane number and cetane number – synthetic petrol – Fischer Tropsch and Bergius processes
– Gaseous fuels- water gas, producer gas, CNG and LPG, Power Alcohol and Biodiesel, Flue gas
analysis–Orsatapparatus–theoretical air for combustion.
Total Periods :9
UNIT 4 – ANALYTICAL TECHNIQUES

22 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
Beer-Lambert‘slaw(problem)–UV-visiblespectroscopyandIRspectroscopy–principles–instrumentation
(problem) (block diagram only) – estimation of iron by colorimetry – flame photometry – principle –
instrumentation (block diagram only) – estimation of sodium by flame photometry – atomic absorption
spectroscopy – principles – instrumentation (block diagram only)– estimation of nickel by atomic absorption
spectroscopy.
Total Periods :9
UNIT 5 – NANO CHEMISTRY

Basics-distinction between molecules, nano particles and bulk materials; size-dependent properties. Nano
particles: nanocluster, nanorod, nanotube(CNT) and nanowire. Synthesis: precipitation, thermolysis,
hydrothermal, solvo thermal, electrode position, chemical vapour deposition, laserablation; Properties and
applications.
Total Periods :9
TEXT BOOKS
1. Jain,P.C. and Monica Jain, Engineering Chemistry, DhanpatRai Publishing Company (P)Ltd.,New Delhi,
2010."(2015).
2.DaraS.S,UmareS.S,EngineeringChemistry,S.Chand&CompanyLtd. NewDelhi,2015

REFERENCE BOOKS
1. Mars G.Fontana, Corrosion Engineering ,Tata McGraw Hill Publishing Company(P) Ltd.,New Delhi
(2009).
2.B.K.Sharma Engineering Chemistry, Krishna Prakasan Media(P) Ltd., Meerut (2006).
3.B.Sivasankar, Engineering Chemistry,Tata Mc Graw-Hill Pub.Co. Ltd, New Delhi (2008).

23 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 PROBLEM SOLVING AND FUNDAMENTALS L T P S C
20GE1101
OF C PROGRAMMING
ASSESSMENT TYPE TYPE -1 3 0 0 1 3
OBJECTIVES
To provide complete knowledge of C language and to create programs and applications in C.
COURSE OUTCOMES
Students will be able to
1. Analyze simple algorithms, flowcharts, pseudo code and also problem solving techniques
2. Illustrate and implement applications using arrays and strings
3. Develop and implement applications in C using functions and pointers
4. Discover applications in C using structures and Union
5. Design applications using sequential and random access file processing.

UNIT 1 – PROBLEM SOLVING AND ALGORITHMIC THINKING

Overview – Problem definition, Logical reasoning: Simple examples of reasoning; what is a Pseudo code?
Write Pseudo code for summation of three numbers, To find the largest of three numbers, To print month
name based on user choice. Flow Chart: Write Flowchart for summation of three numbers, To find the
largest of three numbers, To print month name based on user choice. Algorithmic Thinking: What is an
algorithm, How it differs from Pseudo code and Flowchart; Explain Pseudo code, Flowchart and Algorithm
for Largest of three numbers in parallel; Constituents of algorithms, properties, representation.
Illustrative programs: Developing algorithms to Print month name based on user choice, Find minimum in
a list, Find the prime numbers in given range, Towers of Hanoi.
Total Periods :9
UNIT 2 – FUNDAMENTALS OF COMPUTER AND C PROGRAMMING
Generation and Classification of Computers- Basic Organization of a Computer –Number System – Binary
– Decimal –Conversion. C programming: Data Types– Storage classes- Constants– Enumeration
Constants- Keywords- Structure of C program – Operators: Precedence and Associativity - Expressions -
Input/output statements, Assignment statements –Decision making statements- Switch statement –
Looping statements –Pre-process or directives– Compilation process.
Illustrative programs: Largest among 3 numbers, To print month name based on user choice, sum of
non-negative numbers entered by users, Palindrome number, Fibonacci series, Armstrong number
Total Periods :9
UNIT 3 – ARRAYS AND STRINGS
Introduction to Arrays: Declaration, Initialization – One dimensional array – Example Program: Sorting and
Searching the element- Two dimensional arrays– Example Program: Matrix Operations-String operations:
Lengths, compare, concatenate, copy- String Operations with Char array.
Illustrative programs: To find the number of vowels, Consonants and digits and whitespace in a String,
Matrix Multiplication, sort N numbers in ascending/descending order, Read an array and search for an
element.

24 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 Total Periods :9

UNIT 4 – FUNCTIONS AND POINTERS

Introduction to functions: Function prototype, function definition, function call, Built-in functions (string
functions, math functions) – Recursion- Example Programs - Pointers –Pointer operators – Pointer
arithmetic – Arrays and pointers – Array of pointers – Example Program: Sorting of names – Parameter
passing: Pass by value, Pass by reference– Example Program: Swapping of two numbers and changing
the value of a variable using pass by reference.
Illustrative programs: sum of natural numbers using recursion, factorial of a number using recursion,
Access elements of an array using pointers, swap numbers in the cyclic order using call by reference.
Total Periods :9
UNIT 5 – STRUCTURES, UNION AND FILE PROCESSING
Structure-Nested structures– Pointer and Structures– Array of structures– Example Program using
structures and pointers – Self referential structures- Union- Example Program using union. File
Management in C - Defining and opening a file closing a file - Input/output operations on files - Types of file
processing: Sequential access, Random access – Example programs Command line arguments.
Illustrative programs: Store in formation of 10 student using structure, to store employee detail using
union, Read name and marks of n number of students and store the mina file,Read array from a file and
display it on the screen.
Total Periods :9
TEXT BOOKS
1. Reema Thareja,―Programming in C, Oxford University Press, Second Edition,2016.
2.Kernighan,B.Wand Ritchie,D.M,―The C Programming language , Second Edition, Pearson
Education,2006.
REFERENCE BOOKS
1. Paul Deitel and Harvey Deitel,―C How to Program ,Seventh edition, Pearson Publication
2.Juneja,B. Land Anita Seth,―Programming in C‖, CENGAGE Learning India pvt.Ltd.,2011.
3.Pradip Dey, Manas Ghosh,―Fundamentals of Computing and Programming in C‖, First Edition, Oxford
University Press, 2009.
4.Anita Goel and Ajay Mittal,―Computer Fundamentals and Programming in C ‖,Dorling Kindersley (India)
Pvt. Ltd., Pearson Education in South Asia, 2011.
5.ByronS.Gottfried, "Schaum's Outline of Theory and Problems of Programming with C", McGraw-Hill
Education, 1996.

25 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 20BE1104 Basic Electrical, Electronics and Measurement L T P S C
Engineering
ASSESSMENT TYPE TYPE -1 3 0 0 0 3
OBJECTIVES
To learn the fundamental laws, theorems of electrical circuits and also to analyse them and also
understand the principles and operation of measuring instruments and transducers.
COURSE OUTCOMES
Students will be able to
1. ApplyKVLandKCLfortheelectricalcircuits,explaintheprincipleandoperationsofDCmotorsanddigital motors
2. Explaintheworkingofenergyresourcesandsolvetheelectricalenergytariff
3. Comparethecharacteristicsandoperationsofdiodesandtransistors,demonstratethedifferentiator, integrator,
inverting and non-inverting op-amp
4. Utilize the number systems, D-Morgan‘s theorem, construct Kmap and develop the Flip-flops
5. Summarize the characteristics and errors of measuring instruments and illustrate the MC,MI Instruments.
UNIT 1 – BASICS ELECTRIC CIRCUIT
Ohm‘s Law - Kirchhoff‘s Law - Mesh current and Node Voltage method of analysis for DC Circuits, AC
circuit Fundamentals –DC motor, Variable reluctance stepper motor–construction, operation and
applications.
Total Periods :9
UNIT 2 – ENERGY RESOURCES AND UTILITY
Introduction to energy resources-Conventional and non-conventional Energy Resources-Basics of utility
supply-Electrical tariff and types-Calculation of energy- Introduction to energy audit and importance of
energy saving.
Total Periods :9
UNIT 3 – ANALOG ELECTRONICS
Introduction and VI characteristics of PN Junction diode, Zener Diode- Bipolar Junction Transistor- CE, CB
and CC configurations, comparison and applications(Qualitative Analysis)- Op amps- Inverting, non-
inverting, differentiator and integrator, ADC-successive approximation, DAC.
Total Periods :9
UNIT 4 – DIGITAL ELECTRONICS
Introduction to number system, logic gates, Boolean algebra- De-Morgan‘s theorem-K-map-Introduction to
Flip-Flops-SR Flip-flop, JK Flip-flop, D Flip-flop and T Flip-flop.
Total Periods :9

UNIT 5 – MEASUREMENTS
Introduction to transducers-Classification of Transducers: Resistive, Inductive, Capacitive-Principle of
Measuring Instruments – Types, Error, Construction, Working and Torque equation of PMMC Instruments,
MI Instruments. Introduction to Instruments Calibration.
Total Periods :9

26 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
TEXT BOOKS
1. Mehta,V. K., and Mehta Rohit. Principle of Electrical Engineering and Electronics. S. Chand
Publishing, New Delhi, 2019.
2.Wadhwa, C.L.Generation, distribution and utilization of electrical energy. New Age International,1989.
3.SawhneyA.K,PuneetSawhney,Dhanpat Rai&Co.,ACourse in Electrical and Electronic Measurements and
Instrumentation, 2012.
REFERENCE BOOKS
1. Rizzoni,Giorgio. Fundamentals of electrical engineering. NewYork: McGraw-Hill, 2009.
2.Bird,John.Electrical circuit theory and technology.Routledge,2014.
3.Morris,AlanS. "Measurement and instrumentation principles."(2001):1743.
4.Kumar,A.Anand. Fundamentals of digital circuits.PHI LearningPvt.Ltd.,2016.
5.Brinda devi,a.,etal."Energy conservation techniques in a foundry.

27 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 PHYSICS AND CHEMISTRY L T P S C
20BS1201
LABORATORY
ASSESSMENT TYPE TYPE -5 0 0 3 0 1.5
OBJECTIVES
To introduce different experiments to test basic understanding of physics concepts applied in
optics, thermal physics and properties of matter and Understand and Practise different type techniques
of quantitative and various chemical analysis. Synthesise organic polymers and skill to use TLC for the
identification of drugs.
To acquire the ability to understand and use instrumental techniques for chemical analysis and
learn to design and carry out scientific experiments as well as accurately record and understand how
chemistry addresses social, economic and environmental problems and why it is an integral part of
curriculum.

COURSE OUTCOMES
Students will be able to
1. To determine the wavelength and importance of the given Laser source.
To understand the uses and applications of Lasers in various fields.
To determine the acceptance angle and numerical aperature of the optic fibre.
2. To know the principle underlying the formation of acoustical grating,
To determine the velocity of ultrasonic waves and compressibility in liquid
3. To understand the principle of diffraction.
To differentiate Fraunhofer and Fresnel‘s diffraction.
To determine the wavelengths of prominent spectral lines of mercury spectrum.
4. To explain the elastic property of the material.
To apply the concepts for industrial applications such as construction of bridges, railway wagons etc.,
5. To explain the principle used for band gap determination.
To know the types of biasing.
6. To Understand and practice different techniques of quantitative chemical analysis to generate
Experimental skills and apply the skills to various analyses.
7. To Develop skills relevant to synthesize organic polymers and acquire the practical skill to use TLC for
the identification of drugs.
8. To Develop the ability to understand and explain the use of modern spectroscopic techniques for
analyzing and interpreting the IR spectra and NMR spectra of some organic compounds
9. To acquire the ability to understand, explain and use instrumental techniques for chemical analysis
10.To Learn to design and carry out scientific experiment as well as accurately record and analyze the
Results of such experiments
11. To Function as a member of a team, communicate effectively and engage in further learning. Also
understand how chemistry addresses social, economic and environmental problems and why it is an
integral part of curriculum.

28 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 LIST OF EXPERIMENTS(PHYSICS LAB)
1. ( a)Determination of Wavelength, and particle size using Laser
(b) Determination of acceptance angle in an optical fiber
2. Determination of velocity of sound and compressibility of liquid–Ultrasonic interferometer.
3. Determination of wave length of mercury spectrum–spectrometer grating
4. Determination of band gap of a semiconductor
5. Determination of Rigidity modulus–Torsion pendulum
6. Determination of Young‘s modulus by uniform bending method
7. Determination of specific resistance of the given coil of wire by comparing two nearly equal
resistances
using a Carey-Foster‘s Bridge.
LIST OF EXPERIMENTS(CHEMISTRY LAB)
8. Determination of strength of Hcl by NaOH using PH meter.
9. Conductometrictitration of Strong acid and Strong base.
10. Estimation of ferrousions by spectro photometry.
11. Determination of total, temporary and permanent hardness by EDTA method.
12. Estimation of Dissolved Oxygen by Winkler‘s method.
13. Estimation of alkalinity in Water sample.
14. Estimation of chloride by argentometric method
15. DeterminationofMolecularweightanddegreeofpolymerizationofapolymerbyViscometer.
Total Periods :45
REFERENCE BOOKS
1. C.K. Pandey, A. K.Katiyar,EngineeringPhysics-TheoryandPracticalSecondEdition, Wiley,2017.
2.N. H.Ayachit,P.K.MittalEngineeringPhysics:WithLaboratoryManual,IKInternationalPublishingHouse
Pvt.Ltd,2011
3.Kakani S.L,ENGINEERINGPRACTICALPHYSICS,CBSPublications,2011
4 .G. Svehla,B. Sivasankar,Vogel'sQualitativeInorganicAnalysis, Pearson,2012.
5.Stillman,ThomasBliss,andAlbertLeedsStillman,eds,Engineering chemistry:amanualofquantitative
chemicalanalysisfortheuseofstudents,chemists,andengineers,TheChemicalpublishingco.,1916.
6.SoneyC George,RinoLalyJose,LabManualofEngineeringChemistry,S.Chand&CompanyPvtLtd,New
Delhi,2019.

29 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 20GE1201 C PROGRAMMING LABORATORY L T P S C
ASSESSMENT TYPE TYPE -5 0 0 3 0 1.5
OBJECTIVES
To develop programs in C using basic constructs and develop applications in C using strings,
pointers, functions, files and structures.

COURSE OUTCOMES
1. Illustrate C programs for simple applications making use of basic constructs, arrays and strings.
2. Develop C programs involving functions, recursion, pointers, and structures.
3. Design applications using sequential and random access file processing.
LIST OF EXPERIMENTS
1. Programs using I/O statements and expressions.
2. Programs using decision-making statements.
3. Programs using Looping statements.
4. Program to sort the array and find smallest and largest element in that.
5. Program to find the number of increasing sequence in an array.
6. Program to split and print the string based on blank-space.
7. Program to print the string based on following condition if input=1,
print odd position characters of input string + reverse of even position characters of
input string else if input=0,
Print odd position characters of input string + even position characters of input string.
8. From a given paragraph perform the following using built-in functions:
a. Find the total number of words.
b. Capitalize the first word of each sentence.
c. Replace a given word with an other word.

9. Program to print sum of digits of the largest number from the given set of 4-digit numbers using function.
10. Program for factorial of a number and Fibonacci series using recursive function.
11. Compute internal marks of students for five different subjects using structures and functions.
12. Program to swap two numbers using pointer and function.
13. Program to access the array element using pointer.
14. Insert, update, delete and append telephone details of an individual or a company into a telephone
directory using random access file.
15. Create a―Railway reservation system‖ with the following modules
30 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 ● Booking
● Availability checking
● Cancellation
● Prepare chart
Total Periods :45
ADDITIONAL EXERCISES
1. Program to develop Student information using File Concept.
2. Program to perform pointer arithmetic operation.
Total Periods :3
REFERENCE BOOKS
1. .Paul Deitel and Harvey Deitel,―C How to Program‖, Seventh edition, Pearson Publication
2. Juneja, B.Land Anita Seth,―Programming in C‖, CENGAGE Learning India pvt.Ltd.,2011.
3.PradipDey, Manas Ghosh,―Fundamentals of Computing and Programming in C‖, First Edition, Oxford
UniversityPress,2009.
4.AnitaGoel and AjayMittal,―Computer Fundamentals andProgramminginC‖,DorlingKindersley(India)
Pvt.Ltd.,PearsonEducationinSouthAsia,2011.

31 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 SEMESTER 2
20HS2102 TECHNICAL ENGLISH L T P S C
ASSESSMENT TYPE TYPE -1 3 0 0 0 3
OBJECTIVES

To prepare them to use active and passive vocabulary in different academic and professional
contexts, developing their LSRW skills, namely listening, speaking, reading and writing skills.

COURSE OUTCOMES
Students will be able to
1. Read technical texts and write area-specific texts effortlessly.
2. Listen and comprehend lectures and talks in their area of specialization successfully.
3. Speak appropriately and effectively in varied formal and informal contexts.
4. Write reports and winning job applications

UNIT 1 – INTRODUCTION TO TECHNICAL ENGLISH

Reading- Speed reading–Reading passages with time limit.

Writing-Writing Instructions, Recommendations, Checklists.
Listening - Listening to the conversation–Understanding the structure of conversations.
Speaking - Conversation practice in real life situations, asking for directions (using polite expressions),
giving directions(using imperative sentences),Purchasing goods from a shop, discussing various aspects
of a film(they have already seen)or a book(they have already read).
Language development:Degreesofcomparison-‗Wh‘questions,‗Yes‘or‗No‘questions
Vocabulary development– Compound Words
Total Periods :9
UNIT 2 – READING AND STUDY SKILLS

Reading-Reading a short story or an article from newspapers.

Writing-Interpreting charts(Tables, Pictures, Flowchart),Extended definitions.
Listening –Listening to situational based dialogues.
Speaking - Welcome Address, Vote of thanks.
Language development–Subject Verb Agreement
Vocabulary development–Synonyms and Antonyms
Total Periods :9
UNIT 3 – TECHNICALWRITINGANDGRAMMAR

Reading-Reading short technical texts from journals.

Writing-Sequence words, describing a process, Issue based Essays.
Listening – Viewing a model group discussion and reviewing the performance of
each participant Identifying the characteristics of a good listener.
Speaking-Groupdiscussionskills–initiatingthediscussion–exchanging suggestions and proposals.
Language development: Modal Verbs, Idioms and Phrases

32 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
Vocabulary development–Misspelled words
Total Periods :9

UNIT 4 – JOB APPLICATIONS

Reading-Reading for detailed comprehension.

Writing- Cover letter and Resume preparation (Via Email and Hardcopy),Paraphrasing.
Listening-Listening to Class room Lectures.
Speaking- Mechanics of presentations, Short oral presentations.
Language development Tenses-Reported speech, clauses, If clauses.
Vocabulary development- Phrasal verbs
Total Periods :9
UNIT 5 – REPORT WRITING

Reading-Reading and understanding technical articles.

Writing-Writing reports(Feasibility, Survey or Accident reports).
Listening-listening to different accents (Example: British /American/Indian).
Speaking –Role play practice in telephone skills.
Language development- Spotting errors in the given text, Punctuations.
Vocabulary development- Word formation(Noun, Verb, Adjective and Adverb).
Total Periods :9
TEXT BOOKS

1. Board of editors. Fluency in English A Course book for Engineering and Technology, Hyderabad: Orient
BlackSwan,2016.
2.Sudharshana.N.PandSaveetha.EnglishforTechnicalCommunication, New Delhi:Cambridge University
Press,2016.
REFERENCE BOOKS

1. Diana L. Fried-Booth, Project Work ,Oxford UniversityPress2014.

2.Grussendorf, Marion.EnglishforPresentations,Oxford:OxfordUniversityPress2007.
3.SureshE.Kumar.EngineeringEnglish,Hyderabad: OrientBlackSwan,2015.
4.MeansL.ThomasandElaineLanglois.English&CommunicationforColleges,USA:LanguageLearning, 2007
5.Raman, Meenakshi and Sharma, Sangeetha. Technical Communication Principles and Practice, New
Delhi: Oxford University Press, 2014.

33 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 MATHEMATICS–II L T P S C
20MA2102
ASSESSMENT TYPE TYPE -1 3 1 0 0 4
OBJECTIVES

To acquaint the student with the concepts of vector calculus, needed for problems in all engineering
disciplines, and develop an understanding of the standard techniques of complex variable theory so as to
enable the student to apply them with confidence, in application areas.

COURSE OUTCOMES

Students will be able to

1. Understanding the ideas of differential equations and facility in solving simple standard examples.
2. Calculate grad, div and curlin Cartesian and other simple coordinate systems. Also use Gauss, Stokes
and Greens theorems to prove simple results
3. Calculate grad, div and curlin Cartesian and other simple coordinate systems. Also use Gauss, Stokes
and Greens theorems to prove simple results
4. Evaluate real and complex integrals using the Cauchy integral formula and the residue theorem.
5. Understand Laplace transform and inverse transform of simple functions, and apply to solve differential
Equations with constant coefficients
UNIT 1 – DIFFERENTIAL EQUATIONS

Higher order linear differential equations with constant coefficients- Method of variation of parameters–
Homogenous Equation of Euler‘s and Legendre‘s type–system of simultaneous linear differential equations
with constant coefficients.
Total Periods :12
UNIT 2 – VECTOR CALCULUS

Gradient and directional derivative – Divergence and curl - Vector identities – Irrotational and Solenoidal
vector fields –Green‘s, Gauss divergence and Stoke‘s theorems–verification and application in
evaluating line, surface and volume integrals.
Total Periods :12
UNIT 3 – ANALYTIC FUNCTION

Analytic functions– Necessary and sufficient conditions for analyticity in Cartesian and polar coordinates-
Properties– Harmonic conjugates– Construction of analytic function-Conformal mapping–Mapping by
functions wzc,az,1W=Z2-Bilinear transformation.
Total Periods :12
UNIT 4 – COMPLEX INTEGRATION

Cauchy‘s integral theorem– Cauchy‘s integral formula – Taylor‘s and Laurent‘s series– Singularities–
Residues–Residue theorem– Application of residue theorem for evaluation of real integrals – Use of
circular contour (excluding poles on the real axis).
Total Periods :12

34 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 UNIT 5 – LAPLACE TRANSFORMS

Existence conditions – Transforms of elementary functions – Transform of unit step function and unit
impulse function –Basic properties–Shifting theorems- Transforms of derivatives and integrals –Initial and
final value theorems –Inverse transforms– Convolution theorem– Transform of periodic functions–
Application to solution of linear second order ordinary differential equations with constant coefficients.
Total Periods :12
TEXT BOOKS

1. Erwin Kreyszig, John Wiley and Sons ―AdvancedEngineeringMathematics‖,10thEdition,NewDelhi,2016.

2. GrewalB.S.,‖Higher Engineering Mathematics‖,44rdEditionKhannaPublishers,NewDelhi,,2014.
REFERENCE BOOKS

1. Veerarajan.T,Engineering MathematicsII, Tata Mc graw Hill Education Pvt.

2. Sastry S.S Engineering Mathematics, Vol.I&II ,4thEdition, PHI Learning Pvt.Ltd, NewDelhi, 2014.
3. JainR.K.andIyengarS.R.K,AdvancedEngineeringMathematics,3 rdEdition,NarosaPublications, New Delhi,,
2007.
4.BaliN.,GoyalM.andWatkinsC., AdvancedEngineeringMathematics,7thEdition,FirewallMedia (An Imprint of
Lakshmi Publications Pvt.,Ltd.,),NewDelhi,2009.
5.PeterV.O‘Neil,Advanced Engineering Mathematics,Cengage LearningIndia Pvt. Ltd, NewDelhi, 2007.
6.RayWylieCandBarrett.L.C,AdvancedEngineeringMathematics,6thEdition,TataMcGrawHillEducation Pvt.
Ltd, New Delhi, 2012.

35 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 PHYSICS FOR INFORMATION L T P S C
20PH2106
SCIENCE
ASSESSMENT TYPE TYPE -1 3 0 0 0 3
OBJECTIVES
To understand the essential principles of Physics of semiconductor device and Electron transport
properties, become proficient in magnetic and optical properties of materials and Nano-electronic
devices.

COURSE OUTCOMES
Students will be able to
1. Gain knowledge on classical and quantum electron theories, and energy band structures
2. Acquire knowledge on basics of semi conductor physics and its applications in various devices
3. Get knowledge on magnetic properties of materials and their applications in data storage
4. Have the necessary understanding on the functioning of optical materials for opto electronics.
5. Understand the basics of quantum structures and their applications in carbon electronics.

UNIT 1 – ELECTRICAL PROPERTIES OF MATERIALS

Classical free electron theory – Expression for electrical conductivity –Thermal conductivity, expression-
Wiedemann - Franz law – Success and failures - electrons in metals– Particleina three dimensional box–
degenerate states–Fermi- Diracstatistics–Density of energy states – Degeneracy and Non – degeneracy.
Total Periods :9
UNIT 2 – SEMICONDUCTOR PHYSICS

Introduction–carrier concentration and position of Fermilevelin intrinsic semiconductors–Intrinsic

conductivity and its Temperature dependence, Extrinsic semiconductors (Qualitative analysis)–Hall
Effect and its applications– Ohmic contacts–Schott kydiode- Numerical problems.
Total Periods :9
UNIT 3 – MAGNETIC PROPERTIES OF MATERIALS

Magnetic dipole moment– atomic magnetic moments- magnetic permeability and susceptibility-Magnetic
material classification: diamagnetism – para magnetism – ferromagnetism – anti ferromagnetism – ferri
magnetism – Domain Theory- MversusH behaviour–Hard and soft magnetic materials– examples and
uses—Magnetic principle in computer data storage – Magnetic hard disc (GMRsensor).
Total Periods :9
UNIT 4 – OPTICAL PROPERTIES OF MATERIALS

Classification of optical materials– carrier generation and recombination processes-Absorption emission

and scattering of lighting metals, insulators and semiconductors (concepts only)- photo current in a P-N
diode– solar cell-LED–Organic LED–Laser diodes– Optical data storage techniques.
Total Periods :9
UNIT 5 – NANO DEVICES

36 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
Electron density in bulk material–Size dependence of Fermienergy– Quantum confinement– Quantum
structures–Density of states in quantum well, quantum wire and quantum dot structure- Band gap of
nano materials–Tunneling: Single electron phenomena and single electron transistor–Quantum dot laser.
Conductivity of metallic nano wires–Carbon nano tubes: Properties and applications.
Total Periods :9
TEXT BOOKS

1. Jasprit Singh,SemiconductorDevices:BasicPrinciples,Wiley2012.
2. Kasap,S.OPrinciplesofElectronicMaterialsandDevices,McGraw-HillEducation,2007.
3. Kittel,C.IntroductiontoSolidStatePhysics,Wiley,2005.
REFERENCE BOOKS

1. Garcia.N. & Damask.A, PhysicsforComputerScienceStudents,Springer-Verlag,2012.

2. Hanson,G.W, Fundamentals of Nanoelectronics,PearsonEducation,2009.
3. Rogers, B,Adams,J.& Pennathur. S, Nanotechnology: Understanding Small Systems,
CRCpress,2014.

37 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 ENVIRONMENTAL SCIENCE AND L T P S C
20GE2104
ENGINEERING
ASSESSMENT TYPE TYPE -1 3 0 0 0 3
OBJECTIVES
To demonstrate and utilize by application and understanding of the concepts of chemistry as they
apply to the environment with particular focus on air, water and soil pollution

COURSE OUTCOMES

Students will be able to

1. Understand the species under danger to be conserved with out affecting the ecological balance.
2. Identify the various eco- friendly methods to control & prevent the environmental pollutions.
3.Appreciate the ethical, cross cultural, and historical context of environmental issues and the links
between human and natural resources.
4.Apply systems concepts and methodologies to analyze and understand interactions between social and
environmental processes.
5.Student have the ability to self analyse themselves, solving problems, understanding the role of
information technology towards environment & human health.

UNIT 1 – ENVIRONMENT,ECOSYSTEMS AND BIODIVERSITY

Definition, scope and importance of environment – need for public awareness – concept of an ecosystem –
structure and function of an ecosystem–producers, consumers and decomposers–energy flowing the
ecosystem–ecological succession–food chains, food webs and ecological pyramids –Introduction, types,
characteristic features, structure and function of the (a) forest ecosystem (b) grassland ecosystem (c)
desert ecosystem (d) aquatic ecosystems (ponds, streams, lakes, rivers, oceans, estuaries) – Introduction
to biodiversity definition: genetic, species and ecosystem diversity – bio geographical classification of India
– value of biodiversity: consumptive use, productive use, social, ethical, aesthetic and option values –
Biodiversity at global, national and local levels – India as a mega-diversity nation – hot-spots of biodiversity
– threats to biodiversity: habitatloss, poaching of wildlife, man- wildlife conflicts–endangered and endemic
species of India–conservation of biodiversity: In-situ and ex-situ conservation of biodiversity. Field study of
common plants, insects, birds; Field study of simple ecosystems–pond, river, hill slopes ,etc.
Total Periods :9
UNIT 2 – ENVIRONMENTAL POLLUTION

Definition – causes, effects and control measures of: (a) Air pollution (b) Water pollution (c) Soil pollution
(d) Marine pollution(e) Noise pollution (f) Thermal pollution(g) Nuclear hazards– solid waste management:
causes, effects and control measures of municipal solid wastes – role of an individual in prevention of
pollution – pollution case studies –disaster management: floods, earthquake, cyclone and landslides. Field
study of local polluted site– Urban / Rural /Industrial/Agricultural.
Total Periods :9
UNIT 3 – NATURAL RESOURCES

38 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
Forest resources: Use and over-exploitation, deforestation, case studies- timber extraction, mining, dams
and their effects on forests and tribal people – Water resources: Use and over- utilization of surface and
ground water, floods, drought, conflicts over water, dams-benefits and problems – Mineral resources: Use
and exploitation, environmental effects of extracting and using mineral resources, case studies–Food
resources: World food problems ,changes caused by agriculture and overgrazing, effects of modern
agriculture, fertilizer- pesticide problems, water logging, salinity, case studies– Land resources: Land as a
resource, land degradation, man induced landslides, soil erosion and desertification– role of an individual in
conservation of natural resources.
Total Periods :9
UNIT 4 – SOCIAL ISSUES AND THE ENVIRONMENT

From unsustainable to sustainable development – urban problems related to energy – water conservation,
rain water harvesting, watershed management – resettlement and rehabilitation of people; its problems and
concerns, case studies –role of non-governmental organization- environmental ethics: Issues and possible
solutions – climate change, global warming, acid rain, ozone layer depletion, nuclear accidents and
holocaust, case studies. – waste land reclamation –consumerism and waste products – environment
production act – Air (Prevention and Control of Pollution) act – Water(Prevention and control of Pollution)
act – Wildlife protection act – Forest conservation act – enforcement machinery involved in environmental
legislation- central and state pollution control boards- Public awareness.
Total Periods :9
UNIT 5 – HUMAN POPULATION AND THE ENVIRONMENT

Population growth, variation among nations – population explosion – family welfare programme –
environment and human health – human rights – value education – HIV / AIDS – women and child welfare
– role of information technology in environment and human health–Case studies.
Total Periods :9
TEXT BOOKS

1. ErachBharucha,TextbookofEnvironmental Studies, ,UniversitiesPress(I)Pvt,Ltd, Hydrabad,2015.

2.Rajagopalan.R,EnvironmentalStudiesFromCrisistoCure,,OxfordUniversityPress,2005.
REFERENCE BOOKS

1. Dharmendra S.Sengar,Environmental law,,PrenticehallofIndiaPvtLtd,NewDelhi,2007

2.G.Tyler Miller and ScottE.Spoolman,EnvironmentalScience, ,CengageLearningIndiaPVT,LTD,Delhi,
2011.

39 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 COMPUTATIONAL THINKING USING L T P S C
20GE2102
PYTHON
ASSESSMENT TYPE TYPE -1 3 0 0 1 3
OBJECTIVE
To master the fundamentals of writing Python scripts.
COURSE OUTCOMES
Students will be able to
1. Demonstrate simple Python programs using conditionals and looping statements
2. Analyse primitive data structures using python.
3. Analyse non- primitive data structures using python.
4. Develop a dictionaries and decompose a program into functions
5. Apply Read and write data from/to files in Python Programs.
UNIT 1 – INTRODUCTION TO PROBLEM SOLVING USING PYTHON

Basic data types (int, float, Boolean), Variables, Naming Conventions, Name binding, Expressions, Input-
output, Sequence, Selection-conditional statements and Repetition-loops.
Illustrative programs: Developing programs to Exchange the values of two variables, Summation of three
numbers, To find the largest of three numbers, To print month name based on user choice, Finding
Armstrong number, Find the prime numbers, To allot grade fora student according to the marks obtained.
Pattern Programs- Number Series generation programs using loops, Program to check whether it is a right-
angled triangle.
Total Periods :9
UNIT 2 – PROBLEM UNDERSTANDING AND ANALYSIS USING PRIMITIVE DATA STRUCTURES IN
PYTHON

What is an Abstract Data Type (ADT), what is a data structure, how is ADT and Data structure related.
How it is useful in problem understanding and analysis? Primitive Data structures: Int, Float,
Boolean(Recap),Strings.
Illustrative programs: Developing programs to find type data type of a number, How to create a string,
how to access characters in a string. How reverse indexing works, How to delete a string, how to
concatenate two strings, how to iterate through strings, Convert the string into int, float and Boolean, Check
if the string is empty or not, perform the various slicing operations on strings. Develop a calculator program,
which the basic functionalities of addition, subtraction, multiplication, division, modulus operations, find the
occurrences of a character in a string, Reverse of a String, check whether the given string is palindrome or
not, Program to remove special character from the given string.
Total Periods :9
UNIT 3 – PROBLEM UNDERSTANDING AND ANALYSIS USING NON PRIMITIVE DATA STRUCTURES
IN PYTHON

40 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
Non-primitive data structures: Arrays, Lists, Tuples ,Sets.
Illustrative programs: Developing programs to create an array of 5 integers and display the array items,
reverse the order of the items in the array. Access individual element through indexes to check a list is
empty or not, find the sum all the items in a list, to get the smallest number from a list. To create a tuple
with different data types, to convert a list to a tuple program to add an item in a tuple, to convert a tuple to a
string, to find the repeated items of a tuple, to find the length of a tuple. To create a set, to add member(s)
and remove member(s) in a set. Develop programs to print the array elements which absolute difference is
two in the array, Print maximum sum of two elements in an array.
Total Periods :9
UNIT 4 – PROBLEM UNDERSTANDING USING MODULARIZATION

Searching and Sorting using Dictionary, sets and Collections, modularization – modules (understanding a
small example using import is enough), Functions and recursion.
Illustrative programs: Developing programs to sort (ascending and descending) a dictionary by value, to
add a key to a dictionary , concatenate following dictionaries to create a new one, to check whether a given
key already exists in a dictionary, to iterate over dictionaries using for loops. To create an intersection of
sets, to create a union of sets. Use collections to find the most common elements and their counts of a
specified text. A function to find the Max of three numbers , function to sum all the numbers in a list,
program to reverse a string, function for Armstrong number, function to check whether a number is in a
given range, function that accepts a string and calculate the number of upper case letters and lower case
letters. Develop recursive function to calculate the sum of a list of numbers, to get the factorial of a non-
negative integer, to solve the Fibonacci sequence, to find gcd of a number.
Total Periods :9
UNIT 5 – FILES AND PACKAGES

Files and exception: text files ,reading and writing files, command line arguments, errors and exceptions,
handling exceptions, packages.
Illustrative programs: word count, copy contents of one file to another file, create a GUI to convert CSV
file into excel file using python.
Total Periods :9
TEXT BOOKS

1. ―Python Programming: Using Problem Solving Approach ― by Reema Theraja, Oxford Higher
Education,2017.
REFERENCE BOOKS

1. Paolo Ferragina and FabrizioLuccio, ―ComputationalThinking:FirstAlgorithms,ThenCode‖, Springer,2018.

2. KarlBeecher, BCS, ―ComputationalThinking:Abeginner'sguideto problem- Solving and programming‖,
The Chartered Institute for IT, 2017.
3. PaulCurzon and Peter William Mcowan, “The Power of Computational Thinking: Games, Magic And
Puzzles To Help You Become A Computational
Thinker‖, WSPC(EUROPE),2017.
4. David Riley and KennyA. Hunt Chapman and Hall ,‖Computational Thinking for the Modern Problem
Solver‖, CRC, 2014

41 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 20GE2103 ENGINEERING GRAPHICS L T P S C
ASSESSMENT TYPE TYPE -2 3 1 0 3 4
OBJECTIVES

To gain knowledge on Engineering Drawing construction procedures.

COURSE OUTCOMES

Students will be able to

1. Develop multiple views of engineering components
2. Understanding the projection of point, straight line and plane
3. Develop the Projection of solid objects
4. Examine the Section and Develop lateral surfaces of solids
5. Apply isometric and perspective projections.

UNIT 1 – PLANE CURVES AND PICTORIAL VIEWS TO ORTHOGRAPHIC VIEWS

Geometrical Constructions like bisection of a straight line, division of a straight line into n equal parts,
bisection of angles, Curves used in engineering practices: Conics – Construction of ellipse, parabola and
hyperbola by eccentricity method –Construction of cycloid –Construction of involutes of square and circle–
Drawing of tangents and normal to the above curves. Scales- Forward and Backward scale Orthographic
projection – Principles – Principal planes - Representation of Three Dimensional objects – Layout of views–
Sketching of multiple views(Front, Top and Side views) from pictorial views of simple objects and
Engineering Components.
Total Periods :6+12
UNIT 2 – PROJECTION OF POINTS, LINES AND PLANE SURFACES

First Angle projection– Projection of points in four quadrants. Projection of straight lines (only First angle
projection) inclined to both the principal planes– Determination of true lengths and true inclinations by
rotating line method and traces. Projection of planes (polygonal and circular surfaces) inclined to both the
principal planes by change of position method.
Total Periods :6+12
UNIT 3 – PROJECTION OF SOLIDS

Projection of simple solids like prisms, pyramids, cylinder and cone when the axis is inclined to one of the
principal planes by change of position method or Auxiliary Projection method.
Total Periods :6+12

UNIT 4 – SECTION OF SOLIDS AND DEVELOPMENT OF LATERAL SURFACES OF SOLIDS

Sectioning of above solids in simple vertical position when the cutting plane is inclined to one of the
principal planes and perpendicular to the other– Obtaining true shape of the section. Development of lateral
surfaces of simple solids–Prisms, pyramids, cylinders and cones – Development of lateral surfaces of
sectioned solids.
Total Periods :6+12
42 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 UNIT 5 – ISOMETRIC AND PERSPECTIVE PROJECTIONS HEADING

Principles of isometric projection – Isometric scale – Isometric View – Isometric projections of simple solids
and cut solids –Prisms, pyramids, cylinders, cones – Combination of two solid objects in simple vertical
positions. Perspective projection of simple solids–Prisms, pyramids and cylinders by visual ray method.
Total Periods :6+12
TEXT BOOKS

1. Natarajan K.V.,―A textbook of Engineering Graphics‖, Dhanalakshmi Publishers, Chennai, 2019.

REFERENCE BOOKS

1.VenugopalK.and Prabhu RajaV, ―Engineering Graphics‖, New Age International(P)Limited,2018.

2.ShahM.B.,andRanaB.C.,―EngineeringDrawing‖, Pearson, 2ndEdition,2009.
3.Luzzader,Warren.J.andDuff,JohnM.,―FundamentalsofEngineeringDrawingwithanintroductiontoInteractive
Computer Graphics for Design and Production ‖,Eastern Economy Edition, Prentice Hall of India Pvt. Ltd,
New Delhi,2005.

43 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 PYTHON PROGRAMMING L T P S C
20GE2202
LABORATORY
ASSESSMENT TYPE TYPE -5 0 0 3 0 1.5
OBJECTIVES
To write, test, and debug simple Python programs.
COURSE OUTCOMES

Students will be able to

1. Demonstrate Write, test, and debug simple Python programs.
2. Develop Python programs with conditionals and loops.
3. Illustrate Python programs step-wise by defining functions and calling them.
4. Utilize Python lists, tuples, dictionaries for representing compound data.
5. Analyze read and write data from/to files in Python.

LIST OF EXPERIMENTS

1. Compute the GCD of two numbers.

2. Find the square root of a number (Newton‗s method)
3. Exponentiation(power of a number)
4. Find the maximum of a list of numbers
5. Linear search and Binary search
6. Selection sort, Insertion sort
7. Merge sort
8. First n prime numbers
9. Multiply matrices
10. Programs that take command line arguments(word count)
11. Find the most frequent words in a text read from a file
Total Periods :45
ADDITIONAL EXERCISES

1.Simulate elliptical orbits in Pygame

2.Simlate bouncing using Pygame

Total Periods :3
REFERENCE BOOKS
1. Paolo Ferragina and FabrizioLuccio, Computational Thinking: First Algorithms ,Then Code‖,
Springer,2018.
2. Karl Beecher, BCS, ―Computational Thinking: Abeginner's guide to problem-solving and
programming‖, The Chartered Institute for IT, 2017.
3. Paul Curzonand Peter William Mcowan, ―The Power of Computational Thinking: Games, Magic And
Puzzles To help You Become A Computational Thinker‖, WSPC(EUROPE),2017.
4. David RileyandKennyA.HuntChapmanand Hall ―Computational Thinking for the Modern Problem
Solver‖ CRC,2014.

44 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 ENGINEERING PRACTICES LABORATORY L T P S C
20GE2203
(GROUPA)
ASSESSMENT TYPE TYPE -5 0 0 3 0 1.5
OBJECTIVES

To develop the knowledge and skills for making the components using sheet metal, carpentry
and welding equipment tools , gain the skills form a king house hold pipeline connections using suitable
tools and to enrich knowledge on basics in lathe and drilling operations.

COURSE OUTCOMES

Students will be able to

1. Develop the skills form a king the components in sheet metal & Carpentry and welding.
2. Utilize the knowledge to use the plumbing tools and construct the house hold and industrial
Applications
3. Extend the basics of machining operations using lathe and drilling machine.
4. Illustrate them a chine assembly practices on centrifugal pump and air conditioner.

LIST OF EXPERIMENTS

1. Introduction to Carpentry
2. Making of Cross Lap Joint
3. Making of TJoint
4. Making of dovetail joint
5. Making of Mortise and Tenon Joint
6. Introduction to Plumbing
7. Single tap connection with shower
8. Multiple tap connection using GI, PVC and flexible tube
9. Introduction to Welding
10. Introduction to Welding
11. Making of Single V Butt joint
12. Making of Corner Joint
13. Making of T–Fillet Joint
14. Introduction to Sheet Metal
15. Fabrication of Rectangular Tray
16. Fabrication of Funnel
17. Study of basic machining operations (Lathe, Drilling and tapping
18. Machine assembly practice on centrifugal pump and air conditioner.
Total Periods :45

45 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 ENGINEERING PRACTICES LABORATORY L T P S C
20GE2203
(GROUP B)
ASSESSMENT TYPE TYPE -5 0 0 3 0 1.5
OBJECTIVES
To impart knowledge on Assembly simple electrical wiring connections using suitable tools,
Measurement of AC electrical quantities, energy and resistance to earth, components of Electronics and
logic IC‘ and Soldering and de-soldering Practice on PCB.

COURSE OUTCOMES
Students will be able to
1. Experiment with different residential house wiring.
2. Measure AC electrical quantities, energy and resistance to earth of electrical equipment.
3. Identify the basic components values of RLC, logic gate and IC types and packages
4. Experiment with simple RLC circuit on PCB by soldering
5. Understand the circuit design of Electrical power supply.

LIST OF EXPERIMENTS
1. Residential house wiring using switches, fuse, indicator, lamp and energy meter and fuse calculation.
2. Lamp wiring.
3. Two way switch connection.
4. Measurement of electrical quantities- Voltage, Current, Energy, Power &power factor in RLC circuit.
5. Measurement of resistance to earth of electrical equipment.
Total Periods :45

46 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 20GE2601 PROFESSIONAL SKILLS1 L T P S C
ASSESSMENT TYPE TYPE -1 2 0 0 0 1
OBJECTIVES

To Interrogate common presenting complaints, record medical history, demonstrate a general

physical examination, perform emergency management skills like BLS, and perform peripheral
venipuncture on a mannequin.

COURSE OUTCOMES

Students will be able to

1. Demonstrate their understanding of grammatical structures and skills in producing sentences, long
and
short notes
2. Learners will be able to practice their articulating skills with eloquence and fluency by participating in
speaking activities
3. Acquires Time Management for campus placements and Competitive Examinations
4. Makes Calculations successfully, Interprets Data, Communicate Results, Evaluates an issue and
solve a
problem in real-world context
5.Comprehends quick decision making.

UNIT 1

Self exordium- Sentence connectors– Homonyms /Homophones Homographs- Problems on numbers,

Divisibility rule– LCM & HCF– Properties of LCM &HCF ,Relation between LCM & HCF ,Prime
Factorization Method & Division Method.
Total Periods :6
UNIT 2
Short answers- Input & Output– Lexica– Number series– Concept, Types of number series, Tips &
Tricks, Puzzles–Number puzzles, Reasoning Puzzles, Missing letter puzzles, Clock Puzzles.
Total Periods :6

UNIT 3
Selecting words from the text- Phrasal verbs -Time & Work – Concept, formula & shortcuts. Pipes &
Cistern–format of time & Work, Concepts, formula & shortcuts.
Total Periods :6

UNIT 4

47 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
Reframe the sentence– Punctuations– Plural, Uncountable, Infinitive Coding & Decoding–Letter coding,
Substitution, Mixed letter coding, Mixed number coding.
Total Periods :6

UNIT 5
Knowledge sharing - Add it up (Reading) / MCQ – Geometry & Mensuration - Analysis of geometric
shapes & parametres, Study & Calculation of Surface area, Lateral Surface Area & Volume.
Total Periods :6

REFERENCE BOOKS

1. R.S.Agarwal, ―AModernApproachtoVerbal&Non-VerbalReasoning‖S.ChandLimited,January2010.
2. Abhjitgupta, ―QuatitativeAptitudeforCompetitiveExaminations‖,TataMcGrawHills,4thEdition,2011.

48 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 SEMESTER 3

20MA3105 TRANSFORMS AND PARTIAL DIFFERENTIAL L T P S C

EQUATIONS
ASSESSMENT TYPE TYPE -1 3 1 0 0 4
OBJECTIVES
To introduce the basic concepts of partial differential equations for solving standard partial differential
equations, Fourier series analysis, boundary value problems and introduce the effective mathematical tools
for the solutions of partial differential equations that model several physical processes and to develop Z
transform techniques for discrete time systems.

COURSE OUTCOMES
Students will be able to
1. Understand how to solve the given standard partial differential equations.
2. Solve differential equations using Fourier series analysis which plays a vital role in engineering
applications
3. Appreciate the physical significance of Fourier series techniques in solving one and two dimensional
heat flow problems and one dimensional wave equations
4. Understand the mathematical principles on transforms and partial differential equations would provide
them the ability to formulate and solve some of the physical problems of respective engineering
5. Use the effective mathematical tools for the solutions of partial differential equations by using Z transform
techniques for discrete time systems.
UNIT 1 – PARTIAL DIFFERENTIAL EQUATIONS
Formation of partial differential equations – Singular integrals - Solutions of standard types of first order
partial differential equations - Lagrange‘s linear equation - Linear partial differential equations of second
and higher order with constant coefficients of both homogeneous and nonhomogeneous types.
Total Periods :12
UNIT 2 – FOURIER SERIES
Dirichlet‘s conditions – General Fourier series – Odd and even functions – Half range sine series – Half
range cosine series – Complex form of Fourier series – Parseval‘s identity – Harmonic analysis.
Total Periods :12

UNIT 3 – APPLICATIONS OF PARTIAL DIFFERENTIAL EQUATIONS

Classification of PDE – Method of separation of variables - Fourier Series Solutions of one dimensional
wave equation – One dimensional equation of heat conduction – Steady state solution of two dimensional
equation of heat conduction.
Total Periods :12
UNIT 4 – FOURIER TRANSFORMS

49 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
Statement of Fourier integral theorem – Fourier transform pair – Fourier sine and cosine transforms –
Properties – Transforms of simple functions – Convolution theorem – Parseval‘s identity .
Total Periods :12

UNIT 5 – Z - TRANSFORMS AND DIFFERENCE EQUATIONS

Z-transforms - Elementary properties – Inverse Z-transform (using partial fraction and residues) – Initial and
final value theorems – Convolution theorem - Formation of difference equations – Solution of difference
equations using Z - transform.
Total Periods :12
TEXT BOOKS
1. Grewal B.S., ―Higher Engineering Mathematics", 43rd Edition, Khanna Publishers, New Delhi, 2014.
2. Narayanan S., ManicavachagomPillay.T.K and Ramanaiah.G "Advanced Mathematics for Engineering
Students",Vol. II & III, S.Viswanathan Publishers Pvt. Ltd, Chennai, 1998

REFERENCE BOOKS
1. Andrews, L.C and Shivamoggi, B, "Integral Transforms for Engineers" SPIE Press, 1999.
2. Bali. N.P and Manish Goyal, "A Textbook of Engineering Mathematics", 9th Edition, Laxmi Publications
Pvt. Ltd, 2014.
3. Erwin Kreyszig, "Advanced Engineering Mathematics ", 10th Edition, John Wiley, India, 2016.
4. James, G., "Advanced Modern Engineering Mathematics", 3rd Edition, Pearson Education, 2007.
5. Ramana. B.V., "Higher Engineering Mathematics", McGraw Hill Education Pvt. Ltd, New Delhi, 2016.
6. Wylie, R.C. and Barrett, L.C., ―Advanced Engineering Mathematics ―Tata McGraw Hill Education Pvt.
Ltd, 6th Edition, New Delhi, 2012.

50 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 20CS3301 DIGITAL PRINCIPLES AND SYSTEM DESIGN L T P S C
ASSESSMENT TYPE TYPE -3 3 0 2 1 4
OBJECTIVES
To impart knowledge on Basic theorems of Boolean algebra and gate level minimization and implement the
design of combinational circuits, analysis the process of sequential circuits, concept of memories and
programmable logic devices, design procedures of asynchronous sequential circuits.
COURSE OUTCOMES
Students will be able to
Upon completion of the course, students shall have ability to,
1. Design and Develop digital circuits using Boolean algebra and gate level minimization.
2. Examine the concept of combinational and sequential logic circuits.
3. Investigate about the function of different programmable logic devices and Asynchronous sequential
circuits.
4. Design and Implement Boolean algebra and Combinational circuits.
5. Design and Implement Counters and Registers using Digital ICs.

UNIT 1 – BOOLEAN ALGEBRA AND LOGIC GATES

Boolean algebra and theorems – Boolean functions: SOP - POS – Simplification of boolean function
using boolean algebra- Design of boolean function using logic gates - Simplifications of boolean
functions using karnaugh map: two Variable K-Map- three Variable K-Map and four Variable K-Map -
simplification of boolean functions using Quine McClusky method . Total Periods :10
UNIT 2 – COMBINATIONAL AND SEQUENTIAL CIRCUITS
Combinational circuits : Design of basic adders and subtractors, Multiplexers, Demultiplexers, Two Bit
Comparator, Code Converters: Binary to Gray - Binary to BCD.
Sequential circuits: Flip-flops - SR, JK, D, T, – Characteristic table and equation - Design of
Synchronous and Asynchronous counters, Types of shift registers. Total Periods 10
UNIT 3 – ASYNCHRONOUS SEQUNTIAL LOGIC AND MEMORIES
Analysis of fundamental mode asynchronous sequential circuits - Design of asynchronous
fundamental mode sequential circuits- Hazards: Static hazard - Dynamic Hazard -Races – Introduction to
Memories - Design of combinational circuit using PLA - Design of combinational circuit using PAL.
Total Periods :10
LIST OF EXPERIMENTS

1.Verification of Boolean Theorems using basic gates.

2. Design and implementation of Half adder and Full Adder
3. Design and implementation of Half subractor and Full subtractor
4. Design of Code converters
5. Design and implementation of Parity Generator and checker.
6. Design and implementation of Magnitude Comparator
7. Realization of Multiplexer and Decoder
8. Design and implementation of synchronous counters

51 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
9. Design and implementation of shift Registers
Total Periods :30

TEXT BOOKS
1. Salivahanan S and Arivazhagan S, ―Digital Circuits and Design‖, Oxford University Press, 5th Edition,
2018.
2. Morris Mano M and Michael D. Ciletti., ―Digital Design‖, Prentice Hall, 5thEdition, 2013.
REFERENCE BOOKS
1. Raj Kamal, ―Digital systems - Principles and Design‖, Pearson education 2nd Edition, 2012.
2. Thomas L. Floyd, ―Digital Fundamentals‖, Pearson Education Inc, New Delhi, 8th Edition, 2003
3. Donald P.Leach and Albert Paul Malvino, ―Digital Principles and Applications‖, 6th Edition, McGraw Hill,
2003.
4. Charles H.Roth. ―Fundamentals of Logic Design‖, Thomson Learning, 2003.

52 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 20CS3101 DATA STRUCTURES USING C L T P S C
ASSESSMENT TYPE TYPE -1 3 0 0 1 3
OBJECTIVES
To provide the knowledge of basic data structures and their implementations.
COURSE OUTCOMES
Students will be able to
1. Analyze abstract data types
2. Implement abstract data types for linear data structures.
3. Develop non-linear data structures.
4. Discover solutions for different linear and non-linear data structures.
5. Design applications using various sorting algorithms.
UNIT 1 – LINEAR DATA STRUCTURES-ADT-LIST
Introduction-Abstract Data Types (ADTs) – List ADT – Array-based implementation – Linked list
implementation –Singly Linked lists- Circularly Linked lists- Doubly Linked lists – Applications of lists –
Polynomial Manipulation – All operations (Insertion, Deletion, Merge, Traversal).
Total Periods :9
UNIT 2 – LINEAR DATA STRUCTURES – STACKS, QUEUES
Stack ADT – Operations – Applications – Evaluating Arithmetic expressions- Conversion of Infix to
postfix expression – Queue ADT – Operations – Circular Queue – Priority Queue – DeQueue –
Applications of queues.
Total Periods :9
UNIT 3 – NON-LINEAR DATA STRUCTURES – TREES
Tree ADT-General tree – Tree traversals – Binary Tree ADT – Expression trees – Applications of trees –
Binary search tree ADT –Threaded Binary Trees- AVL Trees – B-Tree – B+ Tree – Heap – Applications
of heap- Trie structure.
Total Periods :9
UNIT 4 – NON-LINEAR DATA STRUCTURES – GRAPHS
Definition – Representation of Graph – Types of graph – Breadth-first traversal – Depth-first traversal –
Topological Sort – Bi-connectivity – Cut vertex – Euler circuits – Applications of graphs-Shortest path
algorithm.
Total Periods :9
UNIT 5 – SEARCHING, SORTING AND HASHING TECHNIQUES
Searching- Linear Search – Binary Search. Sorting – Bubble sort – Selection sort – Insertion sort – Shell
sort – Radix sort. Hashing- Hash Functions – Separate Chaining – Open Addressing – Rehashing –
Extendible Hashing.
Total Periods :9

53 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
TEXT BOOKS
1. Mark Allen Weiss, ―Data Structures and Algorithm Analysis in C‖, 2nd Edition, Pearson Education,
2002.
2.ReemaThareja, ―Data Structures Using C‖, Second Edition, Oxford University Press, 2011

REFERENCE BOOKS
1. Thomas H. Cormen, Charles E. Leiserson, Ronald L.Rivest, Clifford Stein, ―Introduction to Algorithms‖,
Second Edition, Mcgraw Hill, 2002.
2.Aho, Hopcroft and Ullman, ―Data Structures and Algorithms‖, Pearson Education,1983.
3.Stephen G. Kochan, ‖Programming in C‖, 3rd edition, Pearson Education
4.Ellis Horowitz, SartajSahni, Susan Anderson-Freed, ―Fundamentals of Data Structures in C‖, Second
Edition, University Press, 2008.

54 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 20CS3102 OBJECT ORIENTED PROGRAMMING L T P S C
ASSESSMENT TYPE TYPE -1 3 0 0 1 3
OBJECTIVES
To Understand the basic concepts of object-oriented programming, interface, multithreading,
exception handling, IO streams, AWT and Swing.

COURSE OUTCOMES
Students will be able to
1. Construct Java programs using OOP principles
2. Analyze Java programs with the concepts inheritance and interfaces
3. Solve Java applications using exceptions and I/O streams
4. Demonstrate Java applications with threads and generics classes
5. Develop templates, graphics programming using AWT, Swing.
UNIT 1 – INTRODUCTION TO OOP AND JAVA FUNDAMENTALS

Object Oriented Programming - Abstraction – Objects and Classes - Encapsulation- Inheritance

Polymorphism- OOP in Java – Characteristics of Java – The Java Environment - Java Source File -
Structure – Compilation. Fundamental Programming Structures in Java – Defining classes in Java –
constructors, methods –Access specifiers - Static members -Comments, Data Types, Variables,
Operators, Control Flow, Arrays , Packages - JavaDoc comments.
Total Periods :9
UNIT 2 – INHERITANCE AND INTERFACES

Inheritance – Super classes- Subclasses –Protected members – Constructors in Subclasses- The Object
class – Abstract classes and Methods- Final methods and Classes – Interfaces – Defining an interface,
Implementing interface, Differences between Classes and Interfaces and Extending Interfaces - Object
cloning - Inner classes - Strings.
Total Periods :9
UNIT 3 – EXCEPTION HANDLING AND I/O STREAMS
Exceptions - Exception Hierarchy - Throwing and Catching Exceptions – Built-in Exceptions, Creating
Own Exceptions. Input / Output Basics – Streams – Byte streams and Character streams – Reading and
Writing Console – Reading and Writing Files.
Total Periods :9
UNIT 4 – MULTITHREADING
Multithreading: Differences between multi-threading and multitasking, thread life cycle, creating threads,
Synchronizing threads, Inter-thread communication.
Total Periods :9

UNIT 5 – AWT AND SWING

55 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
AWT Event Hierarchy – Frame – Components – Basics of Event handling – Event handlers– Mouse
events– Introduction to Swing – Layout management – Swing Components – Text Fields , Text Areas –
Buttons- Check Boxes – Radio Buttons – Lists- Choices- Scrollbars – Windows –Menus – Dialog Boxes.
Total Periods :9
TEXT BOOKS
1. Herbert Schildt, ―Java The complete reference‖, 11th Edition, McGraw Hill Education, 2019.

REFERENCE BOOKS
1.Paul Deitel, Harvey Deitel, ―Java SE 8 for programmers‖, 3rd Edition, Pearson, 2015.
2. Steven Holzner, ―Java2 Black book, Dreamtech press, 2011.
3. Timothy Budd, ―Understanding Object-oriented programming with Java‖, Updated Edition, Pearson
Education, 2000.

56 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 20CS3401 DATABASE TECHNOLOGY L T P S C
ASSESSMENT TYPE TYPE -3 3 0 2 1 4
OBJECTIVES
To understand the fundamentals of database management systems with an emphasis on how to
organize, maintain and retrieve information efficiently, and effectively.

COURSE OUTCOMES
Students will be able to
1. Design database for enterprise applications using Entity Relationship Diagrams
2. Normalize databases to reduce cost due to data redundancy
3. Apply serializability and concurrency control on database transaction and knowledge on advanced
Databases
4. Apply the basics of SQL
5. Create database with appropriate constraints and query the database
6. Apply exception handling and normalization concepts using sql

UNIT 1 – DATABASE FUNDAMENTALS

Purpose of Database Systems – View of Data - Database System Architecture – Data Models -
Constraints - Entity Sets – Attributes – Keys - Entity Relationship Model – E-R Diagrams - Design Issues -
Extended E-R Features - Introduction of Relational Databases- Relational Algebra.
Total Periods :9
UNIT 2 – LOGICAL DATABASE DESIGN
Need for good database design – Functional Dependencies and Keys – Closure of Functional
Dependencies Set –Closure of attributes - Dependency Preservation - Decomposition using functional
dependencies – Canonical Cover - Atomic domains and First Normal Form – Second Normal Form – Third
Normal Form – Boyce Codd Normal Form – Multivalued Dependencies - Decomposition using Multivalued
dependencies – Fourth Normal Form – Join Dependencies – Fifth Normal Form
Total Periods :9
UNIT 3 – TRANSACTION & ADVANCED DATA BASE
Transaction Model– ACID properties – Transaction States - Serializability - Conflict Serializability – View
Serializability– Testing Serializability - Concurrency Control – Lock Based Protocols– Time Stamp Based
Protocols– Deadlocks – Recovery System – Failure Classification – Storage – Recovery and Atomicity –
Recovery Algorithm. ADVANCED DATA BASE: Object oriented Data base-Distributed Data base- XML
data base
Total Periods :12
LIST OF EXPERIMENTS

1. Data Definition Commands, Data Manipulation Commands for inserting, deleting, updating and
retrieving Tables and Transaction Control statements.
2. Database Querying – Simple queries, Nested queries, Sub queries and Joins.
3. Procedures and Functions
57 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
4. Triggers
5. Exception Handling
6. Database Design using ER Modelling , Normalization and Implementation for any application
7. Database Connectivity with Front End Tools
8. Mini Project
Total Periods :30

TEXT BOOKS
1. Henry F Korth, Abraham Silberschatz, S. Sudharshan, ―Database System Concepts‖, McGraw Hill, Sixth
Edition, 2011.
REFERENCE BOOKS
1. .R. Elmasri, S.B. Navathe, ―Fundamentals of Database Systems‖, Pearson Education/Addison Wesley,
Sixth Edition,2010.
2. Thomas Cannolly and Carolyn Begg, ―Database Systems, A Practical Approach to Design,
Implementation and Management‖, Pearson Education, Fifth Edition, 2009.
3. C.J.Date, A.Kannan and S.Swamynathan, ‖An Introduction to Database Systems‖, Pearson Education,
Eighth Edition,2006.
4. Raghu Ramakrishnan, Johannes Gehrke, ―Database Management Systems‖, McGraw Hill, Third
Edition,2004.

58 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 20CS3103 COMPUTER ORGANISATION AND L T P S C
ARCHITECTURE
ASSESSMENT TYPE TYPE -1 3 0 0 1 3
OBJECTIVES
To understand the structure, function and characteristics of computer systems and to study the
design of the various functional units and components of computers.

COURSE OUTCOMES
Students will be able to
1. Understand the basics structure of computers, operations and instructions
2. Design arithmetic and logic unit
3. Understand pipelined execution and design control unit.
4. Understand parallel processing architectures
5. Understand the various memory systems and I/O communication
UNIT 1 – BASIC STRUCTURE OF A COMPUTER SYSTEM
Functional Units – Basic Operational Concepts – Performance – Instructions: Language of the Computer
– Operations, Operands – Instruction representation – Logical operations – decision making – MIPS
Addressing.
Total Periods :9
UNIT 2 – ARITHMETIC FOR COMPUTERS
Addition and Subtraction – Multiplication – Division – Floating Point Representation - Floating
Point Operations – Subword Parallelism.
Total Periods :9

UNIT 3 – PROCESSOR AND CONTROL UNIT

A Basic MIPS implementation – Building a Data path – Control Implementation Scheme – Pipelining –
Pipelined data path and control – Handling Data Hazards & Control Hazards – Exceptions- RISC and
CISC architectures.
Total Periods :9
UNIT 4 – PARALLELISM
Parallel processing challenges – Flynn‗s classification – SISD, MIMD, SIMD, SPMD, and Vector
Architectures - Hardware multithreading – Multi-core processors and other Shared Memory
Multiprocessors - Introduction to Graphics Processing Units, Clusters, Warehouse Scale Computers and
other Message-Passing Multiprocessors
Total Periods :9
UNIT 5 – MEMORY & I/O SYSTEMS

59 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
Memory Hierarchy - memory technologies – auxiliary memory-cache memory – measuring and
improving cache performance – virtual memory, TLB‗s – Accessing I/O Devices – Interrupts – Direct
Memory Access – Bus structure – Bus operation – Arbitration – Interface circuits – USB- Simulation
Tools.
Total Periods :9
TEXT BOOKS
1. David A. Patterson and John L. Hennessy, Computer Organization and Design: The
hardware/Software
Interface, Fifth Edition, Morgan Kaufmann / Elsevier, 2014.
2. Carl Hamacher, Zvonko Vranesic, SafwatZaky and NaraigManjikian, Computer Organization and
Embedded Systems, Sixth Edition, Tata McGraw Hill, 2012.
REFERENCE BOOKS
1. William Stallings, Computer Organization and Architecture – Designing for Performance, Eighth
Edition,
Pearson Education, 2010.
2. John P. Hayes, Computer Architecture and Organization, Third Edition, Tata McGraw Hill, 2012.
3. John L. Hennessey and David A. Patterson, Computer Architecture – A QuantitativeApproach‖,
Morgan
Kaufmann / Elsevier Publishers, Fifth Edition, 2012.

60 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 20CS3201 DATA STRUCTURES LABORATORY L T P S C
ASSESSMENT TYPE TYPE -5 0 0 3 0 1.5
OBJECTIVES
To develop skills to design and analyze simple linear and non-linear data structures
COURSE OUTCOMES
Students will be able to
1. Illustrate functions to implement linear and non-linear data structure operations
2. Develop program for linear data structure operations for solving a given problem
3. Develop program for non-linear data structure operations for solving a given problem
4. Develop solution for non-linear data structure operations for a given problem
5. Design applications using functions that result in a collision free scenario for data storage and retrieval
LIST OF EXPERIMENTS
1. Array implementation of List ADT
2. Array implementation of Stack and Queue ADTs
3. Linked list implementation of List, Stack and Queue ADTs
4. Applications of List, Stack and Queue ADTs
5. Implementation of Binary Trees and operations of Binary Trees
6. Implementation of Binary Search Trees
7. Implementation of AVL Trees
8. Implementation of Heaps using Priority Queues.
9. Graph representation and Traversal algorithms
10. Applications of Graphs
11. Implementation of searching and sorting algorithms
12. Hashing – any two collision techniques
Total Periods :45
ADDITIONAL EXERCISES
1. Implementation of Red/Black Trees
2. Implementation of splay Trees
Total Periods :3
TEXT BOOKS
1. Mark Allen Weiss, ―Data Structures and Algorithm Analysis in C‖, 2nd Edition, Pearson Education,2002.

61 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
REFERENCE BOOKS
1. Thomas H. Cormen, Charles E. Leiserson, Ronald L.Rivest, Clifford Stein, ―Introduction to Algorithms‖,
Second Edition, Mcgraw Hill, 2002.
2. Aho, Hopcroft and Ullman, ―Data Structures and Algorithms‖, Pearson Education,1983.
3. Stephen G. Kochan, ―Programming in C‖, 3rd edition, Pearson Education
4. Ellis Horowitz, SartajSahni, Susan Anderson-Freed, ―Fundamentals of Data Structures in C‖, Second
Edition, University Press, 2008.

62 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 OBJECT ORIENTED PROGRAMMING L T P S C
20CS3202
LABORATORY
ASSESSMENT TYPE TYPE -5 0 0 3 0 1.5
OBJECTIVES
To write programs for solving real world problems using java collection frame wok.
COURSE OUTCOMES
Students will be able to
1. Illustrate the real-world applications using java programming
2. Develop the concepts of classes, packages, interfaces, array list and exception handling.
3. Build event handling using AWT, Swing, templates and multithreading.
LIST OF EXPERIMENTS
1. Programs using object creation, static blocks, decision making and looping statements
2. Programs using Polymorphism and inheritance, multiple inheritance using interface.
3. Develop a java application to implement currency converter (Dollar to INR, EURO to INR, Yen to INR
and vice versa), distance converter (meter to KM, miles to KM and vice versa) , time converter (hours to
minutes, seconds and vice versa) using packages.
4. Programs using constructors and this keyword
5. Program to print sum of digits of the largest number from the given set of 4-digit numbers using
methods
6. Program using array concept i) to find the number of increasing sequence in an array. ii)Finding the
frequent number series in an array
7. Program to find largest element in an array, add the largest element to each element and print the
sorted
array.
8. Program to split the string based on blank-space and store it in string array and print based on the
following conditions: print even position strings + odd position strings.
(eg. Input: This is java program Output: is program this java)
9. Create a java program to generate key based on input.
(eg. Input1=63752 (A 5 digit number)
Input2= Program (A String)
Input3= 4 (An integer)
Output : input3 + odd position characters in a string + input3‘s digit in input1= 4Porm5
10. Program to read and write from a file using I/O Streams.
11. Write a Java program to implement user defined exception handling.
63 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
12. Write a java program that implements a multi-threaded application that has three threads. First
thread
generates a random integer every 1 second and if the value is even, second thread computes the
square of the number and prints. If the value is odd, the third thread will print the value of cube of the
number.
Total Periods :45
ADDITIONAL EXERCISES

1. Programs using Collection frameworks.

Total Periods :3
TEXT BOOKS
1. Herbert Schildt, Java The complete reference, 11th Edition, McGraw Hill Education, 2019

REFERENCE BOOKS
1. Paul Deitel, Harvey Deitel, ―Java SE 8 for programmers, 3rd Edition, Pearson, 2015.
2. Steven Holzner, ―Java 2 Black book, Dream tech press, 2011.
3. Timothy Budd, ―Understanding Object-oriented programming with Java, Updated Edition, Pearson
Education, 2000.

64 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 20GE3602 PROFESSIONAL SKILLS-II L T P S C
ASSESSMENT TYPE TYPE -1 2 0 0 0 1
OBJECTIVES
To build presentation and verbal skills to create impact and to explore more opportunities. To
develop their confidence and to enhance their career skills. To understand the basic concepts of
Quantitative ability & Logical reasoning. To improve thinking capability of the students & To enhance the
problem solving skills and basic mathematical skills. To enhance the employability skills among the
students to meet out the corporate expectations & To provide best possible training for the students
through continuous training module

COURSE OUTCOMES
Students will be able to
1. Learners will be able to make effective presentation by using verbal skills.
2. They will be able to deal with nervousness and think more positively about public speaking
3. Acquires Time Management for campus placements and Competitive Examinations.
4. Makes Calculations successfully, Interprets Data, Communicate Results, Evaluates an issue and solve
a problem in real- world context
5. Comprehends quick decision making.
UNIT 1
Letter writing (Business letters) – Sentence Completion , Ratio and Proportion Concept, formula &
shortcuts – Solved examples , Averages – Important formulas – Tricks & solved examples .
Total Periods :6
UNIT 2
Business presentation - MNC idioms – Error spotting, Problems on Ages – Concept formulas & Tricks,
Partnership – Concepts & formulas.
Total Periods :6
UNIT 3
Can you read – Replace by correct word – Synonyms & Antonyms , Clocks & Calendars –Concept –Tricks
and Tips
Total Periods :6
UNIT 4
Paragraph jumble – Verbal analogies , Blood Relations – Important terms in blood relation – Concept &
Tricks
Total Periods :6
UNIT 5
Summarize spoken text – One word substitution – Sentence Improvement , Data Interpretation –Definition
– Methods & examples – Types of charts, graphs & tables.
Total Periods :6
TEXT BOOKS
1. Abhjitgupta, ―Quatitative Aptitude for Competitive Examinations‖ , Tata McGraw Hills, 4th
Edition,2011.William sanborn ―Technical communication A practical approach‖ Pearson 6 th edition 2010.

65 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
REFERENCE BOOKS
1. R. S. Agarwal, ―A Modern Approach to Verbal & Non-Verbal Reasoning‖ S. Chand Limited, January
2010.

66 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 SEMESTER 4

20MA4107 PROBABILITY AND QUEUEING THEORY L T P S C

ASSESSMENT TYPE TYPE -1 3 1 0 0 4
OBJECTIVES
To provide the required mathematical support in real life problems and develop probabilistic
models which can be used in several areas of science and engineering.

COURSE OUTCOMES
Students will be able to
1.Understand the fundamental knowledge of the concepts of probability and have knowledge of
standard distributions which can describe real life phenomenon.
2. Understand the basic concepts of probability and two dimensional random variable.
3. Variables and apply in engineering application.
4. Apply the concept of Queuing in engineering disciplines.
5. Understand and apply the concept of correlation and spectral dentities.
UNIT 1 – RANDOM VARIABLES
Discrete and continuous random variables – Moments – Moment generating functions – Binomial,
Poisson, Geometric, Uniform, Exponential, Gamma and Normal distributions.
Total Periods :12

UNIT 2 – TWO DIMENSIONAL RANDOM VARIABLE

Joint distributions – Marginal and conditional distributions – Covariance – Correlation and Linear
regression – Transformation of random variables.
Total Periods :12

UNIT 3 – RANDOM PROCESS

Classification – Stationary process – Markov process – Poisson process – Discrete parameter Markov
chain – Chapman Kolmogorov equations – Limiting distributions.
Total Periods :12

UNIT 4 – QUEUEING MODELS

Markovian queues – Birth and Death processes – Single and multiple server queueing models – Little‟s
formula – Queues with finite waiting rooms – Queues with impatient customers: Balking and reneging.
Total Periods :12

UNIT 5 – ADVANCED QUEUEING MODELS

67 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
Finite source models – M/G/1 queue – PollaczekKhinchin formula – M/D/1 and M/EK/1 as special cases
– Series queues – Open Jackson networks.
Total Periods :12

TEXT BOOKS
1.Ibe. O.C., ―Fundamentals of Applied Probability and Random Processes‖, Elsevier, 1st Indian
Reprint, 2007.
2. Gross. D. and Harris. C.M., ―Fundamentals of Queueing Theory‖, Wiley Student edition, 2004.
REFERENCE BOOKS
1.Robertazzi, ―Computer Networks and Systems: Queueing Theory and performance evaluation‖,
Springer, 3rd Edition, 2006.
2. Taha. H.A., ―Operations Research‖, Pearson Education, Asia, 8th Edition, 2007.
3.Trivedi.K.S., ―Probability and Statistics with Reliability, Queueing and Computer Science
Applications‖, John Wiley and Sons, 2nd Edition, 2002. 42
4. Hwei Hsu, ―Schaum‟s Outline of Theory and Problems of Probability, Random Variables and
Random Processes‖, Tata McGraw Hill Edition, New Delhi, 2004.
5. Yates. R.D. and Goodman. D. J., ―Probability and Stochastic Processes‖, Wiley India Pvt. Ltd.,
Bangalore, 2nd Edition, 2012.
6. M.B.K. Moorthy., ―Probability and Queueing Theory‖ Scitech Publication, India 2014.
7. T.Veerarajan., ―Probability and Queueing Theory‖ McGraw Hill Publication, India 2012

68 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 20CS4101 DESIGN AND ANALYSIS OF ALGORITHMS L T P S C
ASSESSMENT TYPE TYPE -1 3 0 0 1 3
OBJECTIVES
To introduce the basics of computational complexity analysis and various algorithm design
paradigms.

COURSE OUTCOMES
Students will be able to
1.Analyze the algorithm efficiency by means of mathematical notations
2. Design and understand different types of sorting and searching techniques
3. Analyze the different techniques in the design of graph algorithms
4. Solve problem using Greedy and iterative improvement methods
5. Derive algorithms to cope with the limitations of algorithm power.
UNIT 1 – ANALYSIS OF ALGORITHM EFFICIENCY
Notion of an Algorithm- Fundamentals of Algorithmic Problem Solving- Analysis Framework- Asymptotic
Notations and its Properties-Recurrence Equation-Solving Recurrence Equations- Mathematical Analysis
for Recursive and Non Recursive Algorithms.
Total Periods :9
UNIT 2 – BRUTE FORCE AND DIVIDE AND CONQUER
Brute Force Approach- Closest Pair and Convex Hull Problems- Exhaustive search- Divide and Conquer :
Binary search - Finding Maximum and Minimum Elements -Merge sort- Quick sort- Heap Sort .
Total Periods :9

UNIT 3 – DYNAMIC PROGRAMMING

Dynamic programming: Coin changing problem- Computing Binomial Coefficient- Warshall‘s Algorithm-
Multistage Graph-Optimal Binary Search Tree-Knapsack Problem and Memory functions.
Total Periods :9

UNIT 4 – GREEDY TECHNIQUE AND ITERATIVE IMPROVEMENT

Greedy Technique: Minimum Spanning Tree: Prim‘s Algorithm and Kruskal‘s Algorithm- Shortest Path
Algorithm: Dijkstra‘s Algorithms-0/1 Knapsack Problem- Optimal Merge pattern – Huffman Trees
Iterative Improvement: The Simplex Method- The Maximum Flow Problem- Bipartite Graphs- The Stable
Marriage Problem.
Total Periods :9
UNIT 5 – BACK TRACKING AND BRANCH & BOUND
Backtracking: n-Queen Problem- Hamiltonian Circuit Problem- Sum of Subset Problem- Branch and Bound:
Assignment Problem- Knapsack Problem- Travelling Salesman Problem- NP Complete and NP Hard
Problems.

69 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 Total Periods :9

TEXT BOOKS
1.AnanyLevitin, ―Introduction to the Design and Analysis of Algorithms‖, Pearson Education, New
Delhi, 2013.
2. Ellis Horowitz, Sartaj Sahni and SanguthevarRajasekaran, ―Fundamentals of Computer Algorithms,
Galgotia publications, New Delhi, 2013.
REFERENCE BOOKS
1.Thomas H Cormen, Charles E Leiserson, Ronald L Rivest and Clifford Stein, ―‖Introduction to
Algorithms‖, MIT Press, New Delhi,2010.
2. Donald E Knuth, ―Fundamental Algorithms ―The Art of Computer Programming‖ Vol- I‖, Narosa
Publishers, Bombay, 2002.
3. Aho A V, Hopcroft J E, and Ullman J D, ―The Design and Analysis of Computer Algorithms‖, Pearson
Education, New Delhi,2003.
4. Basu S K, ―Design Methods and Analysis of Algorithms‖, PHI Learning, New Delhi, 2010

70 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 20CS4102 COMPUTER NETWORKS L T P S C
ASSESSMENT TYPE TYPE -1 3 0 0 1 3
OBJECTIVES
To learn about computer network organization and implementation.
COURSE OUTCOMES
Students will be able to
1. Explain the components requirement of networks and link layer service.
2. Classify the Media Access Control Protocols and different Internet working.
3. Demonstrate various types of routing techniques.
4. Outline the mechanisms involved in transport layer.
5. Experiment with different application layer protocols.
UNIT 1 – INTRODUCTION AND PHYSICAL LAYER
Networks – Network Types – Protocol Layering – TCP/IP Protocol suite – OSI Model – Physical Layer:
Performance – Transmission media – Switching – Circuit-switched Networks – Packet Switching.
Total Periods :9

UNIT 2 – DATA-LINK LAYER AND MEDIA ACCESS

Introduction – Link-Layer Addressing – DLC Services – Data-Link Layer Protocols – HDLC – PPP –
Media Access Control – Wired LANs: Ethernet – Wireless LANs – Introduction – IEEE 802.11,
Bluetooth – Connecting Devices.
Total Periods :9
UNIT 3 – NETWORK LAYER
Network Layer Services – Packet switching – Performance – IPV4 Addresses – Forwarding of IP
Packets –Network Layer Protocols: IP, ICMP v4 – Unicast Routing Algorithms – Protocols –
Multicasting Basics – IPV6 Addressing – IPV6 Protocol – IPV4 Protocol.
Total Periods :9
UNIT 4 – TRANSPORT LAYER
Introduction – Transport Layer Protocols – Services – Port Numbers – User Datagram Protocol –
Transmission Control Protocol – SCTP – Flow and Error Control Techniques.
Total Periods :9

UNIT 5 – APPLICATION LAYER

WWW and HTTP – FTP – Email –Telnet –SSH – DNS – SNMP – SMTP – POP.
Total Periods :9

71 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
TEXT BOOKS
1.Behrouz A. Forouzan, ― Data communication and Networking ‖, Fifth Edition
2. Larry L. Peterson, Bruce S. Davie, ― Computer Networks: A Systems Approach ‖, Fifth Edition,
Morgan Kaufmann Publishers, 2011.
REFERENCE BOOKS
1.Nader. F. Mir, ― Computer and Communication Network ‖, Pearson Prentice Hall Publishers, 2010.
2. Ying-Dar Lin, Ren-Hung Hwang, Fred Baker, ― Computer Networks: An Open Source Approach,
McGraw Hill Publisher, 2011.
3. James F. Kurose, Keith W. Ross, ― Computer Networking, A Top-Down Approach
4. Featuring the Internet, Sixth Edition, Pearson Education, 2013.

72 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 20CS4103 SOFTWARE ENGINEERING L T P S C
ASSESSMENT TYPE TYPE -1 3 0 0 1 3
OBJECTIVES
To provide the idea of decomposing the given problem into Analysis, Design, Implementation,
Testing and Maintenance phases.

COURSE OUTCOMES
Students will be able to
1. Compare different process models.
2. Concepts of requirements engineering and Analysis Modeling.
3. Apply systematic procedure for software design and deployment.
4. Compare and contrast the various testing and maintenance.
5. Manage project schedule, estimate project cost and effort required
UNIT 1 – SOFTWARE PROCESS AND DEVELOPMENT METHODOLOGY

The Nature of Software - Software Engineering Practice - Software Myths –Sequential Model - Prototyping
Model - RAD Model - Evolutionary Software Process Models - Incremental model - Spiral model, Agile
Development – Extreme Programming(XP) – Scrum
Total Periods :9
UNIT 2 – SYSTEM ENGINEERING
Functional and non-functional requirements –Requirements Engineering: Feasibility Studies Elicitation -
Analysis and Negotiation - Validation - Management, Software Requirement Specification (SRS), Petri nets,
Data Dictionary.
ANALYSIS MODELLING: Elements of the Analysis Model, Data Modeling, Control Flow Diagram, Data
Flow Diagrams, Metrics
Total Periods :9
UNIT 3 – DESIGN CONCEPTS AND ARCHITECTURAL DESIGN
Design Process, Concepts and Models, Software Architecture: Architectural Styles - Architectural Design -
Architectural Mapping using Data Flow – User Interface Design - Structural Partitioning - Functional
Independence - Cohesion - Coupling - Software Engineering Practice - Core Principles - Coding Principles
and Concepts
Total Periods :9
UNIT 4 – SOFTWARE TESTING AND MAINTENANCE
Introduction to Testing, Test Driven Development, Coding Software Testing Fundamentals - Internal and
External Views of Testing - Testing Strategies: Unit Testing - Integration Testing –Regression Testing
Validation and System Testing, The Art of Debugging. Reengineering process model-Reverse and Forward
Engineering
Total Periods :9

73 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 UNIT 5 – SOFTWARE QUALITY ASSURANCE

Estimation Function Point and COCOMO I. and COCOMO II. Quality Concepts, Cost of Quality, Software
Quality Group (SQA),Roles and Responsibilities of SQA Group, Formal Technical Reviews, Quality
Standards.
Total Periods :9
TEXT BOOKS
1. Roger S. Pressman, ―Software Engineering – A Practitioner‗s Approach, McGraw Hill, Singapore, 2014.
2. Ian Sommerville, ―Software Engineering‖, Addison Wesley, New Delhi, 2015.
REFERENCE BOOKS
1. .Rajib Mall, ―Fundamentals of Software Engineering, Third Edition, PHI Learning Private Limited, 2009.
2.Pankaj Jalote, ―Software Engineering, A Precise Approach, Wiley India, 2010.
3. Kelkar S.A., ―Software Engineering, Prentice Hall of India Pvt Ltd, 2007.
4. Stephen R.Schach, ―Software Engineering‖, Tata McGraw-Hill Publishing Company Limited,2007.

74 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 20CS4402 OPERATING SYSTEMS L T P S C
ASSESSMENT TYPE TYPE -3 3 0 2 1 4
OBJECTIVES
To understand the services provided by an operating system.
COURSE OUTCOMES
Students will be able to
1. Identify the components of operating system and their functionalities
2. Analyze and evaluate the performance of various process management algorithms
3. Analyze and evaluate the performance of various memory management algorithms
4. Analyze and evaluate the performance of various I/O management algorithms

UNIT 1 – BASICS OF OPERATING SYSTEMS

Overview –Operating system operations and structures - System calls and System programs- Building
and Booting an Operating system. Process Management-Processes and Threads – Process scheduling
- Operations on processes - Inter process communication - IPC in Shared Systems. Scheduling criteria –
CPU Scheduling algorithms.
Total Periods :10
UNIT 2 - PROCESS COORDINATION
Concurrency and Synchronization Mechanisms- Semaphores - Classic problems of synchronization –
Deadlock characterization - Methods for handling deadlocks - Deadlock prevention - Deadlock
avoidance - Deadlock detection and Recovery.
Total Periods :10
UNIT 3 - MEMORY MANAGEMENT
Memory Management: Main memory- Contiguous memory allocation - Paging - Swapping -
Segmentation - Virtual Memory- Demand paging – Page Replacement Algorithms – Thrashing- Design
Issues – Implementation Issues.
Total Periods :10
LIST OF EXPERIMENTS

1. Linux Commands
2. Process Management using System Calls: Fork, Exit, Getpid, Exit, Wait, Close, Stat
3. Simulate the following CPU scheduling algorithms a) FIFO b) SJF c) Priority d) Round Robin
4. Implement dinning philosopher problem using semaphore
5. Simulate Bankers Algorithm for Dead Lock Avoidance and prevention
6. Simulate Paging Technique of memory management
7. Simulate all page replacement algorithms a) FIFO b) LRU c) LFU
8. Simulate the following disk scheduling algorithms a) FCFS b) SSTF c) SCAN
Total Periods: 30

75 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
TEXT BOOKS

1. Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, ―Operating System Concepts‖, 9th
Edition, John Wiley and Sons Inc., 2012.
REFERENCE BOOKS
1. Andrew S. Tanenbaum and Herbert Bos, ―Modern Operating Systems‖, Fourth Edition, Prentice Hall,
2014.
2. MukeshSinghal, NiranjanShivaratri, ―Advanced Concepts in Operating Systems – Distributed,
Database and Multiprocessor Operating Systems‖, Tata McGraw-Hill, 2001.
3. Rajib Mall, ―Real-Time Systems: Theory and Practice‖, Prentice Hall, 2006.

76 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 20CS4104 INTERNET PROGRAMMING L T P S C
ASSESSMENT TYPE TYPE -1 3 0 0 1 3
OBJECTIVES
To Design and develop interactive, client-side and server side, executable web applications.
COURSE OUTCOMES

Students will be able to

1. Construct a basic website using HTML and Cascading Style Sheets.
2. Build dynamic web page with validation using Java Script objects and by applying Different event
handling mechanisms.
3. Develop server-side Pages using Servlets and JSP with Database connection.
4. Construct simple web pages using PHP.
5. Develop applications using Node JS and Angular JS framework.

UNIT 1 - WEBSITE BASICS, HTML 5, CSS 3, WEB 2.0

Web Essentials: Clients, Servers and Communication – The Internet – Basic Internet protocols – World
wide web – HTTP Request Message – HTTP Response Message – Web Clients – Web Servers – HTML5
– Tables – Lists – Image – HTML5 control elements – Semantic elements – Drag and Drop – Audio – Video
controls - CSS3 – Inline, embedded and external style sheets – Rule cascading – Inheritance –
Backgrounds – Border Images – Colors – Shadows – Text – Transformations – Transitions – Animations
Total Periods :9
UNIT 2 - CLIENT-SIDE PROGRAMMING

Java Script: An introduction to JavaScript–JavaScript DOM Model-Date and Objects, Regular Expressions-
Exception Handling-Validation-Built-in objects-Event Handling- DHTML with JavaScript- JSON introduction
– Syntax – Function Files – Http Request – SQL. AJAX: Ajax Client Server Architecture-XML Http Request
Object-Call Back Methods.
Total Periods :9
UNIT 3 – SERVER-SIDE PROGRAMMING

Servlets: Java Servlet Architecture- Servlet Life Cycle- Form GET and POST actions- Session Handling-
Understanding Cookies- Installing and Configuring Apache Tomcat Web Server- DATABASE
CONNECTIVITY: JDBC perspectives, JDBC program example. JSP: Understanding Java Server Pages-
Creating HTML forms by embedding JSP code.
Total Periods :9
UNIT 4 – PHP

An introduction to PHP: Syntax – comments - Variables- Program control- Built-in functions- Form
Validation-Regular Expressions - File handling – Cookies –Session - Connecting to Database.
Total Periods :9

UNIT 5 – NODE.JS AND ANGULAR JS

77 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
Introduction to Node JS – Architecture – Feature of Node JS - Installation and setup - Creating web servers
with HTTP (Request & Response) – Event Handling - GET & POST. Introduction to Angular 4.0 - Needs &
Evolution – Features – Architecture overview - Components and Modules –Templates – Change Detection
– Directives – Data Binding - Event Binding - Pipes – Nested Components
Total Periods :9
TEXT BOOKS

1. Deitel and Deitel and Nieto - Internet and World Wide Web - How to Program, 5th Edition, Prentice Hall,
2011
2. KrasimirTsonev - Node.js by Example Paperback, May 2015
3. Nate Murray, Felipe Coury, Ari Lerner and Carlos Taborda - ng-book, The Complete Book on Angular 4
REFERENCE BOOKS

1. Jeffrey C and Jackson - Web Technologies A Computer Science Perspective, Pearson Education, 2011.
2. Stephen Wynkoop and John Burke QUE - Running a Perfect Website, 2nd Edition,1999.
3. David Herron - Node.js Web Development: Create real-time server-side applications with this practical,
step-by-step guide, 3rd Edition, 2016
4. AgusKurniawan - AngularJS Programming by Example, First Edition, Kindle, 2014.

78 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 NETWORKS LABORATORY L T P S C
20CS4201
ASSESSMENT TYPE TYPE -5 0 0 3 0 1.5
OBJECTIVES

To get practical knowledge of working principles of various communication protocols.

COURSE OUTCOMES
Students will be able to
1. Implement various protocols using TCP and UDP.
2. Compare the performance of different transport layer protocols.
3. Use simulation tools to analyze the performance of various network protocols.
4. Analyze various routing algorithms.
5. Implement error correction codes.

LIST OF EXPERIMENTS

1. Learn to use commands like tcp dump, netstat, ifconfig, ns lookup and traceroute. Capture ping and
traceroute DUs using a network protocol analyzer and examine.
2. Write a HTTP web client program to download a web page using TCP sockets.
3. Applications using TCP sockets like:
Echo client and echo server
Chat
File Transfer
4. Simulation of DNS using UDP sockets.
5. Write a code simulating ARP /RARP protocols.
6. Study of Network simulator (NS) and Simulation of Congestion Control Algorithms using NS.
7. Study of TCP/UDP performance using Simulation tool.
8. Simulation of Distance Vector/ Link State Routing algorithm.
9. Performance evaluation of Routing protocols using Simulation tool.
10. Simulation of error correction code (like CRC).
11. Network Analysis Tools
Total Periods :45
ADDITIONAL EXERCISES

1. Analyze various protocol performance using NS2 tools

Total Periods :3
TEXT BOOKS

1. Paul Deitel and Harvey Deitel, ―C How to Program‖, Seventh edition, Pearson Publication

79 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
REFERENCE BOOKS

1. Juneja, B. L and Anita Seth, ―Programming in C‖, CENGAGE Learning India pvt. Ltd., 2011.
2. PradipDey, ManasGhosh, ―Fundamentals of Computing and Programming in C‖, First Edition,
Oxford University Press, 2009.
3. Anita Goel and Ajay Mittal, ―Computer Fundamentals and Programming in C‖, Dorling Kindersley
(India) Pvt. Ltd., Pearson Education in South Asia, 2011.

80 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 INTERNET PROGRAMMING LABORATORY L T P S C
20CS4202
ASSESSMENT TYPE TYPE -5 0 0 3 0 1.5
OBJECTIVES

To Analyze a web page and identify its elements and attributes, Create web pages using XHTML
and Cascading Style Sheets.

COURSE OUTCOMES

Students will be able to

1. Construct Web pages using HTML and style sheets
2. Build dynamic web pages with validation using Java Script objects and by applying different event
handling mechanisms.
3. Develop dynamic web pages using server-side scripting.
4. Create Client Server applications
5. Develop dynamic web pages using Node JS, Angular JS and MongoDB
6. Use PHP programming to develop web applications.
7. Create application using Python and Django

LIST OF EXPERIMENTS

1. Create a web page with the following using HTML

a. To embed a map in a web page
b. To fix the hot spots in that map
c. Show all the related information when the hot spots are clicked.
2. Create a web page with the following.
a. Cascading style sheets.
b. Embedded style sheets.
c. Inline style sheets. Use our college information for the web pages.
3. Validate the Registration, user login, user profile and payment by credit card pages using JavaScript.
4. Write programs in Java using Servlets:
i. To invoke servlets from HTML forms
ii. Session tracking using hidden form fields and Session tracking for a hit count
5. Write programs in Java to create three-tier applications using servlets for conducting on-line examination
for displaying student mark list. Assume that student information is available in a database which has
been stored in a database server
6. Redo the previous task using JSP by converting the static web pages into dynamic web pages. Create a
database with user information and books information. The books catalogue should be dynamically
loaded from the database.
7. Write programs for Employee Details (inserting, deleting, and updating records) using Node Js and
MongoDB
8. Write programs for Ticket Reservation using Angular JS and NoSQL
9. i. Validate the form using PHP regular expression.
ii. PHP stores a form data into database.
81 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
10. Using Django, create a project for User Authentication Portal where users can sign up, log in and
modify their admin panel
Total Periods :45
ADDITIONAL EXERCISES

1. Login and Registration page for library management using JSP

2. Develop User Authentication Portal for different types user using PHP.
Total Periods :3
TEXT BOOKS

1. Deitel and Deitel and Nieto - Internet and World Wide Web - How to Program, 5th Edition, Prentice Hall,
2011.
REFERENCE BOOKS

1. .Jeffrey C and Jackson - Web Technologies A Computer Science Perspective, Pearson Education, 2011.

82 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 20GE4603 PROFESSIONAL SKILLS-III L T P S C
ASSESSMENT TYPE TYPE -1 2 0 0 0 1
OBJECTIVES

To make the learners to be proficient in LSRW skills. To acquire necessary skills in order to
comprehend lectures, discussion and writing on their own without making errors. To understand the
basic concepts of Quantitative ability & Logical reasoning. To improve thinking capability of the students
& To enhance the problem solving skills and basic mathematical skills. To enhance the employability
skills among the students to meet out the corporate expectations & To provide best possible training for
the students through continuous training module.

COURSE OUTCOMES

Students will be able to

1. Students will be able to realize the importance of English grammar, writing skills and speaking
2.They will improve their ability in Articulating, Interpretation and writing in English, both in terms of
fluency
and comprehensibility
3. Acquires Time Management for campus placements and Competitive Examinations.
4.Makes Calculations successfully, Interprets Data, Communicate Results, Evaluates an issue and solve
a
problem in real- world context
5.Comprehends quick decision making
UNIT 1
E-mail writing - Column based fillers, Percentages – Formula - Percentage difference – percentage
table- fraction to percentage, Profit & Loss – Basic definitions & important formulas.
Total Periods :6
UNIT 2
JAM - Reading comprehension(Both MNC & Competitive pattern) ,Time & Distance-Concepts &
formulas , Problems On Trains – Concepts- Tips & Tricks
Total Periods :6
UNIT 3
Critical Reasoning - Report and Proposal writing , Statements & Conclusions - Concepts- Tips & Tricks
Total Periods :6
UNIT 4
Writing practices on circulars , notices & Memo, Direction Sense Test – concepts – main & cardinal
direction.
Total Periods :6
UNIT 5
Writing practices on Agenda preparation and Minutes of meeting - Highlight incorrect words , Simple
Interest & Compound Interest – concepts & formulas
Total Periods :6

83 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
TEXT BOOKS
1. Abhjitgupta, ―Quatitative Aptitude for Competitive Examinations‖ , Tata McGraw Hills, 4th
Edition,2011./William sanborn ―Technical communication A practical approach‖ Pearson 6 th edition
2010

REFERENCE BOOKS
1. R. S. Agarwal, ―A Modern Approach to Verbal & Non-Verbal Reasoning‖ S. Chand Limited, January
2010.

84 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 SEMESTER 5
DISCRETE MATHEMATICS L T P S C
20MA5111
ASSESSMENT TYPE TYPE -1 3 1 0 0 4
OBJECTIVES

Be familiar with the most fundamental Graph Theory topics and results.
Be exposed to the techniques of proofs and analysis.
COURSE OUTCOMES

Students will be able to

1. Have knowledge of the concepts needed to test the logic of a program.
2. Have an understanding in identifying structures on many levels.
3. Be aware of a class of functions which transform a finite set into another finite set which relates to input
and output functions in computer science
4. Be aware of the counting principles.
5. Be exposed to concepts and properties of algebraic structures such as groups, rings and fields.
UNIT 1 - LOGIC AND PROOFS

Propositional logic – Propositional equivalences - Predicates and quantifiers – Nested quantifiers –

Rules of inference- Introduction to proofs– Proof methods and strategy.
Total Periods :12
UNIT 2 – COMBINATORICS

Mathematical induction – Strong induction and well ordering – The basics of counting – The pigeonhole
principle – Permutations and combinations – Recurrence relations – Solving linear recurrence relations–
Generating functions– Inclusion and exclusion principle and its applications
Total Periods :12
UNIT 3 – GRAPH

Graphs and graph models – Graph terminology and special types of graphs – Matrix representation of
graphs and graph isomorphism– Connectivity– Euler and Hamilton paths and circuits
Total Periods :12
UNIT 4 - TREES, CONNECTIVITY & PLANARITY

Trees – Properties of trees – Distance and centers in tree – Rooted and binary trees Spanning trees –
Fundamental circuits – Spanning trees in a weighted graph – cut sets – Properties of cut set – All cut sets –
Fundamental circuits and cut sets – Connectivity and separability
Total Periods :12
UNIT 5 - GRAPH ALGORITHMS

Network flows – Prim‘s Minimum Spanning Tree- Applications of Minimum Spanning Tree- Prim‘s MST for
Adjacency List Representation- Kruskal‘s Minimum Spanning Tree Algorithm- Dijkstra‘s shortest path

85 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
algorithm-Bellman–Ford Algorithm
Total Periods :12
TEXT BOOKS

1. Rosen, K.H., "Discrete Mathematics and its Applications", 7th Edition, Tata McGraw
Hill Pub. Co. Ltd., New Delhi, Special Indian Edition, 2011
2. Tremblay, J.P. and Manohar.R, " Discrete Mathematical Structures with Applications to Computer
Science", Tata McGraw Hill Pub. Co. Ltd, New Delhi, 30th Reprint, 2011
REFERENCE BOOKS

1. Grimaldi, R.P. "Discrete and Combinatorial Mathematics: An Applied Introduction", 4th Edition,Pearson
EducationAsia,Delhi,2007.
2. Lipschutz, S. and Mark Lipson., "Discrete Mathematics", Schaum‘s Outlines, Tata McGraw Hill Pub. Co.
Ltd., New Delhi, 3rd Edition, 2010.
3. Koshy, T. "Discrete Mathematics with Applications", Elsevier Publications, 2006.

86 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 THEORY OF COMPUTATION L T P S C
20CS5101
ASSESSMENT TYPE TYPE -1 3 0 0 1 3
OBJECTIVES

To understand the relation between these formal languages, grammars, and machines.

COURSE OUTCOMES

Students will be able to

1. Explain proofing techniques and construct finite automata
2. Generate finite automata for regular expression using its properties
3. Apply context-free grammar and languages
4. Construct Pushdown Automata and Turing machine
5. Analyze the undecidability of languages.
UNIT 1 - FINITE AUTOMATA

Introduction to formal proof - Additional forms of proof - Inductive proofs - Finite Automata (FA)
Deterministic Finite Automata (DFA) - Non-deterministic Finite Automata (NFA) - Finite Automata with
Epsilon transitions-Equivalence of NFA and DFA-Equivalence of NFAs with and without Epsilon
Total Periods :9
UNIT 2 - REGULAR EXPRESSIONS AND LANGUAGES

Regular Expression - FA and Regular Expressions - Arden's theorem - Applications of Regular

Expression - Algebraic Laws for Regular Expression - Proving languages not to be regular - Closure
properties of regular languages.
Total Periods 9:
UNIT 3 – CONTEXT-FREE GRAMMAR AND LANGUAGES

Grammar Introduction- Types of Grammar - Context-Free Grammar (CFG) - Parse Trees - Applications
of Context-Free Grammar -Ambiguity in grammars and languages - Normal forms for CFG –CNF-GNF-
Pumping Lemma for CFL - Closure Properties of CFL.
Total Periods :9
UNIT 4 - PUSHDOWN AUTOMATA AND TURING MACHINES

Definition of the Pushdown automata - Languages of a Pushdown Automata - Equivalence of Pushdown

automata and CFG. Turing Machines (TM)- Problems about Turing machine -Programming Techniques
for TM –Chomskian hierarchy of languages
Total Periods :9
UNIT 5 – UNDECIDABILITY

A language that is not Recursively Enumerable (RE) - An Undecidable problem that is RE - Undecidable
problems about Turing Machine - Post's Correspondence Problem - Rice Theorem-P and NP problems
Total Periods :9

87 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
TEXT BOOKS

1. J.E.Hopcroft, R.Motwani and J.D Ullman, ―Introduction to Automata Theory, Languages and
Computations‖, Pearson Education, Third Edition, 2011.
REFERENCE BOOKS

1. Mishra K L P and Chandrasekaran N, ―Theory of Computer Science-Automata, Languages and

Computation‖, Prentice Hall of India, Third Edition, 2007.
2.Harry R. Lewis and Christos H. Papadimitriou, ―Elements of the theory of Computation‖, Prentice-Hall
of
India Pvt. Ltd, Second Edition, 2009.
3.J. Martin, ―Introduction to Languages and the Theory of Computation‖, Tata Mc Graw Hill, New Delhi,
Third Edition, 2007.
4.MichealSipser, ―Introduction to the Theory and Computation‖, Cengage Learning India, 2012.

88 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 20CS5102 ARTIFICIAL INTELLIGENCE L T P S C
ASSESSMENT TYPE TYPE -1 3 0 0 1 3
OBJECTIVES
To acquire knowledge on intelligent systems and agents.
COURSE OUTCOMES

Students will be able to

1. Use appropriate search algorithms for any AI problem
2. Represent a problem using first order and predicate logic
3. Provide the apt agent strategy to solve a given problem
4. Design software agents to solve a problem
5. Design applications for NLP that use Artificial Intelligence.
UNIT 1 – INTRODUCTION
Introduction–Definition - Future of Artificial Intelligence – Characteristics of Intelligent Agents– Typical
Intelligent Agents – Problem Solving Approach to Typical AI problems
Total Periods :9
UNIT 2 - PROBLEM SOLVING METHODS
Problem solving Methods - Search Strategies- Uninformed - Informed - Heuristics - Local Search
Algorithms and Optimization Problems - - Constraint Satisfaction Problems – Constraint Propagation -
Backtracking Search - Game Playing – Optimal Decisions in Games – Pruning
Total Periods :9
UNIT 3 - KNOWLEDGE REPRESENTATION
First Order Predicate Logic – Forward Chaining-Backward Chaining – Resolution – Knowledge
Representation –Fuzzy reasoning -Dempster Shafer Theory
Total Periods :9
UNIT 4 – PLANNING AND MACHINE LEARNING
Basic Plan Generation systems-Strips-K Strips- Advanced plan generation system- Learning – Machine
Learning and Adaptive Learning.
Total Periods :9
UNIT 5 – APPLICATIONS

AI applications – Language Models – Information Retrieval- Information Extraction – Natural Language

Processing - Machine Translation – Speech Recognition – Robot – Hardware – Perception – Planning –
Moving
Total Periods :9
TEXT BOOKS

1. S. Russell and P. Norvig, "Artificial Intelligence: A Modern Approach‖, Prentice Hall, Third Edition,
2009.
2. I. Bratko, ―‖Prolog: Programming for Artificial Intelligence‖, Fourth edition, Addison-Wesley
Educational
Publishers Inc., 2011
REFERENCE BOOKS

89 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
1.M. Tim Jones, ―Artificial Intelligence: A Systems Approach(Computer Science), Jones and Bartlett
Publishers, Inc.; First Edition, 2008
2. Nils J. Nilsson, ―The Quest for Artificial Intelligence‖, Cambridge University Press, 2009.
3.William F. Clocksin and Christopher S. Mellish,Programming in Prolog: Using the ISO Standard, Fifth
Edition, Springer, 2003.
4. Gerhard Weiss, ―Multi Agent Systems, Second Edition, MIT Press, 2013.
5.David L. Poole and Alan K. Mackworth, ―Artificial Intelligence: Foundations of Computational Agents,
Cambridge University Press, 2010.

90 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 20CS5103 OBJECT ORIENTED ANALYSIS AND DESIGN L T P S C
ASSESSMENT TYPE TYPE -1 3 0 0 1 3
OBJECTIVES
To understand the Object-based view of Systems and develop robust object-based models for
Systems

COURSE OUTCOMES
Students will be able to
1. Create use case documents that capture requirements for a software system.
2. Create class diagrams that model both the domain model and design model of a software system.
3. Create interaction diagrams that model the dynamic aspects of a software system.
4. Address the real-world problems by modeling software solutions using UML tools.
5. Apply design patterns that facilitate the development and evolution of new models.
UNIT 1 – OOAD BASICS
Introduction - Overview of Object-Oriented system development - Object Basics – OO Themes – Evidence
for the usefulness of OO Development – OO Modeling – Unified Process -Inception – Use case Modeling -
Relating Use cases – include, extend and generalization. Case Study: The NextGen POS system, The
Monopoly Game system
Total Periods :9
UNIT 2 – STATIC MODELING

Elaboration - Domain models - Finding conceptual classes and description classes – Associations –
Attributes – Domain model refinement – Finding conceptual class hierarchies- Aggregation and
composition- UML class diagrams – Relationship – Inheritance – Abstract classes – Polymorphism -
Operation contracts
Total Periods :9
UNIT 3 – DYNAMIC MODELING

System sequence diagrams – Communication diagrams - Relationship between sequence diagrams and
use cases - Logical architecture and UML package diagram – Logical architecture refinement - UML activity
diagrams and modeling-State Chart diagram- Component and Deployment diagram.
Total Periods :9
UNIT 4 – DESIGN PATTERNS

Object-oriented design methodology – Common base class - GRASP: Designing objects with
responsibilities – Patterns– Creator – Information expert – Low coupling –Controller – High cohesion –
Designing for visibility - Applying GoF design patterns – Adapter – Singleton – Factory – Strategy –
Composite - Facade and observer patterns
Total Periods :9
UNIT 5 - IMPLEMENTATION AND TESTING

91 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
Mapping design to code – Forward Engineering – Reverse Engineering –Object-Oriented Methodologies-
Test driven development – Refactoring-Develop Test Cases and Test Plans
Total Periods :9

TEXT BOOKS

1. Craig Larman, "Applying UML and Patterns: An Introduction to Object-Oriented Analysis and Design and
iterative development‖, Third Edition, Pearson Education, 2015.
2.MichealBlaha, James Rambaugh, ―Object-Oriented Modeling and Design with UML‖, Second Edition,
Prentice Hall of India Private Limited, 2007.
REFERENCE BOOKS

1. Mike O‘Docherty, ―Object-Oriented Analysis & Design: Understanding System Development with UML
2.0‖, John Wiley & Sons, 2005
2.James W- Cooper, Addison-Wesley, ―Java Design Patterns – A Tutorial‖, 2000.
3.Erich Gamma, Richard Helm, Ralph Johnson, John Vlissides, ―Design patterns: Elements of Reusable
object-oriented software‖, Addison-Wesley, 1995.

92 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 MOBILE COMPUTING AND APPLICATION L T P S C
20CS5104
DEVELOPMENT
ASSESSMENT TYPE TYPE -1 3 0 0 1 3
OBJECTIVES

To understand the basic concepts of mobile computing, mobile telecommunication system and
gain knowledge about different mobile platforms and application development
COURSE OUTCOMES

Students will be able to

1. Explain the basics of mobile telecommunication systems
2. Illustrate the generations of telecommunication systems in wireless networks
3. Determine the functionality of MAC, network layer and Identify a routing protocol for a given Ad hoc
Network
4. Explain the functionality of Transport and Application layers
5. Develop a mobile application using android/blackberry/ios/Windows SDK.

UNIT 1 – INTRODUCTION

Introduction to Mobile Computing – Applications of Mobile Computing- Generations of Mobile

Communication Technologies- Multiplexing – Spread spectrum -MAC Protocols – SDMA- TDMA- FDMA-
CDMA
Total Periods :9
UNIT 2 – MOBILE TELECOMMUNICATION SYSTEM

Introduction to Cellular Systems - GSM – Services & Architecture – Protocols – Connection

Establishment – Frequency Allocation – Routing – Mobility Management – Security – GPRSUMTS –
Architecture – Handover – Security
Total Periods :9
UNIT 3 - MOBILE NETWORK LAYER

Mobile IP – DHCP – AdHoc– Proactive protocol-DSDV, Reactive Routing Protocols – DSR, AODV ,
Hybrid routing –ZRP, Multicast Routing- ODMRP, Vehicular Ad Hoc networks( VANET) –MANET Vs
VANET – Security.
Total Periods :9
UNIT 4 - MOBILE TRANSPORT AND APPLICATION LAYER

Mobile TCP– WAP – Architecture – WDP – WTLS – WTP –WSP – WAE – WTA Architecture – WML
Total Periods :9
UNIT 5 - MOBILE PLATFORMS AND APPLICATIONS
Mobile Device Operating Systems – Special Constraints & Requirements – Commercial Mobile
Operating Systems – Software Development Kit: iOS, Android, BlackBerry, Windows Phone –
MCommerce – Structure – Pros & Cons – Mobile Payment System – Security Issues
Total Periods :9

93 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
TEXT BOOKS

1. .Prasant Kumar Pattnaik, Rajib Mall, ―‖Fundamentals of Mobile Computing”, PHI Learning -2012
2. Jochen Schiller, ―Mobile Communication‖ PHI, Second Edition, 2003.
REFERENCE BOOKS

1. UweHansmann, LotharMerk, Martin S. Nicklons and Thomas Stober, ―‖Principles of Mobile

Computing‖, Springer, 2003.
2.William.C.Y.Lee,―‖Mobile Cellular Telecommunications-Analog and Digital Systems“, Second
Edition,Tata McGraw Hill Edition ,2006.
3.Dharma Prakash Agrawal Qing and An Zeng, "Introduction to Wireless and Mobile systems",Thomson
Asia Pvt Ltd, 2005.

94 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 OBJECT ORIENTED ANALYSIS AND DESIGN L T P S C
20CS5202
LABORATORY
ASSESSMENT TYPE TYPE -5 0 0 3 0 2
OBJECTIVES

To capture the requirements specification for an intended software system, draw UML diagrams ,
map design to code and also test using various testing strategies.

COURSE OUTCOMES

Students will be able to

1. Perform OO analysis and design for a given problem specification
2. Identify and map basic software requirements in UML mapping
3. Improve the software quality using design patterns and to explain the rationale behind applying specific
design patterns
4. Test the compliance of the software with the SRS.
5. Improve the reusability and maintainability of the software system by applying appropriate
design patterns.
LIST OF EXPERIMENTS

1. To develop a problem statement and Statement of Work.

2. Develop an IEEE standard SRS document. Also develop risk management and project plan (Gantt
chart).
3. Identify Use Cases and develop the Use Case model.
4. Identify the business activities and develop an UML Activity diagram.
5. Identity the conceptual classes and develop a domain model with UML Class diagram
6. Using the identified scenarios find the interaction between objects and represent them using UML
Interaction diagrams.
7. Draw the State Chart diagram.
8. Identify the User Interface, Domain objects, and Technical services. Draw the partial layered, logical
architecture diagram with UML package diagram notation and patterns
9. Draw Component and Deployment diagrams.
10. Practice forward engineering and reverse engineering
SUGGESTED DOMAINS FOR MINI-PROJECT
1. Passport automation system.
2. Book bank
3. Exam registration
4. Stock maintenance system.
5. Online course reservation system
6. Airline/Railway reservation system
7. Software personnel management system
8. Credit card processing
9. e-book management system
10. Recruitment system

95 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 Total Periods :45

ADDITIONAL EXERCISES
1.Online Shopping
2. Online Movie Ticket Reservation
Total Periods :3

TEXT BOOKS

1. Craig Larman, "Applying UML and Patterns: An Introduction to object- oriented Analysis and Design and
iterative development‖, Third Edition, Pearson Education, 2015.
REFERENCE BOOKS

1. MichealBlaha, James Rambaugh, ―Object-Oriented Modeling and Design with UML‖, Second Edition,
Prentice Hall of India Private Limited, 2007
2.Mike O‘Docherty, ―Object-Oriented Analysis & Design: Understanding System Development with UML
2.0‖, John Wiley & Sons, 2005
3.James W- Cooper, Addison-Wesley, ―Java Design Patterns – A Tutorial‖, 2000.

96 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 MOBILE APPLICATION DEVELOPMENT L T P S C
20CS5201
LABORATORY
ASSESSMENT TYPE TYPE -5 0 0 3 0 2
OBJECTIVES

To understand components and structure of mobile application development frameworks for Android
and windows OS based mobiles.
COURSE OUTCOMES

Students will be able to

1. Develop mobile applications using GUI and Layouts
2. Develop mobile applications using Event Listener.
3. Develop mobile applications using Databases
4. Develop mobile applications using RSS Feed, Internal/External Storage, SMS, Multithreading, and GPS.
5. Analyze and discover own mobile app for simple needs.
LIST OF EXPERIMENTS

1. Develop an application that uses GUI components, Font, and Colours

2. Develop an application that uses Layout Managers and event listeners.
3. Write an application that draws basic graphical primitives on the screen.
4. Develop an application that makes use of databases
5. Develop an application that makes use of Notification Manager
6. Implement an application that uses Multi-threading
7. Develop a native application that uses GPS location information
8. Implement an application that writes data to the SD card.
9. Implement an application that creates an alert upon receiving a message
10. Write a mobile application that makes use of RSS feed
11. Develop a mobile application to send an email
12. Develop a Mobile application for simple needs (Mini Project)
Total Periods :45
ADDITIONAL EXERCISES

1. Develop a Mobile application using web view

Total Periods :3

TEXT BOOKS
1. Learning Mobile App Development: A Hands-on Guide to Building Apps with iOS and Android Paperback
– 19 December 2013.

REFERENCE BOOKS
1. Build Your Own Security Lab, Michael Gregg, Wiley India

97 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 20GE5604 PROFESSIONAL SKILLS-IV L T P S C
ASSESSMENT TYPE TYPE -1 2 0 0 0 1
OBJECTIVES
To recognize common interview pitfalls and to understand how to prepare for pre-interviews .To
discover the importance of follow-up and to become aware of Interview preparation resources. To
understand the basic concepts of Quantitative ability & Logical reasoning. To improve thinking capability of
the students & To enhance the problem solving skills and basic mathematical skills. To enhance the
employability skills among the students to meet out the corporate expectations & To provide best possible
training for the students through continuous training module.
COURSE OUTCOMES
Students will be able to
1. Students will be able to participate confidently in Group discussion and in Pre interview sessions
2.They can face job interview in an optimistic approach and be successful in it
3.Acquires Time Management for campus placements and Competitive Examinations.
4.Makes Calculations successfully, Interprets Data, Communicate Results, Evaluates an issue and solve a
problem in real- world context
5.Comprehends quick decision making.
UNIT 1
Group discussion – Describe the picture, Probability – Basic definitions , important facts & formulae.
Total Periods :6

UNIT 2
Essay writing - Repeat the sentence - Write from dictation , Permutations & Combination - important facts &
formulae.
Total Periods :6
UNIT 3
Job application : Cover letter, Resume, CV, Alligation & Mixtures – basic definition- alligation rule &
formulae.
Total Periods :6
UNIT 4
Extempore - Add it up (listening) / MCQ - Summarize written text, Syllogisms – definitions – concepts –
Basics of syllogistic reasoning.
Total Periods :6
UNIT 5
Interview skills : General instructions, Review of interview questions – Mock Interview(Both virtual and
offline – Role play) ,Seating Arrangements - types of seating arrangements & its concepts ,Data
Sufficiency – Concepts – examples & practice questions
Total Periods :6
TEXT BOOKS
1. Abhjitgupta, ―Quatitative Aptitude for Competitive Examinations‖ , Tata McGraw Hills, 4th
Edition,2011./William sanborn ―Technical communication A practical approach‖ Pearson 6th edition 2010.

98 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
REFERENCE BOOKS
1. R. S. Agarwal, ―A Modern Approach to Verbal & Non-Verbal Reasoning‖ S. Chand Limited, January
2010.

99 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 SEMESTER 6

COMPILER DESIGN L T P S C
20CS6403
ASSESSMENT TYPE TYPE -1 3 1 0 1 4
OBJECTIVES

To explore the principles, algorithms, and data structures involved in the design and construction of
compilers
COURSE OUTCOMES

Students will be able to

1. Understand the different phases of a compiler
2. Design a lexical analyzer for a sample language, Design and implement a scanner and a parser using
LEX and YACC tools.
3. Apply different parsing algorithms to develop the parsers for a given grammar.
4. Understand code optimization techniques and run-time environment.
5. Learn to implement code optimization techniques and a simple code generator.

UNIT 1 - INTRODUCTION TO COMPILING

Compilers – Analysis of the source program – Phases of a compiler – Cousins of the Compiler – Grouping
of Phases – Compiler construction tools – Lexical Analysis – Role of Lexical Analyzer – LEX-Input Buffering
– Specification of Tokens.
Total Periods :9
UNIT 2 - SYNTAX ANALYSIS

Role of the parser –Writing Grammars –Context-Free Grammars – Top Down parsing – Recursive Descent
Parsing – Predictive Parsing – Bottom-up parsing – Shift Reduce Parsing – Operator Precedent Parsing –
LR Parsers – SLR Parser – Canonical LR Parser – LALR Parser-YACC
Total Periods :9
UNIT 3 – INTERMEDIATE CODE GENERATION

Intermediate languages – Declarations – Assignment Statements – Boolean Expressions – Case

Statements – Back patching – Procedure calls
Total Periods :9

UNIT 4 - CODE OPTIMIZATION AND RUN TIME ENVIRONMENTS

Introduction– Principal Sources of Optimization – Optimization of basic Blocks – DAG representation of

Basic Blocks - Introduction to Global Data Flow Analysis – Runtime Environments – Source Language
issues – Storage Organization – Storage Allocation strategies – Access to non-local names – Parameter
Passing, Error detection and recovery.

100 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 Total Periods :9

UNIT 5 - CODE GENERATION

Issues in the design of code generator – The target machine – Runtime Storage management – Basic
Blocks and Flow Graphs – Next-use Information – A simple Code generator – Peephole Optimization.
Total Periods :9

TEXT BOOKS

1. Alfred V. Aho, Jeffrey D Ullman, ―Compilers: Principles, Techniques and Tools‖, Pearson Education Asia,
2008.
REFERENCE BOOKS

1. Allen I. Holub, ―Compiler Design in C‖, Prentice Hall of India, 2003

2.C. N. Fischer and R. J. LeBlanc, ―Crafting a compiler with C‖, Benjamin Cummings, 2003
3.Henk Alblas and Albert Nymeyer, ―Practice and Principles of Compiler Building with C‖, PHI, 2001 .

101 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 MACHINE LEARNING L T P S C
20CS6101
ASSESSMENT TYPE TYPE -1 3 0 0 1 3
OBJECTIVES

To be able to formulate machine learning problems corresponding to different applications

COURSE OUTCOMES

Students will be able to

1. Distinguish between, supervised, unsupervised and semi-supervised learning
2. Apply the appropriate machine learning strategy for any given problem
3. Suggest supervised, unsupervised or semi-supervised learning algorithms for any given problem
4. Design systems that uses the appropriate graph models of machine learning
5. Modify existing machine learning algorithms to improve classification efficiency.

UNIT 1 - INTRODUCTION TO MACHINE LEARNING

Introduction to Machine Learning-Types of Machine Learning Techniques- Supervised and Unsupervised

Learning- The Brain and the Neuron – Design a Learning System – Perspectives and Issues in Machine
Learning – Concept Learning Task – Concept Learning as Search – Finding a Maximally Specific
Hypothesis – Version Spaces and the Candidate Elimination Algorithm – Linear Discriminates– Linear
Separability – Linear Regression.
Total Periods :9
UNIT 2 - LINEAR MODELS

Multi-layer Perceptron – Going Forwards – Going Backwards: Back Propagation Error – Multi-layer
Perceptron in Practice – Examples of using the MLP – Radial Basis Functions and Splines – Concepts –
RBF Network – Support Vector Machines.
Total Periods :9
UNIT 3 – TREE AND PROBABILISTIC MODELS

Learning with Trees – Decision Trees – Constructing Decision Trees – Classification and Regression Trees
– Ensemble Learning – Probability and Learning – Data into Probabilities – Basic Statistics – Nearest
Neighbor Methods – Unsupervised Learning – K means Algorithms – Vector Quantization – Self Organizing
Feature Map.
Total Periods :9
UNIT 4 – DIMENSIONALITY REDUCTION AND EVOLUTIONARY MODELS

Dimensionality Reduction – Linear Discriminate Analysis– Factor Analysis –Evolutionary Learning –

Genetic algorithms – Genetic Offspring: - Genetic Operators – Using Genetic Algorithms – Reinforcement
Learning – Overview – Getting Lost Example – Markov Decision Process
Total Periods 9:
UNIT 5 - GRAPHICAL MODELS

102 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
Markov Chain Monte Carlo Methods – Sampling – Proposal Distribution – Markov Chain Monte Carlo –
Graphical Models – Bayesian Networks – Markov Random Fields – Hidden Markov Models – Tracking
Methods.
Total Periods :9
TEXT BOOKS

1. Christopher M. Bishop, ―Pattern Recognition and Machine Learning‖, Springer, 2013.

2.Tom Mitchell, ―Machine Learning‖, McGraw Hill, 2013.
REFERENCE BOOKS

1. EthemAlpaydin, ―Introduction to Machine Learning 3e (Adaptive Computation and Machine Learning

Series), Third Edition, MIT Press, 2014
2.Jason Bell, ―Machine learning – Hands on for Developers and Technical Professionals‖, First Edition,
Wiley, 2014
3.Peter Flach, ―Machine Learning: The Art and Science of Algorithms that Make Sense of Data‖, First
Edition, Cambridge University Press, 2012.
4.Stephen Marsland, ―Machine Learning – An Algorithmic Perspective‖, Second Edition, Chapman and
Hall/CRC Machine Learning and Pattern Recognition Series, 2014.

103 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 CRYPTOGRAPHY AND NETWORK SECURITY L T P S C
20CS6102
ASSESSMENT TYPE TYPE -1 3 0 0 1 3
OBJECTIVES

To focus towards the introduction of network security using various cryptographic algorithms.
COURSE OUTCOMES

Students will be able to

1. Understand the fundamentals of networks security, security architecture, threats and vulnerabilities.
2. Apply the different cryptographic operations of symmetric cryptographic algorithms.
3. Analyze the different cryptographic operations of public key cryptography.
4. Solve the various Authentication schemes to simulate different applications.
5. Understand various Security practices and System security standards.

UNIT 1 – INTRODUCTION

Computer Security Concepts - OSI Security Architecture - Security Attacks Services Mechanisms - Model
for Network Security - Classical Encryption Techniques - Symmetric Cipher Model - Substitution -
Transposition Techniques - Basic Concepts in Number Theory and Finite Fields - Prime numbers-Fermat‘s
and Euler‘s theorem-Testing for primality -The Chinese remainder theorem- Discrete logarithms.
Total Periods :9
UNIT 2 – SYMMETRIC CIPHERS

Data Encryption Standard-Block cipher principles-block cipher modes of operation-Advanced Encryption

Standard (AES)-Triple DES. Public key cryptography: Principles of public key cryptosystems-The RSA
algorithm-Key management – Diffie Hellman Key exchange-Elliptic curve arithmetic-Elliptic curve
cryptography.
Total Periods :9
UNIT 3 – HASH FUNCTIONS AND DIGITAL SIGNATURES

Authentication requirement – Authentication function – MAC – Hash function – Security of hash function
and MAC –MD5 - SHA - HMAC – CMAC - Digital signature and authentication protocols – DSS..
Total Periods :9

UNIT 4 – SECURITY PRACTICE & SYSTEM SECURITY

Authentication applications – Kerberos – X.509 Authentication services – Firewall and its types – Firewalls
design principles –Intruders and Intrusion detection system – Virus and related threats – Countermeasures.
Total Periods :9

UNIT 5 - E-MAIL, IP & WEB SECURITY

104 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
E-mail Security - Security Services for E-mail-Pretty Good Privacy-S/MIME. IPSecurity: Overview of IPSec -
IP and IPv6-Authentication Header-Encapsulation Security Payload (ESP). Web Security: Secure Socket
Layer and Transport Socket Layer.
Total Periods :9
TEXT BOOKS

1. William Stallings, Cryptography and Network Security: Principles and Practice, PHI 5th Edition, 2010.

REFERENCE BOOKS

1. C K Shyamala, N Harini and Dr. T R Padmanabhan: ―Cryptography and Network Security‖, Wiley India
Pvt.Ltd
2. BehrouzA.Foruzan, ―Cryptography and Network Security‖, Tata McGraw Hill 2007.
3.Charlie Kaufman, Radia Perlman, and Mike Speciner, ―Network Security: PRIVATE Communication in a
PUBLIC World‖, Prentice Hall, ISBN 0-13-046019-2.

105 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 SECURITY LABORATORY L T P S C
20CS6201
ASSESSMENT TYPE TYPE -5 3 0 0 1 3
OBJECTIVES

To understand the principles of security and guarantee a secure network by monitoring and
analyzing the nature of attacks and to exhibit knowledge to secure corrupted systems.

COURSE OUTCOMES

Students will be able to

1. Develop code for classical Encryption Techniques to solve the problems.
2. Build cryptosystems by applying symmetric and public key encryption algorithms.
3. Construct code for authentication algorithms
4. Develop a signature scheme using Digital signature standard.
5. Demonstrate the network security system using open source tools.

LIST OF EXPERIMENTS

1. Perform encryption, decryption using the following substitution techniques

(i) Ceaser cipher
(ii) playfair cipher
(iii) Hill Cipher
(iv) Vigenere cipher
2. Perform encryption and decryption using following transposition techniques
i) Rail fence ii) row & Column Transformation
3. Apply DES algorithm for practical applications
4. Apply AES algorithm for practical applications.
5. Implement RSA Algorithm using HTML and JavaScript
6. Implement the Diffie-Hellman Key Exchange algorithm for a given problem.
7. Calculate the message digest of a text using the SHA-1 algorithm.
8. Implement the SIGNATURE SCHEME - Digital Signature Standard.
9. Demonstrate intrusion detection system (ids) using any tool eg. Snort or any other s/w
10. Automated Attack and Penetration Tools Exploring N-Stalker, a Vulnerability Assessment Tool
11. Defeating Malware
i) Building Trojans
ii) Rootkit Hunter
Total Periods :45
ADDITIONAL EXERCISES

1. Case study of Kali Linux.

Total Periods :3

106 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
TEXT BOOKS

1. William Stallings, ―Cryptography and Network Security: Principles and Practice‖, PHI 5th Edition,
2010.
REFERENCE BOOKS

1. C K Shyamala, N Harini and Dr. T R Padmanabhan: ―Cryptography and Network Security‖, Wiley India
Pvt.Ltd
2. BehrouzA.Foruzan, ―Cryptography and Network Security‖, Tata McGraw Hill 2007.
3.Charlie Kaufman, Radia Perlman, and Mike Speciner, ―Network Security: PRIVATE Communication in
a PUBLIC World‖, Prentice Hall, ISBN 0-13-046019-2

107 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 20HS5201 PROFESSIONAL COMMUNICATION L T P S C
ASSESSMENT TYPE TYPE 4 0 0 2 0 1
OBJECTIVES

To Enhance the Employability and Career Skills of students, to orient the students towards
grooming as a professional, to make them Employable Graduates and to develop their confidence and
help them attend interviews successfully.
COURSE OUTCOMES
Students will be able to
1. Make effective presentations
2.Participate confidently in Group Discussions.
3.Attend job interviews and be successful in them.
4.Develop adequate Soft Skills required for the workplace.
UNIT 1
Introduction to Soft Skills– Hard skills & soft skills – employability and career Skills—Grooming as a
professional with values—Time Management—General awareness of Current Affairs.
Total Periods :6

UNIT 2
Self-Introduction-organizing the material – Introducing oneself to the audience – introducing the topic –
answering questions – individual presentation practice–– presenting the visuals effectively – 5 minute
presentations
Total Periods :6
UNIT 3
Self-Introduction-organizing the material – Introducing oneself to the audience – introducing the topic –
answering questions – individual presentation practice–– presenting the visuals effectively – 5 minute
presentations
Total Periods :6
UNIT 4
Introduction to Group Discussion— Participating in group discussions – understanding group dynamics –
brainstorming the topic -– questioning and clarifying –GD strategies- activities to improve GD skills
Total Periods :6
UNIT 5
Recognizing differences between groups and teams- managing time-managing stress- networking
professionally- respecting social protocols-understanding career management-developing a long-term
career plan-making career changes.
Total Periods :6
REFERENCE BOOKS
1. Butterfield, Jeff Soft Skills for Everyone. Cengage Learning: New Delhi, 2015
2. E. Suresh Kumar et al. Communication for Professional Success. Orient Blackswan: Hyderabad, 2015
3. Interact English Lab Manual for Undergraduate Students,.OrientBalckSwan: Hyderabad, 2016.
4. Raman, Meenakshi and Sangeeta Sharma. Professional Communication. Oxford University Press:
Oxford, 2014
5. S. Hariharanetal. Soft Skills. MJP Publishers: Chennai, 2010.
108 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 20CS6103 COMPREHENSION L T P S C
ASSESSMENT TYPE TYPE 4 0 0 2 0 2
OBJECTIVE
To Enhance the Employability and Career Skills of students.

UNIT 1
Aptitude - Mixture & Allegation - Profit & Loss - Simple Interest -Coding & Decoding - Average -
Percentage - Arithmetic Aptitude - Ratio & Proportion - Calendar - Time & Work - Problems on Ages -
Data Interpretation - Stream Boat Problems - Heights & Distances - Image Analysis
Total Periods :6
UNIT 2
Programming Languages
Java - Java Fundamentals - Data Structures - Object Oriented Concepts - String - Array - JDBC - Basic
Programming Questions - Exception Handling. Python - Python Fundamentals - Data Types - Program
Control Flow - Functions - Modules & Packages - Basic Programming Questions. C - C Fundamentals -
Operators & Expressions - Functions - Structure – File Handling. C++ - C++ Fundamentals - Operator
Overloading - Function Overloading – Constructor & Destructor
Total Periods :6
UNIT 3
SQL- Database (Create, Drop, Rename, Select) – Table Creation (Create, Drop, Delete, Rename,
Truncate, Copy, Temp and Alter) – Clause – Types of Joins – SQL Keys – Building blocks of HTML –
HTML Tags and attributes – Inline, Internal and External CSS
Total Periods :6
UNIT 4
Recursion functions - List and its types - Stack and Queue - OOPS Concept - Threading and Multi
Threading - Hashing functions – Java Collections – Stages in Software Life Cycle – OSI model –
Services of Cloud – Java Object Class (Object, Class, Method, Constructor, Static) – Java
Polymorphism (Method overloading & overriding) – Abstract and Interface- Java Exception Handling
Total Periods :6
UNIT 5
Emerging Areas - Artificial Intelligence - Machine Learning - Deep Learning - Salesforce - Cloud
Computing - Blockchain - Data Science - UI/UX – IoT (Internet of Things) - Software Development - AR
(Augmented Reality) & VR (Virtual Reality)
Total Periods :6

109 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 SEMESTER 7

CLOUD COMPUTING L T P S C
20CS7101
ASSESSMENT TYPE TYPE -1 3 0 0 1 3
OBJECTIVES
To understand the basics of cloud computing along with virtualization.
COURSE OUTCOMES
Students will be able to
1. Articulate the main concepts, key technologies, strengths and limitations of cloud computing
2. Learn the key and enabling technologies that help in the development of cloud.
3. Identify the architecture, infrastructure and delivery models of cloud computing
4. Develop services using Cloud computing
5. Apply the security models in the cloud environment.
UNIT 1 – INTRODUCTION
Introduction to Cloud Computing – Definition of Cloud – Evolution of Cloud Computing – Underlying
Principles of Parallel and Distributed Computing – Cloud Characteristics – Elasticity in Cloud – On-demand
Provisioning
Total Periods :9
UNIT 2 – VIRTUALIZATION & VIRTUALIZATION INFRASTRUCTURE

Virtualization –Management Virtualization-Desktop Virtualization – Application Virtualization -Storage

Virtualization – Network Virtualization Types of Virtualization – Implementation Levels of Virtualization –
Virtualization Structures – Tools and Mechanisms – Virtualization of CPU – Memory – I/O Devices -
Virtualization for data center automation.
Total Periods :9
UNIT 3 – CLOUD PLATFORM ARCHITECTURE

Cloud deployment models: public, private, hybrid, community – Categories of cloud computing: Everything
as a service: Infrastructure, platform, software- A Generic Cloud Architecture Design –Layered cloud
Architectural Development – Virtualization Support and Disaster Recovery –Architectural Design
Challenges .
Total Periods :9
UNIT 4 – PROGRAMMING MODEL

Introduction to Hadoop Framework - MapReduce, Input splitting, map and reduce functions, specifying
input and output parameters, configuring and running a job –Developing Map Reduce Applications - Design
of Hadoop file system –Setting up Hadoop Cluster - Cloud Software Environments -Eucalyptus, Open
Nebula, Open Stack, Nimbus.

110 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 Total Periods :9

UNIT 5 – CLOUD SECURITY

Cloud Infrastructure security: network, host and application level – aspects of data security, provider data
and its security, Identity and access management architecture, IAM practices in the cloud, SaaS, PaaS,
IaaS availability in the cloud - Key privacy issues in the cloud.
Total Periods :9
TEXT BOOKS

1. Kai Hwang, Geoffrey C Fox, Jack G Dongarra – ―Distributed and Cloud Computing‖, From Parallel
Processing to the Internet of Things, Morgan Kaufmann Publishers,2012.

REFERENCE BOOKS

1. Danielle Ruest, Nelson Ruest – ―Virtualization: A Beginner‘s Guide‖, McGraw-Hill Osborne Media, 2009.
2.Jim Smith, Ravi Nair – ―Virtual Machines: Versatile Platforms for Systems and Processes‖,
Elsevier/Morgan Kaufmann, 2005
3.John W.Rittinghouse and James F.Ransome –― Cloud Computing: Implementation, Management, and
Security‖, CRC Press, 2010
4.Tim Mather, SubraKumaraswamy and ShahedLatif – ―Cloud Security and Privacy‖, O‗Reilly Media,
Inc.,2009.

111 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 FOUNDATIONS OF DATA SCIENCE L T P S C
20CS7102
ASSESSMENT TYPE TYPE -1 3 0 0 1 3
OBJECTIVES

To understand the basic concepts and techniques of Statistics, probability based learning
techniques, Regression Techniques and to understand the usage of Data Visualization

COURSE OUTCOMES

Students will be able to

1. Understanding the basic of Statistics
2. Apply the appropriate probability strategy for any given problem
3. Suggest simple and multiple linear Regressions, Polynomial Regression Model, Robust Regression,
Logistic Regression algorithms for any given problem
4. Design systems that uses the appropriate models of Time Series forecasting
5. Apply the Data Visualization techniques on Processed Data.

UNIT 1 – INTRODUCTION TO STATISTICS

Introduction to Analytics-Applications of Analytics in business- Analytics Terminology- Statistics-

Continuous vs Discrete Standard Deviation Normal Distribution Skewness, Mean, Median, Mode.
Total Periods :9

UNIT 2 – PROBABILITY THEORY

Probability Theory- Probability Distributions Concepts-Introduction to Hypothesis Test- Basic Framework

of a hypothesis test, Distance Measures, Central limit Theorem, Type of Hypothesis Test, ANOVA and
Chi Square.
Total Periods :9
UNIT 3 – REGRESSION

Linear Regression-simple and multiple linear Regressions, Polynomial Regression Model- Robust
Regression-Logistic Regression. Regularization Techniques and Gradient Boosting Techniques
Total Periods :9

UNIT 4 – TIME SERIES FORECASTING

Introduction to Time Series- Moving Average- Exponential Smoothing—Casual Models- ARIMA Models-
Multivariate Models- CASE Studies
Total Periods :9

UNIT 5 – INTRODUCTION TO VISULIZATION

112 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
Introduction: Information visualization – Theoretical foundations – Information visualization types –
Design principles - A framework for producing data visualization. Static Data Visualization– tools –
working with various data formats.
Total Periods :9
TEXT BOOKS

1. Cathy O‘Neil, Rachel Schutt, ―Doing Data Science, Straight Talk from The Frontline‖. O‘Reilly, 2013.
2.Charles M. Grinstead and J. Laurie Snell –―Introduction to Probability‖, 2nd edition-. American
Mathematical Society.
3.Timothy C. Urdan – ―Statistics in Plain English‖ –3 rd Edition-Santa Clara University.
REFERENCE BOOKS

1. Alex Campbell-―Data Science for Beginners: Comprehensive Guide to Most Important Basics in Data
Science‖
2.Davy Cielen,Arno D. B. Meysman, Mohamed Ali- ―Introducing Data Science Big Data, Machine
Learning,
and More, Using Python Tools‖- Manning Publications Co
3. Kevin P. Murphy ,‖Machine Learning A Probabilistic Perspective‖ - MIT Press.

113 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 20CS7202 DATA SCIENCE LABORATORY L T P S C
ASSESSMENT TYPE TYPE -5 0 0 3 0 2
OBJECTIVES
To gain practical experience in programming tools for data sciences, database systems, machine
learning, and big data tools.
COURSE OUTCOMES
Students will be able to
1. Learn About Numpy, Pandas, Matplotlib, Scikit for Mathematical Operation
2. Learn About Regression Concepts
3. Learn About Time Series data and Its usage
4. Design Application Using Data Science Concept –Mini Project.
LIST OF EXPERIMENTS
1. Introduction to Python Libraries- Numpy, Pandas, Matplotlib, Scikit
2. Perform Data exploration and pre-processing in Python.
3. Implement Naive Bayes classifier for dataset stored as CSV file
4. Implement regularised Linear regression
5. Implement regularized logistic regression
6. Solving the problems based on Time series analysis and forecasting and implementing statistical
quality control charts
7. Visualize data using any plotting framework
8. Open jobs Analysis and Recommendation-Mini Project
Total Periods :45
ADDITIONAL EXERCISES
1. Analyzing the trends from IPL Matches-Mini Project
2. Customer Segmentation Engine- Mini Project
Total Periods :3
TEXT BOOKS
1. Alex Campbell-―Data Science for Beginners: Comprehensive Guide to Most Important Basics in Data
Science‖

114 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
REFERENCE BOOKS
1. Davy Cielen,Arno D. B. Meysman, Mohamed Ali- Introducing Data Science Big Data, Machine
Learning,
and More, Using Python Tools- Manning Publications Co
2. Kevin P. Murphy, ―Machine Learning A Probabilistic Perspective‖ - MIT Press.

115 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 20CS7201 CLOUD COMPUTING LABORATORY L T P S C
ASSESSMENT TYPE TYPE -5 0 0 3 0 2
OBJECTIVES
To develop web applications in cloud, design and development process involved in creating a
cloud based application.
COURSE OUTCOMES
Students will be able to
1. Configure various virtualization tools such as Virtual Box, VMware workstation.
2. Design and deploy a web application in a PaaS environment.
3. Learn how to simulate a cloud environment to implement new schedulers.
4. Install and use a generic cloud environment that can be used as a private cloud.
5. Manipulate large data sets in a parallel environment.
LIST OF EXPERIMENTS

1. Install Virtualbox/VMware Workstation with different flavours of linux or windows OS on top of

windows 7 or 8.
2. Install a C compiler in the virtual machine created using virtual box and execute Simple Programs
3. Install Google App Engine. Create hello world app and other simple web applications using
python/java.
4. Use GAE launcher to launch the web applications.
5. Simulate a cloud scenario using Cloud Sim and run a scheduling algorithm that is not present in Cloud
Sim.
6. Find a procedure to transfer the files from one virtual machine to another virtual machine.
7. Find a procedure to launch virtual machine using try stack (Online Openstack Demo Version)
8. Install Hadoop single node cluster and run simple applications like word count.
Total Periods :45
ADDITIONAL EXERCISES

1. Launch and configure a virtual machine in AWS cloud

2. Install a public web server in the VM launched in AWS and access the webpage from anywhere
Total Periods :3
TEXT BOOKS

1. Kai Hwang, Geoffrey C Fox, Jack G Dongarra - Distributed and Cloud Computing, From Parallel
Processing to the Internet of Things, Morgan Kaufmann Publishers,2012.
REFERENCE BOOKS
1. Danielle Ruest, Nelson Ruest - Virtualization: A Beginner‘s Guide, McGraw-Hill Osborne Media, 2009.
2.Jim Smith, Ravi Nair - Virtual Machines: Versatile Platforms for Systems and Processes,
Elsevier/Morgan Kaufmann, 2005
3.John W.Rittinghouse and James F.Ransome - Cloud Computing: Implementation, Management, and
Security, CRC Press, 2010
4.Tim Mather, SubraKumaraswamy and ShahedLatif - Cloud Security and Privacy, O‗Reilly Media,
Inc.,2009.

116 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 PROFESSIONAL ELECTIVES I

20CS5901 INTRODUCTION TO PARALLEL ALGORITHMS L T P S C

ASSESSMENT TYPE TYPE 1 3 0 0 1 3
OBJECTIVES

To introduce principles and design techniques of parallel algorithms and data structures for
various parallel architectures
COURSE OUTCOMES
Students will be able to
1. Understand parallel algorithms and its models
2. Analyse efficiency of different parallel algorithms.
3. Learn Parallel algorithms on basic problems
4. Apply parallel algorithm on problems
5. Develop parallel algorithms for standard problems and applications.
UNIT 1 – INTRODUCTION
Need for Parallel Processing – Data and Temporal Parallelism – Models of Computation – RAM and
PRAM Model – Shared Memory and Message Passing Models- Processor Organisations – PRAM
Algorithm – Analysis of PRAM Algorithms- Parallel Programming Languages.
Total Periods :9
UNIT 2 - PRAM ALGORITHMS
Parallel Algorithms for Reduction – Prefix Sum – List Ranking –Preorder Tree Traversal – Searching -
Sorting – Merging Two Sorted Lists – Matrix Multiplication – Graph Coloring – Graph Searching.
Total Periods :9

UNIT 3 - SIMD ALGORITHMS

2D Mesh SIMD Model – Parallel Algorithms for Reduction – Prefix Computation – Selection – Odd-
Even Merge Sorting – Matrix Multiplication

Total Periods :9
UNIT 4 - SIMD ALGORITHMS -II
Hypercube SIMD Model – Parallel Algorithms for Selection- Odd-Even Merge Sort- Bitonic Sort- Matrix
Multiplication Shuffle Exchange SIMD Model – Parallel Algorithms for Reduction -Bitonic Merge Sort –
Matrix Multiplication – Minimum Cost Spanning Tree
Total Periods :9
UNIT 5 - MIMD ALGORITHMS

117 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
UMA Multiprocessor Model -Parallel Summing on Multiprocessor- Matrix Multiplication on
Multiprocessors and Multicomputer – Parallel Quick Sort – Mapping Data to Processors

Total Periods :9
TEXT BOOKS
1. Michael J. Quinn, ―Parallel Computing: Theory & Practice‖, Tata McGraw Hill Edition, Second edition,
2017.
2. Ellis Horowitz, SartajSahni and SanguthevarRajasekaran, ―Fundamentals of Computer Algorithms‖,
University press, Second edition, 2011.
3. V Rajaraman, C Siva Ram Murthy, ―Parallel computers- Architecture and Programming‖, PHI
learning, 2016.
REFERENCE BOOKS
1.AnanthGrame, George Karpis, Vipin Kumar and Anshul Gupta, ―Introduction to Parallel Computing‖,
2nd Edition, Addison Wesley, 2003.
2.M Sasikumar, Dinesh Shikhare and P Ravi Prakash, ―Introduction to Parallel Processing‖, PHI
learning, 2013.

118 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 MULTIMEDIA SYSTEMS L T P S C
20CS5902
ASSESSMENT TYPE TYPE -1 3 0 0 1 3
OBJECTIVES

To work with all aspects of images, develop multimedia skills and understanding the principal
players of individual players in multimedia teams in developing projects.
COURSE OUTCOMES
Students will be able to
1. Understand the fundamental concepts of multimedia systems
2. Analyze the multimedia communication models
3. Analyze the concepts involved in text and audio retrieval in multimedia systems
4. Analyze the concepts involved in image and video retrieval in multimedia systems
5. Acquire the knowledge multimedia systems and apply it in multimedia databases
UNIT 1 - INTRODUCTION TO MULTIMEDIA SYSTEM DESIGN
Multimedia basics − Multimedia applications − Multimedia system architecture – Evolving technologies
for multimedia − Defining objects for multimedia systems − Multimedia data interface standards −
Multimedia databases. Compression and decompression − Data and file format standards − Multimedia
I/O technologies − Digital voice and audio − Video image and animation − Full motion video
Total Periods :9
UNIT 2 - MULTIMEDIA COMMUNICATION MODELS
Common Multimedia applications - VoIP- Video Conferencing- Military Surveillance- Interactive
TVVideo on Demand- Smart Phone - Requirements and Design challenges of multimedia
communications-Architecture of Internet Multimedia Communication- Protocol Stack-H.323.
Total Periods :9
UNIT 3 - TEXT RETRIEVAL AND MUSIC
Text Information retrieval: Information retrieval system-catalog and indexing – automatic indexing –
term clustering – User search Techniques- Information Visualization- Fundamentals – Instantaneous
Features - Intensity - Tonal Analysis - Musical Genre, Similarity and Mood
Total Periods :9
UNIT 4 - IMAGE AND VIDEO RETRIEVAL
content-based image retrieval; techniques; feature extraction; integration; similarity; feature in
INDEXING; interactive retrieval; MPEG-7 standard - Content Based Video Retrieval - Video Parsing –
Video abstraction and Summarization– Video Content Representation, Indexing and retrieval
Total Periods :9
UNIT 5 - MULTIMEDIA DATABASES
Multidimensional Data Structures – Image Databases – Text / Document Databases – Video Databases
– Audio Databases – Multimedia Database Design.

Total Periods :9

119 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
TEXT BOOKS

1. Andleigh, P. K and KiranThakrar, ―Multimedia Systems and Design‖, PHI, 2003.

2. James F. Kurose and Keith W. Ross, ―Computer Networking-A Top-Down Approach Featuring the
Internet‖, Pearson, 2012.
REFERENCE BOOKS

1.Christopher D. Manning, PrabhakarRaghavan and HinrichSchütze,‖ Introduction to Information

Retrieval‖ , Cambridge University Press, 2008

120 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 20CS5903 PRINCIPLES OF DISTRIBUTED SYSTEMS L T P S C
ASSESSMENT TYPE TYPE -1 3 0 0 1 3
OBJECTIVES

To understand the principles and techniques behind the design of distributed systems.
COURSE OUTCOMES
Students will be able to
1. Understand the design principles in distributed systems and the architectures for distributed systems.
2. Apply various distributed algorithms related to clock synchronization, concurrency control, deadlock
detection, load balancing, voting etc.
3. Analyze fault tolerance and recovery in distributed systems and algorithms for the same.
4. Analyze the design and functioning of existing distributed systems and file systems.
5. Implement different distributed algorithms over current distributed platforms
UNIT 1 - INTRODUCTION
System Models: Introduction, Architectural Models, Fundamental Models. Various Paradigms in
Distributed Applications, Remote Procedure Call, Remote Object Invocation, Message-Oriented
Communication, Unicasting, Multicasting and Broadcasting, Group Communication.
Total Periods :9
UNIT 2 - DISTRIBUTED OPERATING SYSTEM
Issues in Distributed Operating System – Threads in Distributed Systems, Clock Synchronization,
Causal Ordering, Global States, Election Algorithms, Distributed Mutual Exclusion, Distributed
Transactions, Distributed Deadlock, Agreement Protocols.
Total Periods :9
UNIT 3 - FAULT TOLERANCE
Introduction to Fault Tolerance – Distributed Commit Protocols, Byzantine Fault Tolerance,
Impossibilities in Fault Tolerance

Total Periods :9
UNIT 4 - DISTRBUTED SHARED MEMORY AND FILE SYSTEMS
Distributed Shared Memory – Data-Centric Consistency Models, Client Centric Consistency Models,
Ivy, Munin, Distributed Scheduling, Distributed File Systems, Sun NFS.

Total Periods :9
UNIT 5 - CONCURRENCY CONTROL
Introduction, Transactions, Nested Transactions, Locks, Optimistic Concurrency Control, Timestamp
Ordering, Comparison of Methods for Concurrency Control. Case Studies: Distributed Object-Based
System, CORBA, COM+, Distributed Coordination-Based System, JINI.Case Studies from Apache
Spark, Google Spanner, Amazon Aurora, Block Chain Systems etc.
Total Periods :9
TEXT BOOKS

1.George Coulouris, Jean Dollimore, and Tim Kindberg ―Distributed Systems Concepts and Design‖ 3rd
Edition, 2002.
121 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
REFERENCE BOOKS

1.HagitAttiya and Jennifer Welch,― ―Distributed Computing: Fundamentals Simulations and Advanced
Topics ‖,Wiley,2004
2. Mukesh Singh, ― Advanced Concepts in Operating Systems ‖,McGraw Hill Series in Computer
Science,1994.
3.A.S.Tanenbaum and M.Van Steen,― Distributed Systems,PearsonEducation,2004

122 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 FUNDAMENTALS OF BIG DATA L T P S C
20CS5904
ASSESSMENT TYPE TYPE -1 3 0 0 1 3
OBJECTIVES

To Understand the Big Data Platform and its Use cases , Provide an overview of Apache Hadoop ,
HDFS Concepts and Interfacing with HDFS.
COURSE OUTCOMES
Students will be able to
1. Identify the characteristics and challenges of big data analytics
2. Implement the Hadoop and MapReduce framework for processing massive volume of data
3. Analyze the structured and semi structured data using Hive and Pig
4. Implement CRUD operations effectively using MongoDB and Report generation using Jaspersoft
studio
5. Explore the usage of Hadoop and its integration tools to manage Big Data and Use Visualization
Techniques
UNIT 1 - INTRODUCTION TO BIG DATA
Classification of Digital Data - Introduction to Big Data: Characteristics – Evolution – Definition -
Challenges with Big Data - Other Characteristics of Data - Why Big Data - Traditional Business
Intelligence versus Big Data - Data Warehouse and Hadoop Environment.
Total Periods :9
UNIT 2 - HADOOP AND MAPREDUCE PROGRAMMING
Hadoop: Features – Advantages – Versions – Ecosystems – Distributions – Hadoop Versus RDBMS -
Distributed Computing Challenges – History - Hadoop Overview - Use Case of Hadoop - Hadoop
Distributors - Hadoop Distributed File System - Processing Data with Hadoop - Managing Resources
and Applications with Hadoop YARN - Interacting with Hadoop Ecosystem – MapReduce: Mapper –
Reducer – Combiner – Partitioner – Searching – Sorting – Compression.
Total Periods :9
UNIT 3 - DATA PROCESSING SERVICES: HIVE & PIG
Hive: Introduction – Architecture - Data Types - File Formats - Hive Query Language Statements –
Partitions – Bucketing – Views - Sub- Query – Joins – Aggregations - Group by and Having - RCFile
Implementation - Hive User Defined Function - Serialization and Deserialization - Hive Analytic
Functions - Pig: Introduction - History and Anatomy – Features – Philosophy - Use Case for Pig - Pig
Latin Overview - Pig Primitive Data Types - Running Pig - Execution Modes of Pig - HDFS Commands -
Relational Operators - Eval Function - Complex Data Types - Piggy Bank - User-Defined Functions -
Parameter Substitution - Diagnostic Operator - Word Count Example using Pig - Pig at Yahoo! - Pig
Versus Hive.
Total Periods :9
UNIT 4 - NOSQL: MONGODB
NoSQL Databases: Advantages – Usage – Vendors – New SQL – Comparison of SQL, NoSQL and
NewSQL -MongoDB: Why Mongo DB - Terms used in RDBMS and Mongo DB - Data Types -
MongoDB Query Language Methods: Insert – Save – Update – Remove - Find – NULL – Count – Limit
– Sort – Skip – Arrays – Aggregate – MapReduce – Cursors in MongoDB – Indexes – Import and
Export -Connecting to MongoDB - NoSQL Database
Total Periods :9
123 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 UNIT 5 - FRAMEWORKS AND VISUALIZATION
Apache Hbase – Architecture/Storage – Features – Data Model – Shell and Implementation – HbaseVs
RDBMS - Zookeeper – Installation and Configuration - Running Zookeeper - Sqoop – Architecture -
Import and Export Data – Sqoop Job – Flume – Log Collection – Working with Twitter Stream - Oozie –
Simple and Complex Flow – Components – Service/Scheduler – Workflow – Apache Spark – Lambda
Architecture – Spark Streaming – Spark Processing – Apache Kafka – Operations – Visualizations –
Visual Data Analysis Techniques.
Total Periods :9
TEXT BOOKS

1.SeemaAcharya, Subhashini Chellappan, ―Big Data and Analytics‖, Wiley Publications, First Edition,
2015
REFERENCE BOOKS

1. SeemaAcharya, ―Data Analytics using R‖, McGraw Hill Publications, New Edition, 2018.
2.Judith Huruwitz, Alan Nugent, Fern Halper, Marcia Kaufman, ―Big data for dummies‖, John Wiley &
Sons, Inc. (2013)
3.Tom White, ―Hadoop, the Definitive guide‖, O‘Reilly Media, 2010
4.Donald Miner, ―Map Reduce Design Patterns: Building Effective Algorithms and Analytics for Hadoop
and Other Systems‖,O‘Reilly Media, 2012

124 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 ETHICAL HACKING AND NETWORK DEFENCE L T P S C
20CS5905
ASSESSMENT TYPE TYPE -1 3 0 0 1 3
OBJECTIVES

To assess and then correct the vulnerabilities present within information systems.
COURSE OUTCOMES
Students will be able to
1. Understand the basics of Ethical Hacking in Networking.
2. Understand the basics of Tools used in Hardware and Networking
3. Analyze Cryptography and Security Algorithms
4. Learn Hardware Security
5. Study Various Attacks and Remedies.

UNIT 1 - INTRODUCTION
Introduction to ethical hacking. Fundamentals of computer networking. TCP/IP protocol stack.
IP addressing and routing. TCP and UDP. IP subnets. Routing protocols. IP version 6.

Total Periods :9
UNIT 2 - INSTALLATION AND TOOLS
Installation of attacker and victim system. Information gathering using advanced google
search, archive.org, netcraft, whois, host, dig, dnsenum and NMAP tool.Vulnerability scanning using
NMAP and Nessus. Creating a secure hacking environment. System Hacking: password cracking,
privilege escalation, application execution. Malware andVirus. ARP spoofing and MAC attack.
Total Periods :9

UNIT 3 - CRYPTOGRAPHY
Introduction to cryptography, private-key encryption, public-key encryption. Cryptographic hash
functions, digital signature and certificate, applications. Steganography, biometric authentication,
network-based attacks, DNS and Email security
Total Periods :9
UNIT 4 - HARDWARE SECURITY
Packet sniffing using wireshark and burpsuite, password attack using burp suite.Social engineering
attacks and Denial of service attacks .Elements of hardware security: side-channel attacks, physical
inclinable functions, hardware trojans.
Total Periods :9
UNIT 5 - ATTACKS USING FRAMEWORKS - CASE STUDIES
Different types of attacks using Metasploit framework: password cracking, privilege escalation,
remote code execution, etc.Attack on web servers: password attack, SQL injection, cross site
scripting. Case studies: various attacks scenarios and their remedies.
Total Periods :9
TEXT BOOKS

1. Data and Computer Communications -- W. Stallings, Pearson ,Eigth Edition

125 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
2. Introduction to Computer Networks and Cybersecurity -- C-H. Wu and J. D. Irwin,CRC Press,Taylor
and Francis Series
3. Cryptography and Network Security: Principles and Practice -- W. Stallings,Pearson 7th Edition,
June 2017

REFERENCE BOOKS

1. Sandeep Nagar, ―Beginning Julia Programming For Engineers and Scientists‖, A Press, 2017.
2. Jalem Raj Rohit, ―Julia Cookbook‖, Packet Publishing, 2016 3. Zacharias Voulgaris, ―Julia for Data
Science‖, Technical Publications, 2016

126 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 20CS5906 JULIA PROGRAMMING L T P S C
ASSESSMENT TYPE TYPE -1 3 0 0 1 3
OBJECTIVES

To address the requirements of high-performance numerical and scientific computing while also
being effective for general-purpose programming.
COURSE OUTCOMES
Students will be able to
1. Devise programs using primitives in Julia
2. Develop simple programs in Julia using functions
3. Implement control flow and collection types in Julia
4. Apply database connectivity using Julia
5. Implement the networking concepts in Julia
UNIT 1 - INTRODUCTION
Julia programming introduction –Variables, Types, and Operations - Naming conventions, and
comments – Types – Integers - Floating point numbers - Elementary mathematical functions and
operations - Rational and complex numbers – Characters – Strings - Formatting numbers and strings -
Regular expressions - Ranges and arrays - Other ways to create arrays - Converting array of chars to a
string - Dates and times - Scope and constants.
Total Periods :9
UNIT 2 - FUNCTIONS
Functions - Defining functions - Optional and keyword arguments - Anonymous functions - First-class
functions and closures - Recursive functions - Map, filter, and list comprehensions - Generic functions
and multiple dispatch
Total Periods :9
UNIT 3 - CONTROL FLOW AND COLLECTION TYPES
Functions - Defining functions - Optional and keyword arguments - Anonymous functions - First-class
functions and closures - Recursive functions - Map, filter, and list comprehensions - Generic functions
and multiple dispatch
Total Periods :9
UNIT 4 - DATABASES
A basic view of databases - Interfacing to databases - Other considerations - Relational databases-
Building and loading - Native interfaces - ODBC - Other interfacing techniques – DBI - SQLite - MySQL
- PostgreSQL - PyCall - JDBC - NoSQLdatastores - Key-value systems - Document datastores -
RESTful interfacing - JSON - Web-based databases - Graphic systems.
Total Periods :9
UNIT 5 - NETWORKING
Sockets and servers - Well-known ports - UDP and TCP sockets in Julia - A "Looking-Glass World"
echo server - Named pipes - Working with the Web - A TCP web service - The JuliaWeb group - The
quotes server – Web Sockets - Messaging - E-mail - Twitter - SMS and esendex - Cloud services -
Introducing Amazon Web Services - The AWS.jl package - The Google Cloud.

127 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 Total Periods :9

TEXT BOOKS

1.Ivo Balbaert, ―Getting Started with Julia Programming‖, Packet Publishing, 2015
2. Malcolm Sherrington, ―Mastering Julia‖, Packet Publishing, 2015
REFERENCE BOOKS

1. Sandeep Nagar, ―Beginning Julia Programming For Engineers and Scientists‖, APress, 2017.
2. Jalem Raj Rohit, ―Julia Cookbook‖, Packet Publishing, 2016 3. Zacharias Voulgaris, ―Julia for Data
Science‖, Technical Publications, 2016

128 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 20CS5907 DEEP LEARNING FOR COMPUTER VISION L T P S C
ASSESSMENT TYPE TYPE -1 3 0 0 1 3
OBJECTIVES

To cover the latest developments in vision AI, with a sharp focus on advanced deep learning
methods.
COURSE OUTCOMES
Students will be able to
1.To learn the fundamentals of image processing
2.To understand the basics of deep learning
3.To apply CNN in visualisation
4.To analyse the models of RNN
5.To analyse the attention models in vision
UNIT 1 - INTRODUCTION TO COMPUTER VISION
Introduction to Image Formation, Capture and Representation; Linear Filtering, Correlation, Convolution
- Visual Features and Representations: Edge, Blobs, Corner Detection; Scale Space and Scale
Selection; SIFT, SURF; HoG, LBP, etc.
Total Periods :9

UNIT 2 - REVIEW OF DEEP LEARNING

Visual Matching: Bag-of-words, VLAD; RANSAC, Hough transform; Pyramid Matching; Optical Flow.
Deep Learning Review: Review of Deep Learning, Multi-layer Perceptrons, Backpropagation.
Total Periods :9

UNIT 3 - CONVOLUTIONAL NEURAL NETWORKS AND VISUALIZATION

Convolutional Neural Networks (CNNs): Introduction to CNNs; Evolution of CNN Architectures: AlexNet,
ZFNet, VGG, InceptionNets, ResNets, DenseNets. Visualization and Understanding CNNs:
Visualization of Kernels; Backprop-to-image/Deconvolution Methods; Deep Dream, Hallucination,
Neural Style Transfer; CAM,Grad-CAM, Grad-CAM++; Recent Methods (IG, Segment-IG,
SmoothGrad)
Total Periods :9

UNIT 4 - RECURRENT NEURAL NETWORKS

NNs for Recognition, Verification, Detection, Segmentation: CNNs for Recognition and Verification
(Siamese Networks, Triplet Loss, Contrastive Loss, Ranking Loss); CNNs for Detection: Background of
Object Detection, R-CNN, Fast R-CNN, Faster R-CNN, YOLO, SSD, RetinaNet; CNNs
for Segmentation: FCN, SegNet, U-Net, Mask-RCNN. Recurrent Neural Networks (RNNs): Review of

129 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
RNNs; CNN and RNN Models for Video Understanding: Spatio-temporal Models, Action/Activity
Recognition
Total Periods :9

UNIT 5 - ATTENTION MODELS IN VISION

Introduction to Attention Models in Vision; Vision and Language: Image Captioning, Visual QA, Visual
Dialog; Spatial Transformers; Transformer Networks. Introduction to Deep Generative Models.

Total Periods :9
TEXT BOOKS

1. Goodfellow, Ian, YoshuaBengio, and Aaron Courville. Deep learning. MIT press, 2016.
1. Bengio, Yoshua. Learning deep architectures for AI. Now Publishers Inc, 2009.
REFERENCE BOOKS

1. Szeliski, Richard. Computer vision: algorithms and applications. Springer Science & Business Media,
2010.
2. David, A., and Ponce Jean. "Computer vision: a modern approach." Prentice Hall (2002): 654-659.
3. Prince, Simon JD. Computer vision: models, learning, and inference. Cambridge University Press,
2012.

130 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 20CS5908 COMBINATORY AND GRAPH THEORY L T P S C
ASSESSMENT TYPE TYPE -1 3 0 0 1 3
OBJECTIVES

To formulate problems in terms of graphs and apply the theorems and algorithms to solve them.
COURSE OUTCOMES
Students will be able to
1. Write precise and accurate mathematical definitions of objects in graph theory.
2. Use mathematical definitions to identify and construct examples and to distinguish examples from
non-examples.
3. Validate and critically assess a mathematical proof.
4. Use a combination of theoretical knowledge and independent mathematical thinking in creative
investigation of questions in graph theory.
5. Reason from definitions to construct mathematical proofs.
UNIT 1 - INTRODUCTION
Graphs – Introduction – Isomorphism – Sub graphs – Walks, Paths, Circuits –Connectedness –
Components – Euler graphs – Hamiltonian paths and circuits – Trees – Properties of trees – Distance
and centers in tree – Rooted and binary trees.
Total Periods :9
UNIT 2 - TREES, CONNECTIVITY & PLANARITY
Spanning trees – Fundamental circuits – Spanning trees in a weighted graph – cut sets – Properties of
cut set – All cut sets – Fundamental circuits and cut sets – Connectivity and separability – Network
flows – 1-Isomorphism – 2-Isomorphism – Combinational and geometric graphs – Planer graphs –
Different representation of a planer graph.
Total Periods :9
UNIT 3 - MATRICES, COLOURING AND DIRECTED GRAPH
Chromatic number – Chromatic partitioning – Chromatic polynomial – Matching – Covering – Four color
problem – Directed graphs – Types of directed graphs – Digraphs and binary relations – Directed paths
and connectedness – Euler graphs.
Total Periods :9
UNIT 4 - PERMUTATIONS & COMBINATIONS
Fundamental principles of counting – Permutations and combinations – Binomial theorem –
combinations with repetition – Combinatorial numbers – Principle of inclusion and exclusion –
Derangement – Arrangements with forbidden positions.
Total Periods :9
UNIT 5 - GENERATING FUNCTIONS

131 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
Generating functions – Partitions of integers – Exponential generating function – Summation operator –
Recurrence relations – First order and second order – Non-homogeneous recurrence relations –
Method of generating functions.
Total Periods :9
TEXT BOOKS

1.NarsinghDeo, ―Graph Theory: With Application to Engineering and Computer Science‖, Prentice Hall
of India, 2013.
2.Grimaldi R.P. ―Discrete and Combinatorial Mathematics: An Applied Introduction‖, Addison Wesley,
1994.
REFERENCE BOOKS

1. Clark J. and Holton D.A, ―A First Look at Graph Theory‖, Allied Publishers, 1995.
2.Mott J.L., Kandel A. and Baker T.P. ―Discrete Mathematics for Computer Scientists and
Mathematicians‖ , Prentice Hall of India, 2016.
3. Liu C.L., ―Elements of Discrete Mathematics‖, McGraw Hill, 2015.

132 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 PROFESSIONAL ELECTIVES II

SOFTWARE PROJECT MANAGEMENT L T P S C

20CS6901
TECHNIQUES
ASSESSMENT TYPE TYPE -1 3 0 0 1 3
OBJECTIVES

To provide an in depth examination of project management principles and modern software project
management practices.
COURSE OUTCOMES
Students will be able to
1.Understand the fundamental concepts of software project
2. Analyze activity planning and risk management principles.
3.Analyze the cost-benefits of calculations so as to optimize the selection strategy
4.Analyze staff selection process and the issues related to people management
5.Acquire knowledge of test automation in software project management
UNIT 1 - INTRODUCTION TO SOFTWARE PROJECT MANAGEMENT
Introduction to Software Project Management- Software Projects - ways of categorizing software
projects – problems with software projects -Project Life Cycle– Management -Setting objectives –
Stakeholders -Project Team-Step-wise : An overview of project planning -project Evaluation –Selection
Of Appropriate Project Objectives- Software Effort Estimation Techniques, Function Point Analysis-
Object Point-COCOMO.
Total Periods :9
UNIT 2 - ACTIVITY PLANNING AND RISK MANAGEMENT
Activity planning-- project schedules - sequencing and scheduling projects - Network planning model –
AON and AOA-identifying critical activities-Crashing And Fast Tracking-,Risk management—Categories
, Risk planning, Management and Control - Evaluating risks to the schedule. PERT- Resource
Allocation, Monitoring and Tracking - Monitoring and control - allocation - identifying resource
requirements - scheduling resources - creating critical paths - publishing schedule - cost schedules-
sequence schedule.
Total Periods :9
UNIT 3 - PROJECT MANAGEMENT AND CONTROL
Monitoring and control – Visualizing Progress, Earned value analysis, managing people and organizing
teams-organizational structures- Planning for small projects. Case Study: PMBOK , Agile Development.

Total Periods :9
UNIT 4 - STAFFING IN SOFTWARE PROJECTS

133 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
Managing people – Organizational behaviour – Best methods of staff selection – Motivation – The
Oldham – Hackman job characteristic model – Stress – Health and Safety – Ethical and Professional
concerns – Working in teams – Decision making – Organizational structures – Dispersed and Virtual
teams – Communications genres – Communication plans – Leadership.
Total Periods :9
UNIT 5 - TEST AUTOMATION IN SOFTWARE PROJECTS
Software test automation – skills needed for automation – scope of automation – design and
architecture for automation – requirements for a test tool – challenges in automation – Test metrics and
measurements – project, progress and productivity metrics.
Total Periods :9
TEXT BOOKS

1. Mike Cotterell, Bob Hughes. Software Project Management, Fifth Edition, Tata McGraw-Hill; 2012.
2. Robert K. Wysocki ―Effective Software Project Management‖ – Wiley Publication, 2011.
REFERENCE BOOKS

1. Roger S. Pressman. Software Engineering – A Practioner‘s Approach, Eighth Edition, Tata McGraw-
Hill Publishers; 2014.
2. Jalote P. Software Project Management in practice, Second edition, Person Education; 2003.

134 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 20CS6902 ADVANCED BIG DATA ANALYTICS L T P S C
ASSESSMENT TYPE TYPE -1 3 0 0 1 3
OBJECTIVES

To provide an overview of advanced machine learning, data mining and statistical techniques
that arise in data analytic applications.
COURSE OUTCOMES
Students will be able to
1. Identify the need for big data analytics for a domain
2. Use NOSQL database for retrieving data
3. Develop applications using Hadoop and MapReduce Framework
4. Apply various techniques for analytics
5. Use techniques to extract the insights of big data through visualization
UNIT 1 - INTRODUCTION TO BIG DATA ANALYTICS
Analytics – Descriptive Analytics – Diagnostic Analytics – Predictive Analytics – Prescriptive Analytics –
Big Data –Characteristics of Big Data – Examples of Big Data – Analytics Flow for Big Data – Big Data
Stack – Analytics Patterns– Case Study – Data Acquisition.
Total Periods :9
UNIT 2 - BIG DATA PATTERNS & NOSQL
Load Levelling with Queues - Load Balancing with Multiple Consumers - Leader Election - Sharding -
Consistency, Availability & Partition Tolerance (CAP) - Bloom Filter - Materialized Views - Lambda
Architecture Scheduler – Agent- Supervisor - Pipes & Filters - Web Service - Consensus in Distributed
Systems – Mapreduce Patterns – Document Databases – MongoDB
Total Periods :9
UNIT 3 - BIG DATA STORAGE AND ANALYSIS
HDFS – Architecture – Usage Examples – Mapreduce Programming Model – Hadoop YARN – Hadoop
Schedulers –Map reduce Examples – Pig – Data Types – Data Filtering & Analysis – Storing Results –
Debugging Operators – Pig Examples
Total Periods :9
UNIT 4 - MACHINE LEARNING ALGORITHM
Analytics Algorithms – Clustering – k-means - Classification – Naïve Bayes – Decision Tree – Random
Forest -
Gradient Boosting Machine - Support Vector Machine – Deep Learning – Regression – Linear Model -
Recommendation Systems
Total Periods :9
UNIT 5 - CASE STUDY AND DATA VISUALISATION
Case Study – Song Recommendation system – Genome Data Analysis – Classifying Handwritten Digits
– Data Visualisation – Frameworks & Libraries – Types - Line Chart – Scatter Plot - Bar Chart - Box
Plot - Pie Chart – Dot Chart - Map Chart - Gauge Chart - Radar Chart - Matrix Chart - Spatial Graph -
Distribution Plot - Violin Plot – Count Plot - Heat map - Pair Grid - Facet Grid
Total Periods :9

135 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
TEXT BOOKS

1. Arshdeep Bahga, Vijay Madisettai, ―Big Data Science & Analytics‖, Vpt Publisher, 2016
2. Tom White, ―Hadoop: The Definitive Guide‖, O‘Reilly, 4th Edition, 2015.
REFERENCE BOOKS

1. Seema Acharya, SubhashiniChellappan, ―Big Data and Analytics‖, Wiley Publications, First
Edition, 2015.
2. Bart Baesens, ―Analytics in a Big Data World: The Essential Guide to Data Science and its
Applications‖, Wiley,2014.
3. Jure Leskovec, Anand Rajaraman and Jeffrey David Ullman, ―Mining of Massive Datasets‖,
Cambridge University Press, 2012.
4. Michael Berthold, David J. Hand, ―Intelligent Data Analysis‖, Springer, 2007.
5. ―Data Science and Big Data Analytics‖, EMC2 Education Services, 2013.

136 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 L T P S C
20CS6903 FOG COMPUTING

ASSESSMENT TYPE TYPE -1 3 0 0 1 3

OBJECTIVES

To understand the basic principles and concepts of fog computing systems and their relation to
other models such as Cloud Computing and Near-Far Computing.
COURSE OUTCOMES
Students will be able to
1. Understand the fundamental concepts in Fog.
2.Analyze the architectures available in Fog
3. Analyze the Protocols related to Fog and comprehend the Data Management and Security
Principles.
4. Examine the case studies of Fog.
5.Acquire the knowledge of fog computing and use of IoT in fog computing
UNIT 1 - INTRODUCTION TO FOG COMPUTING
Fog Computing-Definition-Characteristics- Application Scenarios - Issues -Fog Computing and Internet
of Things–Fog Computing Components - Fog Computing and Cloud Computing- Simple Case Studies
(STLS and Wind Farm) -High-Level and Software Architecture.
Total Periods :9
UNIT 2 - FOG COMPUTING FUNDAMENTALS
Introduction – Background and Motivation of Fog Computing – Fog Computing Basics – Fog Computing
Services.IoT Resource Estimation Challenges and Modeling in Fog: Fog Resource estimation and its
challenges.

Total Periods :9
UNIT 3 - ULTRA LARGE SCALE SYSTEMS
Fog Computing in Support of Hierarchical Emergent Behaviors: Introduction – Fog Computing –
Hierarchical Emergent Behaviors, a Fresh Approach for ULSS - Two Autonomous Vehicles Primitives
Case Study. The Present and Future of Privacy-Preserving Computation in Fog Computing:
Introduction – Block Chain – Multi-Party Computation – Multi-Party Computation and Block Chain.
Total Periods :9
UNIT 4 - SOFTWARE FOG COMPUTING
Cloud, Fog and Mist Computing Networks- Self-aware Data Processing - Case study: Health monitoring
– Patient Safety monitoring and training support – Smart house. Urban IoT Edge Analytics: Design
challenges – Edge-assisted Architecture – Information Acquisition and Compression – Content-aware
wireless networking – Information availability.
Total Periods :9
UNIT 5 – APPLICATIONS
Leveraging Fog Computing for Healthcare IoT: Introduction – Healthcare Services in the Fog Layer –
Data management – Event Management – Resource Efficiency – Device management –
Personalization – Privacy and Security – System Architecture of Healthcare IoT.
Total Periods :9
137 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
TEXT BOOKS

1.Amir M. Rahmani ,PasiLiljeberg, Preden, Axel Jantsch, ―Fog Computing in the Internet of Things –
Intelligence at the Edge‖,Springer International Publishing, 2018.
REFERENCE BOOKS

1. RajkumarBuyya, SatishNarayanaSrirama, Fog and Edge Computing: Principles and Paradigms.

138 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 20CS6904 REAL TIME SYSTEMS L T P S C
ASSESSMENT TYPE TYPE -1 3 0 0 1 3
OBJECTIVES

● To develop an understanding of various Real Time systems Application, obtain a broad

understanding of the technologies and applications for the emerging and exciting domain of real-time
systems.
COURSE OUTCOMES
Students will be able to
1. Understand the principles of real time system.
2. Apply and develop real time applications
3. Analyse and Make use of database in real time applications
4. Make use of architectures and behaviour of real time operating systems
5. Apply evaluation techniques in application

UNIT 1 - REAL TIME SYSTEM AND SCHEDULING

Introduction– Structure of a Real Time System –Task classes – Performance Measures for Real Time
Systems – Estimating Program Run Times – Issues in Real Time Computing – Task Assignment and
Scheduling – Classical uniprocessor scheduling algorithms –Fault Tolerant Scheduling.
Total Periods :9
UNIT 2 - SOFTWARE REQUIREMENTS ENGINEERING
Requirements engineering process – types of requirements – requirements specification for real time
systems – Formal methods in software specification – structured Analysis and Design – object oriented
analysis and design and unified modelling language – organizing the requirements document –
organizing and writing documents – requirements validation and revision.
Total Periods :9
UNIT 3 - INTERTASK COMMUNICATION AND MEMORY MANAGEMENT
Buffering data – Time relative Buffering- Ring Buffers – Mailboxes – Queues – Critical regions –
Semaphores – other Synchronization mechanisms – deadlock – priority inversion – process stack
management – run time ring buffer – maximum stack size – multiple stack arrangement – memory
management in task control block - swapping – overlays – Block page management – replacement
algorithms – memory locking – working sets – real time garbage collection – contiguous file systems.
Total Periods :9
UNIT 4 - REAL TIME DATABASES
Real time Databases – Basic Definition, Real time Vs General Purpose Databases, Main Memory
Databases, Transaction priorities, Transaction Aborts, Concurrency control issues, Disk Scheduling
Algorithms, Two– phase Approach to improve Predictability – Maintaining Serialization Consistency –
Databases for Hard Real Time Systems.
Total Periods :9
UNIT 5 - EVALUATION TECHNIQUES AND CLOCK SYNCHRONIZATION
Reliability Evaluation Techniques – Obtaining parameter values, Reliability models for Hardware
Redundancy–Software error models. Clock Synchronization–Clock, A Nonfault– Tolerant

139 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
Synchronization Algorithm – Impact of faults – Fault Tolerant Synchronization in Hardware – Fault
Tolerant Synchronization in software.
Total Periods :9
REFERENCE BOOKS

1.C.M. Krishna, Kang G. Shin, ―Real-Time Systems‖, McGraw-Hill International Editions, 1997
2. Philip.A.Laplante, ―Real Time System Design and Analysis‖, Prentice Hall of India, 3 rd Edition,
2004
3. Rajib Mall, ―Real-time systems: theory and practice‖, Pearson Education, 2009
4.R.J.A Buhur, D.L Bailey, ―An Introduction to Real-Time Systems‖, Prentice Hall International, 1999
5.Stuart Bennett, ―Real Time Computer Control-An Introduction‖, Prentice Hall of India, 1998
6.Allen Burns, Andy Wellings, ―Real Time Systems and Programming Languages‖, Pearson
Education, 2003

140 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 20CS6905 INTRODUCTION TO INTERNET OF THINGS L T P S C
ASSESSMENT TYPE TYPE -1 3 0 0 1 3
OBJECTIVES

To be explored to the interconnection and integration of the physical world and the cyber space
and design & develop IOT Devices
COURSE OUTCOMES
Students will be able to
1. To explain the concept of IoT.
2. To analyze various protocols for IoT.
3. To design a PoC of an IoT system using Rasperry Pi/Arduino .
4. To apply data analytics and use cloud offerings related to IoT.
5. To analyze applications of IoT in real time scenario.
UNIT 1 - INTRODUCTION
Introduction - Evolution of IoT - IoT versus M2M, CPS and WOT - Enabling IoT and the Complex
Interdependence of Technologies - Simplified IoT Architecture and Core IoT Functional Stack -
Networking Components - Addressing Strategies in IoT – Sensors – Characteristics – Types - Sensing
Considerations – Actuators – Types – Characteristics.
Total Periods :9
UNIT 2 - IOT PROTOCOLS
Introduction - Connectivity Technologies - IEEE 802.15.4 – Zigbee – RFID – NFC – LoRa -
Communication Technologies - Constrained nodes - Constrained networks - Types of constrained
devices - Low power and lossy networks - Infrastructure Protocols: Internet protocol version 6 (IPv6) -
6LoWPAN - Data Protocols: MQTT, CoAP, SOAP and REST
Total Periods :9
UNIT 3 - DESIGN AND DEVELOPMENT
Introduction to Arduino Boards - Arduino vs. Raspberry Pi: Choosing a board - Arduino - Board details -
Arduino installation and setup - Setting up Arduino IDE for NodeMCU - Raspberry Pi – Installation -
Remotely accessing the Raspberry Pi - Raspberry Pi with Python Programming.
Total Periods :9
UNIT 4 - DATA ANALYTICS AND SUPPORTING SERVICES
Cloud Computing – Virtualization - Cloud Models – SLA in Cloud Computing - Cloud Implementation -
Sensor-Cloud: Sensors-as-a-Service - Hadoop Ecosystem – Apache Kafka, Apache Spark – Edge
Streaming Analytics and Network Analytics – Xively Cloud for IoT, Python Web Application Framework
– Django – AWS for IoT – System Management with NETCONF-YANG.
Total Periods :9
UNIT 5 - CASE STUDIES & APPLICATIONS
Cisco IoT system - IBM Watson IoT platform - Healthcare IoT: Components – Case Study: AmbuSens
system - Agricultural IoT: Components - Case Studies - Smart and Connected Cities: Layered
architecture, Smart Lighting, Smart Parking Architecture and Smart Traffic Control.
141 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 Total Periods :9
TEXT BOOKS

1.Sudip Misra, Anandarup Mukherjee and Arijit Roy - Introduction to IoT – Cambridge University Press
2021
REFERENCE BOOKS

1. Arshdeep Bahga, Vijay Madisetti, ―Internet of Things – A hands-on approach, Universities

Press, 2015
2. Olivier Hersent, David Boswarthick, Omar Elloumi , ―The Internet of Things – Key
applications and Protocols, Wiley, 2012 (for Unit 2).
3. Jan Ho¨ ller, Vlasios Tsiatsis , Catherine Mulligan, Stamatis , Karnouskos, Stefan Avesand.
David Boyle, "From Machine-to-Machine to the Internet of Things - Introduction to a New
Age of Intelligence", Elsevier, 2014.
4. Dieter Uckelmann, Mark Harrison, Michahelles, Florian (Eds), ―Architecting the Internet of
Things‖, Springer, 2011.
5. Michael Margolis, Arduino Cookbook, Recipes to Begin, Expand, and Enhance Your Projects,
2nd Edition, O'Reilly Media, 2011.
6. https://www.arduino.cc/

142 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 20CS6906 DIGITAL MARKETING L T P S C
ASSESSMENT TYPE TYPE -1 3 0 0 1 3
OBJECTIVES

● To provide Brand Awareness, Lead Generation, Promotion for new products & services, Target
Customers, Retaining Old customers, Increase Sales/Profit and Expand Market.
COURSE OUTCOMES
Students will be able to
1. To Understand the basics of Social media Marketing
2. To develop the knowledge in creation of facebook page ,Ads and Facebook Marketing
3. To Create Website Creation Using Word Press
4. To Apply various Techniques in Search Engine Optimization
5. To Understand the basics of Google Ads

UNIT 1 - SOCIAL MEDIA MARKETING

Introduction & Importance of Social Media Marketing-How to choose Social Media Platforms for
clients?-Choosing Social Media Goals Measuring Success-Audience Research, Introduction to Content,
Content-Type for Each- Platform, Finding Curate Content Social Media Scheduling, Social listening
Total Periods :9
UNIT 2 - FACEBOOK ADS MASTERY
How to Create Facebook Page and Instagram-Importance of Facebook Ads in 2021-Basic
Requirements to Run Facebook Ads & Structure of Facebook Ads-How to create Facebook Ads-How to
generate Leads-Facebook Remarketing-Benefits of Remarketing-How to write Facebook Ad Copy-
Messenger Marketing
Total Periods :9
UNIT 3 - WEBSITE CREATION USING WORD PRESS
Domain and Hosting Module-Introduction to Word Press-Dashboard Installation of Required Elements-
Setting up the website-Advance Integrations like WhatsApp, Messenger-Few Advance Things in Word
Press(Facebook Pixels and Google Tag Manager, SEO)
Total Periods :9
UNIT 4 - SEARCH ENGINE OPTIMIZATION (SEO)
On Page and Off Page Optimization-How to do ON Page SEO to Make a Web Page Google-Friendly-
Keyword Research-How to do on-page optimization?

Total Periods :9
UNIT 5 - GOOGLE ADS MASTERY
Introduction to Google Ads-Google Ads Search - Step by Step how to Create a Successful Search
Campaigns-Google Ads Display - Step by Step Guide to Create a Display Campaigns-Create
Remarketing Campaigns in 3 Easy Steps
Total Periods :9

143 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
REFERENCE BOOKS

1. Chaffey, D., & Smith, P. R. (2017). Digital marketing excellence: planning, optimizing and
integrating online marketing. Taylor & Francis
2. Dodson, I. (2016). The art of digital marketing: the definitive guide to creating strategic,
targeted, and measurable online campaigns. John Wiley & Sons.
3. Kaufman, I., & Horton, C. (2014). Digital marketing: Integrating strategy and tactics with values,
a guidebook for executives, managers, and students. Routledge.

144 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 20CS6907 C# DOT NET L T P S C
ASSESSMENT TYPE TYPE -1 3 0 0 1 3
OBJECTIVES

To gain a thorough understanding of the philosophy and architecture of .NET · Acquire a working
knowledge of the .NET programming model and .NET
COURSE OUTCOMES
Students will be able to
1. Write various applications using C# Language in the .NET Framework.
2. Develop distributed applications using .NET Framework.
3. Create mobile applications using .NET compact Framework.
4. To Debug, compile, and run a simple application.
5. To Design and develop Web based applications on .NET
UNIT 1 - INTRODUCTION TO C#
Introducing C#, Creating a Simple C# Console Application, Understanding .NET, overview of C#,
Literals, VariabSles, Constants: Value Types, Reference Types, Understanding Type Conversions Data
Types, Operators, checked and unchecked operators, Expressions, Branching, Looping, Methods,
implicit and explicit casting, Constant, Arrays, Array Class, Array List, String, String Builder, Structure,
Enumerations, boxing and unboxing.
Total Periods :9
UNIT 2 - OBJECT ORIENTED ASPECTS OF C#
Class& Objects- Creating a Class, Creating an Object, Using this Keyword, Creating an Array of
Objects, Using the Nested Classes, Defining Partial Classes and Method, Returning a Value from a
Method and Describing Access Modifiers. Static Classes and Static Members, Properties: Read-only
Property, Static Property, Indexers, Structs: Syntax of a struct and Access Modifiers for structs, System.
Object Class. Constructors and its types, inheritance, properties, indexers, index overloading,
polymorphism, sealed class and methods, interface, abstract class, abstract and interface, operator
overloading, delegates, events, errors and exception, Threading
Total Periods :9
UNIT 3 - APPLICATION DEVELOPMENT ON .NET
Building windows application, Creating our own window forms with events and controls, menu creation,
inheriting window forms, SDI and MDI application, Dialog Box(Modal and Modeless), accessing data
with ADO.NET, DataSet, typed dataset, Data Adapter, updating database using stored procedures,
SQL Server with ADO.NET, validating controls, windows application configuration. Exception
Handling and ADO.NET
Total Periods :9
UNIT 4 - WEB BASED APPLICATION DEVELOPMENT ON .NET

Introduction- Web Basics, Programming web application with web forms Creating Virtual Directory and
Web Application, session management techniques, web. config, web services, passing datasets,
returning datasets from web services, handling transaction, returning exceptions from SQL Server. ,
ASP.NET introduction, working with XML and .NET, Multitier Application Architecture ,Web Application:
Building Web-Time Application, Examining Web-Time. aspx‘s Code- Behind File, Understanding Master
pages, Standard Web Controls: Designing a Form, Validation Controls, GridView Control,
145 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
DropDownList, Session Tracking, ASP.NET
Total Periods :9
UNIT 5 - CLR AND .NET FRAMEWORK
Assemblies, Versoning, Attributes, reflection, viewing meta data, type discovery, reflection on type,
marshalling, remoting, security in .NET

Total Periods :9
TEXT BOOKS

1. Herbert Schildt, ―The Complete Reference: C# 4.0‖, Tata McGraw Hill, 2012.
2. Christian Nagel et al. ―Professional C# 2012 with .NET 4.5‖, Wiley India, 2012.
REFERENCE BOOKS

1. Andrew Troelsen , ―Pro C# 2010 and the .NET 4 Platform, Fifth edition, A Press, 2010.
2. Ian Griffiths, Matthew Adams, Jesse Liberty, ―Programming C# 4.0‖, Sixth Edition, O‟Reilly, 2010.
3. Bart De Smet: C# 4.0 Unleashed, Pearson Education- SAMS Series.

146 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 20CS6908 DIGITAL IMAGE PROCESING L T P S C
ASSESSMENT TYPE TYPE -1 3 0 0 1 3
OBJECTIVES

To introduce the concepts of image processing and basic analytical methods to be used in image
processing.
COURSE OUTCOMES
Students will be able to
1.Know and understand the basics and fundamentals of digital image processing, such as digitization,
sampling, quantization
2. Operate on images using the techniques of smoothing, sharpening and enhancement.
3. Understand the restoration concepts and filtering techniques.
4. Apply various segmentation methods
5. Learn the basics of compression and recognition methods for color models.
UNIT 1 - DIGITAL IMAGE FUNDAMENTALS
Steps in Digital Image Processing – Components – Elements of Visual Perception – Image Sensing
and Acquisition – Image Sampling and Quantization – Relationships between pixels – Color image
fundamentals – RGB, HSI models,
Total Periods :9
UNIT 2 - IMAGE ENHANCEMENT
Spatial Domain: Gray level transformations – Histogram processing – Basics of Spatial Filtering–
Smoothing and Sharpening Spatial Filtering, Frequency Domain: Smoothing and Sharpening frequency
domain filters- Image enchantment using MATLAB
Total Periods :9
UNIT 3 - IMAGE RESTORATION
Image Restoration – degradation model, Properties, Noise models – Mean Filters – Order Statistics –
Adaptive filters – Band reject Filters – Band pass Filters – Notch Filters – Optimum Notch Filtering –
Inverse Filtering – Wiener filtering
Total Periods :9
UNIT 4 - IMAGE SEGMENTATION
Point, line and edge detection – Thresholding – Region-Based segmentation – Segmentation using
morphological watersheds

Total Periods :9
UNIT 5 - IMAGE COMPRESSION AND RECOGNITION
Need for data compression, Huffman, Run Length Encoding, Shift codes, Arithmetic coding, JPEG
standard, MPEG. Boundary representation, Boundary description, Fourier Descriptor, Regional
Descriptors – Topological feature, Texture – Patterns and Pattern classes – Recognition based on
matching.
Total Periods :9
147 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
TEXT BOOKS

1. Rafael C. Gonzalez, Richard E. Woods,Digital Image Processing Pearson, Third Edition, 2010.
2. Anil K. Jain,Fundamentals of Digital Image Processing Pearson, 2002.
REFERENCE BOOKS

1. Kenneth R. Castleman,Digital Image Processing Pearson, 2006.

2.Rafael C. Gonzalez, Richard E. Woods, Steven Eddins,Digital Image Processing using MATLAB
Pearson Education, Inc., 2011.
3. D,E. Dudgeon and RM. Mersereau,Multidimensional Digital Signal Processing Prentice Hall
Professional Technical Reference, 1990.
4.William K. Pratt,Digital Image Processing John Wiley, New York, 2002
5.Milan Sonka et al Image processing, analysis and machine vision Brookes/Cole, Vikas Publishing
House, 2nd edition, 1999

148 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 PROFESSIONAL ELECTIVE III

20CS7901 HUMAN COMPUTER INTERACTION L T P S C

ASSESSMENT TYPE TYPE -1 3 0 0 1 3
OBJECTIVES

To Provide an overview of the concepts relating to the design of human-computer interfaces in

ways making computer-based systems comprehensive, friendly and usable.
COURSE OUTCOMES
Students will be able to
1. Design effective dialog for HCI
2. Design effective HCI for individuals and persons with disabilities
3. Assess the importance of user feedback.
4. Explain the HCI implications for designing multimedia/ ecommerce/ e-learning Web sites.
5. Develop meaningful user interface.
UNIT 1 - FOUNDATIONS OF HCI
The Human: I/O channels – Memory – Reasoning and problem solving; The Computer: Devices –
Memory – processing and networks; Interaction: Models – frameworks – Ergonomics – styles –
elements – interactivity- Paradigms. - Case Studies.
Total Periods :9
UNIT 2 - DESIGN & SOFTWARE PROCESS
Interactive Design: Basics – process – scenarios – navigation – screen design – Iteration and
prototyping. HCI in software process: Software life cycle – usability engineering – Prototyping in practice
– design rationale. Design rules: principles, standards, guidelines, rules. Evaluation Techniques –
Universal Design.
Total Periods :9
UNIT 3 - MODELS AND THEORIES
HCI Models: Cognitive models: Socio-Organizational issues and stakeholder requirements –
Communication and collaboration models-Hypertext, Multimedia and WWW.

Total Periods :9
UNIT 4 - MOBILE HCI
Mobile Ecosystem: Platforms, Application frameworks- Types of Mobile Applications: Widgets,
Applications, Games- Mobile Information Architecture, Mobile 2.0, Mobile Design: Elements of Mobile
Design, Tools. - Case Studies
Total Periods :9
UNIT 5 - WEB INTERFACE DESIGN

149 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
Designing Web Interfaces – Drag & Drop, Direct Selection, Contextual Tools, Overlays, Inlays and
Virtual Pages, Process Flow - Case Studies

Total Periods :9
TEXT BOOKS

1. Alan Dix, Janet Finlay, Gregory Abowd, Russell Beale, ―Human Computer Interaction‖, 3rd
Edition, Pearson Education, 2004 (UNIT I, II & III).
2. Brian Fling, ―Mobile Design and Development‖, First Edition, O‗Reilly Media Inc., 2009 (UNIT –
IV).
3. Bill Scott and Theresa Neil, ―Designing Web Interfaces‖, First Edition, O‗Reilly, 2009. (UNIT-V)
REFERENCE BOOKS

1.Ethem Alpaydin, ―Introduction to Machine Learning (Adaptive Computation and Machine Learning)‖,
The MIT Press 2004.
2.Stephen Marsland, ―Machine Learning: An Algorithmic Perspective‖, CRC Press, 2009.
3.http://nptel.ac.in/

150 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 SERVICE ORIENTED ARCHITECTURE AND L T P S C
20CS7902
MICROSERVICES
ASSESSMENT TYPE TYPE -1 3 0 0 1 3
OBJECTIVES

To understand the technology underlying service design and micro-services applications

COURSE OUTCOMES
Students will be able to
1. Analyze and design SOA based solutions.
2. Understand the basic principles of service orientation.
3. Analyze and implement a web service based applications.
4. Understand the technology underlying service design.
5. Implement SOA with Micro Services applications.
UNIT 1 - SOFTWARE ENGINEERING PRACTICES
Software Engineering Principles – SDLC – Agile Development Methodologies – Emergence of Devops
Architecture – Need for Software Architecture – Types of IT Architecture – Pattern and Style –
Architecting Process for Software Applications – High Level Architecture – Solution Architecture –
Software Platforms – Enterprise Applications – Custom Software Applications – Cloud Computing
Platforms.
Total Periods :9
UNIT 2 - SOA AND MICROSERVICE ARCHITECTURE BASICS
SOA and MSA – Basics – Evolution of SOA & MSA – Drivers for SOA – Dimensions, Standards and
Guidelines for SOA – Emergence of MSA – Enterprise-wide SOA – Strawman and SOA Reference
Architecture – OOAD Process & SOAD Process – Service Oriented Application – Composite
Application Programming Model.
Total Periods :9
UNIT 3 - WEB SERVICES
XML – DOM and SAX Processors – SOAP – WSDL – UDDI – JSON – WS – Security -Web Services
Standards – Java, .NET, Python Web Services – RESTful Web Services -Middleware Services for IoT –
Mobile Services.
Total Periods :9
UNIT 4 - SERVICE ORIENTED ANALYSIS AND DESIGN
Principles of Service Design – Design of Activity, Data, Client, Business Process Services – Resilience
Services –Technologies for SOA – Service Enablement – Integration – Orchestration – SOA
Governance – Design Time and Run Time Governance – SOA Best Practices – EA and SOA for IT
Alignment.
Total Periods :9
UNIT 5 - MICRO SERVICE BASED APPLICATIONS
Implementing Microservices with Python – Microservice Discovery Framework – Coding, Testing and
Documenting Microservices – Interacting with Other Services – Monitoring and Securing the Services –
Containerized Services – Deploying on Cloud.
Total Periods :9
151 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
TEXT BOOKS

1. Shankar Kambhampaty, ―Service-oriented Architecture and Microservice Architecture: For

Enterprise,
Cloud, Big Data and Mobile‖, Third Edition, Wiley, 2018.
2. Tarek Ziade , ―Python Microservices Development‖, OREILLY publication,2017.
REFERENCE BOOKS

1. Thomas Erl, ―SOA Principles of Service Design ―(The Prentice Hall Service-Oriented Computing
Series fromThomas Erl), 2005.
2. Ron Schmelzer et.al, ―XML and Web Services‖, Pearson education, 2002.
3. Leonard Richardson, Sam Ruby, ―RESTful Web Services‖, OREILLY publication, 2007.
4. Nicolai M. Josuttis, ―SOA in Design – The Art of Distributed System Design‖, OREILLY publication,
2007.

152 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 20CS7903 ADHOC AND SENSOR NETWORKS L T P S C
ASSESSMENT TYPE TYPE -1 3 0 0 1 3
OBJECTIVES

To study the fundamentals of Adhoc and Sensor Networks , and the issues pertaining to major
obstacles in establishment and efficient management of Adhoc and sensor networks.

COURSE OUTCOMES
Students will be able to
1.Upon completion of the course, the student should be able to
2.Explain the concepts, network architectures and applications of ad hoc and wireless sensor networks
3.Analyze the protocol design issues of ad hoc and sensor networks
4. Design routing protocols for adhoc and wireless sensor networks with respect to some protocol
design issues
5. Evaluate the QoS related performance measurements of adhoc and sensor networks
UNIT 1 - INTRODUCTION
Fundamentals of Wireless Communication Technology – The Electromagnetic Spectrum – Radio
propagation Mechanisms – Characteristics of the Wireless Channel -mobile ad hoc networks (MANETs)
and wireless sensor networks (WSNs) :concepts and architectures. Applications of Adhoc and Sensor
networks. Design Challenges in Adhoc and Sensor Networks.
Total Periods :9
UNIT 2 -MAC PROTOCOLS FOR AD HOC WIRELESS NETWORKS
Issues in designing a MAC Protocol- Classification of MAC Protocols- Contention based protocols-
Contention based protocols with Reservation Mechanisms- Contention based protocols with Scheduling
Mechanisms – Multi channel MAC-IEEE 802.11
Total Periods :9
UNIT 3 - ROUTING PROTOCOLS AND TRANSPORT LAYER IN AD HOC WIRELESS NETWORKS
Issues in designing a routing and Transport Layer protocol for Adhoc networks- proactive routing,
reactive routing (on-demand), hybrid routing- Classification of Transport Layer solutions-TCP over Ad
hoc wireless Networks.
Total Periods :9
UNIT 4 - WIRELESS SENSOR NETWORKS (WSNS) AND MAC PROTOCOLS
Single node architecture: hardware and software components of a sensor node - WSN Network
architecture: typical network architectures-data relaying and aggregation strategies -MAC layer
protocols: self-organizing, Hybrid TDMA/FDMA and CSMA based MAC- IEEE 802.15.4.
Total Periods :9
UNIT 5 - WSN ROUTING, LOCALIZATION & QOS

153 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
Issues in WSN routing – OLSR- Localization – Indoor and Sensor Network Localization-absolute and
relative localization, triangulation-QOS in WSN-Energy Efficient Design-Synchronization-Transport
Layer issues.

Total Periods :9
TEXT BOOKS

1. C. Siva Ram Murthy, and B. S. Manoj, "Adhoc Wireless Networks: Architectures and Protocols ",
Prentice Hall Professional Technical Reference, 2008.
REFERENCE BOOKS

1. Carlos De Morais Cordeiro, Dharma Prakash Agrawal ―Adhoc & Sensor Networks: Theory and
Applications‖, World Scientific Publishing Company, 2006.
2. Feng Zhao and Leonides Guibas, "Wireless Sensor Networks", Elsevier Publication - 2002.
3. Holger Karl and Andreas Willig ―Protocols and Architectures for Wireless Sensor Networks‖, Wiley,
2005
4.Kazem Sohraby, Daniel Minoli, & Taieb Znati, ―Wireless Sensor Networks-Technology,

154 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 20CS7904 BLOCKCHAIN ARCHITECTURE L T P S C
ASSESSMENT TYPE TYPE -1 3 0 0 1 3
OBJECTIVES

To provide conceptual understanding of how block chain technology can be used to innovate and
improve business processes.
COURSE OUTCOMES
Students will be able to
1. Understand the basics of digital money and crypto currencies.
2. Design the consensus protocol architecture for blockchain.
3. Design consensus process using open source tool & platform like umbrella project
4. Design an e-commerce application for end users
5. Design an application which could satisfy most departmental works like digital record identification,
land records & etc
UNIT 1 - INTRODUCTION TO BLOCKCHAIN
Digital Money to Distributed Ledgers, Design Primitives: Protocols, Security, Consensus, Permissions,
Privacy. Block chain Architecture and Design: Basic crypto primitives: Hash Signature, Hash chain to
Block chain, Basic consensus mechanisms
Total Periods :9
UNIT 2 - CONSENSUS
Requirements for the consensus protocols, Proof of Work (PoW), Scalability aspects of Blockchain
consensus protocols Permissioned Blockchains: Design goals, Consensus protocols for Permissioned
Blockchains.

Total Periods :9
UNIT 3 - HYPERLEDGER FABRIC
Hyperledger Fabric (A): Decomposing the consensus process, Hyperledger fabric components,
Chaincode Design and Implementation. Hyperledger Fabric (B): Beyond Chaincode: fabric SDK and
Front End (b) Hyperledger composer tool
Total Periods :9
UNIT 4 - BLOCKCHAIN APPLICATIONS IN E-COMMERCE
Use case 1: Blockchain in Financial Software and Systems (FSS): (i) Settlements, (ii) KYC, (iii) Capital
markets, (iv) Insurance
Use case 2: Blockchain in trade/supply chain: (i) Provenance of goods, visibility, trade/supply chain
finance, invoice management discounting, etc
Total Periods :9
UNIT 5 - BLOCKCHAIN APPLICATIONS IN PUBLIC SECTORS

155 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
Use case 3: Blockchain for Government: (i) Digital identity, land records and other kinds of record
keeping between government entities, (ii) public distribution system social welfare systems Blockchain
Cryptography, Privacy and Security on Blockchain.
Total Periods :9
TEXT BOOKS

1. Andreas M. Antonopoulos, Riccardo Masutti, ―Mastering Bitcoin: Unlocking Digital

Cryptocurrencies‖, O'Reilly Media, Inc.", 2014
2. Melanie Swan, ―Blockchain‖, O‘Reilly, 2015
3. Hyperledger Fabric - https://www.hyperledger.org/projects/fabric
4. ―Zero to Blockchain - An IBM Redbooks course‖, Bob Dill, David Smits,
https://www.redbooks.ibm.com/Redbooks.nsf/RedbookAbstracts/crse0401.html
REFERENCE BOOKS

1. Melanie Swan, ―Block Chain: Blueprint for a New Economy‖, O‘Reilly, first edition – 2015.
2. Imran Bashir, ―Mastering Block Chain: Distributed Ledger Technology, Decentralization and
Smart Contracts ExplainedPackt Publishing, first edition – 2012.
3. Daniel Drescher, ―Block Chain Basics‖, Apress; 1stedition, 2017

156 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 20CS7905 DATA WAREHOUSING AND DATA MINING L T P S C
ASSESSMENT TYPE TYPE -1 3 0 0 1 3
OBJECTIVES

To extract knowledge from data repository for data analysis, frequent pattern, classification and
prediction.
COURSE OUTCOMES
Students will be able to
Course Outcomes: Students will be able to
1. Design a Data warehouse system and perform business analysis with OLAP tools.
2.Apply suitable pre-processing and visualization techniques for data analysis
3.Apply frequent pattern and association rule mining techniques for data analysis
4.Apply appropriate classification and clustering techniques for data analysis
5. Apply Weka tool for real time applications.
UNIT 1 - DATA WAREHOUSING – INTRODUCTION AND OLAP
Basic Concepts - Data Warehousing Components – Building a Data Warehouse – Database
Architectures for Parallel Processing – Parallel DBMS Vendors - Multidimensional Data Model – Data
Warehouse Schemas for Decision Support, Concept Hierarchies -Characteristics of OLAP Systems –
Typical OLAP Operations, OLAP and OLTP.
Total Periods :9
UNIT 2 - DATA MINING – INTRODUCTION
Introduction to Data Mining Systems – Knowledge Discovery Process – Data Mining Techniques –
Issues – applications- Data Objects and attribute types, Statistical description of data, Data
Preprocessing – Cleaning, Integration, Reduction, Transformation and discretization, Data
Visualization, Data similarity and dissimilarity measures.
Total Periods :9
UNIT 3 - DATA MINING - FREQUENT PATTERN ANALYSIS
Mining Frequent Patterns, Associations and Correlations – Mining Methods- Pattern Evaluation Method
– Pattern Mining in Multilevel, Multi Dimensional Space – Constraint Based Frequent Pattern Mining,
Classification using Frequent Patterns
Total Periods :9
UNIT 4 - CLASSIFICATION AND CLUSTERING
Decision Tree Induction - Bayesian Classification – Rule Based Classification – Classification by Back
Propagation – Support Vector Machines –– Lazy Learners – Model Evaluation and Selection-
Techniques to improve Classification Accuracy. Clustering Techniques – Cluster analysis - Partitioning
Methods - Hierarchical Methods – Density Based Methods - Grid Based Methods – Evaluation of
clustering - Outlier analysis-outlier detection methods.
Total Periods :9
157 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 UNIT 5 - WEKA TOOL
Datasets – Introduction, Iris plants database, Breast cancer database, Auto imports database -
Introduction to WEKA, The Explorer – Getting started, Exploring the explorer, Learning algorithms,
Clustering algorithms, Association–rule learners.
Total Periods :9
TEXT BOOKS

1.Jiawei Han and Micheline Kamber, ―Data Mining Concepts and Techniques‖, Third Edition, Elsevier,
2012.
REFERENCE BOOKS

1.Alex Berson and Stephen J.Smith, ―Data Warehousing, Data Mining & OLAP‖, Tata McGraw – Hill
Edition, 35th Reprint 2016.
2.K.P. Soman, Shyam Diwakar and V. Ajay, ―Insight into Data Mining Theory and Practice‖, Eastern
Economy Edition, Prentice Hall of India, 2006.
3. Ian H.Witten and Eibe Frank, ―Data Mining: Practical Machine Learning Tools and Techniques‖,
Elsevier, Second Edition.
4. G. K. Gupta ―Introduction to Data Mining with Case Studies‖, Easter Economy Edition, Prentice Hall
of India, 2006.
5.http://nptel.ac.in/

158 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 20CS7906 GENETIC ALGORITHM AND APPLICATIONS L T P S C
ASSESSMENT TYPE TYPE -1 3 0 0 1 3
OBJECTIVES

To provide a fundamental introduction, as well as a survey of a simple genetic

algorithm, Applications of genetic algorithms.
COURSE OUTCOMES
Students will be able to
1. Explain the of the principles underlying Evolutionary Computation in general and Genetic Algorithms
in particular.
2.Apply Evolutionary Computation Methods to find solutions to complex problems
3.Analyse and experiment with parameter choices in the use of Evolutionary Computation
4.Summarize current research in Genetic Algorithms and Evolutionary Computing.
UNIT 1 - INTRODUCTION
A brief history of evolutionary computation, Elements of Genetic Algorithms, A simple genetic algorithm,
Applications of genetic algorithms.
Genetic Algorithms in Scientific models: Evolving computer programs, data analysis and prediction,
evolving neural networks, Modelling interaction between learning and evolution, modelling sexual
selection, measuring evolutionary activity.
Total Periods :8
UNIT 2 - THEORETICAL FOUNDATION OF GENETIC ALGORITHM
Schemas and Two-Armed and k-armed problem, royal roads, exact mathematical models of simple
genetic algorithms, Statistical- Mechanics Approaches
Total Periods :8
UNIT 3 - COMPUTER IMPLEMENTATION OF GENETIC ALGORITHM
Data structures, Reproduction, crossover and mutation, mapping objective functions to fitness form,
fitness scaling, coding, a multiparameter, mapped, fixed point coding, discretization and constraints.
Total Periods :9
UNIT 4 - APPLICATIONS OF GENETIC ALGORITHMS
The risk of genetic algorithms, De Jong and function optimization, Improvement in basic techniques,
current application of genetic algorithms.
Total Periods :10
UNIT 5 - ADVANCED OPERATORS AND TECHNIQUES IN GENETIC SEARCH
Dominance, duplicity, and abeyance, inversion and other reordering operators. Other micro operators,
Niche and speciation, multiobjective optimization, knowledge-based techniques, genetic algorithms and
parallel processors.
Total Periods :10

159 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
TEXT BOOKS

1. David E. Goldberg, ―Genetic Algorithms in Search, Optimization, and Machine Learning‖, Pearson
Education.
2. Melanle Mitchell, ―An introduction to genetic algorithms‖, PHI.
3. Michael D. Vose, ―The simple genetic algorithm foundations and theory,PHI.
REFERENCE BOOKS

1. Ulrich Bodenhofer ,―Genetic Algorithms: Theory and Applications‖,

160 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 20CS7907 ROBOTICS L T P S C
ASSESSMENT TYPE TYPE -1 3 0 0 1 3
OBJECTIVES

To Strengthen students' grasp of the mathematics and physics involved in the design,
construction and control of robots, with a focus on linear algebra and geometry. programming skills.
COURSE OUTCOMES
Students will be able to
1. Apply the basic engineering knowledge for the design of robotics
2. Understand and Apply various types of End Effectors
3. Understand and Apply various types of Sensors
4. Understand Robot Kinematics and Programming
5. Understand and Analyze Robot safety issues and economics.
UNIT 1 - FUNDAMENTALS OF ROBOT
Robot - Definition - Robot Anatomy - Co ordinate Systems, Work Envelope Types and Classification-
Specifications-Pitch, Yaw, Roll, Joint Notations, Speed of Motion, Pay Load- Robot Parts and their
Functions-Need for Robots-Different Applications
Total Periods :9
UNIT 2 - ROBOT DRIVE SYSTEMS AND END EFFECTORS
Pneumatic Drives-Hydraulic Drives-Mechanical Drives-Electrical Drives-D.C. Servo Motors, Stepper
Motors, A.C. Servo Motors-Salient Features, Applications and Comparison of all these Drives, End
Effectors-Grippers-Mechanical Grippers, Pneumatic and Hydraulic- Grippers, Magnetic Grippers,
Vacuum Grippers; Two Fingered and Three Fingered Grippers; Internal Grippers and External
Grippers; Selection and Design Considerations
Total Periods :9
UNIT 3 - SENSORS AND MACHINE VISION
Requirements of a sensor, Principles and Applications of the following types of sensors- Position
sensors - Piezo Electric Sensor, LVDT, Resolvers, Optical Encoders, pneumatic Position Sensors,
Range Sensors Triangulations Principles, Structured, Lighting Approach, Time of Flight, Range Finders,
Laser Range Meters, Touch Sensors ,binary Sensors., Analog Sensors, Wrist Sensors, Compliance
Sensors, Slip Sensors, Camera, Frame Grabber, Sensing and Digitizing Image Data- Signal
Conversion, Image Storage, Lighting Techniques, Image Processing and Analysis-Data Reduction,
Segmentation, Feature Extraction, Object Recognition, Other Algorithms, Applications- Inspection,
Identification, Visual Serving and Navigation
Total Periods :9
UNIT 4 - ROBOT KINEMATICS AND ROBOT PROGRAMMING
Forward Kinematics, Inverse Kinematics and Difference; Forward Kinematics and Reverse Kinematics
of manipulators with Two, Three Degrees of Freedom (in 2 Dimension), Four Degrees of freedom (in 3
Dimension) Jacobians, Velocity and Forces-Manipulator Dynamics, Trajectory Generator, Manipulator

161 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
Mechanism Design-Derivations and problems. Lead through Programming, Robot programming
Languages-VAL Programming-Motion Commands, Sensor Commands, End Effector commands and
simple Programs
Total Periods :9
UNIT 5 - IMPLEMENTATION AND ROBOT ECONOMICS
RGV, AGV; Implementation of Robots in Industries-Various Steps; Safety Considerations for Robot
Operations - Economic Analysis of Robots.

Total Periods :9
TEXT BOOKS

1. Klafter R.D., Chmielewski T.A and Negin M., ―Robotic Engineering - An Integrated Approach‖,
Prentice Hall, 2010.
2.Groover M.P., ―Industrial Robotics -Technology Programming and Applications‖, McGraw Hill, 2001
REFERENCE BOOKS

1. Craig J.J., ―Introduction to Robotics Mechanics and Control‖, Pearson Educa

2. Deb S.R., ―Robotics Technology and Flexible Automation‖ Tata McGraw Hill Book Co., 1994.tion,
2008.
3. Koren Y., ―Robotics for Engineers", McGraw Hill Book Co., 1992.
4. Rajput R.K., ―Robotics and Industrial Automation‖, S.Chand and Company, 2008.
5. Fu.K.S., Gonzalz R.C. and Lee C.S.G., ―Robotics Control, Sensing, Vision and Intelligence‖, McGraw
Hill Book Co., 1987.
6. Janakiraman P.A., ―Robotics and Image Processing‖, Tata McGraw Hill, 1995.

162 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 20CS7908 NATURAL LANGUAGE PROCESSING L T P S C
ASSESSMENT TYPE TYPE -1 3 0 0 1 3
OBJECTIVES

To learn how to process written text from basic of fundamental knowledge starts with Finite
automata, Regular expression and probabilistic model with n-grams.
COURSE OUTCOMES
Students will be able to
1. Analyze the natural language text.
2. Generate the natural language.
3. Do Text mining.
4. Apply information retrieval techniques.
5. Analyze the alternative models of IRT.
UNIT 1 - OVERVIEW AND LANGUAGE MODELLING
Overview: Origins and challenges of NLP Language and Grammar-Processing Indian Languages- NLP
Applications Information Retrieval. Language Modeling: Various Grammar- based Language Models-
Statistical Language Model.
Total Periods :9
UNIT 2 - WORD LEVEL AND SYNTACTIC ANALYSIS
Word Level Analysis: Regular Expressions Finite-State Automata-Morphological Parsing-Spelling Error
Detection and correction-Words and Word classes-Part-of Speech Tagging. Syntactic Analysis:
Context-free Grammar-Constituency- Parsing-Probabilistic Parsing.
Total Periods :9
UNIT 3 - EXTRACTING RELATIONS FROM TEXT: FROM WORD SEQUENCES TO DEPENDENCY
Extracting Relations from Text: From Word Sequences to Dependency Paths : Introduction,
Subsequence Kernels for Relation Extraction, A Dependency-Path Kernel for Relation Extraction and
Experimental Evaluation. Mining Diagnostic Text Reports by Learning to Annotate Knowledge Roles :
Introduction, Domain Knowledge and Knowledge Roles, Frame Semantics and Semantic Role
Labeling, Learning to Annotate Cases with Knowledge Roles and Evaluations. A Case Study in Natural
Language Based Web Search: InFact System Overview, The GlobalSecurity.org Experience.
Total Periods :9
UNIT 4 - EVALUATING SELF-EXPLANATIONS IN ISTART: WORD MATCHING, LATENT
SEMANTIC ANALYSIS, AND TOPIC MODELS
Introduction, iSTART: Feedback Systems, iSTART: Evaluation of Feedback Systems.
Textual Signatures: Identifying Text-Types Using Latent Semantic Analysis to Measure the
Cohesion of Text Structures: Introduction, Cohesion, CohMetrix, Approaches to Analyzing Texts,
Latent Semantic Analysis, Predictions, Results of Experiments.
Automatic Document Separation: A Combination of Probabilistic Classification and Finite-State
Sequence Modeling: Introduction, Related Work, Data Preparation, Document Separation as a
Sequence Mapping Problem, Results.
Evolving Explanatory Novel Patterns for Semantically-Based Text Mining: Related Work, A
Semantically Guided Model for Effective Text Mining
Total Periods :9

163 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 UNIT 5 - INFORMATION RETRIEVAL AND LEXICAL RESOURCES
Information Retrieval: Design features of Information Retrieval Systems-Classical, Non classical,
Alternative Models of Information Retrieval – valuation Lexical Resources: World Net-Frame Net-
Stemmers-POS Tagger- Research Corpora.
Total Periods :9
TEXT BOOKS

1. Tanveer Siddiqui, U.S. Tiwary, ―Natural Language Processing and Information Retrieval‖,
Oxford University Press, 2008.
2. Anne Kao and Stephen R. Poteet (Eds), ―Natural LanguageProcessing and Text Mining‖,
Springer-Verlag London Limited 2007.
REFERENCE BOOKS

1. Daniel Jurafsky and James H Martin, ―Speech and Language Processing: An Introduction
to Natural Language Processing, Computational Linguistics and Speech Recognition‖, 2nd
Edition, Prentice Hall, 2008.
2. James Allen, ―Natural Language Understanding‖, 2nd edition, Benjamin/Cummings
publishing company, 1995.
3. Gerald J. Kowalski and Mark.T. Maybury, ―Information Storage and Retrieval systems‖,
Kluwer academic Publishers, 2000.

164 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 PROFESSIONAL ELECTIVES IV

20CS8901 SOFTWARE QUALITY AND TESTING L T P S C

ASSESSMENT TYPE TYPE -1 3 0 0 1 3
OBJECTIVES

To learn how to use available resources to develop software, reduce cost of software and how to
maintain quality of software.
COURSE OUTCOMES
Students will be able to
1.Choose the right type of software testing process for any given real world problem
2.Carry out the unit and white box software testing process
3.Implement integration, system and acceptance testing techniques
4.Use software quality standards for developing quality software
5. Analyze and improve the quality procedures through continuous improvement process.
UNIT 1 - INTRODUCTION
Basics Concepts of Software Testing and Quality Assurance - Theory of Program Testing: Basic
Concepts in Testing Theory - Theory of Good enough and Gerhart - Theory of Weyuker and Ostrand -
Theory of Gourlay - Adequacy of Testing - Limitations of Testing - Testing Techniques: Black Box -
White Box - Gray Box testing - Manual vs Automated Testing - Static vs Dynamic Testing - Taxonomy
of Software Testing Techniques
Total Periods :9
UNIT 2 - UNIT AND WHITE BOX TESTING
Unit Testing - Control Flow Testing: Control Flow Graph - Paths in a Control Flow Graph - Path
Selection Criteria - Generating Test Input - Examples of Test Data Selection - Containing Infeasible
Paths Data Flow Testing: Data Flow Graph - Data Flow Testing Criteria - Comparison of Data Flow Test
Selection Criteria - Feasible Paths and Test Selection Criteria - Comparison of Testing Techniques
Total Periods :9
UNIT 3 - INTEGRATION, SYSTEM AND ACCEPTANCE TESTING
Integration Testing: Different Types of Interfaces and Interface Errors - Granularity of System
Integration 108 Testing - System Integration Techniques - Software and Hardware Integration - Test
Plan for System Integration - Off-the-Shelf Component Integration System Test: System Test
Categories, Functional Testing: Functional Testing Concepts of Howden - Complexity of Applying
Functional Testing - Pairwise Testing - Equivalence Class Partitioning - Boundary Value Analysis -
Decision Tables - Random Testing - Error Guessing - Category Partition Acceptance Testing: Types -
Acceptance Criteria - Selection of Acceptance Criteria - Test Plan - Test Execution - Test Report -
Acceptance Testing in eXtreme Programming
Total Periods :9
UNIT 4 - SOFTWARE QUALITY MODELS

165 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
Software quality -Verification versus Validation- Components of Quality Assurance - SQA Plan - Quality
Standards - McCall‘s Quality Factors and Criteria - Capability Maturity Model and its levels - People
Capability Maturity Model - CMM-Integration - Test Process Improvement - Testing Maturity Model -
ISO 9126 Quality Characteristics - ISO 9000:2000 Software Quality Standard - Malcolm Baldrige
National Quality Awar
Total Periods :9
UNIT 5 - QUALITY THROUGH CONTINUOUS IMPROVEMENT PROCESS
Role of Statistical Methods in Software Quality: Cause-and-Effect Diagram, Flow Chart, Pareto Chart,
Run Chart, Histogram, Scatter Diagram, Control Chart - Deming‘s Quality Principles - Continuous
Improvement through Plan Do Check Act (PDCA) process - Quality Management Systems: Terms -
Elements - Key to Quality management - QMS for software
Total Periods :9
TEXT BOOKS

1.KshirasagarNaik, PriyadarshiTripathy, ―Software Testing and Quality Assurance -Theory and

Practice‖, John Wiley & Sons publication, 2011
2. William E.Lewis, ―Software Testing and Continuous Quality Improvement‖, Auerbach Publications,
Third edition, 2011.
3. Alan C Gillies, ―Software Quality Theory and Management‖, Cengage Learning, Second Edition,
2011
REFERENCE BOOKS

1.Ron Patton, ―Software testing‖, Second edition, Pearson Education, 2007

2.Elfriede Dustin, Jeff Rashka, John Paul, ―Automated Software Testing: Introduction, Management and
Performance‖, Addison- Wesley, 1999

166 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 20CS8902 INFORMATION STORAGE AND RETRIEVAL L T P S C
ASSESSMENT TYPE TYPE -1 3 0 0 1 3
OBJECTIVES

To study research methods and literature in information storage and retrieval systems, including
analyzing, indexing, representing, storing, searching, retrieving, processing, and presenting information
and documents using fully automatic systems.
COURSE OUTCOMES
Students will be able to
1.Determine storage requirements for a data center
2. Compute disk performance of storage arrays.
3. Design storage solutions based on application needs.
4. Understand different Information retrieval model.
5. Understand the methods of the information retrieval model.
UNIT 1 - INTRODUCTION TO INFORMATION STORAGE
INTRODUCTION TO INFORMATION STORAGE: Information Storage, Evolution of Storage
Architecture, Data Center Infrastructure, Virtualization and Cloud Computing. DATA CENTER
ENVIRONMENT-I: Application, Database Management System (DBMS), Host (Compute), Connectivity,
Storage
Total Periods :9
UNIT 2 - DATA CENTER ENVIRONMENT-II
DATA CENTER ENVIRONMENT-II: Disk Drive Components, Disk Drive Performance, Host Access to
Data, Direct-Attached Storage , Storage Design Based on Application Requirements and Disk
Performance, Disk Native Command Queuing, Introduction to Flash Drives, Concept in Practice:
VMware ESXi.
Total Periods :9
UNIT 3 - DATA PROTECTION
DATA PROTECTION-RAID: RAID Implementation Methods , RAID Array Components, RAID
Techniques , RAID Levels , RAID Impact on Disk Performance, RAID Comparison, Hot Spares.
INTELLIGENT STORAGE SYSTEMS: Components of an Intelligent Storage System, Storage
Provisioning, Types of Intelligent Storage Systems, Concepts in Practice: EMC Symmetric and VNX.
Total Periods :9
UNIT 4 - INTRODUCTION TO FORMATION RETRIEVAL
Information retrieval process, Indexing, Informationretrieval model, Boolean retieval model. Dictionary
and PostingsTokenization, Stop words, Stemming, Invertedindex, Skip pointers, Phrasequeries

Total Periods :9
UNIT 5 - DICTIONARIES AND TOLERANT RETRIEVAL

167 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
Wild card queries, Permuterm index, Bigram index,Spelling correction, Edit distance,
Jaccardcoefficient, SoundexWild card queries, Permuterm index, Bigram index,Spelling correction, Edit
distance,Jaccard,coefficient, Sounde
Total Periods :9
TEXT BOOKS

1.G.Somasundaram, A.Shrivastava, ―Information Storage and Management: Storing, Managing and

Protecting Digital Semester - VI 211 G V P College of Engineering (Autonomous) 2016 IT Information
in Classic, Virtualized and Cloud Environment‖, 2nd Edition, Wiley publication, 2012
2.Introduction to Information Retrieval by Christopher D. Manning
REFERENCE BOOKS

1.Robert Spalding, ―Storage Networks: The Complete Reference‖, 1stEdition, Tata McGraw
Hill/Osborne,2003.Natural Language Processing And Information Retrieval by Tanveer Siddiqui and
U. S Tiwary
2. William M. Newman and Robert F.Sproull, ―Principles of Interactive Computer Graphics‖, McGrawHill
1978.

168 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 20CS8903 DESIGN PATTERNS L T P S C
ASSESSMENT TYPE TYPE -1 3 0 0 1 3
OBJECTIVES

To understand how to apply the pattern based analysis and design to the software to be
developed. Understands design patterns and the structure of design patterns.
COURSE OUTCOMES
Students will be able to
1. Understand the core concepts of computer science and engineering.
2. Identify the appropriate design patterns to solve object oriented design problems.
3. Develop design solutions using creational patterns
4. Apply structural patterns to solve design problems
5. Construct design solutions by using behavioral patterns.
UNIT 1 - INTRODUCTION
What Is a Design Pattern?, Design Patterns in Smalltalk MVC, Describing Design Patterns, The Catalog
of Design Patterns, Organizing the Catalog, How Design Patterns Solve Design Problems, How to Select
a Design Pattern, How to Use a Design Pattern
Total Periods :9
UNIT 2 - A CASE STUDY
Designing a Document Editor: Design Problems, Document Structure, Formatting, Embellishing the User
Interface, Supporting Multiple Look-and-Feel Standards, Supporting Multiple Window Systems, User
Operations Spelling Checking and Hyphenation.
Total Periods :9
UNIT 3 - CREATIONAL PATTERNS
Abstract Factory, Builder, Factory Method, Prototype, Singleton.

Total Periods :9

UNIT 4 - STRUCTURAL PATTERNS

Adapter, Bridge, Composite, Decorator, Façade, Flyweight, Proxy.

Total Periods :9

UNIT 5 - BEHAVIORAL PATTERNS

Chain of Responsibility, Command, Interpreter, Iterator, Mediator, Memento, Observer, Strategy,
Template Method, Visitor. Conclusion: What to Expect from Design Patterns, The Pattern Community.

Total Periods :9
169 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
TEXT BOOKS

1.Design Patterns By Erich Gamma, Pearson Education

2. Design Patterns Explained By Alan Shalloway , Pearson Education..
3. Meta Patterns designed by Wolf gang, Pearson.

REFERENCE BOOKS

1.Head First Design Patterns By Eric Freeman-Oreilly-sp

2. JAVA Enterprise Design Patterns Vol-III By Mark Grand ,Wiley DreamTech.
3. Pattern‟s in JAVA Vol-I By Mark Grand, Wiley DreamTech.
4. Pattern‟s in JAVA Vol-II By Mark Grand, Wiley DreamTech.

170 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 DESIGN OF NETWORK L T P S C
20CS8904
ROUTER
ASSESSMENT TYPE TYPE -1 3 0 0 1 3
OBJECTIVES

To configure, maintain, and troubleshoot network devices using appropriate network tools and
understand the features and purpose of network.
COURSE OUTCOMES
Students will be able to
1.Understand Various Routing Protocols
2. Understand and Apply the basic concepts of Internet Routing and Router Architectures
3. Analyze various Network Algorithms
4. Design QoS based Routing
5. Apply Routing and Traffic Engineering concepts
UNIT 1 - ROUTING PROTOCOLS: FRAMEWORK AND PRINCIPLES
Routing Protocol‐ Routing Algorithm‐ and Routing Table‐ Routing Information Representation and
Protocol Messages‐ Distance Vector Routing Protocol‐ Link State Routing Protocol‐ Path
Vector Routing Protocol‐ Link Cost.
Total Periods :9
UNIT 2 - INTERNET ROUTING AND ROUTER ARCHITECTURES
Architectural View of the Internet‐ Allocation of IP Prefixes and AS Number‐ Policy Based Routing‐
Point of Presence‐ Traffic Engineering Implications‐ Internet Routing Instability. Router
Architectures: Functions‐ Types‐ Elements of a Router‐ Packet Flow‐ Packet Processing: Fast
Path versus Slow Path‐ Router Architectures
Total Periods :9
UNIT 3 - ANALYSIS OF NETWORK ALGORITHMS
Network Bottleneck‐Network Algorithmics‐ Strawman solutions‐ ThinkingAlgorithmically‐ Refining the Algor
ithm‐ Cleaning up‐ Characteristics of Network Algorithms. IP Address Lookup Algorithms : Impact‐
Address Aggregation‐ Longest Prefix Matching‐ Naïve Algorithms‐ Binary ‐ Multibit and
Compressing Multibit Tries‐ Search by Length Algorithms‐
Search by Value Approaches‐ Hardware Algorithms‐ Comparing Different Approaches IP Packet
Filtering and Classification : Classification‐ Classification Algorithms‐ Naïve Solutions‐ Two‐
Dimensional Solutions‐ Approaches for d Dimensions
Total Periods :9
UNIT 4 - QUALITY OF SERVICE ROUTING
QoS Attributes‐ Adapting Routing: A Basic Framework. Update Frequency‐ Information
Inaccuracy‐ and Impact on Routing‐ Dynamic Call Routing in the PSTN‐ Heterogeneous Service‐
Single‐Link Case‐ A General Framework for Source‐ Based QoS Routing with Path Caching ‐
Routing Protocols for QoS Routing.
Total Periods :9

171 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 UNIT 5 - ROUTING AND TRAFFIC ENGINEERING
Traffic Engineering of IP/MPLS Networks‐ VPN Traffic Engineering‐ Problem
Illustration: Layer 3 VPN‐ LSP Path Determination: ConstrainedShortest Path Approach‐ LSP Path Determi
nation: Network Flow Modeling Approach‐ Layer 2 VPN Traffic Engineering‐ Observations and
General Modeling Framework‐ Routing/Traffic Engineering for Voice Over MPLS – Case Study-CISCO
Router Design.
Total Periods :9
TEXT BOOKS

1. Network Routing: Algorithms, Protocols, and Architectures Deepankar Medhi and Karthikeyan
Ramasamy (Morgan Kaufmann Series in Networking)
REFERENCE BOOKS

1.Network Algorithmics: An Interdisciplinary Approach to Designing Fast Networked Devices George

Varghee (Morgan Kaufma Series in Networking)
2.TCP/IP Protocol Suite, (B.A. Forouzum) Tata McGraw Hill Edition, Third Edition
3.TCP/IP Volume 1,2,3 (N. Richard Steveus Addison Wesley)
4. Computer Networks (A.S. Tanenbaum) Pearson Edition, 4th Edition

172 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 20CS8905 SOFTWARE DEFINED NETWORKS L T P S C
ASSESSMENT TYPE TYPE -1 3 0 0 1 3
OBJECTIVES

To analyse the flexibility and scalability of using SDN in terms of innovation and network
management. Plan, configure and troubleshoot OF switches, controllers and SDN networks.
COURSE OUTCOMES
Students will be able to
1. Learn the fundamentals of software defined networks.
2. Understand the separation of the data plane and the control plane.
3. Provide the SDN Solutions for Data Center Network
4.Explain the use of SDN in the current networking scenario
5.Design and develop various applications of SDN
UNIT 1 - INTRODUCING SDN
SDN Origins and Evolution – Introduction – Why SDN? - Centralized and Distributed Control and Data
Planes - The Genesis of SDN.
Total Periods :9
UNIT 2 - SDN ABSTRACTIONS
How SDN Works - The Openflow Protocol - SDN Controllers: Introduction - General Concepts -
VMware - Nicira - VMware/Nicira - OpenFlow-Related - Mininet - NOX/POX - Trema - Ryu - Big Switch
Networks/Floodlight - Layer 3 Centric - Plexxi - Cisco OnePK
Total Periods :9
UNIT 3 - PROGRAMMING SDN'S
Network Programmability - Network Function Virtualization - NetApp Development, Network Slicing.
Total Periods :9
UNIT 4 - SDN APPLICATIONS AND USE CASES
SDN in the Data Center - SDN in Other Environments - SDN Applications - SDN Use Cases - The
Open Network Operating System 3.
Total Periods :9
UNIT 5 - SDN'S FUTURE PERSPECTIVES
SDN Open Source - SDN Futures - Final Thoughts and Conclusions.
Total Periods :9
TEXT BOOKS

1.Software Defined Networks: A Comprehensive Approach by Paul Goransson and Chuck Black,
Morgan Kaufmann Publications, 2014
2.SDN - Software Defined Networks by Thomas D. Nadeau & Ken Gray, O'Reilly, 2013

173 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
REFERENCE BOOKS

1. Software Defined Networking with OpenFlow By SiamakAzodolmolky, Packt Publishing, 2013

2. Feamster, Nick, Jennifer Rexford, and Ellen Zegura. "The road to SDN: an intellectual history of
Programmable networks." ACM SIGCOMM Computer Communication Review 44.2 (2014): 87-98.
3. Kreutz, Diego, et al. "Software-defined networking: A comprehensive survey." Proceedings of the
IEEE 103.1 (2015): 14-76.
4. Nunes, Bruno AA, et al. "A survey of software-defined networking: Past, present, and future of
Programmable networks." Communications Surveys & Tutorials, IEEE 16.3 (2014): 1617-1634

174 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 20CS8906 SYSTEM SOFTWARE L T P S C
ASSESSMENT TYPE TYPE -1 3 0 0 1 3
OBJECTIVES

To understand the relationship between system software and machine introduction to System
Software and software tools.
COURSE OUTCOMES
Students will be able to
1. Understand the relationship between system software and machine architecture.
2. Design and implement assemblers
3.design and implement linkers and loaders.
4. Understand microprocessors.
5.understand system software tools
UNIT 1 - INTRODUCTION
System software and machine architecture – The Simplified Instructional Computer
(SIC) - Machine architecture - Data and instruction formats - addressing modes -
instruction sets - I/O and programming.
Total Periods :9
UNIT 2 - ASSEMBLERS
Basic assembler functions - A simple SIC assembler – Assembler algorithm and data
structures - Machine dependent assembler features - Instruction formats and addressing
modes – Program relocation - Machine independent assembler features - Literals –
Symbol-defining statements – Expressions - One pass assemblers and Multi pass
assemblers - Implementation example - MASM assembler.
Total Periods :9
UNIT 3 - LOADERS AND LINKERS
Basic loader functions - Design of an Absolute Loader – A Simple Bootstrap Loader -
Machine dependent loader features - Relocation – Program Linking – Algorithm and
Data Structures for Linking Loader - Machine-independent loader features - Automatic
Library Search – Loader Options - Loader design options - Linkage Editors – Dynamic
Linking – Bootstrap Loaders - Implementation example - MSDOS linker.
Total Periods :9
UNIT 4 - MACRO PROCESSORS
Basic macro processor functions - Macro Definition and Expansion – Macro Processor
Algorithm and data structures - Machine-independent macro processor features -
Concatenation of Macro Parameters – Generation of Unique Labels – Conditional Macro
Expansion – Keyword Macro Parameters-Macro within Macro-Implementation example -
MASM Macro Processor – ANSI C Macro language.
Total Periods :9
175 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 UNIT 5 - SYSTEM SOFTWARE TOOLS
Text editors - Overview of the Editing Process - User Interface – Editor Structure. -
Interactive debugging systems - Debugging functions and capabilities – Relationship
with other parts of the system – User-Interface Criteria.
Total Periods :9
TEXT BOOKS

1. Leland L. Beck, ―System Software – An Introduction to Systems Programming‖, 3rd Edition, Pearson
Education Asia, 2010.
REFERENCE BOOKS

1. D. M. Dhamdhere, ―Systems Programming and Operating Systems‖, Second Revised Edition, Tata
McGraw- Hill, 2000.
2. John J. Donovan ―Systems Programming‖, Tata McGraw-Hill Edition, 2000.
3. John R. Levine, Linkers & Loaders – Harcourt India Pvt. Ltd., Morgan Kaufmann Publishers, 2000

176 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 20CS8907 EMBEDDED SYSTEM DEVELOPMENT L T P S C
ASSESSMENT TYPE TYPE -1 3 0 0 1 3
OBJECTIVES

To enable the students to understand embedded-system programming and apply that knowledge
to design and develop embedded solutions. interaction with peripheral devices.
COURSE OUTCOMES
Students will be able to
1.Understand the basics of embedded systems
2.Understand embedded design lifecycle
3.Gain knowledge on embedded OS
4. Understand the various programming concepts used in the field of Embedded Systems.
5.Design embedded applications using data structures
UNIT 1 – INTRODUCTION
Introduction – Issues in Real Time Computing – Structure of a Real Time System – Task classes –
Performance Measures for Real Time Systems – Estimating Program Run Times – Task Assignment
and Scheduling – Classical uni processor scheduling algorithms – Uni processor scheduling of IRIS
tasks – Task assignment – Mode changes and Fault Tolerant Scheduling.
Total Periods :9
UNIT 2 - EMBEDDED DESIGN LIFE CYCLE
Embedded Design life cycle – Product specification – Hardware / Software partitioning – Detailed
hardware and software design – Integration – Product testing – Selection Processes – Microprocessor
Vs Micro Controller – Performance tools – Bench marking – RTOS Micro Controller – Performance
tools – Bench marking – RTOS availability – Tool chain availability – Other issues in selection
processes.
Total Periods :9
UNIT 3 - EMBEDDED OS FUNDAMENTALS
Introduction: Operating System Fundamentals, General and Unix OS architecture Embedded Linux.
Booting Process in Linux GNU Tools: gcc, Conditional Compilation, Preprocessor directives, Command
line arguments, Make files EMBEDDED C PROGRAMMING
Total Periods :9
UNIT 4 – HEADING
Review of data types –scalar types-Primitive types-Enumerated types-sub ranges Structure types
character strings –arrays- Functions introduction to Embedded C- Introduction, Data types Bit
manipulation, Interfacing C with Assembly. Embedded programming issues - Re-entrancy, Portability,
Optimizing and testing embedded C programs
Total Periods :9
UNIT 5 - EMBEDDED APPLICATIONS USING DATA STRUCTURES

177 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
Linear data structures– Stacks and Queues Implementation of stacks and Queues- Linked List -
Implementation of linked list, Sorting, Searching, Insertion and Deletion, Nonlinear structures.

Total Periods :9
TEXT BOOKS

1.GNU/Linux application programming, Jones, M Tim, Dreamtech press, New Delhi

2.Embedded / Real-Time Systems: concepts, design and programming--The Ultimate Reference,
Prasad K.V.K.K, DREAMTECH PRESS, NEW DELHI
3.Beginning J2ME-From Novice to Professional-3rd Edition , Sing Li and Jonathan Knudsen,Dreamtech
Press,New Delhi
4. http://nptel.ac.in/

178 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 20CS8908 COMPUTER GRAPHICS L T P S C
ASSESSMENT TYPE TYPE -1 3 0 0 1 3
OBJECTIVES

To provide the necessary theoretical background and demonstrates the application of computer
science to graphics.
COURSE OUTCOMES
Students will be able to
1. Design two dimensional graphics in model environments.
2. Design three dimensional graphics in real time applications.
3. Design Illumination and colour models in applications.
4. Apply clipping techniques to graphics.
5.Design animation sequences for given scenarios
UNIT 1 - INTRODUCTION
Survey of computer graphics, Overview of graphics systems – Video display devices, Raster scan
systems, Random scan systems, Graphics monitors and Workstations, Input devices, Hard copy
Devices, Graphics Software; Output primitives – points and lines, line drawing algorithms, loading the
frame buffer, line function; circle and ellipse generating algorithms; Pixel addressing and object
geometry, filled area primitives.
Total Periods :9
UNIT 2 - TWO DIMENSIONAL GRAPHICS
Two dimensional geometric transformations – Matrix representations and homogeneous coordinates,
composite transformations; Two dimensional viewing – viewing pipeline, viewing coordinate reference
frame; widow-to-viewport coordinate transformation, Two dimensional viewing functions; clipping
operations – point, line, and polygon clipping algorithms.
Total Periods :9
UNIT 3 - THREE DIMENSIONAL GRAPHICS
Three dimensional concepts; Three dimensional object representations – Polygon surfaces- Polygon
tables- Plane equations – Polygon meshes; Curved Lines and surfaces, Quadratic surfaces; Blobby
objects; Spline representations – Bezier curves and surfaces -B-Spline curves and surfaces.
TRANSFORMATION AND VIEWING: Three dimensional geometric and modelling transformations –
Translation, Rotation, Scaling, composite transformations; Three dimensional viewing – viewing
pipeline, viewing coordinates, Projections, Clipping; Visible surface detection methods.
Total Periods :9
UNIT 4 - ILLUMINATION AND COLOUR MODELS
Light sources – basic illumination models – halftone patterns and dithering techniques; Properties of
light – Standard primaries and chromaticity diagram; Intuitive colour concepts – RGB colour model –
YIQ colour model – CMY colour model – HSV colour model – HLS colour model; Colour selection.
Total Periods :9
179 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 UNIT 5 - ANIMATIONS & REALISM 10 ANIMATION GRAPHICS HEADING
Design of Animation sequences – animation function – raster animation – key frame systems – motion
specification –morphing – tweening. COMPUTER GRAPHICS REALISM: Tiling the plane – Recursively
defined curves – Koch curves – C curves – Dragons – space filling curves – fractals – Grammar based
models – fractals – turtle graphics – ray tracing.
Total Periods :9
TEXT BOOKS

1. John F. Hughes, Andries Van Dam, Morgan Mc Guire ,David F. Sklar , James D.
Foley, Steven K. Feiner and Kurt Akeley ,‖Computer Graphics: Principles and
Practice‖, , 3rd Edition, Addison- Wesley Professional, 2013. (UNIT I, II, III, IV).
2. Donald Hearn and Pauline Baker M, ―Computer Graphics‖, Prentice Hall, New Delhi,
2007 (UNIT V).

REFERENCE BOOKS

1. Hill F S Jr., ―Computer Graphics‖, Maxwell Macmillan‖ , 1990.

2.Peter Shirley, Michael Ashikhmin, Michael Gleicher, Stephen R Marschner, Erik Reinhard, Kelvin
Sung, and AK Peters, Fundamental of Computer Graphics, CRC Press, 2010.
3. William M. Newman and Robert F.Sproull, ―Principles of Interactive Computer
Graphics‖, Mc GrawHill 1978.
4.http://nptel.ac.in/

180 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 OPEN ELECTIVES

FUNDAMENTALS OF SOFTWARE L T P S C
20CS6801 ENGINEERING

ASSESSMENT TYPE TYPE -1 2 0 0 1 2

OBJECTIVES

To provide the idea of decomposing the given problem into Analysis, Design, Implementation,
Testing and Maintenance phases.
COURSE OUTCOMES
Students will be able to
1. Compare different process models.
2. Concepts of requirements engineering and Analysis Modelling.
3. Apply systematic procedure for software design and deployment.
4. Compare and contrast the various testing and maintenance.
5. Manage project schedule, estimate project cost and effort required.
UNIT 1 - SOFTWARE PROCESS AND DEVELOPMENT METHODOLOGY
The Nature of Software - Software Engineering Practice - Software Myths –Sequential Model -
Prototyping Model - RAD Model - Evolutionary Software Process Models - Incremental model - Spiral
model, Agile Development – Extreme Programming(XP) – Scrum
Total Periods :9
UNIT 2 - SYSTEM ENGINEERING
Functional and non-functional requirements –Requirements Engineering: Feasibility Studies Elicitation
- Analysis and Negotiation - Validation - Management, Software Requirement Specification (SRS), Petri
nets, Data Dictionary.
ANALYSIS MODELING: Elements of the Analysis Model, Data Modeling, Control Flow Diagram, Data
Flow Diagrams, Metrics.
Total Periods :9
UNIT 3 - DESIGN CONCEPTS AND ARCHITECTURAL DESIGN
Design Process, Concepts and Models, Software Architecture: Architectural Styles - Architectural
Design - Architectural Mapping using Data Flow – User Interface Design - Structural Partitioning -
Functional Independence - Cohesion - Coupling - Software Engineering Practice - Core Principles -
Coding Principles and Concepts.
Total Periods :9
UNIT 4 - SOFTWARE TESTING AND MAINTENANCE
Introduction to Testing, Test Driven Development, Coding Software Testing Fundamentals - Internal
and External Views of Testing - Testing Strategies: Unit Testing - Integration Testing –Regression
Testing Validation and System Testing, The Art of Debugging. Reengineering process model-Reverse
and Forward Engineering.
181 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 Total Periods :9

UNIT 5 - SOFTWARE QUALITY ASSURANCE

Estimation Function Point and COCOMO I. and COCOMO II. Quality Concepts, Cost of Quality,
Software Quality Group (SQA),Roles and Responsibilities of SQA Group, Formal Technical Reviews,
Quality Standards

Total Periods :9
TEXT BOOKS

1. Roger S. Pressman, ―Software Engineering – A Practitioner‗s Approach‖, McGraw Hill, Singapore,

2014.
2. Ian Sommerville, ―Software Engineering‖, Addison Wesley, New Delhi, 2015.

182 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 20CS6802 PROGRAMMING IN JAVA L T P S C
ASSESSMENT TYPE TYPE -1 2 0 0 1 2
OBJECTIVES

To understand and write programs in java.

COURSE OUTCOMES
Students will be able to
1. To understand the basic concepts of java
2. To understand the concepts of Inheritance, Exception and Packages in java
3. To understand the concepts of exception handling and I/O streams in java
4. To understand the concepts of multi-threading and string handling in java
5. To understand the concepts AWT and Swing
UNIT 1 - INTRODUCTION TO JAVA FUNDAMENTALS
Program structure in Java – Data types, variables, and operators – Control statements – Classes and
Objects – Methods – Arrays

Total Periods :9
UNIT 2 - INHERITANCE, INTERFACES, AND PACKAGES
Inheritance – process of inheritance - Types of inheritance – access control – Super keyword – Method
overriding - Abstract classes and methods- Final methods and classes. Interfaces – Declaration of
interface - Implementing interface – Multiple interface – Nester interface – Inheritance of interface.
Package – Defining package – Importing packages.
Total Periods :9
UNIT 3 - EXCEPTION HANDLING AND I/O STREAMS
Exceptions - Exception hierarchy – try, catch, and finally blocks – throws and throw - Multiple catch
clauses – Custom exceptions – Checked and unchecked exceptions – Nested try and catch blocks –
Rethrowing exception. Input / Output Basics – Streams – Byte streams and Character streams –
Reading and Writing Console – Reading and Writing Files.
Total Periods :9
UNIT 4 - MULTITHREADING AND STRING HANDLING
Multithreading –Thread life cycle - Creation of New Threads – Thread priority – Synchronization - Inter-
thread communication – Suspending, Resuming, and Stopping of Threads. String handling – String
class – Methods for extracting Characters, Comparing strings, Modifying Strings, and Searching strings
– String Buffer – String Builder.
Total Periods :9
UNIT 5 - EVENT HANDLING, AWT AND SWING
Event handling - Hierarchy of event classes – Event Listener Interfaces Adapter Classes. AWT –
Hierarchy of AWT classes – Components – Lables – Button – Checkbox - TextField. Swing – Layout
management – Swing Components – Text Fields , Text Areas – Buttons- Check Boxes – Radio Buttons
– Lists- choices- Scrollbars – Windows –Menus – Dialog Boxes.

183 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 Total Periods :9
TEXT BOOKS

1. Herbert Schildt, ―Java The complete reference‖, 11th Edition, McGraw Hill Education, 2019.

REFERENCE BOOKS

1. Paul Deitel, Harvey Deitel, ―Java SE 8 for programmers‖, 3rd Edition, Pearson, 2015.
2. Steven Holzner, ―Java 2 Black book‖, Dreamtech press, 2011.
3. Timothy Budd, ―Understanding Object-oriented programming with Java‖, Updated Edition, Pearson
Education, 2000.

184 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 20CS7801 FUNDAMENTALS OF DATABASE SYSTEM L T P S C
ASSESSMENT TYPE TYPE -1 2 0 0 1 2
OBJECTIVES

To understand the basic database concepts and applications.

COURSE OUTCOMES
Students will be able to
1. Use the basic concepts of Database Systems in Database design
2. Apply SQL queries to interact with Database
3. Design a Database using ER Modelling
4. Apply normalization on database design to eliminate anomalies
5. Analyze database transactions and can control them by applying ACID properties
UNIT 1 - INTRODUCTION
INTRODUCTION: Introduction and applications of DBMS, Purpose of data base, Data, Independence,
Database System architecture- Levels, Mappings, Database, users and DBA
DATABASE DESIGN: Database Design Process, ER Diagrams - Entities, Attributes, Relationships,
Constraints, keys, extended ER features, Generalization, Specialization, Aggregation, Conceptual
design with the E-R model.
Total Periods :9
UNIT 2 - THE RELATIONAL MODEL
Inheritance – process of inheritance - Types of inheritance – access control – Super keyword – Method
overriding - Abstract classes and methods- Final methods and classes. Interfaces – Declaration of
interface - Implementing interface – Multiple interface – Nester interface – Inheritance of interface.
Package – Defining package – Importing packages.
Total Periods :9
UNIT 3 - SQL
SQL: Basics of SQL, DDL, DML,DCL, structure – creation, alteration, defining constraints – Primary
key, foreign key, unique, not null, check, IN operator, Functions - aggregate functions, Built-in functions
– numeric, date, string functions, set operations, sub-queries, correlated sub-queries, Use of group by,
having, order by, join and its types, Exist, Any, All , view and its types. transaction control commands –
Commit, Rollback, Save point, cursors, stored procedures,Triggers
Total Periods :9
UNIT 4 - NORMAL FORMS
SCHEMA REFINEMENT AND NORMAL FORMS: Introduction to schema refinement, functional
dependencies, reasoning about FDs. Normal forms: 1NF, 2NF, 3NF, BCNF, properties of
decompositions, normalization, schema refinement in database design, case studies.
Total Periods :9
UNIT 5 - TRANSACTIONS MANAGEMENT

185 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
TRANSACTIONS MANAGEMENT: Transaction concept, transaction state, implementation of atomicity
and durability, concurrent executions, Serializability, recoverability, implementation of isolation,
transaction definition in SQL, testing for Serializability.

CONCURRENCY CONTROL AND RECOVERY SYSTEM: Concurrency control, lock based protocols,
time-stamp based protocols, validation based protocols, multiple granularity. Recovery system - failure
classification, storage structure, recovery and atomicity, log- based recovery, shadow paging, buffer
management, failure with loss of non-volatile storage, advanced recovery techniques, remote backup
systems.

OVERVIEW OF STORAGE AND INDEXING: Tree structured indexing - intuition for tree indexes,
indexed sequential access method (ISAM), B+ Trees - a dynamic tree structure.

Total Periods :9
TEXT BOOKS

1.Abraham Silberschatz, Henry F. Korth, S. Sudarshan (2005), Database System Concepts, 5th edition,
McGraw-Hill, New Delhi,India.
REFERENCE BOOKS

1. Elmasri Navate, Fundamentals of Database Systems, Pearson Education,India.

2.Raghurama Krishnan, Johannes Gehrke , Database Management Systems, 3rd edition, Tata McGraw
Hill,NewDelhi,India.
3.Peter Rob, Carlos Coronel (2009), Database Systems Design, Implementation and Management,
7thedition

186 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 L T P S C
20CS7802 CLOUD COMPUTING FUNDAMENTALS

ASSESSMENT TYPE TYPE -1 2 0 0 1 2

OBJECTIVES

To provide insights into the fundamentals of cloud computing along with virtualization concepts.

COURSE OUTCOMES
Students will be able to
1. To understand the characteristics and components of a Cloud
2. To understand the security issues threatening the usage of cloud
3. To understand the services provided by cloud architecture
4. To learn about various cloud simulators
5. To learn the basics and working of VMWare Simulator
UNIT 1 - CLOUD COMPUTING OVERVIEW
Origins of Cloud computing – Cloud components - Essential characteristics – On-demand self service,
Broad network access, Location independent resource pooling ,Rapid elasticity , Measured service,
Comparing cloud providers with traditional IT service providers, Roots of cloud computing.
Total Periods :9
UNIT 2 - CLOUD SECURITY
Cloud Insights Architectural influences – High-performance computing, Utility and Enterprise grid
computing, Cloud scenarios – Benefits: scalability ,simplicity ,vendors ,security, Limitations – Sensitive
information - Application development- security level of third party - security benefits, Regularity issues:
Government policies.

Total Periods :9
UNIT 3 - CLOUD ARCHITECTURE AND FEATURES
Cloud Architecture- Layers and Models Layers in cloud architecture, Software as a Service (SaaS),
features of SaaS and benefits, Platform as a Service ( PaaS ), features of PaaS and benefits,
Infrastructure as a Service ( IaaS), features of IaaS and benefits, Service providers, challenges and
risks in cloud adoption. Cloud deployment model: Public clouds – Private clouds – Community clouds -
Hybrid clouds - Advantages of Cloud computing.
Total Periods :9

UNIT 4 - CLOUD SIMULATORS

Cloud Simulators- CloudSim and GreenCloud Introduction to Simulator, understanding CloudSim
simulator, CloudSim Architecture(User code, CloudSim, GridSim, SimJava) Understanding Working
platform for CloudSim, Introduction to GreenCloud .

Total Periods :9

187 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 UNIT 5 - INTRODUCTION TO VMWARE SIMULATOR
Basics of VMWare, advantages of VMware virtualization, using Vmware workstation, creating virtual
machines-understanding virtual machines, create a new virtual machine on local host, cloning virtual
machines, virtualize a physical machine, starting and stopping a virtual machine.
Total Periods :9
TEXT BOOKS

1. Cloud computing a practical approach - Anthony T.Velte , Toby J. Velte Robert Elsenpeter, TATA
McGraw- Hill , New Delhi – 2010
2.Cloud Computing: Web-Based Applications That Change the Way You Work and Collaborate, Online
-Michael Miller - Que 2008
REFERENCE BOOKS

1.Cloud computing for dummies- Judith Hurwitz , Robin Bloor , Marcia Kaufman ,Fern Halper, Wiley
Publishing, Inc, 2010
2.Cloud Computing (Principles and Paradigms), Edited by Rajkumar Buyya, James Broberg, Andrzej
Goscinski, John Wiley & Sons, Inc. 2011

188 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 ENTERPRISE RESOURCE PLANNING L T P S C
20CS8801
ASSESSMENT TYPE TYPE -1 2 0 0 1 2
OBJECTIVES

To understand the business process of an enterprise and to grasp the activities of erp project
management cycle.

COURSE OUTCOMES
Students will be able to
1. To understand the basics of data warehousing and data mining concepts
2. To understand the ERP implementation life cycle.
3. To create awareness of core and extended modules of ERP
4. To understand ERP market place and dynamics
5. To understand ERP in E-business solutions

UNIT 1 - RP AND TECHNOLOGY

Introduction – Related Technologies – Business Intelligence – E-Commerce and E-Business –
Business Process Reengineering – Data Warehousing – Data Mining – OLAP – Product life Cycle
management – SCM – CRM
Total Periods :9
UNIT 2 - ERP IMPLEMENTATION
Implementation Challenges – Strategies – Life Cycle – Pre-implementation Tasks –Requirements
Definition – Methodologies – Package selection – Project Teams – Process Definitions – Vendors and
Consultants – Data Migration – Project management – Post Implementation Activities.
Total Periods :9
UNIT 3 - ERP IN ACTION & BUSINESS MODULES
Operation and Maintenance – Performance – Maximizing the ERP System – Business Modules –
Finan1e – Manufacturing – Human Resources – Plant maintenance – Materials Management – Quality
management – Marketing – Sales, Distribution and service
Total Periods :9
UNIT 4 - ERP MARKET
Marketplace – Dynamics – SAP AG – Oracle – PeopleSoft – JD Edwards – QAD Inc – SSA Global –
Lawson Software – Epicor – Intutive

Total Periods :9
UNIT 5 - ENTERPRISE APPLICATION
Enterprise Application Integration – ERP and E-Business – ERP II – Total quality management – Future
Directions – Trends in ERP.

Total Periods :9
189 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
TEXT BOOKS

1. Alexis Leon, ―ERP DEMYSTIFIED‖, Tata McGraw Hill, Second Edition, 2008.

REFERENCE BOOKS

1. Jim Mazzullo,‖SAP R/3 for Everyone‖, Pearson,2007.

2. Jose Antonio Fernandz, ― The SAP R /3 Handbook‖, Tata McGraw Hill, 1998.
3. Biao Fu, ―SAP BW: A Step-by-Step Guide‖, First Edition, Pearson Education, 200

190 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
 INFORMATION SECURITY FUNDAMENTALS L T P S C
20CS8802
ASSESSMENT TYPE TYPE -1 2 0 0 1 2
OBJECTIVES

To study the basic cryptographic algorithms and the existing scenario of various vulnerabilities and
threats of programs and networks so as to explore the efficient and respective techniques that can
provide application security.
COURSE OUTCOMES
Students will be able to
1. Understand and explain the risks faced by computer systems and networks.
2. Study of various algorithms and their implementation details
3. Understand various existing software security and threats.
4. Develop security mechanisms to protect computer systems and networks.
5. Use cryptography algorithms and protocols to achieve application security

UNIT 1 - INTRODUCTION TO INFORMATION SECURITY AND CONVENTIONAL CRYPTOGRAPHIC

TECHNIQUES
Introduction to Information Security : Critical Characteristics of Information, NSTISSC Security Model,
Components of an Information System, Securing the Components, Balancing Security and Access,
SDLC, Security SDLCAttacks, Vulnerability, Security Goals, Security Services and mechanisms.
Total Periods :9
UNIT 2 - CONVENTIONAL CRYPTOGRAPHIC TECHNIQUES & AUTHENTICATION AND DIGITAL
SIGNATURES
Conventional Cryptographic Techniques : Conventional substitution and transposition ciphers, One-
time Pad, Block cipher and Stream Cipher, Steganography Symmetric and Asymmetric Cryptographic
Techniques : DES, AES, RSA algorithms Authentication and Digital Signatures : Use of Cryptography
for authentication, Secure Hash function, Key management – Kerberos
Total Periods :9
UNIT 3 - PROGRAM SECURITY
Nonmalicious Program errors – Buffer overflow, Incomplete mediation, Time-of-check to Time-of- use
Errors, Viruses, Trapdoors, Salami attack, Man-in-the- middle attacks, Covert channels Information
Security Threats: Viruses, Worms and other malware, Email Threats, Web Threats, RFID, Identity
Theft, Data Security Breaches, Hacking Tools and Techniques.
Total Periods :9
UNIT 4 - SECURITY IN NETWORKS

191 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)
Security in Networks : Threats in networks, Network Security Controls – Architecture, Encryption,
Content Integrity, Strong Authentication, Access Controls, Wireless Security, Honeypots, Traffic flow
security, Firewalls – Design and Types of Firewalls, Personal Firewalls, IDS, Email Security –
PGP,S/MIME ]
Total Periods :9
UNIT 5 - APPLICATION SECURITY
Application Security: Email Security, Web Security, and Database Security, Secure Software
Development, VoIP Security.

Total Periods :9
TEXT BOOKS

1.Security in Computing, Fourth Edition, by Charles P. Pfleeger, Pearson Education

REFERENCE BOOKS

1. Cryptography And Network Security Principles And Practice, Fourth or Fifth Edition, William
Stallings, Pearson
2. Modern Cryptography: Theory and Practice, by Wenbo Mao, Prentice Hall
3. Network Security Essentials: Applications and Standards, by William Stallings. Prentice Hall.

192 | P a g e K . R A M A K R I S H N A N C O L L E G E O F T E C H N O L O G Y
(AUTONOMOUS)