SAGI RAMA KRISHNAM RAJU ENGINEERING COLLEGE (AUTONOMOUS)

(Affiliated to JNTUK, Kakinada), (Recognized by AICTE, New Delhi)

UG Programmes CE, CSE, ECE, EEE, IT & ME are Accredited by NBA, Accredited by NAAC with A+
CHINNA AMIRAM (P.O):: BHIMAVARAM :: W.G.Dt., A.P., INDIA :: PIN: 534 204
Estd:1980

Regulation: R20 II / IV - B.Tech. I - Semester

CSE (IoT AND CYBER SECURITY INCLUDING BLOCK CHAIN TECHNOLOGY)
SCHEME OF INSTRUCTION & EXAMINATION
(With effect from 2022-23 admitted Batch onwards)
Course Catego Int. Ext. Total
Course Name Cr L T P
Code ry Marks Marks Marks
Numerical Methods & Vector
B20BS2101 BS 3 3 0 0 30 70 100
Calculus
Mathematical Foundations of
B20BS2103 ES 3 3 0 0 30 70 100
Computer Science
Micro Processors & Micro
B20CI2101 ES 3 3 0 0 30 70 100
Controllers
B20CS2103 Operating Systems PC 3 3 0 0 30 70 100

B20CI2102 Java Programming PC 3 3 0 0 30 70 100

DLD & Micro Controllers
B20CI2103 PC 1.5 0 0 3 15 35 50
interfacing Lab
B20CI2104 OS&UNIX Programming Lab PC 1.5 0 0 3 15 35 50

B20CI2105 Java Programming Lab PC 1.5 0 0 3 15 35 50

Free and Open Source
B20CI2106 Software SOC 2 1 0 2 -- 50 50
(Skill Oriented Course)
Professional Ethics and
B20MC2102 MC 0 2 0 0 -- -- --
Human Values
TOTAL 21.5 18 0 11 195 505 700

Page 1 of 42
 Code Category L T P C I.M E.M Exam
B20BS2101 BS 3 -- -- 3 30 70 3 Hrs.

NUMERICAL METHODS & VECTOR CALCULUS

(Common to CE, CIC, CSD, CSE, EEE & IT)
Pre-requisites: Basic concepts of calculus.
Course Objectives: Students are expected to learn
Numerical methods to solve algebraic and transcendental equations and the concept of
1 interpolation and its use for equally and unequally spaced data points,
2 Methods for numerical evaluation of integrals and for solving first order ODEs.
3 Concepts of double, triple integrals and its applications.
4 Concepts of Gradient, divergence, curl.
5 Vector integral theorems.

Course Outcomes: At the end of the course students will be able to

Knowledge
S. No OUTCOME
Level
Determine the real root of an algebraic or transcendental equation. Fit an
1 interpolation formula and perform interpolation for equally spaced and K3
unequally spaced data.
Evaluate numerically certain definite integrals. Solve a first order ordinary
2 K3
differential equation by Euler and RK methods.
3 Evaluate double integrals and determine the areas. K3
4 Evaluate triple integrals and determine the volumes. K3
5 Find the gradient of a scalar function, divergence and curl of a vector function. K3
6 Solve simple problems using vector integral theorems. K3

SYLLABUS
Solution of Algebraic and Transcendental Equations:
Introduction, Bisection method, Method of false position, Iteration method &Newton-
Raphson method.
UNIT-I
Interpolation: Introduction, forward differences, backward differences, and Central
(10 Hrs)
differences. Differences of a polynomial, Newton’s forward, and backward interpolation
formulae. Interpolation with unequal intervals: Newton’s divided difference and
Lagrange interpolation formulae.

Numerical Integration and solution of Ordinary Differential equations:

UNIT-II Trapezoidal rule, Simpson’s 1/3rd rule, Solution of first order ordinary differential
(10 Hrs) equations subjected to initial conditions by Taylor’s method, Picard’s method, Euler’s
method,Modified Euler’s method and Fourth order Runge-Kutta method.

UNIT-III Multiple integrals: Double and triple integrals, Change of order of integration. Change
(12 Hrs) of variables, applications to find Areas and Volumes.
Page 2 of 42
UNIT-IV Vector differentiation: Scalar and vector point functions, Vector Differentiation,
(10 Hrs) Gradient, Directional derivative, Divergence, Curl, Scalar Potential.

Vector Integration: Line integral, Work done; Area, Surface and volume integrals,
UNIT-V
Vector integral theorems: Greens, Stokes, and Gauss Divergence theorems (without
(14 Hrs)
proof).

TEXTBOOKS:
Scope and Treatment as in “Higher Engineering Mathematics”, by Dr.B.S.Grewal, 43rd Edition,
1.
Khanna Publishers.

REFERENCE BOOKS:
1. Advanced Engineering Mathematics, by Erwin Kreyszig,Wiley
2. Higher Engineering Mathematics, by B.V.Ramana, Tata Mc Graw Hill Company.
A text book of Engineering Mathematics, by N.P.Bali and Dr. Manish Goyal, Lakshmi
3.
Publications.
4. Peter O’ Neil, Advanced Engineering Mathematics, Cengage.
5. Advanced Engineering Mathematics, by H.K.Dass, S.Chand Company.

Page 3 of 42
 Subject Code Category L T P C I.M E.M Exam
B20BS2103 ES 3 -- -- 3 30 70 3 Hrs.

MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE

(Common to AIDS, CSD, CIC)
Course Objectives: Students are expected to
1 Understand the propositional and predicate calculus.
2 Know about the concepts of counting techniques.
3 Identify various types of relations and discuss their properties.
4 Learn about different binary operations and Algebraic structures
5 Know about generating functions and methods of solving recurrence relations
6 Have an idea on the concepts of Graph theory & Tree structures

Course Outcomes: At the end of the course students will be able to

Knowledge
S. No OUTCOME
Level
Write and verify the arguments for their validity using propositional and predicate
1 K3
logic.
2 Utilize different counting methods in their fields of study. K3
3 Make use of various types of relations and their properties. K3
4 Identify different Lattices and Boolean expressions. K3
5 Formulate and solve the recurrence relations. K3
6 Utilize the concepts in graphs and trees. K3

SYLLABUS
Mathematical Logic: Propositional Calculus: Statements and Notations, Connectives,
Well-formed Formulae, Truth Tables, Tautologies, Equivalence of Formulas, Duality
UNIT-I
Law, Normal Forms, Theory of Inference for Statement Calculus, Consistency of
(10 Hrs)
Premises. Predicate Calculus: Predicative Logic, Statement Functions, Variables and
Quantifiers, Freeand Bound Variables, Inference Theory for Predicate Calculus.

Combinatorics: Basics of Counting, Permutations, Permutations with Repetitions,

UNIT-II Circular Permutations, Restricted Permutations, Combinations, Restricted Combinations,
(10 Hrs) Generating Functions of Permutations and Combinations, Binomial and Multinomial
Theorems, Binomial and Multinomial Coefficients, Principles of Inclusion–Exclusion.

Relations, Lattices & Boolean Algebra:

Relations: Definition of Relation, Properties of Binary Relations, Relation matrix and
UNIT-III diagraph, Operations on Relations, Transitive Closure, Warshall’s algorithm, Equivalence
(10 Hrs) and Compatibility relations, Partial Ordering Relations, Hasse Diagrams.
Lattices & Boolean Algebra: Lattices and their properties, different types of lattices,
Boolean algebra- Boolean expressions, truth tables and karnaugh maps

Page 4 of 42
 Recurrence Relations: Generating Functions, Partial Fractions, Calculating Coefficient
UNIT-IV of Generating Functions, Recurrence Relations, Formulation as Recurrence Relations,
(10 Hrs) Solving Recurrence Relations by Substitution and Generating Functions, Method of
Characteristic Roots, Solving Inhomogeneous Recurrence Relations

Graph Theory: Basic Concepts of Graphs, Sub graphs, Isomorphism of Graphs, Paths and
Circuits, Eulerian and Hamiltonian Graphs, Multigraphs, Bipartite graphs, Planar Graphs,
UNIT-V
Euler’s Formula.
(10 Hrs)
Trees: Definition of Tree, properties of Trees, Different tree structures, Binary trees,
Spanning trees, Minimal Spanning Trees, Kruskal’s and Prim’s Algorithms.

Text Books:
Discrete Mathematical Structures with Applications to Computer Science, J. P. Tremblay andP.
1.
Manohar, Tata McGraw Hill.
Discrete Mathematics for Computer Scientists and Mathematicians, J. L. Mott, A. Kandel,
2.
T.P.Baker, 2nd Edition, Prentice Hall of India
Reference Books:
Elements of Discrete Mathematics-A Computer Oriented Approach, C. L. Liu and D.P.
1.
Mahopatra, 3rd Edition, Tata McGraw Hill.
Discrete Mathematics and its Applications with Combinatorics and Graph Theory, K. H. Rosen,
2.
7th Edition, Tata McGraw Hill.
3. Discrete Mathematical Structures, Bernand Kolman, Robert C. Busby, Sharon Cutler Ross, PHI.
4. Discrete Mathematics, S. K. Chakraborthy and B.K. Sarkar, Oxford, 2011.

Page 5 of 42
Subject Code Category L T P C I.M E.M Exam
B20CI2101 ES 3 -- -- 3 30 70 3 Hrs.

MICRO PROCESSORS & MICRO CONTROLLERS

(For CIC)
Course Objectives: Students are expected to
Gain an in-depth understanding of the operation of microprocessors and micro controllers,
1
machine language programming & interfacing techniques with peripheral devices
2 Learn the concept of designing computer organization and architecture
Gain an understanding of applications of microprocessors in designing processor-based automated
3
electronics system

Course Outcomes: At the end of the course students will be able to

Knowledge
S. No OUTCOME
Level
1 Explain the internal organization and operation of microprocessors/microcontrollers K2
2 Construct a Program on 8086 Microprocessor for application specific solution K3
3 Design microprocessors/microcontrollers – IO interfacing based systems K4
4 Design 8051 and PIC Microcontrollers based programming for specific applications K4
Implement and develop embedded systems applications based on microprocessors/
5 K4
microcontrollers

SYLLABUS

Introduction to Microprocessors, Microcontrollers and system design Assembly and High-

UNIT-I
Level Language programming System Development Environment: assembler, compiler
(10Hrs)
and integrated development environment.

8086 Microprocessor Architecture and Programming of 8086 microprocessor: pipelining,

UNIT-II
Instruction sets, addressing modes Memory addressing, decoding and Memory interfacing
(10 Hrs)
Interrupts and interrupts handling

UNIT-III I/O and Bus Interfacing Interfacing methods 8255 PPI interface, 8254 timer interface,
(10 Hrs) 8259 PIC and DMA controller interface Bus Interface

8051 Microcontroller Introduction to single chip Microcontrollers, Intel MCS-51 family

UNIT-IV
features 8051/8031-architecture 8051 assembly language programming, addressing modes
(10 Hrs)
Programming interrupts, timers and serial communication system design with 8051.

Introduction to Embedded Systems, Microprocessors and Microcontrollers System level

UNIT-V interfacing design; Advanced Microprocessor Architectures- 286, 486, Pentium;
(10 Hrs) Microcontrollers 8051 systems; Introduction to RISC processors; ARM microcontrollers;
Embedded system design methodologies, embedded controller design for communication,

Page 6 of 42
 digital control.

Text Books:
Microprocessor Architecture, Programming, and Applications with the 8085 Ramesh S. Gaonkar,
1.
4th Edition, Penram International, 1999
BARRY B. BREY, The Intel Microprocessors 8086/8088, 80186/80188,80286,80386 and 80486,
2. Pentium, Pentium Pro Processor, Pentium II, Pentium III, Pentium 4, Architecture, Programming
and Interfacing, 6th Edition, Pearson Education Inc., 2003
The 80x86 Family, Design, Programming and Interfacing, John E.Uffenbeck, 3rd Edition, Pearson
3.
Education Inc., 2002

Reference Books:
Kennath J. Ayla, “The 8051 Micro controller”, Thomson Learning, 3rd edition, 2004, ISBN-
1.
140186158X.
Mohammad Ali Mazidi and Janice Gillispie Maszidi “The 8051 Microcontroller and Embedded
2.
Systems’ Pearson education, 2003, ISBN-978813171026, 2nd Edition

Page 7 of 42
 Subject Code Category L T P C I.M E.M Exam
B20CS2103 PC 3 -- -- 3 30 70 3 Hrs.

OPERATING SYSTEMS
(Common to CIC, CSE)
Course Objectives: Students are expected to
1 Introduce to the internal operation of modern operating systems
Define, explain, processes and threads, mutual exclusion, CPU scheduling, deadlock,
2
memory management, and file systems
3 Understand File Systems in Operating System like UNIX/Linux and Windows
Understand Input Output Management and use of Device Driver and Secondary Storage
4
(Disk) Mechanism
5 Analyze Security and Protection Mechanism in Operating System

Course Outcomes: At the end of the course students will be able to

Knowledge
S. No OUTCOME
Level
Describe various generations of Operating System and functions of Operating
1 K2
System, System calls
Describe the concept of process, threads and analyze various CPU
2 K2
Scheduling Algorithms and IPC
3 Illustrate memory management strategies K3
4 Illustrate deadlocks, files and Secondary-Storage Structure K3
Summarize Security and Protection Mechanism in Operating Systems.
5 K3
Understand the Operating System like UNIX/Linux and Windows

SYLLABUS
Operating Systems Overview: Operating system functions, Operating system structure,
Operating systems operations, Computing environments, Open-Source Operating
UNIT-I Systems.
(10Hrs) System Structures: Operating System Services, User and Operating-System Interface,
systems calls, Types of System Calls, system programs, operating system structure,
operating system debugging, System Boot.

Process Concept: Process scheduling, Operations on processes, Inter-process

communication, Communication in client server systems.
Multithreaded Programming: Multithreading models, Thread libraries, Threading
issues.
UNIT-II Process Scheduling: Basic concepts, Scheduling criteria, Scheduling algorithms,Multiple
(10 Hrs) processor scheduling, Thread scheduling.
Inter-process Communication: Race conditions, Critical Regions, Mutual exclusion with
busy waiting, Sleep and wakeup, Semaphores, Mutexes, Monitors, Message passing,
Barriers, Classical IPC Problems - Dining philosophers problem, Readers and writers
problem
Page 8 of 42
 Memory-Management Strategies: Introduction, Swapping, Contiguous memory
allocation, Paging, Segmentation.
UNIT-III
Virtual Memory Management: Introduction, Demand paging, Copy on-write, Page
(10 Hrs)
replacement, Page replacement Algorithms, Frame allocation, Thrashing, Memory-
mapped files, Kernel memory allocation.

Deadlocks: Resources, Conditions for resource deadlocks, Deadlock detection and

recovery, Deadlock avoidance, Deadlock prevention.
UNIT-IV File Systems: Files, Directories, File system implementation, management and
(10 Hrs) optimization.
Secondary-Storage Structure: Overview of disk structure, and attachment, Disk
scheduling, RAID structure, Stable storage implementation.

System Protection: Goals of protection, Principles and domain of protection, Access

UNIT-V matrix, Access control, Revocation of access rights.
(10 Hrs) System Security: Introduction, Program threats, System and network threats.
Case Studies: Linux, Microsoft Windows..

Text Books:
1. Silberschatz A, Galvin P B, and Gagne G, Operating System Concepts, 9th edition, Wiley, 2013.
Tanenbaum A S, Modern Operating Systems, 3rd edition, Pearson Education, 2008. (for
2.
Interprocess Communication and File systems.)
Reference Books:
Dhamdhere D M, Operating Systems A Concept Based Approach, 3rd edition, Tata McGraw-
1.
Hill, 2012.
Stallings W, Operating Systems -Internals and Design Principles, 6th edition, Pearson
2.
Education, 2009
3. Nutt G, Operating Systems, 3rd edition, Pearson Education, 2004
e-Resources
1. https://nptel.ac.in/courses/106/105/106105214/

Page 9 of 42
Subject Code Category L T P C I.M E.M Exam
B20CI2102 PC 3 -- -- 3 30 70 3 Hrs.

JAVA PROGRAMMING
(For CIC)
Course Objectives: Students are expected to
1 Identify Java language components and how they work together in applications
Learn the fundamentals of object-oriented programming in Java, including defining classes,
2
invoking methods, using class libraries.
Learn how to extend Java classes with inheritance and dynamic binding and how to use
3
exception handling in Java applications
4 Understand how to design applications with threads in Java.
5 Understand how to use Java JDBC APIs for program development.

Course Outcomes: At the end of the course students will be able to

Knowledge
S. No OUTCOME
Level
Illustrate the syntax and semantics of java programming language and basic
1 K3
concepts of OOP.
2 Relate array data structure and string manipulation operations K3
Develop reusable programs using the concepts of inheritance, interfaces and
3 K3
packages
Apply the concept of Exception handing and multithreading to build an
4 K3
efficient and error free code.
Develop a program that manages input & output streams and apply JDBC to
5 K3
interface with database.

SYLLABUS
Introduction to JAVA: Structure of JAVA, Features of JAVA, JAVA Tokens,
CommandLine Arguments, Operators, Type Casting, Control Statements.
UNIT-I Classes &Objects, Constructors: Introduction, Class Declaration and Modifiers,
(10Hrs) ClassMembers, Declaration of Class Objects, method overloading.
Constructors: Default Constructor, Parameterized Constructor, Copy Constructor and
Constructor Overloading, This Keyword.

Arrays& Vectors: Introduction, Declaration and Initialization of Arrays, Storage of

Array in Computer Memory, Accessing Elements of Arrays, Operations on Array
Elements, Assigning Array to Another Array, Two-dimensional Arrays, Three-dimensional
UNIT-II
Arrays,
(10 Hrs)
Vectors: Introduction to vectors, Vector methods.
String Handling in Java: Introduction, methods in String Class, Methods for comparison
ofStrings, String Buffer class.

UNIT-III Inheritance: Introduction, Types of Inheritances, Single inheritance, Multi-level

(10 Hrs) inheritance, Hierarchical Inheritance, Hybrid Inheritance and Multiple inheritance, Method
Page 10 of 42
 Overriding, Super Keyword, Final Keyword, Abstract Classes.
Interfaces and Packages: Introduction, Declaration of Interface, Implementing Interfaces,
Extending interfaces, Default Methods in Interfaces, Static Methods in Interface.
Packages: Introduction, Defining Package, Importing Packages, Access Modifiers.

Exception Handling: Introduction, Hierarchy of Standard Exception Classes, Keywords

throws and throw, try, catch, and finally Blocks, Multiple Catch Statements, Class
UNIT-IV Throwable, Custom Exceptions, Nested try and catch Blocks.
(10 Hrs) Multithreaded Programming: Introduction, Need for Multiple Threads, Thread class,
Thread Life Cycle, Extending Thread class, Implementing Runnable interface, Thread
Priorities, Inter-thread communication.

File IO: Introduction, IO classes and interfaces, Stream classes, Byte Streams, the character
Streams.
UNIT-V Java Database Connectivity: Introduction, Structure of JDBC, JDBC Architecture, Types
(10 Hrs) of JDBC Drivers, JDBC API (java.sql package), Connecting to the Database, JAVA
Database connection program for MS-Access, Oracle and MySQL, JDBC Batch
Processing.

Text Books:
Core Java Volume I--Fundamentals: 1 (Core Series)11thedition (2020) by Cay Horstmann,
1.
Publisher: Pearson
2. The complete Reference Java, 12th edition (2021), Herbert Scheldt, Publisher: TMH.
JDBC API Tutorial and Reference 3E(2003), by Maydene, Jon Ellis (Author), Jonathan Bruce,
3.
Publisher : Addison-Wesley Professional
Reference Books:
1. Introduction to java programming, 9th edition(2014) by Y Daniel Liang, Publisher: Pearson
2. Murach's Java Programming, 5th edition (2017) Joel Murach , Publisher: Mike Murach
3. JAVA one step ahead, 1stedition (2017) Anitha Seth, B.L. Juneja, Oxford.
Java: A Beginner's Guide, Eighth Edition 8th Edition (2018)by Herbert Scheldt, Publisher:
4.
McGraw-Hill Education
Head First Java 3e (2021) (A Brain Friendly Guide) by Kathy Sierra & Bert bates, Publisher:
5.
O′Reilly
6. Programming With Java: A Primer 6E(2019)By Balagurusamy, Publisher: TMH.
e-Resources
1. https://nptel.ac.in/courses/106/105/106105191/
2. https://www.coursera.org/learn/java-introduction
3. https://docs.oracle.com/javase/tutorial/
4. https://www.linkedin.com/in/jamesgosling
5. https://en.wikipedia.org/wiki/James_Gosling#Books

Page 11 of 42
 Subject Code Category L T P C I.M E.M Exam
B20CI2103 PC -- -- 3 1.5 15 35 3 Hrs.

DLD & MICRO CONTROLLERS INTERFACING LAB

(For CIC)
Course Objectives: Students are expected to
1 Introduce the concept of digital and binary systems.
2 Develop programs for Combinational circuits
3 Develop assembly language programing for various applications

Course Outcomes: At the end of the course students will be able to

Knowledge
S. No OUTCOME
Level
Understand, analyze and design the basic digital circuits and any digital design in
1 K4
real time applications.
2 Developing assembly langue programming or specific applications K4
3 Developing 8051 interfacing with IO peripheral for specific applications K4

LIST OF PROGRAMS
1 Verification of Basic Logic Gates.
2 Implementing all individual gates with Universal Gates NAND & NOR
Design a circuit for the given Canonical form, draw the circuit diagram and verify the De-
3
Morgan laws.
4 Design a Combinational Logic circuit for 8x1 MUX and verify the truth table.
5 Construct Half Adder and Full Adder using Half Adder and verify the truth table
6 Design a 4-bit Adder/Subtractor.
7. Design and realization of 4-bit comparator.
8086 Program list
1 8086 ALP to find the largest number and smallest element in the given array
2 8086 ALP to find the factorial using procedure
3 8086 ALP to copy string S1 to S2
4 8086 ALP to separation even numbers and odd numbers
5 8086 to sort an array of N-integers
6 8086 program to linear search
7. 8086 ALP to convert Binary to BCD number
8. 8086 ALP to convert BCD to Binary number
8051 microcontroller interfacing with IO peripheral device
1 Traffic Light Controller interface
2 Matrix display interface
3 Stepper motor controller
4 Elevator Interface
5 Traffic Light Controller interface

Page 12 of 42
Reference Books:
Microprocessor Architecture, Programming, and Applications with the 8085 Ramesh S. Gaonkar,
1. th
4 Edition, Penram International, 1999
BARRY B. BREY, The Intel Microprocessors 8086/8088, 80186/80188,80286,80386 and 80486,
2. Pentium, Pentium Pro Processor, Pentium II, Pentium III, Pentium 4, Architecture, Programming
and Interfacing, 6th Edition, Pearson Education Inc., 2003
rd
3. The 80x86 Family, Design, Programming and Interfacing, John E.Uffenbeck, 3 Edition,
Pearson Education Inc., 2002
Kennath J. Ayla, “The 8051 Micro controller”, Thomson Learning, 3rd edition, 2004, ISBN-
4.
40186158X.
Mohammad Ali Mazidi and Janice Gillispie Maszidi “The 8051 Microcontroller and Embedded
5.
Systems’ Pearson education, 2003, ISBN-978813171026, 2nd Edition

Page 13 of 42
 Subject Code Category L T P C I.M E.M Exam
B20CI2104 PC -- -- 3 1.5 15 35 3 Hrs.

OS & UNIX PROGRAMMING LAB

(For CIC)
Course Objectives: Students are expected to
1 Understand the design aspects of operating system
2 Study the process management concepts & Techniques
3 Study the storage management concepts
4 Familiarize students with the Linux environment
5 Learn the fundamentals of shell scripting/programming

Course Outcomes: At the end of the course students will be able to

Knowledge
S. No OUT COME
Level
1 Apply Unix utilities and perform basic shell control of the utilities K3
2 Apply the Unix file system and file access control K3
3 Use of an operating system to develop software K4
4 Use Linux environment efficiently K3
5 Solve problems using bash for shell scripting K3

LIST OF PROGRAMS
Study of Unix/Linux general purpose utility command list: man,who,cat, cd, cp, ps, ls, mv, rm,
mkdir, rmdir, echo, more, date, time, kill, history, chmod, chown, finger, pwd, cal, logout,
shutdown.
1 Study of vi editor.
Study of Bash shell, Bourne shell and C shell in Unix/Linux operating system
Study of Unix/Linux file system (tree structure)
Study of .bashrc, /etc/bashrc and Environment variables.
2 Write a C program that makes a copy of a file using standard I/O, and system calls
3 Write a C program to emulate the UNIX ls– lcommand.
Write a C program that illustrates how to execute two commands concurrently with a command
4
pipe. Ex: - ls–l |sort
Simulate the following CPU scheduling algorithms:
5
Round Robin (b) SJF (c) FCFS (d) Priority
Multi programming - Memory management-Implementation of fork (), wait (), exec() and exit,
6
System calls
Simulate the following:
7. Multi programming with a fixed number of tasks (MFT)
Multi programming with a variable number of tasks(MVT)
8. Simulate Bankers Algorithm for Dead Lock Avoidance
9. Simulate Bankers Algorithm for Dead Lock Prevention.
Simulate the following page replacement algorithms:
10
a) FIFO b) LRU c) LFU

Page 14 of 42
 Simulate the following File allocation strategies
11
a) Sequenced (b) Indexed (c)Linked
12 Write a C program that illustrates two processes communicating using shared memory.
13 Write a C program to simulate producer and consumer problem using semaphores.
14 Write C program to create a thread using pthreads library and let it run its function.
15 Write a C program to illustrate concurrent execution of threads using pthreads library.

Reference Books:
1. Silberschatz A, Galvin P B, and Gagne G, Operating System Concepts, 9th edition, Wiley, 2013.
Tanenbaum A S, Modern Operating Systems, 3rd edition, Pearson Education, 2008. (for
2.
Interprocess Communication and File systems.)
Dhamdhere D M, Operating Systems A Concept Based Approach, 3rd edition, Tata McGraw-Hill,
3.
2012.
Stallings W, Operating Systems -Internals and Design Principles, 6th edition, Pearson
4.
Education,2009
5. Nutt G, Operating Systems, 3rd edition, Pearson Education, 2004
6. Stephen G. KOchan, Patick Wood. UNIX Shell Programming, 3rd edition, SAMS , 2003
e-Resources
1 https://nptel.ac.in/courses/106/105/106105214/

Page 15 of 42
Subject Code Category L T P C I.M E.M Exam
B20CI2105 PC -- -- 3 1.5 15 35 3 Hrs.

JAVA PROGRAMMING LAB

(For CIC)
Course Objectives: Students are expected to
1 Practice programming in the Java
2 Gain knowledge of object-oriented paradigm in the Java programming language
3 Learn use of Java in a variety of technologies and on different platforms

Course Outcomes: At the end of the course students will be able to

Knowledge
S. No OUTCOME
Level
Develop simple programs using command line arguments, arrays, vectors and
1 K4
strings.
2 Demonstrate Classes, Objects, Constructors, Methods and Runtime Polymorphism. K3
Develop reusable programs using the concepts of inheritance, interfaces and
3 K4
packages.
4 Develop Applications using exception handing and multithreading. K4
5 Apply the concepts of Java IO Files and database in real time problem solving. K3

LIST OF PROGRAMS
Exercise - 1 (Basics)
1 a) Write a JAVA program to display default value of all primitive data types of JAVA.
b) Write a JAVA program using Command line arguments
Exercise - 2 (Classes, Objects, Constructors)
a) Write a JAVA program to implement Classes and Objects.
2 b) Write a JAVA program implement method overloading.
c) Write a JAVA program to implement constructor overloading.
d) Write a JAVA program to implement this keyword.
Exercise - 3 (Arrays, Vectors, Strings)
a) Write a JAVA program to implement Matrix Multiplication.
3 b) Write a JAVA program to implement Vector Operations.
c) Write a JAVA program to implement String Operations.
d) Write a JAVA program to implement StringBuffer class.
Exercise – 4 (Inheritance)
a) Write a JAVA program to implement Single Inheritance.
4 b) Write a JAVA program to implement multilevel Inheritance.
c) Write a java program for abstract class to find areas of different shapes.
d) Write a JAVA program to implement “super” keyword.
Exercise - 5 (Interfaces, Packages)
a) Write a JAVA program to implement Interface.
5 b) Write a JAVA program to implement simple Packages.
c) Write a JAVA program to access package from another package.
d) Write a JAVA program to implement sub Packages.
Page 16 of 42
 Exercise - 6 (Exception Handling)
a) Write a JAVA program to implement the following Built in Exceptions.
i) Arithmetic Exception.
ii) Array Index Out Of Bounds Exception
6
iii) Number Format Exception.
iv) Null Pointer Exception.
b) Write a JAVA program to implement multiple catch statements.
c) Write a JAVA program to implement user defined Exception.
Exercise – 7 (Multithreading)
a) Write a JAVA program that creates threads by extending Thread class .First thread display
“Good Morning “every 1 sec, the second thread displays “Hello “every 2 seconds and the third
7. display “Welcome” every 3 seconds .
b) Write a JAVA program to implement Runnable Interface.
c) Write a program to implement priorities to Thread.
d) Write a JAVA program to implement Thread Synchronization(Multiplication tables)
Exercise - 8 (File IO)
a) Write a JAVA program to copy contents of file into another using Byte Oriented IO.
8. b) Write a JAVA program to copy contents of file into another using Character Oriented IO.
c) Write a JAVA program to display contents of file using Line Oriented IO.
d) Write a JAVA program to convert the values into tokens using Scanner class.
Exercise - 9 (JDBC)
a) Write a JDBC program to insert data into database.
9. b) Write a JDBC program to delete data from database.
c) Write a JDBC program to update data into database.
d) Write a JDBC program to retrieve data from database.

Reference Books:
Core Java Volume I--Fundamentals: 1 (Core Series) 11th Edition(2020) by Cay Horstmann,
1.
Publisher: Pearson
2. The complete Reference Java, 12th edition (2021), Herbert Schildt, Publisher: TMH.
JdbcApi Tutorial and Reference 3rd Edition(2003), by Maydene , Jon Ellis (Author), Jonathan
3.
Bruce, Publisher : Addison-Wesley Professional
4. Introduction to java programming, 9th Edition(2014) by Y Daniel Liang, Publisher: Pearson
5. Murach's Java Programming, 5th Edition(2017) Joel Murach , Publisher: Mike Murach
6. JAVA one step ahead, First Edition (2017)Anitha Seth, B.L.Juneja, Oxford.
7. Programming With Java:A Primer 6th Edition(2019) By Balagurusamy,Pubisher:TMH.
e-Resources
1 https://nptel.ac.in/courses/106/105/106105191/
2 https://www.coursera.org/learn/java-introduction
3 https://docs.oracle.com/javase/tutorial/
4 https://www.linkedin.com/in/jamesgosling
5 https://en.wikipedia.org/wiki/James_Gosling#Books

Page 17 of 42
 Subject Code Category L T P C I.M E.M Exam
B20CI2106 SOC 1 -- 2 2 -- 50 3 Hrs.

FREE AND OPEN SOURCE SOFTWARE

(Skill Oriented Course)
(For CIC)
Course Objectives: The students should be made to
1. Be exposed to the context and operation of free and open source software (FOSS) communities
and associated software .projects.
2. Be familiar with participating in a FOSS project
3. Learn scripting language like Python or Perl
4. Learn programming language like Ruby
5. Learn some important FOSS tools and techniques

Course Outcomes: At the end of the course students will be able to

Knowledge
S. No OUTCOME
Level
1. Understand the Open source environment. K2
2. Use Linux commands to manage files and file systems. K3
3. Use Shell scripting to perform system configuration and GIT Repository. K3
4. Understand server side scripting with simple php application. K2

LIST OF PROGRAMS
Getting started with Linux basic commands and directory structure, execute file, directory
1
operations.
Linux commands for redirection, pipes, filters, job control, file ownership, file permissions, links
2
andfile system hierarchy.
Shell Programming: Write shell script to show various system configuration like
1 Currently logged user and his log name
2 Your current shell
3 Your home directory
3
4 Your operating system type
5 Your current path setting
6 Your current working directory
7 Show Currently logged number of users
Write shell script to show various system configuration like
1. About your OS and version, release number, kernel version
2. Show all available shells
3. Show mouse settings
4
4. Show computer CPU information like processor type, speed etc.
5. Show memory information
6. Show hard disk information like size of hard-disk, cache memory, model etc.
7. File system (Mounted)
5 Shell script program for scientific calculator.
6 Version Control System setup and usage using GIT.
Page 18 of 42
 1. Creating a repository.
2. Checking out a repository.
3. Adding content to the repository.
4. Committing the data to a repository
Shell script to implement a script which kills every process which uses more than as pecified
7.
value ofmemory or CPU and is run upon system start.
8. Running PHP: simple applications like login forms after
9. Advanced linux commands curl, wget, ftp, ssh and grep
Installing various software packages. Either the package is yet to be installed or an older version
10. exists. The student can practice installing the latest version. Of course, this might need Internet
access

Reference Books:
Ellen Siever, Stephen Figgins, Robert Love, Arnold Robbins, “Linux in a Nutshell”, Sixth Edition,
1.
OReilly Media, 2009.
e-Resources:
1 Philosophy of GNU URL: http://www.gnu.org/philosophy/.
2 Linux Administration URL: http://www.tldp.org/LDP/lame/LAME/linux-admin-made-easy/.
3 Philosophy of GNU URL: http://www.gnu.org/philosophy/.

Page 19 of 42
 Code Category L T P C I.M E.M Exam
B20MC2102 MC 2 -- -- -- -- -- --

PROFESSIONAL ETHICS AND HUMAN VALUES

(Common to AIDS, CIC, CSBS, CE, EEE & ME)
Course Objectives:
1. To create an awareness on Engineering Ethics and Human Values.
2. To instill Moral and Social Values and Loyalty.
3. To appreciate the rights of others.
4. To create awareness on assessment of safety and risk.

Course Outcomes: At the end of the course students will be able to

Knowledge
S. No Outcome
Level
Identify and analyze an ethical issue in the subject matter under
investigation or in a relevant field. Demonstrate knowledge of ethical
1. K2
values in non-classroom activities, such as service learning, internships and
field work.
Identify the multiple ethical interests at stake in a real-world situation or
2. practice and Articulate what makes a particular course of action ethically K2
defensible
3. Assess their own ethical values and the social context of problems K3
Identify ethical concerns in research and intellectual contexts, including
4. academic integrity, use and citation of sources, the objective presentation K3
of data, and the treatment of human subjects.
Integrate, synthesize, and apply knowledge of ethical dilemmas and
5. resolutions in academic settings, including focused and interdisciplinary K4
research.

SYLLABUS
Human Values: Morals, Values and Ethics-Integrity-Work Ethic-Service learning
UNIT-I Civic Virtue Respect for others Living Peacefully Caring Sharing Honesty -Courage-
(8 Hrs) Cooperation Commitment Empathy Self Confidence Character Spirituality.

Engineering Ethics: Senses of 'Engineering Ethics-Variety of moral issued- Types

of inquiry Moral dilemmas Moral autonomy- Kohlberg's theory-Gilligan’s Theory
UNIT-II
-Consensus and controversy Models of professional roles-Theories about right
(8 Hrs)
action-Self-interest - Customs and religion Uses of Ethical theories Valuing time
Cooperation Commitment.

Engineering as Social Experimentation: Engineering As Social Experimentation-

UNIT-III Framing the problem- Determining the facts codes of Ethics- Clarifying Concepts-
(8 Hrs) Application issues Common Ground -General Principles- Utilitarian thinking
respect for persons.

Page 20 of 42
 Engineers Responsibility for Safety and Risk: Safety and risk Assessment of safety
UNIT-IV and risk. Risk benefit analysis and reducing risk Safety and the Engineer-
(8 Hrs) Designing for the safety- Intellectual Property rights(IPR)

Global Issues: Globalization- Cross-culture issues-Environmental Ethics- Computer

UNIT-V Ethics Computers as the instrument of Unethical behavior Computers as the object
(8 Hrs) of Unethical acts Autonomous Computers-Computer codes of Ethics- Weapons
Development –Ethics and Research Analyzing Ethical Problems in research.

Reference Books:
"Engineering Ethics includes Human Values" by M.Govindarajan, S.Natarajan- and,
1. V.S.Senthil Kumar-PHI Learning Pvt Ltd-2009.
"Engineering Ethics" by Harris, Pritchard and Rabins, CENGAGE Learning, India Edition,
2.
2009.
"Ethics in Engineering" by Mike W. Martin and Roland Schinzinger - Tata McGraw-Hill-
3.
2003.
"Professional Ethics and Morals" by Prof.A.R.Aryasri, DhanikotaSuyodhana-Maruthi
4. Publications.
"Professional Ethics and Human Values" by A.Alavudeen, R.Kalil Rahman and
5. M.JayakumaranLaxmi Publications
6. "Professional Ethics and Human Values" by Prof.D.R.Kiran
7. "Indian Culture, Values and Professional Ethics" by PSR Murthy- BS Publication.
8. Professional Ethics by R. Subramaniam - Oxford publications, New Delhi.

Page 21 of 42
 SAGI RAMA KRISHNAM RAJU ENGINEERING COLLEGE (AUTONOMOUS)
(Affiliated to JNTUK, Kakinada), (Recognized by AICTE, New Delhi)
UG Programmes CE,CSE,ECE,EEE,IT & ME are Accredited by NBA, Accredited by NAAC with A+
CHINNA AMIRAM (P.O):: BHIMAVARAM :: W.G.Dt., A.P., INDIA :: PIN: 534 204
Estd:1980

Regulation: R20 II / IV - B. Tech. II - Semester

CSE (IoT AND CYBER SECURITY INCLUDING BLOCK CHAIN TECHNOLOGY)
SCHEME OF INSTRUCTION & EXAMINATION
(With effect from 2021-22 admitted Batch onwards)
Catego Int. Ext. Total
Course Code Course Name Cr L T P
ry Marks Marks Marks

B20BS2201 Probability and Statistics BS 3 3 0 0 30 70 100

Data Base Management
B20CS2201 PC 3 3 0 0 30 70 100
Systems
Computer Organization and
B20CI2201 PC 3 3 0 0 30 70 100
Architecture
Formal Languages and
B20CI2202 PC 3 3 0 0 30 70 100
Automata Theory
Managerial Economics and
B20HS2201 HS 3 3 0 0 30 70 100
Financial Accountancy
Data Base Management
B20CS2204 PC 1.5 0 0 3 15 35 50
Systems Lab
B20CS2205 R Programming Lab PC 1.5 0 0 3 15 35 50
Computer Organization &
B20CI2203 PC 1.5 0 0 3 15 35 50
Architecture Lab
Android Application
B20CI2204 Development SOC 2 1 0 2 -- 50 50
(Skill Oriented Course)
B20MC2201 English Proficiency MC 0 2 0 0 -- -- --

TOTAL 21.5 18 0 11 195 505 700

Page 22 of 42
 Code Category L T P C I.M E.M Exam
B20BS2201 BS 3 -- -- 3 30 70 3 Hrs.

PROBABILITY AND STATISTICS

(Common to AIDS, AIML, CIC & CSE)
Course Objectives: Students are expected to
1 Have an idea of data science and single and joint random variables.
2 Learn the concept of mathematical expectation, generating functions and their properties.
3 Fit a linear or nonlinear curve for a data using method of least squares.
4 Know about the correlation coefficient and regression lines.
5 Analyse various statistical measures of a few discrete and continuous probability distributions.
6 Develop a framework for testing of hypothesis in giving inferences about Population parameters.

Course Outcomes: At the end of the course students will be able to

Knowledge
S. No Outcome
Level
Understand the concepts of data science and identify a random variable as
1 K3
discrete/continuous and analyse it.
Determine statistical measures like Mean, Variance and generating functions in
2 K3
terms of Expectations.
3 Determine a best suitable curve for a given data using the method of least squares. K3
4 Determine correlation coefficient and regression lines. K3
5 Solve simple problems based on discrete and continuous probability distributions. K3
Apply testing of hypothesis for getting inferences about Population Parameters
6 K3
based on Sample statistic.

SYLLABUS

Descriptive statistics and methods for data science:

Data science, Statistics Introduction, Collection of data, primary and secondary data, Type
of variables: dependent and independent, Categorical and Continuous variables, Data
visualization, Measures of Central tendency, Measures of Variability (spread or variance),
UNIT-I Moments, Measures of Skewness and Kurtosis.
(12 Hrs) Random Variables and Probability functions:
Definition of a random variable, Distribution function, Properties of Distribution Function,
Discrete Random Variable, Probability Mass Function, Discrete Distribution Function,
Continuous Random Variable, Probability Density Function, Continuous Distribution
Function.

Two-dimensional random variables:Joint probability mass function and density functions,

two-dimensional distribution function, marginal functions, simple examples.
UNIT-II Mathematical Expectation: Mathematical Expectation of a Random Variable, Expected
(10 Hrs) Value of function of a Random Variable, Addition Theorem and Multiplication Theorem of
Expectation (without proofs), Statistical Measures like Mean, Variance, Moments and
Covariance in terms of Expectations.
Page 23 of 42
 Generating Functions: Moment generating Function, Characteristic Function of a Random
Variable and cumulant generating function.

Curve fitting: Method of least Squares, fitting of a Straight line, Fitting of a Parabola,
fitting of Exponential curves: and Power curve:
Correlation: Definition, Karl Pearson’s Coefficient of Correlation, Limits for correlation
UNIT-III
coefficient, Rank Correlation, Spearman’s formula for rank correlation coefficient (without
(12 Hrs)
proofs).
Regression Analysis: Regression Lines, Regression Coefficients and their properties
(without proofs).

Discrete and Continuous Distributions:

Discrete Distributions: Uniform distribution, Binomial distribution and Poisson
UNIT-IV distribution - Mean, Variance, moments, m.g.f., Characteristic function, Fitting of
(12 Hrs) distributions.
Continuous Distributions: Uniform distribution, Normal Distribution - Standard Normal
Variate, Mean, Variance, m.g.f., Characteristic function, cumulant generating function.

Sampling theory and Testing of Hypothesis:

Sampling Theory: Sample, population, statistic, parameter, Sampling distribution of a
statistic, standard error, point and interval estimation. Testing of Hypothesis- Formulation of
Null hypothesis, Alternative hypothesis, Critical region, level of significance, Errors in
sampling- Type-I-error, Type-II-error, One-tailed and Two-tailed tests. Degrees of freedom.
UNIT-V
Large Sample Theory: Test of significance for single proportion and difference of
(12 Hrs)
proportions.
Small Sample Theory: Student’s-t-distribution: definition, t-test for single mean, t-test for
difference of means, Paired t-test for difference of means.
F-distribution: definition, F-test for equality of two population variances.
Chi-square distribution: definition, Chi-square test for goodness of fit.

Text Books:
1. Probability, Statistics and Random Processes by T.Veerarajan, Tata Mc Graw Hill Pub.
Fundamentals of Mathematical Statistics by S. C. Gupta and V.K. Kapoor, Sultan Chand & Sons
2.
Publishers.
Reference Books:
1. Higher Engineering Mathematics, by Dr.B.S.Grewal,43rd Edition, Khanna Publishers.
2. Probability and statistics for Engineers, Miller and Freund, 7th edition, Prentice-Hall India.
Probability and statistics for Engineers and Scientists by Ronald E. Walpole, Raymond H. Myers,
3.
Sharon L. Myers and Keying Ye, Eighth edition, Pearson Education.
Michael Baron, Probability and statistics for computer scientists(1stedn.), Chapman and Hall
4.
Book, 2003.
Paul L. Meyer, Introductory Probability and Statistical Applications (2ndedn.), Addison-Wesley,
5.
1970.
e-Resources
1. http://www.swayam.gov.in

Page 24 of 42
 Code Category L T P C I.M E.M Exam
B20CS2201 PC 3 -- -- 3 30 70 3 Hrs.

DATABASE MANAGEMENT SYSTEMS

(Common to CIC & CSE)
Course Objectives: Students are expected to
1 Introduce about database management systems
2 Give a good formal foundation on the relational model
3 Introduce the concepts of basic SQL as a universal Database language
Demonstrate the principles behind systematic database design approaches by covering conceptual
4
design, logical design and normalization
Provide an overview of physical design of a database system, by discussing Database indexing
5
techniques and storage techniques
6 Explain Transaction management techniques

Course Outcomes: At the end of the course students will be able to

Knowledge
S. No Outcome
Level
1 Describe fundamental concepts of a relational database K2
2 Create, maintain and manipulate a relational database using SQL K3
3 Apply Conceptual and Logical database design K3
4 Apply normalization for a database design K3
5 Illustrate Storage management and Transaction management techniques. K2

SYLLABUS
Introduction: Database system, Characteristics (Database Vs File System), Database Users
(Actors on Scene, Workers behind the scene), Advantages of Database systems, Database
UNIT-I
applications. Brief introduction of different Data Models; Concepts of Schema, Instance and
(10 Hrs)
data independence; Three tier schema architecture for data independence; Database system
structure, environment, Centralized and Client Server architecture for the database.

Relational Model: Introduction to relational model, concepts of domain, attribute, tuple,

relation, importance of null values, constraints (Domain, Key constraints, integrity
constraints) and their importance
UNIT-II
BASIC SQL: Simple Database schema, data types, table definitions (create, alter), different
(10 Hrs)
DML operations (insert, delete, update), basic SQL querying (select and project) using where
clause, arithmetic & logical operations, SQL functions (Date and Time, Numeric, String
conversion).

Entity Relationship Model: Introduction, Basic features of ER model, Representation of

UNIT-III
entities, attributes, entity set, relationship, relationship set, constraints, ER diagrams
12 Hrs)
Generalization/specialization and Aggregation.

Page 25 of 42
 SQL: Creating tables with relationships, implementation of key and integrity constraints,
nested queries, sub queries, grouping, aggregation, ordering, implementation of different
types of joins, views(updatable and non-updatable), relational set operations.

Schema Refinement (Normalization): Purpose of Normalization or schema refinement,

concept of functional dependency, Closure of functional dependency and attribute closure,
UNIT-IV
Normal forms based on functional dependency(1NF, 2NF and 3 NF), concept of surrogate
(10 Hrs)
key, Boyce-Codd normal form(BCNF), Lossless join and dependency preserving
decomposition, Fourth normal form(4NF), Fifth Normal Form (5NF).

Transaction Concept: Transaction State, Implementation of Atomicity and Durability,

Schedules, Serializability, Recoverability, Implementation of Isolation levels, 2Pl and Time
UNIT-V stamp ordering protocols, Failure Classification, Recovery and Atomicity, ARIES Recovery
(12 Hrs) algorithm.
Indexing Techniques: Indexing, Cluster Indexes, Primary and Secondary Indexes , Index
data Structures, Hash Based Indexing, B+ Trees: Searching, Insertion, Deletion

Text Books:
Database System Concepts by Abraham Silberschatz, Henry F. Korth, S. Sudarshan, 7th Edition,
1.
McGraw-Hill Education, 2019.
Database Management Systems by Raghu Ramakrishnan, Johannes Gehrke, 3rd Edition.
2.
McGraw-Hill Education (India), 2014.
Reference Books:
Database Principles: Fundamentals of Design, Implementation, and Management by Steven
1.
Morris, Keeley Crockett, Carlos Coronel, Craig Blewett, Cengage, 2020.
Fundamentals of Database Systems by RamezElmasri, Shamkant B. Navathe, 7th Edition,
2.
Pearson Education India, 2015.
3. Introduction to Database Systems by C J Date, 8th Edition, Pearson Education, 2009.
e-Resources
1. https://nptel.ac.in/courses/106/105/106105175/
2. https://www.geeksforgeeks.org/introduction-to-nosql/

Page 26 of 42
 Code Category L T P C I.M E.M Exam
B20CI2201 PC 3 -- -- 3 30 70 3 Hrs.

COMPUTER ORGANIZATION & ARCHITECTURE

(For CIC)
Course Objectives: Students are expected to
1 Learn basic building blocks of a computer and their organization.
2 Design a basic computer.

Course Outcomes: At the end of the course students will be able to

Knowledge
S. No Outcome
Level
1 Identify basic building blocks of a computer. K2
2 Design of computer functional blocks. K3
3 Interpret Regular operation of a computer K3
4 Classify memory organization of a computer K2
5 Interpret the parameters that enhance system performance. K3

SYLLABUS
Digital Computers and Arithmetic:
UNIT-I Historical perspective and von Neumann computers, Memory and Peripheral devices. Fixed
(10 Hrs) and floating-point representation of numbers, Addition and Subtraction, Multiplication and
Division algorithms, Floating-point arithmetic operations.

Instruction Set Architectures:

UNIT-II Stack Organization, Instruction Formats, Addressing Modes. Computer Instructions, Data
(10 Hrs) Transfer and Manipulation, Program Control, Reduced Instruction Set Computer (RISC),
Instruction Cycle, Input-Output and Interrupt, Complete Computer Description.

Basic Computer Organization and Design:

UNIT-III General Register Organization and Bus system, Timing and Control, Micro Operations and
(10 Hrs) ALU, Design of Basic computer. Control Memory, Address Sequencing, Micro program
Example, Design of Control Unit.

Memory and I/O Organization:

UNIT-IV Memory Accessing techniques, Memory Hierarchy, Cache Memory, and Virtual memory. I/O
(10 Hrs) interface and data transfer, Modes of transfer, Priority interrupt, Direct memory access and
IOP.

Parallel Architectures:
UNIT-V
Parallel Processing, Pipelining, Arithmetic and Instruction Pipelines, RISC Pipeline, Vector
(10 Hrs)
Processing, Array Processors. Multiprocessors and Interconnection Networks, Symmetric

Page 27 of 42
 multiprocessors, Cachecoherence.

Text Books:
1. Computer System Architecture, M. Morris Mano, Pearson India, Revised 3rd ed., 2017.
Reference Books:
Computer Organization and Architecture – Designing for Performance, William Stallings, Pearson,
1.
9th ed., 2013
Essentials of Computer Organization and Architecture, Linda Null, Julia Lobur, Narosa Pub., 3rd
2.
ed., 2003,
3. Computer Architecture and Organization, John. P. Hayes, 3rd ed., TMH, 1998
Computer Organization, Carl Hamacher, Zvonko Vranesic, Safwat Zaky and Zvonko Vranesic, 5th
4.
ed., TMH, 2011
5. Computer Systems Organization & Architecture, John D. Carpinelli, Addison Wesley, 2001.
6. Computer Organization, Design, and Architecture, Sajjan G. Shiva, 4th ed., CRC Press, 2008.
Fundamentals of Computer Organization and Design, Sivarama P. Dandamudi, Springer-Verlag,
7.
2003
Computer Architecture and organization: An Integrated Approach, Miles Murdocca and Vincent
8.
Heuring, Wiley, 2007.
Computer Organization and Architecture: Themes and Variations, Alan Clements, Cengage
9.
Learning, 2014.

Page 28 of 42
 Code Category L T P C I.M E.M Exam
B20CI2202 PC 3 -- -- 3 30 70 3 Hrs.

FORMAL LANGUAGES AND AUTOMATA THEORY

(For: CIC)
Course Objectives: Students are expected to
1 How to design Automata as Acceptors, Verifiers and Translators
2 Fundamentals of Regular and Context Free Grammars and Languages
3 Understand the relation between different Languages and Automata
4 Learn how to design Pushdown Automata and Turing Machine

Course Outcomes: At the end of the course students will be able to

Knowledge
S. No Outcome
Level
1 Construct of Finite Automata with output and without output K3
Illustrate regular expressions, equivalence of Finite Automata and Regular
2 K2
expressions and properties of Regular languages.
Construct Context Free Grammars, Regular grammars, simplification and Normal
3 K3
forms in Context Free Grammars
4 Illustrate properties of Context Free Language and Construct Pushdown Automata K3
Summarize decidable and un-decidable problems and Construct of Turing
5 K3
Machine

SYLLABUS
Importance of Automata Theory, Central Concepts of Automata Theory, Introduction to DFA
and NFA, Acceptance of a String by a DFA, Acceptance of a String by NFA, Design of DFAs,
Design of NFAs, Conversion of NFA to DFA, Introduction to NFA with Є- Transitions,
UNIT-I
Conversion of NFA with Є-Transitions to NFA without Є-Transitions. Minimization of DFA,
(10 Hrs)
Introduction to Mealy and Moore Machines, Design of Mealy and Moore Machines,
Conversion of Mealy to Moore Machines and Moore to Mealy Machines, Applications and
Limitations of Finite Automata.

Introduction to Regular Expressions, Regular Sets, Identity Rules, Equivalence of two Regular
Expressions, Conversion of Regular Expression to NFA with Є-Transitions, Conversion of
UNIT-II
DFA to Regular Expression. Pumping Lemma of Regular Languages, Applications of
(10 Hrs)
pumping lemma, Closure Properties of Regular Languages, Applications of Regular
Expressions.

Chomsky Hierarchy, Regular Grammar, Left-Linear Grammar, Right-Linear Grammar,

UNIT-II Conversion of Finite Automata to Regular Grammars and Regular Grammars to Finite
(12 Hrs) Automata, Context Free Grammar, Construction of CFGs for Languages, Determining
language of the grammar, Leftmost and Rightmost Derivations, Parse Trees. Ambiguous

Page 29 of 42
 Grammars, Simplification of Context Free Grammars (Elimination of Useless Symbols, Є-
Productions and Unit Productions), Normal Forms (Chomsky Normal Form and Greibach
Normal Form).

Pumping Lemma for CFL, Applications of pumping lemma for CFL, Closure Properties of
CFL, Applications of Context Free Grammars, Introduction to Pushdown Automata, Model,
Graphical Notation, Instantaneous Description, Language Acceptance of Pushdown Automata
UNIT-IV
(Acceptance by empty stack and final state), Design of Pushdown Automata for CFL.
(10 Hrs)
Deterministic and Non–Deterministic Pushdown Automata, Conversion of Pushdown
Automata to Context Free Grammars, Conversion of Context Free Grammars to Pushdown
Automata, Application of Pushdown Automata.

Introduction to Turing Machine, Representation of Turing Machines (Instantaneous

Descriptions, Transition Tables and Transition Diagrams), Design of Turning Machines.
UNIT-V Types of Turning Machines, Church’s Thesis, Universal Turing Machine, Introduction to
(12 Hrs) Decidable and Un-decidable Problems, Halting Problem of Turing Machines, Post’s
Correspondence Problem, Modified Post’s Correspondence Problem, Introduction to
Classes of P and NP, NP-Hard and NP-Complete Problems.

Text Books:
Introduction to Automata Theory, Languages and Computation, J. E. Hopcroft, R. Motwani and J.
1.
D. Ullman, 3rd Edition, Pearson, 2008.
2. An Introduction to Formal Languages and Automata, Peter Linz, 6th Edition, Jones & Bartlett, 2016.
Reference Books:
Theory of Computer Science-Automata, Languages and Computation, K. L. P. Mishra and N.
1.
Chandrasekharan, 3rd Edition, PHI, 2007.
Elements of Theory of Computation, Lewis H.P. & Papadimition C.H., 2nd Edition, Pearson
2.
/PHI, 1998.
Theory of Automata, Languages and Computation, Rajendra Kumar, 1st Edition, McGraw Hill,
3.
2010

Page 30 of 42
 Code Category L T P C I.M E.M Exam
B20HS2201 HS 3 -- -- 3 30 70 3 Hrs.

MANAGERIAL ECONOMICS AND FINANCIAL ACCOUNTANCY

(COMMON TO AIML, CIC, CSE & IT)
Course Objectives: Students are expected to
1 Study Managerial Economics and Demand Analysis
2 Familiarize about the Concepts of Cost and Break-Even Analysis.
3 Understand the nature of markets and to know the Pricing Policies
4 Learn about accounting cycle and preparation of Financial Statements.
5 Know the concept of Capital and sources of raising and Depreciation

Course Outcomes: At the end of the course students will be able to

Knowledge
S. No Outcome
Level
Equip oneself with the knowledge of estimating the Demand and demand elasticities
1 K2
for a product.
2 Have knowledge of Cost and its types and ability to calculate BEP K3
Understand the nature of different markets and Pricing Practices Prevailing in the
3 K2
today’s business world
4 Prepare Financial Statements and know how to calculate Profit & Loss for a firm K3
5 Know Types of capital and their sources and know how to calculate Depreciation K3

SYLLABUS
Introduction to Managerial Economics and demand Analysis:
Managerial Economics: Definition of Economics & Classification of Economics (Micro &
UNIT-I Macro), Meaning, Nature, & Scope of Managerial Economics.
(10 Hrs) Demand Analysis: Concept of Demand, Determinants of Demand, Demand schedule,
Demand curve, Law of Demand and its exceptions. Elasticity of Demand, Types of
Elasticity of Demand. Importance of demand forecasting and its Methods.

Cost Analysis: Importance of cost analysis, Types of Cost- Actual cost Vs Opportunity
cost, Fixed cost Vs Variable cost, Explicit Vs Implicit cost, Historical cost Vs Replacement
cost, Incremental cost Vs Sunk cost; Elements of costs – Material, Labour, Expenses;
UNIT-II
Methods of costing - Job costing, contract costing, Process costing, Batch costing, Unit
(10 Hrs)
costing, Service costing, Multiple costing. Break-even analysis: Determination of
Breakeven point - Applications, Assumptions and Limitations of Break -even analysis
(Theory only).

Introduction to Markets & Pricing Policies

UNIT-III
Market Structures: Salient Features of Perfect Competition, Monopoly, Monopolistic
(10 Hrs)
competition, Oligopoly and Duopoly. Pricing: Importance of pricing and its meaning;

Page 31 of 42
 Methods of Pricing: Cost Based -Full cost, Mark-up, Marginal &Break-even; Demand
Based - Penetrating, Skimming; Competition Based- Going rate, Sealed Bid, Discount;
Internet Pricing - Flat-rate, Usage sensitive.

Introduction to Financial Accounting:

UNIT-IV Importance of Accounting - Double Entry System of Accounting - Types of Accounts -
(08 Hrs) Journal, Ledger, Trail Balance, Trading Account, Profit and Loss Account and Balance
Sheet (outlines only).

Capital & Depreciation: Types of Capital - Fixed capital & Working Capital, Components
of Working Capital, Factors influencing Working capital. Methods of Raising Finance -
UNIT-V
Short term, medium term and Long term. Depreciation - Meaning, Importance and causes of
(12 Hrs)
depreciation; Methods of Depreciation- Straight line and diminishing balancing methods
(Theory only)

Text Books:
1. A R Aryasri, Managerial Economics and Financial Analysis, TMH Pvt. Ltd, New Delhi
Dr. N.Appa Rao, Dr.P. Vijayakumar: Managerial Economics and Financial Analysis’, Cengage
2.
Publications, New Delhi
Reference Books:
Dr.B.Kuberudu & T.V. Ramana : Managerial Economics and Financial anaysis, Himalaya
1.
Publishing House
2. Varshney R.L, K.L Maheswari, Managerial Economics, S. Chand & Company Ltd,
3. Shashi K. Gupta & R.K. Sharma Management Accounting, Kalyani Publishers
4. Maheswari S.N, An Introduction to Accountancy, Vikas Publishing House Pvt Ltd

Page 32 of 42
 Code Category L T P C I.M E.M Exam
B20CS2204 PC 0 -- 3 1.5 15 35 3 Hrs.

DATABASE MANAGEMENT SYSTEMS LAB

(Common to CIC, CSE)
Course Objectives: Students are expected to
1 Populate and query a database using SQL DDL/DML Commands
2 Declare and enforce integrity constraints on a database
3 Writing Queries using advanced concepts of SQL
4 Programming PL/SQL including procedures, functions, cursors and triggers

Course Outcomes: At the end of the course students will be able to

Knowledge
S. No Outcome
Level
Apply SQL to execute queries for creating database and performing data
1 K3
manipulation operations
2 Apply Queries using SQL K3
Construct PL/SQL programs including stored procedures, functions, cursors and
3 K3
triggers

LIST OF PROGRAMS
Creation, altering and dropping of tables and inserting rows into a table (use constraints
1
while creating tables) examples using SELECT command.
Queries (along with sub Queries) using ANY, ALL, IN, EXISTS, NOTEXISTS, UNION,
2 INTERSET, Constraints. Example:- Select the roll number and name of the student who secured
fourth rank in the class.
Queries using Aggregate functions (COUNT, SUM, AVG, MAX and MIN), GROUP
3
BY, HAVING and Creation and dropping of Views.
Queries using Conversion functions (to char, to number and to date), string functions
(Concatenation, lpad, rpad, ltrim, rtrim, lower, upper, initcap, length, substr and instr), date
4
functions (Sysdate, next day, add months, last day, months between, least, greatest, trunc,
round, to char, to date)
Create a simple PL/SQL program which includes declaration section, executable section and
exception –Handling section (Ex. Student marks can be selected from the table and printed for
5
those who secured first class and an exception can be raised if no records were found) Insert data
into student table and use COMMIT, ROLLBACK and SAVEPOINT in PL/SQL block.
Develop a program that includes the features NESTED IF, CASE and CASE expression. The
6
program can be extended using the NULLIF and COALESCE functions.
Program development using WHILE LOOPS, numeric FOR LOOPS, nested loops using
7. ERROR Handling, BUILT –IN Exceptions, User defined Exceptions, RAISE APPLICATION
ERROR.
Programs development using creation of procedures, passing parameters IN and OUT of
8.
PROCEDURES.

Page 33 of 42
 Program development using creation of stored functions, invoke functions in SQL Statements
9.
and write complex functions.
Develop programs using features parameters in a CURSOR, FOR UPDATE CURSOR,
10.
WHERE CURRENT of clause and CURSOR variables.
Develop Programs using BEFORE and AFTER Triggers, Row and Statement Triggers and
11.
INSTEAD OF Triggers

Reference Books:
1 Oracle Database 12C: The Complete Reference by Byrla, McGraw Hill Education, 2017.
SQL The Complete Reference by James Groff, Paul Weinberg, Andy Oppel, 3rd
2
Edition, McGraw Hill Education, 2017.
3 SQL, PL/SQL by Ivan Bayross, 4th Revised Edition, 2020.

Page 34 of 42
 Code Category L T P C I.M E.M Exam
B20CS2205 PC 0 -- 3 1.5 15 35 3 Hrs.

R PROGRAMMING LAB
(Common to CIC, CSE)
Course Objectives: Students are expected to
1 Learn statistical programming, computation, graphics, and modeling,
2 Learn Writing functions and use R in an efficient way,
3 Learn about basic types of statistical models

Course Outcomes: At the end of the course students will be able to

Knowledge
S. No Outcome
Level
Access online resources for R and import new function packages into the R
1 K2
workspace
2 Import, review, manipulate and summarize data-sets in R K3
Explore data-sets to create testable hypotheses and identify appropriate statistical
3 K3
tests
4 Perform appropriate statistical tests using R K3
5 Develop and edit visualizations with R K4

LIST OF PROGRAMS
Write a R program to take input from the user (name and age) and display the values. Also print
1
the version of R installation.
2 Write a R program to get the details of the objects in memory.
Write a R program to create a sequence of numbers from 20 to 50 and find the mean of numbers
3
from 20 to 60 and sum of numbers from 51 to 91.
4 Write a R program to create a simple bar plot of five subjects marks.
5 Write a R program to get the unique elements of a given string and unique numbers of vector.
Write a R program to create three vectors a,b,c with 3 integers. Combine the three vectors to
6
become a 3×3 matrix where each column represents a vector. Print the content of the matrix.
Write a R program to create a 5 x 4 matrix, 3 x 3 matrix with labels and fill the matrix by rows and
7.
2 × 2 matrix with labels and fill the matrix by columns.
Write a R program to combine three arrays so that the first row of the first array is followed by the
8.
first row of the second array and then first row of the third array.
Write a R program to create a two-dimensional 5x3 array of sequence of even integers greater than
9.
50.
Write a R program to create an array using four given columns, three given rows, and two given
10.
tables and display the content of the array.
11. Write a R program to create an empty data frame.
12. Write a R program to create a data frame from four given vectors.
13. Write a R program to create a data frame using two given vectors and display the duplicated

Page 35 of 42
 elements and unique rows of the said data frame.
Write a R program to save the information of a data frame in a file and display the information of
14.
the file.
15. Write a R program to create a matrix from a list of given vectors.
16. Write a R program to concatenate two given matrices of same column but different rows.
Write a R program to find row and column index of maximum and minimum value in a given
17.
matrix.
18. Write a R program to append value to a given empty vector.
19. Write a R program to multiply two vectors of integers type and length 3.
20. Write a R program to find Sum, Mean and Product of a Vector, ignore element like NA or Nan.
Write a R program to list containing a vector, a matrix and a list and give names to the elements in
21.
the list.
Write a R program to create a list containing a vector, a matrix and a list and give names to the
22.
elements in the list. Access the first and second element of the list.
Write a R program to create a list containing a vector, a matrix and a list and remove the second
23.
element.
24. Write a R program to select second element of a given nested list.
25. Write a R program to merge two given lists into one list.
Write a R program to create a list named s containing sequence of 15 capital letters, starting from
26.
‘E’.
27. Write a R program to assign new names "a", "b" and "c" to the elements of a given list.
28. Write a R program to find the levels of factor of a given vector.
29. Write a R program to create an ordered factor from data consisting of the names of months.
30. Write a R program to concatenate two given factor in a single factor.

Reference Books:
1 R for Data Science is a book written by Hadley Wickham (Author), Garrett Grolemund.
Software requirements:
1. The R statistical software program. Available from: https://www.r-project.org/
1. 2. R Studio an Integrated Development Environment (IDE) for R. Available from:
https://www.rstudio.com/

Page 36 of 42
 Code Category L T P C I.M E.M Exam
B20CI2203 PC 0 -- 3 1.5 15 35 3 Hrs.

COMPUTER ORGANIZATION & ARCHITECTURE LAB

(For CIC)
Course Objectives: Students are expected to
1 Know the characteristics of various components.
2 Understand the utilization of components

Course Outcomes: At the end of the course students will be able to

Knowledge
S. No Outcome
Level
1 Demonstrate working of logic families and logic gates. K3
2 Design and implement Combinational and Sequential logic circuits. K4
3 Solve elementary problems by assembly language programming K4
4 Implement assembly language program for given task for 8086 microprocessor. K3

LIST OF PROGRAMS
1 Realization of Boolean Expressions using Gates
2 Design and realization logic gates using universal gates
Design a JK Flip‐Flop, Edge triggered J‐K NAND Flip Flop and show its functionality Handle
3
racecondition and clock gating in your circuit.
4 Design a 4 – bit Adder / Subtractor
5 Combinational logic circuits: Implementation of Boolean functions using logic gates
Arithmetic operations using logic gates; Implementation of Multiplexers, Demultiplexers,
6
Encoders, Decoders; Implementation of Boolean functions using Multiplexers/Decoders
Study of sequential logic circuits: Implementation of flip flops, Verify the excitation tables
7.
ofvarious FLIP-FLOPS.
8. Design and realization a Synchronous and Asynchronous counter using flip-flops
9. Design and realization of an 8-bit parallel load and serial out shift register using flip flops
Implementation of counters, Design and realization a Synchronous and Asynchronous
10.
counterusing flip-flops
Design and realization of 4x1 mux, 8x1mux using 2x1 mux
Write assembly language programs in 8086 for the following: (MASAM can also be used)
1. To add two 8 bit number (A+B=RESULT with a carry and without a carry).
2. To subtract one 8 bit number from another (A-B=RESULT with a borrow and without a
borrow).
11.
3. To find out AND, OR, NOT, XOR, NAND, NOR, XNOR of two 8 bit number.
4. To find out addition of two 16 bit numbers.
5. To find out subtraction of two 16 bit numbers.
6. To evaluate the expression a = b + c –d * e
Considering 8-bit, 16 bit and 32-bit binary numbers as b, c, d, e.

Page 37 of 42
 Take the input in consecutive memory locations and results also Display the results by using
“int xx” of 8086. Validate program for the boundary conditions.
To take N numbers as input. Perform the following operations on them.
a. Arrange in ascending and descending order.
b. Find max and minimum
12.
c. Find average
Considering 8-bit, 16-bit binary numbers and 2-digit, 4 digit and 8-digit BCD numbers. Display
the results by using “int xx” of 8086. Validate program for the boundary conditions.
13. To implement the above operations as procedures and call from the main procedure.
To find the factorial of a given number as a Procedure and call from the main program
14.
whichdisplay the result

Reference Books:
1 Computer System Architecture, M. Morris Mano, Pearson India, Revised 3rd ed., 2017
Computer Organization and Architecture - Designing for Performance, William
2
Stallings, Pearson, 9th ed., 2013
Essentials of Computer Organization and Architecture, Linda Null, Julia Lobur, Narosa Pub.,
3
3rd ed., 2003,
4 Computer Architecture and Organization, John. P. Hayes, 3rd ed., TMH, 1998

Page 38 of 42
 Code Category L T P C I.M E.M Exam
B20CI2204 SOC 1 -- 2 2 -- 50 3 Hrs.

ANDROID APPLICATION DEVELOPMENT LAB

(For: CIC)
Course Objectives: Students are expected to
1 Learn how to develop Applications in android environment.
2 Learn how to develop user interface applications.
3 Learn how to develop URL related applications.

Course Outcomes: At the end of the course students will be able to

Knowledge
S. No OUTCOME
Level
1 Apply essential Android Programming concepts. K3
Develop various Android applications related to layouts & rich uses interactive
2 K4
interfaces
3 Develop mobile applications using SQLite. K4

LIST OF PROGRAMS
(a) Create an Android application that shows Hello + name of the user and run it on an emulator.
1 (b) Create an application that takes the name from a text box and shows hello message along
with the name entered in text box, when the user clicks the OK button.
Create a screen that has input boxes for User Name, Password, Address, Gender (radio buttons
for male and female), Age (numeric), Date of Birth (Date Picket), State (Spinner) and a Submit
2
button. On clicking the submit button, print all the data below the Submit Button. Use (a) Linear
Layout , (b) Relative Layout and (c) Grid Layout or Table Layout.
Develop an application that shows names as a list and on selecting a name it should show the
details of the candidate on the next screen with a “Back” button. If the screen is rotated to
3 landscape mode (width greater than height), then the screen should show list on left fragment
and details on right fragment instead of second screen with back button. Use Fragment
transactions and Rotation event listener.
Develop an application that uses a menu with 3 options for dialing a number, opening a website
4 and to send an SMS. On selecting an option, the appropriate action should be invoked using
intents
Develop an application that inserts some notifications into Notification area and whenever a
5
notification is inserted, it should show a toast with details of the notification.
Create an application that uses a text file to store user names and passwords (tab separated fields
and onerecord per line). When the user submits a login name and password through a screen, the
6
details should be verified with the text file data and if they match, show a dialog saying that
login is successful. Otherwise, show the dialog with Login Failed message.
7. Create a user registration application that stores the user details in a database table.
Create a database and a user table where the details of login names and passwords are stored.
8.
Insert some names and passwords initially. Now the login details entered by the user should be

Page 39 of 42
 verified with the database and an appropriate dialog should be shown to the user.

Reference Books:
1 http://ai2.appinventor.mit.edu
2 https://drive.google.com/file/d/0B8rTtW_91YclTWF4czdBMEpZcWs/view
Note:
Android Application Development with MIT App Inventor: For the first one week, the student is advised
to go through the App Inventor from MIT which gives insight into the various properties of each
component. The student should pay attention to the properties of each components, which are used later
in Android programming. Following are useful links:

Page 40 of 42
 Code Category L T P C I.M E.M Exam
B20MC2201 MC 2 -- -- -- -- -- --

ENGLISH PROFICIENCY
(Common to CE, CIC, EEE, ME, AIDS & CSBS)
Course Objectives: The students will be able to
1. Communicate their ideas and views effectively
2. Practice language skills and improve their language competency.
3. Know and perform well in real life contexts
4. Identify and examine their self-attributes which require improvement and motivation.
5. Build confidence and overcome their inhibitions, stage freight, nervousness etc.,
6. Improve their reading skills.

Course Outcomes: The students will

Knowledge
S. No Outcome
Level
1. Improve speaking skills. K3
2. Enhance their listening capabilities K3
3. Learn and practice the skills of composition writing. K3
4. Enhance their reading and understanding of different texts. K3
5. Improve their communication both in formal and informal contexts. K3
6. Be confident in presentation skills. K3

SYLLABUS
Listening Skills
Types of listening
UNIT-I Hearing and
Listening
Listening as a receptive skill

Speaking Skills
Presentation skills
Describing
UNIT-II
event/place/thing Extempore
Debate
Group Discussion

Reading Skills
UNIT-III Types of Reading (Intensive and Extensive reading, Skimming, Scanning)
Reading/Summarizing News Paper Articles

UNIT-IV Writing Skills

Page 41 of 42
 Essay Writing (Argumentative, Analytical and
Descriptive) E-Mail Writing
Business Letters
Resume Writing

Integrated Language Skills

UNIT-V Listening Skills for Speaking and Writing
Reading Skills for Writing and Speaking

Reference Books:
1. Fundamentals of Technical Communication by Meenakshiraman, Sangeta Sharma of OUP
English and Communication Skills for Students of Science and Engineering, by S.P.
2. Dhanavel, Orient Blackswan Ltd. 2009
3. Enriching Speaking and Writing Skills, Orient Blackswan Publishers.
4. The Oxford Guide to Writing and Speaking by John Seely OUP.
5. Effective Technical Communication by M. Ashraf Rizwi. Tata Mcgraw hill.
6. Six Weeks to Words of Power by Wilfred Funk. W.R.Goyal Publishers
Note: Internal Assessment is carried out throughout the semester.

Page 42 of 42