R13B TechCSE PDF
R13B TechCSE PDF
R13B TechCSE PDF
COURSE STRUCTURE
AND
DETAILED SYLLABUS
COMPUTER SCIENCE
AND
ENGINEERING
For
B.TECH. FOUR YEAR DEGREE COURSE
(Applicable for the batches admitted from 2013-14)
(I - IV Years Syllabus)
2 The students, who fail to fulfill all the academic requirements for the
award of the degree within ten academic years from the year of their
admission, shall forfeit their seats in B. Tech. course.
3 Courses of study
The following courses of study are offered at present as specializations
for the B. Tech. Course:
Branch Code Branch
01 Civil Engineering
02 Electrical and Electronics Engineering
03 Mechanical Engineering
04 Electronics and Communication Engineering
05 Computer Science and Engineering
08 Chemical Engineering
10 Electronics and Instrumentation Engineering
4 COMPUTER SCIENCE AND ENGINEERING 2013-14
11 Bio-Medical Engineering
12 Information Technology
14 Mechanical Engineering (Mechatronics)
17 Electronics and Telematics Engineering
18 Metallurgy and Material Technology
19 Electronics and Computer Engineering
20 Mechanical Engineering (Production)
21 Aeronautical Engineering
22 Instrumentation and Control Engineering
23 Biotechnology
24 Automobile Engineering
25 Mining Engineering
26 Mining Machinery
27 Petroleum Engineering
28 Civil and Environmental Engineering
29 Mechanical Engineering (Nano Technology)
30 Agricultural Engineering
31 Computer Science & Technology
4 Credits
I Year Semester
Periods / Week Credits Periods / Week Credits
Theory 03+1/03 06 04 04
02 04 — —
Practical 03 04 03 02
Drawing 02+03 06 03 02
06 04
Mini Project — — — 02
Comprehensive
Viva Voce — — — 02
Seminar — — 6 02
Project — -- 15 10
5 COMPUTER SCIENCE AND ENGINEERING 2013-14
clear the subjects in the given two chances, they shall be given
equivalent subjects as per the revised regulations which they have
to pass in order to obtain the required number of credits.
14.3 In case of transferred students from other Universities, the credits
shall be transferred to JNTUH as per the academic regulations and
course structure of the JNTUH.
15. General
15.1 Wherever the words “he”, “him”, “his”, occur in the regulations, they
include “she”, “her”, “hers”.
15.2 The academic regulation should be read as a whole for the purpose
of any interpretation.
15.3 In case of any doubt or ambiguity in the interpretation of the above
rules, the decision of the Vice-Chancellor is final.
15.4 The University may change or amend the academic regulations or
syllabi at any time and the changes or amendments made shall be
applicable to all the students with effect from the dates notified by the
University.
15.5 The students seeking transfer to colleges affiliated to JNTUH from
various other Universities/Institutions, have to pass the failed subjects
which are equivalent to the subjects of JNTUH, and also pass the
subjects of JNTUH which the candidates have not studied at the earlier
Institution on their own without the right to sessional marks. Further,
though the students have passed some of the subjects at the earlier
institutions, if the same subjects are prescribed in different semesters
of JNTUH, the candidates have to study those subjects in JNTUH in
spite of the fact that those subjects are repeated.
***
11 COMPUTER SCIENCE AND ENGINEERING 2013-14
MALPRACTICES RULES
DISCIPLINARY ACTION FOR / IMPROPER CONDUCT IN EXAMINATIONS
Nature of Malpractices/ Punishment
Improper conduct
If the candidate:
1. (a) Possesses or keeps accessible Expulsion from the
in examination hall, any paper, examination hall and
note book, programmable cancellation of the
calculators, Cell phones, pager, performance in that subject
palm computers or any other only.
form of material concerned with
or related to the subject of the
examination (theory or practical)
in which he is appearing but has
not made use of (material shall
include any marks on the body
of the candidate which can be
used as an aid in the subject of
the examination)
(b) Gives assistance or guidance or Expulsion from the examination
receives it from any other hall and cancellation of the
candidate orally or by any other performance in that subject
body language methods or only of all the candidates
communicates through cell involved. In case of an outsider,
phones with any candidate or he will be handed over to the
persons in or outside the exam police and a case is registered
hall in respect of any matter. against him.
13 COMPUTER SCIENCE AND ENGINEERING 2013-14
II YEAR I SEMESTER
Code Subject L T/P/D C
A30008 Probability and Statistics 4 - 4
A30504 Mathematical Foundations of Computer Science 4 - 4
A30502 Data Structures 4 - 4
A30401 Digital Logic Design 4 - 4
A30404 Electronic Devices and Circuits 4 - 4
A30202 Basic Electrical Engineering 4 - 4
A30282 Electrical and Electronics Lab - 3 2
A30582 Data Structures Lab - 3 2
Total 24 6 28
19 COMPUTER SCIENCE AND ENGINEERING 2013-14
II YEAR II SEMESTER
Code Subject L T/P/D C
A40506 Computer Organization 4 - 4
A40507 Database Management Systems 4 - 4
A40503 Java Programming 4 - 4
A40009 Environmental studies 4 - 4
A40509 Formal Languages and Automata Theory 4 - 4
A40508 Design and Analysis of Algorithms 4 - 4
A40585 Java Programming Lab - 3 2
A40584 Database Management Systems Lab - 3 2
Total 24 6 28
III YEAR I SEMESTER
Code Subject L T/P/D C
A50511 Principles of Programming Languages 4 - 4
OPEN ELECTIVE 4 - 4
A50018 Human Values and Professional Ethics
A50017 Intellectual Property Rights
A50117 Disaster Management
A50518 Software Engineering 4 - 4
A50514 Compiler Design 4 - 4
A50510 Operating Systems 4 - 4
A50515 Computer Networks 4 - 4
A50589 Operating Systems Lab - 3 2
A50587 Compiler Design Lab - 3 2
Total 24 6 28
III YEAR II SEMESTER
Code Subject L T/P/D C
A60521 Distributed Systems 4 - 4
A60522 Information Security 4 - 4
A60524 Object Oriented Analysis and Design 4 - 4
A60525 Software Testing Methodologies 4 - 4
A60010 Managerial Economics and Financial Analysis 4 - 4
A60512 Web Technologies 4 - 4
A60591 Case Tools and Web Technologies Lab - 3 2
A60086 Advanced Communication Skills Lab - 3 2
Total 24 6 28
20 COMPUTER SCIENCE AND ENGINEERING 2013-14
IV YEAR I SEMESTER
Code Subject L T/P/D C
A70511 Linux Programming 4 - 4
A70530 Design Patterns 4 - 4
A70520 Data Warehousing and Data Mining 4 - 4
A70519 Cloud Computing 4 - 4
ELECTIVE – I 4 - 4
A70540 Software Project Management
A70532 Image processing and Pattern Recognition
A70536 Mobile Computing
A70529 Computer Graphics
A70352 Operations Research
ELECTIVE – II 4 - 4
A70534 Machine Learning
A70539 Soft Computing
A70533 Information Retrieval Systems
A70526 Artificial Intelligence
A70628 Computer Forensics
A70596 Linux Programming Lab - 3 2
A70595 Data Warehousing and Mining Lab - 3 2
Total 24 6 28
IV YEAR II SEMESTER
Code Subject L T/P/D C
A80014 Management Science 4 - 4
ELECTIVE III 4 - 4
A80551 Web Services
A80538 Semantic Web and Social Networks
A80537 Scripting Languages
A80547 Multimedia & Rich Internet Applications
ELECTIVE – IV 4 - 4
A80542 Ad hoc and Sensor Networks
A80550 Storage Area Networks
A80543 Database Security
A80439 Embedded Systems
A80087 Industry Oriented Mini Project - - 2
A80089 Seminar - 6 2
A80088 Project Work - 15 10
A80090 Comprehensive Viva - - 2
Total 12 21 28
Note: All End Examinations (Theory and Practical) are of three hours duration.
T-Tutorial L – Theory P – Practical D-Drawing C – Credits
21 COMPUTER SCIENCE AND ENGINEERING 2013-14
W- Writing Paragraphs
G- Types of Nouns and Pronouns
V- Homonyms, homophones synonyms, antonyms
Unit –II
1. Chapter entitled “Cyber Age” from “Skills Annexe -Functional
English for Success” Published by Orient Black Swan, Hyderabad.
2. Chapter entitled 'Three Days To See' from “Epitome of Wisdom”,
Published by Maruthi Publications, Hyderabad.
L– Listening for themes and facts
S– Apologizing, interrupting, requesting and making polite conversation
R- for theme and gist
W- Describing people, places, objects, events
G- Verb forms
V- noun, verb, adjective and adverb
Unit –III
1. Chapter entitled 'Risk Management' from “Skills Annexe -
Functional English for Success” Published by Orient Black Swan,
Hyderabad
2. Chapter entitled 'Leela's Friend' by R.K. Narayan from “Epitome
of Wisdom”, Published by Maruthi Publications, Hyderabad
L– for main points and sub-points for note taking
S– giving instructions and directions; Speaking of hypothetical situations
R– reading for details
W– note-making, information transfer, punctuation
G– present tense
V– synonyms and antonyms
Unit –IV
1. Chapter entitled 'Human Values and Professional Ethics' from
“Skills Annexe -Functional English for Success” Published by
Orient Black Swan, Hyderabad
2. Chapter entitled 'The Last Leaf' from “Epitome of Wisdom”,
Published by Maruthi Publications, Hyderabad
L- Listening for specific details and information
S- narrating, expressing opinions and telephone interactions
R- Reading for specific details and information
W- Writing formal letters and CVs
25 COMPUTER SCIENCE AND ENGINEERING 2013-14
Properties of eigen values and eigen vectors of real and complex matrices.
Finding linearly independent eigen vectors of a matrix when the eigen values
of the matrix are repeated.
Diagonalization of matrix – Quadratic forms up to three variables. Rank –
Positive definite, negative definite, semi definite, index, signature of quadratic
forms. Reduction of a quadratic form to canonical form.
UNIT – II
Differential calculus methods: Rolle's Mean value Theorem – Lagrange's
Mean Value Theorem – Cauchy's mean value Theorem – (all theorems
without proof but with geometrical interpretations), verification of the
Theorems and testing the applicability of these theorem to the given function.
Functions of several variables: Functional dependence- Jacobian- Maxima
and Minima of functions of two variables without constraints and with
constraints-Method of Lagrange multipliers.
UNIT – III
Improper integration, Multiple integration & applications: Gamma and
Beta Functions –Relation between them, their properties – evaluation of
improper integrals using Gamma / Beta functions
Multiple integrals – double and triple integrals – change of order of integration-
change of variables (polar, cylindrical and spherical) Finding the area of a
region using double integration and volume of a region using triple integration.
UNIT – IV
Differential equations and applications: Overview of differential equations-
exact, linear and Bernoulli (NOT TO BE EXAMINED). Applications of first
order differential equations – Newton's Law of cooling, Law of natural growth
and decay, orthogonal trajectories.
Linear differential equations of second and higher order with constant
coefficients, Non-homogeneous term of the type f(X) = e ax , Sin ax, Cos ax,
After studying this unit, one will be able to find a corresponding Partial
Differential Equation for an unknown function with many independent
variables and to find their solution.
Most of the problems in physical and engineering applications,
problems are highly non-linear and hence expressing them as PDEs’.
Hence understanding the nature of the equation and finding a suitable
solution is very much essential.
After studying this unit, one will be able to evaluate multiple integrals
(line, surface, volume integrals) and convert line integrals to area
integrals and surface integrals to volume integrals.
It is an essential requirement for an engineer to understand the
behavior of the physical system.
34 COMPUTER SCIENCE AND ENGINEERING 2013-14
Education.
10. The C Programming Language, B.W. Kernighan and Dennis
M.Ritchie, PHI.
11. C Programming with problem solving, J.A. Jones & K.
Harrow,Dreamtech Press.
Outcomes:
Demonstrate the basic knowledge of computer hardware and
software.
Ability to apply solving and logical skills to programming in C language
and also in other languages.
43 COMPUTER SCIENCE AND ENGINEERING 2013-14
Week 11
Write a C program that uses functions to perform the following operations:
i) Reading a complex number
ii) Writing a complex number
iii) Addition of two complex numbers
iv) Multiplication of two complex numbers
(Note: represent complex number using a structure.)
Week 12
a) Write a C program which copies one file to another.
b) Write a C program to reverse the first n characters in a file.
(Note: The file name and n are specified on the command line.)
Week 13
a) Write a C program to display the contents of a file.
b) Write a C program to merge two files into a third file (i.e., the contents of
the first file followed by those of the second are put in the third file)
Week 14
a) Write a C program that uses non recursive function to search for a Key
value in a given list of integers using Linear search.
b) Write a C program that uses non recursive function to search for a Key
value in a given sorted list of integers using Binary search.
Week 15
a) Write a C program that implements the Selection sort method to sort a
given array of integers in ascending order.
b) Write a C program that implements the Bubble sort method to sort a
given list of names in ascending order.
Week 16
Write a C program that uses functions to perform the following operations:
i) Create a singly linked list of integer elements.
ii) Traverse the above list and display the elements.
Week 17
Write a C program that implements stack (its operations) using a singly
linked list to display a given list of integers in reverse order. Ex. input: 10 23
4 6 output: 6 4 23 10
Week 18
Write a C program that implements Queue (its operations) using a singly
linked list to display a given list of integers in the same order. Ex. input: 10
48 COMPUTER SCIENCE AND ENGINEERING 2013-14
23 4 6 output: 10 23 4 6
Week 19
Write a C program to implement the linear regression algorithm.
Week 20
Write a C program to implement the polynomial regression algorithm.
Week 21
Write a C program to implement the Lagrange interpolation.
Week 22
Write C program to implement the Newton- Gregory forward interpolation.
Week 23
Write a C program to implement Trapezoidal method.
Week 24
Write a C program to implement Simpson method.
TEXT BOOKS:
1. C programming and Data Structures, P. Padmanabham, Third Edition,
BS Publications
2. Computer Programming in C, V. Rajaraman, PHI Publishers.
3. C Programming, E.Balagurusamy, 3rd edition, TMH Publishers.
4. C Programming, M.V.S.S.N.Prasad, ACME Learning Pvt. Ltd.
5. C and Data Structures, N.B.Venkateswarlu and E.V.Prasad,S.Chand
Publishers
6. Mastering C, K.R. Venugopal and S.R. Prasad, TMH Publishers.
49 COMPUTER SCIENCE AND ENGINEERING 2013-14
Outcomes
The student is expected to learn from this laboratory course the concept of
error and its analysis. It also allows the student to develop experimental
skills to design new experiments in Engineering.
With the exposure to these experiments the student can compare the theory
and correlate with experiment.
TEXT BOOKS:
1. Practical Engineering Chemistry by K. Mukkanti, etal, B.S.
Publications, Hyderabad.
2. Inorganic quantitative analysis, Vogel.
REFERENCE BOOKS:
1. Text Book of engineering chemistry by R. N. Goyal and Harrmendra
Goel, Ane Books Private Ltd.,
2. A text book on experiments and calculation Engg. S.S. Dara.
3. Instrumental methods of chemical analysis, Chatwal, Anand, Himalaya
Publications.
52 COMPUTER SCIENCE AND ENGINEERING 2013-14
a T. V., a digital stereo –audio & video system and camcorder etc.
Books Suggested for English Language Lab Library (to be located within
the lab in addition to the CDs of the text book which are loaded on the
systems):
1. Suresh Kumar, E. & Sreehari, P. 2009. A Handbook for English
Language Laboratories. New Delhi: Foundation
2. Speaking English Effectively 2nd Edition by Krishna Mohan and N. P.
Singh, 2011. Macmillan Publishers India Ltd. Delhi.
3. Sasi Kumar, V & Dhamija, P.V. How to Prepare for Group Discussion
and Interviews. Tata McGraw Hill
4. Hancock, M. 2009. English Pronunciation in Use. Intermediate.
Cambridge: CUP
5. Spoken English: A Manual of Speech and Phonetics by R. K. Bansal
& J. B. Harrison. 2013. Orient Blackswan. Hyderabad.
6. Hewings, M. 2009. English Pronunciation in Use. Advanced.
Cambridge: CUP
7. Marks, J. 2009. English Pronunciation in Use. Elementary. Cambridge:
CUP
8. Nambiar, K.C. 2011. Speaking Accurately. A Course in International
Communication. New Delhi : Foundation
9. Soundararaj, Francis. 2012. Basics of Communication in English.
New Delhi: Macmillan
10. Spoken English (CIEFL) in 3 volumes with 6 cassettes, OUP.
11. English Pronouncing Dictionary Daniel Jones Current Edition with
CD.
12. A textbook of English Phonetics for Indian Students by T.
Balasubramanian (Macmillan)
13. Prescribed Lab Manual: A Manual entitled “English Language
Communication Skills (ELCS) Lab Manual- cum- Work Book”,
published by Cengage Learning India Pvt. Ltd, New Delhi. 2013
DISTRIBUTION AND WEIGHTAGE OF MARKS
English Language Laboratory Practical Examination:
1. The practical examinations for the English Language Laboratory shall
be conducted as per the University norms prescribed for the core
engineering practical sessions.
2. For the Language lab sessions, there shall be a continuous evaluation
55 COMPUTER SCIENCE AND ENGINEERING 2013-14
and preparing power point presentation. Topic covered during this week
includes: - Master Layouts (slide, template, and notes), Types of views (basic,
presentation, slide slotter, notes etc), Inserting – Background, textures,
Design Templates, Hidden slides.
REFERENCE BOOKS:
1. Introduction to Information Technology, ITL Education Solutions
limited, Pearson Education.
2. LaTeX Companion – Leslie Lamport, PHI/Pearson.
3. Introduction to Computers, Peter Norton, 6/e Mc Graw Hill Publishers.
4. Upgrading and Repairing, PC’s 18th e, Scott Muller QUE, Pearson
Education
5. Comdex Information Technology course tool kit Vikas Gupta, WILEY
Dreamtech
6. IT Essentials PC Hardware and Software Companion Guide Third
Edition by David Anfinson and Ken Quamme. – CISCO Press, Pearson
Education.
7. PC Hardware and A+Handbook – Kate J. Chase PHI (Microsoft)
Outcomes:
Apply knowledge for computer assembling and software installation.
Ability how to solve the trouble shooting problems.
Apply the tools for preparation of PPT, Documentation and budget
sheet etc.
ENGINEERING WORKSHOP
1. TRADES FOR EXERCISES:
At least two exercises from each trade:
1. Carpentry
2. Fitting
3. Tin-Smithy and Development of jobs carried out and soldering.
4. Black Smithy
5. House-wiring
6. Foundry
7. Welding
8. Power tools in construction, wood working, electrical engineering and
mechanical Engineering.
60 COMPUTER SCIENCE AND ENGINEERING 2013-14
REFERENCE BOOKS:
1) Switching and Finite Automata Theory by Zvi. Kohavi, Tata McGraw
Hill.
2) Switching and Logic Design, C.V.S. Rao, Pearson Education.
3) Digital Principles and Design – Donald D.Givone, Tata McGraw Hill,
Edition.
4) Fundamentals of Digital Logic & Micro Computer Design , 5TH Edition,
M. Rafiquzzaman John Wiley.
Outcomes:
After this course student could able to design, understand the number
systems, combinational sequential circuits. And they should be in a position
to continue with computer organization.
71 COMPUTER SCIENCE AND ENGINEERING 2013-14
Week 6 :
Write a C program that uses functions to perform the following:
a) Create a binary search tree of integers.
b) Traverse the above Binary search tree non recursively in inorder.
Week 7:
Write C programs for implementing the following sorting methods to arrange
a list of integers in Ascending order :
a) Insertion sort b) Merge sort
Week 8 :
Write C programs for implementing the following sorting methods to arrange
a list of integers in ascending order:
a) Quick sort b) Selection sort
Week 9:
i) Write a C program to perform the following operation:
a)Insertion into a B-tree.
ii) Write a C program for implementing Heap sort algorithm for sorting a
given list of integers in ascending order.
Week 10:
Write a C program to implement all the functions of a dictionary (ADT) using
hashing.
Week 11:
Write a C program for implementing Knuth-Morris- Pratt pattern matching
algorithm.
Week 12:
Write C programs for implementing the following graph traversal algorithms:
a)Depth first traversal b)Breadth first traversal
TEXT BOOKS:
1. C and Data Structures, Third Edition, P.Padmanabham, BS
Publications.
2. C and Data Structures, Prof. P.S.Deshpande and Prof. O.G. Kakde,
Dreamtech Press.
3. Data structures using C, A.K.Sharma, 2nd edition, Pearson.
4. Data Structures using C, R.Thareja, Oxford University Press.
5. C and Data Structures, N.B.Venkateswarlu and E.V.Prasad,S.Chand.
78 COMPUTER SCIENCE AND ENGINEERING 2013-14
TEXT BOOKS:
1) Computer system Architecture: Morris Mano (UNIT-1,2,3).
2) Advanced Micro Processor and Peripherals- Hall/ A K Ray(UNIT-4,5).
REFERENCE BOOKS:
1) Computer Organization and Architecture – William Stallings Sixth
Edition, Pearson/PHI.
2) Structured Computer Organization – Andrew S. Tanenbaum, 4th
Edition PHI/Pearson.
3) Fundamentals or Computer Organization and Design, - Sivaraama
Dandamudi Springer Int. Edition.
4) Computer Architecture a quantitative approach, John L. Hennessy
and David A. Patterson, Fourth Edition Elsevier.
5) Computer Architecture: Fundamentals and principles of Computer
Design, Joseph D. Dumas II, BS Publication.
Outcomes:
After this course students understand in a better way the I/O and memory
organization in depth. They should be in a position to write assembly language
programs for various applications.
81 COMPUTER SCIENCE AND ENGINEERING 2013-14
UNIT- III
Introduction to Schema Refinement – Problems Caused by redundancy,
Decompositions – Problem related to decomposition, Functional
Dependencies - Reasoning about FDS, Normal Forms – FIRST, SECOND,
THIRD Normal forms – BCNF –Properties of Decompositions- Loss less-
join Decomposition, Dependency preserving Decomposition, Schema
Refinement in Data base Design – Multi valued Dependencies – FOURTH
Normal Form, Join Dependencies, FIFTH Normal form, Inclusion
Dependencies.
UNIT- IV
Transaction Management-Transaction Concept- Transaction State-
Implementation of Atomicity and Durability – Concurrent – Executions –
Serializability- Recoverability – Implementation of Isolation – Testing for
serializability.
Concurrency Control- Lock –Based Protocols – Timestamp Based Protocols-
Validation- Based Protocols – Multiple Granularity.
Recovery System-Failure Classification-Storage Structure-Recovery and
Atomicity – Log – Based Recovery – Recovery with Concurrent Transactions
– Buffer Management – Failure with loss of nonvolatile storage-Advance
Recovery systems- Remote Backup systems.
UNIT- V
Overview of Storage and Indexing: Data on External Storage, File
Organization and Indexing – Clustered Indexes, Primary and Secondary
Indexes, Index data Structures – Hash Based Indexing, Tree based Indexing,
Comparison of File Organizations.
Tree Structured Indexing: Intuitions for tree Indexes, Indexed Sequential
Access Methods (ISAM) B+ Trees: A Dynamic Index Structure, Search, Insert,
Delete.
Hash Based Indexing: Static Hashing, Extendable hashing, Linear Hashing,
Extendible vs. Linear Hashing.
TEXT BOOKS:
1. Data base Management Systems, Raghu Ramakrishnan, Johannes
Gehrke, TMH, 3rd Edition, 2003.
2. Data base System Concepts, A.Silberschatz, H.F. Korth, S.Sudarshan,
McGraw hill, VI edition, 2006.
REFERENCE BOOKS:
1. Database Systems, 6th edition, Ramez Elmasri, Shamkant B.Navathe,
Pearson Education, 2013.
2. Database Principles, Programming, and Performance, P.O'Neil,
E.O'Neil, 2nd ed., ELSEVIER.
83 COMPUTER SCIENCE AND ENGINEERING 2013-14
Outcomes:
Understanding of OOP concepts and basics of java programming
(Console and GUI based).
The skills to apply OOP and Java programming in problem solving.
Should have the ability to extend his/her knowledge of Java
programming further on his/her own.
87 COMPUTER SCIENCE AND ENGINEERING 2013-14
UNIT- IV
Turing Machine : Turing Machine, definition, model, design of TM,
Computable functions, recursively enumerable languages. Church's
hypothesis, counter machine, types of Turing machines (proofs not required).
linear bounded automata and context sensitive language.
UNIT- V
Computability Theory : Chomsky hierarchy of languages, decidability of,
problems, Universal Turing Machine, undecidability of posts. Correspondence
problem, Turing reducibility, Definition of P and NP problems, NP complete
and NP hard problems.
TEXT BOOKS :
1. “Introduction to Automata Theory Languages and Computation”.
Hopcroft H.E. and Ullman J. D. Pearson Education.
2. Introduction to Theory of Computation –Sipser 2nd edition Thomson.
REFERENCE BOOKS :
1. Introduction to Formal languages Automata Theory and Computation
Kamala Krithivasan Rama R.
2. Introduction to Computer Theory, Daniel I.A. Cohen, John Wiley.
3. Theory Of Computation: A Problem-Solving Approach, Kavi Mahesh,
Wiley India Pvt. Ltd.
4. “Elements of Theory of Computation”, Lewis H.P. & Papadimition C.H.
Pearson /PHI.
5. Theory of Computer Science – Automata languages and computation
-Mishra and Chandrashekaran, 2nd edition, PHI.
Outcomes:
Graduate should be able to understand the concept of abstract
machines and their power to recognize the languages.
Attains the knowledge of language classes & grammars relationship
among them with the help of Chomsky hierarchy.
Graduate will be able to understanding the pre-requisites to the course
compiler or advanced compiler design.
91 COMPUTER SCIENCE AND ENGINEERING 2013-14
Outcomes:
Basics of java programming, multi-threaded programs and Exception
handling.
The skills to apply OOP in Java programming in problem solving.
Ability to access data from a DB with Java programs.
Use of GUI components (Console and GUI based).
96 COMPUTER SCIENCE AND ENGINEERING 2013-14
2. Ticket
3. Passenger
Relationships:
1. Reservation
2. Cancellation
PRIMARY KEY ATTRIBUTES:
1. Ticket ID (Ticket Entity)
2. Passport ID (Passenger Entity)
3. Bus_NO(Bus Entity)
Apart from the above mentioned entities you can identify more. The above
mentioned are few.
Note: The student is required to submit a document by writing the Entities
and Keys to the lab teacher.
Experiment 2: Concept design with E-R Model
Relate the entities appropriately. Apply cardinalities for each relationship.
Identify strong entities and weak entities (if any). Indicate the type of
relationships (total / partial). Try to incorporate generalization, aggregation,
specialization etc wherever required.
Example: E-R diagram for bus
add more attributes based on your E-R model. This is not a normalized
table.
Passenger
Passport ID Ticket_id
You can do the second and third normal forms if required. Any how
Normalized tables are given at the end.
99 COMPUTER SCIENCE AND ENGINEERING 2013-14
ELSE
SET New.Ticketno = 0;
END IF;
END;
Experiment 11: Procedures
In this session you are going to learn Creation of stored procedure, Execution
of procedure and modification of procedure. Practice procedures using the
above database.
Eg:CREATE PROCEDURE myProc()
BEGIN
SELECT COUNT(Tickets) FROM Ticket WHERE age>=40;
End;
Experiment 12: Cursors
In this week you need to do the following: Declare a cursor that defines a
result set.
Open the cursor to establish the result set. Fetch the data into local variables
as needed from the cursor, one row at a time. Close the cursor when done
CREATE PROCEDURE myProc(in_customer_id INT)
BEGIN
DECLARE v_id INT;
DECLARE v_name VARCHAR (30);
DECLARE c1 CURSOR FOR SELECT stdId,stdFirstname FROM
students WHERE stdId=in_customer_id;
OPEN c1;
FETCH c1 into v_id, v_name;
Close c1;
END;
Tables
BUS
Bus No: Varchar: PK (public key)
Source : Varchar
Destination : Varchar
Passenger
PPNO: Varchar(15)) : PK
Name: Varchar(15)
102 COMPUTER SCIENCE AND ENGINEERING 2013-14
Tech.
5. Oracle Database 11g PL/SQL Programming, M.Mc Laughlin,TMH.
6. SQL Fundamentals, J.J.Patrick, Pearson Education.
Outcomes:
Ability to design and implement a database schema for given problem.
Be capable to Design and build a GUI application.
Apply the normalization techniques for development of application
software to realistic problems.
Ability to formulate queries using SQL DML/DDL/DCL commands.
104 COMPUTER SCIENCE AND ENGINEERING 2013-14
Publications,2008.
8. Software Engineering Principles and Practice, Hans Van Vliet,3rd
edition, John Wiley &Sons Ltd.
9. Software Engineering 3:Domains,Requirements,and Software Design,
D.Bjorner, Springer International Edition.
10. Introduction to Software Engineering, R.J.Leach, CRC Press.
Outcomes:
Ability to identify the minimum requirements for the development of
application.
Ability to develop, maintain, efficient, reliable and cost effective
software solutions
Ability to critically thinking and evaluate assumptions and arguments.
115 COMPUTER SCIENCE AND ENGINEERING 2013-14
UNIT – V
Object code generation : Object code forms, machine dependent code
optimization, register allocation and assignment generic code generation
algorithms, DAG for register allocation.
TEXT BOOKS :
1. Principles of compiler design -A.V. Aho . J.D.Ullman; Pearson
Education.
2. Modern Compiler Implementation in C- Andrew N. Appel, Cambridge
University Press.
REFERENCE BOOKS :
1. lex &yacc – John R. Levine, Tony Mason, Doug Brown, O'reilly
2. Modern Compiler Design- Dick Grune, Henry E. Bal, Cariel T. H.
Jacobs, Wiley dreamtech.
3. Engineering a Compiler-Cooper & Linda, Elsevier.
4. Compiler Construction, Louden, Thomson.
Outcomes:
• Ability to understand the design of a compiler given features of the
languages.
• Ability to implement practical aspects of automata theory.
• Gain Knowledge of powerful compiler generation tools.
117 COMPUTER SCIENCE AND ENGINEERING 2013-14
UNIT- IV
File System Interface - The Concept of a File, Access methods, Directory
Structure, File System Mounting, File Sharing, Protection, File System
Implementation - File System Structure, File System Implementation,
Allocation methods, Free-space Management, Directory Implementation,
Efficiency and Performance.
Mass Storage Structure – Overview of Mass Storage Structure, Disk
Structure, Disk Attachment, Disk Scheduling, Disk Management, Swap space
Management
UNIT- V
Deadlocks - System Model, Deadlock Characterization, Methods for Handling
Deadlocks, Deadlock Prevention, Deadlock Avoidance, Deadlock Detection
and Recovery from Deadlock.
Protection – System Protection, Goals of Protection, Principles of Protection,
Domain of Protection, Access Matrix, Implementation of Access Matrix,
Access Control, Revocation of Access Rights, Capability-Based Systems,
Language-Based Protection.
TEXT BOOKS:
1. Operating System Principles , Abraham Silberchatz, Peter B. Galvin,
Greg Gagne, 8th Edition, Wiley Student Edition
2. Operating Systems – Internals and Design Principles, W. Stallings,
6th Edition, Pearson.
REFERENCE BOOKS:
1. Modern Operating Systems, Andrew S Tanenbaum, 3rd Edition, PHI
2. Operating Systems A concept-based Approach, 2nd Edition,
D.M.Dhamdhere, TMH.
3. Principles of Operating Systems, B.L.Stuart, Cengage learning, India
Edition.
4. Operating Systems, A.S.Godbole, 2nd Edition, TMH
5. An Introduction to Operating Systems, P.C.P. Bhatt, PHI.
6. Operating Systems, S.Haldar and A.A.Aravind,Pearson Education.
7. Operating Systems, R.Elmasri, A,G.Carrick and D.Levine, Mc Graw
Hill.
8. Operating Systems in depth, T.W. Doeppner, Wiley.
Outcomes:
Apply optimization techniques for the improvement of system
performance.
Ability to understand the synchronous and asynchronous
119 COMPUTER SCIENCE AND ENGINEERING 2013-14
<addingop> ::= + | -
<term> ::= <term> <multop> <factor> | <factor>
<multop> ::= * | /
<factor> ::= <constant> | <identifier> | <identifier> [ <expression>]
| ( <expression> )
<constant> ::= <digit> | <digit> <constant>
<identifier> ::= <identifier> <letterordigit> | <letter>
<letterordigit> ::= <letter> | <digit>
<letter> ::= a|b|c|d|e|f|g|h|i|j|k|l|m|n|o|p|q|r|s|t|u|v|w|x|y|z
<digit> ::= 0|1|2|3|4|5|6|7|8|9
<empty> has the obvious meaning
Comments (zero or more characters enclosed between the standard C/Java-
style comment brackets /
*...*/) can be inserted. The language has rudimentary support for 1-
dimensional arrays. The declaration
int a[3] declares an array of three elements, referenced as a[0], a[1] and
a[2]. Note also that you should
worry about the scoping of names.
A simple program written in this language is:
{ int a[3],t1,t2;
t1=2;
a[0]=1; a[1]=2; a[t1]=3;
t2=-(a[2]+t1*6)/(a[2]-t1);
if t2>5 then
print(t2);
else {
int t3;
t3=99;
t2=-25;
print(-t1+t2*t3); /* this is a comment
on 2 lines */
} endif }
1. Design a Lexical analyzer for the above language. The lexical
analyzer should ignore redundant spaces, tabs and newlines. It should
also ignore comments. Although the syntax specification states that
125 COMPUTER SCIENCE AND ENGINEERING 2013-14
identifiers can be arbitrarily long, you may restrict the length to some
reasonable value.
2. Implement the lexical analyzer using JLex, flex or lex or other lexical
analyzer generating tools.
3. Design Predictive parser for the given language
4. Design LALR bottom up parser for the above language.
5. Convert the BNF rules into Yacc form and write code to generate
abstract syntax tree.
6. Write program to generate machine code from the abstract syntax
tree generated by the parser. The following instruction set may be
considered as target code.
The following is a simple register-based machine, supporting a total of 17
instructions. It has three distinct internal storage areas. The first is the set of
8 registers, used by the individual instructions as detailed below, the second
is an area used for the storage of variables and the third is an area used for
the storage of program. The instructions can be preceded by a label. This
consists of an integer in the range 1 to 9999 and the label is followed by a
colon to separate it from the rest of the instruction. The numerical label can
be used as the argument to a jump instruction, as detailed below.
In the description of the individual instructions below, instruction argument
types are specified as follows :
R
specifies a register in the form R0, R1, R2, R3, R4, R5, R6 or R7 (or r0, r1,
etc.).
L
specifies a numerical label (in the range 1 to 9999).
V
specifies a “variable location” (a variable number, or a variable location
pointed to by a register - see
below).
A
specifies a constant value, a variable location, a register or a variable location
pointed to by a register (an indirect address). Constant values are specified
as an integer value, optionally preceded by a minus sign, preceded by a #
symbol. An indirect address is specified by an @ followed by a register.
So, for example, an A-type argument could have the form 4 (variable number
4), #4 (the constant value 4), r4 (register 4) or @r4 (the contents of register
4 identifies the variable location to be accessed).
126 COMPUTER SCIENCE AND ENGINEERING 2013-14
jumps to the instruction with the label L if the value in register R is less than
zero.
NOP
is an instruction with no effect. It can be tagged by a label.
STOP
stops execution of the machine. All programs should terminate by executing
a STOP instruction.
Outcomes:
By this laboratory, students will understand the practical approach of
how a compiler works.
This will enable him to work in the development phase of new
computer languages in industry.
128 COMPUTER SCIENCE AND ENGINEERING 2013-14
Diagrams.
UNIT- IV
Advanced Behavioral Modeling: Events and signals, state machines,
processes and Threads, time and space, state chart diagrams.
Architectural Modeling: Component, Deployment, Component diagrams and
Deployment diagrams.
UNIT- V
Patterns and Frameworks, Artifact Diagrams. Case Study: The Unified Library
application
TEXT BOOKS:
1. Grady Booch, James Rumbaugh, Ivar Jacobson : The Unified
Modeling Language User Guide, Pearson Education 2nd Edition.
2. Hans-Erik Eriksson, Magnus Penker, Brian Lyons, David Fado: UML
2 Toolkit, WILEY-Dreamtech India Pvt. Ltd.
REFERENCE BOOKS:
1. Meilir Page-Jones: Fundamentals of Object Oriented Design in UML,
Pearson Education.
2. Pascal Roques: Modeling Software Systems Using UML2, WILEY-
Dreamtech India Pvt. Ltd.
3. Atul Kahate: Object Oriented Analysis & Design, The McGraw-Hill
Companies.
4. Mark Priestley: Practical Object-Oriented Design with UML, TMH.
5. Appling UML and Patterns: An introduction to Object – Oriented
Analysis and Design and Unified Process, Craig Larman, Pearson
Education.
6. Object-Oriented Analysis and Design with the Unified Process By
John W. Satzinger, Robert B Jackson and Stephen D Burd, Cengage
Learning.
7. UML and C++, R.C.Lee, and W.M.Tepfenhart, PHI.
8. Object Oriented Analysis, Design and Implementation,B.Dathan,
S.Ramnath, Universities Press.
9. OODesign with UML and Java, K.Barclay, J.Savage, Elsevier.
10. Learning UML 2.0, Russ Miles and Kim Hamilton, O’Reilly, SPD.
Outcomes: Graduate can able to take up the case studies and model it in
different views with respect user requirement such as use case, logical,
component and deployment and etc, and preparation of document of the
project for the unified Library application.
134 COMPUTER SCIENCE AND ENGINEERING 2013-14
edition.
2. Software Testing Tools – Dr.K.V.K.K.Prasad, Dreamtech.
REFERENCE BOOKS:
1. The craft of software testing - Brian Marick, Pearson Education.
2. Software Testing,3 rd edition,P.C. Jorgensen, Aurbach Publications
(Dist.by SPD).
3. Software Testing, N.Chauhan, Oxford University Press.
4. Introduction to Software Testing, P.Ammann&J.Offutt, Cambridge
Univ.Press.
5. Effective methods of Software Testing, Perry, John Wiley, 2nd Edition,
1999.
6. Software Testing Concepts and Tools, P.Nageswara Rao, dreamtech
Press.
7. Software Testing, M.G.Limaye, TMH.
8. Software Testing, S.Desikan, G.Ramesh, Pearson.
9. Foundations of Software Testing, D.Graham & Others, Cengage
Learning.
10. Foundations of Software Testing, A.P.Mathur, Pearson.
Outcomes:
Ability to apply the process of testing and various methodologies in
testing for developed software.
Ability to write test cases for given software to test it before delivery
to the customer.
136 COMPUTER SCIENCE AND ENGINEERING 2013-14
Unit V
Introduction to Financial Accounting & Financial Analysis: Accounting
concepts and Conventions - Introduction IFRS - Double-Entry Book Keeping,
Journal, Ledger, Trial Balance- Final Accounts (Trading Account, Profit and
Loss Account and Balance Sheet with simple adjustments). Financial
Analysis: Analysis and Interpretation of Liquidity Ratios, Activity Ratios, and
Capital structure Ratios and Profitability ratios. Du Pont Chart.
TEXT BOOKS:
1. Varshney & Maheswari: Managerial Economics, Sultan Chand, 2009.
2. S.A. Siddiqui & A.S. Siddiqui, Managerial Economics and Financial
Analysis, New Age international Publishers, Hyderabad 2013.
3. M. Kasi Reddy & Saraswathi, Managerial Economics and Financial
Analysis, PHI New Delhi, 2012.
REFERENCES:
1. Ambrish Gupta, Financial Accounting for Management, Pearson
Education, New Delhi.2012.
2. H. Craig Peterson & W. Cris Lewis, Managerial Economics, Pearson,
2012.
3. Lipsey & Chrystel, Economics, Oxford University Press, 2012
5. Domnick Salvatore: Managerial Economics in a Global Economy,
Thomson, 2012.
6. Narayanaswamy: Financial Accounting—A Managerial Perspective,
Pearson, 2012.
7. S.N.Maheswari & S.K. Maheswari, Financial Accounting, Vikas, 2012.
8. Truet and Truet: Managerial Economics: Analysis, Problems and
Cases, Wiley, 2012.
9. Dwivedi: Managerial Economics, Vikas, 2012.
10. Shailaja & Usha : MEFA, University Press, 2012.
11. Aryasri: Managerial Economics and Financial Analysis, TMH, 2012.
12. Vijay Kumar & Appa Rao, Managerial Economics & Financial Analysis,
Cengage 2011.
13. J. V. Prabhakar Rao & P.V. Rao, Managerial Economics & Financial
Analysis, Maruthi Publishers, 2011.
Outcomes:
At the end of the course, the student will
Understand the market dynamics namely, demand and supply,
demand forecasting , elasticity of demand and supply, pricing methods
and pricing in different market structures.
138 COMPUTER SCIENCE AND ENGINEERING 2013-14
TEXT BOOKS:
1. Web Technologies, Uttam K Roy, Oxford University Press
2. The Complete Reference PHP – Steven Holzner, Tata McGraw-Hill
REFERENCE BOOKS:
1. Web Programming, building internet applications, Chris Bates 2 nd
edition, W iley Dreamtech
2. Java Server Pages –Hans Bergsten, SPD O’Reilly
3. Java Script, D.Flanagan, O’Reilly,SPD.
4. Beginning Web Programming-Jon Duckett WROX.
5. Programming world wide web, R.W.Sebesta, Fourth Edition, Pearson.
6. Internet and World Wide Web – How to program, Dietel and Nieto,
Pearson.
Outcomes:
gain knowledge of client side scripting, validation of forms and AJAX
programming
have understanding of server side scripting with PHP language
have understanding of what is XML and how to parse and use XML
Data with Java
To introduce Server side programming with Java Servlets and JSP
141 COMPUTER SCIENCE AND ENGINEERING 2013-14
When the switch is moved to the “off” position, the machine will shut down,
so that the operator may remove deposit envelopes and reload the machine
with cash, blank receipts, etc.
II. Study of any testing tool (e.g. Win runner)
III. Study of any web testing tool (e.g. Selenium)
IV. Study of any bug tracking tool (e.g. Bugzilla, bugbit)
V. Study of any test management tool (e.g. Test Director)
VI. Study of any open source-testing tool (e.g. Test Link)
Outcomes:
Ability to understand the history, cost of using and building CASE
tools.
Ability to construct and evaluate hybrid CASE tools by integrating
existing tools.
WEB TECHNOLOGIES LAB
Objectives:
To enable the student to program web applications using the following
technologies HTML ,Javascript ,AJAX ,PHP ,Tomcat Server, Servlets
,JSP
Note:
1. Use LAMP Stack (Linux, Apache, MySQL and PHP) for the Lab
Experiments. Though not mandatory, encourage the use of
Eclipse platform wherever applicable
2. The list suggests the minimum program set. Hence, the
concerned staff is requested to add more problems to the list as
needed
1. Install the following on the local machine
Apache Web Server (if not installed)
Tomcat Application Server locally
Install MySQL (if not installed)
Install PHP and configure it to work with Apache web server and
MySQL (if not already configured)
2. Write an HTML page including any required Javascript that takes a
number from one text field in the range of 0 to 999 and shows it in
another text field in words. If the number is out of range, it should
show “out of range” and if it is not a number, it should show “not a
number” message in the result box.
3. Write an HTML page that has one input, which can take multi-line
144 COMPUTER SCIENCE AND ENGINEERING 2013-14
text and a submit button. Once the user clicks the submit button, it
should show the number of characters, words and lines in the text
entered using an alert message. Words are separated with white
space and lines are separated with new line character.
4. Write an HTML page that contains a selection box with a list of 5
countries. When the user selects a country, its capital should be
printed next to the list. Add CSS to customize the properties of the
font of the capital (color, bold and font size).
5. Create an XML document that contains 10 users information. Write a
Java program, which takes User Id as input and returns the user
details by taking the user information from the XML document using
(a) DOM Parser and (b) SAX parser
6. Implement the following web applications using (a) PHP, (b) Servlets
and (c) JSP:
i. A user validation web application, where the user submits the login
name and password to the server. The name and password are
checked against the data already available in Database and if the
data matches, a successful login page is returned. Otherwise a failure
message is shown to the user.
ii. Modify the above program to use an xml file instead of database.
iii. Modify the above program to use AJAX to show the result on the
same page below the submit button.
iv. A simple calculator web application that takes two numbers and an
operator (+, -, /, * and %) from an HTML page and returns the result
page with the operation performed on the operands.
v. Modify the above program such that it stores each query in a database
and checks the database first for the result. If the query is already
available in the DB, it returns the value that was previously computed
(from DB) or it computes the result and returns it after storing the
new query and result in DB.
vi. A web application takes a name as input and on submit it shows a
hello <name> page where <name> is taken from the request. It shows
the start time at the right top corner of the page and provides a logout
button. On clicking this button, it should show a logout page with
Thank You <name> message with the duration of usage (hint: Use
session to store name and time).
vii. A web application that takes name and age from an HTML page. If
the age is less than 18, it should send a page with “Hello <name>,
you are not authorized to visit this site” message, where <name>
should be replaced with the entered name. Otherwise it should send
“Welcome <name> to this site” message.
145 COMPUTER SCIENCE AND ENGINEERING 2013-14
Outcomes:
Describe and determine the purpose and importance of project
management from the perspectives of planning, tracking and
completion of project.
Compare and differentiate organization structures and project
structures.
Implement a project to manage project schedule, expenses and
resources with the application of suitable project management tools.
162 COMPUTER SCIENCE AND ENGINEERING 2013-14
Relational Descriptors
UNIT- V
Pattern Recognition Fundamentals: Basic Concepts of pattern recognition,
Fundamental problems in pattern recognition system, design concepts and
methodologies, example of automatic pattern recognition systems, a simple
automatic pattern recognition model
Pattern classification: Pattern classification by distance function: Measures
of similarity, Clustering criteria, K-means algorithm, Pattern classification by
likelihood function: Pattern classification as a Statistical decision problem,
Bayes classifier for normal patterns.
TEXT BOOKS
1. Digital Image Processing Third edition, Pearson Education, Rafael
C. Gonzalez, Richard E. Woods.
2. Pattern recognition Principles: Julus T. Tou, and Rafel C. Gonzalez,
Addision-Wesly Publishing Company.
3. Digital Image Processing, M.Anji Reddy, Y.Hari Shankar, BS
Publications.
REFERENCE BOOKS:
1. Image Processing, Analysis and Machine Vision, Second Edition,
Milan Sonka, Vaclav Hlavac and Roger Boyle. Thomson learning
2. Digital Image Processing – William k. Pratl –John Wiley edition.
3. Fundamentals of digital image processing – by A.K. Jain, PHI.
4. Pattern classification, Richard Duda, Hart and David strok John Wiley
publishers.
5. Digital Image Processing, S.Jayaraman,S. Esakkiraj an,
T.Veerakumar, TMH.
6. Pattern Recognition, R.Shinghal, Oxford University Press.
Outcomes:
Ability to apply computer algorithms to practical problems.
Ability to image segmentation, reconstruction and restoration.
Ability to perform the classification of patterns
164 COMPUTER SCIENCE AND ENGINEERING 2013-14
UNIT- IV
Data Dissemination and Synchronization: Communications Asymmetry,
Classification of Data Delivery Mechanisms, Data Dissemination, Broadcast
Models, Selective Tuning and Indexing Methods, Data Synchronization –
Introduction, Software, and Protocols
UNIT- V
Mobile Ad hoc Networks (MANETs): Introduction, Applications &
Challenges of a MANET, Routing, Classification of Routing Algorithms,
Algorithms such as DSR, AODV, DSDV, etc. , Mobile Agents, Service
Discovery.
Protocols and Platforms for Mobile Computing :WAP, Bluetooth, XML,
J2ME, JavaCard, PalmOS, Windows CE, SymbianOS, Linux for Mobile
Devices, Android.
TEXT BOOKS:
1. Jochen Schiller, “Mobile Communications”, Addison-Wesley, Second
Edition, 2009.
2. Raj Kamal, “Mobile Computing”, Oxford University Press, 2007, ISBN:
0195686772
REFERENCE BOOKS:
1. Jochen Schiller, “Mobile Communications”, Addison-Wesley, Second
Edition, 2004.
2. Stojmenovic and Cacute, “Handbook of Wireless Networks and Mobile
Computing”, Wiley, 2002, ISBN 0471419028.
3. Reza Behravanfar, “Mobile Computing Principles: Designing and
Developing Mobile Applications with UML and XML”, ISBN:
0521817331, Cambridge University Press, Oct 2004,
Outcomes:
Able to think and develop new mobile application.
Able to take any new technical issue related to this new paradigm
and come up with a solution(s).
Able to develop new ad hoc network applications and/or algorithms/
protocols.
Able to understand & develop any existing or new protocol related to
mobile environment
166 COMPUTER SCIENCE AND ENGINEERING 2013-14
UNIT – V
Waiting Lines: Introduction – Terminology-Single Channel – Poisson arrivals
and Exponential Service times – with infinite population and finite population
models– Multichannel – Poisson arrivals and exponential service times with
infinite population.
Dynamic Programming: Introduction – Terminology- Bellman’s Principle of
Optimality – Applications of dynamic programming- shortest path problem –
linear programming problem.
Simulation: Introduction, Definition, types of simulation models, Steps
involved in the simulation process- Advantages and disadvantages-
applications of simulation to queuing and inventory.
TEXT BOOK :
1. Operations Research /J.K.Sharma 4e. /MacMilan
2. Introduction to O.R/Hillier & Libermann/TMH
REFERENCE BOOKS :
1. Introduction to O.R /Taha/PHI
2. Operations Research/ NVS Raju/ SMS Education/3rd Revised Edition
3. Operations Research /A.M.Natarajan, P.Balasubramaniam, A.
Tamilarasi/Pearson Education.
4. Operations Research / Wagner/ PHI Publications.
5. Operations Research/M.V. Durga Prasad, K, Vijaya Kumar Reddy, J.
Suresh Kumar/ Cengage Learning.
170 COMPUTER SCIENCE AND ENGINEERING 2013-14
2. Trevor Has tie, Robert Tibshirani & Jerome Friedman. The Elements
of Statically Learning, Springer Verlag, 2001
REFERENCE BOOKS:
1. Machine Learning Methods in the Environmental Sciences, Neural
Networks, William W Hsieh, Cambridge Univ Press.
2. Richard o. Duda, Peter E. Hart and David G. Stork, pattern
classification, John Wiley & Sons Inc.,2001
3. Chris Bishop, Neural Networks for Pattern Recognition, Oxford
University Press, 1995
Outcomes:
Student should be able to understand the basic concepts such as
decision trees and neural networks.
Ability to formulate machine learning techniques to respective
problems.
Apply machine learning algorithms to solve problems of moderate
complexity
172 COMPUTER SCIENCE AND ENGINEERING 2013-14
TEXT BOOKS:
1. Principles of Soft Computing- S N Sivanandam, S N Deepa, Wiley
India, 2007.
2. Soft Computing and Intelligent System Design -Fakhreddine O Karray,
Clarence D Silva, Pearson Edition, 2004.
REFERENCE BOOKS:
1. Artificial Intelligence and SoftComputing- Behavioural and Cognitive
Modelling of the Human Brain- Amit Konar, CRC press, Taylor and
Francis Group.
2. Artificial Intelligence – Elaine Rich and Kevin Knight, TMH, 1991,
rp2008.
3. Artificial Intelligence – Patric Henry Winston – Third Edition, Pearson
Education.
4. A first course in Fuzzy Logic-Hung T Nguyen and Elbert A Walker,
CRC. Press Taylor and Francis Group.
5. Artificial Intelligence and Intelligent Systems, N.P.Padhy, Oxford Univ.
Press.
Outcomes:
Student can able to building intelligent systems through soft computing
techniques.
Student should be able to understand the concept of artificial neural
networks, fuzzy arithmetic and fuzzy logic with their day to day
applications.
174 COMPUTER SCIENCE AND ENGINEERING 2013-14
REFERENCE BOOKS:
1. Gerald J Kowalski, Mark T Maybury. Information Storage and Retrieval
Systems, Springer, 2000.
2. Soumen Chakrabarti, Mining the Web : Discovering Knowledge from
Hypertext Data, Morgan-Kaufmann Publishers, 2002.
3. Christopher D. Manning, Prabhakar Raghavan, Hinrich Schütze, An
Introduction to Information Retrieval, Cambridge University Press,
Cambridge, England, 2009.
Outcomes:
Possess the ability to store and retrieve textual documents using
appropriate models.
Possess the ability to use the various retrieval utilities for improving
search.
Possess an understanding of indexing and compressing documents
to improve space and time efficiency.
Possess the skill to formulate SQL like queries for unstructured data.
Understand issues in web search.
176 COMPUTER SCIENCE AND ENGINEERING 2013-14
UNIT-IV
Machine-Learning Paradigms: Introduction. Machine Learning Systems.
Supervised and Unsupervised Learning. Inductive Learning. Learning
Decision Trees (Text Book 2), Deductive Learning. Clustering, Support Vector
Machines.
Artificial Neural Networks: Introduction, Artificial Neural Networks, Single-
Layer Feed-Forward Networks, Multi-Layer Feed-Forward Networks, Radial-
Basis Function Networks, Design Issues of Artificial Neural Networks,
Recurrent Networks.
UNIT-V
Advanced Knowledge Representation Techniques: Case Grammars,
Semantic Web
Natural Language Processing: Introduction, Sentence Analysis Phases,
Grammars and Parsers, Types of Parsers, Semantic Analysis, Universal
Networking Knowledge.
TEXT BOOKS:
1. Saroj Kaushik. Artificial Intelligence. Cengage Learning, 2011.
2. Russell, Norvig: Artificial intelligence, A Modern Approach, Pearson
Education, Second Edition. 2004.
REFERENCE BOOK:
1. Rich, Knight, Nair: Artificial intelligence, Tata McGraw Hill, Third Edition
2009.
Outcomes:
Possess the ability to formulate an efficient problem space for a
problem expressed in English.
Possess the ability to select a search algorithm for a problem and
characterize its time and space complexities.
Possess the skill for representing knowledge using the appropriate
technique.
Possess the ability to apply AI techniques to solve problems of Game
Playing, Expert Systems, Machine Learning and Natural Language
Processing.
178 COMPUTER SCIENCE AND ENGINEERING 2013-14
5. Is testing on the training set as you did above a good idea? Why or
Why not ? (10 marks)
6. One approach for solving the problem encountered in the previous
question is using cross-validation? Describe what is cross-validation
briefly. Train a Decision Tree again using cross-validation and report
your results. Does your accuracy increase/decrease? W hy? (10
marks)
7. Check to see if the data shows a bias against “foreign workers”
(attribute 20), or “personal-status” (attribute 9). One way to do this
(perhaps rather simple minded) is to remove these attributes from
the dataset and see if the decision tree created in those cases is
significantly different from the full dataset case which you have already
done. To remove an attribute you can use the preprocess tab in
W eka’s GUI Explorer. Did removing these attributes have any
significant effect? Discuss. (10 marks)
8. Another question might be, do you really need to input so many
attributes to get good results? Maybe only a few would do. For
example, you could try just having attributes 2, 3, 5, 7, 10, 17 (and
21, the class attribute (naturally)). Try out some combinations. (You
had removed two attributes in problem 7. Remember to reload the
arff data file to get all the attributes initially before you start selecting
the ones you want.) (10 marks)
9. Sometimes, the cost of rejecting an applicant who actually has a
good credit (case 1) might be higher than accepting an applicant
who has bad credit (case 2). Instead of counting the misclassifcations
equally in both cases, give a higher cost to the first case (say cost 5)
and lower cost to the second case. You can do this by using a cost
matrix in Weka. Train your Decision Tree again and report the Decision
Tree and cross-validation results. Are they significantly different from
results obtained in problem 6 (using equal cost)? (10 marks)
10. Do you think it is a good idea to prefer simple decision trees instead
of having long complex decision trees? How does the complexity of
a Decision Tree relate to the bias of the model? (10 marks)
11. You can make your Decision Trees simpler by pruning the nodes.
One approach is to use Reduced Error Pruning - Explain this idea
briefly. Try reduced error pruning for training your Decision Trees
using cross-validation (you can do this in Weka) and report the
Decision Tree you obtain? Also, report your accuracy using the pruned
model. Does your accuracy increase? (10 marks)
12. (Extra Credit): How can you convert a Decision Trees into “if-then-
else rules”. Make up your own small Decision Tree consisting of 2-3
187 COMPUTER SCIENCE AND ENGINEERING 2013-14
levels and convert it into a set of rules. There also exist different
classifiers that output the model in the form of rules - one such
classifier in Weka is rules. PART, train this model and report the set
of rules obtained. Sometimes just one attribute can be good enough
in making the decision, yes, just one ! Can you predict what attribute
that might be in this dataset ? OneR classifier uses a single attribute
to make decisions (it chooses the attribute based on minimum error).
Report the rule obtained by training a one R classifier. Rank the
performance of j48, PART and oneR. (10 marks)
Task Resources:
Mentor lecture on Decision Trees
Andrew Moore’s Data Mining Tutorials (See tutorials on Decision Trees
and Cross Validation)
Decision Trees (Source: Tan, MSU)
Tom Mitchell’s book slides (See slides on Concept Learning and
Decision Trees)
Weka resources:
o Introduction to Weka (html version) (download ppt version)
o Download Weka
o Weka Tutorial
o ARFF format
o Using Weka from command line
Task 2: Hospital Management System
Data Warehouse consists Dimension Table and Fact Table.
REMEMBER The following
Dimension
The dimension object (Dimension):
_ Name
_ Attributes (Levels) , with one primary key
_ Hierarchies
One time dimension is must.
About Levels and Hierarchies
Dimension objects (dimension) consist of a set of levels and a set of
hierarchies defined over those levels. The levels represent levels of
aggregation. Hierarchies describe parent-child relationships among a set of
levels.
For example, a typical calendar dimension could contain five levels. Two
188 COMPUTER SCIENCE AND ENGINEERING 2013-14
UNIT- V
Web Services Interoperability – Means of ensuring Interoperability,
Overview of .NET, Creating a .NET client for an Axis Web Service, creating
Java client for a Web service, Challenges in Web Services Interoperability.
Web Services Security – XML security frame work, Goals of Cryptography,
Digital signature, Digital Certificate, XML Encryption.
TEXT BOOK:
1. Developing Java Web Services, R. Nagappan, R. Skoczylas, R.P.
Sriganesh, Wiley India.
REFERENCE BOOKS:
1. Java Web Service Architecture, James McGovern, Sameer Tyagi et
al., Elsevier
2. Building Web Services with Java, 2nd Edition, S. Graham and others,
Pearson Edn.
3. Java Web Services, D.A. Chappell & T. Jewell, O’Reilly,SPD.
4. Web Services, G. Alonso, F. Casati and others, Springer.
Outcomes:
Basic details of WSDL, UDDI, SOAP
Implement WS client and server with interoperable systems
193 COMPUTER SCIENCE AND ENGINEERING 2013-14
TEXT BOOKS:
1. Thinking on the Web - Berners Lee, Godel and Turing, W iley
interscience,2008.
2. Social Networks and the Semantic Web, Peter Mika,Springer,2007.
REFERENCE BOOKS:
1. Semantic Web Technologies, Trends and Research in Ontology
Based Systems, J.Davies, Rudi Studer, Paul Warren, John Wiley &
Sons.
2. Semantic Web and Semantic Web Services -Liyang Lu Chapman
and Hall/CRC Publishers,(Taylor & Francis Group)
3. Information Sharing on the semantic Web - Heiner Stuckenschmidt;
Frank Van Harmelen, Springer Publications.
4. Programming the Semantic W eb, T.Segaran, C.Evans,
J.Taylor,O’Reilly, SPD.
Outcomes:
Ability to understand and knowledge representation for the semantic
web.
Ability to create ontology.
Ability to build a blogs and social networks.
195 COMPUTER SCIENCE AND ENGINEERING 2013-14
Examples, Publish your flash movie, Creating special effects with Flash,
Creating a website splash screen, action script, web sources.
Rich Internet Applications(RIAs) with Flex 3 - Introduction, Developing
with Flex 3, Working with Components, Advanced Component Development,
Visual Effects and Multimedia,
UNIT - V
Ajax- Enabled Rich Internet Application : Introduction, Traditional Web
Applications vs Ajax Applications, Rich Internet Application with Ajax, History
of Ajax, Raw Ajax example using xmlhttprequest object, Using XML, Creating
a full scale Ajax Enabled application, Dojo ToolKit.
TEXT BOOKS:
1. Fundamentals of Multimedia by Ze-Nian Li and Mark S. Drew PHI
Learning, 2004
2. Professional Adobe Flex 3, Joseph Balderson, Peter Ent, et al, Wrox
Publications, Wiley India, 2009.
3. AJAX, Rich Internet Applications, and W eb Development for
Programmers, Paul J Deitel and Harvey M Deitel, Deitel Developer
Series, Pearson Education.
REFERENCE BOOKS:
1. Multimedia Communications: Applications, Networks, Protocols and
Standards, Fred Halsall, Pearson Education, 2001, rp 2005.
2. Multimedia Making it work, Tay Vaughan, 7th edition, TMH, 2008.
3. Introduction to multimedia communications and Applications,
Middleware, Networks, K.R.Rao, Zoran, Dragored, Wiley India, 2006,
rp. 2009.
4. Multimedia Computing, Communications & Applications, Ralf
Steinmetz and Klara Nahrstedt, Pearson Education, 2004
5. Principles of Multimedia, Ranjan Parekh, TMH, 2006.
6. Multimedia in Action, James E.Shuman, Cengage Learning, 198, rp
2008.
7. Multimedia Systems design, Prabhat K. Andleigh, Kiran Thakrar, PHI,
1986.
8. Multimedia and Communications Technology, Steve Heath, Elsevier,
1999, rp 2003.
9. Adobe Flash CS3 Professional, Adobe press, Pearson Education,
2007.
10. Flash CS3 Professional Advanced, Russel Chun, Pearson Education,
2007.
199 COMPUTER SCIENCE AND ENGINEERING 2013-14
TEXT BOOKS:
1. Ad Hoc and Sensor Networks – Theory and Applications, Carlos
Corderio Dharma P.Aggarwal, W orld Scientific Publications /
Cambridge University Press, March 2006
2. W ireless Sensor Networks: An Information Processing Approach,
Feng Zhao, Leonidas Guibas, Elsevier Science imprint, Morgan
Kauffman Publishers, 2005, rp2009.
REFERENCE BOOKS:
1. Adhoc Wireless Networks – Architectures and Protocols, C.Siva Ram
Murthy, B.S.Murthy, Pearson Education, 2004
2. Wireless Sensor Networks – Principles and Practice, Fei Hu, Xiaojun
Cao, An Auerbach book, CRC Press, Taylor & Francis Group, 2010
3. Wireless Ad hoc Mobile Wireless Networks – Principles, Protocols
and Applications, Subir Kumar Sarkar, et al., Auerbach Publications,
Taylor & Francis Group, 2008.
4. Ad hoc Networking, Charles E.Perkins, Pearson Education, 2001.
5. Wireless Ad hoc Networking, Shih-Lin Wu, Yu-Chee Tseng, Auerbach
Publications, Taylor & Francis Group, 2007
6. Wireless Ad hoc and Sensor Networks – Protocols, Performance and
Control, Jagannathan Sarangapani, CRC Press, Taylor & Francis
Group, 2007, rp 2010.
7. Security in Ad hoc and Sensor Networks, Raheem Beyah, et al., World
Scientific Publications / Cambridge University Press, 2010
8. Ad hoc Wireless Networks – A communication-theoretic perspective,
Ozan K.Tonguz, Gialuigi Ferrari, Wiley India, 2006, rp2009.
9. Wireless Sensor Networks – Signal processing and communications
perspectives, Ananthram Swami, et al., Wiley India, 2007, rp2009.
Outcomes:
Ability to understand the concept of ad-hoc and sensor networks.
Ability to design and implement sensor network protocols.
Ability to set up and evaluate measurements of protocol performance
in sensor networks..
202 COMPUTER SCIENCE AND ENGINEERING 2013-14
Model for the Protection of New Generation Database Systems: the Orion
Model Jajodia and Kogan’s Model A Model for the Protection of Active
Databases Conclusions
TEXT BOOKS:
1. Database Security by Castano Pearson Edition (1/e)
2. Database Security and Auditing: Protecting Data Integrity and
Accessibility, 1st Edition, Hassan Afyouni, THOMSON Edition.
REFERENCE BOOK:
1. Database security by alfred basta, melissa zgola, CENGAGE learning.
Outcomes:
Ability to carry out a risk analysis for large database.
Ability to set up, and maintain the accounts with privileges and roles.
206 COMPUTER SCIENCE AND ENGINEERING 2013-14