KAKATIYA UNIVERSITY, WARANGAL

Scheme of Instruction and Evaluation

First Semester of Second Year of 4-Year B.Tech. Degree Programme
COMPUTER SCIENCE AND ENGINEERING
Periods of Instruction
per week

Evaluation Scheme

Lecture
s

Tutoria
ls

Practic
als

External
Evaluation
Time
Max.
(Hrs)
Marks

Mathematics-II

100

50

150

MH212

Discrete Mathematics

100

50

150

EE213

Basic Electrical Engineering

100

50

150

CS214

Object
Oriented
Programming Concepts

100

50

150

CS216

Data Processing

100

50

150

CS217

Object
Oriented
Programming Laboratory

50

25

75

CS218

Data Processing Laboratory

50

25

75

EE215

Basic Electrical Engineering

Laboratory

50

25

75

Total

15

325

975

Course
Number

Name of the Course

MH211

650

Internal
Evaluation
Time
Max.
(Hrs)
Marks

Total
Mark
s

KAKATIYA UNIVERSITY, WARANGAL

Scheme of Instruction and Evaluation
Second Semester of Second Year of 4-Year B.Tech. Degree Programme
COMPUTER SCIENCE AND ENGINEERING
Evaluation Scheme
Cours
e
Numb
er

Name
Course

of

MH22
1

Mathematics-III

EI226

Basic Electronics

CS22
3

Data Structures

CS22
4
CS22
5
CS22
9
CS22
8
EI227

the

Computer
Architecture
and
Organization
Principles
of
Programming
Languages
Data
Structures
Laboratory
System
Software
Laboratory
Basic
Electronics
Laboratory
Total

Periods of Instruction
per week
Lectur
es

Tutori
als

Practic
als

External
Evaluation
Tim Max.
e
(Hr Mark
s)
s

100

50

150

100

50

150

100

50

150

100

50

150

100

50

150

50

25

75

50

25

75

50

25

75

15

325

975

650

Internal
Evaluation
Time
Max.
(Hrs)
Marks

Total
Marks

KAKATIYA UNIVERSITY, WARANGAL

Scheme of Instruction and Evaluation
First Semester of Third Year of 4-Year B.Tech. Degree Programme
COMPUTER SCIENCE AND ENGINEERING
Evaluation Scheme
Course
Number

Periods of Instruction
Per week
Name of the Course
Lectures

Tutorials

Practicals

External
Evaluation

Internal
Evaluation

Time

Max.
Marks

Time
(Hrs)

Max.
Marks

100

50

150

Total
Marks

(Hrs)
-

OE311

Open Elective

CS310

Theory of Computation

100

50

150

CS316

Database System Design

100

50

150

CS314

Operating Systems

100

50

150

EC318

Digital Electronics

100

50

150

CS313

Database System
Laboratory

50

25

75

CS315

Java Laboratory

50

25

75

50

25

75

15

325

975

EC319

Digital
Laboratory
Total

Design

Electronics

OE311- Open Elective: A: Operations Research

C: Entrepreneurship Development

650

B: Management Information Systems

D: FOREX and Foreign Trade

KAKATIYA UNIVERSITY, WARANGAL

Scheme of Instruction and Evaluation
Second Semester of Third Year of 4-Year B.Tech. Degree Programme
COMPUTER SCIENCE AND ENGINEERING
Evaluation Scheme
Periods of Instruction
per week
Tutorials

Practicals

External
Evaluation
Time Max.
(Hrs)
Mark
s

Management, Economics and

3
Accountancy

100

50

150

CS320

Algorithm Analysis and Design

100

50

150

CS323

Software Engineering

100

50

150

CS322

Language Processors

100

50

150

EC3211

Communication Systems

100

50

150

EI327

Microprocessors and Interfacing

100

50

150

CS3212

Language Processors Laboratory

50

25

75

EI329

Microprocessors and Interfacing

Laboratory

50

25

75

Total

350

1050

Course
Number

Name of the Course

MH321

Lectures

18

700

Internal
Evaluation
Time Max.
Marks
(Hrs)

Total
Mar
ks

KAKATIYA UNIVERSITY, WARANGAL

Scheme of Instruction and Evaluation
First Semester of Fourth Year of 4-Year B.Tech. Degree Programme
COMPUTER SCIENCE AND ENGINEERING
Evaluation Scheme
Cours
e
Numb
er

Name of the Course

CS410

Periods of Instruction
Per week

External
Evaluation
Time
Max.
(Hrs)
Marks

Internal
Evaluation
Time
Max.
(Hrs)
Marks

Total
Marks

Lecture
s

Tutorial
s

Practicals

Computer Networks

100

50

150

CS411

Artificial Intelligence

100

50

150

CS412

Computer Graphics and

Multimedia

100

50

150

CS413

VLSI System Design

100

50

150

CS414

Professional Elective-I

100

50

150

CS415

Computer Graphics and

Multimedia Laboratory

50

25

75

CS416

GUI Laboratory

50

25

75

CS417

Project Work

50

50

Total

15

350

950

Professional Elective-I
1. Neural Networks
2.Advanced Database Management Systems
3.Embedded Systems

600

KAKATIYA UNIVERSITY, WARANGAL

Scheme of Instruction and Evaluation
Second Semester of Fourth Year of 4-Year B.Tech. Degree Programme
COMPUTER SCIENCE AND ENGINEERING
Evaluation Scheme
Periods of Instruction
per week
Lectures

Tutorials

Practical

External
Evaluation
Time Max.
(Hrs)
Marks

Network Programming

100

50

150

CS421

Professional Elective-II

100

50

150

CS422

Professional Elective-III

100

50

150

50

25

75

50

25

75

Project Work

100

150

250

Total

14

350

850

Course
Number

Name of the Course

CS420

CS423
CS424
CS417

Network
Programming
Laboratory
Object Oriented Analysis and
Design Laboratory

Professional Elective-II
1. Cryptography and Network Security
2. Simulation and Modeling
3. Real Time Systems

Internal
Evaluation
Time Max.
(Hrs)
Marks

Total
Marks

500

Professional Elective-III
1. Data Mining and Data Warehousing
2. Digital Image Processing
3. Wireless Communications

CS214 OBJECT ORIENTED PROGRAMMING CONCEPTS

Course: II/IV B.Tech I Semester
Branch: Common to CSE, IT
External Examination: 3 Hours
Internal Examination: 2 Hours

Theory: 3 Periods/week
Tutorial: 1 Period /week
External Evaluation: 100
Internal Evaluation: 50

UNIT I
(9+3)
Programming Paradigms: Procedural Programming, Modular Programming, Object-Oriented
Programming and Generic Programming.
Introduction to C++: Basic I/O, Data types, Declarations, Scope, Initialization, Constants,
References, Expressions, Statements, Operators, Pointers, Arrays, Structures, Functions, Overloading,
Pointers to Functions, Macros, Name Space.
UNIT II
(9+3)
Classes: Access Control, Constructors, Destructors, Static and Constant Member Functions, Mutable,
In-class function definition, User-defined types.
Operator Overloading: Overloading of Binary and Unary operators, Conversion operators, Friend
functions, String operations, Matrix operations, Complex number operations.
UNIT III
(9+3)
Inheritance: Benefits of Inheritance, Cost of Inheritance, Types of Inheritance, Replacement,
Refinement, Constructors and Destructors in derived classes, Multiple Inheritance.
Polymorphism: Types of Polymorphism, Virtual Functions, Pure virtual functions, Abstract class,
Virtual Base class.
Templates: Generic class, Function templates, Class templates, Overloading function templates.
UNIT IV
(9+3)
Exception Handling: Error handling, Grouping of exceptions, Catching exceptions, Exceptions in
Constructors, Exceptions in Destructors, Exceptions that are not errors, Exception Specifications,
Uncaught Exceptions, Exceptions and Efficiency, Error Handling alternatives.
Streams: Introduction, Output Streams, Input Streams, Manipulators, File Streams, String Streams
Buffering, Locale, Stream call Backs.
SUGGESTED TEXT / REFERENCE BOOKS:
1. Bjarne Stroustrup, "The C++ Programming Language", Second Edition, Addison-Wesley Publications,
ISBN No. 81-7808-126-1, 1991.

2. Timothy Bud, An Introduction to Object Oriented Programming, Second Edition, Pearson Education,
ISBN 81-7808-228-4, 2004.
3. Stephen C. Dewhurst, Kathy, T. Stark, "Programming in C++", Second Edition, PHI publications,
ISBN No: 81-203-1143-4.
4. Wiener R.S. and Pinson L.J. "Object Oriented Programming and C++", Addison Wesley Publications,
ISBN: 0-201-15413-7, 1988.

CS216 DATA PROCESSING

Course: II/IV B. Tech. I Semester
Branch: Common to CSE, IT
External Examination: 3 Hours
Internal Examination: 2 Hours

Theory: 3 Periods/week
Tutorial: 1 Period/week
External Evaluation: 100
Internal Evaluation: 50

UNIT-I
(9+3)
Preliminaries of COBOL: History of COBOL, Coding format, Structure of COBOL program.
Character set COBOL words. Data names and identifiers, Literal. Identification division,
Environment division Configuration section, Input Output section.
Data Division: Level structure-Data Description entries Picture clause, Value clause File section,
working storage section. Edition numeric, alphabetic, alphanumeric data, special names paragraph.
Classes and categories of Data. Usage clause, Synchronized clause, Justified clause, redefines clause,
renames clause, sign clause.
UNIT-II
(9+3)
Procedure Division and Verbs: Structure Verbs Data movement, Arithmetic, sequence control,
Input output, Control and conditional. Options Corresponding option, rounded, on size error,
compute, statements, implementation differences. Use of these verbs in simple programs.
Table Handling: Occurs clause and subscripting.
Assigning values to table elements.
Multidimensional tables. Perform verb with various options. Indexed tables and Indexing. Set verb,
Search verb. Occurs depending clause sorting a table. Index data item and its use.
UNIT-III
(9+3)
File Handling in COBOL: Basic file concepts Entities and Attributes, Records, Files, Sequential
Files, Relative Files, Ordered Files, direct Access Files, Indexed Sequential Files, Random access files
Preliminaries of file structures: Introduction to design and specifications of file structures, File
Processing Operations
UNIT-IV
(9+3)
Secondary storage and system software: Disks, Magnetic Tape, Disk vs Tape, Physical Organization
of CD-ROM, Buffer management, File structure concepts
Indexing, K-way merging, Sorting of files on tapes, Balanced merge, K-way balance merge,
Multi phase merge
SUGGESTED TEXT/REFERENCE BOOKS:

1. Roy, Dustidhar, COBOL Programming, II Edition, Tata McGraw Hill, ISBN 007- 4603183,
1992.
2. Michael J Folk and Bill Zoellick and Greg Riccardi, File Structures on Object Oriented
Approach with C++, Pearson Education.
3. Phillipaukis, LT Kazimier, Information System Design Through COBOL, McGraw Hill 1977.
4. Sharad Kant, COBOL Programming, Addision Wesley, 1993.
5. E.Horowitz & H.Sahni, Fundamentals of Data Structures, Galgotia Book source, ISBN-0-71678263, 1994.

CS217 OBJECT ORIENTED PROGRAMMING LABORATORY

Course: II/IV B.Tech. I Semester
Branch: Common to CSE, IT
External Examination: 3 Hours
Internal Examination: 2 Hours

Laboratory: 3 Periods / week

External Evaluation: 100
Internal Evaluation: 50

Group-I
1. Read 10 numbers and display them in sorted order.
2. Read `n` real numbers and display them in sorted order with three decimal accuracy in octal,
decimal , and hexa decimal formats.
3. Write functions to swap two numbers using pointers and references.
Group-II
4. Write a program that prints the sizes of the fundamental types, a few pointer types and a few
enumeration of your choice. Use the sizeof operator.
5. Write a function that counts the number of occurrences of pair of letters in a string, for
example the pair ab appears twice in xabaacbaxabb.
6. Find LCM of two, three and four numbers using function overloading.
Group-III
7. Create a structure for storing students details (sno, sname, course, Array of five subjects
marks) provide the functions for printing the total marks, calculating percentage and the result.
(Note: Include the functions within the structure).
8. Write a macro to find square (A+B)-square (C+D).
9. Create a class for complex number and provide methods for addition, subtraction,
multiplication and division. Display the output in a+ib form.
Group-IV
10. Create a complex number class with default, parameterized, copy constructors and a destructor.
11. Create a class which provides a method to count the number of objects that are created for that
class. (Use static method).
12. Create a class INT that behaves exactly like an int. (Note: overload +, -, *, /, %).

Group-V
13. Create a string class and overload + to concatenate two Strings and overload () to print
substring.
14. Create Date class and overload ++ to print next date and overload -- to print previous date.
Group-VI
15. Create a string class with pointer to char as data member to represent a string and overload =
operator to copy two String objects.
16. Create a user defined array class Array and overload + to add two arrays, overload * to
multiply two arrays, overload [] to access given position element and also to use left side of an
assignment operator.
17. Create a complex number class and overload +, -, * operators using friend functions.
Group-VII
18. Create a base class person with SSN, Name, Address, Sex. Derive a student class from person
class with course_name, marks in all subjects. Provide methods to find results. (Use public,
private, protected inheritances).
19. Design classes for the following hierarchy and provide suitable methods.

Person
Name, DOB, Address

Teacher

Student

Designation, Qualification,
DOJ, Salary

College Name, Course,

Academic Year

20. Create a shape Class with methods perimeter, area. Derive classes circle , square and triangle
from shape class. Provide implementation for perimeter, area in the derived classes. (Declare
perimeter, area as pure virtual functions).
Group-VIII
21. Design classes for the following hierarchy. Provide appropriate members and methods.
Person

Employee

Student

Research
Assistant
Create an Employee, Student class as Virtual Base Classes.
22. Implement Question No. 21, by declaring pointers to base class and access the derived class
methods using base class pointers.
23. Create function template to sort an array, which can sort array of any type.
Group-IX
24. Write a function template to overload max method, which can find maximum of any data type.
25. Create a Generic calculator class to perform +, -, *, / operations on any type.
26. Create a Generic class for array of variable size and provide sorting, searching on any type.
Group-X
27. Find the roots of a quadratic equation. Handle exception for divide by zero.
28. Handle the Array Index out of Bounds Exception when accessing the elements of Arrays.
29. Create a text file of student information and display the contents of file.
Group-XI
30. Write a program to read a text file and remove all white space characters and replace each
alphanumeric character with next character in the alphabet (Replace z by a and 9 by 0).
31. Copy the contents of one file into another except the blank lines using command line
arguments.
32. Create a file with floating point numbers. Read pair of floating numbers from the file and write
into another file.
Group-XII
33. Read the contents of three files, concatenate them and display it.
34. Write complex numbers into a file in binary format and in character format.
35. Create a class with integers and overload << to place integer into a file and overload >> to read
an integer.

CS218 DATA PROCESSING LABORATORY

Course: II/IV B.Tech I Semester
Branch: Common to CSE, IT
External Examination: 3 Hours
Internal Examination: 2 Hours

Laboratory: 3 Periods/week
External Evaluation: 50
Internal Evaluation: 25

LIST OF EXPERIMENTS
1. Program for using arithmetic verbs.
2. Program to calculate average and total of marks.
3. Program to swap two numbers using temporary variable.
4. Program to find simple interest using compute verb.
5. Program to print memo of a student.
6. Program to find greatest of three no.s.
7. Program to calculate net salary according to given conditions.
8. Program to illustrate Editing characters.
9. Program to find factors of a given number.
10. Program to find factorial of a given number.
11. Program for perfect number.
12. Program to check whether given number is palindrome.
13. Program to print multiplication of given number.
14. Program to check whether given number is Armstrong or not.
15. Program to print Fibonacci series.
16. Program to print prime numbers in a given range.
17. Program to calculate sum of digits of given number.
18. Program illustrating GOTO ..Depending on clause.
19. Program to print welcome n times using PERFORM syntax.
20. Program to illustrate RENAME clause.
21. Program illustrating operations on one-dimensional array.
22. Program to search for an element in a ARRAY .
23. Program to sort the given numbers.
24. Program to sort elements of array using BUBBLE SORT.
25. Programs on matrices.
26. Program illustrating condition-name-condition.
27. Program using SEARCH verb.
28. Program for BINARY SEARCH.

29. Program to create a sequential file.

30. Program to sort a sequential file.
31. Program to merge two sequential files without using merge verb.
32. Program making use of MERGE verb.
33. Program making use of Input-Output procedure.
34. Program to create relative file.
35. Program to delete a record from a relative file.
36. Program to update a sequential file.
37. Program to append records for a sequential file.
38. Program to create an Indexed file.
39. Program to display the desired record contents in an indexed files.
40. Implementing Reclaiming space in files for fixed size records in C++. Assume fields suitably.
41. Store & Retrieve variable size records. Store fields using delimiter separated format. Store
records using delimiter separated format. Compress each record using any data compression
technique.

EE213 BASIC ELECTRICAL ENGINEERING

Course: II/IV B. Tech. I Semester
Branch: Common to CSE, IT
External Examination: 3 Hours
Internal Examination: 2 Hours

Theory: 3 Periods/week
Tutorial: 1 Period/week
External Evaluation: 100
Internal Evaluation: 50

UNIT I

(9+3)

D.C. Circuits: Ohms Law, Network Elements, Kirchoffs Laws , Source Transformation Mesh
and Nodal Analysis Power in D.C. Circuits Series, Parallel combination of Resistances Network reduction by Star-Delta Transformation, Superposition, Thevenins, Nortons and
Maximum Power transfer theorems for D.C. Circuits,

UNIT II
(9+3)
1-Phase A.C. Circuits: Phasor representation of Sinusoidal quantities, Average, R.M.S values and
Form factor, A.C through Resistor, Inductor and Capacitor, Analysis of R-L-C Series and Parallel
circuits ,Power factor, Power triangle, Series Resonance.
Measurements: Working Principle of Moving coil, Moving Iron Ammeters and Voltmeters,
Dynamometer type, Wattmeter and 1-Phase Inductance type Energy meter.
3-Phase A.C. Circuits: Production of 3-phase Voltages, Voltage, Current relationships of Line and
Phase values for Star and Delta Connections, 3-Phase Power Measurement by two wattmeter method
for balanced loads.

UNIT III
(9+3)
Magnetic circuits: Self and Mutual Inductance, Dot Convention, Coefficient of Coupling.
D.C. Machines: Constructional features, Methods of Excitation, E.M.F. Equation, Characteristics of
series shunt and Compound Generators and Applications, Torque development in D.C.motor,
characteristics of series, Shunt and Compound motors and Applications.
Single Phase Transformers: Construction and Operation principle, Development of No Load and On
Load Phasor diagrams, Equivalent circuit,O.C. and S.C. tests, Losses and Efficiency, Voltage
regulation.
UNIT IV

(9+3)

3-Phase Induction Motor: Constructional features, Principle of operation, Production of Rotating

Magnetic Field, Torque, Slip Characteristics, Applications.
1-Phase Induction Motors: Production of Rotating Field in various types of 1-Phase Motors, Split
Phase, Capacitor start, Capacitor run, shaded Pole motors and Applications.
Synchronous Generators and Motors: Principle of Operation and Applications.
SUGGESTED TEXT / REFERENCE BOOKS :
1. Vincent Del Toro, Principles of Electrical Engg. PHI.
2. Edward Hughes, Electrical Technology, (ELBS).
3. M.S.Naidu and S.Kamakshaiah , Introduction to Electrical Engg., TMGH Ltd.
4. B.L.Theraja, A.K.Thereja , ELECTRICAL TECHNOLOGY S.Chand & Company Ltd.
5. Sudhakar and Shyam Mohan Network analysis and Systhesis TMH
6. Nagrath and kothari , BASIC ELECTRICAL ENGINEERING TMH

EE215 BASIC ELECTRICAL ENGINEERING LABORATORY

Course: II/IV B.Tech. I Semester
Periods/week
Branch: Common to CSE, IT
External Examination: 3 Hours
Internal Examination: 2 Hours

Laboratory:
External Evaluation : 50
Internal Evaluation : 25

LIST OF EXPERIMENTS
1.
2.
3.
4.

Verification of Kirchhoffs Laws.

Verification of Superposition Theorem.
Verification of Thevenins Theorem.
Voltage and Current relationships of line and Phase values in Star, Delta connections and

5.
6.
7.
8.
9.
10.
11.
12.

3-phase power measurement by Two Wattmeter method.

Frequency response of R-L-C series circuit.
Determination of parameters of choke coil.
S.C. Tests on 1-Phase Transformer to determine the Equivalent circuit parameters and
predetermination of efficiency.
Efficiency and Voltage Regulation of a 1- Phase Transformer by Direct load test.
Speed Control and Swinburnes test on D.C. shunt motor to predetermine efficiency as Motor
and Generator.
Brake test on 3 Phase Induction Motor.
Load test on D.C. shunt Generator.
Demonstration Experiments
a). D.C. Motor.
b). D.C. Generator (O.C.C.)
c). 1 Phase Induction Motors.
d). Alternators.

MH211 MATHEMATICS-II
Course: II/IV B.Tech I Semester
Branch: Common to all branches
External Examination: 3 Hours
Internal Examination: 2 Hours

Theory: 3 Periods/week
Tutorial: 1 Period /week
External Evaluation: 100
Internal Evaluation: 50

UNIT I

(8+3)

1.COMPLEX INTEGRATION :
Line integration in complex plane, Cauchy's Integral
theorem (simple proof only), Cauchy's integral formula. Taylor's, series & Laurent's series expansion Zeros and singularities. Residues - Residue theorem - Evaluation of real integrals using residue
theorem ( contours of the nature semicircle and circle only).

UNIT II

(8+3)

2. LAPLACE TRANSFORMS :
Laplace transforms - inverse transforms - Properties of Laplace
transforms - Laplace transforms of unit step function, Impulse function and periodic functions Convolution theorem. Solution of ordinary differential equation with constant coefficients and system
of ordinary differential equations with constant coefficients using Laplace transforms.
UNIT III
(8+3)
3. FOURIER SERIES :
Fourier Series - Expansion in a given range Fourier series even and
odd functions - Half Range sine and cosine series expansions.

UNIT IV

(12+3)

4. PARTIAL DIFFERENTIAL EQUATIONS : Solution of wave equation, Heat equation and

Laplace equation by the method of separation of variables and their application in problems of
vibrating string, One dimensional unsteady heat flow and two dimensional steady heat flow (Problems
based on Fourier-Trigonometric series only).
TEXT BOOKS :
1. B.Grewal, "Highier Engineering Mathematics, Khanna Publishers, New Delhi.
REFERENCE BOOKS :
1. R.V. Churchill, "Complex Variables and its Applications. McGrawHill, New York.
2. Dr. M. K. Venkata Raman, "Engineering Mathematics, Vol.III, National Publishing Co., Madras.
3. E.Kreyszig, Advanced Engineering Mathematics, Wiley Eastern Ltd., New Delhi.

MH212 DISCRETE MATHEMATICS

Course: II/IV B.Tech I Semester
Branch: Common to all branches
External Examination: 3 Hours
Internal Examination: 2 Hours

Theory: 3 Periods/week
Tutorial: 1 Period /week
External Evaluation: 100
Internal Evaluation: 50

UNIT I
(9+3)
Fundamentals : Sets, Relations, their properties and diagraphs, Binary relations, Equivalence
Relations, Ordering Relations. Lattices, operations on relations, paths.

UNIT II
(9+3)
Fundamentals of Logic : Logical inferences. First Order Logic, Quantified propositions. Predicate
calculus, Mathematical induction, Pigeonhole principle.
UNIT - III
(9+3)
Elementary combinatorics : Combinations and Permutations. Enumeration with repetitions, with
Constrained repetitions, principle of inclusion and exclusion.
Recurrence relations : Coefficients of generating functions. Recurrence relations: homogeneous
recurrence relations, non homogeneous recurrence relations, non-linear recurrence relations.

UNIT - IV
(9+3)
Graphs : Basic concepts, Isomorphism, sub graphs, trees and their properties, spanning trees, binary
trees, Planner Graphs, Eulers formula, multi graphs and Euler circuits, Hamiltonian graphs,
Chromatic numbers. Four color problem.
TEXT BOOKS :
1. J.L.Mott, A.Kandel and T.P.Baker Discrete Mathematics for Computer Scientists ,
Edition, PHI, 1986.

2nd

REFERENCE BOOKS :
1. J.P.Tremblay, R.Manohar, Discrete Mathematics Structures with Application to Computer
Science, MGH, New York, 1977.
2. Zohar Manna, Mathematical Theory of Computation, MGH, New Delhi.
3. C.L. Liu, Elements of Discrete mathematics, TATA Mc. Graw Hill.

EI227 BASIC ELECTRONCS LABORATORY

Course: II/IV B.Tech. II Semester
Branch: Common to CSE, IT
External Examination: 3 Hours
Internal Examination: 2 Hours

Laboratory: 3 Hrs / week

External Evaluation: 100
Internal Evaluation: 50

LIST OF EXPERIMENTS
1. Characteristics of a Semiconductor diode / Zener diode
2. Half-wave / Full wave Rectifier with and without filters
3. Voltage Regulator
4. FET Static Characteristics CS (Common Source)
5. Biasing Circuits (BJT) fixed bias, collector to base bias, self bias.
6. Transistor as Switch / Amplifier.
7. R.C. Phase-Shift Oscillator.
8. Op-amp inverting & Non inverting amplifier
9. Op-amp: Adder, Subtractor, Integrator, Differentiator.
10. Square wave generation using Op-amp.
11. 555 Timer as Astable Multivabtraor.
12. 555 Timer as Monostable Multivabtraor.

EI226 BASIC ELECTRONICS

Course: II/IV B.Tech IISemester
Branch: Common to CSE, IT
External Examination: 3 Hours
Internal Examination: 2 Hours

Theory: 3 Periods/week
Tutorial: 1 period/week
External Evaluation: 100
Internal Evaluation: 50

UNIT I
(9+3)
P Type and N Type Semiconductors:
P N junction, V-1 Characteristics of Diode,
Temperature dependence of V-1 Characteristics. Break down of junctions Zener and avalanche,
Diode as a rectifier, Half- wave rectifier, Full-Wave center tapped rectifier, Full wave Bridge
rectifier, derivations of parameters Filters; L, C, LC, Pi-section filters, derivations of ripple factors
basic Zener regulator circuit.
UNIT II
(9+3)
Transistor : PNP and NPN transistor, Symbols and diode equivalent of transistor, transistor current
components, CE, CB,CC Characteristics, Comparision of three configurations, Construction, Principle
of operation and characteristics of FET, MOSFETS and UJT.
UNIT III

(9+3)

Comparison of BJT and FET.

AMPLIFIERS: Biasing, DC equivalent model, criteria for fixing operating point and methods of Bias
stabilization, Thermal run away and thermal stability.Bias compensation techniques Small signal low
frequency transistor amplifier circuits: h-parameter representation of a transistor, analysis of single
stage transistor amplifier using h-parameters: voltage gain, current gain, input impedance and output
impedance. RC coupled amplifier frequency response.
UNIT IV
(9+3)
Basic concepts of feedback. Advantages of negative feedback. Basic principles of Oscillator circuit,
RC Oscillator, RC Phase Shift Oscillator, Wein Bridge Oscillator, L-C Oscillator, Hartley, Colpitts
Oscillators. Derivation for frequency oscillations.
Introduction to operational Amplifier Characteristics (Ideal and Non ideal) Pin Configuration,
Amplifiers : inverting, Non-inverting, Difference, Applications: Adder, Subtractor, Integrator,
Differentiator, and square wave generators. 555 Timer: Pin configuration, Monostable and Astable
modes.
SUGGESTED TEXT / REFERENCE BOOKS:
1. Jacob Milliman and Christos C.Halkias, Electronic Devices & Circuits , MGH, 1991.
2. Botkar, Integrated Circuits Khanna Publications, N.D.
3. N.N. Bhargava, D.C. Kulshreshtra, S.C.Gupta, Basic Electronics and Linear Circuits, TTTI,
Publications, TMGH, New Delhi.
4. Jacob Milliman and Halkias, Integrated Electronics, MGH, 1991.

CS224 COMPUTER ARCHITECTURE AND ORGANIZATION

Course: II/IV B.Tech II Semester
Branch: Common to CSE, IT
External Examination: 3 Hours
Internal Examination: 2 Hours

Theory: 3 Periods/week
Tutorial: 1 Period/week
External Evaluation: 100
Internal Evaluation: 50

UNIT-I
(9+3)
Review of Computer Systems: The Evolution of Computers, Basic Functional Units and
Operation of Digital Computers, Performance Measures.
Number Representation: Integer, Signed, Unsigned, 1s Complement, 2s Complement, rs
Complement, Addition and Subtraction of Signed Numbers, Overflow in Integer Arithmetic,
Fixed and Floating Point Representation, IEEE 754 Representation, BCD , Gray code.
Instructions: Memory Location and Address: Byte addressability, Big endian & Little endian
assignments, Word alignment, Accessing Numbers, Characters and Character strings.
Addressing modes, Instruction Format: Three, Two, One, Zero Address Instructions, Risk
Instructions, Modes of Instructions, Instruction Sequencing, Assembly Language, Stacks and
Queues, Subroutines.
UNIT-II
(9+3)
Central Processing Unit: Fundamental Concepts, Execution of Complete Instruction, Control
Unit, Micro Programming Control Unit, Hardwired Control Unit, Study of 8088, Power Pc
Processor.
Memory Unit: Basic Concepts of Memory, Memory Hierarchy, Technology: RAM, ROM, Flash
Memory, EPROM, Cache Memory: Different Mapping Functions, Replacement Algorithms,
Performance Considerations: Interleaving, Hit Rate, Miss Penalty, Caches on Processor Chip,
Virtual Memory: Address Translation, Associative Memory, Page replacement algorithms.
Secondary Storage: Magnetic Hard disk, Optical Disk, Magnetic Tape.
UNIT-III
(9+3)
Computer Arithmetic: Addition & Subtraction of Signed Numbers, Carry look ahead adder,
Multiplication of positive numbers, Booths Algorithm, Fast Multiplication, Integer Division,
Floating Point Arithmetic Operation: Addition, Subtraction, Multiplication & Division .
Input/Output Unit: I/O Interface: I/O Bus and Interface Modules, I/O Vs Memory Bus, Isolated
I/O, Memory Mapped I/O, Synchronous & Asynchronous Data Transfer, Modes of Data
Transfer: Programmed I/O, Interrupt initiated I/O, Priority Interrupt: Daisy Chaining Priority,
Parallel Priority Interrupt, Priority Encoder, Interrupt Cycle, Software Routine, DMA,
Interface Circuit: Parallel, Port, Serial Port, Standard I/O Interfaces: PCI Bus, SCSI Bus,
Universal Serial Bus.
UNIT-IV
(9+3)
Computer Peripherals: Input Devices: Keyboard, mouse, joystick, track ball, touch pad , scanners.
Output Devices: Video displays, flat panel display, printers, graphics accelerators.
Advanced Concepts: Pipelining: Basic concepts, Data & instruction hazards, Influence on
instruction sets, Data path and control considerations, Super scalar operations.
Introduction to RISC, CISC.

Large Computer Systems: Forms of Parallel Processing, Array Processors, The Structure of
General purpose multiprocessor, Interconnection Networks, Memory Organization, Program
Parallelism and Shared Variables.
SUGGESTED TEXT / REFERENCE BOOKS:
1. V.C. Hamacher , Computer Organization ,TMGH, 5th Edition,
ISBN-0-07-120411-3, 2002.
2. Morris Mano, Computer System Architecture, PHI, 3 rd Edition, ISBN 81-7808687-5,
2004
3. John P Hays, Computer System Architecture and Organization, MGH, 3 rd Edition,
ISBN 0-07-115997-5, 1998.

CS223 DATA STRUCTURES

Course: II/IV B.Tech. II Semester
Branch: Common to CSE, IT
External Examination: 3 Hours
Internal Examination: 2 Hours

Theory: 3 Periods/week
Tutorial: 1 Period/week
External Evaluation: 100
Internal Evaluation: 50

UNIT-I
(9+3)
Basics of Data Structures: Data structure definition, Applications of data structures, Algorithms,
Programs, Design and analysis steps, Time and Storage analysis.
Arrays: Representation of arrays, Memory allocation for arrays, Operations on arrays, Applications of
arrays, Pointer arrays, Sparce matrix Operations, Polynomial operations.
Stacks: Stack model and operations, Stack implementation, Multiple stacks.
Stack applications: Infix, Prefix, Postfix notations, Conversion and evaluation of expressions,
Recursion.
UNIT-II
Queues: Queue model and operations, Queue implementation, Circular queue, Circular queue
implementation, Dequeues, Priority queues, Applications of queues.
(9+3)
Linked Lists: Definition, Representation of a linked list in memory, Operations on
single linked list, Double linked list, Operations on double linked list, Circular Linked list, Linked list
operations with header node, Implementation of stacks and queues using linked lists.
Applications of linked lists: Sparse matrix representation, Sparse matrix operations using lists,
Polynomial representation, Polynomial operations, Dynamic storage Management, Generalized lists,
Garbage collection and Memory compaction.
UNIT-III
(9+3)

Trees: Basic terminologies, Binary trees representation using arrays, Binary tree representation using
linked lists, Binary tree traversal algorithms: inorder traversal, preorder traversal, postorder traversal,
Threaded binary tree, binary search tree, Binary search tree operations(addition of a node, deleting a
node),AVL trees, B-trees and B+ trees.
Graphs: Terminology, Graph representation methods: adjacency matrix, adjacency lists, adjacency
multilists, Graph traversal algorithms: Depth first search, Breadth first search, spanning trees,
Minimum spanning tree, Shortest paths.
UNIT-IV
Searching: Linear search algorithm, Binary search algorithm, Fibonacci search algorithm,
Comparison of search algorithms.
(9+3)
Sorting: Insertion sort algorithm, Shell sort algorithm, Quick sort algorithm, Merge sort algorithm,
Two way merge sort algorithm, Heap sort algorithm.
Tables: Rectangular tables, Tagged tables, inverted tables, Hash tables: Hash techniques, collision
Resolution Techniques, closed hashing, open hashing, comparison of collision Resolution techniques.
(All above topics with intuitive notion of complexity of algorithms)
SUGGESTED TEXT / REFERENCE BOOKS:
1. Ellis Horowitz, Sartaj Sahani, Dinesh Metha, Fundamentals of data Structures in C++,
Galgotia Publications Pvt. Ltd., ISBN 81-7515-27, 2003.
2. D. Samanta, Classic Data Structures, Prentice Hall India, ISBN 81-203-1874-9, 2002.
3. Mark Allen Weiss, Data structure & algorithm analysis in C++, 2 nd Edition, Pearson
Education, ISBN 81-2808-670-0.
4. Yashvant P.Kanetkar, Data structures through C++, First Edition, BPB Publications, ISBN81-7656-707-8, 2003.

CS225 PRINCIPLES OF PROGRAMMING LANGUAGES

Course: II/IV B.Tech II Semester
Branch: Common to CSE,IT
External Examination: 3 Hours
Internal Examination: 2 Hours

Theory: 3 Periods/week
Tutorial: 1 Period/week
External Evaluation: 100
Internal Evaluation: 50

UNIT- I
(9+3)
Preliminaries of Programming Languages: Software development process, Languages and software
development environment, Languages and software design methods, Languages and computer
architecture, Programming language qualities, A brief historical perspective, The birds-eye view of
programming language concepts, A simple program Syntax and semantics, Expressions, Program
organization, Program data and algorithms, Data, Computation, External environment.
Syntax and Semantics: Language definition, Syntax, An introduction to formal semantics, Language
processing, The concept of binding, Generic routines, Aliasing and overloading, An abstract semantic

processor, Run-time structures, C1, C2, C3, C4, C5 languages, The structure of dynamic languages,
Parameter passing.
UNIT- II
(9+3)
Structuring the Data: Built-in types and Primitive types, Data aggregates and type constructors,
Insecurities of pointers, User-defined types and abstract data types, Abstract data types in C++, Type
systems, Static versus Dynamic program checking, Strong typing and type checking, Type
compatibility, Type conversions, Types and subtypes, Generic types, Monomorphic versus
Polymorphic type systems, The type structure of representative languages, Pascal, C++,
Implementation models, Built-in primitive types and enumerations, Pointers and garbage collection.

UNIT- III
(9+3)
Structuring the Computation: Expressions and statements, Conditional execution, Iteration,
Routines, Style issues, Side effects and aliasing, Exceptions, Exceptions handling in C++, A
comparative evaluation, Pattern matching, Nondeterminism and Backtracking, Event driven
computations, Concurrent computations, Process, Synchronization and communication, Semaphores,
Monitors and signals, Rendezvous.
Structuring the Program: Software design methods, Concepts in support of modularity, Language
features for programming in large in C, C++, Abstract data types, classes and modules, Generic units,
Generic data structures, Generic algorithms, Generic modules, Higher levels of genericity.
Object-Oriented Languages: Concepts of object-oriented programming, Inheritance and the type
system, Object-oriented features in programming languages, Object-oriented features in Java.
UNIT- IV
(9+3)
Functional Programming: Characteristics of imperative languages, Mathematical and programming
functions, Principles of functional programming, Representative functional languages, LISP, APL,
Functional programming in C++.
Logic and rule-based languages: Specification versus Implementation, Principles of logic
programming, PROLOG, Functional programming versus Logic programming, Rule-based languages.

SUGGESTED TEXT / REFERENCE BOOKS:

1. C. Ghezzi and M. Jazayeri, Programming Language Concepts, 3 rd Edition, Addison Wesley,
ISBN No: 9971-51-225-4,2002.
2. T.W. Pratt and M.V. Zelkowitz, Programming Language Concepts, 3 rd Edition, PHI,
ISBN No: 81-203-1038-1,2000.
3. Ravi Sethi, Programming Language Concepts, 2nd Edition, Addison Wesley,
ISBN No: 81-7808-104-0, 2002.

CS228 SYSTEM SOFTWARE LABORATORY

Course: II/IV B.Tech. II Semester
Branch: Common to CSE,IT
External Examination: 3 Hours
Internal Examination: 2 Hours

Laboratory: 3 Periods/week
External Evaluation : 50
Internal Evaluation : 25

LIST OF EXPERIMENTS
1. Write programs for the following.
a) reading a character and displaying it on screen.
b) to display the name and class of student in separate line.
c) to display the characters from A to Z.
d) to check the given two characters are equal or not.
e) To display alphabets in circular form from given character to the character before
f) the given character.
g) To convert the given alphabet into opposite case.
2. Write programs for the following.
a) Display the given character in its binary form.
b) To check given number is even or odd.
c) To check given number sign(+/-)
.
d) To find 2s complement of given number.
e) To change given bit position on in given binary number.
f) To change given bit position off in given binary number.
g) Reading a string and displaying it in reverse order.
3.Write programs for the following.
a) To display 0 to 9 number.
b) To display decimal number on screen
c) To convert given hexadecimal into decimal number.
d) To clear the screen.
e) To display a message in center of the screen.
f) To find min and max elements in the given Array.
4.
a) General Utility Commands : login, cal, date, who, uname, echo, passwd, pwd,
exit.
b) File & Directory Related Commands : ls, cd, mkdir, rmdir, cat, cp, rm, mv,
wc, od, comm, diff, split, ln, touch, chmod, chown, chgrp
5. (a) Do the following problems.
a) Display the contents of file (filenames starting with a and ending with X )
b) Copy the contents of directory1 to directory2.
c) Remove the all .C files from current directory.
d) Find out the no. of lines, words, chars in given file.
e) Display the identical lines from two given files.
f) Display the non identical lines from two given files.
g) Merge the three different files into single one.
h) Display the list of files in given directory.
i) Set given file as read only.
j) Set given file as read, write but not executable.

(b) Filters : ( Data Processing Commands ) : more, head, tail, cut, paste, sort, uniq,
nl, tr
6.
(a) Pattern Searching Commands : grep, egrep, fgrep
(b) Do the following
a) Display the details of all users those who are working on system.
b) Display the details of all users in a order they logged on to system(based one time) who are
working on system.
c) Create Employee(enum, ename, designation, Date of birth, Salary) Table (file)
i.
Find the details of employee from table whose name is given.
ii.
Display the last two records.
iii.
Display the details of employees in order based Date of Births.
iv.
Remove the duplicate records.
v.
Display the details of employees who are managers.
vi.
Find out the details persons whose name ends with letter a
7.
(a) Process Related Commands : ps, kill, nice, at & batch
(b) Communication Commands : write, mail, talk, finger, news
(c) Shell Script Related Commands : sh, read, command line args ($1), $ @ & $*, set, exit status
($?), logical operator ||,&& ,exit ,if, sleep& wait, case, while & until, for, here documentation
(<<start.start), trap, export variables, expr command
8. Write a Shell Scripts for the following.
a) Display attributes of file in readable format.
b) Remove duplicate files from the current directory
c) Write a Script that displays, the last 3 lines of every file specified on the command line,
preceded by the filename.
d) Write a script to convert the given file into uppercase
e) Accept two directory names as command lines arguments
(a)Delete identical files from the both directories.
(b)Identical files must be in any one of the directory.
f) Write a shell script, which reports the names and sizes of files in a directory where file size
exceeds one 1000 bytes. The directory is supplied as command line arguments. The file names
should be printed in descending order of their file size. The total no. of such files should also
be printed.
g) The file /etc/passwd contains information about all the users of the system but it is difficult to
read. Write a shell script /etc/passwd and displays in readable format.
h) Display the list of files in current directory.
a. In-order of modification time.
b. In-order of access time.
9.
a) Display the list of files in the current directory to which you have read, write and execute
permissions. Display the list of directories to which you have execute permissions.

b) Write a shell script, for multiple file copying. Ex. mcp s1 d1 s2 d2 s3 d3

c)

Write a shell script, which executes at login time. The script should display the present working directory, calendar of the present month and
report to you whether your friend has logged in. If yes, send a message to his terminal inviting him for a dinner. If you dont have write
permission to his terminal, mail him with request for his confirmation.

d) Write a shell script which gets executed at login time and displays a blinking message Good
morning/Good Afternoon / Good Evening depending upon the time at which the user logs in.
e) Write a shell script that accepts login name as command line argument, and finds out at how
many terminals the user has logged in. Do not use grep command
10.
a) Write a shell script, which develops functions for factorial and power
b) Find out recursively the files in current directory which have been last modified on January 7 th
of current year.
c) Develop a command misc which accepts an option and a file name as arguments to perform
the following tasks.
If the option is u then convert all the characters in the file to upper case.
If the option l then convert all the characters in the file to lower case.
If the option is d, change the delimiter to a character of your choice.
If the option supplied is not one of the choices, or file name is missing then
appropriate error message with the usage of the command should be displayed.
11.
a)

Rename each file in the present directory such that it will have the current shell PID
rename directories. Delete all the files whose size is 0 bytes.

an extension. Do not

b) Display the information(attributes) of processes running on system in readable format

c) Display the list of files for every 5 minutes.
d) Display the process details in the system every 30 seconds but five times
12. System Calls
File oriented System calls : open( ), creat( ) , close( ) , read( ) , write( ) , lseek( )
Process system calls: fork( ) , exit( ), exec( ) ,wait( ) , kill( )

CS229 DATA STRUCTURES LABORATORY

Course: II/IV B.Tech II Semester
Branch: Common to CSE,IT
External Examination: 3 Hours
Internal Examination: 2 Hours

Laboratory: 3 Periods/week
External Evaluation: 50
Internal Evaluation: 25

LIST OF EXPERIMENTS
1. Implementation of sparse matrix representation.
2. Implementation of sparse matrix operations(transpose and addition)
3. Implementation of stacks using arrays.
4. Implementation of queues using arrays.
5. Implementation of circular queue using arrays.

6. Conversion of infix to postfix.

7. Conversion of infix to prefix.
8. Implementation of postfix evaluation.
9. Implementation of multiple stacks in a single array.
10. Implementation of dequeues using arrays.
11. Implementation of single linked list and double linked list operations.
a) Addition
b) Deletion
c) Reverse
d) sorting
e) concatenation
f) copying
12. Implementation of stack operations using linked lists.
13. Implementation of queue operations using linked lists.
14. Implementation of circular queue operations using linked lists.
15. Implementation of single linked list operations using header node.
16. Implementation of double linked list operations using header node.
17. Implementation of polynomial operations.
a) Addition
b) Multiplication
18. Implementation of sparse matrix operations using linked lists.
19. Implementation of binary tree and its traversal algorithm.
a) Inorder
b) Preorder
c) Postorder
20. Implementation of binary search tree operations.
a) Insertion of a node
b) Deleting a node
21. Implementation of counting no.of nodes, no.of leaf nodes and height of a binary tree.
22. Implementation of graph representation algorithms.
23. Implementation of graph traversal algorithms.
a) Depth first search
b) Breadth first search
24. Implementation of searching algorithms.
a) Linear search
b) Binary search
c) Fibonacii search.
25. Implementation of sorting algorithms.
a) Insertion sort
b) Shell sort
c) Quick sort
d) Merge sort
e) Heap sort
26. Implementation of hashing techniques.
a) Open hashing.
b) Closed hashing.

MH221 MATHEMATICS -III

Course: II/IV B.Tech II Semester
Branch: Common to all branches
External Examination: 3 Hours
Internal Examination: 2 Hours

Theory: 3 Periods/week
Tutorial: 1 Period /week
External Evaluation: 100
Internal Evaluation: 50

UNIT I
(9+3)
MATRICES
: Rank of a matrix - Solution of system of linear equations - Linear
dependence and
independence of vector Characteristics roots and Characteristics vectors of a
matrix-Cayley Hamilton Theorem (without proof) - Reduction to diagonal form and normal form.
Reduction of a quadratic
form to canonical form.
UNIT II
(9+3)
PROBABILITY AND STATISTICS : Curve fitting - Method of least squares - Straight line
and parabolic curves Correlation Coefficient - Rank Correlation Regression Linear Regression
equations. Random variables Discrete
and continuous distribution - Density
and
distribution
functions - Illustrations through Binomial, Poisson, uniform, exponential
and
normal distributions.
UNIT

III
(9+3)
NUMERICAL ANALYSIS : Interpolation. Forward, Backward interpolation Newtons and
Lagrange's formulae.
NUMERACAL DIFFERENTIATION AND INTEGRATION : First and second derivatives
using forward and backward interpolation. Numerical Integration- Trapezoidal and
Simpson's rule.
UNIT IV
(9+3)
SOLUTION TO SYSTEM OF LINEAR EQUATIONS : Jacobi, Gauss Siedel iteration method Solution of algebraic and transcendental equations - Bisection method, Regula-Falsi method &
Newton Raphson's Method.
NUMERICAL SOLUTION OF ORDINARY DIFFERENTIAL EQUATIONS : Picards method,
Taylor's method, Euler's method, Runge-Kutta methods of second and fourth orders.

TEXT BOOK :
1. B.S.Grewal, Highier Engineering Mathematics, Khanna Publishers, Delhi.
REFERENCE BOOKS :
1. S.S Sastry, Introductory Numeriacal Analysis.
2. E.Kreyszic, Advanced Engineering Mathematics, Wiley Eastern, New Delhi.
3. Gupta and Kapoor , Fundamentals of Mathematical Statistics S.Chand and Co.,
New Delhi.,

CS313 DATABASE SYSTEM DESIGN LABORATORY

Course: B.Tech III/IV I-Semester
Branch: Common to CSE,IT
External Examination: 3 Hours
Internal Examination: 2 Hours

Laboratory: 3 Periods/week
External Evaluation: 50
Internal Evaluation: 25

LIST OF EXPERIMENTS
Structured Query Language (SQL):
Group-I
1. Queries on DDL (Create, Alter, Drop), DML (Insert, Update, Delete) statements.
2. Queries on Column Level and Table Level Constraints.
Group-II
1. Queries using functions of NUMBER, CHARACTER, DATE Data types
2. Queries on Data type Conversion Functions.

Group-III
Write the SQL queries for the following Using EMP, DEPT and SALGRADE Relations.
i.

Display all the employee details whose name consists two As.

ii.

Show the details of all employees hired on December 03, 1981.

iii.

Display employee number, name, salary prefix with the $ symbol and in descending order.

iv.

List the no. of clerks, no. of managers department wise if both no. of clerks and no. of
managers are >2.

v.

Check whether all employee numbers are indeed unique.

vi.

Display all the employee details who are completed their 30 years of service.

vii.

Display all the employee details who are joined in a leap year.

viii.

Display all the employee details whose age is between 50 to 60 years.

ix.
x.

In which year most employees were joined in the company. Display the year and no. of
employees.
Display the average, monthly salary bill for each job type within a dept.

xi.

Show the average salary for all departments employing more than 3 people.

Group-IV
xii.

Construct a query, which finds the job with the highest average salary.

xiii.

Change the default display like this. For deptno 10 show financial department, for 20 account
department, for 30 management information system, 40 electronic data processing.

xiv.

Display the employees name, dept name, salary and hire date for deptno=20. Specify the alias
date-hired for Hire Date.

xv.

List the employee name, job, salary, grade and deptname for everyone in the company except
clerks. Sort on salary, display the highest salary first.

xvi.

List the dept details which doesnt have any employees in it.

xvii.

List the lowest paid employees working for each manager. Exclude any group where the
minimum salary is less than 1000. Sort the output by salary.

xviii.

List the details of those employees whose salaries greater than any salary of their department.

xix.

Display the information of employees who earn more than their employees in deptno=30.

xx.

Find the employees who earn a salary greater than the average salary in their dept.

xxi.

Display the details of employees whose manager has earning highest salary among all
managers.

Group-V
xxii.

Display the employee details who are the top three earners in the company.

xxiii.

List the employee who earns the third highest salary.

xxiv.

Delete the duplicate rows in a given table

xxv.

Count the number of Constraints on EMP table.

xxvi.

Display the check constraint description in a given table.

xxvii.

Display the fifth record from a table.

xxviii.

Display the middle record in a given table.

xxix.

Display all the even rows in a given table.

xxx.

Display all the odd rows in a given table.

Group-VI
1. Write SQL statements to create simple, composite indexes.
2. Write SQL statements to create User-Defined Data types.
3. Write SQL statements to create Views.
4. Write SQL statements to create a sequence and use the sequence number in the insert statement.
5. Write SQL statements to Grant and Revoke the privileges to/from the users.

Group-VII
PL/SQL Programs:
1.

Write a PL/SQL program to reverse a given string.

2.

Create a table with duplicate records and write a PL/SQL program to insert all the duplicate records
from EMP table into another table DUP_EMP (EMPNO, ENAME, DEPTNO).

Cursors:
3.

Write a PL/SQL program to insert all those missing employees of empno between 7900 to 8000 into
Missing table.

4.

Write a PL/SQL program that will display the name, deptno and salary of the top 6 highest paid
Employees from EMP table.

Group-VIII
5. Write a PL/SQL program to debit an A/C for a given account number. If the account doesnt exist,
create a new account. ACCOUNT (ACC_NO, ACC_NAME, BALANCE).
6. A Company offers discount of different goods
Discount Table
Range

Discount

0 500
501 1000
1001 1500
1501 2000
2001 above

5
10
15
20
25

Customer Table
Cust_id
1
2
3

Cust_name

Amt_purchased

xxxx
yyyy
zzzz

400.00
1,200.00
3,450.00

Total_amt

Write a PL/SQL program to update total_amt of Customer Table.

7. Write a PL/SQL program to update the salary of all managers by 10%, clerks by 8%, and salespersons
by 4%.
8. Write a PL/SQL program to raise the salaries of the employees in the deptno 20 by 5%, whose salary is
less than 2000. A record for the raise is maintained in the emp_raise table.
EMP_RAISE (EMPNO, DATE_OF_RAISE, ACTUAL_RAISE)

Group-IX
9. Write a PL/SQL program to calculate the commission of the sales man and insert the commission in to
the commission table.
SALESMAN (SNO, SALES, RATE_OF_COMM).
COMMISSION (SNO, CDATE, COMMISSION).
10. Write a PL/SQL program for calculating average score of the players.
PLAYERS_TAB (PNO, PNAME, MATCHES_PLAYED, RUNS_SCORED, AVERAGE).

11. Write a PL/SQL program using parametric cursors (pass hiredate as parameter) to insert all those
Employees who joined the company before the parametric date into another table.

Group-X
Exception handling:
12. Write a PL/SQL program to handle proper exception, if earnings are 0.
PER_TAB (SLNO, PRICE, EARNINGS, P/E).
13. Create a table with Primary key constraint. Handle proper exception if the user tries to violate the
constraint.
14. Write a PL/SQL Program to handle User defined Exception.

Stored Procedures / Functions:

15. Write a PL/SQL program using stored procedure or function to debit an a/c and to find the balance of a
particular account. Use the table BANK (ACCOUNT, AHNAME, and BALANCE).
16. Write a PL/SQL program to calculate grade using function.
STUDENT (HTNO, NAME, M1, M2, M3, GRADE).

Group-XI

Packages:
17. Create a package like this, Use Stored procedure/function for adding , deleting ,
updating and calculating total salary (sal+comm) of employees (Use EMP table).
18. Create a package like this, Use Stored procedure/function to debit an A/c, credit an A/c and find the
balance for a given A/c no. Use a table BANK (ACC_NO, AH_NAME, BALANCE).
Database Triggers:
19. Create an EXAM table EXAM (EXAMNAME, HTNO_RANGE). Write a trigger to check for these
conditions before inserting records. For EXAMNAME=MCA, HTNO_RANGE must be 10000 to
50000, For EXAMNAME=B.Tech, the range must be 20000 to 30000.

Group-XII
20. Create a table without primary key. Write a trigger to simulate the primary key.
21. Create a student table STUDENT(HTNO, NAME, CLASS, COLLEGE). Write a trigger to insert htno
automatically whenever user inserting a new record into student table.
22. Write a database trigger which does not allow deletions of records on Sundays from EMP table.

23. Create a student table STUDENT (SNO,SNAME,COURSE). Write a trigger to allow, only those
records whose age lies between 16 and 21.

CS314 OPERATING SYSTEMS

Course: III/IV B.Tech I Semester
Branch: Common to CSE, IT
External Examination: 3 Hours
Internal Examination: 2 Hours

Theory: 3 Periods/week
Tutorial: 1 Period/week
External Evaluation: 100
Internal Evaluation: 50

UNIT-I

(9+3)

Introduction to Operating System:

Definition and Functions of Operating System. Evolution of operating system. Multi-programming
Systems, Multiprocessor Systems, Batch systems, Time sharing systems, Client server systems,
Distributed systems, Real Time systems, Clustered Systems, Handheld Systems. Feature Migration.
Concepts of Operating System:
Processes , Command Interpreters , System Calls.
Structure of Operating system:
Monolithic Structure, Layered Structure, Virtual Machine Structure. System components and
services.
Process Management:
Process Creation, Process Control Block , Process States , Operation on processes, Cooperating
processes, Inter-process communication, Threads.
UNIT-II

(9+3)

Process Synchronization:
Critical Section Problem . Two Process Solution, Multiple Process Solution. Dekkers Algorithm.
Semaphores , Monitors. Examples of process synchronization Readers Writers Problem , producer
consumer problem , Dining Philosophers problem. Process Synchronization in Solaris2 ,Windows
2000.
Deadlocks:
Definition of Deadlock, System model, Deadlock characterization, Prevention, Avoidance and
Detection , Recovery from deadlock, Combined approach.
Case Studies:
UNIX, Windows 2000, MS-DOS
UNIT-III
(9+3)
CPU scheduling:
Basic concepts of scheduling, Scheduling criteria, Scheduling algorithms(First In First Out, Round
Robin, Priority, Shortest Job First, Shortest Remaining Time First, Multilevel Queue, Multilevel
Feedback Queue), Multiple processor scheduling, Algorithm evaluation, Real time scheduling.
Memory management :

Basic concepts of Memory Management, Caching , Logical versus physical address space,
Swapping, Contiguous Vs Non-Contiguous memory allocation schemes, Paging, Segmentation,
Combined Segmentation and paging.

Virtual memory :
Overview, Multilevel storage organization, Block mapping, Demand paging, Page replacement
concept, Page replacement algorithms, Allocation of frames, Thrashing.
Input / Output:
Device Drivers, Device controllers, Disks and other Devices.
UNIT-IV

(9+3)

File Management:
File concepts, Access methods, Directory structure, File-system structure and services, Allocation
methods, Free space management.
Secondary Storage Management:
Disk structure, Disk scheduling, Disk management, Swap space management.
Advanced Concepts of Operating Systems:
Introduction to Distributed Operating Systems . Models of Distributed operating systems: Host based
models, Processor pool model, Workstation/Server model. Naming and transparency, Remote file
access, File replication, Event ordering, Mutual exclusion, Deadlock handling, Election algorithms.
Network operating systems: Remote login, Remote file transfer. Introduction to Real time operating
systems .
Protection and Security:
Goals of protection , Domain of protection , Access matrix , Implementation Access Matrix , Security
Issues , User Authentication , Program Threats , System Threats .
SUGGESTED TEXT/REFERENCE BOOKS:
1. Silber Schatz & Galvin , Operating System Concepts, John Wiley & Sons, 6th Edition, ISBN No:
9971-51-388-9, 2002
2.H.M. Dietel, "An Introduction to operating systems", Pearson Education, 2 nd Edition,
ISBN 81-7808-035-4,2000.
3. Milenkovic. M. "Operating systems: concepts Design", McGraw Hill, ISBN 0-07-463272-8 ,1987
4. Tanenbaum, "Operating System Design & Implementation ", Prentice Hall, ISBN 0-87692-601-4 ,
1987.
5.William Stalling, "OPERATING SYSTEMS", Maxwell, McMillan International Editions, ISBN
81-203-1187-6 , 1992.

CS316 DATABASE SYSTEM DESIGN

Course: III/IV B.Tech I Semester
Branch: Common to CSE,IT
External Examination: 3 Hours
Internal Examination: 2 Hours

Theory: 3 Periods/week
Tutorial: 1 Period/week
External Evaluation: 100
Internal Evaluation: 50
UNIT-I

(9+3)

Databases and Database Users: Introduction, Characteristics of the Database approach, Actors on the
scene, Workers behind the scene, Advantages of using a DBMS, Implications of the Database
Approach, When not to use a DBMS.
Database System Concepts and Architecture: Data models, Schemas, and Instances, DBMS Architecture and Data
Independence, Database Languages and Interfaces, The Database System Environment, Classification of Database
Management Systems.
Data Modeling using the Entity-Relationship Model: Using High-Level Conceptual Data Models for Database Design,
Entity Types, Entity sets, Attributes, and Keys, Relationships, Relationship Types, Roles, and Structural Constraints, Weak
Entity types, ER diagrams, Naming Conventions and Design Issues.
UNIT-II
(9+3)
Enhanced Entity-Relationship and Object Modeling: Subclasses, Superclasses and Inheritance, Specialization and
Generalization, Constraints and Characteristics of Specialization and Generalization, Modeling UNION Types Using
Categories, Formal Definitions for the EER model, Relationship Types of Degree Higher than Two.
The Relational Data Model, Relational Constraints and the Relational Algebra: Relational Model Concepts,
Relational Constraints and the Relational Database Schemas, Update Operations and Dealing with Constraint Violations,
Basic Relational Algebra Operations, Examples of Queries in Relational Algebra.
SQL: Data Definition, Constraints, Basic Queries in SQL, Complex SQL Queries, Insert, Delete and Update Statements in
SQL, Specifying General Constraints as Assertion, Additional Features of SQL.
ER and EER to Relational Mapping and Other Relational Languages:
Relational Database Design Using ER-to-Relational Mapping, Mapping EER model Concepts to Relations, The Tuple
Relational Calculus, The Domain Relational calculus, Overview of the QBE Language.
UNIT-III
(9+3)
Database Design Theory and Methodology: Informal Design Guidelines for Relation Schemas, Functional
Dependencies, Normal forms Based on Primary Keys, General Definitions of Second and Third Normal Forms, BoyceCodd Normal form, Algorithms for Relational Database Schema Design, Multivalued Dependencies and Fourth Normal
Form , Join Dependencies and Fifth Normal form, Inclusion Dependencies, Other Dependencies and Normal Forms.
Query Processing and Optimization: Translating SQL Queries into Relational Algebra, Basic Algorithms for Executing
Query Operations, Using Heuristics in Query Optimization, Using Selectivity and Cost Estimates in Query Optimization,
Overview of Query Optimization in ORACLE, Semantic Query Optimization.

UNIT-IV
(9+3)
Transaction Processing Concepts: Introduction to Transaction Processing, Transaction and System Concepts, Desirable
Properties of Transactions, Schedules and Recoverability, Serializability of Schedules.
Concurrency Control Techniques: Locking Techniques for Concurrency Control, Concurrency Control Based on
Timestamp Ordering.
Database Recovery Techniques: Recovery Concepts, Recovery Techniques based on Deferred Update, Recovery
Techniques based on Immediate Update, Shadow Paging.
Database Security and Authorization: Introduction to Database Security Issues, Discretionary Access control based on
Granting/Revoking of Privileges, Mandatory Access Control for Multilevel Security, Introduction to Statistical Database
Security.

SUGGESTED TEXT / REFERENCE BOOKS:

1. Ramez Elmasri and Shamkanth B. Navathe, Fundamentals of Database Systems,
Third Edition, Pearson Education, ISBN No: 81-7808-137-7, 2003.
2. Thomas Connolly and Carolyn Begg, Database Systems, Third Edition,
Pearson Education, ISBN No: 81-7808-861-4, 2003.
3. Abraham Silberschatz, Henry F.Korth and S.Sudarshan, Database System Concepts,
Third Edition, McGraw-Hill, ISBN No: 0-07-114810-8, 1997.
4. Raghu Ramakrishnan and Johannes Gehrke, Database Management Systems ,
International Edition, McGraw HILL, ISBN No: 0-07-123151-X, 2003.

CS310 THEORY OF COMPUTATION

Course: III/IV B.Tech, I Semester
Branch: Computer Science & Engineering
External Examination: 3 Hours
Internal Examination: 2 Hours

Theory: 3 Periods/week
Tutorial: 1 Period/week
External Evaluation: 100
Internal Evaluation: 50

UNIT I
(9 + 3)
Automata: Introduction to Mathematical preliminaries used and Introduction to Finite Automata,
Structural Representations and The Central Concepts of Automata Theory.
Finite Automata: An Informal Picture of Finite Automata, Deterministic Finite Automata, Nondeterministic Finite automata, Finite Automata with Epsilon-transitions, Finite Automata with Output,
Equivalence and Minimization of Automata.
Regular Expressions and Languages: Regular Expressions, Finite Automata and Regular
Expressions, Applications of Regular Expressions.
UNIT II
(9 + 3)
Properties of Regular Languages: Proving Languages not to be Regular, Closure Properties of
Regular Languages.
Context-Free Grammars and Languages: Context-Free Grammars, Applications of Context-Free
Grammars, Ambiguity in Grammars and Languages, Simplification of Grammars.
UNIT III
(9 + 3)
Pushdown Automata: Definition of the Pushdown Automaton, The Languages of PDA, Equivalence
of PDAs and CFGs.
Properties of Context-Free Languages: Normal Forms for Context-Free Grammars, The Pumping
Lemma for Context-Free Languages, Closure Properties of Context-Free Languages, Decision
Algorithms of CFLs.

UNIT IV
(9 + 3)
Introduction to Turing Machines: Problems that Computers cannot solve, The Turing Machine,
Programming Techniques for Turing Machines, Extension to the Basic Turing Machine.
Undecidability : A Language that is not Recursively Enumerable, An Undecidable problem that is
RE, Posts Correspondence Problem, Undecidable Problems, The Chomsky Hierarchy, Linear
Bounded Automata, Context Sensitive Languages, Overview of P & NP Problems.
SUGGESTED TEXT / REFERENCE BOOKS:
1.John E. Hopcroft, Rajeev Motwani and Jeffery D. Ullman, Introduction to Automata Theory
Languages & Computation, Pearson Education, 2nd Edition, (ISBN: 81-7808-347-7), 2002.
2. Mishra & Chandrashekaram, Theory of Computer Science, Prentice Hall of India, (ISBN: 81-2031271-6), 2002.
3.Daniel I.A.Cohen, Introduction to Computer Theory, John Wiley & Sons, 2 nd Edition, (ISBN:
9971-51-220-3), 2000.
4.Harry R. Lewis & Christopher H. Papadimithriou, Elements of the Theory of Computation,
Pearson Education, 2nd Edition, (ISBN: 81-7808-487-2), 2004.

CS315 JAVA LABORATORY

Class: III/IV B.Tech. I Semester

Laboratory: 3 Periods/week

Branch: Common to CSE,IT

External Evaluation: 3 Hours
Internal Examination: 2 Hours

External Evaluation: 50
Internal Evaluation: 25

LIST OF EXPERIMENTS

GROUP-I
1. Print all fibonacii numbers which lies between given two numbers a & b.
2. Accept the string, count number of vowels and remove all vowels.

GROUP-II
3. Accept a line of text, tokenize the line using string tokenizer class and print the tokens in reverse
order.
4. Find the average of n numbers where n to be input from the keyboard. If the n is zero or negative
then a suitable user defined Exception must be thrown. If it is not possible to convert input to
integer then Number Format Exception must be caught.

GROUP-III
5. Create a text file, copy the file into another file.
6. Split the file into smaller files and merge the splitted files into a new file.

GROUP-IV
7. Count the no. of lines, no. of words, no. of characters in a Text file using Stream Tokenizer Class.
8. Create a student file and provide operations insertion, deletion, modification based on key column.
GROUP-V
9. Create two threads. One thread displays Hello for every half second and another thread displays
hai for every second.
10. Give solution for producer and consumer problem using thread synchronization and
communication where a producer produces a set of Integers and Consumer consumes those
Integers.
GROUP-VI
11. Create a Account Class which implements all account operations. Provide locking such that
account details are consistent when the debit or credit operations invoked by the Account holders
simultaneously who have shared account.
12. Generate a random number for every second and determine whether number is even, odd,
prime or perfect.
GROUP-VII
13. Display the contents of Employee table in a neat format.
14. Insert n, no. of records into Employee table using Prepared Statement.
15. Enhance the salaries of Employee by 10% who are earning salary greater than 5000 using Callable
Statement.

GROUP-VIII
16. Delete all students whose marks are below 50% and also display the count.
17. Execute given SQL statements on the database and also display the results using Batch Updation.
GROUP-IX
18. Develop an applet which draws different geometric shapes and fill them with different colors.
19. Design applet to display good Morning if current time is between 6 AM and 12 PM and
Good Afternoon if the current time is between 12 PM and 6PM, and Good Evening if the
current time is between 6PM and 12AM.
20. Design an applet to simulate Paint Brush application.
GROUP-X
21. Design a Calculator applet.
22. Design an Applet for implementing Bouncing Ball Application
23. Design Calendar applet as following.

Jan
Feb
Mar
Apr
May

2005

Sun

Mon

Tue

Wed

Thu

Fri

Sat

GROUP-XI
24. Design servlet which keep tracks that how many clients visited the page(hit count).
24. Design an application as follows using Servlets for validating the user passwords.

User Name
Password

Validate
GROUP-XII
25. Design a servlet which accepts table name and displays the contents in tabular format.

Empp

Table Name

Content
s

Employee Table
Eno Ename Esal

26. Design a Servlet as follows and Provide implementations for Insert, Delete, Edit Buttons

Employee Details
Eno
Ename
Salary

EXIT

INSER
T

DELETE

EDIT

EC319 DIGITAL ELECTRONICS LABORATORY

Class: III/IV B.Tech. I Semester
Branch: Common to CSE,IT,EEE
Internal Examination: 2 Hours
External Examination: 3 Hours

Laboratory : 3Hours/week
Internal Evaluation: 25 Marks
External Evaluation: 50 Marks
LIST OF EXPERIMENTS

1.
2.

Logic gates: Aim: Realization of all logic gates using NAND / NOR gates and verification of their truth tables.
Half and Full Adders: Aim: Realization of Half and Full adders using NAND gates and verification of their truth
tables.
3. Half and Full subtractors: Aim: Realization of half and full subtractors using NAND gates and verification of their
truth tables.
4. BCD Adder: Aim: Design of BCD Adder using 4 bit Full Adder (IC7483) and Logic gates and verification of its truth
table.
5. n bit Ripple counter: Aim : Design of n bit ripple counter using JK/T FFS and verification of its function table.
6. Master Slave JK FF: Aim: Design of master slave JK FF with NAND gates and verification of its truth table.
7. 4 bit Ring and Johnson Counters: Aim: Design of 4 bit Ring and Johnson counters using DFFS (IC7474) and
verification of their function tables.
8. Decade Counter and Decoders: Aim: Verification of the function table of Decade Counter (IC7490) and displaying its
output in decimal form using decoders (IC7442-BCD to 7 segment and IC7446 BCD to Decimal)
9. 4:1 MUX: Aim: Design of a 4 to 1 multiplexer using logic gates and verification of its function table.
10. 8:1 MUX : Aim: Realization of Boolean expressions using 8 to 1 MUX

11. 4 bit shift Register: Aim: Design of a 4 bit shift register and verification of its different modes of operation.
12. Transfer Characteristic of NAND gate: Aim: To experimentally plot the transfer characteristic of NAND gate and to
find 0 and 1 Noise margins.
TEXT BOOK:
1.

Zvi. Kohavi, Switching and Finite Automatation, Tata McGraw-Hill, New Delhi.

OE311(A) OPERATIONS RESEARCH

Course : B.Tech. III/IV I Semester
Branch : Common to all branches
External Examination: 3 Hours
Internal Examination: 2 Hours

Theory: 3 periods/week
External Evaluation: 100
Internal Evaluation: 50

UNIT-I
(9)
1. Linear Programming: Mathematical Model, assumptions of linear programming, principles of
simplex method. Applications. Duality, Dual simplex method, revised simplex method.
UNIT-II
(9)
2. Non-linear Programming: Unconstrained Optimization techniques, Random search methods,
Decent methods, Steepest Decent method, variable metric method. Constrained optimization
techniques. Cutting plane method.
UNIT-III
(9)
3. Dynamic programming: Introduction, Multistage decision process, linear programming as a case
of dynamic programming. Computational procedures in dynamic programming.
4. Special type of linear programming : Special type of linear programming problems Transportation problems - balanced and unbalanced transportation, time transportation problem.
Assignment problem - special case of transportation.
UNIT-IV
(9)
5. Queuing Theory: Description of Queuing Models and applicability. Birth and Death Processes,
Single server models with Poisson input and exponential service. Multiple service queuing models.

SUGGESTED TEXT / REFERENCE BOOKS:

1. Handy.A.Taha, "Operation Research" 4th Edn, McMillan, 1984.
2. Kanthiswaroop, etal, Opertions Research, S.Chand & Sons, New Delhi.
3. V.K.Kapoor, "Operation Research" 5th Revd.Edn. S.Chand & sons,1990
4. J.C.Pant, Introduction Optimization, Jain Brothers, New Delhi.
5. S.S.Rao, Optimization Techniques, New Age International, New Delhi.
6. G.Hadley, Linear Programming, Addison Wesley, New Delhi.
7. Gillett, Introduction to Operations Research, Mc.Graw Hill New,Delhi

OE311(B) MANAGEMENT INFORMATION SYSTEMS

Course: III/IV B.Tech I Semester
Branch: Common to all branches
External Examination: 3 Hours
Internal Examination: 2 Hours

Theory: 3 Periods/week
External Evaluation:100
Internal Evaluation: 50

UNITI
(9)
Management Information Systems (MIS): MIS Concept, Definition, Role and Impact of MIS, MIS and Computer, MIS
and Academics, MIS and the User.
Role and Importance of Management: Introduction and Approaches to Management, Functions of Manager, Managers
and the Environment, Management as a Control System, Management by Exception, MIS A Support to the Management.
Process of Management: Management Effectiveness, Planning, Organizing, Staffing, Coordinating and Directing,
Controlling, MIS A Tool for the Management Process.

Organization Structure and Theory: Basic Model of Organization Structure, Modifications to the
Basic Model of Organization Structure, Organizational Behavior, Organization as a System, MIS
Organization.
Strategic Management of Business: The Concept of Corporate Planning, Essentiality of Strategic Planning, Development
of the Business Strategies, Short Range Planning, Tools of Planning, MIS Business Planning.
UNIT-II
(9)
Decision Making: Decision Making Concepts, Decision Methods, Tools and Procedures, Behavioral Concepts in Decision
Making, Organizational Decision Making, MIS and Decision Making Concepts.
Information: Information Concepts, Information A Quality Product, Classification of the Information, Methods of Data
and Information Collection, Value of the Information, General Model of a Human as an Information Processor, Summary
of Information Concepts and their Implications, Organization and Information, MIS and the Information Concepts.
Systems: Systems Concepts, Systems Control, Types of System, Handling System Complexity, Post Implementation
Problems in a System, MIS and System Concepts.
System Analysis and Design: Introduction, The Need for System Analysis, System Analysis of the Existing System,
System Analysis of a New Requirement, System Development Model, Structured System Analysis and Design (SSAD),
computer System Design, MIS and System Analysis.
UNIT-III
(9)
Development of MIS: Development of Long Range Plans of the MIS, Ascertaining the Class of Information, Determining
the Information Requirement, Development and Implementation of the MIS, Management of Quality in the MIS,
Organization for Development of the MIS, MIS: The Factors of Success and Failure.
Choice of Information Technology: Introduction: Nature of IT Decision, Strategic Decision, Configuration Design,
Evaluation, Information Technology Implementation Plan, Choice of the Information Technology and the Management
Information System.

Applications in Manufacturing Sector: Introduction, Personnel Management, Financial Management, Production

Management, Materials Management, Marketing Management, Corporate Overview.
Applications in Service Sector: Introduction to the Service Sector, Creating a Distinctive Service, MIS Applications in
Service Industry, MIS: Service Industry.
UNIT-IV
(9)
Decision Support Systems: Concept and Philosophy, DSS: Deterministic Systems, Artificial Intelligence (AI) System,
Knowledge Based Expert System (KBES), MIS and the Role of DSS.
Technology of Information Systems: Introduction, Data Processing, Transaction Processing, Application Processing,
Information System Processing, TQM of Information Systems, Human Factors and User Interface, Real Time Systems and
Design, Programming Languages for System coding, CASE Tools.

Business Process Re-engineering (BPR): Introduction, Business Process, Process Model of Organisation, Value Stream
Model of Organization, Business Process Delays, Relevance of the Information Technology, MIS and BPR.
Overview of Database Management Systems, Object Oriented Technologies, Client-Server Architecture, Networks.
Case Studies in MIS.
SUGGESTED TEXT / REFERENCE BOOKS:
1.
2.
3.
4.
5.

W.S.Jawadekar, Management Information Systems, Tata McGraw Hill, 2 nd Edition, ISBN: 0 07 044575 - 3,
2003.
Robert Schultheis, Mary Sumner, Management Information Systems The Managers View, Fourth Edition,
Tata McGraw Hill, ISBN: 0 07 463879 3, 2003.
Robert G.Murdick, Joel E.Ross, James R.Clagget, Information Systems for Modern Management, Third
Edition, Prentice Hall of India, ISBN: 81 203 0397 0, 2002.
Gordon B.Davis, Margrethe H.Olson, Management Information Systems, Second Edition, Tata McGraw Hill,
ISBN: 0 07 040267 1, 2000.
Jerome Kanter, Managing with Information, Fourth Edition, Prentice Hall of India, ISBN: 81 203 1012 8,
2003.

OE311(A) ENTREPRENEURSHIP DEVELOPMENT

Course: III/IV B.Tech I Semester
Branch: Common to all branches
External Examination: 3 Hours
Internal Examination: 2 Hours

Theory: 3 Periods/week
External Evaluation: 100
Internal Evaluation: 50

UNIT-I
(9)
Entrepreneurship definition, Significance of Entrepreneurship. Role of Entrepreneurship in
development advantages and limitations characteristics of a person to become an entrepreneur, human
factor in Entrepreneurship, Motivation, Leadership qualities and the essential skills of communication
etc., Role of women entrepreneurship, Agencies dealing with entrepreneurship and small scale
Industries. Case studies of successful entrepreneurs. Identification of a variable business opportunity,
Various methods.
Activity: Inputs from DIC, SFC, IIC & Nationalized Banks.
UNIT-II
(9)
Business opportunity selection, Opportunities in various branches of Engineering. Sources of new
ideas, New product, Service and Trade etc. Planning and Launching of an entrepreneurial activity.
Screening, Feasibility studies and market survey. Forecasting the demand. Technical feasibility,
Financial viability. Break even analysis. Preparation of preliminary and bankable project reports
planning infrastructure, Raw materials and human resource, requirements, fiscal incentives. An
introduction to patents process, Trade marks etc.
Activity: Visit to a small scale industry.
UNIT-III
(9)
Project planning: Product planning and development process, Definition of a project, Sequential
steps in executing the project, principles of layouts, Types of layouts, Factors influencing layouts.

choosing an optimum layout suitable to the venture. Tenders, Call for quotations, Purchase orders,
Procurement and installation of machinery and equipment, Utilities etc. Fundamentals of Production
Management, PPC-Concepts, Functions, Long & short run problems. Marketing Management:
Definition, Functions and Segments. Financial Management: Objectives & Functions
Activity: Interaction with Entrepreneurs in the field.
UNIT-IV
(9)
Personal and Human resource management: Introduction, Definitions, Importance, Factors
effecting Major functions of enterprise management. Selection, recruitment, training, placement,
development, performance appraisal systems. Legal issues in Entrepreneurship, Intellectual property
rights, Issues in setting up the organization.
Activity: Preparation of project report for variable business venture
(P.T.O)

SUGGESTED TEXT / REFERENCE BOOKS:

1. Robert D.Hisrich, Michael P. Peters, Entrepreneurship, Fifth Edition, Tata McGraw-Hill,
2002.
2. David H. Holt, Entrepreneurship New venture creation prentice hall of India.
3. Handbook for New Entrepreneurs, Entrepreneurship Development Institute of India,
Ahmedabad.
4. T.R. Banga, Project Planning and Entrepreneurship Development, CBS Publishers, New Delhi.
5. Personnel efficiency in Entrepreneurship Development-A Practical Guide to Industrial
Entrepreneurs, S. Chand & Co., New Delhi.

EC318 DIGITAL ELECTRONICS

Course: III/IV B.Tech I Semester
Branch: Common to CSE,IT,EEE
External Examination: 3 Hours
Internal Examination: 2 Hours

Theory: 3 Periods/week
Tutorial: 1 Period/week
External Evaluation: 100
Internal Evaluation: 50

UNIT I
(9+3)
Number Systems and Codes: Introduction to Number systems, Base conversion among different Number Systems,
Signed number representation, Binary arithmetic, Use of 1s and 2s complement representation in Binary Number system
Introduction to Codes, Weighted and Non weighted codes, self complementing and reflecting codes, code conversion,
Error detection and correction, Hamming codes.
Switching functions and minimization:
Basic laws of Boolean algebra, logical gates (block diagram representation), Boolean expressions, SOP and POS forms,
realization of Boolean expressions with logic gates, simplification of Boolean expressions, Karnaugh map methods,
Tabulation method.

UNIT II

(9+3)

Half Adder, Full Adder, Serial Adder, Parallel Adder, Carry look ahead Adder, BCD Adder, Subtractor, 1s and 2s
complement Adder / Subtractor.
Decoders, Seven segment LED displays, Encoders, Multiplexers, De MUXs realizationof Boolean expression using
MUXs and De MUXs.

UNIT III

(9+3)

Sequential circuits : RS, JK, D and T Flip Flops, use of direct inputs, shift registers, applications of shift registers, Ring
counter, Johnson counter.
Ripple counters Design of Mod-N ripple counters.
Synchronous sequential machines state diagrams, state tables, design of synchronous sequential machines, design of
Mod-N synchronous counters, Design of sequence detectors

UNIT IV

(9+3)

Logic Families : Introduction to logic families. Description of the terms Fan in, Fan out, Noise margin, Propagation
delay, current sourcing, current sinking.
Study of RTL, DCTL, DTL, HTL, TTL, ECL, MOS, CMOS families.
SUGGESTED TEXT/ REFERENCE BOOKS:
1.
2.
3.
4.

Zvi. Kohavi, Switching and Finite Automatation, Tata McGraw-Hill, New Delhi.
Taub & Schilling, Digital Integrated Circuits, Tata McGraw-Hill, New Delhi.
Moris Mano, Digital Logic Design, Prentice Hall of India, New Delhi.
Samuel.C.Lee & B.S.Sonde, Digital Circuits & Logic Design, Prentice Hall of India, New Delhi.

5. A.Ananda Kumar, Fundamentals of Digital Circuits, Prentice Hall

of India, New Delhi

OE311(A) ENTREPRENEURSHIP DEVELOPMENT

Course: III/IV B.Tech I Semester
Branch: Common to all branches
External Examination: 3 Hours
Internal Examination: 2 Hours

Theory: 3 Periods/week
External Evaluation: 100
Internal Evaluation: 50

UNIT-I
(9)
Entrepreneurship definition, Significance of Entrepreneurship. Role of Entrepreneurship in
development advantages and limitations characteristics of a person to become an entrepreneur, human
factor in Entrepreneurship, Motivation, Leadership qualities and the essential skills of communication
etc., Role of women entrepreneurship, Agencies dealing with entrepreneurship and small scale
Industries. Case studies of successful entrepreneurs. Identification of a variable business opportunity,
Various methods.
Activity: Inputs from DIC, SFC, IIC & Nationalized Banks.
UNIT-II
(9)
Business opportunity selection, Opportunities in various branches of Engineering. Sources of new
ideas, New product, Service and Trade etc. Planning and Launching of an entrepreneurial activity.
Screening, Feasibility studies and market survey. Forecasting the demand. Technical feasibility,
Financial viability. Break even analysis. Preparation of preliminary and bankable project reports
planning infrastructure, Raw materials and human resource, requirements, fiscal incentives. An
introduction to patents process, Trade marks etc.
Activity: Visit to a small scale industry.
UNIT-III
(9)
Project planning: Product planning and development process, Definition of a project, Sequential
steps in executing the project, principles of layouts, Types of layouts, Factors influencing layouts.
choosing an optimum layout suitable to the venture. Tenders, Call for quotations, Purchase orders,
Procurement and installation of machinery and equipment, Utilities etc. Fundamentals of Production
Management, PPC-Concepts, Functions, Long & short run problems. Marketing Management:
Definition, Functions and Segments. Financial Management: Objectives & Functions
Activity: Interaction with Entrepreneurs in the field.
UNIT-IV
(9)
Personal and Human resource management: Introduction, Definitions, Importance, Factors
effecting Major functions of enterprise management. Selection, recruitment, training, placement,
development, performance appraisal systems. Legal issues in Entrepreneurship, Intellectual property
rights, Issues in setting up the organization.
Activity: Preparation of project report for variable business venture
(P.T.O)

SUGGESTED TEXT / REFERENCE BOOKS:

1. Robert D.Hisrich, Michael P. Peters, Entrepreneurship, Fifth Edition, Tata McGraw-Hill,
2002.
2. David H. Holt, Entrepreneurship New venture creation prentice hall of India.
3. Handbook for New Entrepreneurs, Entrepreneurship Development Institute of India,
Ahmedabad.
4. T.R. Banga, Project Planning and Entrepreneurship Development, CBS Publishers, New Delhi.
5. Personnel efficiency in Entrepreneurship Development-A Practical Guide to Industrial
Entrepreneurs, S. Chand & Co., New Delhi.

CS320 ALGORITHM ANALYSIS AND DESIGN

Course: III/IV B.Tech, II Semester
Branch: Computer Science & Engineering
External Examination: 3 Hours
Internal Examination: 2 Hours

Theory: 3 Periods/week
Tutorial: 1 Period/week
External Evaluation: 100
Internal Evaluation: 50

UNIT-I
(9+3)
Introduction: Algorithm analysis, Time complexity and Space complexity, Big O notation, Omega notation and Theta
notation, Different mathematical approachs for solving time complexity of Algorithms.
Divide and Conquer: General method, Merge sort, Quick sort, Strassens matrix multiplication. Sets and Disjoint Set
Union: Introduction, Union and Find Operations.
UNIT-II
(9+3)
Greedy Method: General method, Optimal storage on tapes, Knapsack problem, Minimum spanning tree, Job sequencing
with deadlines.
Dynamic Programming: Multistage graphs, All pairs shortest paths, Single source, shortest paths, General weights.
UNIT-III
(9+3)
Dynamic Programming: Optimal binary search trees, String editing, 0/1 knapsack problem, Reliability design problem,
Traveling sales person problem, Flow shop scheduling.
Back tracking: General method, 8-Queen problems, Graph coloring problems.
UNIT-IV
(9+3)
Branch and Bound: 0/1 knapsack problem, Traveling sales person problem Efficiency.
NP-Hard and NP-Complete Problems: Basic Concepts: Nondeterministic Algorithms,
The classes NP-Hard and NP-complete. NP-Hard Graph Problems: Clique Decision problem, Node Cover Decision
Problem, Traveling Salesperson Decision Problem.
NP-Hard Scheduling Problems: Scheduling Identical Processors, Flow Shop Scheduling.
NP-Hard Code Generation Problems: Code generation With Common Subexpressions.
PARM Algorithms: Introduction, Computational Model. Fundamental Techniques: Prefix computation, List Ranking.
SUGGESTED TEXT / REFERENCE BOOKS:
1. E.Horowitz, S.Sahni & S.Rajasekaran Fundamentals of computer algorithms,

Galgotia publications pvt Ltd, India , ISBN 81-7515-257-5, 2003.

2. Thomas H. Cormen, Chrles E. lesiserson & Ronald L. Rivest Introduction to
algorithms, Prentice Hall, India, ISBN 81-203-1353-4, 2001.

CS3212 LANGUAGE PROCESSORS LABORATORY

Course : III/IV B.Tech II Semester
Branch : Computer Science & Engineering
External Examination: 3 Hours
Internal Examination: 2 Hours

Laboratory: 3 periods/week
External Evaluation: 50
Internal Evaluation: 25

List of Experiments
1. Programs using Lex Tool
a) Lex specification to skip comments in a file
b) Lex specification to print two digit numbers in words.
c) Lex specification to check the validity of given date.
d) Lex specification to convert given octal number into decimal equivalent.
2 .Programs using Yacc Tool
a) Yacc specification to find sentence validity.
b) Yacc specification to evaluate expressions using precedence.
c) Yacc specification to convert binary numbers to decimal numbers
d) Yacc specification to check the validity of given date.
3. Program to find all meaningful words and generate the tokens for the given input program.
4. Implementing Symbol Table for given HLL.
5. Implementing simple shift reduce parser.
6.Implementing SLR parser.
7. Implementing Canonical LR Parser.
8. Implementing LALR Parser.
9. Write a program in suitable high level language to carryout lexical analysis of an input program
in HLL.
10.Write a parser using C for any input HLL program for which lexical analysis has been carried
out.
11.Write a program to generate machine code for restricted programming expressions.
12. Experiments on code optimization of programming expressions.

CS322 LANGUAGE PROCESSORS

Course : III/IV B. Tech II Semester
Branch : Computer Science & Engineering
External Examination: 3 Hours
Internal Examination: 2 Hours

Theory : 3 periods/week
Tutorial :1 period/week
External Evaluation: 100
Internal Evaluation: 50

UNIT-I
(9+3)
Introduction to Compiling : Compilers, Analysis of the source program, The phases of a compiler,
Cousins of the compiler, Concepts of Loaders,Linkers,The grouping of phases, Compiler writing tools.
Lexical Analysis: The role of the lexical analyzer, Input buffering, Specification of tokens,
Recognition of tokens, A Language for specifying lexical Analyzers, Finite automata, Design of a
lexical analyzer, Optimization of DFA-based pattern matchers .
UNIT-II
(9+3)
Syntax Analysis : The role of a the parser, Context-free grammars, Writing a grammar, Top-down
parsing, Bottom-up parsing, Operator Precedence parsing, LR parsers, Using ambiguous grammars,
Parser generators.
Syntax Directed Translation : Syntax-directed definitions, Construction of syntax trees, Bottom-up
evaluation of S-attributed definitions, L-attributed definitions, Top-Down translation, Bottom-up
evaluation of inherited attributes, Space for attribute values at compile time, Analysis of syntaxdirected definitions.
UNIT-III
(9+3)
Type Checking: Type systems, Specification of a simple type checker ,Equivalence of type
expressions, Type Conversions.
Runtime Environments : Source language issues, Storage organization, Storage-allocation strategies,
Symbol tables, Language facilities for dynamic storage allocation, Dynamic storage allocation
techniques.
Intermediate Code Generation: Intermediate languages, Declarations, Assignment statements,
Boolean Expressions, Back patching.
UNIT-IV
(9+3)
Code Generation: Issues in the design of a code generator, The target machine, Runtime storage
management, Basic blocks and flow graphs, Next-use information, A simple code generator, Register
allocation and assignment, The dag representation of basic blocks, Peephole optimization, Generating
code from dags, Code-generation algorithm.
Code Optimization: Introduction, The principal sources of optimization, Optimization of basic
blocks, Loops in flow graphs, Introduction to global data-flow analysis, Code-improving
transformations.
SUGGESTED TEXT / REFERENCE BOOKS:
1. Alfred V.Aho, Ravi Sethi and Jeffry D. Ullman, Compiler Principles, Techniques and Tools,16 th
Indian Reprint, Pearson Education Asia, ISBN No.81-7808-046-X.,2004.
2. D.M.Dhamdere,Compiler Construction, 2nd edition, Mac Mellon India Ltd,
ISBN No.0333 -90406-0,1997.

CS323 SOFTWARE ENGINEERING

Course: III/IV B.Tech II Semester
Branch: Computer Science & Engineering
External Examination: 3 Hours
Internal Examination: 2 Hours

Theory: 3 Periods/week
Tutorial: 1 Period/week
External Evaluation: 100
Internal Evaluation: 50

UNIT-I
(9+3)
Software Engineering Concepts: The Evolving Role of Software-Software-The Changing Nature of
Software-Legacy Software-Software Myths Software Engineering- A layered Technology- A Process
Framework- The Capability Maturity Model Integration (CMMI)
Process Models: The Waterfall Model-Incremental Process Models-Evolutionary Process ModelsSpecialized Process Models
Software Engineering Practice: Software Engineering Practice-Communication Practices-Planning
Practices-Modeling Practices-Construction Practice-Deployment
Requirements Engineering: Requirements Engineering Tasks-Initiating the Requirements
Engineering Process-Eliciting Requirements-Developing Use-Cases-Building the Analysis ModelNegotiating Requirements-Validating Requirements
UNIT-II

(9+3)

Building The Analysis Model: Requirements Analysis-Analysis Modeling Approaches-Data

Modeling
Concepts-Object-Oriented Analysis-Scenario-Based Modeling-Flow-Oriented
Modeling-Class-Based Modeling -Creating a Behavioral Model
Design Engineering: Design within the Context of Software Engineering-Design Process and Design
Quality-Design Concepts -The Design Model-Pattern based Software design
Creating An Architectural Design: Software Architecture-Data Design-Architectural Styles and
Patterns-Architectural Design-Assessing Alternative Architectural Designs-Mapping Data Flow into a
Software Architecture
Modeling Component-Level Design: Component-Designing Class-Based Components-Conducting
Component-Level Design-Object Constraint Language-Designing Conventional Components
UNIT-III

(9+3)

User Interface Design:The Golden Rules-User Interface Analysis and Design-Interface AnalysisInterface Design Steps-Design Evaluation
Testing Strategies:A Strategic Approach to Software Testing-Strategic Issues-Test Strategies
for Conventional Software-Test Strategies for Object-Oriented Software-Validation TestingSystem Testing-The Art of Debugging
Testing Tactics: Software Testing Fundamentals-Black-Box and White-Box Testing-Basis Path
Testing-Control Structure Testing-Object-Oriented Testing Methods-Testing Methods Applicable at
the Class Level-Inter Class Test Case Design-Testing for Specialized Environment ,Architectures,
and Applications

UNIT-IV

(9+3)

Product Metrics: Software Quality-A Framework for Product Metrics-Metrics for the Analysis
Model-Metrics for the Design Model-Metrics for Source Code-Metrics for Testing-Metrics for
Maintenance
Project Management: The Management Spectrum-The People-The Product-The Process-The
Project- The W5 HH Principle
Metrics For Process And Projects: Metrics in the Process and Project Domains-Software
Measurement-Metrics for Software Quality-Integrating Metrics within the Software Process
Project Scheduling: Project Scheduling-Defining a Task Set for the Software Project-Defining a
Task Networks -Scheduling -Earned Value Analysis
SUGGESTED TEXT / REFERENCE BOOKS:
1. Roger S. Pressman, Software Engineering, Sixth Edition, McGraw-Hill, ISBN 007-124083-7,
2005.
2. IAN Sommerville, Software Engineering, Sixth Edition, Pearson Education , ISBN : 81-7808497-X, 2002.
3. Timothy C. Lethbridge and Robert Langaniere, Object-Oriented Software Engineering, Tata
McGraw-Hill, ISBN 0-07-058754-X, 2004.

EC3211 COMMUNICATION SYSTEMS

Course: III/IV B.Tech II Semester
Branch: Computer Science & Engineering
External Examination: 3 Hours
Internal Examination: 2 Hours

Theory: 3 Periods/week
Tutorial: 1 period/week
External Evaluation: 100
Internal Evaluation: 50

UNITI
(9+3)
Spectral Analysis: Fourier series and Fourier transform, Fourier transform of power and periodic signals and their
properties.
Hibbert Transform energy and power signals, power spectral density.
Amplitude Modulation: AM, DSB SC, SSB, VSB, their spectra, generation and detection techniques, power relations.
Frequency Modulation: Frequency and Phase Modulations, Narrow Band, Wide Band, FM generation and detection
techniques.
UNITII
(9+3)
Sampling theorem, Flat Top Sampling, Natural Sampling, Quantization, Quantization error, pulse code modulation, S/N
Ratio, Differential PCM, Delta Modulation, Adaptive Delta Modulation, Inter Symbol Interference, Pulse Amplitude
Modulation (PAM), TDM, FDM.
UNIT III
(9+3)
Data transmission Techniques: ASK, FSK, PSK, QPSK, DPSK generation and detection techniques.
Introduction to Information Theory; Information, Entropy, Channel capacity, Hartly Shannon Law, Band Width and
Signal to Noise ratio trade off, Fano-shannon algorithm, discrete memory less system, Huffman coding.
UNIT IV
(9+3)
Multiplexing and Multiple access: TDMA, FDMA, CSMA, Aloha, Slotted Aloha, CDMA, GIS. Introduction to Mobile
and Cellular Communications.

SUGGESTED TEXT / REFERENCE BOOKS:

1. Simon Haykins, Communication Systems, PHI.
2. Jeorgy Kennedy, Electronic Communication Systems, TMGH.
3. B. P.Latha, Weily Estren, Communication Systems .

EI327 MICROPROCESSORS AND INTERFACING

Course: III/IV B.Tech II Semester
Branch: Common to CSE,IT
External Examination: 3 Hours
Internal Examination: 2 Hours

Theory: 3 Periods/week
Tutorial: 1 Period/week
External Evaluation: 100
Internal Evaluation: 50

UNIT-I

(9+3)

8086 ARCHITECTURE Introduction: Evolution of Microprocessors Functional block

diagram, Register organization, addressing, Bus structure, Physical and logical
addressing, Instruction Set, Address modes.
UNIT-II

(9+3)

Assembly Language programming : Assembler directives, simple programming of 8086, Implementation of structures, time-delays, strings, procedures,
Macros, Pin configuration, Min/Max modes, Timing diagrams.

UNIT-III
(9+3)
INTERFACING : Interfacing concepts, detailed study of interfacing devices 8255, 8257, 8254 and
8259. Interfacing of switches, key boards, LEDs, 7 segment display units, CRT interface, floppy disk
Interface, stepper motor interface. ADC, DAC interfacing.
UNIT-IV
(9+3)
Serial communication standards, RS232, IEEE 488 BUS, 20mA current loop, 8251, USART,
Prototyping and trouble shooting, Software debugging tools, Microprocessors development systems.
(MDS)
SUGGESTED TEXT / REFERENCE BOOKS:
1. MICROPROCESSOR and interfacing By D.V.Hall. (TMGH).
2. MICROPROCESSOR PROGRAMMING AND INTERFACING with PC By Kenneth Ayala.
3. Micro computer systems: The 8086 family, architecture, Programming & Design Ynchangliu,
glen. A. Gibson, PHI.
4. Advanced Microprocessors Brey Pearson

EI329 MICROPROCESSORS AND INTERFACING LABORATORY

Course: III/IV B.Tech. II Semester
Branch: Common to CSE, IT
External Examination: 3 Hours
Internal Examination: 2 Hours

Laboratory: 3 Hrs / week

External Evaluation: 50
Internal Evaluation: 20

LIST OF EXPERIMENTS
1. Study of 8086 kits.
2. Sum, Average, multiplication
3. Sorting in a) Ascending order

b) Descending order.

4. Code conversions.
a) BCD to Binary

b) Binary to BCD.

c) Binary to ASCII

d) ASCII to Binary.

5. String Manipulations
6. Generation of time delays Counters.

INTERFACING EXPERIMENTS:
7. Wave form generation using DAC Modules.
a) Square wave
b) Saw tooth
c) Triangular.
8. LED/LCD interfacing.
9. Traffic controller.
10. ADC interfacing.

MH321 MANAGEMENT, ECONOMICS AND ACCOUNTANCY

Course: III/IV B.Tech, II Semester
Branch: Common to all branches
External Examination: 3 Hours
Internal Examination: 2 Hours

Theory: 3 Periods/week
External Evaluation: 100
Internal Evaluation: 50
ECONOMICS

UNIT-I
(9)
Economics: Meaning, definition, Scope: Micro and Macro. Assumptions and Methods.
Usefulness:
Factors of Production: Meaning and definition. Characteristics of Land Labour, Capital and entrepreneurship. Division of
Labour: Advantages and Disadvantages. Formation of Capital. Forms of Business Organization: Sole Propritaryship,
Partnership Concern, Cooperative Societies Joint Stock Company. Types of Partners, Types of Joint Stock Companies.
Merits and Demerits.
MANAGEMENT
UNIT-II
(9)
Management: Meaning and Definition. Scope of Management: -Principles of Management. Scientific Management:
Definition, Characteristics and Criticism.
Functions of Management: Planning: Definition and Process. Organizing Definition of Organization: Characteristics and
types. Principles of Organization. Departmentation: Meaning and fundamentals of Departmentation. Centralization and
Decentralization: Definition: features , Merits, and Demerits. Communication: Process of Communication, Channels,
Media, and Barries.
UNIT-III
(9)
Staffing : Meaning and functions of Personnel Management. Coordination: Definition, How to achieve effective
coordination. Controlling: Definition and |Process.
ACCOUNTANCY
UNIT-IV
(9)
Double Entry Book-Keeping: Definition . Journalization of Transactions. Ledger Posting and Balancing. Preparation of
Trail Balance.
Preparation of Final Accounts: Trading Account, Profit and Loss Account and Balance Sheet(with simple adjustments).
SUGGESTED TEXT / REFERENCE BOOKS:
1. Modern Economic Theory By K.K.ewett.
2. Principles and Practice of Management By L.M. Prasad.
3. Introduction to Accountancy by T.S.Grewal.
4. Business Organization and Management Y.K.Bushan.

CS410 COMPUTER NETWORKS

Course: IV/IV B.Tech. I Semester
Branch: Computer Science & Engineering
External Examination: 3 Hours
Internal Examination : 2 Hours

Theory : 3 Periods/week
Tutorial: 1 Period/week
External Evaluation: 100
Internal Evaluation : 50

UNIT-I
(9+3)
Introduction: A Communication Model, Data Communications, Data Communications Networking,
Protocols and Protocol Architecture.
Reference Models: OSI, TCP/IP, A Comparison of OSI and TCP/IP reference models.
Transmission Media: Guided transmission media, Wireless Transmission, Communication Satellites.
Data Link Control: Flow Control, Error Detection, Error Control, High-Level Data Link Control.
UNIT II
(9+3)
Circuit Switching: Switched Networks, Circuit-Switching Networks, Switching Concepts, Routing,
Control Signaling.
Packet switching: Packet-Switching Principles, Routing, Congestion Control, and X.25.
Frame relay: Architecture, Call Control, User Data Transfer, Network Function, and Congestion
Control.
ISDN and Broadband ISDN: ISDN Channels, User Access, ISDN Protocols, Broadband ISDN.
Asynchronous transfer mode (ATM): Protocol Architecture, ATM Logical Connections, ATM
Cells, Transmission of ATM Cells, ATM Adaptation Layer, Traffic and Congestion Control.
UNIT III
(9+3)
LAN Technology: LAN Architecture, Bus/Tree LANs, Ring, Star LANs, Wireless LANs.
LAN Systems: Ethernet and Fast Ethernet (CSMA/CD), Token Ring and FDDI. ATM LANs. Fibre
Channel.
Bridges: Operation, Routing, ATM LAN Emulation.
Internetworking: Principles of Internetworking, Connectionless Internetworking, Internet Protocol,
Routing Protocol, IPv6, ICMPv6
UNIT IV
(9+3)
Transport Protocols: Transport Services, Protocol Mechanisms, TCP, UDP.
Network Security: Introduction to Security, Threats & Attacks, Encryption.
Application Layer Services: Introduction to HTTP, FTP, SMTP, Domain Name Service, Proxy,
Firewalls, Virtual Private Networks.

SUGGESTED TEXT / REFERENCE BOOKS:

1. William Stallings, DATA AND COMPUTER COMMUNICATIONS, 5 th Edition, Prentice-Hall
of India (PHI), ISBN-81-203-1240-6, 1999.
2. Andrew S. Tanenbaum, Computer Networks, 4th Edition, Pearson Education Asia, ISBN-817808-785-5, First Indian Reprint 2003.

CS414(2) ADVANCED DATABASE MANAGEMENT SYSTEMS

Class : IV/IV B.Tech. I Semester
Branch : Computer Science & Engineering
External Examination: 3 Hours
Internal Examination: 2 Hours

Theory: 3 Periods /Week

External Evaluation: 100
Internal Evaluation: 50

UNIT I
(9)
Overview of Storage and Indexing: Data on External Storage, File Organizations and indexing,
Index Data Structures, Comparison of File Organizations, Indexes and Performance Tuning.
Storing Data Disks and Files: The Memory Hierarchy, Redundant Arrays of Independent Disks, Disk
Space Management, Buffer Manager, Files of records, Page Formats, Record Formats.
Tree-Structured Indexing: Intuition for Tree Indexes, ISAM, B+ Trees, Search, Insert, Delete,
Duplicates, B+ Trees in practice.
Hash-Based Indexing: Static Hashing, Extendible Hashing, Linear Hashing, Extendible versus Linear
Hashing.
UNIT II
(9)
Overview of Query Evaluation: The System Catalog, Introduction to operator Evaluation,
Algorithms for Relational Operations, Introduction to query optimization, Alternative Plans, What a
Typical Optimizer Does.
External Sorting: A simple Two-Way Merge Sort, External Merge Sort, Minimizing I/O Cost versus
Number of I/Os, Using B+ trees for Sorting.
Evaluating Relational Operators: The Selection Operation, General Selection Conditions, The
Projection Operation, The Join Operation, The Set Operations, Aggregate Operations, The Impact of
Binding.
UNIT III

(9)

Parallel and Distributed Databases: Introduction, Architectures for Parallel Databases,

Parallel Query Evaluation, Parallelizing Individual Operations, Parallel Query Optimization,
Introduction to Distributed Databases, Distributed DBMS Architectures, Storing Data in
Distributed DBMS, Distributed Catalog Management, Distributed Query Processing, Updating
Distributed data, Distributed Transactions, Distributed Concurrency Control, Distributed
Recovery.
Object-Database Systems: Motivating Example, Structured Data Types, Operations on
Structured Data, Encapsulation and ADTs, Inheritance, Objects, OIDs and Reference types,
Database design for an ORDBMS, ORDBMS Implementation Challenges, OODBMS, Comparing
RDBMS,OODBMS, and ORDBMS.
Data Warehousing and Data Mining: Terminology and definitions, Characteristics of Data
Warehouses, Data Modeling for Data Warehouses, Building a Data Warehouse, Typical functionalities
of Data Warehouses, Difficulties of Implementing Data Warehouses, Open Issues in Data
Warehousing, An Overview of Data Mining Technology, Association Rules.

UNIT IV
(9)
Deductive Databases: Introduction to Recursive Queries, Theoretical Foundations, Recursive Queries
with Negation, From Datalog to SQL, Evaluating Recursive Queries.
Information Retrieval and XML data: Colliding Worlds: Databases, IR, and XML, Introduction to
Information Retrieval, Indexing for Text Search, Web Search Engines, Managing Text in DBMS, A
Data Model for XML, XQUERY: Querying XML Data, Efficient Evaluation of XML Queries.
Spatial Data Management: Types of Spatial Data and queries, Applications involving Spatial Data,
Introduction to Spatial Indexes, Indexing Based on Space-Filling Curves, Grid Files, R Trees: Point
and Region Data, Issues on High Dimensional Indexing.

SUGGESTED TEXT / REFERENCE BOOKS :

1. Raghu Ramakrishnan and Johannes Gehrke , Database Management Systems ,
International Edition, McGraw HILL, ISBN No: 0-07-123151-X, 2003.
2.Ramez Elmasri and Shamkanth B. Navathe, Fundamentals of Database Systems,
Third Edition, Pearson Education, ISBN No: 81-7808-137-7, 2003.
3. Thomas Connolly and Carolyn Begg, Database Systems, Third Edition,
Pearson Education, ISBN No: 81-7808-861-4, 2003.
4. Abraham Silberschatz Henry F.Korth and S.Sudarshan, Database System Concepts,
Third Edition, McGraw-Hill, ISBN No:0-07-114810-8, 1997.
5. Jeffrey D.Ullman and Jennifer Widom, A First Course in Database Systems,
First Indian reprint, Pearson Education, ISBN No: 81-7808-303-5, 2001.

CS411 ARTIFICIAL INTELLIGENCE

Course : IV/IV B.Tech. I Semester
Branch : Computer Science & Engineering
External Examination: 3 Hours
Internal Examination: 2 Hours

Theory : 3 Periods/week
Tutorials : 1 Period/week
External Evaluation: 100
Internal Evaluation: 50
UNIT-I

(9+3)

Introduction to Artificial Intelligence: The AI problem domains, The underlying assumption, An AI

technique, The level of the model, Criteria for success.
Problems, Problem Spaces and Search: Defining the problem as a state space search, Production
systems, Problem characteristics, Production system characteristics, Issues in the design of search
programs, Additional problems.
Heuristic Search Techniques: Generate-and-Test, Hill climbing, Best-first-search, Problem
reduction, Constraint satisfaction, Means-Ends Analysis.
UNIT-II
(9+3)
Knowledge Representation Issues: Knowledge representations and mappings, Approaches to
knowledge representation, Issues in knowledge representation, The Frame problem.
Using Predicate Logic: Representing simple facts in logic, Representing Instance and Isa
relationships, Computable functions and Predicates, Resolution, Natural Deduction.

Representing Knowledge Using Rules: Procedural versus Declarative knowledge, Forward versus
Backward Reasoning.
UNIT-III
(9+3)
Weak slot and filler structures: Semantic nets, Frames.
Strong slot and filler structures: Conceptual Dependencies, Scripts, CYC.
Game Playing: The Minimax Search procedure, Adding Alpha-Beta Cutoffs, Additional Refinements,
Iterative Deepening.
Vision: Introduction, Defining the Problem, Overview of the Solution, Early Processing, Representing
and Recognizing Scenes.
UNIT-IV
(9+3)
Reasoning in Uncertain Situations: Introduction to Nonmonotonic Reasoning, Logic-Based
Abductive Inference, Abduction - Alternative to Logic.
Understanding Natural Language: Role of Knowledge in Language Understanding, Deconstructing
Language - A Symbolic Analysis, Syntax, Syntax and Knowledge with ATN Parsers, Natural
Language Applications.
Strong Method Problem Solving: Overview of Expert System Technology, Rule-Based Expert
Systems, Model-Based, Case Based and Hybrid Systems, Planning.

SUGGESTED TEXT / REFERENCE BOOKS:

1. Elaine rich and Kevin knight, Artificial Intelligence, Second Edition, Tata McGraw-Hill, ISBN
No: 0-07-460081-8, 2002.
2. George F Luger, Artificial Intelligence, Fourth Edition, Pearson Education Asia., ISBN No: 817808-491-0, 2003.
3. Eugene Charniak and Drew Mc Dermott, Introduction to Artificial Intelligence, Third Indian
reprint 2000, Pearson Education, ISBN No: 81-7808-033-8, 2000.
4. Dan W. Patterson, Introduction to Artificial Intelligence and Expert Systems, Prentice Hall of
India , ISBN No: 81-203-0777-1, 2000.

CS412 COMPUTER GRAPHICS AND MULTIMEDIA

Course: IV/IV B.Tech. I Semester
Branch: Computer Science & Engineering
External Examination: 3 Hours
Internal Examination: 2 Hours

Theory: 3 Periods/week
Tutorial: 1 Period/week
External Evaluation: 100
Internal Evaluation: 50

UNIT-I
(9+3)
Introduction to Computer Graphics: Application of Computer Graphics, Pixel, Frame buffer,
Graphics standards, Image representation, DDA and Bresenham line
generation algorithms,
Graphics primitive operations, Character generation methods, Aliasing and Anti-aliasing.
Polygons: Polygon representation, Inside test methods, Seed filling and Scanline filling algorithms.
Two Dimensional Transformations: Scaling, Translation and Rotation transformations, Rotation
about arbitrary point, Homogenous coordinates, Inverse transformations, Transformation routines,
Reflection and Shearing transformations, Instance transformations.
UNIT-II

(9+3) Segments:

Segment creation algorithm, Segment closing algorithm, Segment deletion and Segment renaming algorithms, Image
transformation.
Windowing And Clipping: Window and View port, Viewing transformation matrix, Implementation of viewing
transformation, Multiple windowing, Cohen-Sutherland Outcode clipping algorithm , Sutherland Hodgman clipping
algorithm, Midpoint subdivision clipping algorithm, Generalized clipping
Three Dimensional Graphics: 3D Primitives, 3D Transformations, Rotation about arbitary axis, 3D Viewing, Viewing
parameters.

UNIT-III

(9+3) Projections:

Parallel projection, Perspective projection, Derivation of parallel projection matrix, Derivation of perspective projection
matrix.
Hidden Surface and Lines Removal Algorithms: Z-Buffer algorithm, Painters algorithm, Wornock algorithm, Franklin
algorithm and Backface removal algorithm.
Animation: Types of animations, Animation languages, Methods of controlling animation.

UNIT-IV

(9+3) Multimedia:

Media and Data streams, Main properties of a Multimedia systems, Traditional data stream characteristics, Asynchronous
transfer mode, Synchronous transfer mode.

Sound/Audio: Basic sound concepts, Computer representation of sound, Audio formats, Music, MIDI concepts, MIDI
devices, MIDI messages, MIDI software, Music and Speech, Speech generation, Speech analysis, Speech transmission.
Multimedia Applications: Media preparation, Media composition, Media integration, Media communication, Media
consumption, Media entertainment.

SUGGESTED TEXT / REFERENCE BOOKS:

1.
2.
3.
4.

Steven Harrington, Computer Graphics 2nd Edition, McGraw-Hill, ISBN No: 0-07-1005472, 1987.
Ralf Steinmetz and Klara Nahrstedt, Multimedia: Computing, Communicatons And Applications, Addison Wesley,
First Indian reprint, ISBN No:81-7808-319-1,2001.
James D.Foley Andries Van Dam Steven K. Fernier, John Hugs, Computer Graphics Principl & Practice, 2 nd Edition,
Pearson Education Asia, ISBN No: 81-7808-038-9, 2002.
Donad Hearn & Pauline Baker, Computer Graphics, 2nd Edition, Pearson Education Asia, ISBN No:81-7808-794-4.

CS413 VLSI SYSTEM DESIGN

Course: IV/IV B.Tech. I Semester
Branch: Common to CSE, IT
External Examination: 3 Hours
Internal Examination: 2 Hours

Theory: 3 Periods/week
Tutorial: 1 Period/week
External Evaluation: 100
Internal Evaluation: 50

UNIT-I
(9+3)
An Overview of VLSI: Complexity and Design, Basic concepts.
Electrical properties of MOS circuits: ID-VD characteristics, Device parameters, VT, GM, figure of
merit WO, pull-up to pull-down ratio, Bipolar, n-MOS, P-MOS, C-MOS, BiCMOS processes,
comparison.
Logic Design with MOSFETS: Ideal switches and Boolean Operations, MOSFETs as switches,
Basic Logic Gates in CMOS, Complex Logic Gates in CMOS, Transmission Gate Circuits. Clocking
and Dataflow control.
UNIT-II
(9+3)
Physical structure of CMOS Integrated Circuits: Integrated Circuit layers, MOSFETs, CMOS
Layers, Designing FET Arrays.
Fabrication of CMOS Integrated circuits: Overview of Silicon Processing, Material Growth and
Deposition, Lithography, The CMOS Process flow, Design rules.
Elements of physical Design: Basic concepts, Layouts of Basic Structures, Cell Concepts, FET sizing
and the unit Transistor, Physical Design of Logic Gates, Design hierarchies, stick diagrams, Design
rules and layout- Lamda-Based Design rules, contact cuts, Double Metal MOS process Rules, CMOS
Lambda-Based Design rules, Layout Diagrams, Sheet Resistance Rs and its concept applied to MOS
Transistors and Inverters, Standard Unit of Capacitance Cg, Capacitance calculations, The Delay unit
T.
UNIT- III
(9+3)
System Specifications of VLSI Systems: Basic Concepts, Structural Gate-Level Modeling, SwitchLevel Modeling, Design Hierarchies, Behavioral and RTL Modeling.
General VLSI System Components: Multiplexers, Binary Decoders, Equality Detectors and
Comparators, Priority Encoder, Shift and Rotation Operations, Latches, D Flip-Flop, Registers, The
Role of synthesis.

Arithmetic Circuits in CMOS VLSI: Bit Adder Circuits, Ripple-carry Adder, Carry Look-Ahead
Adders, Other High-Speed Adders, multipliers.
Memories and Programmable Logic: The Static RAM, SRAM Arrays, Dynamic RAMs, ROM
Arrays, Logic Arrays.
UNIT-IV
(9+3)
System-Level Physical Design: Large-scale physical Design, Interconnect Delay Modeling,
Crosstalk, Interconnect scaling, Floor planning and Routing, Power Distribution and Consumption,
Low-power Design Considerations
Clocking and System Design: Clocked Flip-flops, CMOS Clocking Styles, pipelined Systems, Clock
Generation and Considerations.
Reliability and Testing of VLSI Circuits: General Concepts, CMOS Testing, Test Generation
Methods.
SUGGESTED TEXT/REFERENCE BOOKS:
1. John P.Uyemura, Introduction to VLSI Circuits and Systems, John Wiley & Sons, ISBN No:
9971-51-417-6, 2002.
2. Wayne Wolf, Modern VLSI DESIGN System-On-Chip Design, Third, Pearson Education,
ISBNNo: 81-7808-653-0, 1997.
3. K.Subba Rao, VLSI Design, First Edition, Hi-Tech publishers, 2005.

CS414(1) NEURAL NETWORKS

Course: IV/IV B.Tech. I Semester
Branch: Computer Science & Engineering
External Examination: 3 Hours
Internal Examination: 2 Hours

Theory: 3 Periods/week
External Evaluation: 100
Internal Evaluation: 50

UNIT-I
(9)
Introduction: Human Brain Models of a Neuron Neural Networks Viewed as Directed Graphs Feedback Network
Architectures Knowledge Representation Artificial Intelligence and Neural Networks Historical Notes.
Learning Process: Error-Correction Learning Memory-Based Learning Hebbian Learning Competitive Learning
Boltzmann Learning Credit Assignment Problem Learning with a Teacher Learning without a Teacher Learning
Tasks Memory Adaption Statistical Nature of the Learning Process Statistical Learning Theory Probable
Approximately Correct Model of Learning.
Single Layer Perceptrons: Adaptive Filtering Problem Unconstrained Optimization Techniques Linear Least-Square
Filters Least-Mean-Square Algorithm Learning Curves Learning Rate Annealing Techniques Perceptron
Perceptron Convergence Theorem Relation Between the Perceptron and Bayes Classifier for a Gaussian Environment.
UNIT-II
(9)
Multilayer Perceptrons: Some Preliminaries Back-Propagation Algorithm Summary of the Back-Propogation
Algorithm XOR Problem Heuristics for Making the Back-propagation Algorithm Perform Better Output
Representation and Decision Rule Computer Experiment Feature Detection Back-Propogation and Differentiation
Hessian Matrix Generalization Approximations of Functions Cross-Validation Network Pruning Techniques
Virtues and Limitations of Back-Propogation Learning Accelerated Convergence of Back-Propogation Learning
Supervised Learning Viewed as an Optimization Problem Convolutional Networks.
Radial-Basis Function Networks: Covers Theorem on the Separability of Patterns Interpolation Problem Supervised
Learning as an I11-Posed Hyper surface Reconstruction Problem Regularization Theory Regularization Networks

Generalized Radial-Basis Function Networks XOR Problem(Revisited) Estimation of the Regularization Parameter
Approximation Properties of RBF Networks Comparison of RBF Networks and Multilayer Perceptrons Kernel
Regression and Its Relation to RBF Networks Learning Strategies Computer Experiment.
UNIT-III
(9)
Support Vector Machines: Optimal Hyper plane for Linearly Separable Patterns Optimal Hyperplane for Nonseperable
Patterns How to Build a Support Vector Machine for Pattern Recognition Example: XOR Problem (Revisited)
Computer Experiment e-Insensitive Loss Function Support Vector Machines for Nonlinear Regression.
Committee Machines: Ensemble Averaging Computer Experiment I Boosting Computer Experiment II
Associative Gaussian Mixture Model Hierarchical Mixture of Experts Model Model Selection Using a Standard
Decision Tree A Priori and a Posteriori Probabilities Maximum Likelihood Estimation Learning Strategies for the
HME Model EM Algorithm Application of the Em Algorithm to the HME Model.
Principal Components Analysis: Some Intuitive Principles of Self-Organization Principal Components Analysis
Hebbian-Based Maximum Eigenfilter Hebbian-Based Principal Components Analysis Computer Experiment: Image
Coding Adaptive Principal Components Analysis Using Lateral Inhibition Two Classes of PCA Algorithms Batch
and Adaptive Methods of Computation Kernel-Based Principal Components Analysis.
UNIT-IV
(9)
Self-Organizing Maps: Introduction Two Basics Feature-Mapping Models Self-Organizing Map Summary of the
SOM Algorithm Properties of the Feature Map Computer Simulations Learning Vector Quantization Computer
Experiment: Adaptive Pattern Classification Hierarchical Vector Quantization Contextual Maps.
Information-Theoretic Models: Entropy Maximum Entropy Principle Mutual Information Kullback-Leibler
Divergence Mutual Information as an Objective Function To Be Optimized Maximum Mutual Information Principle
Infomax and Redundancy Reduction Spatially Coherent Features Spatially Incoherant Features Independent
Components Analysis Computer Experiment Maximum Likelihood Estimation Maximum Entropy Method.
SUGGESTED TEXT / REFERENCE BOOKS:
1. Simon Haykin,Neural Networks, Second Edition, Pearson Education, ISBN 81-7808-300-0, 2001.
2. B.Yegnanarayana, Artificial Neural Networks, Pentice-Hall India, ISBN-81-203-1253-8, 2003.
3. Mohammad H.Hassoun, Fundamentals of Artificial Neural Networks, Pentice-Hall India,ISBN-81-203-13569,1999.

CS414(3) EMBEDDED SYSTEMS

Course: IV/IV B.Tech. I Semester
Branch: Computer Science& Engineering
External Examination: 3 Hours
Internal Examination: 2 Hours

Theory: 3 Periods/week
External Evaluation: 100
Internal Evaluation: 50

UNIT I
(9)
Introduction to Embedded Systems: An Overview of Embedded Systems, Categories of Embedded
Systems, Applications, Hardware Architecture, Embedded Software, Present trends in Embedded
Systems, Embedded System Design Life Cycle.
Processor Selection: Structural Units in a Processor, Role of Processor Selection in Embedded
System, Microprocessors, Microcontrollers, and Digital Signal Processors in Embedded Systems, New
trends in Processor Technology.
Memory Devices: Memory Devices, Memory Organization, Memory Selection for an Embedded
System, Allocation of Memory to Program Segments and Blocks and Memory Map of a System,
Interfacing Processor, Memories and I/O Devices.

UNIT II
(9)
Devices and Buses for Device Networks: I/O Devices, Timer and Counting Devices, Serial
Communication Using the I2C, Component Area Network Buses and Advanced I/O Buses between the
Networked Multiple Devices, Host System or Computer Parallel Communication between the
Networked I/O Multiple Devices Using the Industry Standard Architecture Buses, Peripheral
Component Interconnect/Interface Buses, PCI Extended Buses and Advanced Buses.
Device Drivers and Interrupts Servicing Mechanism: Device Drivers, Parallel Port Device Drivers
in a System, Serial Port Device Drivers in a System, Interrupt Servicing (Handling) Mechanism,
Context and the Periods for Context-Switching, Deadline and Interrupt Latency.
UNIT III
(9)
Program Modeling Concepts in Single and Multiprocessor Systems Software-Development
Process: Modeling Processes for Software Analysis Before Software Implementation, Programming
Models for Event Controlled or Response Time Constrained real Time Programs, Modeling of
Multiprocessor Systems.
Software Engineering Practices in the Embedded Software Development Process: Software
Development Life Cycle and its Models, Software Analysis, Software Design, Software
Implementation, Software Testing, Validating and Debugging.
UNIT IV
(9)
Real Time Operating Systems: Operating System Services, I/O Subsystems, Network Operating
Systems, Real-Time and Embedded System Operating Systems, Interrupt Routines in RTOS
Environment: Handling of Interrupt Source Call by the RTOS, RTOS Task Scheduling Models.
Hardware-Software Co-Design in an Embedded System: Embedded System Project management,
Embedded System Design and Co-design Issues in System Development Process, Design Cycle in the
Development Phase for an Embedded System, Uses of Target System or its Emulator and In-Circuit
Emulator (ICE), Issues in Embedded System Design.

SUGGESTED TEXT / REFERENCE BOOKS:

1. Raj Kamal, Embedded Systems, 1st Edition, Tata McGraw Hill,
ISBN No:007-123735-6, 2003.
2. Frank Vahid and Tony Givargis, Embedded System Design: A Unified Hardware/Software
Introduction, 2nd Edition, John Wiley& Sons,
ISBN No: 0471386782, 2002.
3. David E.Simon, An Embedded Software Primer, First Edition, Pearson Education,
ISBN No.020161569X, 1999.
4. Lewis, Fundamentals of Embedded Software: Where C& Assembly Meet, Fourth Indian
Reprint, Pearson Education, ISBN No. 81-7808-604-2, 2003.
5. Muhammad Ali Mazidi and Janice Gillispie mazidi, The 8051 Microcontrollers and
Embedded Systems, Eleventh Indian Reprint, Pearson Education,
ISBN No: 81-7808-574-7, 2005.

CS415 COMPUTER GRAPHICS AND MULTIMEDIA LABORATORY

Course: IV/IV B.Tech. I Semester
Branch: Computer Science & Engineering
External Examination: 3 Hours
Internal Examination: 2 Hours

Laboratory: 3 Periods/ week

External Evaluation: 50
Internal Evaluation: 25

LIST OF EXPERIMENTS
1. Creation of images using graphics functions .
(a) Creation of vehicle image with movement.
(b) Creation of any simple game.
(c) Creation of weight lifter image.
2. Implementation of DDA line drawing algorithm.
(a) Creation of images using DDA algorithm.
3. Implementation of Bresenham line drawing algorithm
(a) Creation of images using Bresenham algorithm.
4. Implementation of polygon creation algorithm.
5. Implementation of Polygon seed filling algorithm.
6. Implementation of polygon boundary filling algorithm.
7. Implementation of polygon scan line filling algorithm
8. Implementation of display file structure using arrays and linked lists
9. Creation of polygons with primitive operations using display file.
10. Implementation of scaling transformation for line.
11. Implementation of scaling transformation for polygons.
12. Implementation of rotation with respect arbitary point.(lines and polygons).
13. Implementation of translation transformation (lines and polygons).
14. Implementation of rotation with respect to arbitary point(lines and polygons).
15. Implementation of shearing and transformation.
16. Implementation of reflection transformation.
17. Implementation of viewing transformation .
18. Implementation of Suther Land outcode algorithm .
19. Implementation of mid point sub division clipping algorithm.
20. Implementation of Suther Land Hodgman algorithm.
21. Multimedia applications
(a) Text Animation
(b) Clip Art
(c) Animation - Bouncing ball
(d) Digital Sound

CS416 GUI LABORATORY

Course: IV/IV B.Tech. I Semester
Branch: Computer Science & Engineering
External Examination: 3 Hours
Internal Examination: 2 Hours

Laboratory: 3 Periods/week
External Evaluation: 50
Internal Evaluation: 25

LIST OF EXPERIMENTS IN VISUAL C++

1. Simple program to display message.
2. Program to print mouse coordinates.
3. Program to print message according to mouse events.
4. Simple scribble pad.
5. Display current time.
6. Program to display mouse events.
7. Program to convert the temperature from Centigrade to Fahrenheit using Scrollbars.
8. Program to draw shapes and colours.
9. Scribble pad with menu options.
10. Changing colour of rectangle.
11. Arithmetic Operations using menus.
12. Program for Serialization.
13. Setting Colors at runtime Using RGB Scrollbars.
14. Change style of font.
15. ODBC Connectivity.
16. Displaying Time using Digital clock.
LIST OF EXPERIMENTS IN VISUAL BASIC
1. Changing font in text field.
2. Program to remove duplicate items from List box control.
3. Program to modify the text in the textbox with different sizes and fonts using option
buttons and frames.
4. Program to find the roots of Quadratic equation.
5. Program to calculate the simple Interest.
6. Program to change color of form using scrollbars.
7. Program to copy the contents of list box to another one.
8. Program for Scientific calculator.
9. Program to rotate an arrow 90 degrees every second when you press start button and stops when
you press a stop button.
10. Program to implement scribble pad.
11. Program to find the sum of two matrices.
12. Program to print different graphical shapes.
13. Program to illustrate OLE Automation using menus by using menu editor.
14. Program to illustrate Multiple Document Interface with the help of Toolbar Control.
15. Program to illustrate MS flex grid control and data control.
16. Program to add, delete, and modify oracle records using ADO.
17. Program to add, delete, and modify oracle records using RDO.
18. Program to add, delete, and modify oracle records using Sequential files.
19. Program to add, delete, and modify oracle records using Random files.

CS422(3) WIRELESS COMMUNICATIONS

Course: IV/IV B.Tech II Semester
Branch: Computer Science & Engineering
External Examination: 3 Hours
Internal Examination: 2 Hours

Theory: 3 Periods/week
External Evaluation: 100
Internal Evaluation: 50

UNIT-I
(9)
Introduction: The cellular revolution, Global Cellular Network, Broadband, The Trouble with
Wireless.
Antennas and Propagation: Antennas, Propagation Modes, Line of Sight Transmission, Fading in
the Mobile Environment.
Coding and Error Control: Error Detection, Block Error Correction Codes, Convolutional Codes,
Automatic Repeat Request.
UNIT-I I

(9)

Wireless Networking
Satellite Communication:Satellite Parameters and Configurations,Capacity Allocation-Frequency
Division,Time Division.
Cellular Wireless Networks: Principles,First Generation Analog ,Second Generation
TDMA,CDMA,Third Generation Systems.
UNIT-III
(9)
Cordless Systems and Wireless Local Loop:Cordless Systems,Wireless Local Loop,IEEE 802.16
Fixed BroadBand Wireless Access Standard.
Mobile IP and Wireless Access Protocol:Mobile IP and Wireless Application Protocol.
Wireless LAN Technology:Infrared LANs, Spread Spectrum LANs,Narrow Band Microwave LANs.
UNIT-IV
(9)
IEEE802.11Wireless LAN Standard:IEEE802 Protocol Architechture,IEEE 802.11-Architechture &
Services,Medium Access Control,Physical Layer.
Blue Tooth:Radio Specification ,Baseband Specification,Link Manager Specification,Logical Link
Control and Adaptation Protocol.
.
SUGGESTED TEXT / REFERENCE BOOKS:
1. William Stallings, Wireless Communications and Networks, Pearson Education, 2 nd
Edition, ISBN 81-7808-560-7,2002
2. Theodore S. Reppaport Wireless Communications,2nd Edition ,Pearson Education,
ISBN 81-7808-648-4,2002
3. John Schiller, Mobile Communications,Pearson Education ,2 nd Edition,ISBN:81-297-0350-5,2004

CS420 NETWORK PROGRAMMING

Course: IV/IV B.Tech. II Semester
Branch: Computer Science & Engineering
External Examination: 3 Hours
Internal Examination: 2 Hours

Theory: 3 Periods/week
Tutorial: 1 Period/week
External Evaluation: 100
Internal Evaluation: 50

UNIT I
(9+3)
Introduction: Process, File Descriptor, File, Access Permissions, input-output System Calls, Signals,
Process Control System Calls, File Sharing.
Inter Process Communication: Pipes, Streams and Messages, Name Spaces, Message Queues,
Semaphores, Shared Memory.
Transport Layer: TCP Connection Establishment and Termination, TIME_WAIT State, Port
Numbers, Concurrent Servers, Buffer Sizes and Limitations. Standard Internet Services.
Sockets: Address Structures, Value-Result Arguments, Byte Ordering, Byte Manipulation and
inet_aton, inet_addr and inet_ntoa Functions. inet_pton, inet_ntop, sock_ntop and Related Functions.
readn, written and readline Functions. isfdtype Function.
UNIT II
(9+3)
Elementary TCP Sockets: socket Function, connect Function, bind Function, listen Function, accept
Function, fork and exec Functions. Concurrent Servers. close Function, getsockname and getpeername
Functions. TCP Client-Server Example, Normal Startup, Termination, Handling SIGCHLD Signals,
Connection Abort, Termination of Server Processes, Crashing & Rebooting, Shutdown of Server Host.
I/O Multiplexing: I/O Modes, select Function, Batch Input, pselect and poll Functions.
Socket Options: getsockopt, setsockopt Functions, Socket States, Generic Socket Options, Ipv6
Socket Options, TCP Socket Options, fcntl Function.
Elementary UDP Sockets: recvfrom, sendto Functions and their implementation, Lost Datagrams,
connect Function with UDP, Lack of Flow Control with UDP.
UNIT III
(9+3)
Daemon Processes and inetd Superserver: syslogd Daemon, syslog and daemon_ init functions,
inetd Daemon, daemon_inetd Function.
Advanced I/O Functions: Socket Timeouts, recv, send, readv, writev, recvmsg and sendmsg
Functions.
Unix Domain Protocols: Socket Address Structure, socketpair function, socket functions, Unix
Domain Stream and Datagram Client, Server, Passing Descriptors, Receiving Sender Credentials.
Nonblocking I/O: Non Blocking Reads and Writes, Daytime Client and Web Client.
I/O Control (ioctl) Operations: ioctl Function, Socket Operations, File Operations, Interface
Configuration, Interface, ARP Cache Operations and Routing Table Operations.
UNIT IV
(9+3)
Broadcasting: Broadcast Addresses, Unicast versus Broadcast, Race Conditions.
Multicasting: Multicast Addresses, Multicasting versus Broadcasting on a LAN, Multicast socket
options, SNTP (Simple Network Time Protocol).
Threads: Creation and Termination of Threads, Thread Specific Data, Web Client and Simultaneous
Connections, Mutual Exclusion (Mutex), Conditional Variables.
IP Options: IPv4 Source route Options, IPv6 Extension Headers, Hop-by-Hop and Destination,
Routing and Sticky Options.

Client-Server Design Alternatives: TCP Client Alternatives, Iterative Server, Preforked Server,
Concurrent Server, Prethreaded Server.

SUGGESTED TEXT / REFERENCE BOOKS:

1. W.Richard Stevens, Unix Network Programming, Prentice-Hall, Inc Eastern Economy Edition,
ISBN -81-203-0749-6,2001
2. W.Richard Stevens, UNIX NETWORK PROGRAMMING Networking APIs: Sockets and XTI,
Volume 1, Second edition, Pearson Education, ISBN-81-203 2061-1,2002

CS421(2) SIMULATION AND MODELING

Course: IV/IV B.Tech. II Semester
Branch: Computer Science & Engineering
External Examination: 3 Hours
Internal Examination: 2 Hours

Theory: 3 Periods/week
External Evaluation:100
Internal Evaluation: 50

UNITI
(9)
System Models: The Concepts of a System System Environment Stochastic Activities Continuous and Discrete
Systems Steps in a Simulation Study Areas of Applications - System Modeling Types of Models Static and
Dynamic Physical Models Static and Dynamic Mathematical Models - Principles used in Modeling.
System Studies: Subsystems A Corporate Model Environment Segment Production Segment Management
Segment The Full Corporate Model Types of System Study System Analysis System Design System Postulation.
System Simulation: The Technique of Simulation The Monte Carlo Method Comparison of Simulation and Analytical
Methods Experimental Nature of Simulation Types of System Simulation Numerical Computation Technique for
Continuous and Discrete Models Distributed Lag Models Cobweb Models Progress of a Simulation Study
Simulation Examples.
UNIT-II
(9)
Continuous System Simulation: Continuous System Models Differential Equations Analog Computers Analog
Methods Hybrid Computers Digital Analog Simulators Continuous System Simulation Languages (CSSLs) CSMP
III Hybrid Simulation Feedback Systems Simulation of an Autopilot Interactive Systems Real Time Simulation.
Discrete System Simulation: Discrete Events Representation of Time Generation of Arrival Patterns Simulation of a
Telephone System Delayed Calls Simulation Programming Tasks Gathering Statistics Counters and summary
Statistics Measuring Utilization and Occupancy Recording Distributions and Transit Times Discrete Simulation
Languages.
System Dynamics: Concept Exponential Growth and Decay Models Modified Exponential Growth Models Logistic
Curves Generalization of Growth Models System Dynamics Diagrams Multi Segment Models Representation of
Time Delays Feedback in Socio-Economic Systems.
UNIT-III
(9)
Probability Concepts in Simulation: Discrete and Continuous Probability functions Measures Numerical Evaluation
of Continuous Probability Functions Continuous Uniformly Distributed Random Numbers Computer Generation of
Random Numbers A uniform Random Number Generator Generating Discrete Distributions Non-Uniform
Continuous Distributed Random Numbers The Rejection Method.
Arrival Patterns and Service Times: Congestion in Systems Arrival Patterns Poisson Arrival Patterns The
Exponential Distribution The Coefficient of Variation The Erlang Distribution The Hyper-Exponential Distribution
Service Times The Normal Distribution Queuing Disciplines Measures of Queues Mathematical Solutions of

Queuing Problems Utilization as a Design Factor Grade of Service.

UNIT-IV
(9)
GPSS and SIMSCRIPT: Introduction to GPSS - GPSS Examples- Introduction to SIMSCRIPT Management of Sets in
SIMSCRIPT.
Simulation Programming Techniques: Entity Types List Processing Data Structures in GPSS & SIMSCRIPT
Implementation of Activities Simultaneous and Conditional Events Event Scanning Execution of Simulation
Algorithms in GPSS and SIMSCRIPT.
Case Studies: Simulation of Inventory Problem, Manufacturing System, Hospital System.
SUGGESTED TEXT / REFERENCE BOOKS:
6. Geoffrey Gordon, System Simulation, Prentice Hall of India, 2nd Edition, ISBN: 81 203 0140 - 0, 2005.
7. Jerry Banks and John S.Carson II, Barry L.Nelson, David M.Nicol, Discrete Event System Simulation, Third
Edition, Pearson Education, ISBN: 81 7808 505 - 4, 2004.
8. Narsingh Deo, System Simulation with Digital Computer, Prentice Hall of India, ISBN: 81 203 0028 9, 2002.
9. Bernard P.Zeigler, Herbert Praehofer, Tag Gon Kim, Theory of Modeling and Simulation, 2nd Edition, Harcourt
India Private Limited, ISBN: 81 7867 043 - 7, 2000.
10. Francis Neelamkavil, Computer Simulation and Modeling, John Wiley & Sons, ISBN: 0 471 91129 - 1, 1996.
11. Averill Law and David M. Kelton, Simulation Modeling and Analysis, McGraw Hill International Edition, ISBN: 0
07 116537 1, 2004.

CS421(3) REAL TIME SYSTEMS

Course: IV/IV B.Tech II Semester
Branch: Computer Science & Engineering
External Examination:3 Hours
Internal Examination: 2 Hours

Theory: 3 Periods/week
External Evaluation: 100
Internal Evaluation: 50

UNIT-I
(9)
Typical Real-Time Application: Digital control, high-level controls, signal processing.
Hard Versus Soft Real-Time Systems: Jobs and processors, release times, deadlines, and timing
constraints, hard and soft timing constraints, hard real-time systems, soft real-time systems.
A Reference Model Of Real-Time Systems: Processor and resources, temporal parameters of realtime workload, periodic task model, precedence constraints and data dependency, other types of
dependencies, functional parameters, resources parameters of jobs and parameters of resources,
scheduling hierarchy.
UNIT-II
(9)
Commonly Used Approaches To Real-Time Scheduling: Clock driven approach, weighted roundrobin approach, priority driven approach, dynamic versus static systems, effective release times and
deadlines, optimality of the EDF and LST algorithms, non-optimality of the EDF and the LST
algorithms(Theorems and Corollaries are not included), challenges in validating timing constraints
in priority-driven systems, Off-line Vs On-line scheduling.

Clock-Driven Scheduling: Notations and assumptions, static timer-driven scheduler, general structure
of cyclic schedules, cyclic executives, improving the average response time of periodic jobs,
scheduling sporadic jobs, practical considerations and generalizations.
Priority driven scheduling of periodic task: static assumption, fixed-priority versus
dynamic priority algorithms, maximum schedulable utilization, optimality of the RM and DM
algorithms, a schedulability test for fixed-priority tasks with short response times, schedulability test
for priority tasks with arbitrary response times (Theorems and Corollaries are not included) .
UNIT-III
(9)
Scheduling A Periodic And Sporadic Jobs In Priority-Driven System : Assumptions and
approaches. Algorithms for Scheduling of A periodic jobs: Bandwidth-Preserving Algorithms:Deferrable Servers, Sporadic Servers, Constant Utilization and Total Bandwidth(Theorems and
Corollaries are not included) .Scheduling of Sporadic Jobs: A Simple Acceptance Test in DeadlineDriven Systems. Real-Time performance for jobs with soft timing constraints.
Resources and Resource Access Control: Assumptions on resources and their usage, effects of
resource contention and resource access control, non-preemptive critical sections, basic priorityceiling protocol, preemptive-ceiling protocol, controlling access to multiple-unit resources.
UNIT-IV
(9)
Real-time Communication: Model of Real-Time Communication: Architectural Overview,
Packets, Network Bandwidth and Physical size, Real-Time traffic models, performance
Objectives and Constraints, Real-Time Connections and Service Disciplines. Priority-Based Service
Disciplines for Switched Networks: Weighted Fair-Queuing Discipline, Rate-proportional Server
Model and Algorithm, Frame-Based Weighted Fair Queuing.
Weighted Round-Robin Service Disciplines: Greedy WRR Discipline, Time Driven WRR
Discipline, Budgeted Weighted Round-Robin Algorithm. Internet and Resource Reservation
Protocols, Real-Time Protocol.
Note: Proofs of theorems not to be considered.
SUGGESTED TEXT / REFERENCE BOOKS:
1. Jane W.S.LIU, Real-Time Systems, Pearson Education Asia, ISBN NO. 81-7808-463-5,2003
2. C.M.Krishna and Kang G. Shin,Real-Time Systems,McGraw-Hill International Edition,ISBN 007-114243-6,1997

CS422(1) DATA MINING AND DATA WAREHOUSING

Course: IV/IV B.Tech. II Semester
Branch: Computer Science & Engineering
External Examination: 3 Hours
Internal Examination: 2 Hours

Theory: 3 Periods/week
External Evaluation: 100
Internal Evaluation: 50

UNIT I

(9)

Data warehouse: What is Data Warehouse, Importance, Comparison with Relational Database System, Basics:
Partitioning Strategy, Aggregation, Metadata, fact and dimensional tables, star snowflake and fact constellation schemas,
data marts.
Architecture: Process Architecture, Design Architecture, three tier architecture, Multidimensional Model, Implementing
OLAP Servers.

Data warehouse Design: Developing a data warehouse design consideration, crucial decisions in
designing a data warehouse, technological considerations Data warehousing for the Government of
Tamil Nadu, Data warehousing for the Government of Andhra Pradesh, Data warehousing for the
Ministry of Commerce.
UNIT II
(9)
Data Preprocessing: Cleaning, integration, Transformation & reduction.
Data Mining: What is Data Mining, Functionalities, Classification: Major Issues, Priorities, System Architecture, and
DMQL.
Descriptive Data Mining: Concept Description Generalized Characterization, Summarized Characterization, Analytical
Characterization, Class Comparison, Descriptive Statistical Measures.
Associative Rule Mining Basic Concepts, Single and Multi Dimensional Boolean and Multilevel association rules for
transaction databases, Correlation Analysis, Constrained based associative rules.

UNIT III

(9)

UNIT IV

(9)

Predictive Data Mining: What is Predictive Data Mining, Classification Preparing Data, criteria for comparing
algorithms,
Classification: Issues regarding Classification, classification by decision tree, Bayesian Classification, Classification by
back propagation, Classification based on concepts from Association Rule Mining, k-nearest neighbor Classifiers, Genetic
Algorithms, Fuzzy Set Approaches, Regression Linear and Multiple Regression, Nonlinear Regression, classifier
accuracy.

Cluster Analysis: Cluster analysis, Types of data in Cluster Analysis, partitioning methods, hierarchical methods, density
based methods, grid based methods, model based clustering methods.
Mining complex types of data: mining spatial databases, mining multimedia databases, mining text databases, mining
web based databases.

SUGGESTED TEXT / REFERENCE BOOKS:

1. Jiawei Han, Micheline Kambler, Data Mining Concepts and Techniques Morgan Kaufmann Publishers, ISBN-817867-023-2, 2002.
2. Sam Anahory, Dennis Murray, Data Warehousing in the real world, Low Price Edition, Pearson Education, ISBN81-7808-387-6, 2003.
3. C.S.R. Prabhu, Data Warehousing Concepts, Techniques, Products and Applications, Second Edition, PrenticeHall of India, ISBN 81-203-2068-9, 2002.

CS422(2) DIGITAL IMAGE PROCESSING

Course: IV/IV B.Tech. II Semester
Branch: Computer Science & Engineering
External Examination: 3 hours
Internal Examination: 2 hours

Lectures: 3 Periods/week
External Evaluation: 100
Internal Evaluation: 50

UNIT-I
(9)
Introduction: Origin of Digital image processing, Fundamental steps in Digital Image processing, Components of an
Image Processing System.
Digital Image Fundamentals: Elements of Visual Perception, Image Sampling and Quantization: Basic concepts in
sampling and quantization, Representing Digital Images Spatial and Gray-level Resolution .Aliasing and Moir Patterns.
Zooming and Shrinking Digital Images. Some Basic Relationship between Pixels, Liner and Nonlinear Operations.
UNIT-II
(9)
Image Transforms: 2D Fourier transforms, 2D- DFT, Fast fourierTransform, Walsh, Hadmard, Discrete cosine.
Image Enhancement : Image Enhancement in the Spatial Domain:-Some Basic Gray level
Transformations: Image Negatives, log Transformations, Power-Law Transformations, Piecewise-Liner Transformation
Functions. Histogram Processing: Histogram Equalization,
Histogram Matching, Local Enhancement, Use of Histogram Statistics for Image Enhancement. Enhancement Using
Arithmetic / Logical Operations: Image Subtraction, Image Averaging.
UNIT-III
(9)
Image Enhancement in the Frequency Domain: Introduction to the Furier transform and frequency domain, Smoothing
Frequency Domain Filters, Sharpening Frequency Domain Filters.
Image Restoration: A model of Image Degradation/Restoration Process, Noise Models Restoration in the Presence of
noise only Spatial filtering.
Image compression and Segmentation: Fundamentals, Image compression models, Elements of information theory, Error
free compression, Lossy compression, Detection of discontinuities, Edge linking and boundary detection, Thresholding,
Region oriented segmentation.
UNIT-IV
(9)
Image Representation and Description: Representation: Chain codes, Polygonal approximations, Signatures, Boundary
Segments, Skeletons. Boundary Descriptors: Simple Descriptors, Shape numbers, Fourier Descriptors, Statistical moments.
SUGGESTED TEXT/REFERENCE BOOKS:
1. Rafael C.Gonzalez and Richard E.Woods,Digital Image Processing, Pearson Education Asia, ISBN No.81-7808629-8, 2002.
2. Anil K. Jain, Fundamentals of Image Processing, Prentice-Hall of India, ISBN No.81-203-0929-4, 1995.
3. B.Chanda & D.Dutta Majunder, Digital Image Processing & Analysis, Prentice Hall India Pvt Ltd, ISBN No.81203-1618-5,2002

CS423 NETWORK PROGRAMMING LABORATORY

Course: IV/IV B.Tech. II Semester
Branch: Computer Science & Engineering
External Examination: 3 Hours
Internal Examination: 2 Hours

Laboratory: 3 Periods/week
External Evaluation: 50
Internal Evaluation: 25

1. Programs to Implement fork, exec, pipe (System Calls) Functions using write, read, open and
close Functions.
2. Programs to Implementing Inter Process Communication between a Client and Server using
(a) Pipes. (b) Fifos.
3. Implement Client Server Programs using
(a) Message Queues
(b) Shared Memory.
4. Implement Client and Server Programs using sockets.
(a) TCP Daytime Client Program using in-built Daytime Server Program.
(b) TCP Daytime Server Program.
5. Implement TCP Echo Client and Server Programs.
6. Implement User Datagram Protocol for
(a) Daytime Client Program using in-built Daytime Server Program.
(b) Daytime Server Program.
7. Implement UDP Echo Client and Server Programs.
8. Implement File Transfer from Server to Client, the Client passes File name.
9. Implement of Unix Domain Protocol
(a) Daytime Client and Server.
(b) Echo Server and Client Programs.
(c) Program to implement socketpair system call.
10. Develop a Program to Read and Display different TCP Socket Options.
11. Implement Concurrent Server using select Function for Server of TCP to handle TCP and UDP
Clients.
12. Program to Implement gethostbyname, gethostbyaddr Functions.
13. Program for Sending and Receiving User Credentials.
14. Implement recv, send, readv, writev, recvmsg, sendmsg Functions.
15. Implementation of Non-Blocking connect and accept.
16. Implementation of Signal Driven I/O using sigio Function.
17. Implementation of Server Programs of Different Architectures
(a) TCP Echo Server Program using Threads.
(b) TCP Concurrent Server, One Child per Client.
(c) TCP Preforked server, No Locking around accept.
(d) TCP Concurrent server, One thread per client.

CS424 OBJECT ORIENTED ANALYSIS AND DESIGN LABORATORY

Course: IV/IV B.Tech. II Semester
Branch: Computer Science & Engineering
External Examination: 3 Hours
Internal Examination: 2 Hours

Laboratory: 3 Periods/week
External Evaluation: 50
Internal Evaluation: 25

LIST OF EXPERIMENTS
1. Forward Engineer Class diagrams for the following.
(a) File System
(b) Spread Sheet
(c) Window Manager
(d) School Information System
2. Reverse Engineer
(a) Class student with attributes name, roll_no and operation study()
(b) Relation ship Aggregation
(c) Relationship Generalization
(d) Interface.
3. Construct Use case Diagrams for the following.
(a) Diagram Editor
(b) Library Information System
(c) Banking System
(d) Cab Dispatching System.
4. Construct Sequence Diagrams for the following.
(a) Mobile Phone
(b) Use case student register for a course
(c) Diagram Editor.
5. Construct Collabaration Diagrams for the following.
(a) Use case Librarian issues books to student.
(b) Mobile Phone
(c) Diagram Editor.
6. Construct Activity Diagrams for the following.
(a) ATM Transaction
(b) Ticket Machine
(c) Sales Order Processing.
7. Construct State Chart Diagrams for the following.
(a) Account
(b) CD Player
(c) ATM machine.
8. Reverse Engineering the following Class Diagrams Using JAVA.
(a) School Information System
(b) File System
(c) Window Manager
(d) Library Information System
9. Case Study 1: ATM System
10. Case Study 2: Library Information System
11. Case Study 3: Railway reservation System
12. Case Study 4: Elevator System.