Course Name : ITWORKSHOP

Name of the faculty : Ms. K Naga prasanthi

Semester : II semester

Pre-requisite : NIL

Course Educational Objective :

The objective of the course is to impart knowledge about the components of PC, Assembling PC,
Installation of OS, softwares like MS-Office, LaTex, Photoshop.

COURSE OUTCOMES (COS): At the end of this course, the student will be able to:

CO1: Identify the basic hardware components, keyboard shortcuts, assembling and disassembling
of the system(PC).

CO2: Demonstrate Operating System installations and usage of application softwares like Ms-
office, photo shop.

CO3: Create documents using LaTeX and Google forms.

COURSE ARTICULATION MATRIX (Correlation between COs &POs, PSOs):

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

CO1 3 - - - - - - - - - - - - - -
CO2 3 - - - 3 - - - - - - - - - -
CO3 3 - - - 3 - - - - - - - - - -
Week 1

PC Hardware
Task: Identify the peripherals of a computer, components in a CPU and its functions. Draw the
block diagram of the CPU along with the configuration of each peripheral and submit to your
instructor.

Week 2

Task: Every student should disassemble and assemble the PC back to working condition. Lab
instructors should verify the work and follow it up with a Viva. Also students need to go through
the video which shows the process of assembling a PC. A video would be given as part of the
course content.

Week 3

Task 1: Tips and tricks. Keyboard shortcuts, taskbar, screen shot, taking advantage of search, Task
Manager, Power option, schedule tasks, user accounts, disk management, device manager, shared
folders and folder options.

Task 2 : Every student should individually install MS windows and Linux/ Ubuntu OS on the
personal computer. Lab instructor should verify the installation and follow it up with a Viva.

Week 4

Task 1: Word Orientation: The mentor needs to give an overview of Microsoft word: Importance of
word tool, details of toolbars, saving files, using help and resources, rulers.

Task 2: Using word to create project certificate. Features to be covered:-Formatting Fonts in word,
Applying Text effects, Using Character Spacing, Borders and Colours, Inserting Header and Footer,
Using Date and Time option in Word, and Mail merge

Week 5

Task1: Creating a Newsletter: Features to be covered: - Table of Content, Newspaper columns,

Images from files and clipart, Drawing toolbar and Word Art, Formatting Images, Textboxes and
Paragraphs.

Task2: Creating online documents using Google docs- Create and share Bio-data form.

Week 6

Task 1: Introduction to LaTeX – A document preparation system.

Task 2: Using LaTeX to create project certificate.

Features to be covered:- Formatting Fonts, Applying Text Effects, Using Character Spacing,
Borders and Colours, Inserting Header and Footer, Using Date and Time option, Formatting Styles,
Inserting table, Bullets and Numbering, Changing Text Direction, Cell alignment, Footnote,
Hyperlink, Symbols, Spell Check, Track Changes, etc..,

Week 7
Task 1: Excel Orientation: The mentor needs to tell the importance of MS Excel as a Spread sheet
tool, give the details of the tasks and features that would be covered in each.

Features to be covered:-Using Excel -Accessing, overview of toolbars, saving excel files, Using
help and resources.

Task 2: To create student progress report.

Features to be covered: - Cell Referencing, Formulae in excel - average, sum, etc. Charts, Split
cells, Sorting, Boolean and logical operators, Conditional formatting.

Week 8

Task: Create cricket score card in excel to display over rate and run rate graphs.

Features to be covered: - Cell Referencing, Formulae in excel - average, sum etc. Charts, Split cells,
Sorting, Booleanand logical operators, Conditional formatting.

Week 9

Task 1: Power point Orientation: Students will be working on basic utilities and tools which help
them to create basic power point presentation.

Features to be covered during this week include:- PPT Orientation, Slide Layouts, Inserting Text,
Word Art, Formatting Text, Bullets and Numbering, Lines and Arrows in Power point.

Task 2: Create a power point presentation for LBRCE.

Features to be covered:-Hyperlinks, Inserting -Images, Clip Art, Audio, Video, Objects, Tables and
Charts.

Week 10

Photo shop Orientation: Students will be working on Basic utilities and tools which help them to
edit a photograph.

Features to be covered:-: - Details of toolbars, saving files, Using help and resources.

Week 11

Task : Introduction to Google forms

REFERENCES

1. Comdex Information Technology course tool kit Vikas Gupta, WILEY Dreamtech.

2. Introduction to Information Technology, ITL Education Solutions limited, PearsonEducation.

3. PC Hardware and A+Handbook - Kate J. Chase PHI (Microsoft).

4. LaTeX Companion - Leslie Lamport, PHI/Pearson.

5. https://www.google.com/docs/about/

6. https://support.google.com/sites/answer/6372878?hl=en
 Course Name : Programming for Problem Solving Using C
Name of the faculty : A.S.R.C.Murthy, A. Raja Gopal
Semester : II semester

Prerequisites : Nill

Course Educational Objective: In this course, students will learn about

The basic elements of C programming, control structures, derived data data types, Modular
programming, user defined structures, basics of files and its I/O operations.

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

Explain basic elements of C programming structures like data types, expressions, control
CO1
structures in view of using them in problem solving.
CO2 Apply various operations on derived data types like arrays and strings in problem solving
CO3 Use modular Programming for developing modules in problem solving.
CO4 Implement user defined data types used in specific applications
CO5 Demonstrate file I/O operations

COURSE ARTICULATION MATRIX (Correlation between COs, POs & PSOs):

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 3 1 - - - - - - - - - - 3 - -
CO2 3 1 - - - - - - - - - - 3 - -
CO3 3 - 1 - - - - - - - - - 3 - -
CO4 2 3 - - - - - - - - - - 3 - -
CO5 3 - - - - - - - - - - - 3 - -
Note: Enter Correlation Levels 1 or 2 or 3. If there is no correlation, put ‘-’ ,1- Slight (Low), 2 –
Moderate (Medium), 3 - Substantial (High).
UNIT – I
Introduction to Problem solving through C-Programming: Problem Specification,
Algorithm / pseudo code, flowchart, examples.
C-Programming: Structure of C program, identifiers, basic data types and sizes, Constants,
variables, Input-output statements, A sample c program, operators, expressions, type conversions,
conditional expressions, precedence of operators and order of evaluation.
Control statements: if, if else, else if ladder and switch statements, while, do-while and for
statements, break, continue, goto and labels.

UNIT – II
Arrays- concept, declaration, definition, accessing elements, storing elements, two dimensional
and multi-dimensional arrays.
Character Arrays: declaration, initialization, reading, writing strings, string handling functions,
Pre-processor Directives and macros.
Applications of Arrays: Linear search, Binary search, Bubble Sort.

UNIT – III
Pointers- concepts, declaring & initialization of pointer variables, pointer expressions, pointer
arithmetic, pointers and arrays, pointers and character arrays, pointers to pointers.
Functions: basics, category of functions, parameter passing techniques, recursive functions-
comparison with Iteration, Functions with arrays, Standard library functions, dynamic memory
management functions, command line arguments.
Storage classes - auto, register, static and extern,

UNIT – IV
Derived types- structures- declaration, definition and initialization of structures, accessing
structures, nested structures, arrays of structures, structures and functions, pointers to structures,
self-referential structures, unions, typedef .

UNIT – V
Files – concept of a file, text files and binary files, streams, standard I/O, Formatted I/O, file I/O
operations, error handling.

BOS APPROVED TEXT BOOKS:

T1 Jeri R.Hanly, Elliot B.Koffman, Problem Solving and Program Design in C, Pearson
Publishers, 7th Edition, 2013 [Unit-1,2,3,4,5]
BOS APPROVED REFERENCE BOOKS:
R1 ReemaThareja, Programming in C, Oxford University Press, 2nd Edition, 2015
R2 E Balagurusamy, Computer Programming, McGraw Hill Education, 8th Edition.
R3 C: The Complete Reference, McGraw Hall Education, 4th Edition.
R4 PradeepDey, Manas Ghosh, Programming in C, Oxford University Press, 2nd Edition,
2011
R5 Stephen G.Kochan, Programming in C, Pearson Education, 3rd Edition, 2005
Course Name : Programming for Problem Solving Using C Lab
Name of the faculty : A.S.R.C.Murthy, A. Raja Gopal
Semester : II

Pre-requisite : NIL

COURSE OBJECTIVE: In this course, the student will learn about:

 Basic elements of C Programming Structures like Data Types, Expressions, Control
Statements, and Various I/O Functions
 To solve simple mathematical problems using control structures.
 Design and Implementation of various software components which solve real world
problems.

COURSE OUTCOMES (CO): At the end of this course, the student will be able to:

CO1: Demonstrate C programming development environment, compiling, debugging, Linking and

executing a program using the development environment.
CO2: Apply and practice logical formulations to solve problems leading to specific applications
CO3: Design effectively the required programming components that efficiently solve Computing
problems in real world.

CO-PO-PSO MAPPING :

COURSE ARTICULATION MATRIX (Correlation between COs, POs & PSOs):

PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO

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

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

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

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

Note: 1- Slight (Low), 2 - Moderate (Medium), 3 - Substantial (High)

# of modules at most 10can be taught and all the modules should be in line with theory.

Modue 1: Introduction to Raptor Tool.

Module 2: Problem solving using Raptor Tool

Module 3: Exercise Programs on Basics of C-Program.

Module 4: Exercise Programs on Control Structures.

Module 5: Exercise Programs on Loops & nesting of Loops.

Module 6: Exercise Programs on Arrays & Strings.

Module 7: Exercise Programs on Pointers.

Module 8: Exercise Programs on Functions.

Module 9: Exercise Programs on user defined data types.

Module 10: Exercise Programs on Files

Course Name : Digital Logic Design / Switching Theory and Logic Design

Name of the faculty : Mr J Nageswara rao

Semester : II semester

Prerequisite : Nil

Course Outcomes:

After end of the course, the students should be able to

CO1: Understand the digital number systems , Boolean algebra theorems, Properties and Canonical
form for digital logic circuit design.

CO2: Apply K-Maps for minimization of boolean expressions to construct logic circuit.

CO3: Demonstrate the combinational circuits using Adders, Subtractors, Decoders, Multiplexers
and Magnitude Comparators.

CO4:Demonstrate the Sequential logic circuits using Flip-flops, Shift registers Counters and
Memory unit.

CO5: Implementation of programmable logic devices (PROM, PAL, and PLA) and its design.

COs Pos PSOs

1 2 3 4 5 6 78 9 10 11 12 1 32
CO1 2 1 1
CO2 2 2 2
CO3 2 3 2
CO4 2 3 2
CO5 2 2 2
Relation of course outcomes to Program Outcomes and Program Specific Outcomes
UNIT I:

Number Systems: Binary, Octal, Decimal, Hexadecimal Number Systems, Conversion of

Numbers from One Radix to another Radix, r’s Complement and (r-1)’s Complement ,Subtraction
of Unsigned Binary Numbers and Signed Binary Numbers, Binary Codes,
Logic gates: Basic Gates: NOT, AND, OR, Universal Gates: NAND, NOR, Special Gates: EX-OR
and EX-NOR Gates. Error detection and Correction, Hamming Code. Logic families

UNIT II:
Boolean algebra: Fundamental postulates of Boolean algebra, Basic theorems and properties,
Complement, Dual of Logical Expressions, Standard forms: SOP, POS, and Minimizations of
Logic Functions Using Boolean Theorems.
Karnaugh Map Method (K-Map): Minimization of Boolean Functions maximum up to Four
Variables, Simplifications withDon’t Care Conditions Using K-Map, Prime Implicants, Essential
Prime Implicants, Quine-McCluskey Method.

UNIT III:
Arithmetic Circuits: Design of Half Adder, Full Adder, Half Subtractor, Full Subtractors, Ripple
Carry Adder, Magnitude Comparator. Design of Multiplexers, Demultiplexers, Decoders,
Encoders, Priority Encoder, Code Converter (including A/DC and D/AC )

UNIT IV:
Sequential Logic Circuits: Latch and Flip-Flop, RS- Latch Using NAND and NOR Gates, RS, JK,
T and D Flip-flops, Truth and Excitation Tables, Conversion of Flip Flops, Master-Slave Flip-flops.
Registers and Counters: Introduction, Shift Register and its types, Bi-directional Shift Registers,
Universal Shift Register, Design of Ripple Counters, Synchronous Counters, Modulus Counters,
Ring Counter, Johnson Counter.

UNIT V:
Memory unit: RAM and ROM, Programmable Logic Devices: PLA, PAL, PROM, Realization
of Switching Functions Using PROM, PAL and PLA, Comparison of PLA, PAL and PROM.

TEXT BOOKS:
1. Digital Design, 4/e, Morris Mano, Michael D Ciletti, PEA

REFERENCE BOOKS

1. Fundamentals of Logic Design, 5/e, Roth, Cengage

2. Digital Logic Design, Leach, Malvino, Saha, TMH
3. Modern Digital Electronics, R.P. Jain, TMH

Note: Course contents can be demonstrated through simulation tool (Vlab)

Course Code & Course Name : 17CI03 - Discrete Mathematical Structures

Faculty name : Divvela Srinivasa Rao, G.Balu Narasimha Rao

Semester : III
___________________________________________________________________________

Pre-requisites : Basic mathematical knowledge

Course Educational Objective:

Perform the operations associated with relations and functions. Relate practical
examples to the functions and relations and interpret the associated operations and terminology
used in the context. Use formal logic proofs and/or informal but rigorous logical reasoning to, for
example, predict the behaviour of software or to solve problems such as puzzles.

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

CO1 Outline basic proofs for theorems using the techniques of - direct proofs, example, and
proof by contradiction, mathematical induction.
CO2 Illustrate the basic terminology of functions, relations, lattices and their operations
through examples
CO3 Identify the properties of graphs and apply these to graph theory problems
CO4 Apply basic principles/techniques to solve different algebraic structures &
combinatorial problems.
CO5 Solve linear recurrence relations by recognizing homogeneity using constant
coefficients and characteristic roots and Generating functions

Course Articulation Matrix: (Correlation between COs,POs & PSOs)

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 3 3 - - - - - - - - - - - -
CO2 3 3 1 - - - - - - - - - - - -
CO3 3 3 1 - - - - - - - - - 1 - -
CO4 3 3 2 - - - - - - - - - 1 - -
CO5 3 3 1 - - - - - - - - - - - -
Note: Enter Correlation Levels 1 or 2 or 3. If there is no correlation, put ‘-’
1- Slight (Low), 2 - Moderate (Medium), 3 - Substantial (High).
UNIT – I: Mathematical Logic
Propositional logic and Predicate Calculus: Statements and Notations, Connectives, Truth
Tables, Tautologies,Equivalence of Formulas, Tautological Implications, Normal Forms, Theory of
Inference for Statement Calculus, Consistency of Premises, Indirect Method of Proof, Predicative
Logic, Statement Functions, Variables and Quantifiers.

UNIT – II: Sets, Relations & Functions

Introduction to Sets, representation of Sets, Operation on Sets, Properties of Binary Relations,
Relation Matrix, Operations on Relations, Transitive Closure, Equivalence Relation, Compatibility
and Partial Ordering Relations, Hasse Diagrams, Lattices: LUB, GLB.
Functions: Bijective Functions, Composition of Functions, Inverse Functions.

UNIT – III: Graph Theory I & II

Basic Concepts of Graphs, Matrix Representation of Graphs: Adjacency Matrices, Incidence
Matrices, Isomorphic Graphs, Eulerian and Hamiltonian Graphs.
Graph Theory II: Planar Graphs, Euler’s Formula, Graph Coloring, Chromatic Number, Graph
Traversals: BFS, DFS. Trees: Spanning Trees: Properties, Algorithms for Minimum cost Spanning
Trees

UNIT – IV: Algebraic Structures & Combinatorics

Algebraic Systems with one Binary Operation, Properties of Binary operations, Semi groups and
Monoids: Homomorphism of Semi groups and Monoids, Group, Abelian group, Sub Groups,
Lagrange’s Theorem
Combinatorics: Basic of Counting, Permutations, Combinations, Combinations with repetition
Pigeonhole Principle and its Applications, Principle of inclusion-exclusion.

UNIT – V: Recurrence Relation

Generating Function of Sequences, Calculating Coefficient of Generating Functions, Recurrence
Relations, Solving linear homogeneous recurrence Relations by substitution, generating functions
and The Method of Characteristic Roots.

TEXT BOOKS
1. Tremblay, Manohar, Discrete Mathematical Structures with Applications to Computer
Science, TMH Publications[1,2,3,4,5]

REFERENCES
1. Chandrasekaran,Umaparvathi,Discrete Mathematics,PHI, 2010[1,2,3,4,5]
2. Ralph. P.Grimaldi, Ramana, Discrete and Combinational Mathematics,Pearson,5th edition.
[1,2,3,4,5]
3. https://nptel.ac.in/courses/106/106/106106183/[1,2,3,4,5]
4. https://www.youtube.com/watch?v=-Awoo5kE-
kQ&list=PL8xmnXn7pVtzAxYSeAXSVxrzoYbETf1NA [1,2,3,4,5]
Course Code & Course Name : Data Structures

Faculty name : Mr. T Udaya kumar and A. Sudhakar

Semester : III
___________________________________________________________________________

Pre-requisites : Programming Language

Course EducationalObjectives (CEOs):

To make students familiar with writing algorithms to implement different data structures like
stacks, queues, trees and graphs, and various sorting techniques.

Course Outcomes (COs): By the completion of the course, the student will be able to:

CO1 : Understand the Asymptotic notations, ADT and linked lists.

CO2 : Demonstrate linear data structures like stack and queue.

CO3 : Analyze various sorting techniques

CO4 : Understand the tree data strucutre

CO5: Implementation of Graph traversal algorithms and hashing techniques.

COURSE ARTICULATION MATRIX (Correlation between COs and POs and PSOs)

Course Articulation Matrix: (Correlation between COs,POs & PSOs)

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 3 - - - - - - - - - - 3 - -
CO2 3 - - - - - - - - - - - 3 - -
CO3 3 - - - - - - - - - - - 3 - -
CO4 3 - - - - - - - - - - - 3 - -
CO5 3 - - - - - - - - - - - 3 - -
Note: Enter Correlation Levels 1 or 2 or 3. If there is no correlation, put ‘-’
1- Slight (Low), 2 - Moderate (Medium), 3 - Substantial (High).
UNIT - I
Algorithm Analysis:
Introduction to Algorithm, Algorithm Analysis , Asymptotic Notations.
Introduction to arrays and Abstract Data Type(ADT)
Lists: List using arrays and linked list- Singly Linked List, Doubly Linked List, Circular LinkedList.

UNIT – II
Stacks: Stack ADT,Implementation using arrays and linked list.
Applications of stacks : Infix to postfix expression conversion, Evaluation of Postfix expressions and
balancing the symbols.
Queues:
Queue : Queue ADT,Implementation of Queue using arrays and linked list,circular queue, DEQUE

UNIT - III
Sorting: Bubble sort, Insertion Sort, Selection sort, Merge Sort, Quick Sort & Heap Sort

UNIT - IV
Trees: Introduction, Tree traversals, Binary Trees, Binary Search Trees, Balanced Binary search
tree - AVL Trees and its operations.

UNIT - V
Graphs: Fundamentals, Representation of graphs, Graph Traversals: BFS, DFS.
Hashing: Hash Table, Hash Function, Collision resolution Techniques- separate Chaining,
Open addressing, rehashing.

TEXT BOOKS:
1 Mark Allen Weiss, “Data Structures and Algorithm Analysis in C”, Pearson Education, 2ndedition.
2. ReemaThareja, Data Structures using c, Oxford Publications.

REFERENCES.
1. Langson, Augenstein&Tenenbaum, ‘Data Structures using C and C++’, 2nd Ed, PHI.
2. RobertL.Kruse, Leung and Tando, ‘Data Structures and Program Design in C’, 2ndedition, PHI.
 DATA STRUCTURES LAB

Course Educational Objectives (CEOs):

The objective is to implement some of the data structures learned in the theory course.

Course Outcomes (COs): By the completion of the course, the student will be able to:

CO1: Implement Linear Data Structures using array and Linked list.

CO2: Implement Sorting Techniques.

CO3: Implement Non Linear Data Structure such as Trees &Graphs

COURSE ARTICULATION MATRIX (Correlation between COs, POs & PSOs):

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

CO1 3 - - - - - - - - - - - 3 - -

CO2 3 - - - - - - - - - - - 3 - -

CO3 3 - - - - - - - - - - - 3 - -
I) Exercise Programs on List ADT

a) Implementation of List using Arrays.

b) Implementation of List using Linked List.

II) Exercise Programs on Stacks & Queue ADT

a) Implementation of Stack Operations using Arrays.

b) Implementation of Stack Operations using Linked List.

c) Implementation of Queue Operations using Arrays.

d) Implementation of Queue Operations using Linked List.

III) Exercise Programs on Stack Applications

a) Conversion of Infix Expression to postfix Expression.

b) Conversion of Infix Expression to prefix Expression.

c) Evaluation of Postfix Expression

d) Implementation of Balancing Symbols.

IV) Exercise Programs on Types of Queues

a) Implementation of Circular Queues Linked List.

b) Implementation of Double Ended Queue using Arrays.

c) Implementation of Double Ended Queue using Linked List.

V) Exercise Programs on Sorting Techniques.

a) Implementation of Insertion Sort.

b) Implementation of Selection Sort.

c) Implementation of Merge Sort.

d) Implementation of Quick Sort.

e) Implementation of Bubble Sort.

f) Implementation of Heap Sort.

VI) Exercise Programs on Trees

a) Implementation of Binary Tree Traversals.

b) Implementation of Binary Search Tree Operations.

VII) Exercise Programs on Graph Traversal Techniques.

a) Breadth First Search (BFS)

b) Depth First Search (DFS)

Course Name : COMPUTER ORGANIZATION AND ARCHITECTURE

Semester : III semster

Name of the faculty : Mr T N V S Praveen and Mr V Siva krishna

Pre-requisitie : Fundamentals of computer hardware

Course Educational Objectives:

 Students will be able to make use of the binary number system to translate valuesbetween
the binary and decimal number systems, to perform basic arithmeticoperations (i.e. addition,
subtraction, multiplication, and division) and to constructmachine code instructions.
 Students will be able to design logical expressions and correspondingintegrated logic
Circuits for a variety of problems including the basic components of aCPU such as adders,
multiplexers, the ALU, a register file, and memory cells.
 Students will be able to explain the fetch-execute cycle performed by the CPUand how the
various components of the data path are used in this process.

COURSE OUTCOMES

CO1 Identify the basic components of digital computer and understand the CPU micro-
operations and instruction set of a digital computer.

CO2 Demonstrate the micro-programmed control unit and hardwired control unit
functionalities.

CO3 Analyze parallel processing using pipelining and Multi-core architectures.

CO4 Analyze the memory hierarchy system.

CO5 Understand the communication methods of I/O devices and standard I/O interfaces.

Pre requisite: Digital Logic Design

P
COs PO1 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
O2

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

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

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

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

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

UNIT-I
 Functional blocks of a computer: CPU, memory, input-output subsystems, control unit.
Instruction set architecture of a CPU–registers, instruction execution cycle, RTL
interpretation of instructions, addressing modes, instruction set. Case study – instruction
sets of some common CPUs.

UNIT-II
Data representation: signed number representation, fixed and floating point
representations, character representation. Computer arithmetic – integer addition and
subtraction, carry look-ahead adder. Multiplication – shift-and add, Booth multiplier.
Division restoring and non-restoring techniques, floating point arithmetic.

UNIT-III
CPU control unit design: hardwired and micro-programmed design approaches.
Pipelining: Basic concepts of pipelining, throughput and speedup, pipeline hazards.
Parallel Processors: Introduction to parallel processors, Concurrent access to memory and
cache coherency.

UNIT-IV
Memory system design: semiconductor memory technologies, memory organization.
Memory interleaving, concept of hierarchical memory organization, cache memory, cache
size vs. block size, mapping functions, replacement algorithms, write policies.

UNIT-V
Peripheral devices and their characteristics: Input-output subsystems, I/O device
interface, I/O transfers–program controlled, interrupt driven and DMA, privileged and
non-privileged instructions, software interrupts and exceptions.

TEXT BOOK(S)

1. M.Morris Mano, “Computer Systems Architecture”, Pearson Education publishers.

2. Carl Hamacher, ZvonksVranesic, SafeaZaky, “Computer Organization”, TMH publications.

REFERENCES

1. William Stallings,“Computer Organization and Architecture”, Pearson/PHI publishers, Sixth

Edition.

2. Andrew S. Tanenbaum, “Structured Computer Organization”, Pearson/PHI publishers.

3.SivaraamaDandamudi, “Fundamentals or Computer Organization and Design”, Springer publishers.

 Course Name : Python Programming

Name of the faculty : Mr. K Sundeep saradhi

Semester : III

Prerequisites : Problem solving skills

Course Educational Objective:

The course is designed to provide Basic knowledge of Python. Python programming is intended for
software engineers, system analysts, program managers and user support personnel who wish to
learn the Python programming language for Problem solving and programming capability.

Course Outcomes : On completion of the course,the student shall be able to

CO1 Identify the basic python constructs with a view of using them in problem solving.
CO2 Implement basic data structures in python.
CO3 Explore the functions in modular programming and exception handling using python.
Demonstrate compelling concepts about string manipulation, regular expressions and
CO4
file handling.
CO5 Apply object oriented programming features of python.

COURSE ARTICULATION MATRIX (Correlation between COs, POs & PSOs):

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 3 - 2 - - - - - - - - - 3 - -
CO2 - 3 2 - 1 - - - - - - - 3 - -
CO3 - 3 2 - 2 - - - - - - - 3 - -
CO4 - 3 2 - 2 - - - - - - - 3 - -
CO5 - 3 2 - 2 - - - - - - - 3 - -
Note: Enter Correlation Levels 1 or 2 or 3. If there is no correlation, put ‘-’ ,1- Slight (Low), 2 –
Moderate (Medium), 3 - Substantial (High).
UNIT-I

Introduction to Python: History of Python, Usage of Python interpreter, Python Shell, Indentation,
Python Built-in types, Variables, Assignment, Input-Output Statements, Simple Programs,
Identifiers and keywords, Literals. Operators: Arithmetic operators, Relational operators, Logical
operators, Assignment operators, Bitwise operators, Python Membership Operators (in & not in),
Python Identity Operators (is & is not), Operator precedence.
Control Structures: Conditional Statements - if, if-else, Nested if-else. Jumping Statements -
continue, break and pass. Python Loops - while, for, Nested loops with Programming Examples,
Mathematical Functions and Constants (import math), Random Number Functions.

UNIT-2
Lists: Concept, Creating and Accessing Elements, Updating & Deleting Lists, basic List
Operations, Reverse, Indexing, Slicing and Matrices, Built-in List Functions.
Tuples: Introduction, Creating & Deleting Tuples, Accessing values in a Tuple, Updating tuples,
Delete Tuple Elements, basic Tuple Operations, Indexing, Slicing and Matrices, built- in tuple
Functions.
Sets: Concept, Operations.
Dictionaries: Introduction, Accessing values in dictionaries, working with dictionaries, Properties,
Functions.

UNIT-3
Functions: Defining a Function, Calling a Function, Types of Functions, Function Arguments,
Anonymous functions, Global and Local Variables, Recursion
Modular Design: Creating modules, import statement, from, Date and Time Module. Exception
Handling: Exception, Exception Handling, except clause, Try, finally clause, User Defined
Exceptions.

UNIT-4
Python strings: Concept, Slicing, Escape characters, String Special Operations, String formatting
Operator, Triple Quotes, Raw String, Unicode Strings, and Built-in String methods.
Regular Expression Operations: Using Special Characters, Regular Expression Methods, Named
Groups in Python Regular Expressions, Regular Expression with glob Module.
Files: Introduction to files, file operations- Read,write, and search
UNIT-5

Object Oriented Programming OOP in Python: Classes, 'self-variable', Methods, Constructor

Method, Inheritance, Overriding Methods, Data hiding.

Text Books:
1. Reema Thareja, “Python Programming Using Problem Solving Approach”, Oxford Publications
[1, 2]
2. Python for Everybody: Exploring Data In Python 3 by Dr. Charles Russell Severance, Sue
Blumenberg [3,4,5]
Reference Books:
1. Gowrishankar S and Veena A, “Introduction to Python Programming”, CRC Press, Taylor and
Francis Group – A CHAPMAN & HALLBOOK. [1,2]
2. R. Nageswara Rao, “Core python programming”, Dreamtech, 2017.[3,4,5]
3. Y. Daniel Liang, “Revel for Introduction to Python Programming and Data Structures”, Pearson
Publications.[12,3,4,5]
 Course Name : Python Programming Lab

Name of the faculty : Mr. K Sundeep saradhi

Semester : III semster

Prerequisites: Programming languages like C Language.

Course Educational Objective:

This Python course leads the students from the basics of writing and running Python scripts in
problem solving and also to design and implement the modules and understands the working of
classes and objects in python.

Course Outcomes: At the end of the course, the student shall be able to
CO1: Identify various programming constructs available in Python and apply them in solving
computational problems.
CO2: Demonstrate data structures available in Python and apply them in solving computational
problems.
CO3: Design and implement modular programming, string manipulations and Object oriented
programming in python.

COURSE ARTICULATION MATRIX (Correlation between COs, POs & PSOs):

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 3 - - 2 1 - - - - - - - 3 - -
CO2 - 3 2 3 2 - - - - - - - 3 - -
CO3 - 3 2 3 2 - - - - - - - 3 - -

Note: Enter Correlation Levels 1 or 2 or 3. If there is no correlation, put ‘-’ ,1- Slight (Low), 2 –
Moderate (Medium), 3 - Substantial (High).

Introduction: Language basics and example problems ( Two weeks)

Implement Python Script for checking the given year is leap year or not.
Implement Python Script for finding biggest number among 3 numbers.
Implement Python Script for displaying reversal of a number.
Implement Python Script to check given number is Armstrong or not.
Implement Python Script to print sum of N natural numbers.
Implement Python Script to check given number is palindrome or not.
Implement Python script to print factorial of a number.
Implement Python Script to print all prime numbers within the given range.
Implement Python Script to calculate the series: S=1+x+x2+x3+.......xn
Implement Python Script to print the following pattern:
*
* *
* * *
Modue 1: Exercise Programs on Lists.
Write a Python script to display elements of list in reverse order.
Write a Python script to find the minimum and maximum elements without using built-in
operations in the lists.
Write a Python script to remove duplicates from a list.
Write a Python script to append a list to the second list.
Write a Python script to count the number of strings in a list where the string length is 2 or more.
Module 2: Exercise Programs on Tuples.
Write a Python script to create a tuple with different data types. 
Write a Python script to find the repeated items of a tuple.
Write a Python script to replace last value of tuples in a list. 
Sample list: [(10, 20, 40), (40, 50, 60), (70, 80, 90)]
Expected Output: [(10, 20, 100), (40, 50, 100), (70, 80, 100)]
Write a Python script to sort a tuple by its float element. 
Sample data: [('item1', '12.20'), ('item2', '15.10'), ('item3', '24.5')]
Expected Output: [('item3', '24.5'), ('item2', '15.10'), ('item1', '12.20')]
Module 3: Exercise Programs on Sets.
Write a Python script to add member(s) in a set.
Write a Python script to perform Union, Intersection, difference and symmetric difference of given
two sets.
Write Python script to test whether every element in S is in T and every element in T is in S.
Module 4: Exercise Programs on Dictionaries
Write a Python script to sort (ascending and descending) a dictionary by value.
Write a Python script to check whether a given key already exists or not in a dictionary.
Write a Python script to concatenate following dictionaries to create a new one. 
Sample Dictionary : dic1={1:10, 2:20} dic2={3:30, 4:40} dic3={5:50,6:60}
Expected Result : {1: 10, 2: 20, 3: 30, 4: 40, 5: 50, 6: 60}
Write a Python script to print a dictionary where the keys are numbers between 1 and 15 (both
included) and the values are square of keys.
Write a Python program to map two lists into a dictionary.
Module 5: Exercise Programs on functions and recursion.
a) Define a function max_of_three() that takes three numbers as arguments and returns the largest
of them.
b) Write a program which makes use of function to display all such numbers which are divisible by
7 but are not a multiple of 5, between given range X and Y.
c) Define functions to find mean, median, mode for the given numbers in a list.
d) Define a function which generates Fibonacci series up to n numbers.
e) Implement a python script for factorial of number by using recursion.
f) Implement a python script to find GCD of given two numbers using recursion.

Module 6: Exercise programs on Date and Time Modules.

a) Write a Python script to get the current time in Python.
b) Write a Python script to get current time in milliseconds in Python
c) Write a Python script to print next 5 days starting from today.

Module 7. Exercise programs on Exception Handling.

a) Write a Python script to handle simple errors by using exception handling mechanism.
b) Write a Python script to handle multiple errors with one except statement.
Module 8: Exercise programs on Strings
a) Implement Python Script to perform various operations on string using string libraries.
b) Implement Python Script to check given string is palindrome or not.
c) Implement python script to accept line of text and find the number of characters, number of
vowels and number of blank spaces in it.
d) ) Implement python script that takes a list of words and returns the length of the longest one. 
Module 9: Exercise programs on Regular Expressions
a) Write a Python script to check that a string contains only a certain set of characters (in this case
a-z, A-Z and 0-9).
b) Write a Python script to check whether password is valid or not.
Conditions for a valid password are:
Should have at least one number.
Should have at least one uppercase and one lowercase character.
Should have at least one special symbol.
Should be between 6 to 20 characters long.

Module 10: Exercise programs on Object Oriented Programming

a) Write a Python script to create and access class variables and methods.
b) Write a Python script to implement method overloading.
c) Write a Python script to implement single inheritance.
d) Write a Python script to implement method overriding.

Course name : Object Oriented Programming through JAVA

 Name of the faculty : Mr N SrinivasaRao & Srinivasa Reddy

Semester : IV

Prerequisites: Problem solving ability and programming knowledge in C.

Course Educational Objective:

Students will learn the constructs of the Java programming language along with built-in facilities to
create different applications such as console & graphical user interfaces. In the process of learning
the language, they will be applying knowledge of object oriented programming, they will get the
fundamental knowledge on collection framework.

Course Outcomes:

On completion of the course student will have the ability to

Explain the fundamentals of object oriented programming, basic language constructs of

CO1
Java.
Identify classes, objects, packages, members of a class and relationships among them,
CO2
perform string manipulations.
Apply object oriented programming features, exception handling mechanism in secure and
CO3
robust programing design.
CO4 Develop multithreading applications, window based graphical user interface applications.
CO5 Apply the fundamentals of collection framework to perform all operations on data.

COURSE ARTICULATION MATRIX (Correlation between COs, POs & PSOs):

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 3 - - - - - - - - - - 1 3 - -
CO2 3 - - - - - - - - - - 1 3 - -
CO3 3 - 1 - - - - - - - - 1 3 - -
CO4 3 - 1 - - - - - - - - 1 3 - -
CO5 3 - - - - - - - - - - 1 3 2 -
Note: Enter Correlation Levels 1 or 2 or 3. If there is no correlation, put ‘-’, 1- Slight (Low),
2 – Moderate (Medium), 3 - Substantial (High).

UNIT-I
Introduction to Java: Programming paradigm, procedural programming language versus object
oriented language, principles of OOP, applications of OOP, java features, program structure,
variables, keywords, primitive datatypes, identifiers, operators, expressions, precedence rules and
associativity, primitive type conversion and casting, control structures.

UNIT-2

Classes and objects: Class declaration, creating objects, method and its types, constructor and its
types, wrapper classes, garbage collector, static keyword, this keyword, arrays, command line
arguments, nested classes.

String handling classes: String, String Buffer, StringTokenizer.

Packages: Creating the user defined packages, using packages, importance of CLASSPATH.

UNIT-3

Inheritance and polymorphism: Inheritance, types of inheritance, super keyword, final keyword,
access modifiers, polymorphism (overloading & overriding).

Encapsulation and Abstraction: Encapsulation, abstract methods, abstract classes, interfaces.

Exception Handling: Exception hierarchy, importance of try, catch, throw, throws and finally
block, creation of user defined exceptions, Assertions.

UNIT-4

Multithreading: Introduction, thread life cycle, creation of threads, naming a thread, joining a
thread, thread priorities, daemon thread, thread pool, thread group, thread synchronization, Inter-
thread communication.

Applets: Introduction, hierarchy of applet, applet life cycle, possible ways to run an applet,
graphics in applet.

AWT: AWT hierarchy, components and containers, Button, Label, TextField, Checkbox, Choice,
List, Canvas, Scrollbar, MenuItem & Menu, Container class, Layout managers (BorderLayout,
FlowLayout, GridLayout, CardLayout).

UNIT-5

Event handling: Event delegation model, event classes (ActionEvent, MouseEvent, KeyEvent,
WindowEvent), listener interfaces (ActionListener, MouseListener and MouseMotionListener,
KeyListener, WindowListener), adapter classes, close AWT window.

Collection Framework: Introduction, generics, collection framework hierarchy, list, set, queue,
and map.

Text Books:
1. Herbert Schildt, “Java: The complete reference”, TMH Publications, 7th edition, 2006.
[1,2,3,4,5].
2. Cay S. Horstmann, “Core Java Volume I – Fundamentals”, Pearson, Eleventh edition, 2018.
[1,2,3,4,5].

Reference Books:

1. Dr.R.NageswaraRao, “Core JAVA: An Integrated Approach”, Dreamtech Press, 1st Edition,

2008. [1,2,3,4,5].
2. E. Balaguruswamy, “Programming with JAVA”, TMH Publications, 2ndEdition, 2000.
[1,2,3,4,5].
3. Patrick Niemeyer & Jonathan Knudsen, “Learning Java”, O‘REILLY Publications, 3rd Edition,
2005. [1,2,3,4].
4. Benjamin J Evans & David Flanagan, “Java–in a Nutshell – A desktop quick reference”,
O‘REILLY Publications, 6th Edition, 2014. [1,2,3].
 Course name : JAVA Programming lab

Name of the faculty : Mr N Srinivasa rao & Srinivasa reddy

Semester : IV semester

Course Educational Objective: Students will apply the constructs of Java programming language
along with built-in facilities to create different applications such as console & graphical user
interfaces. They will be applying knowledge of object oriented programming, collection framework
to perform all operations on data.

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

Develop Java programs using basic programming constructs, object oriented

CO1
principles.

Apply multithreading and exception handling mechanism in secure, dynamic and

CO2
robust program design.

Develop GUI applications, perform all the operations on data by using collection
CO3
framework.

Improve individual / team work skills, communication & report writing skills with
CO4
ethical values.

COURSE ARTICULATION MATRIX (Correlation between COs, POs & PSOs):

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 3 - - - - - - - - - - 1 3 - -
CO2 3 - 1 - - - - - - - - 1 3 - -
CO3 3 - 1 - - - - - - - - 1 3 2 -
CO4 - - - - - - - 2 2 2 - - - - -
Note: Enter Correlation Levels 1 or 2 or 3. If there is no correlation, put ‘-’, 1- Slight (Low), 2 –
Moderate (Medium), 3 - Substantial (High).
Introduction: Language basics and example problems (one or two Modules)

1). Write a java program to display default value of all primitive data type of Java.

2). Write a java program that display the roots of a quadratic equation ax2+bx=0. Calculate the
discriminate D and basing on value of D, describe the nature of root.

3). Write a java program to read the input from the keyboard by using the following ways
i) Command line arguments ii) BufferedReader class iii) Scanner class

Write a program to find factorial of list of number reading input as command

line argument.
Write a program to find factorial of list of number reading input as command
line argument.
Write a program to find factorial of list of number reading input as command
line argument.
4). Write a java Program to find the factorial of list of numbers reading input as command line
argument.

5). Write a java Program to display all prime numbers between two limits.

6). Five bikers compete in a race such that they drive at a constant speed which may or may not be
the same as the other. To qualify the race, the speed of a racer must be more than the average speed
of all 5 racers. Take as input the speed of each racer and print back the speed of qualifying racers.

7). Write a case study on public static void main (250 words).

8). Write a java program to implement Rhombus pattern reading the limit from the user.

9). Develop a java program to calculate gross salary & net salary taking the following data.
Input: empno, empname, basic salary
Process: DA=50% of basic, HRA=25% of basic, CCA=Rs240/-, PF=10% of basic, PT=Rs100/-.

10). Write a java program to search for an element in a given list of elements using binary search
mechanism.

Module 1:

a) Develop a java program to create class which contains data & methods, create an object to access
those members.
b) Develop a java program which implements all types of java variables (local, class level: static,
instance).
c) Develop a java program to calculate the sum of diagonal elements of given n x n matrix.

Module 2:

a) Develop a java program which contains both static and non-static methods.
b) Develop a java program to find area of geometrical figures using method.
c) Develop a java program to initialize instance variables by using constructors.
d) Develop a java program which implements constructor overloading by passing different number
of parameters of different types.

Module 3:
a) Develop a java program to count the words, characters in the given line of text.
b) Develop a java program for sorting a given list of names in ascending order.
c) Develop a java program that reads a line of integers separated by commas and then displays each
integer, find the sum of the integers (using StringTokenizer).
d) Develop a java program to implement multi-level inheritance.

Module 4:
a) Develop a java program to create and access user defined package.
b) Develop a java program to identify the accessibility of a variable by means of different access
specifiers within and outside the package.
c) Develop a java program to implement the concept of method overloading.
d) Develop a java program to implement the concept of method overriding.

Module 5:
a) Develop a java program for abstract class to find areas of different shapes.
b) Develop a java program to achieve multiple inheritance using interfaces.
c) Develop a java program to create an interface named Vehicle which contains two abstract
methods (Specifications(), Display()). Provide two classes named Twowheeler, FourWheeler which
are implemented by that interface.

Module 6:
a) Develop a java program that implements a multi-threaded program which has three threads. First
thread generates a random integer for every 1 second, if the generated integer is even the second
thread computes the square of the number and print it. If the generated integer is odd the third
thread will print the value of cube of the number.
b) Develop a java program to identify the use of synchronized blocks, synchronized methods and
static synchronized methods in threads concept.
c) Develop a java program to illustrate the concept of inter thread communication.

Module 7:

a) Write an applet program that displays a simple message.

b) Develop an applet that receives an integer in one text field, and computes its factorial value and
returns it in another text field, when the button named “Compute” is clicked.
c) Develop a java program that creates a user interface to perform integer divisions with possible
validations (Divide by Zero, NumberFormatException).
d) Develop a java program to implement mouse events like mouse pressed, mouse released and
mouse moved by means of adapter classes.

Module 8:

a) Develop a java program that works as a simple calculator. Use a GridLayout to arrange Buttons
for digits and for the + - * % operations. Add a text field to display the result. Handle any possible
exceptions like divide by zero.

b) Develop a java program to simulate a traffic light, user can select any one of the three buttons
with: red, yellow and green color. On selecting a button, an appropriate message with “Stop” or
“Ready” or “Go” should appear with the selected button color.

Module 9:

a) Develop a java program to print the collection data by using the following ways
i) for loop ii) for-each loop iii) Iterator iv) ListIterator
b) Develop a java program to perform all the operations in Collection interface.
 Module 10:

a) Develop a java program to implement and perform all the operations in List, Set Interface.
b) Develop a java program to implement and perform all the operations in Map interface.

Name of the Course : Design and Analysis of Algorithms

Name of the Faculty : Mr L V Krishna rao and Mr N V Naik

Semester : IV

Pre-requisites : Knowledge of Programming, Discrete Mathematics and Data

Structures.

Course Educational Objectives: Students undergoing this course are expected to identify the
fundamental concepts of various algorithm design techniques. Make the students familiar to
conduct performance evaluation of algorithms. Expertise the students with the various existing
algorithm design techniques. Motivate the students to design new algorithms for various problems.

Course outcomes: At the end of the course, the student shall be able to:

CO 1: Identify the characteristics of an algorithm and analyze its time and space complexity.

CO 2: Apply the divide-and-conquer method for searching and sorting and analyze its complexity.

CO2: Design Greedy algorithms for knapsack problem, minimum cost spanning tree,single source
shortest path problem and analyze them.

CO4: Apply dynamic programming paradigm to solve travelling sales person problem,0/1 knapsack
problem,Optimal binary search tree.

CO5: Analyse the Backtracking and branch and bound search methods on optimization problems
like N-queens, sum of subsets,o/1 knapsack ,Hamilitonian circuit and so on.

COURSE ARTICULATION MATRIX :

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 3 2 - - - - - - - - - 1 - - -
CO2 - 3 - - - - - - - - - 1 3 - -
CO3 - 3 1 - - - - - - - - 1 3 - -
CO4 - 3 - - - - - - - - - 1 3 - -
CO5 - 3 - - - - - - - - - 1 3 - -
Note: 1- Slight (Low), 2 – Moderate (Medium), 3 - Substantial (High).
UNIT – I

Introduction: Algorithm definition, Specifications, Performance Analysis- Time Complexity,

SpaceComplexity. Asymptotic Notations-Big-Oh, Omega, Theta.

Divide and Conquer: General Method, Binary Search, Finding Maximum and Minimum, Merge
Sort, Quick sort.

UNIT – II

The Greedy Method – General Method, Knapsack Problem, Job sequencing with deadlines,
Minimum-cost spanning trees, Optimal storage on tapes, Single source shortest paths,Huffman
coding.

UNIT – III

Dynamic Programming - General method, Multistage graph, All pairs shortest path, Single Source
Shortest path, Optimal Binary search trees, 0/1 Knapsack, Reliability design, the traveling salesman
problem.

UNIT - IV

Back tracking - The General Method, The 8-Queens Problem, Sum of subsets, Graph Colouring,
Hamiltonian cycles.

UNIT-V

Branch and Bound – General method, Job sequencing with deadlines –LC Branch and Bound, FIFO
Branch and Bound and LIFO Branch and Bound, 0/1 Knapsack problem - LC Branch and Bound
solution, FIFO Branch and Bound solution, Travelling salesperson Problem – LC Branch and
Bound solution

TEXT BOOK(S):

1. Ellis Horowitz, SartajSahni, ―Fundamentals of Computer Algorithms, Galgotia Publications

REFERENCES

1. Mark Allen Weiss, ―Data Structures and Algorithm Analysis in C++‖, Pearson, 3/e , 2007.

2. Aho, Hopcroft & Ullman, ―The Design and Analysis of Computer Algorithms‖, Addison
Wesley publications.

3. Thomas H.Corman et al, ―Introduction to Algorithms‖, PHI.

4. Anany Levitin, ―Introduction to the Design and Analysis of Algorithms‖, PEA

5. P. H. Dave, H. B. Dave, ―Design and Analysis of Algorithms‖, Pearson Education, 2008.

 Course Name : Database Management Systems

Name of the faculty : CHRJ & SG

Semester : IV

Pre-requisites: Elementary set theory, Concepts of relations and functions, propositional logic data
structures (trees, graphs, dictionaries) & File Concepts.
Course Educational Objective: This course enables the students to know about Basic concepts of
DBMS, Database Languages, Database Design, Normalization Process, Transaction Processing,
Indexing and Interfacing with NOSQL using MonogoDB.
Course Outcomes:
On completion of the course, the student shall be able to

Understand the functional components of DBMS & Develop E-R model for simple
CO1 database applications

CO2 Devise Queries using Relational algebra and SQL.

CO3 Employ principles of normalization for good database design.
Analyze components of transaction processing, Concurrency control mechanisms and
CO4
recovery strategies of DBMS.
Evaluate different File organization & Indexing Techniques and Demonstrate the
CO5 competency in selecting NoSQL Database.

COURSE ARTICULATION MATRIX (Correlation between COs, POs & PSOs):

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 1 1 2 - - - - - - - - - - 3 -

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

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

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

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

Note: Enter Correlation Levels 1 or 2 or 3. If there is no correlation, put ‘-’ ,1- Slight (Low), 2 –
Moderate (Medium), 3 - Substantial (High).
UNIT – I
Introduction: An overview of Database Management System, Database System Vs File System,
Database System Concepts and Three Schema Architecture, Data Models, Database Schema and
Instances, Data Independence, Database Languages, Database Structure.
Data Modeling using the Entity Relationship Model: ER model concepts, Notation for ER
Diagram, Mapping Constraints, Keys, Concepts of Super Key, Candidate Key, Primary Key,
Generalization, Aggregation, Reduction of an ER Diagrams to Tables, Relationships of Higher
Degree.
UNIT – II
Relational Data Model and Language: Relational Data Model Concepts, Integrity Constraints:
Entity Integrity, Referential Integrity, Key Constraints, Domain Constraints, and Relational Algebra.
Introduction to SQL: Characteristics of SQL, Advantage of SQL. SQL Data types and Literals,
Insert, Update and Delete Operations, Tables, Views and Indexes, Nested Queries, Aggregate
Functions, Joins, Unions, Intersection, Minus, Cursors in SQL, Triggers in SQL.
UNIT – III
Normalization: Functional Dependencies, Normal Forms - First, Second, Third Normal Forms,
BCNF, Inclusion Dependences, Loss Less Join Decompositions, Multi Valued Dependencies, Fourth
Normal Form, Join Dependencies and Fifth Normal Form.
UNIT – IV
Transaction Processing Concepts: Transaction System, Testing of Serializability, Serializability of
Schedules, Conflict & View Serializability, Recoverability, Deadlock Handling.
Concurrency Control Techniques: Concurrency Control, Locking Techniques for Concurrency
Control, Time Stamping Protocols for Concurrency Control, Validation Based Protocol, Multiple
Granularity, Recovery with Concurrent Transactions.
Crash Recovery: Log Based Recovery, Checkpoints, ARIES Algorithm
UNIT – V
Physical Database Design: Storage and file structure, indexed files, hashed files, B+ trees, files with
dense index; files with variable length records.
Interfacing And Interacting With NoSQL: Introduction to NoSQL, Storing and Accessing Data,
Storing Data In and Accessing Data from MongoDB, Querying MongoDB.
Text Books:
1. Henry F. Korth, Abraham Silberschatz, S.Sudarshan, ―Database System Concepts‖, McGraw
Hill, 6 thedition, 2009. [1,2,3,4,5]
2. RamezElmasri, ShamkanthB.Navathe, ―Fundamentals of Database Systems‖, Addison Wesley,
6 thedition, 2010. [1,2,3,4,5]
3. Shashank Tiwari, “ Professional NoSql”, John Wiely & Sons, 2011. [5]

REFERENCES
1. Raghu Ramakrishnan, JohanneseGehrke, ―Database Management System‖, McGraw Hill, 3
rdedition, 2000. [1,2,3,4,5]
2. Date C J, ―An Introduction to Database System, Pearson Education, 8th edition, 2003. [1,2,3,4,5]
Course Name : Database Management Systems

Name of the faculty : CHRJ & SG

Semester : IV

Course Educational Objective: The major objective of this lab is to provide a strong formal
foundation in database concepts, technology and practice to the participants to groom them into
well-informed database application developers.

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

CO1: Create relational database using SQL and implement various integrity constraints.

CO2: Formulate simple and complex queries using SQL for manipulation of data in a relational
database.

CO3: Create views on relational database based on the requirements of users.

CO4: Implement procedures, triggers and cursors on relational database and create NoSQL
database for sample application.

Articulation matrix (COs - POs):

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

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

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

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

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

Introduction: Language basics and example queries (one or two weeks)

1) Create a table STUDENT with appropriate data types and perform the following
queries. Attributes are Roll number, student name, date of birth, branch and year of
study.
a) Insert 5 to 10 rows in a table?

b) List all the students of all branches

c) List student names whose name starts with ‘s‘
d) List student names whose name contains ‘s‘as third literal
e) List student names whose contains two ‘s‘ anywhere in the name
f) List students whose branch is NULL
g) List students of CSE & ECE who born after 1980
h) List all students in reverse order of their names
 i) Delete students of any branch whose name starts with ‘s‘
j) Update the branch of CSE students to ECE
k) Display student name padded with *‘after the name of all the students.

2) Create the following tables based on the above Schema Diagram with appropriate data
types and constraints and perform the following queries.
SAILORS (Saild, Salname, Rating, Age)
RESERVES (Sailid, boatid, Day)
BOATS (Boatid, Boat-name, Color)
a) Insert 5 to 10 rows in all tables?
b) Find the name of sailors who reserved boat number 3.
c) Find the name of sailors who reserved green boat.
d) Find the colors of boats reserved by Ramesh.
e) Find the names of sailors who have reserved at least one boat.
f) Find the all sailid of sailors who have a rating of 10 or have reserved boated 104.
g) Find the Sailid‘s of sailors with age over 20 who have not registered a red boat.
h) Find the names of sailors who have reserved a red or green boat.
i) Find sailors whose rating is better than some sailor called Salvador.
j) Find the names of sailors who are older than the oldest sailor with a rating of 10.
3) Schema Diagram for the rest of the SQL and PLSQL Programs.

Create the following tables based on the above Schema Diagram with appropriate data
types and constraints.

EMPLOYEE(Fname, Mname, Lname,SSN, Bdate, Address, Gender, Salary,

SuperSSN,Dno)

DEPARTMENT (Dnumber, Dname, MgrSSN, Mgrstartdate)

DEPENDENT (ESSN, Dependent_Name, Gender, Bdate, Relationship)

a) Insert 5 to 10 rows into all the tables.

b) Display all employees’ names along with their department names.
c) Display all employees’ names along with their dependent details.
d) Display name and address of all employees who work for Research department.
e) List the names of all employees with two or more dependents.
f) List the names of employee who have no dependents.
g) List the names of employees who have at least one dependent.
h) List the names of the employees along with names of their supervisors using aliases.
 i) Display name of the department and name of manager for all the departments.
j) Display the name of each employee who has a dependent with the same first name and
gender as the employee.

4) Create the following tables based on the above Schema Diagram with appropriate data
types and constraints in addition to the tables in Experiment 2.

DEPT_LOCATIONS (Dnumber, Dloaction)

PROJECT (Pname, Pnumber, Plocation, Dnum)
WORKS_ON (ESSN, Pno, Hours)

a) Insert 5 to 10 rows into all the tables.

b) Find the names of the employees who work on all the projects controlled by the
department Research.
c) List the project number, name and no. Of employees who work on that project for all
the projects.
d) List the names of all the projects controlled by the departments department wise.
e) Retrieve the names of employees who work on all projects that John works on.
f) List the project numbers for projects that involve an employee either as worker or as a
manager of the department that controls the project.
g) List the names of all employees in one department who work more than 10 hours on
one specific project.
h) For each project, list the project name and total hours (by all employees) spent on that
project.
i) Retrieve the names of all employees who work on every project.
j) Retrieve the names of all employees who do not work on any project.

5) Create a view that has project name, controlling department name, number of
employees and total hours worked on the project for each project with more than one
employee working on it.
a) List the projects that are controlled by one department from this view.
b) List the managers of the controlling departments for all the projects.
c) Demonstrate one update operation on this view.
d) List the Location of the controlling departments for all the projects.
e) Retrieve the data from the view.
6) Create a view emp from employee such that it contains only emp_no and
emp_name and department.
7) Create a view dept from department with only dept_no and location.
8) Create a view that contains the details of employees who are managers only.
9) Write a procedure to check whether the given number is Armstrong or not.
10) Write a procedure which accept the account number of a customer and retrieve the
balance.
11) Write a procedure which accepts the student number and displays the department in
which he belongs to.
12) Create a cursor to modify the salary of all employees belonging to 'Research'
department by 150%.
13) Consider the college database. Retrieve all students who have registered for a specific
course and store their details into another table using Cursors.
14) Write an update trigger on Account table. The system should keep track of the records
that are being updated.
15) Create NoSQL database for a sample application and perform CURD operations
 Course Name : Operating Systems

Name of the Faculty : Mr. G V Suresh / Mr. P Vamsi Naidu

Semester : IV

Prerequisite : Knowledge of Computer fundamentals & Data structures

Course Educational Objective:

The main objective of this course is to provide basic knowledge of computer operating system
structure and functioning. Students able to understand how Operating Systems evolved with advent
of computer architecture. Comprehend the different CPU scheduling algorithms, page replacement
algorithms, disk scheduling and identify best one.

Course Outcomes:

On completion of the course, the student shall be able to

Identify the functional aspects and implementation methods of different modules

CO1 in a general purpose operating system and familiarize with LINUX operating
system
Evaluate scheduling and communication methods of processes handled by operating
CO2
systems.
Analyse the process synchronization methods and deadlock handling approaches
CO3
employed in operating systems.
Evaluate memory management strategies such as paging and segmentation, Virtual
CO4
Memory, swapping, and page replacement algorithms.
CO5 Analyse the implementation strategies of disk and file systems.

COURSE ARTICULATION MATRIX (Correlation between COs, POs & PSOs):

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 3 1 - - - - - - - - - 1 3 1 1

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

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

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

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

Note: Enter Correlation Levels 1 or 2 or 3. If there is no correlation, put ‘-’, 1- Slight (Low), 2 –
Moderate (Medium), 3 - Substantial (High

Unit-1: Introduction to Operating System

Operating System Structures: Operating-System Services , User Operating-System Interface,
System Calls , Types of System Calls, System Programs , Operating-System Design and
Implementation, Operating-System Structure, Virtual Machines, Operating-System Generation,
System Boot.
Introduction to LINUX: Introduction to LINUX, Features of LINUX, LINUX Kernel, Terminal
and shell.
LINUX Commands: man, echo, script, pwd, passwd, who, uname, date, more, SU, ps, arp, mkdir,
cd, rmdir, ls, cp, rm, mv, cat, wc, lp, od, ln, df, du, locate, grep, chmod, mount, unmount.

Unit-2: Process Management

Processes: Process concept, Inter-process Communication, Communication in Client-Server
Systems. Threads: Overview, Multithreading Models
Process Scheduling: Scheduling Criteria, Scheduling Algorithms (FCFS, SJF, PRIORITY,
ROUNDROBIN)

Unit-3: Synchronization and Deadlocks

Synchronization: The Critical-Section Problem, Peterson’s Solution, Synchronization Hardware,
Semaphores, Classic Problems of Synchronization, Monitors.
Deadlocks: System Model, Deadlock Characterization, Methods for Handling Deadlocks,
Deadlock Prevention. Deadlock Avoidance, Deadlock Detection, Recovery from deadlock.

Unit-4: Memory Management

Memory Management Strategies: Swapping, Contiguous Memory Allocation, Paging, Structure
of the Page Table, Segmentation.
Virtual Memory Management: Demand Paging, Page Replacement, Allocation of Frames,
Thrashing.
Unit-5: File System Management
Mass-Storage Structure: Overview of Mass-Storage Structure, Disk Structure, Disk Attachment,
Disk Scheduling, Disk Management.
Implementing File System: File-System Structure, File-System Implementation, Directory
Implementation, Allocation Methods, Free-Space Management, Efficiency and Performance,
Recovery.

Text Book(s):
1. Silberschatz & Galvin, “Operating System Concepts”, Wiley, 7th edition, 2007.
[UNIT- 1, 2, 3, 4, 5]
2. Sumitabha Das., Your ―Unix The Ultimate Guide‖, TMH Publications,
2001. [UNIT-1]
Reference(s):
1. William Stallings, “Operating Systems”, PHI, 5th Edition, 2004.
2. B.A. Forouzan & R.F. Giberg, ―Unix and shell Programming‖, Thomson, First
Edition, New Delhi, 2003.
3. http://codex.cs.yale.edu/avi/os-book/OS9/slide-dir/index.html
4. https://swayam.gov.in/nd1_noc19_cs50/preview

Course Name : Operating Systems lab

 Name of the faculty : Mr. G V Suresh / Mr. P Vamsi Naidu

Semester : IV

Pre-requisite: Programming Language

Course Educational Objective: The main objective of this course is to provide the various
UNIX/Linux operating system commands, importance of System calls, Scheduling algorithms and
Memory Management techniques.

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

CO1: Gain good knowledge of shell scripting.

CO2: Understanding the process of interaction with the underlying hardware
CO3: Understand the benefits of various SYSTEM CALLS and their usage.

COURSE ARTICULATION MATRIX (Correlation between COs, POs & PSOs):

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 - - 1 1 3 - - - - - - 1 3 1 1

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

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

Note: Enter Correlation Levels 1 or 2 or 3. If there is no correlation, put ‘-’, 1- Slight (Low), 2 –
Moderate (Medium), 3 - Substantial (High

Cycle 1: Learn some of the basic concepts in OS with the help of Linux commands. Commands:
ps, kill, killall, ls, ln, readlink, cp, rm, vi editor, grep, find, who, cat, who.

Cycle 2: Introduce system calls in the Linux OS with the help of some basic system calls such as
fork, exec, sleep, wait, etc.

Cycle 3: Write a shell script that accepts a file name, starting and ending line numbers as arguments
and displays all the lines between the given line numbers.

Cycle 4: Write a shell script that deletes all lines containing a specified word in one or more files
supplied as arguments to it.

Cycle 5: Write a shell script that displays a list of all the files in the current directory to which the
user has read, write and execute permissions.

Cycle 6: Learn about some other system calls in UNIX based systems such as Signals, Signal
Handling, and Pipes.

Cycle 7: Write a program to simulate the following CPU scheduling algorithms to find turn around
time and waiting time.
 a) FCFS b) Round Robin

Cycle 8: Write a program to simulate paging technique of memory management.

Cycle 9: Write a program to simulate page replacement algorithms

a) FIFO b) LRU

Cycle10: Write a program that takes one or more file/directory names as command line input and
reports the following information on the file.

a) File type. b) Number of links. c) Time of last access. d). Read, Write and Execute
Permissions.
Name of the course : COMPUTER NETWORKS

Name of the faculty : Mr G V Suresh

Semester : IV

Course Prerequisites: Data Structures, Operating Systems

Course Educational Objective:

This course provides a foundation to understand computer networks using layered architectures. It
also helps students to understand the various network models, addressing concept, routing protocols
and design aspects of computer networks.

Course Outcomes : At the end of the course, the student shall be able to
CO1: Understand the evolution of computer networks using the layered network architecture.
CO2: Understand various techniques for both analog and digital data communication and its
Standards
CO3:Apply various Data Link layer design issues and error detection &correction techniques to
solve collisions problems.
CO4: Enables the students to compare and select appropriate routing algorithms for a network
CO5: Understand the various protocols and techniques used in transport layer and application layer
UNIT-I
Data Communication: Data Communication system components - Network Models - OSI Model -
TCP/IP Protocol Suite - Addressing - Data and Signals - Analog And Digital - Transmission
Impairment - Data rate and Channel capacity – Performance.

UNIT-II
Physical Layer
Digital Transmission - Digital-To-Digital Conversion - Analog Transmission – Digital-to-Analog
Conversion - Transmission Media - Guided Media - Unguided Media: Wireless - Wired LANs:
Ethernet - Token ring - Connecting Devices – Switching techniques.

UNIT-III
Data Link Layer
Link Layer: Types of errors –Error detection- VRC, LRC, CRC techniques - Data Forward and
backward error correction - Hamming code. Flow control: stop and wait- sliding window protocol,
Error control: Stop and wait ARQ- Go-Back-N ARQ- Selective Repeat ARQ Protocols-
Asynchronous and Synchronous Protocol - HDLC frames.

UNIT-IV
Network Layer
Design issues, IPv4 classful and classless addressing, subnetting, Routing algorithms: distance
vector and link state routing, Congestion control: Principles of Congestion Control, Congestion
prevention policies, Leaky bucket and token bucket algorithms.

UNIT-V
Transport Layer and Application Layer
Process-to-Process Delivery: UDP – TCP - Congestion Control - Quality of Service - Techniques to
Improve QoS – Application Layer–FTP, DNS, Electronic mail, MIME, SNMP. Introduction to
World Wide Web.

Learning Resources
Text Books:
1. Behrouz Forouzan, “Data Communications and Networking”, Tata McGraw Hill, 5th
Edition, 2015.
2. Tanenbaum, “Computer Networks”, PHI, 5rd Edition.
Reference
1. William Stallings, “Data and Computer Communications”, PHI, 10th Edition, 2015.
2. Schewber, “Data Communication”, McGraw Hill, 1987.
3. http://www.cse.iitk.ac.in/users/dheeraj/cs425/
4. http://www.tcpipguide.com/free/t_OSIReferenceModelLayers.htm
5. http://www.networkdictionary.com/protocols/osimodel.php
 Name of the course : COMPUTER NETWORKS LAB
Name of the faculty : Mr G V Suresh
Semester : IV

Course Objective
Prepare students to write programs to illustrate communication in networks, Configure different
networks (LAN, WAN) and prepare students to differentiate various protocols and their
performance

Course Outcome: At the end of the course, the student shall be able to

CO1:Implement network protocols and analyze its performance to solve network related problems.

CO2:Apply professional, ethical, legal, security and social issues for configuring and developing
network applications.
CO3:Use tools, techniques and protocols in designing network applications.

PART-A
1. Introduction to Network Simulator NS2/NS3
PART-B
2. Develop the Simulation for the network with 2 nodes and 1 link.
3. Develop the Simulation for the network with 4 nodes
4. Simulate transmission of ping message
5. Simulation of error correction code (like CRC).
6. Create scenario and study the performance of CSMA / CD protocol through simulation
7. Create scenario and study the performance of token bus protocol through simulation.
8. Simulate and to study stop and Wait protocol
9. Simulate and to studySliding Window Protocol
10. Simulate and to study of Go Back N protocol
11. Simulate and to study of selective repeat
12. Implement an Ethernet LAN using n nodes and set multiple traffic nodes and plot
congestion window for different source / destination.
13. Study the concept and different frames of HDLC protocol
14. Simulate and study the Distance Vector routing algorithm using simulation.
15. Simulate and study the link state routing algorithm using simulation
16. Simulation TCP/UDP performance

SOFTWARE
Network simulator like NS2/Glomosim/OPNET/ Packet Tracer / Equivalent