You are on page 1of 62


(Applicable for the batches admitted from 2011-2012)


Yenkapally, Moinabad Mandal, P.O.Himayath Nagar, R.R.Dist, Hyderabad-500 075 Fax&Phone No.910-8413-235753, Tel:08413-235755,201301 ;



Academic Regulations 2011 for B. Tech (Regular)
(Effective for the students admitted into I year from the Academic Year 2011-2012 onwards) 1. Award of B.Tech. Degree A student will be declared eligible for the award of the B. Tech. Degree if he fulfils the following academic regulations: i. Pursued a course of study for not less than four academic years and not more than eight academic years. ii. 2. 3. Register for 200 credits and secure 200 credits Students, who fail to fulfill all the academic requirements for the award of the degree within eight academic years from the year of their admission, shall forfeit their seat in B.Tech course. Courses of study The following courses of study are offered at present for specialization for the B. Tech. Course: Branch Code 01 02 03 04 05 11 12 25 4. Branch Civil Engineering Electrical and Electronics Engineering Mechanical Engineering Electronics and Communication Engineering. Computer Science and Engineering Bio-Medical Engineering Information Technology Mining Engineering from time to time.

and any other course as approved by the authorities of the JBIET Credits I Year Semester Periods / Credit Periods / Week s Week Theory 03 06 03 02 04 -Practical 03 04 03 Drawing 02T/03D 04 03 06 Mini ---Project Comprehen ---sive Viva Voce Seminar --6 Project --15

Credits 03 -02 02 04 02 02

02 10 2

5. Distribution and Weightage of Marks i. The performance of a student in each semester / I year shall be evaluated subject –wise with a maximum of 100 marks for theory and 75 marks for practical subject. In addition, Industry oriented mini-project, seminar and project work shall be evaluated for 50, 50 and 200 marks respectively. ii. For theory subjects the distribution shall be 25 marks for Internal Evaluation and 75 marks for the End-Examination. iii. For the subject having design and / or drawing, (such as Engineering Graphics, Engineering Drawing, Machine Drawing) and estimation, the distribution shall be 25 marks for internal evaluation (15 marks for day-to-day work and 10 marks for subjective paper) and 75 marks for end examination. There shall be two internal tests in a Semester and For theory subjects, the distribution shall be 25 marks for internal evaluation ( Midterm exams (20marks) + Assignment (5marks))and 75 marks for end examination. There shall be altogether four assignments (Each assignment consisting of 6 questions from every two units of syllabus)set by the teacher from the whole syllabus of the subject The pattern of question paper shall consist of two parts namely Part-A and Part-B out of which the candidate has to answer Part-A compulsorily and from Part-B, the candidate has to answer three questions out of five questions given. The Part-A i.e. question no.1 consists of sub questions, which are based on fundamentals and concept testing nature. These questions may of the following type: a. Short answer questions for which answer is two to three sentences b. Multiple choice questions c. Fill in the blanks d. True/False type Any sub question may carry a max. of 1 or 2 marks. Altogether candidate has to answer 4 questions out of 6 questions but question no.1 of Part-A is compulsory. The time allocated for the mid term examination is 2hours only. There shall be 2 Mid Term Examinations( 1st Mid shall be from 1-4 Units and 2nd Mid shall be from 5-8 Units) The Internal Evaluation is for 25 marks (20 for Mid term Examination and 5 Marks for Assignment), the average of these two shall be considered as the final marks for Internal Evaluation secured by the candidate. However, for first year, there shall be 3 mid term examinations (Each for 20 Marks) and 3 Assignments (Each for 5 Marks) , [1st mid shall be from 1-2 units, 2nd mid from 3-5 units and 3rd mid shall be from 6-8 units]. There shall be altogether six assignments (Each assignment consisting of 6 questions from every two units of syllabus)set by the teacher from the whole syllabus of the subject. The Internal Evaluation is for 25 marks (20 for Mid term Examination and 5 Marks for Assignment), the average of these three shall be considered as the final marks for Internal Evaluation secured by the candidate. The question paper shall contain 6 questions, 1 in Part-A and 5 in Part-B. The candidate shall have to answer Part-A compulsorily and shall have to answer any three questions from remaining five questions of Part-B. The Part-A i.e. question no.1 consists of sub questions, which are based on fundamentals and concept testing nature. These questions may of the following type: 3

and submit to the department. the supervisor of mini project and a senior faculty member of the department. There shall be a Comprehensive Viva-Voce in IV year II semester. The Internal 4 v. There shall be a seminar presentation in IV year II Semester. Out of a total of 200 marks for the project work. The evaluation of project work shall be conducted at the end of the IV year. day-to-day work in the laboratory shall be evaluated for 15 marks and internal examination for practical shall be evaluated for 10 marks conducted by the concerned laboratory teacher. Short answer questions for which answer is two to three sentences Multiple choice questions Fill in the blanks True/False type Any sub question may carry a max. which shall be evaluated by the Departmental committee consisting of Head of the department. There shall be no internal marks for industry oriented mini project. The Comprehensive Viva-Voce is evaluated for 100 marks by the Committee. which shall be evaluated for 50 marks. there shall be three tests and the average of the three mid term examinations will be taken into consideration. The external examiner shall be appointed by the Chief Controller of Examinations. 50 marks shall be for Internal Evaluation and 150 marks for the End Semester Examination. the student shall collect the information on a specialized topic and prepare a technical report. However. in collaboration with an industry of their specialization. The Comprehensive Viva-Voce is aimed to assess the students’ understanding in various subjects he / she studied during the B. There are no internal marks for the Comprehensive viva-voce. The committee consists of an external examiner. showing his understanding over the topic. The industry oriented mini project shall be submitted in report form and should be presented before the committee. Out of the 25 marks for internal. head of the department. In addition the project supervisor shall also be included in the committee. For practical subjects there shall be a continuous evaluation during the semester for 25 sessional marks and 50 end examination marks.a. For the subject having design and / or drawing.Tech course of study. the distribution shall be 25 marks for internal evaluation (15 marks for day-to-day work and 10 marks for subjective paper) and 75 marks for end examination. vii. The Comprehensive Viva-Voce will be conducted by a Committee consisting of (i) Head of the Department (ii) two Senior Faculty members of the Department. There shall be an industry-oriented mini-Project. Altogether candidate has to answer 4 questions out of 6 questions. c. ix. Engineering Drawing. the mini project and its report shall be evaluated with the project work in IV year II Semester. However in the I year class. to be taken up during the vacation after III year II Semester examination. The End Semester Examination (viva-voce) shall be conducted by the same committee appointed for industry oriented mini project. (such as Engineering Graphics. Machine Drawing) and estimation. . seminar and project work shall be different from each other. iv. There shall be no external examination for seminar. The seminar report shall be evaluated for 50 marks. For the seminar. vi. viii. b. The end examination shall be conducted with external examiner and laboratory teacher. seminar supervisor and a senior faculty member. The topics for industry oriented mini project. d. of 1 or 2 marks. There shall be two internal tests in a Semester and average of the two shall be considered for the award of marks for internal tests.

6 i. 8. but absent at it or has failed in the end examination may appear for that subject at the supplementary examination. Two regular and two supplementary examinations of I year. a. 6. b. A stipulated fee shall be payable towards condonation of shortage of attendance. A student will not be promoted to the next semester unless he satisfies the attendance requirement of the present semester / I year.Evaluation shall be on the basis of two seminars given by each student on the topic of his project. Two regular and one supplementary examinations of II year I semester. They may seek re-admission for that semester / I year when offered next. whether the candidate takes the examinations or not. Course pattern: i. Condonation of shortage of attendance in aggregate up to 10% (65% and above and below 75%) in each semester or I year may be granted by the College Academic Committee. The entire course of study is of four academic years. One regular examination of III year I semester. Attendance Requirements: i. c. and one regular examination of II year I semester irrespective of whether the candidate takes the examination or not. as applicable. ii. The first year shall be on yearly pattern and the second. Students whose shortage of attendance is not condoned in any semester / I year are not eligible to take their end examination of that class and their registration shall stand cancelled. 5 iii. A student shall be deemed to have satisfied the minimum academic requirements and earned the credits allotted to each theory or practical design or drawing subject or project if he secures not less than 35% of marks in the end examination and a minimum of 40% of marks in the sum total of the internal evaluation and end examination taken together. A student shall be promoted from third year to fourth year only if he fulfils the academic requirements of total 62 credits from the following examinations. . Shortage of Attendance below 65% in aggregate shall in NO case be condoned. A student shall be promoted from II to III year only if he fulfils the academic requirement of 37credits from one regular and one supplementary examinations of I year.Tech course and their admission shall stand cancelled. Students who fail to earn 200 credits as indicated in the course structure within eight academic years from the year of their admission shall forfeit their seat in B. Minimum Academic Requirements: The following academic requirements have to be satisfied in addition to the attendance requirements mentioned in item no. A student shall register and put up minimum attendance in all 200 credits and earn the 200 credits. vi. ii. iv. A student eligible to appear for the end examination in a subject. third and fourth years on semester pattern. iv. A student shall be eligible to appear for College End examinations if he acquires a minimum of 75% of attendance in aggregate of all the subjects. iii. d. Marks obtained in all 200 credits shall be considered for the calculation of percentage of marks. v. ii. One regular and one supplementary examinations of II year II semester. v. 7.

“her”. “him”. whereas the academic regulations hold good with the regulations he was first admitted. Minimum Instruction Days: The minimum instruction days for each semester / I year shall be 90/180 clear instruction days. The JBIET 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 JBIET. “hers”. the decision of the JBIET is final. occur in the regulations. In the case of any doubt or ambiguity in the interpretation of the above rules. 9. *-*-* 6 . When a student is detained due to lack of credits / shortage of attendance he may be readmitted when the semester / year is offered after fulfilment of academic regulations. General: i. 12. Degree he shall be placed in one of the following four classes: Class Awarded First Class with Distinction First Class Second Class Pass Class % of marks to be secured 70% and above Below 70% but not less than 60% Below 60% but not less than 50% Below 50% but not less than 40% From the aggregate marks secured for the best 200 Credits. 11. ii. iii. The academic regulation should be read as a whole for the purpose of any interpretation. they include “she”. Tech. Where the words “he”. “his”. Award of Class: After a student has satisfied the requirements prescribed for the completion of the program and is eligible for the award of B. There shall be no branch transfers after the completion of admission process.iii. iv. (The marks in internal evaluation and end examination shall be shown separately in the marks memorandum) 10.

Four-year degree course (Regular) will hold good for B. Tech.Academic Regulations for B. Tech. Tech. 2. Tech. Degree he shall be placed in one of the following four classes: First Class with Distinction 70% and above From the aggregate First Class Below 70% but not less than 60% marks secured for Second Class Below 60% but not less than 50% 150 Credits. (Lateral Entry Scheme) 5. Program (Regular) for the award of the degree. The Students have to acquire 150 credits from II to IV year of B. 7 . The same attendance regulations are to be adopted as that of B.Tech. II year to IV year) (The marks in internal evaluation and end examination shall be shown separately in the marks memorandum) All other regulations as applicable for B. One regular examination of III year I semester. Tech. 4. shall forfeit their seat. who fail to fulfil the requirement for the award of the degree in 6 consecutive academic years from the year of admission. 3. (Regular). Students. One regular and one supplementary examinations of II year II semester. Award of Class: After a student has satisfied the requirements prescribed for the completion of the program and is eligible for the award of B. (Lateral Entry Scheme) (Effective for the students getting admitted into II year from the Academic Year 2011-2012 and onwards) 1. b. a. Register for 150 credits and secure 150 credits. Pass Class Below 50% but not less than 40% (i.e. Two regular and one supplementary examinations of II year I semester. c. Promotion Rule: A student shall be promoted from third year to fourth year only if he fulfils the academic requirements of 37 credits from the examinations. 6.

English Language Communication Skills Lab.B. IT Workshop / Engineering Workshop Total L 2 3 3 2 2 3* 2 17 T/P/D 1 1 1 3 3 3 3 3 18 C 4 6 6 4 4 6 4 4 4 4 4 50 II YEAR I SEMESTER Code 6753014 6753022 6753023 6753024 6753009 6753025 6753608 6753609 Subject Probability and Statistics Mathematical Foundations of Computer Science Data Structures through C++ Digital Logic Design Electronic Devices and Circuits Basic Electrical Engineering Electrical and Electronics Lab Data Structures Lab through C++ Total COURSE STRUCTURE L 3 3 4 4 4 3 21 T/P/D 1 1 1 1 1 3 3 11 C 3 3 4 4 4 3 2 2 25 II YEAR II SEMESTER Code 6754012 6754013 6754014 6754004 6754015 6754016 6754609 6754610 Subject Computer Organization Data Base Management Systems Object Oriented Programming Environmental studies Formal Languages and Automata Theory Design and Analysis of Algorithms Object Oriented Programming Lab Data Base Management Systems Lab Total COURSE STRUCTURE L 4 4 4 3 3 3 21 T/P/D 1 1 1 1 1 3 3 11 C 4 4 4 3 3 3 2 2 25 8 . TECH.J. Engineering Physics / Engineering Chemistry Lab. COMPUTER SCIENCE AND ENGINEERING I YEAR Code 6751001 6751002 6751008 6751004 6751005 6751006 6751007 6751616 6751617 6751618 6751619 COURSE STRUCTURE Subject English Mathematics .I Mathematical Methods Engineering Physics Engineering Chemistry Computer Programming & Data Structures Engineering Drawing Computer Programming Lab.INSTITUTE OF ENGINEERING & TECHNOLOGY (AUTONOMOUS) B.

INSTITUTE OF ENGINEERING & TECHNOLOGY (AUTONOMOUS) B. COMPUTER SCIENCE AND ENGINEERING III YEAR I SEMESTER Code Subject 6755025 Principles of programming Languages OPEN ELECTIVE 6755026 Operations Research 6755027 Intellectual Property Rights and Cyber Law 6755028 Computer Forensics 6755029 Software Engineering 6755030 Microprocessors & Interfacing 6755031 Operating Systems 6755032 Data Communication & Computer Networks 6755608 Microprocessors & Interfacing Lab 6755609 Computer Networks & Operating Systems Lab Total COURSE STRUCTURE L T/P/D C 4 1 4 3 1 3 3 3 4 4 21 1 1 1 3 3 11 3 3 4 4 2 2 25 III YEAR II SEMESTER Code Subject 6756028 Object Oriented Analysis and Design 6756029 VLSI Design 6756030 Network Security 6756031 Compiler Design 6756023 Managerial Economics and Financial Analysis 6756032 Web Technologies 6756609 Advanced English Communication Skills Lab 6756610 Web Technologies & Compiler Design Lab Total COURSE STRUCTURE L T/P/D C 4 4 3 1 3 3 1 3 4 1 4 4 1 4 3 1 3 3 2 3 2 21 11 25 IV YEAR I SEMESTER Code Subject 6757046 Linux Programming 6757047 Software Testing Methodologies 6757048 Data Warehousing and Data Mining 6757049 Computer Graphics ELECTIVE – I 6757050 Advanced Computer Architecture 6757051 Cloud Computing 6757052 Distributed Computing 6757053 Mobile Computing ELECTIVE – II 6757054 Design Patterns 6757055 Machine Learning 6757056 Soft Computing 6757057 Information Retrieval Systems 6757609 Linux Programming and Data Mining Lab 6757610 Case Tools & Software Testing Lab Total COURSE STRUCTURE L T/P/D C 4 1 4 4 1 4 4 4 3 1 3 3 1 3 3 1 3 21 3 3 11 2 2 25 9 .J. TECH.B.

J.INSTITUTE OF ENGINEERING & TECHNOLOGY (AUTONOMOUS) B. T-Tutorial L – Theory P – Practical/Drawing C – Credits 10 . COMPUTER SCIENCE AND ENGINEERING IV YEAR II SEMESTER COURSE STRUCTURE Code 6758007 6758035 6758036 6758037 6758038 6758039 6758040 6758041 6758042 6758617 6758618 6758619 6758620 Subject Management Science ELECTIVE III Web Services Semantic Web & Social Networks Scripting Languages Multimedia & Rich Internet Applications ELECTIVE – IV Adhoc & Sensors Networks Storage Area Networks Database Security Embedded Systems Industry Oriented Mini Project Seminar Project Work Comprehensive Viva Total L 3 3 T/P/D 1 C 3 3 3 1 3 9 6 15 23 2 2 10 2 25 Note : All End Examinations (Theory and Practical) are of three hours duration.B. TECH.

Control Structures – Statement Level. Noonan. guarded commands.2008. 2. type checking. Variables . overloaded sub-programs. Storage and Control. Programming Language Implementation – Compilation and Virtual Machines. named constants. 7. Ada 95 Concurrency: Subprogram level concurrency. UNIT III Data types: Introduction. denotational semantics and axiomatic semantics for common programming language features. Programming in Prolog. parse trees. D. monitors. Compound Statements. 2nd Edition. Assignment Statements. Bindings and Scope. parameter passing methods. static and dynamic scope. Programming Language Design Concepts. EBNF for common programming languages features. UNIT VII Exception handling : Exceptions. Programming domains. formal methods of describing syntax . REFERENCE BOOKS: 1. concepts of programming languages. Scope and lifetime of variable. 11 . Springer. Core Python Programming. object oriented programming in small talk. Scripting Language: Pragmatics. Case Study : Python – Values and Types. UNIT II Syntax and Semantics: general Problem of describing Syntax and Semantics.J. introductions to data abstraction. design issues. functional Programming . Pearson Education. Guide to Programming with Python. Patric Henry Winston and Paul Horn. Wiley dreamtech. LISP. 3. Key Concepts. ML.S. strong typing. ambiguous grammars. Separate Compilation. Java threads. design issues for functions user defined overloaded operators. 5th Edition. Variable. TEXT BOOKS: 1. UNIT VIII Functional Programming Languages: Introduction. UNIT IV Expressions and Statements: Arithmetic relational and Boolean expressions. record. Procedural Abstraction. massage passing. character. Design issues of subprograms and operations. Data Abstraction. 2008. co routines. C#. Language Evaluation Criteria. UNIT-V Subprograms and Blocks: Fundamentals of sub-programs. 2nd Edition.Louden. A.F. Programming Languages. rp-2007.BNF. Programming Languages. Thomson. Logic Programming Language : Introduction and overview of logic programming. influences on Language design. Michael Dawson. 2. C# threads.SPD. LISP. Clocksin. generic sub-programs. primitive.W. TMH. Selection. 5. Module Library.rp-2007. 2007. Thomson. Language categories. variable initialization.INSTITUTE OF ENGINEERING & TECHNOLOGY (AUTONOMOUS) III Year B. A. Chun. K. II Edition.Tech. design and implementation uses related to these types. Exception handler in Ada. pointer and reference types. exception Propagation. Concepts of Programming Languages Robert . 6. W. programming environments. Haskell.B.2003. concept of binding. C++ parameterized ADT. Sebesta 8/e. M. semaphores. C++ and Java.Lutz. Pearson Education. Programming Python. UNIT VI Abstract Data types: Abstractions and encapsulation. Programming Paradigms – Imperative. user defined. O’reilly. Short circuit evaluation mixed mode assignment. language examples. type compatibility. 4. attribute grammars. R. Object Oriented.B. Iteration. C++. parameters that are sub-program names. associative. Logic Programming. Watt. application of Functional Programming Languages and comparison of functional and imperative Languages. local referencing environments. 3rd Edition.& C. C. array. application of logic programming.E. fundamentals of FPL. Java. Names. Pearson Education. Unconditional Statements. union. CSE .Mellish.I Sem 6755025 L 4 T/P/D 1/-/C 4 PRINCIPLES OF PROGRAMMING LANGUAGES UNIT I Preliminary Concepts: Reasons for studying. basic elements of prolog. Tucker.

2007. “Operations Research”. Finding basic feasible solutions – Northwest corner rule.S.. K. Panneerselvam. 11. minimax (maximin) method of optimal strategies. value of the game.J. 7. rp2004. Cheema. Graphical solution of LPP. Models with deterministic demand – model (a) demand rate uniform and production rate infinite. UNIT IV Sequencing models. 8. UNIT VII Replacement Models. UNIT VI Games Theory.S. Hira. “Operations Research”. rp2007. two-phase method. rectangular game. J K Sharma. Traveling salesman problem and assignment problem. Formulation. F. cargo loading and Reliability problems.. Tata McGraw-Hill. Raju. 10. 3e”. TEXT BOOKS: 1. model (b) demand rate non-uniform and production rate infinite. Sankara Iyer. 4. Tamilarasi. least cost method and Vogel’s approximation method. “Operations Research”. HI-TECH. Simplex Method. 3e”. Linear Programming Problem – Formulation of LPP. Lieberman. UNIT II Transportation Problem. 2003.L. group replacement policy. “Operations Research”. Inventory costs. Tata McGraw-Hill. A.2nd edition.4th edition. Springer. Chand & co. 1979. Dynamic programming approach for Priority Management employment smoothening. Tata McGraw-Hill. 9. Replacement of Items that Deteriorate whose maintenance costs increase with time without change in the money value. rp2008. Kasana & K.D. S. 2002. ”Operations Research”. degeneracy and unbound solutions. Col.J. Operations Research. Hungarian method for optimal solution.. P. unbalanced Transportation problem. P. “Introduction to Operations Research – A Computer-Oriented Algorithmic Approach”. 6.Phillips. “Operations Research”.V. Artificial variables. Characteristics of dynamic programming. 3. H. A.W. Billy E.B. Natarajan. models and limitations of Operations Research. Kumar. Gillett.S. “Introductory Operations Research – Theory and applications”. scope. Solving unbalanced problem. Replacement of items that fail suddenly: individual replacement policy. dominance principle. 2. model (c) demand rate uniform and production rate finite. 5. 2005. UNIT V Dynamic programming. solution.Tech. Macmillan India Ltd. Problems and Solutions. Balasubramani. CSE .INSTITUTE OF ENGINEERING & TECHNOLOGY (AUTONOMOUS) III Year B. “Introduction to Operations Research – 8ed”.M. Formulation. Gupta and D. 2005.Solberg. “Operations Research.Winston.I Sem 6755026 L 3 T/P/D 1/-/C 3 OPERATIONS RESEARCH (OPEN ELECTIVEI) UNIT I Introduction to Operations Research: Basics definition. Pearson Education. J K Sharma. Operations Research. D. objectives. 12 .Wiley India.. Macmillan India Ltd. 2006. Stage Coach/Shortest Path. REFERENCE BOOKS: 1. G. Solution of games with saddle points. 2007. capital budgeting.Cengage Learning. N. Optimality test: the stepping stone method and MODI method. Competitive games. PHI-2e. Laxmi Publications Ltd. “Operations Research Theory & Applications . UNIT VIII Inventory models. saddle point. 2. UNIT III Assignment model. 2005.Ravindran. S. P. 2008. Solution of Sequencing Problem – Processing n Jobs through 2 Machines – Processing n Jobs through 3 Machines – Processing 2 Jobs through m machines – Processing n Jobs through m Machines. rp2005. Rectangular games without saddle point – mixed strategy for 2 X 2 games. big-M method. phases. Hillier. S.

Transfer Patentability – Design Patents – Double Patenting – Patent Searching – Patent Application Process – Prosecuting the Application. Post-registration Procedures.B. Second Edition by Vinod V. UNIT-V: Copyright Ownership. Intellectual Property Rights by Deborah E. UNIT-VII: Law of Patents. Copyright Protection for Computer Programs – Copyright Protection for Automated Databases – Copyright in the Electronic Age – The Digital Millenium Copyright Act – Recent Developments in Copyright Law – Terms of the Trade – Vessel Hull Protection – Semiconductor Chip Protection. Copyright Registartion Application – Deposit Materials – Application Process and Registration of Copyright – Searching Copyright Office Records – Obtaining Copyright Office Records and Deposit Materials – Copyright Notice. New Developments and International Patent Law Direct Infringement – Inducement to Infringe – Contributory Infringement – First Sale Doctrine – Claims Interpretation – Defenses to Infringement – Remedies for Infringement – Resolving an Infringement Dispute – Patent Infringement Litigation. Subject Matter Of Copyright. Managing Intellectual Property – The Strategic Imperative. UNIT-III: Inter Partes Proceedings.Docketing Critical Dates . TEXT BOOK: 1. REFERENCES: 1. Registration. Rights of Reproduction – Rights to Prepare Derivative works – Rights of Distribution – Rights to Perform the Work Publicly – Rights to Display the Work Publicly – Limitations on Exclusive Rights. New Developments in Trademark Law Inter Partes Proceedings – Infringement of Trademarks – Dilution of Trademarks – Related Trademark Claims. 2. Purpose and Function of Trademarks – Types of marks – Acquisition of Trademark Rights – Categories of marks – Trade names and Business names – protectable matter. Law of Trademarks. Rights Afforded by Copyright Law Foundations of Copyright Law – Originality of Material – Fixation of Material – Exclusions from Copyright Protection – Compilations.Agencies for IP Registration – International Treaties. Duration. and Patents by Richard Stim. and Derivative Works. UNIT-II: Trademark Registration Process. CSE . Affidavit of Continued Use – Affidavit of Incontestability – Renewal of Registrations – Docketing Requirements – Loss of Trademark Rights – Trademark Use and Compliance Policies – Trademark Policing and Maintenance .Examination Process . Trademark Maintenance. Protecting a Domain Name – Other Cyberspace Trademark issues.Use of Marks Owned by Third Parties – Transfer of Ownership or Rights in Trademarks. Semiconductor Chip Protection Act Elements of Infringement – Contributory Infringement and Vicarious Infringement – Defenses to Infringement – Infringement Actions – Remedies for Infringement.Tech. Bouchoux. Transfers. Post-issuance Actions. Selection and Evaluation of a mark . Collections. Sople. Term and Maintenance of Patents. New Developments in Patent Law – International Patent Protection – Paris Convention – Patent Cooperation Treaty – Agreement on Trade Related Aspects of Intellectual Property Rights – Patent Law Treaty. Ownership. Cengage Learning. and Searching Copyright Ownership Issues – Joint works – Ownership in Derivative works – Works Made for hire – Transfers of Copyright – Termination of Transfers of Copyright – Duration of Copyright. Transfer of Rights to Marks Preparing and Filing the Application .INSTITUTE OF ENGINEERING & TECHNOLOGY (AUTONOMOUS) III Year B. UNIT-IV : Law of Copyright. Patent Searches. Infringement.Post-examination Procedure –Registration.I Sem 6755027 L 3 T/P/D 1/-/C 3 INTELLECTUAL PROPERTY RIGHTS AND CYBER LAW (OPEN ELECTIVE) UNIT-I : Introduction to Intellectual Property. Intellectual Property – Copyrights. Dilution. UNIT-VIII: Patent Infringement.Trademark search. Trademark Selection & Searching IP Law – Types of IP . New Developments in Copyright Law. Trademarks. PHI Learning Private Limited.J. Cengage Learning 13 . Ownership Rights – Sole and Joint Inventors – Disputes over Inventorship – Inventions Made by Employees and Independent Contractors – Assignment of Patent Rights – Licensing of Patent Rights – Invention Developers and Promoters. UNIT-VI: Copyright Infringement.

3. obtaing a digital hash. Springer International edition. investigating e-mail crimes and violations. Curtis W. exploring the roles of the client and server in e-mail. virtual machines. examining the honeynet project. A Tractitioneris Guide by Tony Sammes and Brian Jenkinson. Types of Law Enforcement – Computer Forensic Technology – Types of Business Computer Forensic Technology UNIT – II Computer Forensics Evidence and Capture: Data Recovery Defined – Data Back-up and Recovery – The Role of Back-up in Data Recovery – The Data-Recovery Solution Evidence Collection and Data Seizure: Why Collect Evidence? Collection Options – Obstacles – Types of Evidence – The Rules of Evidence – Volatile Evidence – General Procedure – Collection and Archiving – Methods of Collection – Artifacts – Collection Steps – Controlling Contamination: The Chain of Custody UNIT – III Duplication and Preservation of Digital Evidence: Preserving the Digital Crime Scene – Computer Evidence Processing Steps – Legal Aspects of Collecting and Preserving Computer Forensic Evidence Computer Image Verification and Authentication: Special Needs of Evidential Authentication – Practical Consideration – Practical Implementation UNIT – IV Computer Forensics analysis and validation: Determining what data to collect and analyze. Vacca. CSE . Computer Forensics Assistance to Human Resources/Employment Proceedings. CENGAGE Learning REFERENCE BOOKS: 1. Understanding whole disk encryption. validating forensic data. Homeland Security. UNIT – V Processing Crime and Incident Scenes: Identifying digital evidence. computer forensics software tools. TEXT BOOK: 1. Software Forensics Collecting Evidence from the Scene of a Digital Crime by Robert M. performing live acquisitions. preparing for a search. Computer Forensics Services. 5. Use of Computer Forensics in Law Enforcement. Brown. Steuart. Computer Forensics and Investigations by Nelson. reviewing a case UNIT – VI Current Computer Forensic tools: evaluating computer forensic tool needs. Firewall Media.INSTITUTE OF ENGINEERING & TECHNOLOGY (AUTONOMOUS) III Year B. computer forensics hardware tools. Firewall Media. Computer Evidence Collection & Presentation by Christopher L. Jones.T. Richard Bejtlich. exploring Microsoft File Structures. Computer Forensics. Computer Crime Investigation by John R. validating and testing forensics software UNIT – VII E-Mail Investigations: Exploring the role of e-mail in investigation. securing a computer incident or crime scene. performing remote acquisitions Network Forensics: Network forensics overview. processing law enforcement crime scenes. Phillips Enfinger.Wesley Pearson Education 2. Techniques & Technologies by Jesus Mena. storing digital evidence. 4.B. TMH 2005 6. Wiley India Edition. seizing digital evidence at the scene.I Sem 6755028 L 3 T/P/D 1/-/C 3 COMPUTER FORENSICS (OPEN ELECTIVE) UNIT – I Computer Forensics Fundamentals: What is Computer Forensics?. using specialized e-mail forensic tools Cell phone and mobile device forensics: Understanding mobile device forensics. 2. collecting evidence in private-sector incident scens. Steps taken by Computer Forensics Specialists Types of Computer Forensics Technology: Types of Military Computer Forensic Technology. developing standard procedures for network forensics. Benefits of Professional Forensics Methodology.Slade.Tech. Firewall Media. Addison. Forensic Compiling. Examinig NTFS disks. MS-DOS startup tasks. New Delhi. understanding e-mail servers. understanding acquisition procedures for cell phones and mobile devices. Microsoft startup tasks. addressing data-hiding techniques.J. Rose. Real Digital Forensics by Keith J. UNIT – VIII Working with Windows and DOS Systems: understanding file systems. windows registry. unsing network tools. 14 . Windows Forensics by Chad Steel.

Software Requirements: Functional and non-functional requirements. process assessment. Metrics for Design Model. The Capability Maturity Model Integration (CMMI).Tech.R.J. Process patterns. the art of Debugging. The Unified process. Frame work for Product metrics. Architectural styles and patterns. UNIT IV Design Engineering: Design process and Design quality. Software reliability. UNIT II Process models: The waterfall model. Springer International edition . Product metrics: Software Quality.Hans Van Vliet. mapping data flow into a software architecture. Diner Bjorner.CRC Press.Requirements.and Software Design. Risk refinement. interface analysis. Software Engineering2: Specification of systems and languages. D. Formal technical reviews. Metrics for testing. Requirements management.J. 15 . 8. Requirements elicitation and analysis. software risks. 7. Black-Box and White-Box testing. Data design. Roger S Pressman.A layered technology. McGrawHill International Edition. 9. sixth edition. Software myths. Pearson education. A Generic view of process: Software engineering. 2006. Risk management: Reactive vs Proactive Risk strategies. Behavioral models. System testing. System models: Context Models. Design concepts.Yingxu Wang. assessing alternative architectural designs. UNIT VIII Quality Management: Quality concepts. the software requirements document.Auerbach Publications. User requirements. Diner Bjorner. Software Engineering1: Abstraction and modeling. Incremental process models. Risk projection. The ISO 9000 quality standards. Evolutionary process models. 5. Springer International edition. Object models. 10.Rajib Mall.John Wiley &Sons Ltd. Principles and Practices. legacy software. Validation testing.Deepak Jain.B. Software Reviews.INSTITUTE OF ENGINEERING & TECHNOLOGY (AUTONOMOUS) III Year B. Data models.Software Engineering :A practitioner’s Approach. System requirements. Tata McGraw-Hill. Software Engineering 3:Domains. conducting component-level design.Leach. Fundamentals of Software Engineering. UNIT VI Testing Strategies: A strategic approach to software testing. RMMM. Software Engineering Principles and Practice.Oxford University Press. Metrics for Analysis Model.A Precise Approach.I Sem 6755029 L 3 T/P/D 1/-/C 3 SOFTWARE ENGINEERING UNIT I Introduction to Software Engineering: The evolving role of software. Metrics for source code.2008. Metrics for software quality. Bjorner. TEXT BOOKS: 1. Requirements validation. 2005 4.PHI. Waman S Jawadekar. REFERENCE BOOKS: 1. RMMM Plan. 6. Statistical Software quality Assurance.2004. Introduction to Software Engineering. test strategies for conventional software. User interface analysis and design. Software Engineering. Risk identification. Architectural Design. Performing User interface design: Golden rules. Interface specification. designing conventional components. interface design steps. UNIT VII Metrics for Process and Products: Software Measurement. Design evaluation. Metrics for maintenance. Creating an architectural design: software architecture. 2006. 2. Object constraint language. a process framework. Changing Nature of Software.Wiley India.2010. seventh edition.3rd edition. Software Engineering : A Primer. Software Engineering Foundations.Software Engineering.Pankaj Jalote. Software quality assurance. UNIT V Modeling component-level design : Designing class-based components. the design model. Software Engineering. Springer International Edition. UNIT III Requirements engineering process: Feasibility studies. 2005 2. personal and team process models. pattern based software design. Ian Sommerville. 2008 3. structured methods. CSE . Specialized process models.

2007. Architecture of 8086 Microprocessor. Interfacing with 8237/8257. Assembler directives.Bhurchandi. Timing diagram. UNIT-V: Interrupt Control: Interrupt structure of 8086. Branch & Call instructions.K. Serial Communication control in 8051. 2007. Memory organization.I Sem 6755030 L 3 T/P/D 1/-/C 3 MICROPROCESSORS AND INTERFACING UNIT-I: 8 bit/ 16 bit Microprocessors: An over view of 8085.B. Micro Processors & Interfacing – Douglas V. Memory interfacing to 8086 (Static RAM & EPROM). N. sorting.Tech. Hardware and Applications –Walter. Vector interrupt table.Srinath. 3.K. Interfacing.J. Introduction to DOS and BIOS interrupts. IEEE 488 GPIB UNIT-VII: Introduction to Microcontrollers: Overview of 8051 microcontroller.Ray and K. Interrupt structure of 8051. Pearson.A. Need for DMA. Instruction set of 8086.INSTITUTE OF ENGINEERING & TECHNOLOGY (AUTONOMOUS) III Year B. Deshmukh. and macros UNIT-II: Assembly level programming: Assembly language programs involving logical. Interfacing Keyboard. The 8088 and 8086 Micro Processors: Programming. Addressing modes of 8086. Tata McGraw Hill. simple programs UNIT-VIII: Real time control: Timer/Counter operation in 8051. 2nd Ed. Memory and I/O interfacing of 8051 TEXT BOOKS: 1. 2000. UNIT-VI: Serial Communication control: Serial data transfer schemes. 8086 flag register and function of 8086 Flags. Interrupt service routines. 2. D/A and A/D converter interfacing. 2005. TTL to RS 232C and RS232C to TTL conversion. Architecture. I/O Ports. Micro Controllers – Ajay V. Avatar Singh. Displays. 16 . procedures. Software. string manipulation UNIT-III: Modes of operation in 8086: Pin diagram of 8086-Minimum mode and maximum mode of operation.By Liu and GA Gibson. DMA data transfer Method. evaluation of arithmetic expressions. Special functions of General purpose registers. Hall. UNIT-IV: I/O Interface: 8255 PPI – various modes of operation and interfacing to 8086. 8251 USART architecture and interfacing.. PHI. addressing modes and instruction set of 8051. Programming and Design . Triebel. 2. REFERENCES: 1. Stepper Motor and actuators. simple programs. TMH. Advanced microprocessor and Peripherals . 8259 PIC Architecture and interfacing cascading of interrupt controller and its importance. Micro Computer System 8086/8088 Family Architecture. CSE . Asynchronous and Synchronous data transfer schemes.M. Sample program of serial data transfer. A.

swap-space management. Disk structure. Operating Systems.3rd Edition.Process synchronization. semaphores. Operating System Concepts. Principles of Operating Systems . Peter B.File system structure. operating systems structures-operating system services and systems calls. special purpose systems.operating systems generation UNIT . Directory structure.VII Mass-storage structure. An Introduction to Operating Systems. Peterson’s Solution. File system mounting.Hardware. contiguous memory allocation. Operating systems.IV Memory Management .B.G. system and network threats cryptography as a security tool. computer –security classifications.Pearson Education. user authentication.Pearson education. classic problems of synchronization.Allocation of frames.Based systems.A Concept based Approach-D. Windows UNIT . B. UNIT . Andrew S Tanenbaum 2nd edition PHI. performance. case studies.II Process Management – Process concepts. protection. Synchronization examples. Windows UNIT . algorithms. Pearson education. Linux. 7.8th edition. UNIT . John Wiley. Stallings. File System implementation. kernel I/O subsystem. Goals of Protection. free-space management. case studies UNIX. directory implementation. Overview of computer operating systems. structure of the page table . threads.S.C.Mc Graw Hill.The Security problem.algorithms.Neogy. recovery form deadlock. allocation methods. UNIX. RAID structure.III Concurrency .Levine. A. Galvin.V Principles of deadlock – system model. 2.I Sem 6755031 L 4 T/P/D -/-/C 4 OPERATING SYSTEMS UNIT .2nd Edition. Revocation of Access Rights.S.L.J.the concept of a file. sixth Edition–2009. atomic transactions. stable-storage implementation. operating system structure.M. firewalling to protect systems and networks. deadlock characterization. disk attachment. Capability.INSTITUTE OF ENGINEERING & TECHNOLOGY (AUTONOMOUS) III Year B. R. scheduling-criteria.overview of Mass-storage structure.Haldar. Implementation of Access Matrix. Tertiary storage structure. virtual memory. 2nd Edition. Linux. case studies UNIX. Operating Systems.Operating systems functions. India Edition.G. Thread scheduling. P. Domain of protection Access Matrix. 17 .Chaki and S. 4. I/O systems. PHI. CSE . the critical.Aravind. distributed systems. Cengage learning. Windows UNIT . Linux.Operating Systems. detection and avoidance.section problem.Protection. STREAMS. their evaluation.Swapping. Bhatt.Nutt. TMH 5. synchronization Hardware. application I/o interface. Case studies UNIX.P. Greg Gagne. 2.A. Security.VIII Protection .Thrashing case studies UNIX. Windows TEXT BOOKS : 1. Principles of Protection.I Operating Systems Overview. 6. Transforming I/O requests to Hardware operations.A. deadlock 8.Dhamdhere. efficiency and performance.Abraham Silberchatz. file sharing. Operating Systems. Windows UNIT . segmentation.N. system programs. Operating Systems – Internals and Design Principles.Elmasri.Stuart.A. disk scheduling. TMH REFERENCES : 1. 3.Godbole. Linux. paging. Access Methods. program threats.Tech. Modern Operating Systems. demand paging. Linux. Access control. implementing security defenses.Carrick and D.VI File system Interface. Language – Based Protection. file system implementation. protection and security. monitors.

Fourth Edition by Behrouza A. Transmission Media. IPv4 Addresses. Network Layer: Adress Mapping.10th edition. Analog and Digital. Switching. Performance. Voice over IP TEXT BOOKS: 1. Virtual LANs. REFERENCE BOOKS: 1. Layered Tasks.Tanenbaum. Multiple Access.Singhal.B.P. SCTP. Multimedia. Virtual-Circuit Networks. Telnet.C. Layers in the OSI Model. Sonet Frames. Sonet Layers. Protocols. Frame Relay. Connecting Devices. Architecture.Introduction to Data communications and Networking. Circuit-Switched Networks. Name Space. ICMP.A. and Virtual LANs. Multiplexing.Pearson education. 5. Encapsulation. Point-to-Point Protocol. HDLC. Real-Time Interactive Audio/Video. IPv6. W. Multicast Routing Protocols UNIT – VI Transport Layer: Process-Process Delivery: UDP. Aloha.S. Web Documents. Checksum. Error Reporting and Multicasting. Rmote Logging. Block Coding. TCP/IP Protocol Suite. Spread Spectrum. Using Telephone and Cable Networks for Data Transmission.James F. Data communications and computer Networks. 18 . Forouzan.Hura and M. Network Layer: Delivery.W. Cable TV for Data Transfer UNIT – III Error Detection and Correction. Framing.J. Address Mapping. Protocols and Standards.Peterson and B. An Engineering Approach to Computer Networks-S. Registrars.CRC Press. DNS in the Internet. Quality Service. IEEE 802.Dennis. Analog-to-analog Conversion UNIT – II Bandwidth utilization: Multiplexing and Spreading. User Datagram Protocol (UDP).Wiley India. Process-to-Process Delivery. Network Management System.3rd Edition. Electronic Mail and File Transfer. Techniques to improve QoS. Noiseless Channels. Sonet/SDH.Fitzgerald and A.PHI. 4. 7.J. Digital Signals. Introduction. Dynamic Domain Name System (DDNS).V Network Layer: Logical Addressing. IPv4. Digital-to-analog Conversion. RTCP.4th edition. IPv6 Addresses. Internetworking. Flow and Error Control. IEEE Standards. Computer Networks. QoS in Switched Networks UNIT – VII Application Layer: Domain Name System. Two Examples. Fundamentals of Business Data Communications. Data Link Control. Distribution of Name Space. Guided Media. VirtualCircuit Networks: Frame Relay and ATM.TMH.INSTITUTE OF ENGINEERING & TECHNOLOGY (AUTONOMOUS) III Year B. Periodic Analog Signals. Channelization. Virtual Tributaries. Network Models. Bluetooth UNIT – IV Connecting LANs. IGMP. CSE . Transmission impairment. Analogto-Digital Conversion. Simple Network Management Protocol (SNMP).S. Streaming Live Audio/Video. Differentiated Services. Data Communications and Networking. Addressing.3rd Edition. Digital Subscriber Line. Analog Transmission. Controlled Access. Cyclic Codes.Pearson education. Network Layer: Internet Protocol. Network Management: SNMP.I Sem 6755032 L 4 T/P/D 1/-/C 4 DATA COMMUNICATION AND COMPUTER NETWORKS UNIT – I Introduction: Data Communications. 8. ATM LANs UNIT . Changes in the Standard. Telephone Networks. RTP. HTTP. Random Access.Kurose. Gigabit Ethernet. Computer Networks.Tomasi. Fast Ethernet.S. Datagram Networks. ATM. Networks. Forwarding and Routing. Understanding communications and Networks.Tech. 2. Physical Layer and Media. The OSI Model. 6. Integrated Services. Digital Transmission. Standard Ethernet. Digital-to-Digital Conversion. Resolution. STS Multiplexing. Computer Networking: A Top-Down Approach Featuring the Internet. The Internet. Cellular Telephony. Unguided Media: Wireless. Congestion Control and Quality of Service. Cable TV Networks. Digitizing Audio and Video. Backbone Networks.L. Data and Computer Communications. Transition from IPv4 to IPv6. Data Traffic. Structure of a Switch.4th edition.W. 2.ELSEVIER.L. Congestion.Taylor and Francis Group. Forwarding.Davie. Audio and Video Compression. Streaming Stored Audio/Video. Types of Records. Dial-up Modems. DNS Messages. Data Rate Limits.Shay.Gupta.11. Unicast Routing Protocols. Delivery. 3. File Transfer UNIT – VIII WWW and HTTP: Architecture.2nd Edition.Pearson Education.A.G. Remote Logging. Satellite Networks. Congestion Control. ICMPv6. TCP. Pearson Education. Data and Signals.Ross.K. Sonet Networks. Electronic Mail.Cengage Learning. Backbone Networks. TCP and SCTP. Domain Name Space.Keshav. Liner Block Codes.

13. ramp. CSE . Write and execute an Assembly language Program (ALP) to 8086 processor to verify the password.segment display which is also interfaced to 8086.INSTITUTE OF ENGINEERING & TECHNOLOGY (AUTONOMOUS) III Year B. 4. Write and execute an Assembly language Program (ALP) to 8086 processor to add. 5. Write and execute an Assembly language Program (ALP) to 8086 processor to pick the median from the given array of numbers. Write and execute an Assembly language Program (ALP) to 8086 processor to reverse the given string and verify whether it is a palindrome. Write and execute an Assembly language Program (ALP) to 8086 processor to divide a 32 bit unsigned number by a 16 bit unsigned number.J. Interface DMA controller to 8086 and transfer bulk data from memory to I/O device. Interface an ADC to 8086 and generate step. Write and execute an Assembly language Program (ALP) to 8086 processor to call a delay subroutine and display the character on the LED display.Tech. 2.B. 1. triangle and square waveforms with different periods. Interface an 8 bit ADC to 8086 and generate digital output and store it in memory for the given square/ ramp/ triangle wave form inputs. 11. 14. Store the result in stack segment. Write and execute an Assembly language Program (ALP) to 8086 processor to find the length of a given string which terminates with a special character. Interface an 8086 microprocessor trainer kit to PC and establish a communication between them through RS 232. 3. 8. 19 . Write and execute an Assembly language Program (ALP) to 8086 processor to sort the given array of 32 bit numbers in ascending and descending order.I Sem 6755608 L 0 T/P/D /3/C 2 MICROPROCESSOR INTERFACING LAB Minimum of 12 experiments are to be conducted. Write and execute an Assembly language Program (ALP) to 8086 processor to insert or delete a character/ number from the given string. which displays “hello” on a LCD. Write an interrupt service routine to 8086 when ever there is an interrupt request on interrupt pin. 16. Interface a stepper motor to 8086 and operate it in clockwise and anti-clock wise by choosing variable step-size. 9. Store the result in extra segment. 12. 7. subtract and multiply two 16 bit unsigned numbers. 15. Interface a keypad to 8086 microprocessor and display the key number pressed on the 7. 6. 10.

20 . Part -B 1. CRC 16 and CRC CCIP . 2.J. Take a 64 bit playing text and encrypt the same using DES algorithm . Simulate MVT and MFT 4. Simulate all file allocation strategies a) Sequentialb) Indexed c) Linked 3. Simulate Paging Technique of memory management. Simulate the following CPU scheduling algorithms a) Round Robin b) SJF c) FCFS d) Priority 2. Obtain broadcast tree for it. Implement the data link layer framing methods such as character. 6.A 1.INSTITUTE OF ENGINEERING & TECHNOLOGY (AUTONOMOUS) III Year B. 4. Implement on a data set of characters the three CRC polynomials – CRC 12.Tech. Implement Dijkstra ‘s algorithm to compute the Shortest path thru a graph. Simulate Bankers Algorithm for Dead Lock Prevention 7. Write a program to break the above DES coding 8. Simulate all File Organization Techniques a) Single level directory b) Two level c) Hierarchical d) DAG 5.I Sem 6755609 L 0 T/P/D -/3/C 2 COMPUTER NETWORKS AND OPERATING SYSTEMS LAB Objective: • To Understand the functionalities of various layers of OSI model • To understand the operating System functionalities System/ Software Requirement • Intel based desktop PCs LAN CONNECTED with minimum of 166 MHZ or faster processor with atleast 64 MB RAM and 100 MB free disk space Part . Take an example subnet graph with weights indicating delay between nodes. … 8. Take an example subnet of hosts . 3.B. CSE . 7. Simulate Bankers Algorithm for Dead Lock Avoidance 6. Simulate all page replacement algorithms a) FIFO b) LRU c) LFU Etc. character stuffing and bit stuffing. Now obtain Routing table art each node using distance vector routing algorithm 5. Using RSA algorithm Encrypt a text data and Decrypt the same .

state machines. WILEY-Dreamtech India Pvt. Learning UML 2. 8. Cengage Learning. REFERENCE BOOKS: 1. concepts.Elsevier. OODesign with UML and Java.C.Universities Press. Architecture. The McGraw-Hill Companies. Component diagrams and Deployment diagrams. UNIT .B.K. 9. Deployment. 2.TMH. object oriented modeling. Object Oriented Analysis.Dathan.Russ Miles and Kim Hamilton.Savage. time and space.J.Design and Implementation.J. Ltd.0. 4.VIII Case Study : The Unified Library application.Dreamtech India Pvt. 3. Craig Larman. Meilir Page-Jones: Fundamentals of Object Oriented Design in UML. Pearson Education. Satzinger. Packages.Tech. Hans-Erik Eriksson. Types and Roles. advanced relationships. UNIT . 7. conceptual model of the UML. CSE -II Sem 6756028 L 4 T/P/D -/-/C 4 OBJECT ORIENTED ANALYSIS AND DESIGN UNIT . Object-Oriented Analysis and Design with the Unified Process By John W. Grady Booch. and W. modeling techniques for Class & Object Diagrams.IV Basic Behavioral Modeling-I : Interactions. Advanced Structural Modeling : Advanced classes. Brian Lyons. principles of modeling. WILEY. Interfaces. common Mechanisms.I Introduction to UML : Importance of modeling.Lee. Pascal Roques: Modeling Software Systems Using UML2. Mark Priestley: Practical Object-Oriented Design with UML. 2.Tepfenhart. UML and C++. Pearson Education. Software Development Life Cycle.II Basic Structural Modeling : Classes.PHI. David Fado: UML 2 Toolkit.SPD.Barclay. UNIT. Atul Kahate: Object Oriented Analysis & Design. Activity Diagrams. Use case Diagrams. Ltd. state chart diagrams. 10. processes and Threads.VI Advanced Behavioral Modeling : Events and signals. UNIT . Robert B Jackson and Stephen D Burd. Appling UML and Patterns: An introduction to Object – Oriented Analysis and Design and Unified Process.V Basic Behavioral Modeling-II : Use cases. 6. 5. Pearson Education.O’Reilly. UNIT-VII Architectural Modeling : Component. Interaction diagrams. 21 .III Class & Object Diagrams : Terms. Relationships. James Rumbaugh. UNIT .R. TEXT BOOKS : 1.Ramnath.M.B. UNIT .S. Ivar Jacobson : The Unified Modeling Language User Guide. and diagrams. Magnus Penker.INSTITUTE OF ENGINEERING & TECHNOLOGY (AUTONOMOUS) III Year B.

III Year B.Tech. CSE -II Sem 6756029 L T/P/D C 3 1/-/- 3

Unit I Introduction: Introduction to IC Technology – MOS, PMOS, NMOS, CMOS & BiCMOS Technologies; Oxidation, Lithography, Diffusion, Ion implantation, Metallization, Encapsulation, Probe testing, Integrated Resistors and Capacitors, CMOS Nanotechnology Unit II Basic Electrical Properties: Basic Electrical Properties of MOS and BiCMOS Circuits: Ids-Vds relationships, MOS transistor threshold Voltage, gm, gds, Figure of merit ωo; Pass transistor, NMOS Inverter, Various pull ups, CMOS Inverter analysis and design, Bi-CMOS Inverters. Unit III VLSI Circuit Design Processes: VLSI Design Flow, MOS Layers, Stick Diagrams, Design Rules and Layout, 2 μm CMOS Design rules for wires, Contacts and Transistors Layout Diagrams for NMOS and CMOS Inverters and Gates, Scaling of MOS circuits. Unit IV Gate Level Design: Logic Gates and Other complex gates, Switch logic, Alternate gate circuits, Time delays, Driving large capacitive loads, Wiring capacitance, Fan – in, Fan – out, Choice of layers. Unit V: Data Path Subsystems: Subsystem Design, Shifters, Adders, ALUs, Multipliers, Parity generators, Comparators, Zero/One Detectors, Counters. Unit VI: Array Subsystems: SRAM, DRAM, ROM, Serial Access Memories, Content Addressable Memory. Unit VII: Semiconductor Integrated Circuit Design: PLAs, FPGAs, CPLDs, Standard Cells, Programmable Array Logic, Design Approach, Parameters influencing low power design. Unit VIII CMOS Testing: CMOS Testing, Need for testing, Test Principles, Design Strategies for test, Chip level Test Techniques, System-level Test Techniques, Layout Design for improved Testability.

TEXT BOOKS: 1. Essentials of VLSI circuits and systems – Kamran Eshraghian, Eshraghian Dougles and A. Pucknell, PHI, 2005 Edition 2. VLSI Desing- K .Lal Kishore, V. S. V. Prabhakar, I.K International, 2009. 3. CMOS VLSI Design – A circuits and systems perspective, Neil H. E Weste, David Harris, Ayan Banerjee, pearson, 2009. REFERENCES: 1. CMOS logic circuit Design - John .P. Uyemura, Springer, 2007. 2. Modern VLSI Design - Wayne Wolf, Pearson Education, 3rd Edition, 1997. 3. VLSI Design – A.Albert Raj, Latha, PHI, 2008 4. Introduction to VLSI – Mead & Convey, BS Publications, 2010 5. VLSI Design – M. Micheal Vai, CRC Press, 2009.


III Year B.Tech. CSE -II Sem 6756030 L 3 T/P/D 1/-/C 3

UNIT - I Security Attacks (Interruption, Interception, Modification and Fabrication), Security Services (Confidentiality, Authentication, Integrity, Nonrepudiation, access Control and Availability) and Mechanisms, A model for Internetwork security, Internet Standards and RFCs, Buffer overflow & format string vulnerabilities, TCP session hijacking, ARP attacks, route table modification, UDP hijacking, and man-in-the-middle attacks. UNIT - II Conventional Encryption Principles, Conventional encryption algorithms, cipher block modes of operation, location of encryption devices, key distribution Approaches of Message Authentication, Secure Hash Functions and HMAC. UNIT - III Public key cryptography principles, public key cryptography algorithms, digital signatures, digital Certificates, Certificate Authority and key management Kerberos, X.509 Directory Authentication Service. UNIT - IV Email privacy: Pretty Good Privacy (PGP) and S/MIME. UNIT - V IP Security Overview, IP Security Architecture, Authentication Header, Encapsulating Security Payload, Combining Security Associations and Key Management. UNIT - VI Web Security Requirements, Secure Socket Layer (SSL) and Transport Layer Security (TLS), Secure Electronic Transaction (SET). UNIT - VII Basic concepts of SNMP, SNMPv1 Community facility and SNMPv3. Intruders, Viruses and related threats. UNIT - VIII Firewall Design principles, Trusted Systems. Intrusion Detection Systems. TEXT BOOKS : 1. Network Security Essentials (Applications and Standards) by William Stallings Pearson Education. 2. Hack Proofing your network by Ryan Russell, Dan Kaminsky, Rain Forest Puppy, Joe Grand, David Ahmad, Hal Flynn Ido Dubrawsky, Steve W.Manzuik and Ryan Permeh, Wiley Dreamtech REFERENCES : 1. Network Security and Cryptography: Bernard Menezes, CENGAGE Learning. 2. Network Security - Private Communication in a Public World by Charlie Kaufman, Radia Perlman and Mike Speciner, Pearson/PHI. 3. Cryptography and network Security, Third edition, Stallings, PHI/Pearson 4. Principles of Information Security, Whitman, Cengage Learning. 5. Cryptography and network Security,B.A.Forouzan,D.Mukhopadhyay,2nd edition,TMH. 6. Introduction to Cryptography, Buchmann, Springer. 7. Fundamentals of Network Security by Eric Maiwald (Dreamtech press) 8. Information Systems Security,Godbole,Wiley Student Edition. 9. Network Security: The complete reference, Robert Bragg, Mark Rhodes, TMH


III Year B.Tech. CSE -II Sem 6756031 L 4 T/P/D 1/-/C 4

UNIT – I Overview of Compilation: Phases of Compilation – Lexical Analysis, Regular Grammar and regular expression for common programming language features, pass and Phases of translation, interpretation, bootstrapping, data structures in compilation – LEX lexical analyzer generator. UNIT – II Top down Parsing : Context free grammars, Top down parsing – Backtracking, LL (1), recursive descent parsing, Predictive parsing, Preprocessing steps required for predictive parsing. UNIT – III Bottom up parsing : Shift Reduce parsing, LR and LALR parsing, Error recovery in parsing , handling ambiguous grammar, YACC – automatic parser generator. UNIT – IV Semantic analysis : Intermediate forms of source Programs – abstract syntax tree, polish notation and three address codes. Attributed grammars, Syntax directed translation, Conversion of popular Programming languages language Constructs into Intermediate code forms, Type checker. UNIT – V Symbol Tables : Symbol table format, organization for block structures languages, hashing, tree structures representation of scope information. Block structures and non block structure storage allocation: static, Runtime stack and heap storage allocation, storage allocation for arrays, strings and records.

UNIT – VI Code optimization : Consideration for Optimization, Scope of Optimization, local optimization, loop optimization, frequency reduction, folding, DAG representation. UNIT – VII Data flow analysis : Flow graph, data flow equation, global optimization, redundant sub expression elimination, Induction variable elements, Live variable analysis, Copy propagation. UNIT – VIII 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. REFERENCES : 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.


Accounting Rate of Return (ARR) and Net Present Value Method (simple problems) Unit VII Introduction to Financial Accounting: Double-Entry Book Keeping.II Sem 6756023 L 4 T/P/D 1/-/C 4 MANAGERIAL ECONOMICS AND FINANCIAL ANALYSIS Unit I Introduction to Managerial Economics: Definition. Peak Load Pricing. 2009. Bundling Pricing. 5. P/E Ratio and EPS). 2.Final Accounts (Trading Account.Managerial Significance and limitations of BEA. statistical methods. Sealed Bid Pricing. Nature and scope of capital budgeting. Block Pricing. Capital structure Ratios (Debt. V. 25 . Types. Opportunity cost. Vikas. Unit VIII Financial Analysis through ratios: Computation.Lalitha. Aryasri: Managerial Economics and Financial Analysis. Limit Pricing. 7. and Profitability ratios (Gross Profit Ratio. Cengage. Machmillan. Law of Demand and its exceptions. 4. Least Cost Combination of Inputs. Journal. Vikas. TEXT BOOKS: 1. Fixed vs.Tech. Variable costs. Internal and External Economies of Scale. Factors governing demand forecasting. Truet and Truet: Managerial Economics:Analysis. Out of pocket costs vs. 10. Two-Part Pricing. Pearson Education. Financial Accounting. Unit IV Introduction to Markets & Pricing Policies: Market structures: Types of competition. 3.B. features of capital budgeting proposals.Kasi Reddy. 8. Wiley. test marketing. 2007. Sultan Chand. CSE . Question Paper Pattern: 5 Questions to be answered out of 8 questions . REFERENCES: 1. Operating Profit Ratio. Maheswari. Imputed costs. Methods of Capital Budgeting: Payback Method.Rajasekarn & R. Changing Business Environment in Post-liberalization scenario. Financial Accounting for Management. Unit VI Capital and Capital Budgeting: Capital and its significance. Measurement and Significance of Elasticity of Demand. Managerial Economics. Problems and Cases. Methods and sources of raising finance.INSTITUTE OF ENGINEERING & TECHNOLOGY (AUTONOMOUS) III Year B. Cobb-Douglas Production function. Explicit costs Vs. Varshney & Maheswari: Managerial Economics. Features and evaluation of Sole Proprietorship. New Delhi. TMH. 2009. 9. methods of demand forecasting (survey methods. Objectives and Policies of Pricing. Demand Forecasting. Nature and Scope of Managerial Economics–Demand Analysis: Demand Determinants. Each question should not have more than 3 bits. Market Skimming Pricing. Going Rate Pricing. Codes/Tables: Present Value Tables need to be permitted into the examinations Hall.J. Prerequisites: Nil Objective: To explain the basic principles of managerial economics. Text & Cases.Equity ratio. S. Partnership. 6. Public Enterprises and their types. Joint Stock Company.Saraswathi: Managerial Economics and Financial Accounting. Domnick Salvatore: Managerial Economics in a Global Economy. 2009. Cross Subsidization. 2009. Analysis and Interpretation of Liquidity Ratios (Current Ratio and quick ratio). Unit V Business & New Economic Environment: Characteristic features of Business. 2008. Subhash Sharma & M P Vittal. 2009. Raghunatha Reddy & Narasimhachary: Managerial Economics& Financial Analysis. Price-Output Determination in case of Perfect Competition and Monopoly.Methods of Pricing: Cost Plus Pricing. M. Trial Balance.Out of eight questions 4 questions will be theory questions and 4 questions should be problems. Monopoly and Monopolistic Competition. judgmental approach to demand forecasting) Unit III Theory of Production and Cost Analysis: Production Function – Isoquants and Isocosts. 2007. Scitech. Net Profit ratio. Types of Capital. Profit and Loss Account and Balance Sheet with simple adjustments). Jaico. 2. 2010. Penetration Pricing. accounting and current business environment underlying business decision making.Maheswari & S. S. Features of Perfect competition. Ledger. PHI. Financial Accounting. Cost Analysis: Cost concepts. Laws of Returns. Break-even Analysis (BEA)-Determination of Break-Even Point (simple problems). Implicit costs. 2009.K. expert opinion method. 2009. Unit II Elasticity of Demand: Definition. 2008. Activity Ratios (Inventory turnover ratio and Debtor Turnover ratio). MRTS. Erich A. Helfert: Techniques of Financial Analysis. 4th Edition. Estimation of Fixed and Working capital requirements.N. Interest Coverage ratio). controlled experiments. Suma Damodaran. Oxford University Press. Dwivedi:Managerial Economics. Marginal Cost Pricing.

26 . Requests. XML Schemas. Security Issues. Studying Javax. Cascading Style sheets. The javax. Presenting XML. Using Cookies-Session Tracking. SPD 5. Dynamic HTML with Java Script UNIT-III: XML: Document type definition. JSP Application Design with MVC Setting Up and JSP Environment: Installing the Java Software Development Kit. BDK Introspection.Pearson 8. Objects in Java Script. Advantages of Java Beans. Reading Initialization parameters. The Anatomy of a JSP Page. 3. CSE . Web Programming. 3.List. building internet applications. Programming world wide web-Sebesta.Deploying JAVA Beans in a JSP Page.sql. An Introduction to web Design and Programming –Wang-Thomson 6. Introduction to struts framework. Using XML Processors: DOM and SAX UNIT-IV: Java Beans: Introduction to Java Beans. Java: the complete reference. TMH. Murach’s beginning JAVA JDK 5.6.B. Tomcat Server & Testing Tomcat UNIT-VII: JSP Application Development: Generating Dynamic Content. Bill Siggelkow. Murach. Java Beans API. TEXT BOOKS: 1.Accessing a Database from a JSP Page. forms. 10.J. Using Bound properties.Pearson 2.* package.INSTITUTE OF ENGINEERING & TECHNOLOGY (AUTONOMOUS) III Year B.. Pekowsky.Tech.II Sem 6756032 L 3 T/P/D 1/-/C 3 WEB TECHNOLOGIES UNIT-I: HTML Common tags. Constrained properties Persistence. Bean Info Interface. Application – Specific Database Actions. Internet and World Wide Web – How to program by Dietel and Nieto PHI/Pearson Education Asia.John Wiley 7. Herbert Schildt. Conditional Processing – Displaying Values Using an Expression to Set an Attribute. JSP Processing. Jakarta Struts Cookbook . Reading Servelet parameters. 7th editon. The Servelet API. S P D O’Reilly for chap 8.Chris Bates 2nd edition. Frames. Pearson.8) REFERENCE BOOKS: 1. Using Scripting Elements Implicit JSP Objects.servelet HTTP package. and Users Passing Control and Date between Pages – Sharing Session and Application Data – Memory Usage Considerations UNIT VIII: Database Access : Database Programming using JDBC. images. Web Warrior Guide to Web Programmming-Bai/Ekedaw-Thomas 9. JSDK. Programming world wide web-Sebesta. Handling Http Request & Responses. Web Applications Technologies Concepts-Knuckles.WILEY Dreamtech 2. Tables. Document Object model. UNIT-VI: Introduction to JSP: The Problem with Servelet. Core SERVLETS ANDJAVA SERVER PAGES VOLUME 1: CORE TECHNOLOGIES By Marty Hall and Larry Brown Pearson (UNITs 5. Beginning Web Programming-Jon Duckett WROX. 4.7. Introduction to EJB’s UNIT-V: Web Servers and Servlets: Tomcat web server. Introduction to Servelets: Lifecycle of a Serverlet. The javax. Declaring Variables and Methods Error Handling and Debugging Sharing Data Between JSP pages. Java Server Pages. Customizes.servelet Package. UNIT-II: Introduction to Java Scripts.

• Make oral presentations. • Further. Introduction The introduction of the English Language Lab is considered essential at 3rd year level. • Face interviews. 2. body language. • Engage in debates. guessing meanings from context.J. analogy. through a well-developed vocabulary and enable them to listen to English spoken at normal conversational speed by educated English speakers and respond appropriately in different socio-cultural and professional contexts. The proposed course should be an integrated theory and lab course to enable students to use ‘good’ English and perform the following: • Gather ideas and information. V.starting a conversation – responding appropriately and relevantly – using the right body language – role play in different situations.INSTITUTE OF ENGINEERING & TECHNOLOGY (AUTONOMOUS) III Year B. intervention.  Reading Comprehension – reading for facts. Syllabus: The following course content is prescribed for the Advanced Communication Skills Lab:  Functional English . word roots. a digital stereo –audio & video system and camcorder etc. At this stage the students need to prepare themselves for their careers which may require them to listen to. • To take part in social and professional communication.8 GHZ b. inferring meaning. read. they would be required to communicate their ideas relevantly and coherently in writing. Speed – 2. relevance. 3. idioms and phrases. interview through tele and video-conferencing. speak and write in English both for their professional and interpersonal communication in the globalised context.  Vocabulary Building – synonyms and antonyms.A System. System Requirement ( Hardware component): Computer network with Lan with minimum 60 multimedia systems with the following specifications: iii) P – IV Processor a. to organise ideas relevantly and coherently. opening strategies. Suggested Software: The software consisting of the prescribed topics elaborated above should be procured and used.  Interview Skills – concept and process. skimming.B. ii) The Communication Skills Lab with movable chairs and audio-visual aids with a P. 4. • Transfer information from non-verbal to verbal texts and vice versa. Minimum Requirement: The English Language Lab shall have two parts: i) The Computer aided Language Lab for 60 students with 60 systems. fluency and coherence. prefixes and suffixes. pre-interview planning. Critical reading. 7th Edition • DELTA’s key to the Next Generation TOEFL Test: Advanced Skill Practice. study of word origin. summarizing. a T. Objectives: This Lab focuses on using computer-aided multimedia instruction for language development to meet the following targets: • To improve the students’ fluency in English. • Write formal letters. 27 .  Presentation Skills – Oral presentations (individual and group) through JAM sessions/seminars and written presentations through posters/projects/reports/PPTs/e-mails/assignments etc.II Sem 6756609 L 0 T/P/D -/3/C 2 ADVANCED ENGLISH COMMUNICATION SKILLS LAB 1.. CSE . Hard Disk – 80 GB iv) Headphones of High quality 5. • Participate in group by learners. one master console. answering strategies. RAM – 512 MB Minimum c. scanning. • Write project/research reports/technical reports. one-word substitutes.  Writing Skills – structure and presentation of different types of writing – Resume writing / e-correspondence/Technical report writing/Portfolio writing – planning for writing – research abilities/data collection/organizing data/tools/analysis – improving one’s writing. Suggested Software: • Clarity Pronunciation Power – part II • Oxford Advanced Learner’s Compass.Tech. modulation of voice. LAN facility and English language software for self.  Group Discussion – dynamics of group discussion.

Job Hunting by Colm Downes. New Delhi. English for Technical Communication for Engineering Students.Lingua TOEFL CBT Insider. Dr G Natanam & Prof SA Sankaranarayanan. Oxford University Press 2009.. 28 . Himayatnagar. 6. USA. • • • DISTRIBUTION AND WEIGHTAGE OF MARKS: Advanced Communication Skills Lab Practicals: 1.  Decision making • English in Mind. AARCO & BARRONS. 2006. Books on TOEFL/GRE/GMAT/CAT/ IELTS by Barron’s/DELTA/Cambridge University Press. Cracking GRE by CLIFFS) The following software from ‘train2success. Aysha Vishwamohan. 2009.  Time Management  Team Building. English Language Communication : A Reader cum Lab Manual Dr A Ramakrishna Rao. Cambridge University Press 2008.  Telephone Skills.  Positive Thinking. Anuradha Publications. 2. 8. Of the 25 marks. 9.. there shall be a continuous evaluation during the year for 25 sessional marks and 50 End Examination marks. 2009. Technical Communication by Meenakshi Raman & Sangeeta Sharma. 3. 4. 12. Communication Skills by Leena Sen. Cambridge University Press 2008. Management Shapers Series by Universities Press(India)Pvt Ltd. JAICO Publishing House. For the English Language lab sessions. Cambridge 6. 15 marks shall be awarded for day-to-day work and 10 marks to be awarded by conducting Internal Lab Test(s). International English for Call Centres by Barry Tomalin and Suhashini Thomas. 2. PHI Learning Pvt Ltd. D. Handbook for Technical Writing by David A McMurrey & Joanne Buckely CENGAGE Learning 2008. 10. 11. Chennai 2008. Hyderabad 2008. Pearson Education 2011. Tata Mc Graw-Hil 2009. Advanced Communication Skills Laboratory Manual by Sudha Rani.  Interviewing’  Preparing for being Interviewed. Herbert Puchta and Jeff Stranks with Meredith Levy. Macmillan Publishers. The practical examinations for the English Language Laboratory practice shall be conducted as per the University norms prescribed for the core engineering practical sessions. English Vocabulary in Use series. Books Recommended: 1. The End Examination shall be conducted by the teacher concerned with the help of another member of the staff of the same department of the same institution. by Dreamtech TOEFL & GRE( KAPLAN. 7. 5. Master Public Speaking by Anne Nicholls.

Top frame : Logo and the college name and links to Home page.J. Stylusstudio .com/XMLSpy – free ] . BDK(Bean development kit) must be also be installed Week-1: Design the following static web pages required for an online book store web site. 29 .1 2) LOGIN PAGE: This page looks like below: Web Site Name Logo Home CSE ECE EEE CIVIL Login Registration Catalogue Cart Login : Password: Submit Reset 3) CATOLOGUE PAGE: The catalogue page should contain the details of all the books available in the web site in a table.INSTITUTE OF ENGINEERING & TECHNOLOGY (AUTONOMOUS) III Year B. JVM(Java virtual machine) must be installed on your system 7. Logo Home CSE ECE EEE CIVIL Login Registration Web Site Name Catalogue Cart Description of the Web Site Fig 1. Right frame: The pages to the links in the left frame must be loaded here.B. Registration page. 2. 1) HOME PAGE: The static home page must contain three frames. For e. CSE -II Sem 6756610 L 0 T/P/D -/3/C 2 WEB TECHNOLOGIES AND COMPILER DESIGN LAB Objective : To create a fully functional website with mvc architecture. Hardware and Software required : 1. The details should contain the following: 1.: When you click the link “CSE” the catalogue for CSE Books should be displayed in the Right frame. Catalogue page and Cart page (the description of these pages will be given below). etc. Author Name. Login page. which will display the catalogue of respective links. Snap shot of Cover Tomcat web server and Apache web server 4. XML editor like Altova Xml-spy [www.. To Develop an online Book store using we can sell books (Ex amazon . A web browser either IE or firefox 3.Tech. Left frame : At least four links for navigation. A working computer system with either Windows or Linux 2. A database either Mysql or Oracle 6.g. Initially this page contains description of the web site.Altova. 5.

Hindi.5 $40.3. Publisher. Tamil) 8) Address (text area) WEEK 3: VALIDATION: Write JavaScript to validate the following fields of the above registration page. Add to cart button.Russel Publication : Princeton hall Book : Java 2 Author : Watson Publication : BPB publications Book : HTML in 24 hours Author : Sam Peter Publication : Sam publication $ 63 Login Registration Book : XML Bible Author : Winston Publication : Wiely Catalogue Cart $ 40.5 $ 50 Note: Week 2 contains the remaining pages and their description.5 $ 35. The cart page should look like this: Web Site Name Logo Home Login Registration Catalogue CSE ECE EEE CIVIL Book name Java 2 XML bible Price $35. Telugu. 5. Price.5 $130.5 Quantity 2 1 Total amount - Cart Amount $70 $40. Week-2: 4) CART PAGE: The cart page contains the details about the books which are added to the cart. 30 . 4. Web Site Name Logo Home CSE ECE EEE CIVIL Book : AI Author : S.5 5) REGISTRATION PAGE: Create a “registration form “with the following fields 1) Name (Text field) 2) Password (password field) 3) E-mail id (text field) 4) Phone number (text field) 5) Sex (radio button) 6) Date of birth (3 select boxes) 7) Languages known (check boxes – English.

Name (Name should contains alphabets and the length should not be less than 6 characters).htm" class="hlink">HELP LINK</a> </b> </body> </html> <b class="headline">This is headline style bold</b> </BODY> </HTML> 2) Set a background image for both the page You can define the background image for the page like this: and single elements on the page. just like an ordinary background image in HTML. text-decoration:underline} </style> </HEAD> <BODY> <b>This is normal bold</b><br> Selector {cursor:value} For example: <html> <head> <style type="text/css"> . 2.).xlink {cursor:crosshair} . As background-repeat: repeat Tiles the image until the entire page is 4. For example: <HTML> <HEAD> <style type="text/css"> B. Week-4: Design a web page using CSS (Cascading Style Sheets) which includes the following: 1) Use different font. font-size:22px.headline {color:red. color etc.1. Phone number (Phone number should contain 10 digits only). in the body of your pages. you refer to these selectors to activate the styles. styles: In the style definition you define how each selector should work (font. BODY {background-image:url(myimage. E-mail id (should not contain any invalid and must follow the standard pattern name@domain. Note : You can also validate the login page with these parameters. font-family:arial.htm" class="xlink">CROSS LINK</a> <br> <a href="mypage.} 3) Control the repetition of the image with the background-repeat property. plain 31 . 3. Then.gif). Password (Password should not be less than 6 characters length).hlink{cursor:help} </style> </head> <body> <b> <a href="mypage.

z-index:3.htm" class="hlink">HELP LINK</a> </b> </body> </html> Week-5: Write an XML file which will display the Book information which includes the following: 1) Title of the book 2) Author Name 3) ISBN number 4) Publisher name 5) Edition 6) Price Write a Document Type Definition (DTD) to validate the above XML file. And the Author names column should be displayed in one color and should be capitalized and in bold. zindex:1">LAYER 2</div> LAYER 2 ON TOP: <div style="position:relative.4) Define styles for links as A:link A:visited A:active A:hover Example: <style type="text/css"> A:link {text-decoration: none} A:visited {text-decoration: none} A:active {text-decoration: none} A:hover {text-decoration: underline. font-size:50px. if it is false. zindex:4">LAYER 2</div> 6) Add a customized cursor: Selector {cursor:value} For example: <html> <head> <style type="text/css"> . The header of the table should be in color GREY. 32 .hlink{cursor:help} </style> </head> <body> <b> <a href="mypage. The shape of the area depends on the property shape. Display the XML file as follows.">LAYER 1</div> <div style="position:relative. Use your own colors for remaining columns. Use XML schemas XSL and CSS for the above purpose. top:-50. color:red. font-size:80px. Hint: You can use some xml editors like XML-spy Week-6: VISUAL BEANS: Create a simple visual bean with a area filled with a color. color:red. font-size:50px. left:5. left:5.xlink {cursor:crosshair} .">LAYER 1</div> <div style="position:relative.} </style> 5) Work with layers: For example: LAYER 1 ON TOP: <div style="position:relative. top:-50. If it is set to true then the shape of the area is Square and it is Circle. z-index:2. It should be valid syntactically. Note: Give at least for 4 books. The contents should be displayed in a table.htm" class="xlink">CROSS LINK</a> <br> <a href="mypage. color: red. font-size:80px.

Make sure that these ports are available i. 1) Week-9: Install a database(Mysql or Oracle).. Week-11: Create tables in the database which contain the details of items (books in our case like Book name . Create a table which should contain at least the following fields: name. Access the pages by using the urls : http://localhost:4040/rama/books.html (for Apache) Week-8: User Authentication : Assume four users user1. Modify your catalogue and cart JSP pages to achieve the above mentioned functionality using sessions. Here our interest is the selected items should be added to the old cart rather than a new cart. Quantity. The color should also be changed if we change the color in the “property window “. Modify your catalogue page (week 2)in such a way that you should connect to the database and extract data from the tables and display them in the catalogue page using JDBC.xml and access them in the servlet by using the getInitParameters() method. Week-12: HTTP is a stateless protocol. He may visit the catalogue again and select some more items. This can be achieved through the use of sessions. password. Compiler Design Lab Objective : • To provide an understanding of the language translation peculiarities by designing a complete translator for a mini language.user3 and user4 having the passwords pwd1.. Amount )) of each category. When the user logs out his session should get invalidated (by using the method session. 2) Access the above developed static web pages for books web site. Use init-parameters to do this. Week-10: Write a JSP which does the following job: Insert the details of the 3 or 4 users who register with the web site (week9) by using registration form. Read the user id and passwords entered in the Login form (week1) and authenticate with the values (user id and passwords ) available in the cookies. user-name and password match) you should welcome him by name(user-name) else you should display “ You are not an authenticated user “. Create a Cookie and add these four user id’s and passwords to this Cookie.pwd2. 1.e. 2. using these servers by putting the web pages developed in week1 and week-2 in the document root. If he is a valid user(i. Every user will have his own session which will be created after his successful login to the website. He can check the cart page for the selected items. Recommended Systems/Software Requirements: • Intel based desktop PC with minimum of 166 MHZ or faster processor with atleast 64 MB RAM and 100 MB free disk space 33 .user2. Experiment with various SQL queries. Multiple users can do the same thing at a time(i. email-id. Practice 'JDBC' connectivity.pwd3 and pwd4 respectively. Price. Store the user-names and passwords in the webinf. Week-7: Install TOMCAT web server and APACHE. Write a servelet for doing the following.invalidate() ). While installation assign port number 4040 to TOMCAT and 8080 to APACHE.e. no other process is using this port. Write a java program/servlet/JSP to connect to that database and extract data from the tables and display them.html (for tomcat) http://localhost:8080/books. whenever a new user clicks the submit button in the registration page (week2).e. Authenticate the user when he submits the login form using the user name and password from the database ( similar to week8 instead of cookies). Insert the details of the users who register with the web site. from different systems in the LAN using the ipaddress instead of localhost). Session is required to maintain the state. phone number(these should hold the data from the registration form)..The color of the area should be changed dynamically for every mouse click. The user may add some items to cart from the catalog page.

It has three distinct internal storage areas. a[t1]=3. t2=-(a[2]+t1*6)/(a[2]-t1). a[0]=1. 6.• C++ complier and JDK kit Consider the following mini Language. t3=99. Note also that you should worry about the scoping of names. the second is an area used for the storage of variables and the third is an area used 34 . t2=-25. referenced as a[0]. The syntax of the language is defined by the following BNF grammar: <program> ::= <block> <block> ::= { <variabledefinition> <slist> } | { <slist> } <variabledefinition> ::= int <vardeflist> .. you may restrict the length to some reasonable value. Design Predictive parser for the given language 4. Design a Lexical analyzer for the above language. t1=2. Convert the BNF rules into Yacc form and write code to generate abstract syntax tree. with a syntax looking vaguely like a simple C crossed with Pascal. The language has rudimentary support for 1-dimensional arrays. else { int t3.t2. used by the individual instructions as detailed below. 3. A simple program written in this language is: { int a[3]. if t2>5 then print(t2). Design LALR bottom up parser for the above language. It should also ignore comments. supporting a total of 17 instructions. Write program to generate machine code from the abstract syntax tree generated by the parser. Although the syntax specification states that identifiers can be arbitrarily long. flex or lex or other lexical analyzer generating tools. a[1] and a[2]. <slist> <statement> ::= <assignment> | <ifstatement> | <whilestatement> | <block> | <printstatement> | <empty> <assignment> ::= <identifier> = <expression> | <identifier> [ <expression> ] = <expression> <ifstatement> ::= if <bexpression> then <slist> else <slist> endif | if <bexpression> then <slist> endif <whilestatement> ::= while <bexpression> do <slist> enddo <printstatement> ::= print ( <expression> ) <expression> ::= <expression> <addingop> <term> | <term> | <addingop> <term> <bexpression> ::= <expression> <relop> <expression> <relop> ::= < | <= | == | >= | > | != <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 / *. /* this is a comment on 2 lines */ } endif } 1. tabs and newlines. print(-t1+t2*t3).*/) can be inserted. only operating on integer data. 5. The lexical analyzer should ignore redundant spaces. 2. a simple procedural high-level language. <vardeflist> ::= <vardec> | <vardec> . The following is a simple register-based machine. <vardeflist> <vardec> ::= <identifier> | <identifier> [ <constant> ] <slist> ::= <statement> | <statement> . The first is the set of 8 registers.t1. a[1]=2. The declaration int a[3] declares an array of three elements. Implement the lexical analyzer using JLex.. The following instruction set may be considered as target code.

L jumps to the instruction with the label L if the value in register R is greater than or equal to zero. as detailed below.L jumps to the instruction with the label L if the value in register R is zero.). leaving the result in register R. 35 . L specifies a numerical label (in the range 1 to 9999). Constant values are specified as an integer value. The instruction set is defined as follows: LOAD A. An indirect address is specified by an @ followed by a register. JEQ R. MUL A. JGE R. R3. JGT R. In the description of the individual instructions below. So. A specifies a constant value. etc.R subtracts the value specified by A from register R. STORE R. SUB A. optionally preceded by a minus sign. an A-type argument could have the form 4 (variable number 4). for example.R multiplies the value specified by A by register R. R5. r1.R adds the value specified by A to register R.R divides register R by the value specified by A.L jumps to the instruction with the label L if the value in register R is less than zero. instruction argument types are specified as follows : R specifies a register in the form R0. DIV A. STOP stops execution of the machine.L jumps to the instruction with the label L if the value in register R is less than or equal to zero.L jumps to the instruction with the label L if the value in register R is greater than zero. R1. R4. #4 (the constant value 4). R2. NEG R negates the value in register R.R loads the integer value specified by A into register R. 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. It can be tagged by a label. r4 (register 4) or @r4 (the contents of register 4 identifies the variable location to be accessed). V specifies a “variable location” (a variable number. JMP L causes an unconditional jump to the instruction with the label L. R6 or R7 (or r0.for the storage of program. JLE R. OUT R outputs the value in register R.V stores the value in register R to variable V. leaving the result in register R. The instructions can be preceded by a label. or a variable location pointed to by a register . preceded by a # symbol. JLT R.see below). All programs should terminate by executing a STOP instruction. JNE R. NOP is an instruction with no effect. leaving the result in register R. a variable location. a register or a variable location pointed to by a register (an indirect address). ADD A. leaving the result in register R. The numerical label can be used as the argument to a jump instruction.L jumps to the instruction with the label L if the value in register R is not zero.

Library functions. here documents. Filters. command substitution. Advanced Programming in the Unix environment. T. Unix system V APIs for messages. Unix System Programming using C++. UNIT . Inodes. 2. UNIT . addresses. exampleclient/server programs.S. Introduction to three types of IPC-message queues. raise . SPD. 6.S. functions.V Interprocess Communication : Introduction to IPC. 3. Process APIs. test command.Gilberg. abort. Unix system V APIs for semaphores. alarm. W. scripts. kill. Pearson Education. Text processing utilities and Backup utilities. waiting for a process. process control .Koretsky. Linux System Programming. PHI. 7. N. File Attributes.Chan. debugging shell scripts.A. unreliable signals. commands. file descriptors. process termination.(UNIT III to UNIT VIII) 2. arithmetic in shell. Networking commands. Robert Love. Unix Concepts and Applications. kernel support for files. pipes and input Redirection. 5. stream errors.Kernel support for shared memory. actions. the shell as a programming language. UNIT-VIII Sockets: Introduction to Sockets. process attributes.A.J. R. Cengage Learning. patterns.Forouzan and R. File System Structure. UNIT -VII Multithreaded Programming: Differences between threads and processes. semaphores and shared memory. Message Queues.2nd edition.3rd edition. awk – execution.IV Process – Process concept. Pearson Education.Pearson Education.R. Unix for programmers and users. operation. Pipes.R.Wrox. Thread Attributes. 4. Shared Memory. file name substitution. 3rd Edition. 4th Edition.II Working with the Bourne again shell(bash): Introduction. Wiley India Edition. Security by file permissions.Tech. TMH. interrupt processing. Unix and Shell programming.Stevens. applications.PHI.Matthew. King Ables.Kernel support for messages. FIFOs. Thread Synchronization with semaphores and with Mutexes. file and record locking. Threads and Lightweight Processes. Thread structure and uses. functions. POSIX Thread APIs. Socket Addresses. Unix Internals.I Sem 6757046 L 4 T/P/D 1/-/C 4 LINUX PROGRAMMING UNIT . UNIT . shell commands.Sarwar. Kernel support for signals. UNIT-VI Semaphores-Kernel support for semaphores. Process utilities.W.III Files: File Concept.Stones. semaphore and shared memory example.Vahalia. Signal function. shell variables. Signals– Introduction to signals.S. client/server example. file and directory management – Directory file APIs. quoting. fields and records. shell meta characters. using system commands in awk. the environment. 3. Creating Threads. File types. output redirection. 8. TEXT BOOKS: 1. Sumitabha Das. Example programs. pause. low level file access – File structure related system calls(File APIs). Unix system V APIs for shared memory. B. operation. sleep functions. Unix shell Programming.the standard I/O and formatted I/O in C.I Linux Utilities-File handling utilities. Signal generation and handling.M. REFERENCE BOOKS: 1. control structures. shell responsibilities. Unix The Text book.Pearson Education. 36 .Wood.Pearson Education. reliable signals. 4th Edition.R. CSE .process creation. 2nd Edition. Disk utilities.G. UNIT. Socket system calls for connection oriented protocol and connectionless protocol.B. running a shell script.INSTITUTE OF ENGINEERING & TECHNOLOGY (AUTONOMOUS) IV Year B. Kernel support for process. System calls. shell script examples.Kochan and P.U. Unix Network Programming . Beginning Linux Programming. Graham Glass. sed – scripts.F. zombie process. Symbolic links & hard links.Stevens. orphan process. O’Reilly.Sarwar.

Software Testing Tools – Dr. Effective methods of Software Testing. good & bad state graphs. Software Testing. application of dataflow testing. consequences of bugs.Mathur. domain testing. Path products and Regular expressions:.TMH.Purpose of testing.C. Software Testing.VII State.Jorgensen. Introduction to Software Testing. Pearson Education.Pearson. model for testing. predicates.V. specifications.K. matrix of graph. Software Testing. UNIT . John Wiley.Aurbach Publications(Dist. 2nd Edition.D.A. UNIT . power of a matrix. Dreamtech.Cambridge Univ. Foundations of Software Testing. state testing. building tools. Dichotomies.Nageswara Rao. 6. The craft of software testing .P. domains and testability. Foundations of Software Testing. ( Student should be given an exposure to a tool like JMeter or Win-runner). domains and interfaces testing. CSE .Prasad. UNIT . Dataflow testing:.Basics of dataflow testing. UNIT-II Flow graphs and Path testing:.dreamtech Press.Pearson. REFERENCE BOOKS: 1.J.G. Software Testing techniques – Boris Beizer. 2.Chauhan. State Graphs and Transition testing:.Basics concepts of path testing.I Introduction:. Nice & ugly domains.Press. Testability tips.Desikan.III Transaction Flow Testing:-transaction flows.Limaye.Graham & Others. kv charts.VIII Graph Matrices and Application:-Motivational overview. 3. path sensitizing.P. application of path testing. 7. TEXT BOOKS: 1.VI Logic Based Testing:.Oxford University Press. decision tables.N. relations.B.overview.Ammann&J.Offutt. Perry.P. Dreamtech. 1999. applications. second edition. UNIT . UNIT . 37 .G. transaction flow testing techniques. Software Testing Concepts and Tools. UNIT-V Paths.Brian Marick.Ramesh.3rd edition. taxonomy of bugs. domain and interface testing. strategies in dataflow testing.K. 8.Cengage Learning.K. node reduction algorithm. 9.path products & path expression. path predicates and achievable paths. Software Testing.IV Domain Testing:-domains and paths. 4. regular expressions & flow anomaly detection.I Sem 6757047 L 4 T/P/D 1/-/C 4 SOFTWARE TESTING METHODOLOGIES UNIT . path expressions. 5.INSTITUTE OF ENGINEERING & TECHNOLOGY (AUTONOMOUS) IV Year B.M. 10.Tech.P. 2. path instrumentation. reduction procedure.state SPD).S.

I Sem 6757048 L 4 T/P/D 1/-/C 4 DATA WAREHOUSING AND DATA MINING UNIT I Introduction: Fundamentals of data mining. CSE . Data Mining Techniques – Arun K Pujari. 4.Jiawei Han & Micheline Kamber. Discretization and Concept Hierarchy Generation. Data Warehousing Fundamentals – Paulraj Ponnaiah Wiley student Edition 5.Wasimi. Data Integration and Transformation.Radha Krishna. Classification of Data Mining systems. From Data Warehousing to Data Mining Data Cube Computation and Data Generalization: Efficient Methods for Data Cube Computation. Associations and Correlations: Basic Concepts.Tech. Multimedia Data Mining. 2. Data Preprocessing: Need for Preprocessing the Data. Data Mining Introductory and advanced topics –Margaret H Dunham. Elsevier.J. Time Series and Sequence Data: Mining Data Streams. 38 . Social Network Analysis and Multirelational Data Mining: UNIT VII Mining Object.0. Further Development of Data Cube Technology. Data Cleaning.Diwakar. Distributed by SPD. Hierarchical Methods.B.2nd Edition.Pudi and P.The Architecture for the next generation of Data Warehousing. Clustering High-Dimensional Data. Ensemble Methods Unit V Cluster Analysis Introduction :Types of Data in Cluster Analysis. Building the Data Warehouse By William H Inmon. Spatial. Attribute-Oriented Induction. Bayesian Classification. Data Warehouse Architecture. D. Mining Time-Series Data. Further Development of Data Cube and OLAP Technology. Mining Sequence Patterns in Transactional Databases. Multimedia. Multidimensional Data Model. A Categorization of Major Clustering Methods.Ajay. 2. TEXT BOOKS: 1. Elsevier. 7. Graph Mining. Density-Based Methods. Pearson education. UNIT VIII Applications and Trends in Data Mining: Data Mining Applications. Partitioning Methods. Data Warehouse 2. Other Classification Methods. Evaluating the accuracy of a Classifier or a Predictor. Universities Press. Efficient and Scalable Frequent Itemset Mining Methods. UNIT II Data Warehouse and OLAP Technology for Data Mining: Data Warehouse. Mining various kinds of Association Rules. Morgan Kaufmann Publishers. Data Warehouse Implementation. 9. Data Mining:Methods and Techniques. Constraint-Based Cluster Analysis.V. Data Warehousing in the Real World – Sam Aanhory & Dennis Murray Pearson Edn Asia.PHI. UNIT VI Mining Streams. 3.Neushloss. John Wiley & Sons Inc.K. Cengage Learning. Data Mining Functionalities.M Shawkat Ali and S.Soman.V. Prediction. Data Reduction. The Data Warehouse Life cycle Tool kit – Ralph Kimball Wiley student edition 6. Support Vector Machines. G. 10. Additional Themes on Data Mining and Social Impacts of Data Mining. Outlier Analysis.Oxford University Press. Constraint-Based Association Mining UNIT IV Classification and Prediction: Issues Regarding Classification and Prediction. Insight into Data Mining.Inmon. Lazy Learners. Mining the World Wide Web. Major issues in Data Mining. From Association Mining to Correlation Analysis. Spatial Data Mining. Model-Based Clustering Methods.A. W.INSTITUTE OF ENGINEERING & TECHNOLOGY (AUTONOMOUS) IV Year B. Pearson education 8.B. Accuracy and Error measures. Classification by Decision Tree Induction. Data Mining – Concepts and Techniques . 2006. Grid-Based Methods.P. Data Mining. Michael Steinbach and Vipin Kumar. Classification by Backpropagation. Rule-Based Classification.H.2008. Mining Sequence Patterns in Biological Data.Strauss.S. UNIT III Mining Frequent Patterns. Text and Web Data: Multidimensional Analysis and Descriptive Mining of Complex Data Objects. Integration of a Data Mining System with a Database or a Data Warehouse System. REFERENCE BOOKS: 1. Text Mining. Associative Classification. 2005. Data Mining Task Primitives.A.2nd edition. Introduction to Data Mining – Pang-Ning Tan. Data Mining System Products and Research Prototypes.

raster-scan systems. REFERENCE BOOKS: 1.F. computer animation languages. quadric surfaces. raster animation. video-display devices.Maurya. depth-buffer. Tata Mc Graw hill.M. Filled area primitives: Scan line polygon fill algorithm.Kelley. Pearson education.C. “Procedural elements for Computer Graphics”.P. 8. 7.Steve Marschner&Others. “Computer Graphics”.B. Foley. Schaum’s outlines.M. UNIT IV 2-D Viewing : The viewing pipeline. Donald Hearn and M. Steven Harrington. Tata Mc Graw hill edition. UNIT III 2-D Geometrical transforms: Translation.Jaico Publishing House. view volume and general projection transforms and clipping. spline representation. Application areas of Computer Graphics. rotation. An Integrated Introduction to Computer Graphics and Geometric Modelling. area sub- UNIT VIII Computer animation: Design of animation sequence. Pauline Baker. second edition in C. UNIT V 3-D Object representation: Polygon surfaces. Feiner and Hughes. Computer Graphics. boundary-fill and flood-fill algorithms.Cengage Learning.Hill. Govil-Pai. 9.PHI. Computer Graphics. 2nd edition. window to view-port coordinate transformation.S. Sutherland –Hodgeman polygon clipping algorithm. 2. general computer animation functions. viewing coordinate reference frame. Roy Plastock. matrix representations and homogeneous coordinates. Bezier curve and B-spline curves. Shalini.J. 3.S. scan-line. scaling. polygon rendering methods. “Principles of Computer Graphics”.I Sem 6757049 L 3 T/P/D 1/-/C 3 COMPUTER GRAPHICS UNIT I Introduction. BSP-tree methods.Shirley. “Computer Graphics C version”. 10.R. back-face detection. reflection and shear transformations. 39 . transformations between coordinate systems. Hermite curve.Tech. “Computer Graphics Second edition”. “Computer Graphics Principles & practice”. Bezier and B-spline surfaces.CRC Press. scaling. Pearson Education. depth sorting. mid-point circle and ellipse algorithms. Cohen-Sutherland and Cyrus-beck line clipping algorithms. 2. UNIT VI 3-D Geometric transformations: Translation. composite transformations. Computer Graphics. line drawing algorithms. Computer Graphics & Animation. Neuman and Sproul. CSE . viewing coordinates. viewing functions. “Principles of Interactive Computer Graphics”. David F Rogers. key frame systems.Wiley India. 5.Rajesh K. rotation.Goldman. Zhigand xiang. VanDam. Basic illumination models. TMH. composite transforms. random scan systems. UNIT VII Visible surface detection methods: division and octree methods Classification. reflection and shear transformations. 4. TMH 6. motion specifications TEXT BOOKS: 1. overview of graphics systems.Trivedi. 3-D viewing: Viewing pipeline.INSTITUTE OF ENGINEERING & TECHNOLOGY (AUTONOMOUS) IV Year B. Springer.Taylor&Francis Group. graphics monitors and work stations and input devices UNIT II Output primitives: Points and lines.

Multiprocessor system interconnects. Processes and Memory Hierarchy.Hager and G. Performance metrics and measures. Three Generations of Multicomputers. Special Indian edition. Mapping program onto multicomputers. Architectural development tracks. Unit – III Bus Cache and Shared memory. Parallel Processing applications.Wellein. Conditions of parallelism. Parallel Programing Environments.I Sem 6757050 L 3 T/P/D 1/-/C 3 ADVANCED COMPUTER ARCHITECTURE (ELECTIVE – I) Unit – I Theory of Parallelism. Multivector and SIMD Computers. Tomasulo’s Algorithm. Program partitioning and Scheduling. Hardware Technologies.B. Unit-II Principals of Scalable performance. Program and network properties. cache coherence and synchronization mechanism. Sequential and weak consistency models.INSTITUTE OF ENGINEERING & TECHNOLOGY (AUTONOMOUS) IV Year B. Kai Hwang. Pearson education. Multiprocessors and Multicomputers. Arithmetic pipeline design. Unit – VI Software for parallel programming. The connection machine CM5. ELSEVIER. Multithreaded and Dataflow Architectures. Memory Hierarchy Technology. superscalar pipeline design. Non-Linear Pipeline Processors. CSE . code optimization and scheduling. Oxford Univ. S. System interconnect Architectures. B. Parallel computer models. Parallel models. 5. Computer Architecture. Instruction Pipeline design. Operand forwarding. T . Tata McGraw Hill Publishers. Message-passing program development. Scalable and multithreaded Architectures. Press. Superscalar and Vector Processors.G. Recorder Buffer. Cache Memory organizations. Computer Architecture. Patterson. SIMD computer Organizations. 2. Parallel languages and compilers. D. Compound Vector processing. Latency-hiding techniques. Compiler-Detector Instruction level parallelism. Fine-Grain Multicomputers. Linear Pipeline Processors. PRAM and VLSI models. Principals of Multithreading. Multiprocessors and Multicomputers.Shiva. G. Virtual Memory Technology. Languages and Compilers. Dependence analysis and data arrays. Scalability Analysis and Approaches. 40 . P. Loop Parallelization and pipelining. Introduction. Advanced Computer Architectures. Taylor & Francis Group. J.Hennessy and D. SharedVariable program structures. Multivector Multiprocessors. Advanced Computer Architecture Second Edition. Synchronization and Multiprocessing modes. Recent Advances in computer Architecture. Fourth edition. Vector Processing Principals.Sima. Advanced Computer Architecture.Parhami.Fountain. Dataflow and hybrid Architectures. Message-passing Mechanisms. Register Re-naming. Branch Prediction. Shared-Memory Organizations.Taylor &Francis. Pipelining and superscalar techniques. Advanced Processor Technology.Kacsuk. Limitations in exploiting instruction level parallelism. CRC Press. REFERENCE BOOKS: 1. The State of Computing. Brief overview of Technology. Problem Definition.Tech.J. Unit – VII Parallel Program development and Environments. Multivetor and SIMD computers. Introduction to High Performance Computing for Scientists and Engineers. Thread level parallelism. Model of typical processor. Speed up performance laws. 4.L.A. CRC. Forms of Parallelism TEXT BOOK: 1. Program flow Mechanisms. Basic Design issues. Parallel Programming models. Unit – IV Parallel and Scalable Architectures. Unit – VIII Instruction level parallelism. Backplane bus systems. 3. Unit – V Scalable.

UNIT-II Overview of Cloud Computing: Meaning of the terms cloud and cloud computing – cloud based service offerings – Grid computing Vs Cloud computing – Benefits of cloud model – limitations – legal issues – Key characteristics of cloud computing – Challenges for the cloud – The evolution of cloud computing. Tata Mc Graw Hill edition. Cloud computing case studies1: Amazon EC2 – Amazon simple DB – Amazon S3 – Amazon Cloud Front – Amazon SQS UNIT – VIII Cloud computing case studies2: Google App Engine. CSE . Ransome.Tech. management and security by John W. Cloud computing and SOA convergence in your enterprise. Cloud Computing a practical approach by Anthony T. Taylor & Francis group. CRC Press. by David S.Wesley 41 . Cloud Application Architectures by George Reese. Cloud Computing implementation. UNIT – III Web services delivered from the cloud: Infrastructure as a service – Platform-as-a-service – Software-as-a-service.J. Toby J.velte. James F.velte Robert Elsenpeter. Linthicum. Building Cloud networks: Evolution from the MSP model to cloud computing and software-as-a-service – The cloud data center – SOA as step toward cloud computing – Basic approach to a data center based SOA. Security in the Cloud: Cloud security challenges – Software-as-a-service security UNIT – V Common Standards in Cloud computing: The open cloud consortium – The distributed management task force – standards for application developers – standards for messaging – standards for security UNIT – VI End user access to cloud computing: youtube – zimbra – Facebook – Zoho – DimDim Collaboration Mobile internet devices and the cloud: Smartphone – mobile operating systems for smart phones – Mobile Platform virtualization – Collaboration applications for mobile platforms – Future trends UNIT – VII Virtualization: Adding guest Operating system.B. Oreilly publishers 2. Rittinghouse.INSTITUTE OF ENGINEERING & TECHNOLOGY (AUTONOMOUS) IV Year B. 2010 REFERENCES: 1. 2010 2. UNIT – IV Federation Presence. Symmetric multi processing and Massively parallel processing systems – High performance Cluster computing – Grid computing – Service Oriented Architecture overview – Virtualization. Addison.Google web tool kit – Microsoft Azure Services platform – Windows live – Exchange on line – Sharepoint services – Microsoft dynamic CRM – salesforce.I Sem 6757051 L 3 T/P/D 1/-/C 3 CLOUD COMPUTING (ELECTIVE-I) UNIT-I Introductory concepts and overview: Distributed systems – Parallel computing architectures: Vector CRM – App Exchange TEXT BOOKS: 1. Identity and Privacy in the cloud: Federation in the cloud – Presence in the cloud – Privacy and its relation to cloud based information system.

testing and debugging. second edition. RMI. Inter-ORB protocols. Duddy.Oriented and Connectionless Servers.The Java Basic Multicast API. Geoffrey C Fox. Pearson Education. R.Text-Based Protocols. UNIT VI Grid Computing Introduction. The Distributed Objects Paradigms – RMI.Multicast API.Dollimore and Tim Kindbirg. Distributed Object Systems. A sample RMI Application. Client/Server Programming with Java and CORBA.The Stream-Mode Socket API.Orfali & Dan Harkey. Sample Use cases: Commercial Data Center. 3rd edition. Grid Computing. Examples of Distributed systems.Oriented versus Connectionless IPC. The CORBA object interface.Data representation. Open Grid Services Infrastructure. Architecture and Goal. 2nd edition. D. Anthony J G Hey. Java Network Programming. UNIT III The Socket API-The Datagram Socket API. Interprocess Communications-An Archetypal IPC Program Interface. RPC. the architecture of distributed applications. Firewall Media. Pearson education.Coulouris. TEXT BOOKS: 1.Harold.Reliable Multicasting versus Unreliable Multicasting.INSTITUTE OF ENGINEERING & TECHNOLOGY (AUTONOMOUS) IV Year B.Connection. Data Encoding.Liu. Brose. the meaning of Distributed computing. Java Programming with CORBA.The Concept of Virtual Organizations.Deadlocks and Timeouts. 2004 REFERENCE BOOKS: 1. Online Media and Entertainment. 2010 42 . UNIT VII Open Grid Service Architecture – Introduction. steps for building an RMI application. The Client-Server Paradigm . CORBA object services. The Java RMI Architecture. Wiley & sons. Message system (or MOM) Paradigm – the point-to-point message model and the publish/subscribe message model.Iterative and Concurrent Servers. John Wiley & sons. comparison of RMI and socket API UNIT V Distributed Object Paradigm(CORBA) The basic Architecture. G. Wiley Dreamtech. 2. National Fusion Collaboratory. Fran Berman. Grid Computing: A Practical Guide to Technology and Applications. Distributed Computing. CORBA object references. 5.Paradigms for Distributed Applications – Message Passing Paradigm. object servers and object clients. Merging the Grid services Architecture with the Web Services Architecture. O’Reilly. Distributed Systems. A. SPD. CORBA Naming Service and the Interoperable Naming Service.R. 4.choosing a Paradigm for an application. UNIT II Distributed Computing Paradigms Paradigms and Abstraction. Grid computing road map. Group Communication-Unicasting versus Multicasting. Connection. 6. The Mobile Agent Paradigm.J. Grid Computing Anatomy – The Grid Problem.The Evolution of Paradigms for IPCs. A Networking Approach to Grid Computing. Java RMI API. Distributed. Joshy Joseph & Craig Fellenstein.B.Network basics. M. CSE . the Network Services Paradigm.Event Diagram and Sequence Diagram. Pearson Education. Principles and Applications.Request-Response Protocols. 3.Grid Architecture. An example CORBA application. A sample implementation. Grid Computing – Making the global infrastructure a reality. Concepts and Design.Event Synchronization.The different forms of computing – Monolithic.Connectionless versus Connection-Oriented Multicast.Minoli. Programming Model. E. Vogel. the strengths and weaknesses of Distributed computing. RPC model. operating system concepts relevant to distributed computing.Client-Server Paradigm Issues. OGSA platform Components. 7. Java IDL. Grid Architecture and relationship to other Distributed Technologies.Tech. object Adapters.Timeouts and Threading.I Sem 6757052 L 3 T/P/D 1/-/C 3 DISTRIBUTED COMPUTING (ELECTIVE -I) UNIT I Introduction Definitions. Parallel and cooperative computing. 3rd edition. 2. the object space Paradigm. UNIT VIII Globus GT 3 Toolkit – Architecture. Wiley India. ORB. The peer-to-peer Paradigm. J. An Archetypal Distributed Object Architecture.Abbas. UNIT IV Distributed Objects Paradigm (RMI) Message passing versus Distributed Objects.L. The collaborative application ( Groupware Paradigm) .

Software. Oxford University Press. UNIT – VIII Protocols and Platforms for Mobile Computing WAP. etc. Cambridge University Press. Selective Tuning and Indexing Methods. Bluetooth.B. Mobile and Handheld Devices. “Mobile Communications”. Stojmenovic and Cacute. 2. Algorithms such as DSR. and Protocols UNIT VII Mobile Ad hoc Networks (MANETs) Introduction. Wireless LAN (IEEE802. Addison-Wesley. Jochen Schiller. . Packet Delivery and Handover Management.Raj Kamal. Applications & Challenges of a MANET. Indirect TCP. JavaCard. XML. Wiley. 3. Location Management. Snooping TCP. TEXT BOOKS 1.11). CSE . Security. “Handbook of Wireless Networks and Mobile Computing”. SDMA. Route Optimization. PalmOS. Data Synchronization – Introduction. DHCP. 43 . DECT. J2ME. Digital Audio and Video Broadcasting (DAB & DVB). Protocols. DSDV.J. Mobile Computing – Paradigm. Linux for Mobile Devices.I Sem 6757053 L 3 T/P/D 1/-/C 3 MOBILE COMPUTING (ELECTIVE – I) UNIT I Introduction: Mobile Communications.INSTITUTE OF ENGINEERING & TECHNOLOGY (AUTONOMOUS) IV Year B. Communications Asymmetry. ISBN: 0521817331. Handover. SymbianOS. Classification of Routing Algorithms. Windows CE. Other Transport Layer Protocols for Mobile Networks. “Mobile Computing”. Reza Behravanfar. UNIT –III Mobile IP Network Layer IP and Mobile IP Network Layers. TDMA. Near and far terminals). Registration. Second Edition. Radio Interfaces. System Architecture. 2004. UNIT –IV Mobile Transport Layer Conventional TCP/IP Protocols. Calling. UNIT –II (Wireless) Medium Access Control (MAC) Motivation for a specialized MAC (Hidden and exposed terminals. Collision Avoidance (MACA. CSHSD. Classification of Data Delivery Mechanisms.Tech. ISBN: 0195686772 REFERENCE BOOKS 1. AODV. ISBN 0471419028. MAC protocols for GSM. 2007. Promises/Novel Applications and Impediments and Architecture. GPRS. UNIT V Database Issues Database Hoarding & Caching Techniques. “Mobile Computing Principles: Designing and Developing Mobile Applications with UML and XML”. Query processing. Transactional Models. Localization. Limitations of Mobile and Handheld Devices. MACAW) Protocols. 2002. Mobile Agents. New Data Services. GSM – Services. Service Discovery. FDMA. C – S Computing & Adaptation. Routing. Tunnelling and Encapsulation. UNIT VI Data Dissemination and Synchronization. Mobile TCP. Data Recovery Process & QoS Issues. Data Dissemination Broadcast Models.Oct 2004. CDMA.

açade. A Parting Thought. JAVA Enterprise Design Patterns Vol-III By Mark Grand .Buschmann&others. UNIT-II A Case Study : Designing a Document Editor : Design Problems. Design Patterns in Smalltalk MVC. 5. Design Patterns Explained By Alan Shalloway. Pattern’s in JAVA Vol-I By Mark Grand .INSTITUTE OF ENGINEERING & TECHNOLOGY (AUTONOMOUS) IV Year B. Summary . User Operations Spelling Checking and Hyphenation.B. 2. Pattern’s in JAVA Vol-II By Mark Grand .Pearson Education. State. Composite. Bridge.Visitor. Embellishing the User Interface. UNIT-V Structural Pattern Part-II : Decorator. Head First Design Patterns By Eric Freeman-Oreilly-SPD. How to Select a Design Pattern. Memento. Organizing the Catalog. Interpreter. 4. UNIT-III Creational Patterns : Abstract Factory.Wiley DreamTech. 3. UNIT-IV Structural Pattern Part-I : Adapter. UNIT-VIII What to Expect from Design Patterns.J. REFERENCES : 1. How to Use a Design Pattern. Flyweight. TEXT BOOK : 1. How Design Patterns Solve Design Problems.Pattern Oriented Software Architecture. Supporting Multiple Window Systems. The Catalog of Design Patterns. Pearson Education 2. Prototype.Wiley DreamTech. Strategy. Template Method . Command.Tech. Iterator. Formatting. Document Structure. The Pattern Community An Invitation. Supporting Multiple Look-and-Feel Standards. Observer.John Wiley & Sons. 44 . Discussion of Creational Patterns. Proxy. UNIT-VI Behavioral Patterns Part-I : Chain of Responsibility. A Brief History.F. CSE .I Sem 6757054 L 3 T/P/D 1/-/C 3 DESIGN PATTERNS (ELECTIVE – II) UNIT –I Introduction : What Is a Design Pattern?. UNIT-VII Behavioral Patterns Part-II : Mediator.Wiley DreamTech. Builder. Discussion of Behavioral Patterns. Design Patterns By Erich Gamma. Singleton. Describing Design Patterns. Factory Method.

1995 45 . Cambridge Univ Press. Duda. Springer Verlag. 2001 REFERENCE BOOKS: 1 Machine Learning Methods in the Environmental Sciences. UNIT – II Concept Learning: Version spaces. Occam’s razor. 1997 2.Peter E. Overview of issues regarding data sources. UNIT –V Sample Complexity and Over fitting: Errors in estimating means. eager generalization.INSTITUTE OF ENGINEERING & TECHNOLOGY (AUTONOMOUS) IV Year B. Hidden Markov Models UNIT—VII Instance-based Techniques: Lazy vs. John Wiley & Sons Inc. UNIT—VIII Genetic Algorithms: complexity. 2. Mistake bound/ PAC model. William W Hsieh. Tom Michel. pattern classification. UNIT—VI Bayesian Approaches: The basics Expectation Maximization. basic results. Biology.J. CSE . Experiment. Hart and David G. Irrelevant features: Multiplicative rules for weight tuning. Active queries. Cross Validation and jackknifing VC dimension. Oxford University Press. Different search methods for induction - Explanation-based Learning: using prior knowledge to reduce sample TEXT BOOKS: 1. McGraw Hill. Machine Learning. Trevor Has tie. Neural Networks for Pattern Recognition. Inductive Bias.2001 3. K nearest neighbor.based reasoning.. and a few approaches to it. Richard o. Psychology.Chris Bishop. success criteria. Neural Networks.I Sem 6757055 L 3 T/P/D 1/-/C 3 MACHINE LEARNING (ELECTIVE – II) UNIT – I Introduction: An illustrative learning task. Stork.Tech.B. case. Learning with active queries UNIT – IV Neural Network Learning: Perceptions and gradient descent back propagation.Minimum Description Length Principle. UNIT – III Decision Tree Learning: . Robert Tibshirani & Jerome Friedman. The Elements of Statically Learning. What is known from algorithms? Theory.

Membership functions.INSTITUTE OF ENGINEERING & TECHNOLOGY (AUTONOMOUS) IV Year B. Taylor and Francis Group. Tolerance and equivalence relations. UNIT-V Adaptive Resonance Theory Networks.Springer.J.Amit Konar.operations and Fuzzy sets. 4. Special Networks-Introduction to various networks. impotant terminologies.Cardinality. Asscociative Memory Networks. Computational Intelligence. Wiley India. Supervised Learning Networks. Best First Search Problem reduction. Artificial Intelligence – Patric Henry Winston – Third Edition. Pearson Edition.. UNIT-III Artificial Neural Networks: Introduction. membership value assignments. 5. Fixed Weight Competitive Nets.Using Predicate Logic and Rules. Heuristic Search Techniques. BAM and Hopfield Networks. Artificial Intelligence – Elaine Rich and Kevin Knight. Basic models of ANN. CRC press. rp2008.Applications: Optimization of TSP. Hamming Network. CRC.Tech. Kohonen Self-Organizing Feature Maps. Backpropogation Network. Techniques. S N Deepa.B. CSE .. 2. Artificial Intelligence and Soft Computing. Defuzzification. Approaches to Knowledge Representation. Clarence D Silva. Press Taylor and Francis Group. Perceptron Networks. Internet Search Technique TEXT BOOKS: Principles of Soft Computing. Introduction to Classical Sets ( crisp Sets)and Fuzzy Sets. Maxnet. Adaptive Linear Neuron. Learning Vector Quantization. A first course in Fuzzy Logic-Hung T Nguyen and Elbert A Walker.I Sem 6757056 L 3 T/P/D 1/-/C 3 SOFT COMPUTING (ELECTIVE – II) UNIT-I AI Problems and Search: AI problems. UNIT-IV Unsupervised Learning Network.Introduction. Properties and composition. UNIT-VI Fuzzy Relations. 46 . 1991. Hill Climbing. Traing Algorithms for pattern association. Classical Relations. Operations. UNIT-VII Fuzzy Arithmetic and Fuzzy Measures.Generate and Test. UNIT-VIII Fuzzy Logic Control Systems. 2007 Soft Computing and Intelligent System Design -Fakhreddine O Karray. Problem Spaces and Search. TMH. Genetic Algorithm.Amit Konar.S N Sivanandam. REFERENCES : 1. Pearson Education.Counter Propogation Networks. Fuzzy Rule Base and Approximate Reasoning Fuzzy Decision making. Fuzzification.Behavioural and Cognitive Modelling of the Human Brain.Features.Intrduction and basic operators and terminology. 3. 2004. UNIT-II Constraint Satisfaction and Means End Analysis.

2. N-gram data structure. Relevance feedback. Information Retrieval: Algorithms and Heuristics By David A Grossman and Ophir Frieder. Information System Evaluation: Introduction. 2007. Browse. Statistical indexing. 3.INSTITUTE OF ENGINEERING & TECHNOLOGY (AUTONOMOUS) IV Year B. Pearson Education. Mark T Maybury . UNIT VIII Libraries and Bibliographical Systems – Online IR Systems. Indexing and Searching. Gerald. 3. Cambridge University Press. UNIT VI Text Search Algorithms: Introduction. UNIT III Automatic Indexing: Classes of automatic indexing. Signature file structure. Hardware text search systems. Ricardo Baeza-Yates. Item clustering. Thesaurus generation.Oxford Univ. Functional Overview. Introduction to Information Retrieval By Christopher D. Measurement example – TREC results. OPACs. Software text search algorithms. Measures used in system evaluation.Tech. Searching the Internet and hypertext. 2. Data Structures: Introduction. UNIT VII Multimedia Information Retrieval – Models and Languages – Data Modeling. Weighted searches of Boolean systems.I Sem 6757057 L 3 T/P/D 1/-/C 3 INFORMATION RETRIEVAL SYSTEMS (ELECTIVE – II) UNIT I Introduction: Definition. Query Languages. Miscellaneous. Indexing Process. Pearson Education. Similarity measures and ranking. UNIT V User Search Techniques: Search statements and binding. Cognition and perception. Objectives. Relationship to DBMS. 1992. Digital Libraries.J. Manning and Prabhakar Raghavan. Stemming Algorithms. CSE . Natural language.Search. Selective dissemination of information search. Hierarchy of clusters. Information Storage & Retieval By Robert Korfhage – John Wiley & Sons.T. 2nd Edition. Hypertext linkages UNIT IV Document and Term Clustering: Introduction. 2008. Modern Information Retrival By Ricardo Baeza-Yates. Concept indexing. Information Retrieval Data Structures and Algorithms By William B Frakes. 47 . Natural Language Processing and Information Retrieval. REFERENCE BOOKS 1. Digital libraries and Data Warehouses. Hypertext data structure. Information Extraction.B. PAT data structure. Information Storage and Retrieval Systems: Theory and Implementation By Kowalski. Springer. Inverted file structures. Information Retrieval System Capabilities . Automatic Indexing.Tiwary. Press.Springer. Information Visualization: Introduction. TEXTBOOKS 1. 4. Information visualization technologies. UNIT II Cataloging and Indexing: Objectives.S.Siddiqui and U.

Time of last access. ls C. Write a shell script to find factorial of a given integer. 48 . 25. using a)Semaphores b)flock or lockf system calls. starting and ending line numbers as arguments and displays all the lines between the given line numbers. File type.B. A. Write a C program that receives the messages (from the above message queue as specified in (21)) and displays them. Write an awk script to count the number of lines in a file that do not contain vowels. Write a shell script that accepts a file name. 17.I Sem 6757609 L 0 T/P/D -/3/C 2 LINUX PROGRAMMING AND DATA MINING LAB LINUX PROGRAMMING: Note: Use Bash for Shell scripts. Write a C program to list for every file in a directory. C. Write a C program that implements a producer-consumer system with two processes. Write a shell script that receives any number of file names as arguments checks if every argument supplied is a file or a directory and reports accordingly. Write a shell script that deletes all lines containing a specified word in one or more files supplied as arguments to it. 1. 5. counts and reports the occurrence of each word that is present in the first argument file on other argument files. 13. Write a C program that illustrates how to execute two commands concurrently with a command pipe. 6. 19. mv 12. CSE . 9. cat B. Write a c program that makes a copy of a file using standard I/O and system calls. Whenever the argument is a file. 10. Write and Execute permissions. Implement in C the following Unix commands using System calls A . Write a C program to create a Zombie process. 8. 23. Write a C program to create a child process and allow the parent to display “parent” and the child to display “child” on the screen. Ex:. (using Semaphores). the number of lines on it is also reported. 4. Write C programs that illustrate communication between two unrelated processes using named pipe. 14. 2. its inode number and file name. Write a C program to create a message queue with read and write permissions to write 3 messages to it with different priority numbers. B.Ex: ls > f1. 21. 22. Write a C program that demonstrates redirection of standard output to a file. words and lines in a file. Write an awk script to find the number of characters. Write a C program to allow cooperating processes to lock a resource for exclusive use. Number of links. Write a C program that illustrates suspending and resuming processes using signals. Write a program that takes one or more file/directory names as command line input and reports the following information on the –l | sort 20. D. 24. 18. 11. 7. 16. Write a shell script that accepts a list of file names as its arguments.J. Write a shell script that displays a list of all the files in the current directory to which the user has read. Write a C program that illustrates how an orphan is created. Write a shell script to list all of the directory files in a directory.INSTITUTE OF ENGINEERING & TECHNOLOGY (AUTONOMOUS) IV Year B. Write a C program to emulate the Unix ls –l command.Tech. Read. write and execute permissions. 15. 3.

Write client and server programs(using c) for interaction between server and client processes using Internet Domain sockets. Assessing the credit worthiness of an applicant is of crucial importance. 4. What % of examples can you classify correctly ? (This is also called testing on the training set) Why do you think you cannot get 100 % training accuracy ? 5.Gilberg. Find some training manuals for loan officers or perhaps a suitable textbook on finance. 3. Find records of actual cases where competent loan officers correctly judged when. Try out some combinations. Find a loan officer who is willing to talk. 3. Is testing on the training set as you did above a good idea ? Why orWhy not ? 6.2nd edition. On the one hand. The goal is the classify the applicant into one of two categories.List all the categorical (or nominal) attributes and the real-valued attributes seperately. Common sense. approve a loan application. • foreign_worker. a bank cannot afford to make too many bad loans.Dougherty&A. TEXT BOOKS: 1. To remove an attribute you can use the preprocess tab in Weka's GUI Explorer. (You had removed two attributes in problem 7. Too many bad loans could lead to the collapse of the bank.Advanced Unix Programming. the unit of currency. Pearson Education. Data Mining Lab: Credit Risk Assessment Description:The business of banks is making loans. 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.Unix Shells by Example. worth about 90 cents Canadian (but looks and acts like a quarter). Interest on these loans is the banks profit source. 3. 4. Translate this knowledge from text form to production rule form.Robbins. Venkatesh Murthy.G. or bad. Does your accuracy increase/decrease ? Why ? (10 marks) 7. To do the assignment. Knowledge Engineering. a bank wants to make as many loans as possible.) 49 . Subtasks : (Turn in your answers to the following tasks) 1. • owns_telephone. M. Remember to reload the arff data file to get all the attributes initially before you start selecting the ones you want. Another question might be. 1. Report the model obtained after training. Write client and server programs(using c) for interaction between server and client processes using Unix Domain sockets. 7. You have to develop a system to help a loan officer decide whether the credit of a customer is good. do you really need to input so many attributes to get good results? Maybe only a few would do. On the other hand. the class attribute (naturally)). 5. 8. N. The German Credit Data: Actual historical credit data is not always easy to come by because of confidentiality rules. 2.F.Unix and Shell Programming. 10. you could try just having attributes 2. It is very hard to get German citizenship if you were not born of German parents.26. (Down load from web) In spite of the fact that the data is German. 3. For example. BS Publications.or "personal-status" (attribute 9). 5. 17 (and 21. Case histories. You can acquire such knowledge in a number of ways. good or bad.A.Unix and Shell programming. and not too lenient. credit dataset (original) Excel spreadsheet version of the German credit data.What attributes do you think might be crucial in making the credit assessement ? Come up with some simple rules in plain English using your selected attributes. and when not to. Check to see if the data shows a bias against "foreign workers" (attribute 20). Cengage Learning. German phone rates are much higher than in Canada so fewer people own telephones. Suppose you use your above model trained on the complete dataset.Forouzan and R. Imagine yourself as a loan officer and make up reasonable rules which can be used to judge the credit worthiness of a loan applicant. 4. Books. Interview her and try to represent her knowledge in the form of production rules. O. Pearson Education.B. and classify credit good/bad for each of the examples in the dataset. • There are 20 attributes used in judging a loan applicant. you should probably make use of it for this assignment. 4th Edition. One approach for solving the problem encountered in the previous question is using cross-validation ? Describe what is cross-validation briefly. 2. 2005. One type of model that you can create is a Decision Tree .SPD. consisting of 1000 actual cases collected in Germany. Did removing these attributes have any significant effect? Discuss.Sed and Awk. B. A bank's business rules regarding loans must consider two opposing factors. The bank's loan policy must involve a compromise: not too strict. There are millions of these in Germany (many from Turrkey).train a Decision Tree using the complete dataset as the training data. Elllie Quigley. Write a C program that illustrates two processes communicating using shared memory. 27. 2. (Unless you really can consult a real loan officer !) A few notes on the German dataset • DM stands for Deutsche Mark. 28. Train a Decistion Tree again using cross-validation and report your results.Venkateswarulu. you first and foremost need some knowledge about the world of credit. Here is one such dataset.

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. give a higher cost to the first case (say cost 5) and lower cost to the second case. PART and oneR.(Extra Credit): How can you convert a Decision Trees into "if-then-else rules". Rank the performance of j48. Report the rule obtained by training a one R classifier. Train your Decision Tree again and report the Decision Tree and cross-validation results.9. Task Resources: Andrew Moore's Data Mining Tutorials (See tutorials on Decision Trees and Cross Validation) • Decision Trees (Source: Tan. report your accuracy using the pruned model. Are they significantly different from results obtained in problem 6 (using equal cost)? 10. There also exist different classifiers that output the model in the form of rules .Explain this idea briefly. Does your accuracy increase ? 12. Instead of counting the misclassifcations equally in both cases. train this model and report the set of rules obtained. 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). 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). Make up your own small Decision Tree consisting of 2-3 levels and convert it into a set of rules.PART. One approach is to use Reduced Error Pruning . Sometimes. You can do this by using a cost matrix in Weka.You can make your Decision Trees simpler by pruning the nodes. 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 50 .one such classifier in Weka is rules. Sometimes just one attribute can be good enough in making the decision. yes.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 ? 11.

blank receipts. a transaction will be considered complete by the bank once it has been approved. Component Diagram Deployment Diagram. the ATM will display an explanation of the problem. The ATM will communicate each transaction to the bank and obtain verification that it was allowed by the bank. A customer must be able to make a transfer of money between any two accounts linked to the card. 2. Approval must be obtained from the bank before cash is dispensed. 6. The customer will enter the amount of the deposit into the ATM. When the switch is moved to the "off" position. a dispenser for cash (in multiples of Rs. Collaboration Diagram. the card will be permanently retained by the machine.B. 1000). 8. 5. 4. and the customer will have to contact the bank to get it back. or presses cancel instead. a second message will be sent to the bank indicating that the customer has deposited the envelope. 2. Ordinarily.Tech. After turning the switch to the "on" position. Test Design. a printer for printing customer receipts. Approval must be obtained from the bank before physically accepting the envelope. Description for an ATM System The software to be designed will control a simulated automated teller machine (ATM) having a magnetic stripe reader for reading an ATM card. State Diagram Activity Diagram. 1. 51 . The customer will then be able to perform one or more transactions. consisting of cash and/or checks in an envelope. If the customer is unable to successfully enter the PIN after three tries. no second message will be sent to the bank and the deposit will not be credited to the customer. at which point it will be returned . 1000. The ATM will provide the customer with a printed receipt for each successful transaction The ATM will have a key-operated switch that will allow an operator to start and stop the servicing of customers. 7. 500 and Rs. 4. subject to manual verification when the envelope is removed from the machine by an operator. The ATM must be able to provide the following services to the customer: 1. (The software on the latter is not part of the requirements for this problem.except as noted below. A customer must be able to abort a transaction in progress by pressing the Cancel key instead of responding to a request from the machine. The ATM will communicate with the bank's computer over an appropriate communication link. 5. Class Diagram. If a transaction fails for any reason other than an invalid PIN.both of which will be sent to the bank for validation as part of each transaction. (If the customer fails to deposit the envelope within the timeout period.I Sem 6757610 L 0 T/P/D -/3/C 2 CASE TOOLS AND SOFTWARE TESTING LAB Case Tools Lab Students are divided into batches of 5 each and each batch has to draw the following diagrams using UML for an ATM system whose description is given below. The card will be retained in the machine until the customer indicates that he/she desires no further transactions. a customer console (keyboard and display) for interaction with the customer. In the case of a deposit. Rs. 9. the machine will shut down. and will then ask the customer whether he/she wants to do another transaction. a slot for depositing envelopes.J. 3. 100.) The ATM will service one customer at a time. and a key-operated switch to allow an operator to start or stop the machine. the operator will be required to verify and enter the total cash on hand. Sequence Diagram. UML diagrams to be developed are: Use Case Diagram. A customer will be required to insert an ATM card and enter a personal identification number (PIN) . the customer will be required to re-enter the PIN before a transaction can proceed.) If the bank determines that the customer's PIN is invalid.INSTITUTE OF ENGINEERING & TECHNOLOGY (AUTONOMOUS) IV Year B. 500 or Rs. A customer must be able to make a balance inquiry of any account linked to the card. CSE . A customer must be able to make a deposit to any account linked to the card. in multiples of Rs. A customer must be able to make a cash withdrawal from any suitable account linked to the card. etc. The machine can only be turned off when it is not servicing a customer. 3. 100 or Rs. so that the operator may remove deposit envelopes and reload the machine with cash. iii) if…else iv) switch v) for 2. Bugzilla.g.g.Software Testing Lab List of Experiments 1. 3. Library Management System) 6.while ii) while…. Study of any testing tool (e. “A program written in ‘C’ language for Matrix Multiplication fails” Introspect the causes for its failure and write down the possible reasons for its failure. Selenium) 8.g.g. Study of any web testing tool (e. Test Link) 11. During the Life cycle of the mini project create the various testing documents* and final test report document. Take any system (e. Take a mini project (e. 4. Study of any open source-testing tool (e. Study of any bug tracking tool (e.g. Study of any test management tool (e. *Note: To create the various testing related documents refer to the text “Effective Software Testing Methodologies by William E.g.g. University admission. Create a test plan document for any application (e. Win runner) 7. ATM system) and study its system specifications and report the various bugs. Write the test cases for any known application (e.g. Test Director) 10. bugbit) 9. Placement Portal) and execute it... Write programs in ‘C’ Language to demonstrate the working of the following constructs: i) do. Banking application) 5. Perry” 52 .

CSE . 2009. p chart.Srinath: PERT/CPM. 2009 8. Business Process outsourcing (BPO). 4. TMH.Nature and Importance of Management. Six sigma and Capability Maturity Model (CMM) Levels. Management. & Aryasri: Principles of Management. Environmental Scanning.Basic concepts and theories. Programmes. Strategies and benefits of information and communication technologies (ICT). Systems Approach to Management. Stevenson & Ceyhun Ozgur: Introduction to Management Science. L. Basic functions of HR Manager: Manpower planning. Placement.Subba Rao : Human Resource Management. Personnel Management. 2009. Objectives. Total Quality Management (TQM). one each from units –III & IV Each question should not have more than 3 bits. Training and Development. 53 .Ivancevich Management—Principles and Guidelines. 5. Thomas N.V. FSN Analysis. 9. EOQ.II Sem 6758007 L 3 T/P/D -/-/C 3 MANAGEMENT SCIENCE Unit I Introduction to Management: Entrepreneurship and organization . Question Paper Pattern: 5 Questions to be answered out of 8 questions. P. Taylor’s Scientific Management Theory. Selection. Memoria & S. Aryasri: Management Science. Pearson. R chart. Mission. Ethics and corporate social responsibilities. Unit VI Human Resources Management (HRM): Evolution of HRM. Parnell: Strategic Management. Performance Management. Unit II Designing Organisational Structures: Departmentation. Biztantra. 12.INSTITUTE OF ENGINEERING & TECHNOLOGY (AUTONOMOUS) IV Year B.S. team structure. Performance Appraisal.Affiliated East-West Press. 2009. not essay questions. The question paper should contain atleast 2 practical problems. 6. Stoner. Vision. Concepts of HRM. Line and staff organization. identifying critical path. Project Cost Analysis. Douglas McGregor’s Theory X and Theory Y. TMH. Unit VIII will have only short questions. 2009 2. Marketing Mix. William J. Policy. Cellular Organisation. Promotion. TMH. 2009. Value Chain Analysis.Logistics and basics of supply Chain Management. Functions of Management. Oxford University Press.Tech. Fayol’s Principles of Management. New Delhi. Unit VIII Contemporary Management Practices: Basic concepts of Just-In-Time (JIT) System. 2009 3. matrix organization. 2009. PEST Analysis. Unit V A) Materials Management: Objectives. Work Study -Basic procedure involved in Method Study and Work Measurement-Statistical Quality Control: X chart. Project Crashing. Unit VII Strategic Management: Porter’s five factors theory. VED Analysis. Channels of distribution. Critical Path Method (CPM). Production and Operations Management. Codes/Tables: Normal Distribution Function Table need to be permitted into the examination Hall.Enterprise Resource Planning (ERP). 7. Koontz. Schermerhorn: Management. Wiley. Recruitment. 13. 2007. Goals. Unit IV Project Management (PERT/CPM): Network Analysis. lean and flat organization structure and their merits. Marketing Strategies based on Product Life Cycle. Ramaswamy Namakumari: Marketing Management. Retailing and Basics of Rural Marketing.Duening & John M. Need for Inventory control. SWOT Analysis. Elements of Corporate Planning Process. Pre-requisites: Managerial Economics Objective: To familiarize with the process of management and to provide basic insights into select contemporary management practices. demerits and suitability. Programme Evaluation and Review Technique (PERT). Benchmarking. Weihrich. Grievance Handling and Welfare Administration.B. Balanced Score Card. Decentralisation centralization and Recentralization. 11. functional organization. Kotler Philip & Keller Kevin Lane: Marketing Management PHI. Strategy. c chart. Business Process Re-engineering 5S Model. Cengage.. 2009. Stores Management . Kanishka Bedi. batch and Mass Production). Purchase Procedure. 2009.Ganker. Steps in Strategy Formulation and Implementation. Himalaya.J. ABC Analysis. B) Marketing: Functions of Marketing. REFERENCE BOOKS: 1. 10. Unit III Operations Management: Principles and Types of Plant Layout-Methods of production (Job. Committee organization. Job Evaluation and Merit Rating. Motivation and leadership . Types of Organisation structures Line organization.

R. XML digital signature. D. Chappell & T. R. Webber. Pearson Education. Casati and others. F. 54 .IV Core fundamentals of SOAP – SOAP Message Structure. Web Services. developing web services enabled applications.II Introduction to Web Services – The definition of web services. Springer.II Sem 6758035 L 3 T/P/D 1/-/C 3 WEB SERVICES (ELECTIVE – III) UNIT . UNIT . et al. S. S. 2005. developing SOAP Web Services using Java. Pearson Education. Skoczylas.P. R. Sriganesh.SPD. emergence of Web Services and Service Oriented Architecture (SOA). McGovern. TEXT BOOKS: 1. 3. Building Web Services with Java.VI Describing Web Services – WSDL – WSDL in the world of Web Services. limitations of WSDL. XML encryption. Web Services Security – XML security frame work. SOAP encoding . O’Reilly. Challenges in Distributed Computing. basic operational model of web services. UDDI – UDDI Registries. limitations of SOAP. Morgan Kaufmann Publishers. 3. 2nd Edition. tools and technologies enabling web services. CORBA. Wiley India. SOAP communication and messaging. MOM. REFERENCES: 1.2005. 2008. “Java Web Services Architecture”.VII Discovering Web Services – Service discovery. core building blocks of web services. G. 4. basic steps of implementing web services.. Alonso. J2EE Web Services.V Developing Web Services using SOAP – Building SOAP Web Services. Overview of .P. 2. Pearson Education. Chatterjee.A. XML. SOAP message exchange models.. UNIT . F. UNIT .Tech. Publishing information to a UDDI Registry. role of J2EE and XML in distributed computing.Evolution of distributed computing. 2008. deleting information in a UDDI Registry.NET and J2EE. J. CSE . role of service discovery in a SOA. support for categorization in UDDI Registries. Graham and others. UNIT .INSTITUTE OF ENGINEERING & TECHNOLOGY (AUTONOMOUS) IV Year B. benefits and challenges of using web services. UNIT . Nagappan. 5. UNIT .I Evolution and Emergence of Web Services . JAVA RMI. uses of UDDI Registry. anatomy of WSDL definition document.III Web Services Architecture – Web services Architecture and its characteristics. web services communication.Coyle. Pearson Edn. rp – 2008. service discovery mechanisms. WSDL bindings. SOAP security. Programming with UDDI. UNIT . 2. Jewell. Web Services.B. guidelines for signing XML documents. and the Data Revolution. UDDI data structures. searching information in a UDDI Registry. Developing Java Web Services.VIII Web Services Interoperability – Means of ensuring Interoperability. limitations of UDDI. Micro Soft DCOM. standards and technologies available for implementing web services.J. Developing Enterprise Web Services. Web Services life cycle. Core distributed computing technologies – client/server. Java Web Services. Publishing API. WSDL Tools. XKMS structure. Richard Monson-Haefel.

Davies.T. Ontology. J.(Taylor & Francis Group) 3.Wiley interscience. CSE .XML/XML Schema. Paul Warren. Artifical Intelligence.e-learning. Unit VII:.Software Agents.Rule and Inference Engines.2008. The Information Age .Peter Mika. Semantic Web Technologies . 2. What is social Networks analysis.Building Semantic Web Applications with social network features. REFERENCE BOOKS: 1. TEXT BOOKS: 1. Unit III: Ontologies and their role in the semantic web.Creating an OWL-S Ontology for Web Services.Springer. Inference engines. Information Sharing on the semantic Web . Semantic Search.Constructing Ontology. Frank Van Harmelen. Thinking on the Web . Logic on the semantic Web.Semantic Bioinformatics.Ontology Development Tools.J.Segaran.Web Based Networks.Godel and Turing.UML.INSTITUTE OF ENGINEERING & TECHNOLOGY (AUTONOMOUS) IV Year B.Heiner Stuckenschmidt. Semantic Web applications and services. Unit V Logic.J.C. Electronic Sources for Network Analysis – Electronic Discussion networks.2007.Semantic Search Technology.Tech.SPD. Programming the Semantic Web. Semantic Web and Semantic Web Services -Liyang Lu Chapman and Hall/CRC Publishers.II Sem 6758036 L 3 T/P/D 1/-/C 3 SEMANTIC WEB AND SOCIAL NETWORKS (ELECTIVE – III) Unit I: Thinking and Intelligent Web Applications. 55 . 2.Web Search Agents and Semantic Methods.O’Reilly.Berners Lee. Rudi Studer.Taylor.B.Ontology Methods.Ontology Libraries and Ontology Mapping.The World Wide Web. Ontology Web Language(OWL). Social Networks and the Semantic Web .Evans. Semantic Road Map. Limitations of Todays Web. Berners-Lee www.Ontology Sharing and Merging. Unit IV: Ontology Engineering. 4. Unit VIII Blogs and Online Communities. Springer Publications.Trends and Research in Ontology Based Systems. John Wiley & Sons. Ontologies Languages for the Semantic Web –Resource Description Framework(RDF) / RDF Schema.The Next Generation Web Unit II: Machine Intelligence.development of the social networks analysis.Knowledge Base Unit VI: XML Based Web Services.

Exception Handling. Cengage Learning Publications. 8. modules.Dawson. Programming Perl.). 11.Perl and PHP. the Mcrypt package. Login Administration.M. Efficient Python Web Systems . Database Based.Lutz.Uses for Scripting Languages.Prentice Hall(Pearson). PHP and MySQL by Example. control structures . 7.Quigley. Perl-Tk. IP Based. exec and uplevel commands.eval. PHP 5.Orwant. Perl by Example.O’Reilly. patterns. UNIT . David Barron.TMH.Function Libraries.statements.B.Pearson Education. 2.Chun.Python Web Programming . PHP Programming solutions.J.V TCL TCL Structure. pattern and regular expressions. The World of Scripting Languages . Advance TCL. pack and unpack. Sending Email using PHP. UNIT – VII Python Introduction to Python langauge. input/output. Perl Power. Datatypes.expressions. UNIT – II Advanced perl Finer points of looping.1.Ousterhout.J.The X Team. security Issues. 3rd Edition . arrays. Web Scripting.Vaswani. objects. trapping errors.INSTITUTE OF ENGINEERING & TECHNOLOGY (AUTONOMOUS) IV Year B.functions. list.P. REFERENCE BOOKS: 1. UNIT – III PHP Basics PHP Basics. Name spaces. 9. filesystem. strings . Scripting Today.Arrays. hashes. Constants. PHP Authentication and Methodolgies -Hard Coded. PERL.J. Tcl and the Tk Tool kit.string interpolation. interfacing to the operating system. C Interface.Flynt. strings. UNIT VI Tk Tk-Visual Tool Kits. 10.SPD. File Based.Features. datastructures. CSE . Control Flow. Scalar Expressions. 2. Variables. source.Apache.E.Outputting the data to the browser.SPD. Creating Internet ware applications.T. packages. 56 .SPD. subroutines.II Sem 6758037 L 3 T/P/D 1/-/C 3 SCRIPTING LANGUAGES (ELECTIVE – III) UNIT – I Introduction to PERL and Scripting Scripts and Programs. Core Python Programming. python-syntax. Nuts and Bolts Internet Programming. files.Larry Wall. syntax. making applications internet aware. 3. UNIT – IV Advanced PHP Programming PHP and Web Forms.Beginning PHP and MySQL .Julie Meloni and Matt Telles.Apress Publications (Dream tech.Creating a Function.Christiansen and J.MySQL. Building Web sites for the World. Open Source Web Development with LAMP using Linux .Embedding PHP Code in your Web pages. 5.M.Names and Values. 6.Lee and B. Security Issues.I. Tk by example. TEXT BOOKS: 1.Cengage Learning. Function.Built-in-functions and Methods.Cengage Learning.Shah. Modules in python.Tech.Pearson Education. Characteristics of Scripting Languages. PHP 6 Fast and Easy Web Development .V. PHP Encryption Functions. Uploading Files with PHP. Variables.New Riders Publications. 12. Control Structures.VIII Integrated Web Applications in Python – Building Small. 3. Fundamental Concepts of Tk.strings and Regular Expressions. eval. 4. Files. Programming Python.Bayross and S. and the universe of Scripting Languages. Variables and Data in TCL.E.Web Application Framework. Steve Holden and David Beazley .Ware(Addison Wesley) Pearson Education. Dirty Hands Internet Programming. UNIT .Pearson Education. Events and Binding . event driven programs.Quigley. procedures . Guide to Programming with Python. Origin of Scripting . Jason Gilmore. Data Structures.Wiley Publications.

Drew PHI Learning. 1986. Chris Grover. Social Networking. Ranjan Parekh. Pearson Education. Zoran.II Fundamental concepts in video and digital audio: Types of video signals.Introduction. rp 2005. rp. Multimedia and Communications Technology. 1999. Developing with Flex 3. Working with Components.Tech. History of Ajax. 15. Raw Ajax example using xmlhttprequest object. Multimedia Communications: Applications. Flex 4 Cookbook.C. Multimedia in Action. JSON. 12. 2001. Flex3 – A beginner’s guide. color models in video. World Wide Web.Rao. 57 . UNIT-VIII Ajax.Phillips. Dojo ToolKit.R.J. Communications & Applications. 8. 13. Creating a website splash screen. et al. 6. Andleigh. UNIT III Multimedia Data Compression: Lossless compression algorithms. XML.VI Rich Internet Applications(RIAs) with Adobe Flash : Adobe Flash. Wiley India. 2004 2006. and Web Development for Programmers. Rich Internet Applications.Introduction. Future of the Web. rp 2003. Introduction to multimedia communications and Applications. 2008.Gill. Learning Flash with Hands-on Examples. digitization of sound. TMH. Pearson Education. Prabhat K. Wrox Publications. 10.Riecke and A. Flash CS3 Professional Advanced. color models in images. 3.Russell. rp 2008. TMH. UNIT . 2007.Enabled Rich Internet Application : Introduction. Ralf Steinmetz and Klara Nahrstedt. Russel Chun. Advanced Component Development.SPD 2010.Shuman. et. UNIT. Protocols and Standards. Case study: MPEG Audio compression. 2009. Paul J Deitel and Harvey M Deitel. Blogging. Multimedia Making it work. file formats. Atom. Networks.Multimedia Computing. Michele E. James E. action script.R. 4. Wiley India. O’Reilly. Web Services.V Web 2. Mashups. 3. 2. Case study: MPEG Video Coding I. and VoIP. UNIT . 2006. REFERENCES: 1. UNIT . Creating special effects with Flash. Steve Heath. Using XML. 7. TMH. Web 2.VII Rich Internet Applications(RIAs) with Flex 3 . Traditional Web Applications vs Ajax Applications. Location Based Services.User Generated Content. Search. Joseph Balderson. analog video. 2.II Sem 6758038 L 3 T/P/D 1/-/C 3 MULTIMEDIA & RICH INTERNET APPLICATIONS (ELECTIVE – III) UNIT .SPD. Fred Halsall. 7th edition. Principles of Multimedia. 2007. Pearson Education. Multimedia Systems design. Adobe press. Image compression standards. quantization and transmission of audio. Pearson Education.Content Networks. Elsevier. Jon A. Publish your flash movie. RSS. Visual Effects and Multimedia. CSE . Peter Ent. Kiran Thakrar. 1. Mastering Dojo. Rich Internet Applications. Graphics and image data representation graphics/image data types. AJAX. MIDI. SPD. Creating a full scale Ajax Enabled application. UNIT IV Basic Video compression techniques. 9. Flash Movie Development. 2008.0 Monetization and Business Models. Rich Internet Application with Ajax. Middleware. Flash CS5.Davis. TEXT BOOKS: Fundamentals of Multimedia by Ze-Nian Li and Mark S. O’Reilly. Social Media. Social Marking.I Fundamental concepts in Text and Image: Multimedia and hypermedia. 14. 2009. Adobe Flash CS3 Professional. Tay Vaughan. 198. overview of multimedia software tools. web sources. 2007. Tagging. Cengage Learning. Pearson Education.B.INSTITUTE OF ENGINEERING & TECHNOLOGY (AUTONOMOUS) IV Year B. Networks. Joshua Noble. PHI. 11. K.Pearson Education.0. Dragored. SAMS Teach yourself Adobe flash CS3. 2004 Professional Adobe Flex 3. Color in image and video: color science. Lossy compression algorithms. Basic Audio compression techniques. digital video.Deitel Developer Series. 2010.0 What is web 2.

2007. 2004 2. Wireless Ad hoc and Sensor Networks – Protocols. Morgan Kauffman Publishers.B. rp 2010. World Scientific Publications / Cambridge University Press. CRC Press. 4. 2010 3.Perkins. 2007 6. Sensing and Communication Range. Applications UNIT V Data Retrieval in Sensor Networks Classification of WSNs.J. Secure Routing.. Wireless Sensor Networks: An Information Processing Approach. Dataflow style language: TinyGALS. Auerbach Publications. UNIT II Routing in MANETs Topology-based versus Position-based approaches. 2005.S. High-level application layer support. Node-Level Simulators. Taylor & Francis Group. rp2009. 58 . Applications of MANETs. Ananthram Swami. Taylor & Francis Group. et al. Subir Kumar Sarkar. Wireless Sensor Networks – Principles and Practice. Taylor & Francis Group.INSTITUTE OF ENGINEERING & TECHNOLOGY (AUTONOMOUS) IV Year B. Sensor Network Programming Challenges. Pearson Education. Ozan K.. Energy consumption. C. Auerbach Publications.Siva Ram Murthy. Wiley India. Ad hoc Networking. Ad hoc Wireless Networks – A communication-theoretic perspective. Carlos Corderio Dharma P. rp2009 REFERENCE BOOKS: 1. Raheem Beyah. Adhoc Wireless Networks – Architectures and Protocols. Ad Hoc and Sensor Networks – Theory and Applications. Clustering of Sensors. et al.. Xiaojun Cao. UNIT VII Sensor Network Platforms and Tools Sensor Network Hardware. Wireless Ad hoc Mobile Wireless Networks – Principles.Murthy. Protocols and Applications. 2001. Other Routing Protocols. Key Management. TOSSIM TEXT BOOKS: 1. Cooperation in MANETs. Position based routing. Elsevier Science imprint. Taylor & Francis Group. An Auerbach book. 7.Aggarwal.Tech. 5. B. Charles E. Feng Zhao. Leonidas Guibas.II Sem 6758039 L 3 T/P/D 1/-/C 3 ADHOC AND SENSOR NETWORKS (ELECTIVE-IV) UNIT I Introduction to Ad Hoc Wireless Networks Characteristics of MANETs. 2008. CRC Press. Wiley India. UNIT VI Security Security in Ad hoc Wireless Networks. Intrusion Detection Systems. Geocasting TCP over Ad Hoc Networks TCP Protocol overview. Design Issues. Fei Hu. Wireless Ad hoc Networking. 2007.2006. 9. Jagannathan Sarangapani. Security in Ad hoc and Sensor Networks. Challenges. ns-2 and its sensor network extension. 2010 8. Performance and Control. World Scientific Publications / Cambridge University Press. rp2009. Gialuigi Ferrari. Solutions for TCP over Ad Hoc UNIT IV Basics of Wireless Sensors and Applications The Mica Mote. Yu-Chee Tseng. Node-Level Software Platforms UNIT VIII Operating System – TinyOS Imperative Language: nesC.Tonguz. CSE . Shih-Lin Wu. UNIT III Data Transmission in MANETs The Broadcast Storm. Adapting to the inherent dynamic nature of WSNs. et al. TCP and MANETs. Topology based routing protocols. Wireless Sensor Networks – Signal processing and communications perspectives. . Pearson Education. March 2006 2. Multicasting. MAC layer. Routing layer.

Understand the need for long-term archiving solutions and describe how CAS fulfills the need . RAID 3.Physical and logical components of a connectivity environment . components. Storage security domains. and performance Implications. Storage Area Network Fundamentals. REFERENCE BOOKS: 1. replication technologies and their role in ensuring information availability and business continuity. 3. Information Storage and Management. RAID 1+0. TEXT BOOKS: 1. RAID 5. access characteristics. Different RAID levels and their suitability for different application environments: RAID 0. Solutions available for data storage.J. 2002. Key management tasks in a data center. Marc Farley. Osborne. Identify single points of failure in a storage infrastructure and list solutions to mitigate these failures.INSTITUTE OF ENGINEERING & TECHNOLOGY (AUTONOMOUS) IV Year B. RAID 6. Core elements of a data center infrastructure. 59 . Industry standards for data center monitoring and management. RAID 4. List and analyzes the common threats in each domain Unit VIII: Virtualization technologies. Tata McGraw Hill . Wiley. role of each element in supporting business activities Unit II: Hardware and software components of the host environment. logical constructs of a physical disk.Major physical components of a disk drive and their function. Case Studies The technologies described in the course are reinforced with EMC examples of actual solutions.Tech.II Sem 6758040 L 3 T/P/D 1/-/C 3 STORAGE AREA NETWORKS (ELECTIVE – IV) Unit I: Review data creation and the amount of data being created and understand the value of data to a business. NAS. Key protocols and concepts used by each component . Architecture.High-level architecture and working of an intelligent storage system Unit IV: Evolution of networked storage. Critical security attributes for information systems. Compare and contrast integrated and modular storage systems . Unit III: Concept of RAID and its components . and IP-SAN . Understand the appropriateness of the different networked storage options for different application environments Unit V: List reasons for planned/unplanned outages and the impact of downtime. Realistic case studies enable the participant to design the most appropriate solution for given sets of criteria. 2003. 2001. block-level and file-level virtualization technologies and processes. Unit VI: Architecture of backup/recovery and the different backup/recovery topologies . EMC Corporation. Differentiate between business continuity (BC) and disaster recovery (DR) . Key metrics to monitor for different components in a storage infrastructure. and topologies of FC-SAN.RTO and RPO. Impact of downtime. challenges in data storage and data management. 2. RAID 0+1. Remote replication technologies and their role in providing disaster recovery and business continuity capabilities Unit VII Identify key areas to monitor in a data center. RAID 1. “Building Storage Networks”. “Storage Networks: The Complete Reference“. CSE . Meeta Gupta. Information security. Pearson Education Limited. Robert Spalding.Osborne. Tata McGraw Hill .B. Benefits of the different networked storage options.

CSE .Tech. THOMSON Edition 60 . Database Security by Castano Pearson Edition (1/e) 2.INSTITUTE OF ENGINEERING & TECHNOLOGY (AUTONOMOUS) IV Year B.II Sem 6758041 L 3 T/P/D 1/-/C 3 DATA BASE SECURITY (ELECTIVE – IV) UNIT I Introduction Introduction to Databases Security Problems in Databases Security Controls Conclusions UNIT II Security Models -1 Introduction Access Matrix Model Take-Grant Model Acten Model PN Model Hartson and Hsiao's Model Fernandez's Model Bussolati and Martella's Model for Distributed databases UNIT III Security Models -2 Bell and LaPadula's Model Biba's Model Dion's Model Sea View Model Jajodia and Sandhu's Model The Lattice Model for the Flow Control conclusion UNIT IV Security Mechanisms Introduction User Identification/Authentication Memory Protection Resource Protection Control Flow Mechanisms Isolation Security Functionalities in Some Operating Systems Trusted Computer System Evaluation Criteria UNIT V Security Software Design Introduction A Methodological Approach to Security Software Design Secure Operating System Design Secure DBMS Design Security Packages Database Security Design UNIT VI Statistical Database Protection & Intrusion Detection Systems Introduction Statistics Concepts and Definitions Types of Attacks Inference Controls evaluation Criteria for Control Comparison .J. Hassan Afyouni. Database Security and Auditing: Protecting Data Integrity and Accessibility. 1st Edition.Introduction IDES System RETISS System ASES System Discovery UNIT VII Models For The Protection Of New Generation Database Systems -1 Introduction A Model for the Protection of Frame Based Systems A Model for the Protection of Object-Oriented Systems SORION Model for the Protection of Object-Oriented Databases UNIT VIII Models For The Protection Of New Generation Database Systems -2 A 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.B.

Wolf). Serial Data Communication. I2C bus and CAN bus. John Wiley. Unit . (Chapter 8. Pearson Education. Simon). Microcontrollers. Data Transfer and Logical Instructions. Debugging Techniques: Testing on Host Machine.9.VII Basic Design Using a Real-Time Operating System : Principles. Events. Further Details on Interrupts. Complex Systems and Microprocessor. Thomson. Unit . (Chapter 10 and 11 from Text Book 2. Tasks and Data.I Embedded Computing : Introduction.B. Semaphores and Queues.INSTITUTE OF ENGINEERING & TECHNOLOGY (AUTONOMOUS) IV Year B. 5. Simon. (Chapter 6 and 7 from Text Book 3. 6. Linker/Locators for Embedded Software. (Chapters 4. Displays.II The 8051 Architecture : Introduction. Embedded Software Development Tools: Host and Target machines. Semaphores. Design Example-Elevator Controller. Interrupt Routines in an RTOS Environment. Mailboxes and Pipes. CSE . Interrupts.Tech. Serial data Input/Output. Design Examples. Labrosse. External Memory. Programming Tools and Techniques. 3. Simon). Memory Management. Elseveir. An Embedded Software Primer. Unit . Raj Kamal.VI Introduction to Real – Time Operating Systems : Tasks and Task States. Ayala). Micro Controllers. (Chapter I from Text Book 1. Unit . (Chapter 8 from Text Book 1. Kenneth J. D/A and A/D Conversions. An Example System. TMH. Computers and Components. Ayala). REFERENCES : 1. Ayala). Timer Functions. Decimal Arithmetic. Networked embedded systems: Bus protocols.IV Arithmetic Operations. Embedded System Design. Unit . An example RTOS like uC-OS (Open Source). Message Queues. Wayne Wolf.V Applications : Interfacing with Keyboards. Programming the 8051.10 & 11 from Text Book 3. Ajay V Deshmukhi. 8051 Micro controller Hardware. (Chapter 3 from Text Book 2. Using Laboratory Tools.J. 2. 2. 61 . Multiple Interrupts. and Shared Data. Pearson Education. Embedded Systems.VIII Introduction to advanced architectures : ARM and SHARC. Jump and Call Instructions. Counter and Timers. Raj kamal. Internet-Enabled Systems.III Basic Assembly Language Programming Concepts : The Assembly Language Programming Process.II Sem 6758042 L 3 T/P/D 1/-/C 3 EMBEDDED SYSTEMS (ELECTIVE –IV) Unit . TMH. Unit . Frank Vahid.5 and 6 from Text Book 2. TEXT BOOKS : 1. via CMP publishers. Getting Embedded Software into the Target System. (Chapter 7and 8 from Text Book 2. David E. The 8051 Microcontroller . Wolf). Saving Memory and Power. Embedding system building blocks. HardReal-Time Scheduling Considerations. Formalisms for System Design. Ayala) Unit . The Embedded System Design Process. Processor and memory organization and Instruction level parallelism. Tony Givargis. Input/Output Ports and Circuits.Ayala. 4.