syllabus

B V Raju Institute of Technology/ B.Tech / CSE w.e.f.
2022-2023
II YEAR I SEMESTER
DATA STRUCTURES
Year- Course Periods/
Regulation Category Credits Maximum Marks
Sem Code Week
L T P C CIE SEE Total
R22 II – I A63E1 PC
3 - - 3 40 60 100
Prerequisites: Computational Thinking and Programming
Course Objectives:
1. Interpret the performance of linear and binary searching algorithms based on recursive functions and time, space
complexities.
2. Implement the sorting, hashing and collision resolution techniques.
3. Develop linear data structures for stacks & queues using arrays.
4. Develop singly, doubly & circular linked list data structures.
5. Illustrate binary tree and binary search trees and Understand graph types, representations and graph traversal
algorithms.
UNIT – I (Text book 1, Chapter 1, 2 & 13)

Algorithms: Preliminaries of algorithm, Algorithm analysis and complexity. Recursion: Definition, Design
Methodology and Implementation of recursive algorithms, types of recursion, recursive algorithms for factorial
function, GCD computation, Fibonacci sequence, Towers of Hanoi, Searching Techniques: Linear Search, Binary
Search.
UNIT – II (Text book 1, Chapter 12)
Sorting Techniques: Basic concepts, Insertion Sort, Selection Sort, Bubble Sort, Quick Sort, Merge Sort and
Counting Sort. Hashing: Hash table representations, Collision resolution: separate chaining, open addressing, linear
probing, quadratic probing, Double hashing, Rehashing.
UNIT – III (Text book 1, Chapter 3 & 4)
Stacks: Basic Stack Operations, Representation of a Stack using Arrays, Stack Applications: Reversing a list, Infix
to postfix Transformation, Evaluating Postfix Expression. Queues: Basic Queues Operations, Implementation of
Queue Operations using arrays, Application of Queues: Round Robin Algorithm, Circular Queues.
UNIT – IV (Text book 1, Chapter 5)
Linked Lists: Introduction, single linked list, representation of a linked list in memory, Operations on a single
linked list, merging two single linked lists into one list, reversing a single linked list, advantages and disadvantages
of single linked list, Circular linked list, Double linked list.
UNIT –V (Text book 1, Chapter 6, 7 & 11)
Trees: Basic tree concepts, Binary Tree: Properties, Representation of Binary Trees – Array Representation and
Linked Representation, Binary Tree Traversals (recursive), Creation of binary tree from in-order and pre/post-order
traversals, Binary Search Tree Operations and Implementation. Graphs: Definition, Properties, Representation of
Un-Weighted Graphs, Weighted Graphs, Graph Search Methods: BFS, DFS, and Implementation.
Course Outcomes:
1. Interpret the performance of linear and binary searching algorithms based on recursive functions, time and space
complexities. (BL-2)
2. Implement sorting, hashing and collision resolution techniques. (BL-2)
3. Develop linear data structures for stacks, queues using arrays. (BL-3)
4. Develop singly, doubly & circular linked list data structures. (BL-3)
5. Illustrate binary tree and binary search trees and Understand graph types, representations and graph traversal
algorithms. (BL-3)
Text Books:
1. Data Structures, 2/e, Richard F, Gilberg , Forouzan, Cengage
References:
1. Data Structures using C, Aaron M. Tanenbaum, Yedidyah Langsam, Moshe J Augenstein, Pearson
2. Data structures and Algorithm Analysis in C, Mark Allen Weiss, Pearson Education. Ltd., Second Edition
B V Raju Institute of Technology/ B.Tech / CSE w.e.f. 2022-2023
SOFTWARE ENGINEERING AND DESIGN

Sem Code Week
3 - - 3 40 60 100
Prerequisites: Computational Thinking and Programming
Course Objectives:
1. To define software engineering process, practices, and demonstrate various process models.
2. To identify software requirements and develop the Software Requirements Specification (SRS) document.
3. To make use of structural UML diagrams.
4. To make use of behavioral UML diagrams.
5. To calculate effort and learn the levels of software testing and Methodologies.
UNIT – I
Software Process: Process and project, Software development process models - Waterfall model, Prototyping model,
Rational unified process model, Time boxing model, Agile Manifesto, Extreme programming Model, Project
management process.
Text Book 1: Chapter 1: Software Processes
Text Book 2: Chapter 2, Section 2.8 to Section 2.11
UNIT – II
Functional Requirements - Nonfunctional Requirements - Software requirement analysis and specification:
Characteristics and components of SRS, Structure of SRS, Value of good SRS, requirement process, Requirements
validation, requirement specification using Data flow Diagram. Case study – ATM System, Library Management
System.
Text Book 1: Chapter 3: Software Requirements Analysis and Specification
UNIT – III
Software Design - Introduction to UML, Conceptual model of UML- Structural UML diagrams - Class Diagram,
Package Diagram, Component Diagram, and Deployment Diagram.
Case studies –Course Registration System, Online Ticket Reservation System.
Text Book: 2
Chapter 16: UML Class Diagrams
Chapter 13: Section 13.5. Applying UML: Package Diagrams
Chapter 37: UML Deployment and Component Diagrams.
UNIT – IV
Behavioral UML Diagrams – Use case diagram, Interaction Diagram, Activity diagram, State chart diagram.
Case studies - Recruitment system, Exam registration System.
Text Book: 2
Chapter 6: Use cases (Section 6.1 to 6.6, 6.15, 6.16 and 6.17)
Chapter 6: Section 6.18. Applying UML: Activity Diagrams
Chapter 10: System Sequence Diagrams
Chapter 15: UML Interaction Diagrams
Chapter 29: UML State Machine Diagrams and Modeling
UNIT –V
Software Testing: Testing concepts, Levels of Testing, Black-Box Testing, White- Box Testing Techniques, Validation
Testing, System Testing, Software Quality Assurance, The Art of Debugging.
Text Book: 1
Chapter 8: Testing
Course Outcomes: Upon completion of the course, the students will be able to
1. Summarize various software development process models. (BL- 2)
2. Demonstrate the principles and requirements at various phases of software development. (BL- 2)
3. Model structural UML Diagrams. (BL- 3)
4. Model behavioral UML Diagrams. (BL- 3)
5. Compare different testing strategies. (BL- 4)
Text Books
1. A Concise Introduction to Software Engineering (Undergraduate Topics in Computer Science), Pankaj Jalote,
Springer International Edition. (Unit 1, 2, & 5)
2. Craig Larman," Applying UML and Patterns: An Introduction to object-oriented Analysis and Design and iterative
development”, Third Edition, Pearson Education, 2005 (UNIT I (Unified Process Model), Unit 3&4)
References:
1. Roger S, “Software Engineering – A Practitioner’s Approach”, seventh edition, Pressman, 2010.

2. Pearson Edu, “Software Engineering by Ian Sommerville”, 9 th edition, 2010.
3. Mike O’Docherty, “Object-Oriented Analysis & Design: Understanding System Development with UML 2.0”, John
Wiley & Sons, 2005.
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE

(Common to CSE and CSE(AIDS))
Sem Code Week
R22 II – I A63EB PC
3 - - 3 40 60 100
Prerequisites: Basic Mathematics in general is sufficient
Course Objectives:
1. To introduce the concepts of mathematical logic.
2. To perform the operations associated with sets, relations and functions.
3. To learn the types of algebraic structures and their properties
4. To learn methods for solving counting problems.
5. To use Graph Theory concepts for solving real time problems.
UNIT – I (T1, Chapter 1)

Mathematical logic: Introduction, Statements and Notation, Connectives, Well Formed Formula, Tautology,
Contradiction, Logical Implication, Logical Equivalence, Duality principle, Normal Forms, Theory of Inference for the
Statement Calculus, The Predicate Calculus, Inference Theory of the Predicate Calculus.
UNIT – II (T1, Chapter 2)
Sets and Relations: Introduction, Basic Concepts of Set Theory, Cartesian Products, Binary Relation- Properties of
Binary Relation, Partition and Covering of a set, Equivalence Relation, Compatibility Relation, Partial Ordering
Relation, Hasse Diagram, Functions- definition, properties, One-to-one functions, Onto functions, Bijective
functions, Inverse and Composite Functions, Transitive Closure.
UNIT – III (T1, Chapter 3, 4)
Algebraic Structures: Introduction, Binary operation, properties of binary operation, Algebraic Systems,
Semigroups and Monoids, Groups, Subgroups, and Homomorphism, Cyclic group, Lattice and its properties.
Boolean Algebra: Identities of Boolean Algebra, Duality, Representation of Boolean Function, Boolean Ring.
UNIT – IV (T2, Chapter 2)
Elementary Combinatorics: Basics of Counting, Combinations and Permutations with/without Repetitions,
Constrained Repetitions, Binomial and Multinomial Theorems, The Principle of Inclusion -Exclusion. Pigeon Hole
Principles and its Application.
Recurrence Relation: Solving Homogeneous Recurrence Relation by Substitution, Characteristics Roots and
Generating Functions. Solving Inhomogeneous Recurrence Relation by Characteristics Roots method
UNIT –V (T2, Chapter 5)
Graph Theory: Graphs and their properties, Degree, Connectivity, Path, Cycle, Special graphs, Subgraphs, Trees
and their Properties, Spanning Trees, Minimum Spanning Trees: Prim’s Algorithm, Kruskal‘s Algorithm,
Isomorphism, Planar Graphs, Euler’s Formula, Multi-graphs-Euler Circuits, Hamiltonian Graphs, Chromatic
Numbers, The Four-Color Problem.
Course Outcomes: After completion of the course, the student can able to
1. Apply mathematical logic to find the logical equivalences and implications of statement formulas. (BL-3)
2. Describe the properties and types of sets, relations and functions. (BL-2)
3. Identify the properties and types of algebraic structures. (BL-2)
4. Solve counting problems by using concepts of combinatorics (BL- 3)
5. Apply graph theory concepts in solving real-world problems (BL-3)
Text Books:
1. Discrete Mathematical Structures with Applications to Computer Science: J.P. Tremblay, R.

Manohar, McGraw-Hill, 1st ed.
2. Discrete Mathematics for Computer Scientists & Mathematicians: Joe l. Mott, Abraham Kandel, Teodore P. Baker,
Prentis Hall of India, 2nd ed.
References:
1. Discrete and Combinatorial Mathematics - an applied introduction: Ralph.P. Grimald, Pearson education, 5th
edition.
2. Discrete Mathematical Structures: Thomas Kosy, Tata McGraw Hill publishing co.
FOUNDATIONS OF COMPUTER DESIGN

Sem Code Week
3 - - 3 40 60 100
Prerequisites: Basic knowledge on number systems,computer.

Course Objectives:
At the end of the course, the students will be able to:
1. Understand the fundamental concepts used in the design of digital systems.
2. Design Digital circuits using Boolean algebra.
3. Realize the interoperability between Boolean functions and logic gates.
4. Design Sequential circuits using Boolean algebra.
5. Realize CPU operating principles.
UNIT-I: BASIC STRUCTURE OF COMPUTERS:
Introduction, Computers Types, Functional units, Basic operational Concepts, Bus structures, Software,
Performance, multiprocessor and multi computers, computer Generations.
DATA REPRESENTATION: Introduction, Data types, Binary numbers, Number base conversions, Octal and
hexadecimal Numbers, complements, signed binary numbers, Fixed point Representation. Floating – Point
Representation, Other Binary codes.
UNIT -II: DIGITAL LOGIC CIRCUITS-I:

Basic Theorems and Postulates, Digital Logic Gates, Universal Gates, Algebraic Simplification of Digital Logic Gates
using Theorems and Postulates, The Karnaugh Map Method, Do not Care Map Entries.
UNIT -III:
Realization of Boolean functions using basic gates and NAND/NOR gates. Arithmetic Circuits-Half adder, Full adder,
Half subtractor, Full Subtractor. Introduction of Combinational Circuits: Multiplexers, De-mux, Encoder, Decoder.
UNIT -IV: DIGITAL LOGIC CIRCUITS-II:

Introduction: Flip-flops & types, Sequential Circuits and Binary counters, Registers, Shift Registers. INSTRUCTION
SET & ADDRESSING: Introduction, Memory Locations and Addresses, machine addresses and sequencing, Various
Addressing Modes, Instruction Formats.
UNIT -V PROCESSOR ORGANIZATION:

Introduction to CPU, Register Transfers, Execution of Instructions, Multiple Bus Organization, Hardwired control,
Micro programmed Control, Input and output Devices.
MEMORY ORGANIZATION: Introduction, Concepts of Memory, RAM, ROM memories, memory hierarchy, cache
memories, virtual memory.
Course Outcomes:
1. Student could be able to design, understand the basic knowledge on number system. (BL-2)
2. Student able to know about logic gates and simplification of equations in different methods. (BL-3)
3. Student able to understand how hardware system will do arithmetic logic operations & able to know
combinational, sequential circuits also they should be able to continue with computer organization. (BL-2)
4. Students understand in a better way the I/O and Memory Organization in detail. (BL-3)
5. Students able to know how memory is organizing between devices. (BL-3)
Text Books:
1. Computer Organization – Carl Hamacher, ZvonkoVranesic, SafwatZaky, fifth edition, McGraw Hill.
2. Computer System Architecture - M.Moris Mano, IIIrd Edition, Pearson.
Reference Books:
1. Computer-organization and Design-David A.Paterson and John L.Hennessy-Elsevier.
2. Fundamentals or Computer Organization and Design, -SivaramaDandamudi Springer Int. Edition.
3. Digital Design-Third Edition, M.Morris Mano, Pearson Education/PHI.
APPLIED STATISTICS AND NUMERICAL METHODS

(Common to CSE, CSE(AI&ML), AI&DS, CSE(DS), IT, MECH, BME, CIV, CHE)
Sem Code Week
R22 II – I A63NA BS
3 1 - 4 40 60 100
Course Prerequisites: Linear Algebra and Calculus, Advanced Calculus.

Course Objectives:
1. To enable the students to understand the concepts of probability and Random Variables.
2. To understand Probability distributions, correlation and regression.
3. To create an understanding on various types of sampling distribution and estimations.
4. To train students the basic principles of Statistical Inference.
5. To find roots of a nonlinear equations, system of non-homogenous equation, concept of interpolation and
solutions of Initial Value Problems (IVP) using various numerical methods.
Unit-I: Random Variables
Review of probability, Moments, Random Variables: Discrete and Continuous - Probability distributions, mass
function/ density function of a probability distribution and Distribution function. Mathematical Expectation,
Moment generating function.
Unit-II: Probability distributions, Correlation and Regression

Probability distributions: Binomial, Poisson and Normal Distribution. Evaluation of Statistical parameters: Mean
Variance and their properties.
Correlation-Correlation-Coefficient of Correlation, The rank correlation.
Regression- The lines of regression, properties of regression coefficients.
Unit-III: Sampling Distribution and Estimation
Sampling Distribution: Definitions of population, sample, parameter and statistic, types of sampling, sampling
distribution, Standard error, and Sampling distribution of means and sampling distribution of variance.
Estimation: Point and Interval estimations, Criteria of a good estimator, estimators for means and proportions.
Unit-IV: Tests of Hypothesis

Testing of Hypothesis: Null Hypothesis, Alternative Hypothesis, Type-I and Type-II Errors, critical region,
confidence interval, level of significance, one–tail, two-tail tests, Maximum Error.
Large sample tests: Z-test for single mean, difference of means, single proportion and difference of proportions.
Small sample tests: Student t-test for single mean, difference of means and F-Test for equality of two population
variances, Chi-square test for goodness of fit and independence of attributes.
Unit-V: Numerical Methods
Solution of algebraic and transcendental equations: Bisection method, Newton-Raphson method.
Solution of system of non-homogeneous equations: Gauss Seidel iteration method.
Interpolation: Finite differences, Interpolation using Newton’s forward and backward difference formulae.
Solving first order Ordinary differential equations: Taylor’s series, Euler and modified Euler’s methods, Runge -
Kutta method of fourth order.
Course Outcomes: After completing the course, the students will be able to:
1. To understand the probability in a certain realistic situation using different random variables and calculate
expectations and moments.
2. Solve statistical problems using Binomial, Poisson, Normal distributions and also distinguish correlation and
regression analysis and interpret them.
3. Calculation of sample mean, proportions and estimations of given statistical data.
4. Examine the given statistical hypothesis.
5. Solve algebraic equations, system of non-homogeneous equations using numerical techniques, interpolate the
given experimental data and obtain approximate solutions for ODE.
Text books:
1. B. S. Grewal, Higher Engineering Mathematics, 42nd Edition, Khanna Publishers
2. Probability and Statistics for Engineers, Miller, John E. Freund, PHI
Reference books:
1. R. K. Jain & S. R. K. Iyengar, Advanced Engineering Mathematics, 3 rd ed., Narosa Publishing House, Delhi.
2. Fundamentals of Mathematical Statistics, S. C. Gupta &V. K. Kapoor, Sultan Chand.
3. Erwin Kreyszig Advanced Engineering Mathematics by John Wiley & Sons Publisher.
4. Probability and Statistics for Engineers, Miller, John E. Freund, PHI
5. B.V. Ramana, Higher Engineering Mathematics, Tata Mc Grawhill
6. Introductory methods of numerical analysis by S.S. Sastry, PHI.
INTRODUCTION TO ARTIFICIAL INTELLIGENCE

(Common to All)
Sem Code Week
R22 II – I A63EA ES
2 - - 2 40 60 100
Prerequisites: Linear Algebra and Calculus , Computational Thinking and Programming.

Course Objectives: The students will learn the following
1. State Space Searching techniques to solve a real-world problem
2. Heuristic Searching techniques to optimize a problem iteratively
3. Randomized Search and Emergent Systems to determine the best solution for the developed model.
4. Optimal Path algorithms to determine shortest paths in different circuits
5. Problem Decomposition to decompose a problem into manageable sub-components is a necessity in complex
problem-solving tasks.
UNIT – I
Introduction: Artificial Intelligence, Historical Backdrop, What is Artificial Intelligence, AI Agents –types of Agents,
Applications of AI.
State Space Search: Generate and Test, Simple Search, Depth First Search (DFS), Breadth First Search (BFS),
Comparison of BFS and DFS, Depth Bounded DFS (DBDFS), Depth First Iterative Deepening (DFID).
UNIT – II
Heuristic Search: Heuristic Functions, Best First Search, Hill Climbing, Local Maxima, Solution Space Search,
Variable Neighborhood Descent, Beam Search, Tabu Search, Peak to Peak Methods.
UNIT – III
Randomized Search and Emergent Systems: Iterated Hill Climbing, Simulated Annealing, Genetic algorithms, the
Travelling Salesman Problem, Neural Networks, Emergent Systems.
UNIT – IV
Finding Optimal Paths: Brute Force, Branch and Bound, Refinement Search, Dijkstra’s Algorithm, Algorithm A*,
Admissibility of A*, Iterative Deepening A* (IDA*), Recursive Best First Search (RBFS), Pruning the Closed List,
Pruning the Open List, Divide and Conquer Beam Stack Search.
UNIT –V
Problem Decomposition: SAINT, Dendral, Goal Trees, Rule based Systems, XCON, Rule Based Expert Systems.
Case Studies: -Autonomous Vehicle, Medical Image Analysis.
Course Outcomes:
After successful completion of the course, the students will be able to:
1. Apply appropriate State Space Searching techniques to solve a real-world problem (BL3)
2. Apply appropriate Heuristic Searching techniques to solve a real-world problem (BL3)
3. Analyze the problem and infer new knowledge using Randomized Search and Emergent Systems. (BL4)
4. Apply Optimal Paths Algorithms to real world problems (BL3)
5. Analyze the Problem Decomposition Methods and their test cases (BL4)
Text Books:
1. A First Course in Artificial Intelligence, Deepak Khemani, Tata Mc-Graw Hill Education, 2013.
References:
1. 2. AI–A Modern Approach, Stuart Russel, Peter Norvig, 4 th Edition, Pearson Education, 2010.
2. Artificial Intelligence, Kevin Knight, Elaine Rich, ShivShankar B.Nair, 3rd Edition, Tata Mc-Graw Hill Education,
2019.
DATA STRUCTURES LAB

Sem Code Week
R22 II – I A631E PC
- - 2 1 40 60 100
Prerequisites: Computational Thinking and Programming Lab
Course Objectives:
complexities.
2. Implement the sorting, hashing and collision resolution techniques.
3. Develop linear data structures for stacks & queues using arrays.
4. Develop singly, doubly & circular linked list data structures.
5. Illustrate binary tree and binary search trees using arrays & doubly linked list and Understand graph types,
representations and graph traversal algorithms.
List of Experiments:
Week 1:
● Write a recursive program for calculation of Factorial of an integer.
● Write a recursive program which computes the n th Fibonacci number, for appropriate values of n.
Week 2:
● Write a recursive program for calculation of GCD.
● Write a recursive program for Towers of Hanoi: N disks are to be transferred from Peg S to Peg D with Peg I as the
intermediate Peg.
Week 3:
● Write a program that implement Linear Search, to search for a given element.
● Write a program that implement Binary Search, to search for a given element.
Week 4:
● Write a program that implement Bubble Sort, to sort a given list of integers in ascending order.
● Write a program that implement Selection Sort, to sort a given list of integers in ascending order.
Week 5:
● Write a program that implement Insertion Sort, to sort a given list of integers in ascending order.
● Write a program that implement Quick Sort, to sort a given list of integers in ascending order.
Week 6:
● Write a program that implement Merge Sort, to sort a given list of integers in ascending order.
● Write a program that implement Counting Sort, to sort a given list of integers in ascending order.
Week 7:
● Write a program that implement Stack (its operations) using arrays.
● Write a program that uses Stack operations to convert infix expression into postfix expression.
● Write a program that uses Stack operations to evaluate a given postfix expression.
Week 8:
● Write a program that implement Queue (its operations) using arrays.
● Write a program that implement Circular Queue (its operations) using arrays.
● Week 9:
● Write a program that uses functions to create a singly linked list and its operations.
● Write a program to reverse elements of a single linked list.
● Write a program to merge two single linked lists.
Week 10:
● Write a program to create a Circular Linked list and its operations.
● Write a program to Create a Double Linked list and its operations.
Week 11:
● Write a recursive program, for traversing a binary tree in pre-order, in-order and post-order.
● Write a program to create a Binary Search Tree and its operations.
Week 12:
● Write a program to program BFS traversal on given graph.
● Write a program to program DFS traversal on given graph.
Course Outcomes:
complexities. (BL-2)
2. Implement sorting, hashing and collision resolution techniques. (BL-2)
3. Develop linear data structures for stacks, queues using arrays. (BL-3)
4. Develop singly, doubly & circular linked list data structures. (BL-3)
5. Illustrate binary tree and binary search trees using arrays, linked representations and Understand graph types,
representations and graph traversal algorithms. (BL-3)
Text Books:
1. Data Structures, 2/e, Richard F, Gilberg , Forouzan, Cengage
References:
1. Data Structures using C, Aaron M. Tanenbaum, Yedidyah Langsam, Moshe J Augenstein, Pearson
2. Data structures and Algorithm Analysis in C, Mark Allen Weiss, Pearson Education. Ltd., Second Edition
SOFTWARE ENGINEERING AND DESIGN LAB

Sem Code Week
R22 II – I A632E PC
- - 2 1 40 60 100
Course Objectives:
1. To write the problem statement for the given system.
2. Specify software requirements using Dataflow Diagram.
3. Specify software requirements using Use case diagram.
4. To draw the structural UML diagrams for the given specification.
5. To draw the behavioral UML diagrams for the given specification.
List of Experiments:
Week 1
Identify a Software system that needs to be developed.
Week 2
Document the Software Requirements Specification (SRS) for the identified system.
Week 3
Draw level 0, level 1, and level 2 Data Flow Diagram (DFD) for the identified System.
Week 4
Draw the Class diagrams and show various class relationships.
Week 5
Draw the Package diagram and show various relationships.
Week 6
Draw UML Component diagram for the identified system.
Week 7
Draw UML Deployment diagram for the identified system.
Week 8
Identify Use cases and develop the Use Case model with include and extend relationships.
Week 9
Using the identified scenarios, find the interaction between objects and represent them using a Sequence diagram.
Week 10
Using the identified scenarios, find the interaction between objects and represent them using a Collaboration
diagram.
Week 11
Draw relevant Activity Diagrams for the same system.
Week 12
Draw relevant State chart diagram for the same system.
Suggested Domains
1. Online course registration system

2. Airline/Railway reservation system
3. Exam registration
4. Stock maintenance system
5. Recruitment system
6. Library management system
7. Student information system
8. ATM
OUTCOMES:
Upon completion of this Lab, the students will be able to:
1. Articulate the problem statement for the given software system. (BL 2)
2. Capture the requirements for an intended software system using DFD. (BL 2)
3. Capture the requirements for an intended software system using use case Modeling. (BL 2)
4. Construct the structural UML diagrams for the given system. (BL2)
5. Construct the behavioral UML diagrams for the given system. (BL 2)
HARDWARE REQUIREMENTS
Standard PC
SOFTWARE REQUIREMENTS
1. Windows 7 or higher
2. StarUML that supports UML 1.4 and higher
ENVIRONMENTAL SCIENCE & RURAL SENSITIZATION

(Mandatory Course)
Sem Code Week
R22 II – I A634N MC
2 - - - - - -
Course Objectives: The course should enable the students to:

1. Understanding the importance of ecological balance & conservation of biodiversity.
2. To educate students about natural resources and their exploitation
3. Convey a clear idea of the interdisciplinary of environmental and safety-health risk management
4. To create awareness on village empowerment
5. To inculcate the habits of good health and hygiene
Unit-I: Ecosystem and Biodiversity (8 Periods)

Introduction to Ecosystem, types and functions of ecosystem, Value of biodiversity, Conservation of biodiversity: In
situ conservation & Ex. situ conservation
Activity:
1. Studying the nearest lake water/farm land/forest Eco systems and preparing document and creating
awareness programs among public in mitigating pollution.
2. Poster presentation on nutrient cycles.
Unit-II: Energy & Water Resources (10 Periods)

Introduction: Non-conventional energy resources (solar/wind/tidal) Water management (rain water harvesting,
watershed management and water conservation) Global Environmental Challenges: Global warming and climate
change, acid rains, ozone layer depletion. Solid Waste Management: Sources, classification, effects and control
measures of urban and industrial solid wastes
Activity:
1. Conducting mass level cycling for making aware of public in minimizing use of fossil fuels (ECO CLUB
ACTIVITY).
2. To prepare rain water harvesting models.
3. To demonstrate the generation of electricity with the utilization of non-conventional energy resources.
Unit-III: Green Chemistry & Hazardous Chemicals (10 Periods)

Green Chemistry: Introduction & Principles. Classification of hazardous chemicals, transportation of hazardous
chemicals, Hazchem code, Storage and handling of hazardous substances, Emergency preparedness (on site &
offsite), Safety audit, Concept of fire and explosion, Major accidents involving hazardous substances, e-waste
management
Activity:
1. To makes the flow chart on any one project
2. Mass level plantation programs and involving students in Government programs.
3. e-waste management
Unit-IV: Empowering Villages (10 Periods)

Jugaad –adapting latest developments- rural technologies –strategies-value addition-marketing the products-types
of soils, important features of agriculture- vegetable crops-field crops-horticulture-fruit crops-flowery culture- green
house-poly house.
Activity: Field visits and Interaction with farmers
Unit-V: Health and Hygiene (10 Periods)

Vitamins (definition& classification)-deficiency disease –balanced and nutrition diet-Awareness of contagious
diseases-Epidemics-endemics-pandemics
Activity: Visit to local health centers.
Course Outcomes: After completing the course, the students should be able to:
1. Interpret the importance of functions of ecosystem & conservation of biodiversity.
2. Choose the correct methods to reduce Global problems.
3. Identify the hazardous chemicals.
4. Outline role of technology in empowering villages.
5. Create better awareness on health and hygiene.
Text Books:
1. A Textbook of Environmental Studies for Undergraduate Courses by Erach Bharucha for UGC 2014.
2. Environmental Studies by R. Raja gopalan, 2nd Edition, 2011, Oxford University Press
Reference Books:
1. A Textbook of Environmental Studies by Shaashi Chawla, TMH,New Delhi 2011.
2. A Textbook of Environmental Studies by Anubha Kaushik, Fourth Edition, New Age International Publishers,
2014
3. Text book of Environmental Science & Technology – Dr.M. Anji Reddy,2007, BS Publications.
4. Text Book of Environmental Studies by Deeshita Dave & P. Udaya Bhaskar, Cengage Learning 2008
5. Environmental Studies by K.V.S.G. Murali Krishna, VGS Publishers, Vijayawada. 2012
6. Environmental Studies by Benny Joseph, Tata McGraw Hill Co, New Delhi. 2008
II YEAR II SEMESTER
JAVA PROGRAMMING
(Common to CSE, IT)
Sem Code Week
R22 II – II A64HA PC
3 - - 3 40 60 100
Prerequisites: Computational Thinking and Programming, Data Structures.

Course Objectives: The students will learn the following
1. To understand the basic concepts and fundamentals of platform independent object oriented language.
2. To Compare Tightly Coupled and Loosely Coupled Programming.
3. To demonstrate skills in writing programs using exception handling techniques and multithreading.
4. To Utilize the built-in Data Structures and different JDBC Drivers
5. To use GUI components from AWT and Swings packages
UNIT – I (Text book-1, Chapter-1 to 6) (10 Periods)
Java Programming: History of Java, Comments, Data Types, Variables, Constants, Scope and Lifetime of Variables,
Operators, Hierarchy Expressions, Type Conversions and Casting, Enumerated Types, Control for Block Scope,
Conditional Statements, Loops, Break and Continue Statements,
Simple Java Standalone Programs, Arrays, Console Input and Output, Formatting Output, Constructors, Methods,
Parameter Passing, Static Fields and Methods, Access Controls, This Reference, Overloading Methods and
Constructors, Recursions, Garbage Collections, Building Strings, Exploring Strings Class.
UNIT – II (Text book-1, Chapter-7 to 9) (10 Periods)
Inheritance and Packages:
Inheritance: Inheritance Hierarchies Super and SubClasses, Member Access Rules, Super Keyword, And Preventing
Inheritance: Final Classes and Methods, The Object Class and Its Methods.
Polymorphism: Dynamic Binding, Method Overloading, Abstract Classes and Methods.
Interface: Interface vs. Abstract Classes, defining an Interface, Implementing Interfaces, Accessing Implementations
Through Interfaces References, Extending Interface.
Packages: Defining, Creating and Accessing a Package, Understanding Class path, Importing Packages.
UNIT – III (Text book-1, Chapter- 10 to 12) (10 Periods)

Exception Handling: Exception and Error, Exception Types, Exception Handler, Exception Handling Clauses – try,
catch, finally, throws and the throw statement, Built-in-Exceptions and Custom Exceptions.
Multithreading: Difference Between Multiple Processes and Multiple Threads, Thread States, Creating Threads,
Interrupting Threads, Thread Priorities, Synchronizing Threads, Inter-Thread Communication, Producer Consumer
Pattern.
UNIT – IV (Text book-1, Chapter- 14) (9 Periods)

Collections and JDBC:
Collection Framework in Java: Introduction to Java Collections, Overview of Java Collection Framework, Generics,
commonly used Collection Classes-Array List, Vector, Hash Table, Stack, Enumeration, Iterator, String Tokenizer,
Scanner, Calendar and Properties.
Connecting to Database: JDBC Type I to IV Drivers, connecting to a Database, querying a Database and Processing
the Results, Updating Data with JDBC.
UNIT –V (Text book-1, Chapter- 17 to 21) (9 Periods)

GUI Programming with Swing : Introduction, limitations of AWT, MVC architecture, components, containers,
Layout Manager Classes, Simple Applications using AWT and Swing.
Event Handling: The Delegation event model- Events, Event sources, Event Listeners, Event classes, Handling
mouse and keyboard events, Adapter classes.
Course Outcomes: After completion of course the student would be able to,
1. Use the syntax and semantics of java programming language and basic concepts of OOP. (BL 1)
2. Develop reusable programs using the concepts of inheritance, polymorphism, interfaces and packages. (BL 2)
3. Apply the concepts of Multithreading and Exception handling to develop efficient and error free codes. (BL 3)
4. Utilize the built-in Data Structures and JDBC Drivers to handle large data sets. (BL 3)
5. Design event driven GUI and web related applications which mimic the real world scenarios. (BL 3)
Text Books:
1. Java Fundamentals: A Comprehensive Introduction, Herbert Schildt and Dale Skrien, TMH.
References:
1. Java for Programming, P.J.Dietel Pearson Education
2. Object Oriented Programming through Java, P.Radha Krishna, Universities Press.
3. Thinking in Java, Bruce Eckel, Pearson Education
4. Programming in Java, S.Malhotra and S.Choudhary, Oxford University Press.
DATABASE MANAGEMENT SYSTEMS

(Common to CSE, IT, CSE(AI&ML))
Sem Code Week
R22 II – II A64EA PC
3 - - 3 40 60 100
Prerequisites: Computational Thinking and Programming, Data structures, Mathematical Foundations of Computer
Science
Course Objectives:
1. To learn the fundamentals of database systems and database design

2. To learn the Relational Model using SQL and formulate basic SQL Queries
3. To learn the Schema Refinement approaches for effective Database Design.
4. To learn the Importance of Transactions, and analyze the importance of recovery management
5. To learn the internal storage structures using different file and indexing techniques
UNIT – I (Text Book1: Chapter (1,2)) (10 Periods)

Introduction to Database System:
Introduction-Database System Applications, Purpose of Database Systems, View of Data, Instance and Schema,
Data Models, Database Languages - DDL, DML, DCL, TCL, Database System Structure, History of Data base
Systems
Introduction to Database Design:
Introduction to Data base design steps, ER diagram, Keys, Beyond ER Design, Entities, Attributes and Entity sets,
Relationships and Relationship sets, Additional features of ER Model, Conceptual Design for Large enterprises: Case
study
UNIT – II (Text Book2: Chapter (4,5)) (10 Periods)

Introduction to Relational Model: Structure of Relational Model, Constraints, Relational Algebra, Relational
Calculus: TRC, DRC.
Form of Basic SQL Query: SQL fundamentals, Examples of Basic SQL Queries, Introduction to Nested Queries,
Correlated Nested Queries, Set - Comparison Operators, Aggregate Operators, NULL values, Logical connectives,
Outer Joins, Complex Integrity Constraints in SQL, Views, Triggers.
UNIT – III (Text Book1: Chapter (7)) (8 Periods)

Relational-Database Design: Problems Caused by redundancy, Decompositions - Problem related to decomposition,
Functional Dependencies - Reasoning about FDS, Normal Forms - FIRST, SECOND, THIRD Normal forms - BCNF -
Properties of Decompositions - Loss less join Decomposition, Dependency preserving Decomposition, Multi valued
Dependencies - FOURTH Normal Form, Join Dependencies, FIFTH Normal form, Inclusion Dependencies.
UNIT – IV (Text Book1: Chapter (5))

Transaction Management Recovery (10 Periods)
Transaction and Concurrency Control – ACID Properties, Schedules, Serializability, need for Concurrency,
Locking Protocols – Two Phase Locking, Deadlock, Timestamp Based Protocols, Validation Based Protocols.
Recovery Systems: Failure Classification, Log Based Recovery, ARIES, Check Points, Save Point, Buffer
Management, Remote Back Up Systems
UNIT –V (Text Book2: Chapter (8))

Overview of Storage and Indexing: (10 Periods)
Data on External Storage – overview of physical storage media, RAID-File Organization and Indexing-Data Dictionary
Storage– Cluster Indexes, Primary and Secondary Indexes – Index data Structures – Hash Based Indexing – Tree
base Indexing ––B+ Trees: A Dynamic Index Structure.
Course Outcomes:
1. Demonstrate the fundamental elements of database systems and database design (BL2)
2. Identify the importance of relational model and solve Queries using SQL (BL3)
3. Apply Functional dependencies and decomposition rules for database design (BL3)
4. Identify the Transaction Processing systems and Recovery methods. (BL3)
5. Compare basic database storage structures and access techniques (BL4)
Text Books:
1. Abraham Silberschatz, Henry F. Korth, S. Sudharshan, ―1Database System Concepts ‖,Sixth Edition, Tata
McGraw Hill, 2011.
2. Data base Management Systems, Raghurama Krishnan, Johannes Gehrke, McGrawHill Education, 3rd Edition,
2003.
References:
1. C. J. Date, A.Kannan, S. Swamynathan, ―An Introduction to Database Systems ‖, Eighth Edition, Pearson
Education, 2006
2. Ramez Elmasri, Shamkant B. Navathe, ―Fundamentals of Database Systems‖, Sixth Edition, Pearson, 2011
3. G.K.Gupta,"Database Management Systems‖, Tata McGraw Hill, 2011.
DESIGN AND ANALYSIS OF ALGORITHMS
(Common to CSE & IT)
Sem Code Week
R22 II – II A64EB PC
3 - - 3 40 60 100
Prerequisite: Computational Thinking and Programming
Course Objectives: The students will learn the following:
1. Relate the algorithmic properties with mathematical approaches to design algorithms for real time
problems.
2. Extend divide and conquer strategies to solve complex problems in easy ways.
3. Make use of optimization techniques to solve real world problems.
4. Construct state space trees to explore the solutions and find an optimal solution for logical
problems.
5. Categorize and solve computational problems using deterministic and non-deterministic
algorithms.
Unit I: (9 Periods)
Introduction: Algorithm, Characteristics of Algorithms, Various areas of study, Pseudo code for expressing
Algorithms, Performance Analysis, Space Complexity, Time Complexity, Asymptotic Notations.
Unit II: (9 Periods)

Disjoint Sets: Disjoint Sets, Disjoint Set Operations, Union and Find Algorithms, Graphs & Trees, Graph Traversal
Techniques, Tree Traversal Techniques, Spanning Trees.
Divide and Conquer: General method, Applications: Binary Search, Merge Sort, Quick Sort, Strassen’s
MatrixxMultiplication.
Unit III: (11 Periods)

Greedy Method: General Method, Applications-Job Sequencing with Deadlines, Knapsack Problem, Minimum Cost
Spanning Trees, Single Source Shortest Path Problem.
Dynamic Programming: General Method, Applications-Matrix Chain Multiplication, 0/1 Knapsack
Problem, All Pairs Shortest Paths Problem, Reliability Design, Travelling Salesperson
Problem, Multistage Graphs.
Unit IV: (10 Periods)

Backtracking: General Method, Applications-N-Queens Problem, Sum of Subsets Problem, Graph Coloring,
Hamiltonian Cycles.
Branch and Bound: General Method, LIFO Branch and Bound Solution, FIFO Branch and Bound Solution and LC
Branch and Bound Solution.
Unit V: (9 Periods)
NP-Hard and NP-Complete Problems: Basic Concepts, Decision Vs. Optimization Problems, Deterministic and Non-
Deterministic Algorithms, Boolean SAT Problems, K-CNF and examples.
Course Outcomes: Upon the successful completion of the course, the student will be able to:
1. Define and calculate the complexity of algorithms in terms of space and time. (BL-1)
2. Infer the knowledge of divide and conquer technique to solve complex problems. (BL-2)
3. Apply optimization techniques to find optimal solutions for real world problems. (BL-3)
4. Articulate state space trees to find optimal solutions for logical problems. (BL-3)
5. Analyze and solve computational problems using deterministic and non-deterministic algorithms.
(BL-4)
Text Book:
1. Fundamentals of Computer Algorithms, Ellis Horowitz, Sartaj Sahni and Rajasekharan, Galgotia
publications Pvt. Ltd.
Reference Books:
1. Algorithm Design: Foundations, Analysis and Internet examples, M.T.Goodrich and R.Tomassia,
John wiley and sons.
2. Introduction to Algorithms, second edition, T.H.Cormen, C.E.Leiserson, R.L.Rivest,andC.Stein, PHI

Pvt. Ltd./ Pearson Education.
3. Design and Analysis of algorithms, Aho, Ullman and Hopcroft, Pearson education.
AUTOMATA THEORY AND COMPUTATION

Sem Code Week
R22 II – II A64E1 PC
3 - - 3 40 60 100
Prerequisites:
1. Linear Algebra and Calculus
2. Mathematical Foundations of Computer Science
3. Data Structures.
Course Objectives:
1. Introduce concepts in automata theory and its equivalences.
2. Identify different types of formal language and their relationships.
3. Design grammar and recognizers for different formal languages.
4. Prove or disprove theorems in automata theory using its properties.
5. Determine the decidability and intractability of computational problems.
UNIT – I (11 Periods)

Fundamentals: Strings, Alphabet, Language, Operations, Chomsky Hierarchy of Languages, Finite State Machine,
Definitions, Finite Automaton Model, Acceptance of Strings and Languages, Deterministic Finite Automaton and
Non Deterministic Finite Automaton, Transition Diagrams and Language Recognizers. Finite Automata: NFA with î
Transitions - Significance, Acceptance of Languages. Conversions and Equivalence: Equivalence between NFA with
and without î Transitions, NFA to DFA Conversion, Minimization of FSM, Equivalence Between Two FSMs, Finite
Automata with Output- Moore and Melay Machines.
UNIT – II (8 Periods)
Regular Languages: Regular Sets, Regular Expressions, Identity Rules, Constructing Finite Automata for a given
Regular Expressions, Conversion of Finite Automata to Regular Expressions. Pumping Lemma of Regular Sets,
Closure Properties of Regular Sets (Proofs Not Required).
Grammar Formalism: Regular Grammars -Right Linear and Left Linear Grammars, Equivalence between Regular
Linear Grammar and FA, Inter-Conversion.
UNIT – III (10 Periods)

Context Free Grammars: Context Free Grammar, Derivation Trees, Sentential Forms, Right Most and Leftmost
Derivation of Strings. Ambiguity in Context Free Grammars. Minimization of Context Free Grammars. Chomsky
Normal Form, Greiback Normal Form, Pumping Lemma for Context Free Languages. Enumeration Properties of CFL
(Proofs Omitted).
UNIT – IV (9 Periods)
Pushdown Automata: Pushdown Automata, Definition, Model, Acceptance of CFL, Acceptance by Final State and
Acceptance by Empty State and Its Equivalence. Equivalence of CFL and PDA, Interconversion. (Proofs Not
Required). Introduction to DCFL and DPDA.
UNIT –V (10 Periods)

Turing Machine: Turing Machine, Definition, Model, Design of TM, Computable Functions, Recursively
Enumerable Languages, Counter Machine, Linear Bounded Automata and Context Sensitive Languages.
Computational Theory: Decidability of Problems, Universal Turing Machine, Undecidability, Posts Correspondence
Problem, Turing Reducibility, Definition of P and NP Problems, NP Complete and NP Hard Problems.
Course Outcomes: Upon the successful completion of the course, the student will be able:
1. Outline the Chomsky Hierarchy of Languages and their applications, illustrate the working of Finite State Machines
(Machines without output and Machines with output), their inter-conversions and equivalences. (BL-2)
2.Illustrate the use of regular expressions, regular grammars and regular languages to recognize the finite state
machines, their inter-conversions, equivalences and apply pumping lemma to check the satisfiability of a language
to be regular language. (BL-2)
3.Illustrate different sentential forms of context free grammar, normal forms of context free grammars and apply
pumping lemma to check the satisfiability of a language to be context free language. (BL-2)
4.Classify the acceptance of context free grammars/languages by pushdown automata and their equivalence. (BL-4)
5.Construct the Turing Machines, evaluate its relationship with basic computer/mathematical model, interpret
language acceptance of Turing Machines, Linear Bounded Automata and P and NP Problems. (BL-3)
Text Books:
1. Introduction to Automata Theory Languages and Computation. Hopcroft H.E, Ullman J. D. Pearson Education.
References:
1. Introduction to Theory of Computation, Sipser, Second Edition.
2. Introduction to Computer Theory, Daniel I.A. Cohen, John Wiley.
3. Introduction to languages and the Theory of Computation, John C Martin, TMH.
4. Elements of Theory of Computation, Lewis H.P. & Papadimition C.H. Pearson /PHI.
5. Theory of Computer Science – Automata Languages and Computation, Mishra and Chandrashekaran, 2nd
Edition, PHI.
JAVA PROGRAMMING LAB
Sem Code Week
R22 II – II A641H PC
- - 2 1 40 60 100
Pre-requisites: Computational Thinking and Programming, Data Structures.
Objectives: The students will learn the following
1. Infer the knowledge of Java compiler and eclipse platform
2. Gain hands on experience with Java programming
3. Gain knowledge on developing Java database applications
4. To understand Java applet programming
5. To understand building Java GUI based applications using swing
List of Programs:
Week-1:
1. Write a JAVA program to display default values of all primitive data types of JAVA.
2. Write a JAVA program to display the roots of a quadratic equation ax +bx+c =0. Calculate the discriminant D
2
and basing on the value of D, describe the nature of roots.

3. Write a JAVA program to give the example for ‘this’ operator. And also use the ‘this’ keyword as a return
statement.
4. Write a JAVA program to demonstrate static variables, methods, and blocks.
Week-2:
1. Write a JAVA program to give the example for ‘super’ keyword.
2. Write a JAVA program that illustrates simple inheritance.
3. Write a JAVA program that illustrates multi-level inheritance.
4. Write a JAVA program demonstrating the difference between method overloading and method overriding.
5. Write a JAVA program demonstrating the difference between method overloading and constructor
overloading.
Week-3:
1. Write a JAVA program that describes exception handling mechanisms.
2. Write a JAVA program for example of try and catch block. In this check whether the given array size is
negative or not.
3. Write a JAVA program to illustrate sub class exception precedence over base class.
4. Write a JAVA program for creation of user defined exceptions.
Week-4:
1. Write a JAVA program to illustrate creation of threads using runnable class. (start method starts each of the
newly created threads. Inside the run method there is sleep () to suspend the thread for 500 milliseconds).
2. Write a java program that implements a multi-thread application that has three threads. First thread
generates a random integer every 1 second and if the value is even , the second thread computes the square
of the number and prints. If the value is odd, the third thread will print the value of the cube of the number.
Week-5:
1. Write a JAVA program illustrating multiple inheritance using interfaces.
2. Write a JAVA program for Abstract Class and Interfaces.
Week-6:
1. Write a JAVA program to create a package named pl, and implement this package in ex1 class.
2. Write a Java Program for Implementation of Access Modifiers using various levels of Packages.
3. Write a Java Program Using String Tokenizer (Reverse the Big String & Count the number of Words, Reverse
the Words in the given String).
Week-7:
1. Write a java program that connects to a database using JDBC and does add, delete, modify and retrieve
operations.
Week-8:
1. Write a Simple Java Program based on Java Collections (ArrayList, Queue, Stack and Vectors etc)..
Week-9:
1. Write a JAVA program to Implement the various components in AWT (textarea, textfield, buttons, Layout
Control etc)
Week-10:
1. Write a JAVA program to Implement the various components in Swings (JFrame, JLabel, JApplet etc).
Week-11:
1. Write a java program that works as a simple calculator. Use a grid layout to arrange buttons for the digits
and for the +,-,*,/,% Operations. Add a text field to display the results. Handle any possible exceptions like
divided by zero.
Week-12:
1. Java Program for handling the Mouse, Key and Window Events Implementation.
Outcomes: After completion of the course, the students would be able to:
1. Develop the standalone applications for Multi-Threaded and Exceptions Handling.
2. Apply OOP in java programming in problem solving.
3. Ability to access data from a database with java programming.
4. Develop Java applets and applications
5. Develop Java applications using swing.
Textbooks:
1. Java Fundamentals- A Comprehensive introduction, Herbert schildtand Dale skrien, TMH.
2. Java for programming, P.J.Dietel Pearson education (OR) Java: How to Program P.J.Dietel and H.M.Dietel,
PHI
3. Object Oriented Programming through java, P.Radha Krishna, Universities Press.
4. Thinking in Java, Bruce Eckel, Pearson Education
5. Programming in Java, S.Malhotra and S.Choudhary, Oxford Univ Press.
DATABASE MANAGEMENT SYSTEMS LAB

(Common to CSE, IT)
Sem Code Week
R22 II – II A641E PC
- - 2 1 40 60 100
Pre-requisites: Computational Thinking and Programming, Data Structures.

Course objectives: This course will enable students to
1. Foundation knowledge in database concepts, technology and practice to groom students into well informed
database application developers.
2. Strong practice in SQL programming through a variety of database problems.
3. Develop database applications using front-end tools and back-end DBMS
4. Interpret the knowledge on database design.
5. Determine the knowledge on key constraints and Normalization.
6. Determine the knowledge on triggers, procedures, cursors and functions.
Experiment 1: Working with ER Diagram and Normalization

Example: ER Diagram for Sailors Database Entities:
1. Sailor
2. Boat
Relationship: Reserves
Primary Key Attributes:
1. SID (Sailor Entity)
2. BID (Boat Entity)
Note:
Analyze the given data carefully and come up with the entities in it. Identify what data has to be persisted in the
database. This contains the entities, attributes etc. Identify the primary keys for all the entities. Identify the other
keys like candidate keys, partial keys, if any.
Note: The student is to submit a document by writing the entities, relationships and key to the lab faculty.
Experiment 2: Working with DDL, DML, DCL and Key Constraints Creation, Altering and Dropping of Tables and
Inserting rows into a Table (Use Constraints While Creating Tables) Examples Using Select Command.
Experiment 3: Working with Queries and Nested QUERIES Queries (along with sub Queries) using ANY, ALL, IN,
EXISTS, NOTEXISTS, UNION, INTERSET, Constraints
Experiment 4: Working with Queries USING Aggregate Operators & views Queries using Aggregate Functions
(COUNT, SUM, AVG, MAX and MIN), GROUP BY, HAVING and Creation and Dropping of Views
Experiment 5: Working with Conversion Functions & String Functions 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 Functions (Sysdate, next_day, add_months, last_day, months_between, least,
greatest, trunc, round, to_char, to_date)
Experiment 6: Working with Triggers using PL/SQL Develop Programs using BEFORE and AFTER Triggers, Row
and Statement Triggers and INSTEAD OF Triggers
Experiment 7: Working with PL/SQL Procedures Programs Development using Creation of Procedures, Passing
Parameters IN and OUT of PROCEDURES
Experiment 8: Working with LOOPS using PL/SQL and Exception Handling Program Development using WHILE
LOOPS, Numeric FOR LOOPS, Nested Loops using ERROR Handling, BUILT-IN Exceptions, USE Defined
Exceptions, RAISE- APPLICATION ERROR
Experiment 9: Working with Functions Using PL/SQL Program Development using Creation of Stored Functions,
Invoke Functions in SQL Statements and Write Complex Functions.
Experiment 10: Working CURSORS Develop Programs using Features Parameters in a CURSOR, FOR UPDATE
CURSOR, WHERE CURRENT of Clause and CURSOR Variables
Experiment11: Installation of MYSQL and verification of online platforms to support creation of database
through online mode.
Outcomes: After completion of the course, the students will be able to:
1. Apply DDL, DML, DCL Commands using SQL. (BL-3)
2. Construct an Entity Relationship model for any large Enterprise. (BL-3)
3. Apply key constrains to the relational model. (BL-3)
4. Apply triggers, procedures and functions using PL/SQL (BL-4)
5. Develop Cursors for dynamic database applications (BL-5)
Textbooks:
1. Oracle PL/SQL by Example, Benjamin Rosenzweig, Elena Silvestrova, Pearson Education 3rd Edition
Reference Books:
1. Oracle Database LogG PL/SQL Programming, Scott Urman, Tata Mc-Graw Hill.
2. SQL and PL/SQL for Oracle 10g, Black Book, Dr .P.S. Deshpande.
BUSINESS COMMUNICATION LAB

(For CSE, ECE, CIVIL, EEE, MECH, BME, CHE, PHE, IT, AI&DS, CSE(AI&ML), CSE(DS))
Sem Code Week
R22 II – II A641N HS
- - 2 1 40 60 100
Course Objectives:
1. To inculcate the habit of reading short and critical texts.
2. To comprehend the content while listening.
3. To articulate thoughts and ideas eloquently.
4. To enable students to write grammatical and meaningful sentences.
5. To impart confidence and competence in expressing their views.
Experiment-I
Week -1 & 2:
Listening: Listening to short conversations.
Speaking: Giving information about oneself and giving short talk on business related topics.
To gather information from conversations thereby deliver short talks based on business topics.
Week-3:
Reading: Reading short texts to understand the central idea/theme.
Writing: Writing a piece of internal business communication of 30-40 words (Email).
To read for central idea/theme in passages, write responses in business communication.
Experiment-II
Week-4 & 5:
Listening: Listening to peer group and taking notes.
Speaking: Talking critically on business related topics and issues.
To inculcate and improve on note taking while listening, respond appropriately to critical business talks.
Week-6:
Reading: Reading graphs and business news by using sub-skills of reading.
Writing: Writing business proposals in 50-60 words.
To decode information from pictorial representation and get skilled in writing business proposals.
Experiment-III
Week-7:
Listening: Listening to interviews and taking notes.
Speaking: Debates.
To observe the skills and answering techniques from Interview videos, participate in debates and presentations
spontaneously.
Week-8:
Reading: Reading a longer text to understand and locate specific information.
Writing: Write a Business Letter or e-Mail of 60-80 words, based on an input text and some notes.
To overcome ambiguity while reading passages and write responses to business letters.
Experiment-IV
Week-9:
Listening: Listening to songs and writing down the lyrics.
Speaking: Business Presentations.
To listen and write lyrics of English songs; and to make business presentations.
Week-10:
Reading: Read a longer text and answer questions.
Writing: Write a short play.
To comprehend longer passages and practice the creative skill of story writing.
Experiment-V
Week-11:
Listening: Watching documentaries and making notes.
Speaking: Open Mike.
To practice the skills of making notes from documentaries and take opportunity confidently in public speaking.
Week-12:
Reading: Critical Reading to know the author's perspective.
Writing: Writing a business report.
To read passages and understand the writer’s intention and prepare business report.
Infrastructure:
● Classroom with a projector
Course Outcomes:
The students will be able to:
1. Write business emails by comprehending the central idea and express opinions and respond in business
scenarios.
2. Make speeches on business related topics, analyze and respond to the graphical texts in written and spoken
contexts.
3. Perform well in debates and take notes effectively while listening.
4. Make business presentations effectively and write short stories.
5. Critically analyze the text and report effectively in business scenarios.
Suggested Reading:
1. Cambridge University Press India Pvt. Ltd, New Delhi.
2. MandalS.K(2006), Effective Communication &Public Speaking, Jaico Publishing House, New Delhi.
3. Grant Taylor (2004), English Conversation Practice, Tata McGraw Hill, New Delhi.
4. Balasubramanian.T(2000),A textbook of English Phonetics for Indian Student, MacMillan Publishers, India.
5. KamaleshSadanand,SusheelaPunitha(2008),SpokenEnglish:AfoundationCourse:Parts1& 2, New Delhi, Orient
Longman Pvt. Ltd
Web References:
1. www.cambridgeenglish.org.
2. www.esl-lab.com
MINOR PROJECT
Year/ Course Periods /
Sem Code Week
L T P C CIA SEE Total
R22 II – II A641X PW
- - 4 2 40 60 100
Course Objectives:
1. To enhance creative thinking in engineering.
2. To conceptualize an idea/technique.
3. To appreciate the multi-disciplinary environment.
4. To grow skills in managing and implementing a project.
✔ A multidisciplinary project to be taken up by a team of students. By using the knowledge gained

during the semester, the students will initiate creativity in developing a minor project. A combined report is
to be submitted. A presentation is to be made for the reviewers on the work done by the candidate.
Course Outcomes:
The student will be able to:

1. Perform creatively and correlate the subjects learnt so far.
2. Conceptualize a simple engineering problem.
GENDER SENSITIZATION
(Mandatory Course)
Sem Code Week
R22 II – II A643N MC
2 - - - - - -
Course Description
This course offers an introduction to Gender Studies, an interdisciplinary field that asks critical questions about the
meanings of sex and gender in society. The primary goal of this course is to familiarize students with key issues,
questions and debates in Gender Studies, both historical and contemporary. It draws on multiple disciplines – such
as literature, history, economics, psychology, sociology, philosophy, political science, anthropology and media
studies – to examine cultural assumptions about sex, gender, and sexuality.
This course integrates analysis of current events through student presentations, aiming to increase awareness of
contemporary and historical experiences of women, and of the multiple ways that sex and gender interact with race,
class, caste, nationality and other social identities. This course also seeks to build an understanding and initiate
and strengthen programmes combating gender-based violence and discrimination. The course also features several
exercises and reflective activities designed to examine the concepts of gender, gender-based violence, sexuality, and
rights. It will further explore the impact of gender-based violence on education, health and development.
Objectives of the Course

● To develop students’ sensibility with regard to issues of gender in contemporary India.
● To provide a critical perspective on the socialization of men and women.
● To introduce students to information about some key biological aspects of genders.
● To expose the students to debates on the politics and economics of work.
● To help students reflect critically on gender violence.
● To expose students to more egalitarian interactions between men and women.
Learning Outcomes
1. Students will have developed a better understanding of important issues related to gender in contemporary
India.
2. Students will be sensitized to basic dimensions of the biological, sociological, psychological and legal aspects
of gender. This will be achieved through discussion of materials derived from research, facts, everyday life,
literature and film.
3. Students will attain a finer grasp of how gender discrimination works in our society and how to counter it.
4. Students will acquire insight into the gendered division of labor and its relation to politics and economics.
5. Men and women students and professionals will be better equipped to work and live together as equals.
6. Students will develop a sense of appreciation of women in all walks of life.
7. Through providing accounts of studies and movements as well as the new laws that provide protection and
relief to women, the textbook will empower students to understand and respond to gender violence.
Unit-I: UNDERSTANDING GENDER

Introduction: Definition of Gender-Basic Gender Concepts and Terminology-Exploring Attitudes towards Gender-
Construction of Gender-Socialization: Making Women, Making Men- Preparing for Womanhood. Growing up Male.
First lessons in Caste.
Unit – II: GENDER ROLES AND RELATIONS

Two or Many? -Struggles with Discrimination-Gender Roles and Relations-Types of Gender Roles Gender Roles and
Relationships Matrix-Missing Women-Sex Selection and Its Consequences Declining Sex Ratio. Demographic
Consequences-Gender Spectrum: Beyond the Binary
Unit – III: GENDER AND LABOUR

Division and Valuation of Labour-Housework: The Invisible Labor- “My Mother doesn’t Work.” “Share the Load.”-
Work: Its Politics and Economics -Fact and Fiction. Unrecognized and Unaccounted work. -Gender Development
Issues-Gender, Governance and Sustainable Development-Gender and Human Rights-Gender and Mainstreaming.
Unit – IV: GENDER - BASED VIOLENCE
The Concept of Violence- Types of Gender-based Violence-Gender-based Violence from a Human Rights Perspective-
Sexual Harassment: Say No!-Sexual Harassment, not Eve-teasing- Coping with Everyday Harassment- Further
Reading: “Chupulu”. Domestic Violence: Speaking OutIs Home a Safe Place? -When Women Unite [Film]. Rebuilding
Lives. Thinking about Sexual Violence Blaming the Victim-“I Fought for my Life….”
Unit – V: GENDER AND CULTURE

Gender and Film-Gender and Electronic Media-Gender and Advertisement-Gender and Popular Literature- Gender
Development Issues-Gender Issues Gender Sensitive Language-Gender and Popular Literature - Just Relationships:
Being Together as Equals Mary Kom and Onler. Love and Acid just do not Mix. Love Letters. Mothers and Fathers.
Rosa ParksThe Brave Heart.
Note: Since it is Interdisciplinary Course, Resource Persons can be drawn from the fields of English Literature or
Sociology or Political Science or any other qualified faculty who has expertise in this field from engineering
departments.
● Classes will consist of a combination of activities: dialogue-based lectures, discussions, collaborative

learning activities, group work and in-class assignments.
● Apart from the above prescribed book, Teachers can make use of any authentic materials related to
the topics given in the syllabus on “Gender”.
ESSENTIAL READING:
1. The Textbook, “Towards a World of Equals: A Bilingual Textbook on Gender” written by A.Suneetha, Uma
Bhrugubanda, DuggiralaVasanta, Rama Melkote, Vasudha Nagaraj, Asma Rasheed, Gogu Shyamala, Deepa
Sreenivas and Susie Tharu published by Telugu Akademi, Telangana Government in 2015.
PRINCIPLES OF OPERATING SYSTEMS

(Open Elective-1 Offered by CSE)
Sem Code Week
R22 II – II OE
3 - - 3 40 60 100
Pre-requisites: Nil
Objectives: The Students will learn the following:
1. Functions of operating systems, system calls, its design and implementation and its structure.
2. Process, process states, threads and its types and identify suitable process scheduling algorithms.
3. The necessity of Synchronization, principles of synchronization, develop solutions for classical problems of
synchronization and identify solutions to various deadlock situations using banker’s algorithm
4. Contiguous and Non-contiguous Memory Allocation Techniques and their applications
5. File Access Methods, File Allocation Techniques, Disk Scheduling and Management.
Unit I:
Introduction to Operating Systems: Operating Systems Objectives and Functions, Computer System Architecture,
OS Structure, OS Operations, Types of Operating Systems – Simple, Batch, Multi Programmed Time-Shared
Operating Systems, Operating Systems Services, User OS Interface, System Calls, Types of System Calls, System
Programs.
Unit II:
Process Scheduling: Process, Process State, PCB, Threads, Process Scheduling- Scheduling Queues, Schedulers,
Context Switch, Preemptive Scheduling, Dispatcher, Scheduling Criteria, Scheduling Algorithms, Multiple Processor
Scheduling, Real time Scheduling, Thread Scheduling
Unit III:
Process Coordination: Process Synchronization, The Critical Section Problem, Petersons Solution, Synchronization
Hardware, Semaphores, Classic Problems of Synchronization, Monitors
Deadlocks: Deadlocks System Models, Deadlock Characterization, Methods of Handling Deadlocks, Deadlock
Prevention, Deadlock Avoidance, Deadlock Detection and Recovery from Deadlock
Unit IV:
Memory Management: Memory Hierarchy, Logical and Physical Address Space, Swapping, Contiguous Allocation,
Paging, Structure of Page Table, Paging with Translation Lookaside Buffer, Segmentation, Segmentation with Paging,
Virtual Memory, Demand Paging, Performance of Demand Paging, Page Replacement: Page Replacement Algorithms,
Allocation of Frames, Thrashing
Unit V:
File System Interface: The Concept of a File, Access Methods, File System Implementation-File System Structure,
File System Implementation, Allocation Methods, Free Space Management
Mass Storage Structure: Overview of Mass Storage Structure, Disk Scheduling, Swap Space Management
Outcomes: Upon the successful completion of the course, the student will be able:
1. Summarize various basic concepts, functions of operating systems, system calls, its design and implementation
and its structure. [BL-2]
2. Summarize process, process states, threads and its types and identify suitable process scheduling algorithms
for different situations. [BL-3]
3. Apply the principles of synchronization, develop solutions for classical problems of synchronization and identify
solutions to various deadlock situations using banker’s algorithm. [BL-3]
4. Compare and contrast various memory management schemes. [BL-4]
5. Interpret file systems and relate issues such as file system interface and implementation. [BL-2]
Textbooks:
1. Operating System Concepts, Abraham Silberchatz, Peter B.Galcin,Greg Gagne, 8 Edition, John Wiley
th
2. Operating Systems-Internals and Design Principles, William Stallings, 6 Edition-2009, Pearson Education.
th
References:
1. Modern Operating Systems, Andrew S Tanenbaum, 3 Edition,PHI
rd
2. Operating Systems-A concept based Approach-D.M. Dhamdhere,2 edition, tmh

nd
3. Principles of Operating Systems, B.L Stuart, Cengage Learning, India Edition

4. Operating Systems, A.S .Godbole, 2 Edition , TMH
nd
5. An Introduction to Operating Systems, P.C.P Bhatt, PHI

6. Operating Systems, S. Haldar and A.A Aravind, Pearson Education
7. Operating Systems, R.Elamasri, A.G. Carrick and D. Levine, Mc Graw Hill

syllabus

Uploaded by

Document Informationclick to expand document information

Document Informationclick to expand document information

Copyright:

Available Formats

syllabus

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

syllabus

Uploaded by

Copyright:

Available Formats

B V Raju Institute of Technology/ B.Tech / CSE w.e.f.

UNIT – I (Text book 1, Chapter 1, 2 & 13)

SOFTWARE ENGINEERING AND DESIGN

1. Roger S, “Software Engineering – A Practitioner’s Approach”, seventh edition, Pressman, 2010.

MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE

Prerequisites: Basic Mathematics in general is sufficient

UNIT – I (T1, Chapter 1)

1. Discrete Mathematical Structures with Applications to Computer Science: J.P. Tremblay, R.

FOUNDATIONS OF COMPUTER DESIGN

Year- Course Periods/

Prerequisites: Basic knowledge on number systems,computer.

UNIT -II: DIGITAL LOGIC CIRCUITS-I:

UNIT -IV: DIGITAL LOGIC CIRCUITS-II:

UNIT -V PROCESSOR ORGANIZATION:

APPLIED STATISTICS AND NUMERICAL METHODS

Course Prerequisites: Linear Algebra and Calculus, Advanced Calculus.

Unit-II: Probability distributions, Correlation and Regression

Unit-IV: Tests of Hypothesis

INTRODUCTION TO ARTIFICIAL INTELLIGENCE

Prerequisites: Linear Algebra and Calculus , Computational Thinking and Programming.

DATA STRUCTURES LAB

Prerequisites: Computational Thinking and Programming Lab

SOFTWARE ENGINEERING AND DESIGN LAB

Draw the Class diagrams and show various class relationships.

Draw the Package diagram and show various relationships.

Draw UML Component diagram for the identified system.

Draw UML Deployment diagram for the identified system.

1. Online course registration system

ENVIRONMENTAL SCIENCE & RURAL SENSITIZATION

Course Objectives: The course should enable the students to:

Unit-I: Ecosystem and Biodiversity (8 Periods)

Unit-II: Energy & Water Resources (10 Periods)

Unit-III: Green Chemistry & Hazardous Chemicals (10 Periods)

Unit-IV: Empowering Villages (10 Periods)

Unit-V: Health and Hygiene (10 Periods)

Prerequisites: Computational Thinking and Programming, Data Structures.

UNIT – III (Text book-1, Chapter- 10 to 12) (10 Periods)

UNIT – IV (Text book-1, Chapter- 14) (9 Periods)

UNIT –V (Text book-1, Chapter- 17 to 21) (9 Periods)

DATABASE MANAGEMENT SYSTEMS

1. To learn the fundamentals of database systems and database design

UNIT – I (Text Book1: Chapter (1,2)) (10 Periods)

UNIT – II (Text Book2: Chapter (4,5)) (10 Periods)

UNIT – III (Text Book1: Chapter (7)) (8 Periods)

UNIT – IV (Text Book1: Chapter (5))

UNIT –V (Text Book2: Chapter (8))

Unit II: (9 Periods)

Unit III: (11 Periods)

Unit IV: (10 Periods)

2. Introduction to Algorithms, second edition, T.H.Cormen, C.E.Leiserson, R.L.Rivest,andC.Stein, PHI

AUTOMATA THEORY AND COMPUTATION

UNIT – I (11 Periods)

UNIT – III (10 Periods)

UNIT –V (10 Periods)

and basing on the value of D, describe the nature of roots.

DATABASE MANAGEMENT SYSTEMS LAB

Pre-requisites: Computational Thinking and Programming, Data Structures.

Experiment 1: Working with ER Diagram and Normalization