BHARATI VIDYAPEETH



2010MCA SyllabusBHARATI VIDYAPEETHBharati Vidyapeeth, the parent body of Bharati Vidyapeeth Deemed University was established in May, 1964 by Dr. Patangrao Kadam with the objective of bringing about intellectual awakening and allround development of the people of our country through education.Bharati Vidyapeeth is now a leading educational institution in the country, which has created a history by establishing within a short span of 45 years or so 171 educational institutions imparting education from the pre-primary stage to post graduate stage. Our colleges and institutions of higher education impart education in different disciplines including Medicine, Dentistry, Ayurved, Homoeopathy, Nursing, Arts, Science, Commerce, Engineering, Pharmacy, Management, Social Sciences, Law, Environmental Science, Architecture, Hotel Management and Catering Technology, Physical Education, Computer Science, Library Science, Information Technology, Biotechnology & Agriculture, Performing Arts etc.These educational institutions which have achieved an acclaimed academic excellence cater to the educational needs of thousands of students coming from different parts of India and also abroad. Our teaching faculty includes highly qualified, experienced, dedicated and student-caring teachers. These educational institutions are located at various places viz. Pune, Navi Mumbai, Kolhapur, Solapur, Sangli, Karad, Panchagani, Jawhar and New Delhi. The spectacular success achieved by Vidyapeeth is mainly a creation of unusual foresight, exceptionally dynamic leadership and able guidance of the founder of Vidyapeeth, Dr. Patangrao Kadam. It has been our constant endeavour to impart high quality education and training to our students and therefore it is no wonder that our institutions have become nationally known for their academic excellence. In recognition of the academic merit achieved by its institutions and potential for development which they have, the Department of Human Resource Development, Government of India and the University Grants Commission of India have accorded the status of a deemed to be university to Bharati Vidyapeeth with its thirty two constituent units.Besides these 171 educational institutions, Bharati Vidyapeeth has also been successfully running a Co-operative Bank, Co-operative Consumer Stores, a Co-operative Poultry, a Co-operative Sugar Factory, Charitable Hospitals and Medical Research Centre and the likeBHARATI VIDYAPEETH DEEMED UNIVERSITY, PUNEThe Department of Human Resource Development, Government of India on the recommendation of University Grants Commission accorded the status of Deemed University to twelve units of Bharati Vidyapeeth (vide their notification No. F.9-15/95-U.3 dated 26/4/96 under the Section 3 of the University Grants Commission Act. of 1956).Subsequently, the Govt. of India on the recommendations of the UGC and AICTE brought three more institutions of Bharati Vidyapeeth within the ambit of Bharati Vidyapeeth Deemed University vide their letter No. F9-15/95-U3 dated 28th July, 2000. The University Grants Commission vide their Letter No. F.No. 3-2/90 CPP-1 dated 17th August 2002, have agreed to bring two more research institutions within the ambit of Bharati Vidyapeeth University. A Medical College at Sangli and a Dental College at Navi Mumbai have also been brought within the ambit of this Deemed University by Ministry of Human Resource Development, Govt. of India vide its notification dt. 19th August, 2004. In Feb. 2005 once again Govt. of India vide notification No. F9-16/2004U3 dated 25th Feb. 2005 brought following several Institutes under the ambit of Bharati Vidyapeeth Deemed University.Constituent Units of Bharati Vidyapeeth Deemed University .1)Bharati Vidyapeeth Deemed University Medical College, Pune-Satara Road, Pune;2)Bharati Vidyapeeth Deemed University Dental College & Hospital, Pune-Satara Road, Pune;3)Bharati Vidyapeeth Deemed University College of Ayurved, Pune-Satara Road, Pune;4)Bharati Vidyapeeth Deemed University Homoeopathic Medical College, Pune-Satara Road, Pune;5)Bharati Vidyapeeth Deemed University College of Nursing, Pune-Satara Road, Pune;6)Bharati Vidyapeeth Deemed University Yashwantrao Mohite College of Arts, Science and Commerce, Paud Road, Pune;7)Bharati Vidyapeeth Deemed University New Law College, Paud Road, Pune;8)Bharati Vidyapeeth Deemed University Social Sciences Centre (M.S.W.), Paud Road, Pune;9)Bharati Vidyapeeth Deemed University Yashwantrao Chavan Institute of Social Science Studies & Research, Paud Road, Pune;10)Bharati Vidyapeeth Deemed University Research and Development Centre in Applied Chemistry, Paud Road, Pune;11)Bharati Vidyapeeth Deemed University College of Physical Education, Pune-Satara Road, Pune;12)Bharati Vidyapeeth Deemed University Institute of Environment Education & Research, Pune-Satara Road, Pune.13)Bharati Vidyapeeth Deemed University Institute of Management and Entrepreneurship Development, Paud Road, Pune;14)Bharati Vidyapeeth Deemed University Poona College of Pharmacy, Paud Road, Pune;15)Bharati Vidyapeeth Deemed University College of Engineering, Pune-Satara Road, Pune;16)Bharati Vidyapeeth Deemed University Interactive Research School in Health Affairs (IRSHA), Pune-Satara Road, Pune;17)Bharati Vidyapeeth Deemed University Rajiv Gandhi Institute of Information Technology & Biotechnology; Pune-Satara Road, Pune;18)Bharati Vidyapeeth Deemed University College of Architecture, Pune-Satara Road, Pune;19)Bharati Vidyapeeth Deemed University Abhijit Kadam Institute of Management and Social Sciences, Solapur.20)Bharati Vidyapeeth Deemed University Institute of Management, Kolhapur;21)Bharati Vidyapeeth Deemed University Institute of Management & Rural Development Administration, Sangli.22)Bharati Vidyapeeth Deemed University Institute of Management & Research, New Delhi;23)Bharati Vidyapeeth Deemed University Institute of Hotel Management & Catering Technology, Pune-Satara Road, Pune;24)Bharati Vidyapeeth Deemed University Yashwantrao Mohite Institute of Management, Malakapur-Karad;25)Bharati Vidyapeeth Deemed University Medical College and Hospital, Sangli;26)Bharati Vidyapeeth Deemed University Dental College and Hospital, Mumbai;27)Bharati Vidyapeeth Deemed University College of Engineering, New Delhi;28)Bharati Vidyapeeth Deemed University Institute of Computer Applications & Management, New Delhi;29)Bharati Vidyapeeth Deemed University Dental College and Hospital, Sangli;30)Bharati Vidyapeeth Deemed University College of Nursing, Sangli;31)Bharati Vidyapeeth Deemed University College of Nursing, Navi Mumbai.32)Bharati Vidyapeeth Deemed University Medical College & Hospital, Navi Mumbai.Since Govt. of India on the recommendation of UGC and AICTE has given the status of deemed university to Bharati Vidyapeeth, its degrees and diplomas have the same status as of those given by any statutory University that are recognised by the U.G.C. Moreover, our colleges of professional education viz. the Medical College, the Dental College and others have their degrees recognised by the respective statutory councils viz. Medical Council of India etc. and also by the State and Central Governments.Bharati Vidyapeeth University, Pune commenced its functioning w.e.f. 26th April, 1996. So far we admitted twelve batches of students to our Medical, Dental, Ayurved, Homoeopathy and other Colleges/Institutes as students of Bharati Vidyapeeth University. In the last eleven years the process of admission to our Medical, Dental, Ayurved, Homoeopathy Colleges was successfully completed. As a crowning glory to all this Bharati Vidyapeeth Deemed University has received "A" grade accreditation by National Assessment & Accreditation Council (NAAC) at autonomous body of UGC.BHARATI VIDYAPEETH DEEMED UNIVERSITY, PUNEFACULTY OF MANAGEMENT STUDIESMASTER OF COMPUTER APPLICATIONS (MCA)REVISED COURSE STRUCTURE (TO BE EFFECTIVE FROM 2010-2011 AT PART I)1. INTRODUCTIONThe Master of Computer Applications (MCA) Program is a full time three year program offered by Bharati Vidyapeeth University (BVU), Pune and conducted at its management institutes in Karad, Kolhapur, Pune, Sangli, and Solapur. All the five institutes have excellent faculty, Laboratories, Library, and other facilities to provide proper learning environment. The five institutes are approved by AICTE to conduct MCA program, while the University itself is accredited by NAAC with an 'A' grade. The expectations and requirements of the Software Industry, immediately and the near future, are visualized while designing the MCA program. This effort is reflected in the Vision and Mission statements of the MCA program. Of course, the statements also embody the spirit of the vision of Dr. Patangraoji Kadam, the Founder of Bharati Vidyapeeth and Chancellor, Bharati Vidyapeeth University which is to usher in “Social Transformation Through Dynamic Education.”2. VISION STATEMENT OF MCA PROGRAMTo create high caliber solution architects and innovators for software development who will also be sensitive to societal concerns. 3. MISSION STATEMENT OF MCA PROGRAM By teaching 'things just not words', 'how to think', and 'how to self-learn'.4. OBJECTIVES OF THE MCA PROGRAMThe main objectives of this course are to prepare the youth to take up positions as system analysts, system engineers, software engineers, programmers and of course as versatile teachers in any area of computer applications. Accordingly the course curriculum aims at developing 'systems thinking' 'abstract thinking', 'skills to analyze and synthesize', and 'skills to apply knowledge', through 'extensive problem solving sessions', 'hands on practice under various hardware/software environments', 'three minor projects and 'one semester full-time industrial training'. In addition, 'social interaction skills', 'communication skills', 'life skills', 'entrepreneurial skills', and 'research skills' which are necessary for career growth and for leading quality life are also imparted.5. LEARNING OUTCOMES FROM THE MCA PROGRAMAt the end of the course the student should be able to(a) Analyze problems and design effective and efficient software solutions(b) Develop software under latest Application Development Environments.(c) Learn new technologies with ease and be productive at all times(d) Read, write, and contribute to technical literature(e) Work in teams(f) Be a good citizen in all respects.6. ELIGIBILITY FOR ADMISSION TO THIS COURSEAdmission to the course is open to any graduate (10+2+3) of any recognized university satisfying the following conditions. The candidate should have secured at least 45% (40% for SC/ST) in aggregate at graduate level university examination.The knowledge of mathematics / Statistics at XII level or higher level is essential except for BCA, B.Sc. (Computer), BCS graduates. Subject to the above conditions, the final admission is based solely on the merit at the all India entrance test (B-CAT) conducted by Bharati Vidyapeeth University, Pune.DURATION OF THE COURSE The duration of this course is three years full time divided in to six semesters. The medium of instruction and examination will be only English.8.STANDARD OF PASSINGPassing Rules A student is allowed to appear for Semester Examination provided the aggregate percentage of attendance is at least 75 % for each Semester.In order to pass the course the student has to secure 40 % marks in the subject.. However, there is no pass mark condition applicable to internal assessment but the student has to obtain minimum 40 % marks in the written examination conducted by the University.This shall be applicable to those subjects where university examination is an integral part of the total assessment.The above rule shall not be applicable to following subjects for which the student has to secure minimum 40 % i.e 20 marks for passing out of 50. The subjects are as follows:Sr. NoSemesterCourseCodeSubject NameSr. No.Sem esterCourseCodeSubject Name1IJ030107Self Learning Course –I 1IIJ030115Self Learning Course – II2.IJ030108Societal Concerns and Life Skills 2II J030116Communication Skills1IIIJ030223Self Learning Course –III 1IVJ030231Self Learning Course – IV2IIIJ030224Foreign Language 2IVJ030132 Entrepreneurship Skills1VJ030339Self Learning Course – V2VJ030340Research Patterns in Information Technology and Applications.B) Award of class:No class shall be awarded to any Semester Examination separately Subject to the condition of passing in all the heads in order to pass the course a student has to secure minimum of 40 % in aggregate of all the heads.The class is to be awarded to a student based on the aggregate marks opted by him in all Semesters i.e. I, II, III, IV, V and VI taken togetherThe award of class shall be as follows: Less than 40 % Fail40 % and above but less than 50 % -- Pass Class 50 % and above but less than 60 % -- Second Class 60 % and above but less than 70 % -- First Class 70 % and above -- First Class with Distinction 9. PROMOTION RULESi. For admissions to MCA Part-III Semester-V candidate must clear all subjects of MCA Part- I iii.No direct admission is allowed in Semesters IV and VI.10. COURSE STRUCTURESEMESTER – ISr. NoSub. CodeSubject TitleWorkloadMarksTPTot.Uni.Int.Pr.Tot.1J030101Basics of Software Development Skills4-47030-1002J030102Procedure Oriented Programming4487030501503J030103Computer Architecture and Assembly Language Programming 4487030501504J030104Business Process Modeling **4-47030-1005J030105Computational Mathematics I4-47030-1006J030106Web supporting Technologies347--1001007J030107Self Learning Course -I2---50-508J030108Societal Concerns and Life Skills1-1-50-50Total261238350250200800** The evaluation for Business Process Modeling with subject code J030104 should be made internal wherein each institute will evaluate students and forward the marks directly to university. The institute will evaluate student for 30 marks during semester and the schedule and question paper of 70 marks will be provided by Dean. SEMESTER – IISr. NoSub. CodeSubject TitleWorkloadMarksTPTot.Uni.Int.Pr.Tot.9J030109Database Management Systems44870305015010J030110Object Oriented Programming 44870305015011J030111Operating System Concepts and Case Studies4 -47030-10012J030112Financial management and Accounting Principles4-47030-10013J030113Computational Mathematics II 4-47030-10014J030114Minor Software Project -1-44--10010015J030115Self Learning Course –II2---50-5016J030116Communication Skills4-4-50-50Total261238350250200800SEMESTER – IIISr. NoSub. CodeSubject TitleWorkloadMarksTPTot.Uni.Int.Pr.Tot.17J030217Software Engineering4-47030-10018J030218Linux Programming44870305015019J030219Computer Networks4-47030-10020J030220Organizational Behaviour and Change Management4-47030-10021J030221Scientific Computation44870305015022J030222Dot NET Technologies448--10010023J030223Self Learning Course –III2---50-5024J030224Foreign Language 2-2-50-50Total281238350250200800SEMESTER – IVSr. NoSub. CodeSubject TitleWorkloadMarksTPTot.Uni.Int.Pr.Tot.25J030225Object Oriented Analysis and Design Patterns4-47030-10026J030226Applied Data Structures and Algorithm Design Patterns44870305015027J030227Distributed Programming44870305015028Elective-I4-47030-10029Elective-II4-47030-10030J030230Minor Project-II-44--10010031J030231Self Learning Course –IV2---50-5032J030232Entrepreneurship Skills4-4-50-50Total261238350250200800SEMESTER – VSr. NoSub. CodeSubject TitleWorkloadMarksTPTot.Uni.Int.Pr.Tot.33J030333Software Project Management and Software Testing44870305015034J030334Web services and SOA Applications44870305015035J030335Soft Computing 4-47030-10036Elective-III4-47030-10037Elective-IV4-47030-10038J030338Minor Project-III-44--10010039J030339Self Learning Course –V2---50-5040J030340Research Patterns in Information Technology and Applications4-4-50-50Total261238350250200800SEMESTER – VISr. NoSub. CodeSubject TitleUniversity Examination41J030341Major Software ProjectLetter Grade: A, B, or F11. ELECTIVESFrom the following groups students have to select only one Group. An elective group will be offered only if a minimum 10 students opt for that group in Semester IV.Group I :Business Applications of ITPaper NoCode NumberSubject Title1J0302BIT01Design of E-commerce Applications2J0302BIT02Intelligent Decision Support Systems3J0303BIT03Knowledge Management4J0303BIT04IT Enabled ServicesGroup II :Computer Networking Paper NoCode NumberSubject Title1J0302CN01Network Architecture and Design2J0302CN02Network Programming3J0303CN03Network Administration4J0303CN04Network SecurityGroup III :Theoretical Computer Science Paper NoCode NumberSubject Title1J0302TC01Design of Language Processors2J0302TC02Advanced Database Technologies3J0303TC03High Performance Computing4J0303TC04Simulation ModelingGroup IV :Advanced Programming Environments Paper NoCode NumberSubject Title1J0302APE01MFC Programming2J0302APE02Advanced Software Engineering3J0303APE03Human Computer Interface Design and Mobile Computing4J0303APE04Open Source TechnologiesGroup V :Embedded Technologies Paper NoCode NumberSubject Title1J0302ET01Embedded System Design and Implementation2J0302ET02Communication in Embedded Systems3J0303ET03System and Device Driver Programming4J0303ET04Embedded and Real-Time Operating Systems12. THEORY EXAMINATION AND STRUCTURE OF QUESTION PAPERSEach university theory paper is of 70 marks and of 3 hours duration. There will be Two sections- Section I and Section II. In Section I there will be SIX questions, each of 10 marks, of which FOUR are to be answered.In Section II there will be Three questions, each of 15 marks, of which TWO are to be answered.The questions in Section II are of applied nature such as writing programs, case analysis, problem solving, data analysis and interpretations etc.The paper must cover entire syllabus.13. PRACTICAL EXAMINATIONThere are two practical papers for 50 marks in each semester and one practical paper of 100 in semesters I and III. Each practical examination is of 3 hours duration. For 50 marks paper 15 marks and for 100 marks paper 30 marks are reserved for internal evaluation. University appointed examination panel will conduct the practical examination of 35 marks or 70 marks as the case may be. However marks will be reported to the university out of 50 or 100 at the end of Practical Examinations. University will appoint the examiners including one internal teacher and one external and internal examiner will be the chairman of the panel. 14. For papers J030107, J030114, J030221, J030226 and J030331 respective institutes shall conduct examinations out of 50 marks and submit to the University along with other Internal marks at least one weak before the commencement of theory examinations.15. Minor Software ProjectStudents in groups of 3 or 4 have to select a problem and develop software. Based on the work done a project report is written in the prescribed format under the guidance of an internal faculty. The project will be evaluated by the University appointed panel of two examiners including one internal and one external for 70 marks. Guide shall evaluate work based on continuous progress for 30 marks. Marks will be reported only out of 100 by combining marks out of 30 given by guide and marks out of 70 obtained at the university examination after completion of viva examination. Students should demonstrate the system on-line at the time of project viva.16. Major Software ProjectEvery student has to undergo a 100 days industrial training during Semester VI. Students have to select a topic in consent with Industry guide and develop software. A report of the work done shall be prepared and submitted for evaluation. The project report will be evaluated by a University appointed panel of two examiners including one internal and one external. A letter grade of A or B will be awarded to indicate pass and F to indicate failNote: For major software projects in semester VI; there will be one panel of examiners for 30 students. 17. Subject wise SyllabusSEMESTER-ISubject Code J030101TitleBasic Software Development Skills Work Load Per WeekL:3 T:1 Lab:0 ExaminationsInternal: 30 University: 70ObjectivesThe main objective of this paper is to emphasize that Systems Thinking and Abstract Thinking are fundamental to efficient and effective software development. So the conventional 'Fundamentals of Information Technology' topics are taught to provide new perspective which is expected to be maintained in all other papers also. Learning OutcomesAt the end of the course, a student should (a) be able to visualize problems as systems and analyze problems carefully, (b) have knowledge about common hardware and software systems that help in software development, (c) have basic knowledge required for all other courses. Pre-requisitesXII Level Mathematics Text Book(s)Presently, there is no book which embodies the spirit and simplicity of this course. The faculty from all institutes will jointly prepare unit-wise study material which would be used as a text book. SyllabusLec.Num.Unit TitleDetailsLearning Resources1Systems ConceptsDefinition of a System, Elements of system, Characteristics of a System, Types of SystemsHand Out2Task Performing Systems (TPS)Components of TPS, DoS Model, Windows Model, Unix Model, LAN ModelHand Out3Hardware SystemBlock Diagram, Analysis of CPUHand Out4Analysis of Internal MemoryHand Out5Analysis of Arithmetic Logic Unit, Input Devices, Output Devices and Control UnitHand OutLec.Num.Unit TitleDetailsLearning Resources6Analysis of Firmware Hand Out7Operating SystemsDefinition of O.S.,Functions of Operating Systems, Types and examples of Operating SystemsUser Interface of Windows Hand Out8Data Communication and NetworkingIntroduction, Data communication Process, Communication concepts9Communication Types, Data transmission Medias10Types of Network: LAN,WAN,MAN, Topologies of LAN11Components Of LAN: Media, NIC, NOS, Bridges, HUB, Routers, Brouters, Switch, Repeaters, Gateways, Modem12Communication Protocols, Roles of communication Protocol, layered protocols.13Communication Processors: Multiplexers, Concentrators, Front End Processors.14Asynchronous & Synchronous Transmission, Switching Techniques.15Client/Server Computing 16Application SoftwareWord ProcessorsHand Out17Spread SheetsHand Out18Data Base Management SystemsHand Out19Presentation ManagersHand Out20Internet SystemsHand Out21CAD Systems, Expert SystemsHand Out22AbstractionDefinition and Goals of Abstraction, Major Types of Abstraction- Problem Abstraction, Procedure Abstraction, Data Abstraction, and Program AbstractionHand Out23Problem AbstractionDefinition of the terms Problem and Problem Abstraction, Examples of Problem AbstractionHand OutLec.Num.Unit TitleDetailsLearning Resources24Procedure AbstractionTop-Down Approach to Problem Solving, Definition of Procedure and Procedure Abstraction, ExamplesHand Out25Data AbstractionNature and Types of Data, Internal and External Representations of Data, Bits and Bytes, ExamplesRepresentation of Non-numeric Data- ASCII, Unicode. Examples Hand Out26Number RepresentationsRepresentation of Non-negative Integers, radix-r representation, conversion from radix-r to radix-sHand Out27Addition and Subtraction of Radix-r Integers, Error DetectionHand Out28Multiplication of Radix-r IntegersDivision of Radix-r Integers, Computing the remainderHand Out29BCD Representation and Arithmetic Hand Out30Representation of IntegersSign-Magnitude forms and Arithmetic r-1th and r th complement forms, Arithmetic in r th complement form Hand Out31Representation of RationalsDefinition of Rational Numbers, Rational ArithmeticHand Out32Representation of Real NumbersMantissa and Fraction form, Exponent form, Normalization, IEEE 745 form, concept of precisionHand Out33Addition and Subtraction of FloatsMultiplication and Division of FloatsHand Out34Errors in Floating Point ArithmeticHand Out35Representation of StringsDefinition of String, Counted String Representation, Null Terminated StringsHand Out36String ManipulationHand OutLec.Num.Unit TitleDetailsLearning Resources37Introduction to Computer LanguagesComputer Languages, Language Types, Definition of ProgramPrograms in Machine LanguageHand Out38Assembly Language, Programs in Assembly Language, InterpretersHand Out39Higher Level Languages, Major Paradigms-Procedure Oriented, Object Based, Object Oriented, Logic Based, Functional anguages, Examples Compilers and Translation Process Hand Out40Program AbstractionDefinition of Program Abstraction and concept of an algorithmHand Out41Algorithm Representation-Pseudo Code, Algorithm Representation- Flow ChartsHand Out42Elementary Algorithms for Search, Sort, and MergeHand Out43Recursive AlgorithmsDefinition and ExamplesHand Out44ProgrammingMeaning of Programming, Concept of Modular ProgrammingHand Out45Computer MaintenanceIntroduction, Typical causes of System Failure & Disaster Recovery.Pages46Computer VirusComputer Viruses, Trojan Horse, Worms. Some reported viruses.Pages47File infectors, Disk Infectors, Partition Infectors, Boot Infectors, Companion Viruses, CMOS Virus, and Hardware Virus.Pages48Societal Impacts of Information TechnologyComputer Privacy, Security & Integrity.PagesSubject Code J030102TitleProcedure Oriented Programming Work Load Per WeekL:3 T:1 Lab:4 ExaminationsInt: 30 Univ: 70Practical Examination: 50ObjectivesThis is a first course in programming. The objective of this paper is to teach the Programming Language C. However, the process of learning a computer language will also be emphasized. Emphasis is also on semantics and problem solving. Fundamental Data structures- Arrays, Linked Lists, Stacks , Queues, and their Applications will also be considered in this course.Learning OutcomesAt the end of the course a student should be able (a) to write good programs in C, (b)Understand and use C libraries, (c) Effectively use Arrays and Linked Lists, (d) Use Files in C programsPre-requisitesXII Level Mathematics Text Book(s)Any suitable books or Handout can be usedSyllabusLec.Num.Unit TitleDetails1Learning a Computer LanguageNatural Languages and Computer Languages- Symbols, Alphabet, Vocabulary and Reserved words, High level words and Identifiers, Sentences and Statements2Executable and Non-Executable Statements, Types of Executable Statements- Input Statements, Assignment and Arithmetic Statements, Control Statements- Sequential, Selection, Iteration Statements, Output Statements3Concepts of a Program and subprogram, Procedures and functions4Syntactic, Semantic, and Logical Errors in a program; Program Correctness- Verification and Validation, Concept of Test Data5Introduction to computer Language CConcepts of Machine, Assembly, and Higher Level Languages, Origins of CLec.Num.Unit TitleDetails6Characters and Character Set of C,Tokens in C, The function main()7Eight-Statement CNon-executable Statements in C- Comments and Type Declarations8Input and Output Statements in C- scanf(), printf ()9Selection Statement in C- if, if..else, conditional operator as a simplification of if..else10Iteration Statement in C- while11Assignment and Arithmetic Statements12User Defined Data TypesKey word struct- Access to components, Examples13Key word enum and its uses14Concept of a functionFunction declaration, Function Definition, and Function Use; Variable Scope and Storage Classes15Operators, Precedence, and Associativity Operators and operands, Unary and Binary Operators, Concept of Expression, Arithmetic Expressions, Relational Expressions, Assignment Expressions.16Evaluation of Expressions, Concepts of Precedence and Associativity, Table of Precedence and Associativity. 17Selection StructuresKey words case, switch, break, default, go to 18Iteration structuresfor, do..while, continue, break19ArraysDefinition, , Random Access to elements -Capacity, Size, Operator [ ], initializing, reading into, writing to and traversing an array 20Two-dimensional Arrays21Arrays as arguments to functions22PointersDirect and Indirect Access; need of pointers, de-referencing, constant and variable pointers.23Semantics of array and function declarations. Using key word const in array declarations 24Function pointers25pointers as arguments to functions and as return types, generic pointer void *26Parsing pointer declarations27Recursive functionsEffect of function calls, Definition of recursive functions. Examples28Miscellaneous conceptsBit-wise operators, key word unionLec.Num.Unit TitleDetails29File Handling in CConcept of a File-File attributes, File organizations, File Access30Sequential Files in C31Direct Access Files in C32Indexed Sequential Files in C33Strings Strings in C and String manipulation functions34Header FilesUnderstanding stdio.h 35Understanding assert.h, limits.h, stdlib.h36Understanding alloc.h and Dynamic Memory Management 37Elementary Data StructuresConcept of Data Structure and Abstract Data Type38ADT Array and ADT Sorted Array39ADT Linked List 40Elementary Data StructuresADT Stack and UDT StackAsArray41UDT Stack As Linked List42ADT Queue and UDT Queue AS Array43Circular Queue44UDT Queue AS Linked List45ADT Doubly Linked List46Applications of Stacks47Applications of Queues48Applications of DequeuesSubject Code J030103TitleComputer Architecture and Assembly Language Programming Work Load Per WeekL:3 T: 1 Lab:4 ExaminationsInt: 30 Univ: 70 Practical : 50ObjectivesInvestigate the basic organization of instruction sets, language translation, and program execution.Understand the basic organization for data storage and access across various pare and contrast implications of various computer architectural attributes.Describe basics of assembly LanguageLearning OutcomesAt the end of this course, student should be able to Understands simple machine architecture and the reduced instruction set computers.Understands memory control, direct memory access, interrupts, and memory organization.Understands basic data flow through the CPU (interfacing, bus control logic, and internal communications).Understands number systems, instruction sets, addressing modes, and data/instruction formats.Understands distributed, multiprocessing, and real-time systems.Is able to write simple assembly language programs.Pre-requisites Basic Knowledge of computer, Number systemsText Book(s)A) Computer system Architecture Morris Mano 3rd EditionB) PC Assembly Language by Paul A. CarterSyllabusLec.Num.Unit TitleDetailsLearning Resources1Digital computer and logic gatesMeaning of Digital computer, study of AND, OR, NAND, NOR, Inverter, Buffer, XOR, XNOR.A 1 -372Boolean algebraBoolean algebra (Boolean function, truth table, logic diagram, basic identities, Demorgans theorem3Flip flopFlip flop SR, D, JK, T, Edge triggered flip flops4Combinational circuits Basic, Half adder and full adder combinational circuits. Flip flop input equation, state table, state diagram Lec.Num.Unit TitleDetailsLearning Resources5Sequential circuits Flip flop input equation, state table, state diagram. Example.6Integrated circuits and decodersBasic, IC families, decoder basic, NAND gate decoder, encoderA 41 -587Multiplexers and RegistersBasics, block diagram, 4 to 1 line multiplexer as example, Register basic, registers with parallel load, Example.8 Shift register, bidirectional shift register with parallel load, binary counters, binary counters with parallel load9Register Transfer and Micro operationsRegister transfer language, register transfer, control function, examples.A-93-9710Bus and Memory transferCommon bus, bus system, bus selection, three state bus, memory transfer (read and write) A 93 - 11911Arithmetic micro operationsBasic, binary adder, binary adder subtractor, binary incrementer, 4 bit arithematic circuit 12Logic micro operationsBasic, special symbols, list of logic micro operations, hardware implementation13Shift micro operations and arithmetic logic shift unit Logical shift, circular shift, arithmetic shift, hardware implementation, arithmetic logic shift unit structure and functions14Instruction cycleFetch, decode, read, execute instruction, Instruction cycle flowchart A 139 - 14515Memory reference instructionsAND, ADD,LDA,STA,BUN,BSA, ISZ InstructionsA 145-15016Input output and interruptInput output configuration, Input output instructions, program interrupt, interrupt cycleA 150 - 15717Design of basic computer and accumulator logicBasic hardware components, control logic gate, control of register and memory, control of common bus, basic accumulator logic.A 157 - 16718Control memoryBasics, control address register, sequencer, pipeline register A 213 - 23519Address sequencingBasics, conditional branching, mapping of instruction, subroutineLec.Num.Unit TitleDetailsLearning Resources20Micro program ExampleInstruction format, Micro instruction format, microoperation, symbolic microprogram, binary microprogram21General register and stack organizationBlock diagram of General register organization, control word, Block diagram of stack organization, register stack, memory stackA 241 - 27322Instruction formats Bacis, three address, two address, one address, zero address instruction23Addressing modesImplied mode, immediate mode, register mode, Register indirect mode, auto increment or autodecrement mode, direct address mode, indirect address mode, relative address mode, indexed addressing mode, base register addressing mode 24Data transfer and manipulationData transfer instruction, data manipulation instructions, arithmetic instructions, logical and bit manipulation instruction 25RISC and CISCA 282 - 28526Input/Output Organization Peripheral devices, input output interface, I/O bus, I/O versus memory bus, isolated versus memory mapped I/O.A 381-39027Asynchronous data transfer, Priority interruptStrobe control, handshaking, Asynchronous serial transfer, Daisy chaining Priority, parallel Priority interrupt, Priority encoder, interrupt cycle.A 391-40228Direct memory AccessDirect memory Access controller, Direct memory Access transfer, introduction to I/O processor.A 415-42029Introduction to ALP Introduction to Assembly language, importance, Decimal, binary, octal, hexadecimal number systems.B 1-2530Machine language, Assembly language, Instruction operands, Basic instructions31Directives, input output, Debugging 32Creating a Program, writing First program, Compiler dependencies, Assembling the codeLec.Num.Unit TitleDetailsLearning Resources33Compiling the C code, Linking the object files, Understanding an assembly listing file, skeleton file34Working with integersInteger representation, Sign extension, Two’s complement arithmetic, Example program, Extended precision arithmeticB 27 - 6235Control structuresComparisons, Branch instructions, The loop instructions36Translating standard control structuresIf statements, While loops, Do while loops 37Shift OperationsLogical shifts, Use of shifts Arithmetic shifts, Rotate shifts 38Boolean bitwise operations The AND, The OR , The XOR operation,The NOT operation, The TEST instruction, Uses of bit operations39Avoiding Conditional Branches Manipulating bits in C, The bitwise operators of C, Using bitwise operators in C40Big and Little Endian Representations, When to Care About Little and Big Endian Counting Bits, Method one, Method two, Method three41Sub ProgramsIndirect addressing, stack, CALL and RETURN instructions.B 65 -9142Calling Conventions, Passing parameters on the stack, Local variables on the stack Multi-Module Programs43Interfacing assembly with C language, Recursive subprograms, Review of C variable storage types44ArraysDefining arrays, Accessing elements of arrays, More advanced indirect addressing, Multidimensional ArraysB 95 -11145Array/String Instructions, Reading and writing memory, The REP instruction prefix , Comparison string instructions, The REPx instruction prefixesLec.Num.Unit TitleDetailsLearning Resources46Floating point Floating Point Representation, Non-integral binary numbers, IEEE floating point representationB 117 - 13547Floating Point Arithmetic, Addition, Subtraction, Multiplication and division48The Numeric Coprocessor, Hardware, Instructions, Quadratic formula, Reading array from file4980 X 86 non floating point instructionsB 173 - 1795080 X 86 non floating point instructionsReference Books:Computer Organization and Design: The Hardware/Software Interface,” Revised Printing Third Edition, by David A. Patterson and John L. HennessyIntroduction to Digital Computer Design V. Rajaraman & RadhakrishnanIBM PC Assembly Language and Programming. Peter Abel. 2001. Fifth Edition. Prentice HallSubject Code J030104Title Business Process Modeling Work Load Per WeekL:3 T:1 ExaminationsInt : 30 Univ: 70 ObjectivesThe main objective is toa) aimed at acquainting students with the evolution and practice of marketing Learning OutcomesAt the end of this course, student should be able to Evolution of management thought and major contributionsProcess of managementEmerging trends in managementPre-requisites-----BookMIS Strategic Engineering Cases --- Arpita Gopal Excel BooksSyllabusLec.Num.Unit TitleDetails1.The management thought:Introduction and definitions 2.Functions of management – planning, Organizing, staffing, leading and control.3.Functional areas of management and their interdependence.4.Marketing functionThe value concept and value cycle 5.Strategic marketing and marketing strategies decisions 6.Consumer behavior and market research7.Marketing control; Customer relationship management8.Use of IT in marketing Management9.Finance function Introduction to financial management.10.Inventory control11.Ratio analysis12.Financial leverage; Capital budgeting;13.Decisions under uncertainty14.Role of IT in Financial ManagementUnit icNo. of lectures(Clock hours)1.Human Resource functionIntroduction to Human Capital Management, Personnel administration2Training & pensation management4.Manpower planning 5,Performance management 6.Workflow management7.Role of IT in Human Resource management8.Production and Operations functionIntroduction Production Planning & Control 9.Materials management; Inventory management, Stores management10.Logistics and supply chain management11.TQM and TPM, 12.Vendor selection and rating13.Role of IT in Production and Operation management14.Professionalisation of Management Professionalism, Impact of globalisation, post globalisation era15.Multinational Corporation Meaning, salient features, MNC’s, Business strategies 16.Emerging Trends in Management Concepts of EBO, KRA, Downsizing, VRS, Outsourcing, Six Sigma, BPR17.Engineering MISER Diagrams and its notations18.Essentials of databases19.Converting ER Diagrams into database20.Engineering the business logic21.Engineering Data Flow Diagrams22.Engineering the user interface23.File organizations24.MIS related to various Business ProcessPayroll Management System25.Resource Allocation Management System26.Banking Management System27.Human Resource Management System28.MIS for Marketing Department29.MIS for Inventory Department30.MIS for Purchase DepartmentSubject Code J030105TitleComputational Mathematics I Work Load Per WeekL:3 T:1 ExaminationsInt: 30 Univ: 70ObjectivesThe main objective is to teach mathematics essential to understand topics in Computer Science and used in Software development processes. Also, the algorithms to manipulate mathematical objects will also be discussed.Learning OutcomesAt the end of this course, student should be able to (a) apply statement calculus to draw inferences, (b) represent sets, relations, trees, and graphs in computer memory , (c) write algorithms to perform operations on mathematical objects, and (d) apply the mathematical concepts in software development.Pre-requisitesXII Level MathematicsText Book(s)Rosen Kenneth H., Discrete Mathematics and its Applications, Tata McGra-Hill, Sixth Edition, 2007SyllabusLec.Num.Unit TitleDetailsLearning Resources1Propositional LogicPropositions, connectives, conditionals, bi-conditionals, truth tables, Translations from and to propositional logicPages 1-102Truth Tables of Compound Propositions, Precedence of Logical Operators, Translating English SentencesPages 10-123Applications of Propositional Logic to System Specifications, Boolean Searches, and Logic Puzzles. Logic and Bit OperationsPages 12-154Logical Equivalences, Using DeMorgan's Laws, Constructing New EquivalencesPages 21-275Predicate LogicPredicates, Quantifiers, Quantifiers with restricted domainsPages 30-386Precedence of Quantifiers, Binding Variables, Logical Equivalences involving Quantifiers, Negating Quantified ExpressionsPages 38-41Lec.Num.Unit TitleDetailsLearning Resources7Translating from English to Logical Expressions, Logic Programming Using Prolog.Pages 41-468Nested Quantifiers, Translating Nested Quantifiers into English and Vice versaPages 51-589Rules of Inference Valid Arguments, Modus Ponens, Using Rules of Inference to Build ArgumentsPages 61-6810Principle of Resolution and its ApplicationsPages 68-6911Fallacies, Rules of Inference for Quantified StatementsPages 69-7212Using Prolog for InferencesHand Out13SetsBasic Concepts of Sets, Power set, Partition of a set, Cartesian ProductsPages 111-11814Set Operations, Set Identities Pages 121-12515Computer Representation of Sets,Algorithms to Perform Set Operations,Computation of Power SetPages 129-130and Hand Out16FunctionsDefinition of Function, One to One function, Onto functionPages 133-13817Inverse and Composition of FunctionsSome Important FunctionsPages 139-14618The Growth of FunctionsBig-O notationPages 180-18319Growth of Combinations of FunctionsPages 184-18820Big -Omega and Big-Theta NotationPages 189-19021Complexity of AlgorithmsPages 193-19922Modular ArithmeticPages 200-20523Applications of Congruences Pages 205-20824Integers and Related AlgorithmsPrimes and Greatest Common Divisors, Least Common MultiplePages 210-21725Algorithms for Integer OperationsPages 219-22926Applications of Number TheoryPages 231-23727Computer Arithmetic with Large Numbers, Pseudo Primes, Public Key CryptographyPages 237-24428Matrix AlgorithmsPages246-252Lec.Num.Unit TitleDetailsLearning Resources29Boolean Matrices, Operations on Boolean MatricesPages 252-25430Induction, Recursion, & Program CorrectnessMathematical InductionHand Out31Recursive definition of FunctionsHand Out32Recursive AlgorithmsHand Out33Program CorrectnessHand Out34RelationsDefinition, Functions as Relations, Relations on a Set, Properties of Relations, Combining RelationsPages 463-46935N-ary Relations, Databases and Relations, Operations on n-ary Relations, SQLPages 474-48036Representing Relations Using Boolean MatricesPages 482-48437Representing Relations Using DigraphsPages 485-48638Reflexive Closure, Symmetric Closure, Paths in a Directed Graph Pages 488-49139Transitive Closure and Warshall's AlgorithmPages 491-49740Equivalence Relations, Equivalence Classes, PartitionsPages 499-50641Compatibility Relations and their ComputationHand Out42Partial Orderings, Hasse DiagramsPages 510-51643Maximal and Minimal Elements, Lattices, Topological Sorting and ApplicationsPages 516-52244Boolean AlgebraBoolean Expressions, Boolean Functions, Identities of Boolean Algebra, DualityPages 693-69745Representing Boolean Functions, Sum-of-Product Expansions, Product-of-Sum Expansions, Functional CompletenessPages 701-70346Logic Gates, Combinations of Gates, Examples of CircuitsPages 704-70947Minimization of Circuits, Karnaugh MapsPages 710-71848Don't Care Conditions, Quine-McCluskey MethodPages 719-723+Subject CodeJ030106TitleWEB Supporting Technologies Work Load Per WeekT:3 Lab: 4 ExaminationsPractical 100ObjectivesMake student familiar with the development of Web applications using HTML, XHTML, JavaScript and XML. Topics covered include HTML Basics, CSS basics, DHTML using JavaScript. More emphasis is given on XML Technology by teaching XML Basics, XML grammar (DTD and Schema), formatting XML Documents using XSL and XSLT by using XML document as data source. Learning OutcomesUpon successfully completing this course the student will be able to - Apply the concepts and the principles of WWW, Should be able to use CSS and JavaScript to achieve DHTML effects. Apply current technology in web application development, including XML, CSS and XSL. Pre-requisitesNoneText Book(s)B1: Web Enabled Commercial Application Development Using HTML, DHTML, JavaScript, Perl CGI by Ivan Bayross (BPB Publications)B2: Professional XML 2nd Edition by WroxB3:Professional XSL by WroxSyllabusLec.Num.Unit TitleDetailsLearning Resources1Overview of Internet and IntranetUnderstanding internet and its need, concept of intranet, difference between internet and intranet, a brief history, internet applications, Internet Service Providers(ISP)B1:Pages 5-92Concept of client and server, web browser and web server, communicating on the internet, concept of domain- Physical domain, virtual domain, registering a domainB1:Pages 10-13Lec.Num.Unit TitleDetailsLearning Resources3Need of IP addressing, Process to assign IP addresses, world Wide WebB1: Pages 13-174Introduction To HTMLOverview of HTML, concept of Tag, types of HTML tags, structure of HTML programB1:Pages 29-335Common HTMLText Formatting Through HTML:Emphasizing Material In a Web Page:B1:Pages 40-916Using Image tag, attributes of Image tag, Lists: Using unordered, ordered, definition lists7Handling TablesTo define header rows & data rows, use of caption tag, changing height & width of table, cellpadding, cellspacing, bgcolor, colspan, rowspanB1:Page 99-1168Linking DocumentsConcept of hyperlink, types of hyperlinks, linking to the beginning of document, linking to a particular location in a document, image as hyperlinks and image mappingB1:Page 125 - 1539FramesIntroduction To frames, using frames & framesets, named framesB1:Pages163-17910Cascading Style SheetsIntroducing CSS, font attributes, color and background attributes, text attributes, border attributes, margin related attributes, list attributesB1: Pages 497-50711Using class and span tagB1: Pages 508-51212Types of style sheets: inline, embedded and external Style SheetsB1: Pages 513-51413Introduction To JavascriptIntroduction to scripting, overview of Java Script, advantages, client side java Script, capturing user input, writing Javascript into HTMLB1: Pages 293-29914Basic JavaScript TechniquesData types, literals, variables and operators, Java Script arrays, dense array, operators, expressionsB1: Pages 300-312Lec.Num.Unit TitleDetailsLearning Resources15Java Script Programming ConstructsAssignment, data declaration, if, switch, while, for, do while, label, break, continue, function call, return, with, delete, method invocation.B1: Pages 313-31716Javascript Technological Issues Types of functions in Java Script- Built in functions, B1: Pages 317-31817User defined functions, function declaration, passing parameters, variable scope, return values, recursive functions.B1: Pages319 -32318Placing text into browser, dialog boxes -Alert dialog box, prompt dialog box, confirm dialog box, window objectsB1: Pages 324-33119Java Script Document Object ModelUnderstanding JDOM, Java Script Assisted Style Sheets, understanding objects in HTMLB1: Pages 341-34520Browser objects, how a javascript enabled browser handles the document object, Form element arrayB1: Pages 346-34921Access to elements of a web page, manipulation of web page elementB1: Pages 349-35122Handling web page events using Javascript, Javascript event handlersB1: Pages 351-35323Forms Used By Web SiteForm object, form object’s Method, properties of form elements, methods of form element,B1: Pages 361-37524Different elements - text, password, button, submit, reset, checkbox, Radio, TextArea, select & option,B1: Pages 376-39525Other built-in Object-String object, math object, date object, B1: Pages 401-40626User defined objects- creation, instances, objects within objects, B1: Pages 406-41027CookiesConcept of cookies, setting a cookie, supply values to cookies.B1: Pages 425-430Lec.Num.Unit TitleDetailsLearning Resources28Working With JSSSIntroducing JSSS, DIV tag, B1: Pages 515-52129Layers, to move forwardB1: Pages 523-53530XML BasicsIntroducing XML, The XML syntax and rules, why XMLB2: Pages 1-2831Comparison with XTML, Using CSS and Data Source Object to render XML Document Handout32Defining a XML StructureIntroduction to DTD, Internal and external DTD, legal building blocks of an XML, Defining elements using XML B2:Pages: 135-16733Defining attributes, entities, using DTD in xml file 34XML namespace, Introduction to schema, Why schema, B2: 169-21035Data types in schema, defining and using Schema. 36XML ParsersXML Parser, validating, non-validating, stream-based and tree based parsersB2:Pages 58-5937Choosing parsing method-DOM, SAXB2:Pages69-7138Introduction To XSLOverview of XSL, XSLT style sheets, XSLT processing model, uses of XSLB3:Pages 15-2039XSLT BasicsXSLT processing: processing model, processing a document, push and pull models.B3:Pages 62-6740XSLT elementsB3:Pages 77-10241XSLT FunctionsB3:Pages 106-10942XSL TransformationXSL formatting objects, XSLT Browser ComplianceB2: 154- 15643XSL transformations, using XSL transformationB2: Pages 157-16844Modular XSLTSelect attribute of <xsl:variable>, variable selection and node sets, B3:Pages 114-11945parameter power: parameters and the outside world, named templatesB3:Pages 123-132SEMESTER-IISubject CodeJ030109TitleData Base Management Systems Work Load Per WeekL:3 T:1 Lab:4 ExaminationsInternal : 30 University: 70 Practical :50ObjectivesThe main objective is to teach the concepts related to database its techniques and operations. SQL (Structured Query Language) is introduced in this subject. This helps creates strong foundation for application of data design. Learning OutcomesAt the end of this course, student should be able to (a)Understand the concepts of database and its management (b) Different Data Models with special emphasis on E-R model and Relational model (c) Write PL/SQL queries with Oracle Pre-requisitesBasics of Software Development Skills and Modeling Business ProcessesText Book(s)Korth. Database Systems Concepts , Tata McGra-Hill, Fifth Edition, 2006SyllabusLec.Num.Unit TitleDetailsLearning Resources1Basic ConceptsDatabase and Need for DBMSDatabase System versus File Systems, Database UsersPages 1-052Architecture and Introduction Data Models3-tier Architecture, View of Data, Instances and Schema, Data Models(Hierarchical, Network)Pages 5-103Entity –Relationship ModelEntities ,Relationships, Keys, different types of attributes, E-R Diagram conventions, degree, cardinality, participation, composite Entities, Strong and Weak Entity,Pages 27-36Pages 42-464E-R Diagram with case study, Reduction of E-R Schema to tables with exampleHandoutPage-62HandoutLec.Num.Unit TitleDetailsLearning Resources5Extended E-R and Relational ModelSuperclass and Subclass Entity types, Attribute inheritance Aggregation, Specialization, Generalization with examples, Logical view of Data, ( Table and its characteristics) Concept Domain, tuplePages-47-55Handout6Relational Model(cont)Relational AlgebraKeys ( composite, candidate, primary,secondary, Foreign), Integrity Rules, Relational Set Operators (Union, Intersect, Difference, Product, Select, Project, ,Divide, Assignment)Handout7Relational AlgebraRelational Set Operators(Join )Relationship within the Relational Database(1:M,1:1,M:N) with example , Codds Rules Examples of RDBMS that implements some Codds rulesHandout8 Interactive SQL –IDatabase Language(DDL,DML, DCL) (create and drop database ,table, modify table, alter table, drop table, Basic Structure(select , from ,where) ,DML(insert ,update, Delete) with all options and simple query demosPages 137-148Handout9Interactive SQL –Iset operations( union, intersect, minus) Aggregate Functions(AVG, Min, Max, Count, Sum) Null Values, Check constraint, Views with query demo Handout10NormalizationFunctional Dependencies, Normal Forms(1NF,2NF,3NF,BCNF) with examplesPages 260-27011Normalization(cont) -ICase Study on normalization Handout12Normalization(cont) -IIDecomposition, Lossless join and dependency preserving DecompositionPages 271-27813Normalization(cont) –IIICase Study on Normalization-IIHandout14File StructureFile Organization, Organization of records in file(Sequential, Clustering)Pages 415-42615Indexing and HashingBasic concepts, indices, B+ Tree index file, B- tree index filePages 445-464Lec.Num.Unit TitleDetailsLearning Resources16Static Hashing, dynamic HashingPages 465-47117Transaction and Concurrency ControlConcept of transaction, transaction state, ACID properties, SerializabilityPages 565-570,57618Lock based protocols, timestamp based protocols, Pages 591-60719Multiple Granularity, Multiple Version Techniques, Deadlock and its HandlingPages 609-61520Backup and Recovery TechniquesFailure Classification, Recovery & Atomicity, Log Based Recovery, CheckpointsPages 639,644,64521Shadow Paging, Recovery with concurrent transactions, Failure with loss of non-volatile storagePages653-660,66322Distributed Databases Homogeneous and Heterogeneous Database, Distributed Data Storage,Data Replication, Data Fragmentation, TransparencyPages 709-71323Distributed Transactions-System Structure, System Failure Modes, Commit Protocols-2 phase commit, 3-phase commitPages 713-717Pages 717-71924Concurrency Control in DDLocking Protocols, Single Lock Manager, Distributed Lock ManagerPages 722-72625Deadlock Handling, Availability Distributed Query Processing-Query Transformation, Heterogeneous Distributed Databases Pages-728-731Pages 735-737Pages 738-73926Oracle (DATATYPES )Interactive SQL -IIData types, Character, Char, Varchar/varchar2, Long, Number, Number (p) - fixed point, Number (p,s) - floating point, Date, Raw, Long raw, Introduction to LOB datatypes (CLOB,BLOB, BFILE), Data Constraints, Types of Data Constraints(Primary key constraints defined at column level and table level)Foreign constraint defined at column level and table level , FK with on delete cascade, FK with on delete set null With SQL demoPages113-116Pages 137-143Lec.Num.Unit TitleDetailsLearning Resources27Unique Key Constraint(column and table level), Null value concepts, not null constraints (column and table value),Check constraint (columnand table level),defining different constraints on a table, user-constraints table, integrity constraints(define and drop) via alter With SQL demoPages 145-15528Interactive SQL-IIIArithmetic Operators, Logical Operators, Range Searching, Pattern Matching(use like predicate)Pages 160-16529Interactive SQL-IIIDual , Numeric Functions, Aggregate Functions, String Functions, Date conversion functions TO_CHAR,TO_DATEPages 165-18330Interactive SQL-IVGroup BY clause ,Having clauseSubqueries- in the form clause, using correlated sub –queries ,multi-column subquery in order by clause with demos Pages 191-193Pages 198-20831Interactive SQL-IVJoins – Equi join, Inner join, Outer join, Cross join, self join with demosPages 208-22032Advance SQL(Performance Tuning)Indexes- simple, composite, unique index, multiple indexes on a table, rowid to delete duplicate rows from table, views- create, updateable view ,views With demosPages239-25633 Views- defined on multiple table, destroying views Sequences creating, altering, dropping With demosPages 258-26134Security Management Using SQL and OOPS in OracleGrant Privilege, Revoke Privileges With demos, Object types, Nested Tables, Varying arrays, Large objects, References with demosPage 269-270Pages274-27635OOPS in Oracle Features of Objects, structure of simple object with demo, object views.Pages 277-28736Introduction PL/SQLAdvantages PL/SQL, Generic PL/SQL block, PL/SQL Data Types, Control Structure- conditional control, Iterative control ,Sequential controlPages320-331Lec.Num.Unit TitleDetailsLearning Resources37Control StructureWith demosPages320-33138PL/SQL TransactionsCommit, Rollback, Save point with demo, Processing PL/SQL block, Cursor, Types of cursor , Implicit cursor with attributes and demoPages334-33939CursorsExplicit cursor with attributes, cursor for loops, parameterized cursors with demosPages 340-35040PL/SQL SecurityTypes of Locks ,Level of Locks, Explicit Locking, using lock table statements, releasing locksPages 353- 35741Explicit lock using SQL and PL/SQL ,DeadLock , Error handling in PL/SQLPages 358-36942Exception HandlingOracle Named Exception Handlers,User-Named Exception Handlers,User Defined Exception Handlers(I/O validations), User Defined Exception Handling with demoPage 370-37643PL/SQL Database Objects Procedure / Functions, Declarative part, Executable part , Exception Handling part, Stored procedure and functions reside, advantages of procedure or function, create stored procedure with demoPages 379-38244FunctionsCreating function, keywords and parameters, using a function with demoPages 382-38745Database TriggersIntroduction, Uses of Database Triggers, Database Triggers Vs Procedure, Types of TriggersPages 403-40646TriggersDeleting Trigger, and demo of trigger and common errors done while working with triggersPages 407HandoutNote @ Lab WorkOracle will be covered as Demo Session PL/SQL will be covered in LabCase study should be covered for ER and NormalizationReference Books:Introduction to Database Management - C.G.DateDatabase Management Systems - Ramkrishnan and GehrkeSubject Code J030110 TitleObject Oriented Programming Work Load Per WeekL:3 T:1 Lab:4 ExaminationInternal: 30 University Exam: 70 Practical: 50ObjectivesMake the students familiar with Object Oriented programming principles using Java. Also tech them concurrent, input/output and event-driven programming using java. Learning OutcomesAt the end of this course, student should be able to Design interfaces, abstract and concrete classesUse concurrent programming, java Collections and utility classes Able to achieve object persistence using object serialization. Design applications using event driven programming. Pre-requisitesAny Programming LanguageText BookHerbert Schildt, Java: The Complete Reference, McGraw-Hill Osborne Media; Seventh Edition, 2007Reference BookCay S. Horstmann and Gary Cornell ,Core Java-Volume-I, Sun Core Series, Eighth Edition, 2008* Learning resources contains page numbers from text books.SyllabusLec.NumUnit TitleDetailsLearning ResourcesIntroduction to Java ProgrammingFeatures of Java, Java compiler, JVM, 10-14Structure of Java Program, writing and executing first Java Program21-23Basic Data types, Conversion between them, Using Scanner class, Wrapper Classes, Auto boxing and unboxing String and String Buffer, Concept of Object pool: String Literal Pool, 359-384Object identity and equality with example of String object, Using Math Class418-420Arrays in java, Object Cloning, Shallow verses deep copy 413-414Introduction to Exception handling in Java Packages in Java, User defined packages205 – 222Lec.NumUnit TitleDetailsLearning ResourcesClasses and Object Concept What is class and Object? Constructing an Object from a class, Types of constructors, this keyword105, 122, 144Writing a Simple Class, Adding Methods to the Class, creating an object and using it.Method overloading, static fields and MethodsB2: 132Methods and parameter passing, pass by value and pass by reference, UML notation for class 138-143Using final methods, Garbage Collection143-145Inner Class, outer class members and accessibility in inner classes145-148Enumeration in java 255-263Inheritance and PolymorphismIs_a or kind_of relationship, a simple example, UML notation for inheritance157-163Inheritance and method overriding, using super, Polymorphism, Dynamic and static binding163-177Abstract classes and Interfaces, realization of interface, UML notation for interface & realization177-202Method signature and Overriding, overriding methods throwing exception, Multiple Inheritance through interfacesConcurrent ProgrammingJava Thread Model, Life cycle of a thread, thread class and its methods, thread Priorities 223-226Creating a thread from thread class, and Runable interface, Choosing a right approach226-231thread synchronization 232- 241Inter thread Communication-I, wait(), notify() and notifyAll() methods.242-254Inter thread Communication-II242-254Java Input/Output A File Class, Concept of stream, InputStream and OutputStream: FileInput and FileOutput Streams556-561FilterInput Stream, DataInput and Data Output Streams , Introduction to Readers and Writers562-578File Reader, File Writer, Input Stream Reader, Buffered Reader, and Print Writer classes578-586Object Streams: ObjectInputStream and ObjectOutPutStream, wrting simple object592-598Lec.NumUnit TitleDetailsLearning ResourcesSerialization & Object persistent, using static and transient data, Serialization and object hierarchy 592-598Java Collections and Utility ClassesCollection Basics- A Collection Hierarchy, Using ArrayList and Vector, LinkedList, Using a Iterator 437Set: HashSet, LinkedHashSet, TreeSet , Comparable and Comparator interfaces441Map, Hashmap, HashTable, TreeMap, LinkedHashMap 464Utility Classes:Date, Calendar, GregorianCalendar, TimeZone, SimpleTimeZone and Locale Classes 503-525Formatting Number, date and currency525-539Generics-I: basics, class parameters315-324Generics-II: bounded types, using wild cards, erasures327-349Introduction to GUI ProgrammingAWT Basics, AWT Component Hierarchy663-667Graphics Programming, Graphics object and Drawing font with various fonts. Event Delegation model, drawing on canvas, 676-Using MouseListener and MouseMotionListener for Free hand drawing Overriding update() method,723-737Layout Managers, Programming with Label, Textfield, TextArea and Buttons, ActionListener 702- 707, 719-721Check Boxes, RadioButtons List and Choice, Scrollbar, AdjustmentListener and ItemListener707-719Designing Menu Applications, WindowListener737-742What is an Applet? Why it required? Applet Class, Applet life cycle. 617-622Applet parameters630-632Using getCodeBase(), getDocumentBase(), getAppletContext() methods. 633-635Note: supplementary Event Handling 637-662Subject Code J030111TitleOperating Systems Concepts and Case Studies Work Load Per WeekL:3 T: 1 Lab:1 ExaminationsInt: 30 Univ: 70ObjectivesThe overall aim of this course is to provide a general understanding of how a computer works. This includes aspects of the underlying hardware as well as the structure and key functions of the operating system. Case studies will be used to illustrate and reinforce fundamental concepts. Learning OutcomesAt the end of this course, student should be able to Explain the concepts of process, address space, and file Compare and contrast various CPU scheduling algorithms Understand the differences between segmented and paged memories, and be able to describe the advantages and disadvantages of each Compare and contrast polled, interrupt-driven and DMA-based access to I/O devicesUnderstand functioning and working of Windows as well as Unix operating system.Pre-requisitesText Book(s)A) Operating systems design and implementation by Andrew Tanenbaum and Albert WoodhullB) Operating systems concept and design by Milan Milenkovic SyllabusLec.Num.Unit TitleDetailsLearning Resources1IntroductionDefinition, Importance and functions of operating systems Hand out 2.Types of operating systemsBatch, Timesharing, Multitasking, multiprogramming, multiprocessingB 10 - 183Online operating system, Real time, distributed operating systems4Different views of operating systemCommand language users view, system call users view5Operating system conceptProcesses, Files, The shellA 15 -206Operating system structureMonolithic system, layered system, Virtual Machine, Client server model A 37 - 437Case StudyInstallation of various operating systems (windows, Linux )Hand out8Unix History, General Structure of UnixHand outLec.Num.Unit TitleDetailsLearning Resources9The shell of Unix operating systemHand out10Windows History, Design principles and architectureHand out11Windows overall karnelHand out12ProcessesProcess concept, Implicit and explicit tasking, process relationship (cooperation and competitions)B 28 -32 13Operating systems view of processesProcess control block, Process state, process state transition, process switching, threading B-43 -8314OS services for process managementCREATE, DELEATE, ABORT, FORK/JOIN, SUSPEND, RESUME, DELAY, GETATTRIBUTE, CHANGE PRIRITY15Scheduling and types of SchedulersScheduling, Need, Long term Scheduler, medium term Scheduler, short term Scheduler, Scheduler design16Scheduling algorithmsFirst come first served, shortest remaining time next, Time slice scheduling, 17Priority based preemptive scheduling, multiple level queues, multiple level queues with feedback, Guaranteed scheduling, Lottery scheduling 18Performance EvolutionFirst come first served, shortest remaining time next, Time slice scheduling 19Case StudyUnix processes and scheduling Hand out 20Windows processes and scheduling Hand out21Memory ManagementBasic Memory Management, monoprogramming without paging or swapping, multiprogramming with fixed partitions.B 310 - 35622swappingMemory Management with bit maps, Memory Management with linked list.23Virtual MemoryPaging, Page tables, Multilevel page table, Translation lookaside buffer24Page replacement algorithmsOptimal Page replacement algorithm, Not recently Page replacement algorithm, First in first out Page replacement algorithms, second chance Page replacement algorithms, clock Page replacement algorithms, least recently Page replacement algorithms, simulating LRU in software Lec.Num.Unit TitleDetailsLearning Resources25Design issues for pagingThe working set model, Local versus global allocation policies, Page size, Virtual memory size.26SegmentationsSegmentation, Implementation of pure segmentation, segmentation with paging with example.27Memory management in UnixHand out28Memory management in windowsHand out29Interprocess communication and Synchronization Need for Interprocess Synchronization, Mutual Exclusion, first algorithm, Second algorithm, third Algorithm B 88 - 10430SemaphoreSemaphore definition, Busy- wait implementation, characteristics of Semaphore31Queuing implementation of semaphoreB 112 -11432Classical Problems in concurrent programming Producer consumer problem with an unbounded buffer, Producer consumer problem with an bounded bufferB 114 - 12533Reader writer problem34Critical region and conditional critical region, what are monitors? Need of it, format of monitor with example. B 132 -15635MessagesBasics, issues in message implementation, naming, copying, Synchronous vs asynchronous message exchange, message length, ICS with messages, interrupt signaling via messages.36DeadlockConditions to occurs the deadlock, Reusable and consumable resources, deadlock preventionB 166 - 17937Deadlock Avoidance, resource request, resource release, detection and recovery38case studyUnix case studyHand out39Windows case studyHand out40File systemsFiles- naming, structure, types, access, attributes, operation. Directories- system, path and operations.A 402 - 45241File system implementationImplementing file and directories, disk space management, file system reliability and performance.Lec.Num.Unit TitleDetailsLearning Resources42SecurityEnvironment, Security flaws, Security attacks, principles for Security, user authentication.43Protection MechanismProtection domains, access control lists, capabilities.44Unix file management and securityHand out45Windows file management and securityHand out46Input/ outputPrinciples of I/O hardware: I/O devices, device controller, DMAA 154 -16647Principles of I/O software : goals, interrupt handler, device drivers, Device independent I/O software.48RAM Disk Hardware and software, DISKS Hardware and software.A 196 -22249Input output management in UnixHand out50Input output management in WindowsHand outReference Books:Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, “Operating System Concepts”, Sixth Edition, John Wiley & Sons (ASIA) Pvt. Ltd, 2003.Harvey M. Deitel, “Operating Systems”, Second Edition, Pearson Education Pvt. Ltd, 2002.Andrew S. Tanenbaum, “Modern Operating Systems”, Prentice Hall of India Pvt. Ltd, 2003.Subject CodeJ030112TitleFinancial Management and Accounting Principles Work Load Per Week L :3 T :1 ExaminationsInt : 30 Univ: 70 ObjectivesTo orient the students to the procedures involved in recording transactions to preparation of Financial statements.To orient the students to techniques of Management Accounting.To orient the students towards the basic knowledge of Finance which is required in the addition of area of specialization.Learning OutcomesAt the end of this course, the students should be able(a) To understand mechanics of Financial accounting(b) They will acquire ground knowledge of application of Management Accounting techniques.(c) The students will become familiar with Finance Function of the company, Financial Statements and Financial Ratios.Pre-requisites-----Text Book(s)R1) Taxman’s Financial Accounting Ashok sehgal, Deepak SehgalR2)Cost and Management Accounting, Vikas Publications M N Arora Eighth EditionR3) Financial Management, Galgotia Publishing Company, R P Rustagi Third EditionSyllabusLec.Num.Unit TitleDetailsLearning Resources1Financial AccountingMeaning, objectives and scope of Financial Accounting, UsersR1 1 to 82Functions of Financial AccountingR1 3 to 63Accounting ConceptsR1 18 to 26Lec.Num.Unit TitleDetailsLearning Resources5Introduction to GAAP and Accounting Standards issued by ICAI.R1 17R1 28 to 366JournalPrinciples of Double entry Book-Keeping, classification of Accounts, Rules of journalizing the transactions.R1 38 to 597Recording the transactions in Journal (Practical Questions)R1 60 to 648Combined entries with trade discount and cash discount.R1 629Practice of problems on JournalR1 6210LedgerNeed and utility of ledger with formatR1 6411Posting journal entries to ledger and preparation of Trial BalanceR1 64 to 6812Final accountsProcess of finalization of accounts and adjustment entries.R1 258 to 29013Preparation of Trading, P&L A/C and Balance Sheet of a Proprietary firmWith adjustments. (Practical Questions)R1 291 to 32514Practice of Final accounts problems15Contents of Annual Report of a joint stock company.Hand out16Cost AccountingConcept of Cost centre and Cost unitObjectives of Cost AccountingR2 1.1 to 1.1117Classification of CostsR2 1.15 to 1.2618Management AccountingDefinition, nature and scope of Management Accounting R2 14.1 to 14.619Distinction between Financial, Accounting and Management Accounting.R2 14.6 to 14.720Advantages and limitations of Management Accounting.R2 14.3 to 14.821Budgetary ControlMeaning and objectives of Budgetary ControlR2 15.1 to15.4Lec.Num.Unit TitleDetailsLearning Resources22Types of budget, Advantages & limitations of Budgetary ControlR2 15.4 to 15.523Preparation of Flexible Budgets (Practical Questions)R2 15.23 to15.2924Budgetary ControlPreparation of Cash Budget(Practical Questions)R2 15.18 to 15.2125Standard CostingMeaning, application of standard Costing, Advantages and LimitationsR2 16.1 to16.526Variance Analysis MCV, MUV, MPV (Practical Questions)R2 16.10 to 16.1627LCV, LEV, LRV (Practical Questions)R2 16.20 to 16.2628Marginal CostingConcept of Marginal Costing, features advantages and limitations.R2 18.1 to 18.1229Cost Volume Profit AnalysisR2 18.1 to 18.1230BEP, P/V ration, Margin of Safety(Practical Questions)R2 18.1 to 18.1231Ratio AnalysisConcept and significance of Ratio AnalysisR3 47 to 5232Understanding Liquidity and Profitability Ratio.R3 61 to 6333Understanding Funds Flow Statement and Cash Flow StatementR3 121 to 123, 134to 13934Financial managementMeaning, nature and scope of Financial ManagementR3 3 to 735Objectives: profit Maximization and Wealth Maximization.R3 9 to 1136Capital BudgetingImportance and process R3 21537Capital Budgeting PBP, NPV, PI (Practical Questions)R3 239 to 25438Practice of Capital Budgeting problems39Management of Working Capital Concept of Working Capital Types, Operating CycleR3 605 to 60740Factors affecting requirement of working capital R3 609Lec.Num.Unit TitleDetailsLearning Resources41Estimation of working Capital requirement.R3 62742Long Term Sources of FinanceSources of Long term finance- Shares, Debentures, Retained earnings, financing through bank & F.I.sR3 767 to 77143Dividend DecisionFactors affecting Dividend Decision, Dividend policiesR3 561 to 562, 58544Understanding the concept of capital StructureR3 511to 51345Understanding the concept of Cost of capitalR3 399 to400Reference Books:S.N. Maheshwari, “Financial Cost and Management Accounting”, Sultan chand & SonsI.M. Pandey, “Financial Management”, Vikas Publications.Financial Accounting TulsianAccountancy by PaulManagement Accounting Khan & JainSubject Code J030113TitleComputational Mathematics- II Work Load Per WeekL:3 T:1 ExaminationsInt: 30 Univ: 70ObjectivesThis is a second paper on Computational Mathematics. This paper is concerned with Elementary and Advanced Counting Methods, Graph Concepts and Graph Representations, and Elementary Graph Algorithms.Learning OutcomesAt the end of this course, student should be able to (a) represent trees, and graphs in computer memory , (b) write algorithms to perform operations on graphs and trees, ( c) Understand Applications of Graphs and Trees Pre-requisitesXII Level Mathematics and Computational Mathematics I (J03005)Text Book(s)Rosen Kenneth H., Discrete Mathematics and its Applications, Tata McGra-Hill, Sixth Edition, 2007SyllabusLec.Num.Unit TitleDetailsLearning Resources1Basic Counting PrinciplesProduct Rule and Extended Product Rule; Examples; Sum Rule and Extended Sum Rule; Examples; Pages 335 to 3412Complex Counting ProblemsHandout3Pigeonhole Principle and Generalized Pigeonhole PrinciplePages 341 to 3534Permutations and CombinationsPermutations; CombinationsPages 355 to 3605Binomial Theorem; Pascal's Identity and Triangle; Identities of the Binomial CoefficientsPages 363 to 3686Permutations with repetitions; Combinations with repetitions; Pages 370 to 3747Permutations with Indistinguishable ObjectsPages 375 to 3798Generating Permutations Pages 382 to 3849Generating Combinations; Computation of Binomial coefficientsHand Out10Advanced Counting TechniquesRecurrence Relations; Modeling with recurrence RelationsPages 393 to 40011Lec.Num.Unit TitleDetailsLearning Resources11Solving homogeneous Linear Recurrence Relations with Constant CoefficientsPages 404 to 40812More ExamplesPages 408 to 41113Solving Non-homogeneous Recurrence RelationsPages 411 to 41514Divide and Conquer Algorithms and Recurrence RelationsPages 418 to 42015More ExamplesPages 421 to 42316Generating FunctionsUseful Power Series; Extended Binomial TheoremPages 428 to 43217Counting Problems and Generating FunctionsPages 432 to 43718Using Generating Functions to Solve Recurrence RelationsPages 437 to 43919Generalized Inclusion-Exclusion Principle Pages 444 to 44820 Applications of Inclusion-Exclusion Principle; DerangementsPages 449 to 45621Graphs and Graph ModelsBasic Definitions and ExamplesPages 533 to 53922Handshaking TheoremPages 541 to 54523Special Simple Graphs; Applications; New Graphs from OldPages 545 to 55224Graph RepresentationsAdjacency Lists; Adjacency Matrices; Incidence Matrices; Pages 555 to 55925Isomorphism of GraphsPages 559 to 56226Connectivity in GraphsPaths, Simple Paths, Cycles, Simple CyclesPages 565 to 56827Connectedness in Undirected Graphs; Connected ComponentsPages 568 to 57028Connectedness in Directed Graphs; Paths and Isomorphism; Counting Paths between VerticesPages 570 to 573Lec.Num.Unit TitleDetailsLearning Resources29Euler and Hamiltonian PathsEuler Paths and Euler CircuitsPages 577 to 58230Hamiltonian Paths and CircuitsPages 583 to 58731Shortest Path ProblemsShortest Path Problem; Dijkstra's Algorithm; Traveling Salesman Problem Pages 591 to 59932Planar Graphs and Graph ColoringPlanar GraphsPages 601 to 60333 Euler's Formula; Kuratowski's TheoremPages 603 to 60934Coloring, Chromatic Number; Four Color TheoremPages 610 to 61535Applications of Graph ColoringPages 615 to 61636TreesBasic Definitions;Pages 627 to 63437Properties of TreesPages 634 to 63738Applications of TreesBinary Search TreesPages 639 to 64239Decision Trees ; Prefix CodesPages 642 to 64740Game TreesPages 648 to 65141HeapsHand Out42Tree TraversalUniversal Address System, Traversal AlgorithmsPages 654 to 66643Spanning TreesDefinition; Depth First Search; Breadth First Search Pages 668 to 67844Minimum Spanning TreesPrim's AlgorithmPages 682to 68345Kruskal's Algorithm Pages 684 to 685SEMESTER-IIISubject Code J030217TitleSoftware Engineering Work Load Per WeekL:3 T: 1 Lab:1ExaminationsInt: 30 Univ: 70ObjectivesTo introduce the methodologies involved in the development and maintenance of software over its entire life cycle.Learning OutcomesAt the end of this course, student should be able to Understand life cycle models, Requirement elicitation techniques, understand the concept of Analysis and Design of software.Implement software engineering concepts in software development to develop quality software which can work on any real machine. Pre-requisites Basic Knowledge of computerText Book(s)SOFTWARE ENGINEERING A PRACTITIONERS APPROACH fourth edition BY Roger S. Pressman McGraw Hill International EditionSyllabusLec.Num.Unit TitleDetailsLearning Resources1Introduction to Software Engineering Software, software characteristics, software types, software components Hand out2Definition of Software engineering, importance, principles of software engineering: (Separation of concerns, Modularity, Abstraction Anticipation of change, Generality, Incrementability, Consistency)Hand out3Difference between software engineering and software programming, Members involved in software developmentHand out4Software engineering a layered technology, process method and tools, generic view 22 - 265Software processGeneral software development life cycle (all the phases of the life cycle is covered in detail)Hand outLec.Num.Unit TitleDetailsLearning Resources6Waterfall model with advantages and disadvantages, Prototyping model with advantages and disadvantages 28 - 347Spiral model, advantages and disadvantages, Rapid application development model with advantages and disadvantages, Incremental model34 – 428Feasibility studyNeed of Feasibility study, types of Feasibility study, steps in feasibility studyHand out9Why Cost Benefit analysis? Importance of cost Benefit analysis, Cost Benefit analysis process Hand out10Requirement Engineering What is Requirement Engineering, Types of requirementsHand out11Requirement elicitation techniques– Traditional methods: Review of documents, on site observation, Interview and questionnaires Hand out12Requirement elicitation techniques– Modern methods: Prototyping, workshop, Brainstorming, JAD, Videoconferencing, Use case etc. Hand out13Requirement analysis ProcessHand out14Need of Requirement verification and validations, Verification and validation process, Verification and validation document outlineHand out15Principles of Requirement Specification, Software Requirement Specification document OutlineHand out16Characteristics of good SRS: correct, complete, unambiguous, consistent, modifiable, traceable, UnderstandableHand out17Software InspectionNeed of the Review , types of software reviewsHand out18Members involved in inspection team, check listHand out19Detailed Inspection processHand outLec.Num.Unit TitleDetailsLearning Resources20Analysis concept and modeling Analysis principles : Information domain, modeling, partitioning, essential and implementation views278 - 28521Data Modeling: Data objects, attributes, relationships, Cardinality, Modality301 - 30922Entity relationship diagramming Mechanism Hand out23Functional Modeling: Importance, tools for functional modeling309 – 312, Hand out24Data flow diagramming MechanismHand out25Behavioral Modeling 316 - 32026Data Dictionary: Importance of Data Dictionary, Preparation of data dictionary.330 – 334 Hand out27Design concept and MethodsSoftware Design and software Engineering, Design process and principles 341 - 34628Design concepts: Abstraction, Refinement, Modularity, Architecture, control hierarchy, structural partitioning, Data structure, procedure and data hiding 346 - 35629Modular design: Functional independence, Cohesion and coupling 357 - 36130Data Design : principles of Data Specification, database design371 - 37331Architectural design: contributors, area of application, Process: Transform flow and transaction flow 373 - 37732User Interface designUser Interface design : Elements of good design, design issues, Features of modern GUI, Guidelines for interface design393 – 395403 - 406Hand out33Procedural design: structured programming, Program design language406 -41234Decision tree and decision tableHand outReport Design 35Software quality assuranceQuality concept: (quality, quality control, quality assurance, cost of quality), SQA issues and activities180 - 18436Formal Technical review : Review meeting, review reporting and review guidelines190 -19437Definition and classifications of software Defects, SQA planHand outLec.Num.Unit TitleDetailsLearning Resources38Software quality standards: ISO and CMM standards 202 – 204Hand out39Software configuration managementWhat is configuration management, Baseline, Software configuration items210 - 21440SCM process, identification of objects, Version control214 – 22041Change control, configuration audits and status reporting 220 - 22442Software reuse Management issues: Roadblocks to reuse, hardware analogy, suggestions reuse process: Reusable Artifacts, Process model 729 - 73543Domain engineering: Domain analysis process, Characterization functions, structure modeling and points735 - 74044Building reusable components: analysis and design of reuse, construction methods, and component based development.Economics of software reuse: impact on quality, productivity and cost, reuse metrics.740 – 743,747 - 75145ReengineeringBusiness process Reengineering: Business process, Principles and BPR model.757 -76246Software reengineering: Software Maintenance, Software reengineering process model 762 - 76747Reverse engineering: to understand processing and data, Reverse engineering user interfaces 767 - 77348Restructuring: Code and Data restructuring forward engineering: forward engineering for client server architecture, forward engineering user interfaces773 - 77849Computer Aided software engineering What is CASE? Importance of CASE tools, future of CASE tools Hand out50Tools for information engineering, Project planning tools, risk analysis tools, Project management and testing tools.808 - 81351Tools for Quality assurance, configuration management, Analysis and design, Database management, Interface design and programming tools.808 - 813Subject Code J030218TitleLinux Programming Work Load Per WeekL:3 T: 1 Lab:4 ExaminationsInt : 30 Univ: 70 Practical : 50ObjectivesThis course is designed to teach the Unix and Linux operating systems Environments. Emphasis will be on using the command line ,utility commands, working with files and directories, using the shell and creating and reading simple shell scripts.?Students will write & Execute C programs in Linux Environment. It also covers GNOME, Perl and Internet Programming Learning OutcomesThe student will: 1. Continue to use and expand the usage of commands and skills related to LINUX Environment2. Develop in-depth, working knowledge of the LINUX operating systems. 3. Explain and be able to use shell scripting techniques. 4. Organize data on a computer system using files, subdirectories, and directories. 5. Use the LINUX, C/C++ programming capabilities of the LINUX operating system. 6. Knowledge of GNOME, Perl and Internet ProgrammingText Book(s)UNIX- Concepts and Application– by Sumitabha Das.Beginning Linux Programming – by Richard Stones & Neil MatthewLectureNumberTopic DetailsReferences01Introduction :- Operating System, Various Definitions Operating systems, Evolution of O.S.A P 4 andHandouts02Types of Operating System, Characteristics of O.S. and FunctionsHandouts03Structure of DOS and Linux Operating SystemHandouts04KDE, Gnome and Text Based EnvironmentsHandouts05Features of Unix / Linux Operating System, Installing LinuxA P 2506Understanding the major Linux distributions.Open Source licensing – GPL and othersA P 1707Understanding Open Source., Background and history of LinuxHandoutsLectureNumberTopic DetailsReferences08Basic Commands & UtilitiesCommands for Handling Ordinary filescat, cp, rm, mv, more, wc, od, cmp, comm, tar, zip, unzipA P 83 - 10209Basic Commands & UtilitiesPwd, mkdir, rmdir, ls, chmodA P 65-79A P 106-11611Process, process basics, The Shell Process, Parents and Children, Process status (ps command), Process system calls – fork, exec, wait A P173-18012Running Jobs in Background, Killing Process with signalsA P182-18513Simple Filters – pr, head, cut, paste, sort, unique, tr A P228-23914Filters using regular expressionA P246-26315Advanced Filters – awk, printf A P382-38916Shell, Shell Scripts, Various types of ShellsA P194-20517Shell Programming, Variables, Simple Scripts Control sequences and Structures, FunctionsB P29-52A P271-29818Creating & Executing Shell ScriptsHandouts19Creating & Executing Shell ScriptsHandouts20C programming under Linux EnvironmentHandouts2122232425System Calls for the files and I/OA P 493 - 526A P 493 - 5262627System Calls for the Process ControlA P534-570A P534-5702829Process & Signals – Process, Process structure, system processes, Process scheduling, threads, signals, signal handlingB P 321-337B P 321-337303132Inter Process Communication – pipe, process pipe – popen, pclose, parent child processes, named pipesB P 364-3073334Semaphores, Message Queues, and Shared Memory – semaphores, semaphores definition, Unix semaphore facilities, shared memory, shared memory functions, message queuesB P 409 - 4343536LectureNumberTopic Details References37Sockets – socket, socket functions, socket attributes, socket types, socket protocols, creating a socket, socket communicationB P 435- 4633839Programming GNOME – An introduction to GNOME, GNOME Architecture, programming in GNOME using GTK +, Button, List BoxB P 569 - 5944041The Perl Programming – variables, arrays, operators and functionsB P 595 - 62542Programming With Internet – writing HTML program, client and server side maps, CGI (Common Gateway Interface) , Writing a server side CGI program, B P 626 - 65543444545Subject Code J030219TitleComputer Networks Work Load Per WeekL:3 T: 1 Lab:0 ExaminationsInt: 30 Univ: 70ObjectivesTo deal with the fundamental issues of Computer Network. The Course is designed around OSI and TCP/IP Model. This course shall emphasis on developing an understanding of the underlying principles of computer networking and concept of advance network technologiesLearning OutcomesAt the end of this course, student should be able to Understand the basic Architecture of computer Network and functioning of different layersUnderstand application of different protocolsUnderstand concept of advanced NetworksPre-requisites Basic Knowledge of computerText Book(s)A.S. Tanenbaum, Computer Networks (4th ed.), Prentice-Hall of India, 2003W.Behrouz Forouzan and S.C. Fegan, Data Communication and Networking, McGraw Hill, 2006SyllabusLec.Num.Unit TitleDetailsLearning Resources1-2Introduction to Computer NetworksWhat is Computer Network, Network Goals and MotivationsApplication of NetworksClassification of NetworksHand out3-4Network software:Network ProtocolsProtocol HierarchiesDesign issues for the LayersConnection Oriented and Connectionless ServicesService PrimitivesRelation of services to ProtocolsA-26 to 36Lec.Num.Unit TitleDetailsLearning Resources5-6Network Models:The OSI Reference ModelThe TCP/IP Reference ModelComparison of OSI and TCP/IP Reference ModelA critique of OSI ModelA critique of TCP/IP ModelA-37 to 487-8Examples of some networks:Internet, X.25, ISDN, Frame relay, ATM, Ethernet, Wireless Lans- (wi-fi)A-49 to 689Data Transmission (Physical Layer)Signals: Analog and Digital Signals, Data Rate, Transmission Impairment, Signal Measurement : Throughput, Propagation Speed and Time, Wavelength, Frequency, Bandwidth, SpectrumHandout10Transmission Media& its Characteristics: Guided and Unguided MediaB – 191 to 21111-14Synchronous and Asynchronous Transmission Multiplexing: FDM,WDM,TDMSwitching: Circuit ,Message and Packet SwitchingMobile Telephone Systems: 1G-AMPS,2G-GSM,GPRS,EDGE,CDMA3G-UMTS, WCDMA, CDMA-2000Handout15-16Data Link LayerData link Layer Design Issues: Services provided to Network Layer, Framing, Error Control, Flow ControlA-183 to 19917-18Elementary Data Link Protocols: ARQ, Stop and Wait ARQ, Sliding Window ARQ, Go-Back-N ARQ, Selective Reject ARQB – 311 to 34619Examples of Data Link Protocol: HDLC,SDLC,PPPA+BLec.Num.Unit TitleDetailsLearning Resources20-22Media Access ControlChannel Allocation Problem: Static Channel Allocation, dynamic Channel AllocationAdvantages of Multiple Access sharing of Channel ResourceContention Based Media Access Protocols: Pure ALOHA, slotted ALOHA, Carrier Sense Multiple Access(CSMA), CSMA/CD,CSMA/CA A-247 to 25923-24Ethernet: as a Example of Physical and MAC LayerPolling based Media Access Control Protocols: Token Ring, Token busA-271 to 286Handout25-26Data Link Layer Switching: Bridges, Spanning Tree Bridges, Remote Bridges, Other connecting Devices: Hub, Routers, Switch, Repeaters, Gateways. Handout27-28Network LayerNetwork Layer Design Issues:Store and Forward PacketSwitchingServices to Transport LayerImplementation of Connection Oriented and Connectionless ServicesComparison of Virtual Circuit and Datagram SubnetA-343 to 34929-30Routing Algorithms:Static/ Dynamic, Direct/ Indirect, Shortest Path Routing, Flooding, Distance Vector Routing, Link State Routing, Hierarchical Routing, Broadcast Routing, Multicast RoutingHandout31-32Congestion Control Algorithms:General Principal of Congestion Control, congestion prevention polices, Load shedding, Jitter ControlHandout33-35Internetworking and Network Layer in InternetTunnelingInternetwork RoutingFragmentationIP-ProtocolIP-Address Classes(A,B,C,D,E)Broadcast address , Multicast address, Network Mask, SubnettingInternet control Protocol-ICMP,IGMPOSPF-Interior Gateway Routing ProtocolBGP-Exterior Gateway Routing ProtocolInternet MulticastingMobile-IPIPv6A-431 to 472 + Handout36-37Transport and Application Support ProtocolsTransport service, Service PrimitivesBerkley SocketsElements of Transport control: addressing, connection establishment and release, flow control & buffering, multiplexing, crash recoveryInternet Transport Protocols: TCP/UDPRemote Procedure Calls,RTPA-481 to 572Lec.Num.Unit TitleDetailsLearning Resources38-39Session Layer : Token ConceptPresentation Layer: Data Encryption and Data Security, Message AuthenticationApplication Layer: Domain Name Service, Telnet, FTP, SMTP, SNMP, WWWHandout40-42Advance NetworksConcept of 4G Networks, Advance Wireless Networks: Infrastructure based and Infrastructure less Networks, IEEE 802.11x standards, Physical and MAC Layer Description of 802.16, 802.20, Bluetooth, Infrared, MANET, Sensor Networks. Technical Issues of Advanced NetworksHandout43-46Mobile Ad-hoc NetworksIntroductory concepts, Destination-Sequenced Distance Vector protocol –overview, route advertisement, extending base station coverage, properties of DSDV protocol, Dynamic Source Routing protocol – overview and properties, DSR route Discovery, route maintenance. Support for heterogeneous networks and mobile IP. Multicast routing with DSR. AD Hoc On-Demand Distance Vector protocol – properties, unicast route establishment, multicast route establishment. Broadcast, Optimization and Enhancements. Link Reversal Routing – Gafni Bertsekas algorithm, lightweight mobile routing algorithm. Temporally ordered routing algorithm. Preserving battery life of mobile nodes – Associativity based routing, effects of beaconing on battery life. Recent trends in MANET.Handout47-50Wireless Sensor NetworksSensor networks overview: Introduction, applications, design issues, requirements. Sensor node architecture. Network architecture: Optimization goals, evaluation metrics, network design principles. Sensor network operating systems. Network protocols: MAC protocols and energy efficiency. Routing protocols: Data centric, hierarchical, location based, energy efficient routing etc. Sensor deployment, scheduling and coverage issues, self configuration and topology control. Querying, data collection and processing , collaborative information processing and group connectivity. Target tracking, localization and identity management, power management,. Security and Privacy.HandoutCOURSE NO:- J030220COURSE TITLE:- ORGANIZATIONAL BEHAVIOR AND CHANGE MANAGEMENTCOURSE OBJECTIVES:-INTRODUCTION TO ORGANIZATIONAL BEHAVIORDefinition, Scope and Importance of Organizational Behavior, Organization Management and Organizational Behavior, Historical Evolution of Organizational Behavior, Industrial Revolution, Scientific Management, The Human Relations Movement. Different Models of Organizational Behavior, Autocratic, Custodial, Supportive, Collegial, SOBC Models. Recent developments & challenges in organizational Behavior. Developing People centered Organizations and Skills.INDIVIDUAL BEHAVIOR IN ORGANIZATIONSDIFFRENCES:- Self Concept, Personality and Emotions.*PERCEPTION:- Perceptual selectivity, Social Perception & Attribution.ATTITUDES:- Nature, Formation and Dimensions of attitudes, Job Satisfaction, Outcomes of Job satisfaction, Organizational Commitment, meaning, outcome and guidelines to enhance organizational commitment. MOTIVATION:- Needs and drives, definition. Theories content theories- Maslow, Herzberg’s Two factor Theory and ERG Theory. Process Theories – Equity theory, Vroom’s Theory, Porter and Lawlers contribution, contemporary theories, Goal setting theories and Path Goal Approach and MBO.LEARNING:- Definition, Theories and application. Theories – Classical, Operant, Social and Experiential theories and their applications. FOUNDATION OF GROUP BEHAVIORDefinition of groups, Classification of Groups, stages of Group development, Group dynamics, Group Decision Making, Difference between groups and team creating and effective team. CONFLICTIntroduction, Definition, Nature and Types of Conflicts. Constructive and Destructive conflicts, Conflicts at Individual , Group and Organizational Levels. Approaches to Conflict Resolution.LEADERSHIPConcept and definition, Theories of leadership, Trait theories, contingency theories, and situational theories. CHANGE MANAGEMENTNeed for change, Nature of change, Reasons for resistance, Types of resistance, Building Support for change, and three stages in process of change, Building support for change. CASES AND EXCERCISESBooks of References:John. W. Newstrom and Keith Davis. – Organizational Behavior (Tata Mc Graw- Hill Publication) Fifth Reprint 2000Robert Kreitner and Angelo Kinicki – Organization Behavior (Tata Mc Graw- Hill Publication) International Edition 2004Organizational Behavior – Fred anizational Behavior – Stephens. P Robbins. Organizational Behavior – Aswathappa. SESSIONSDURATIONCOVERAGE1.One HourDefinition, Scope, importance of OB, Organization, Management and OB. 2.One HourHistorical Evolution of OB, Industrial Revolution, Scientific Management, The Human relations Movement and developments of recent origin.3.One HourDifferent Models of organizational Behavior, Autocratic, Custodial, Supportive, Collegial and SOBC Models.4.One HourRecent developments and challenges of OB.5 – 6.Two Hours(a) Individual differences, Self concept, personality and its definition.(b) The big five personality dimensions, Locus of control and personality assessment. 7 – 8.Two HoursEmotions, positive and negative, understanding and developing personal and social competence through emotional intelligence. 9 – 11.Three HoursPerception, Definition, Perceptual selectivity, information processing, social perception, attribution and managerial challenges.12 – 14 Three HoursAttitudes, Formation & Dimensions of attitudes, Job satisfaction, Organizational commitment, meaning, outcomes and guidelines to enhance Organizational commitment. SESSIONSDURATIONCOVERAGE15 – 20Six HoursMotivation- Human Needs and Drives, Theories - Content theories, Process theories and contemporary theories. 21 – 23 Three HoursLearning , definition, Theories- Conditioning , Social and Experiential theories. Application of learning.24 - 28Five HoursGroups – Definition, Stages of Group Development, Group Dynamics, Groups & Teams, Creating a Good team and Case analysis or Exercise.29 - 31Three HoursIntroduction, Nature and Type of Conflicts, individual, Group and organizational Conflicts.32 - 36Five HoursLeadership, Concept, Definition. Theories – Trait Theory, Contingency and Situational Theories. 37 – 41 Five HoursNeed for change, Nature of change, Reasons for resistance, Types of resistance, Building Support for change, and three stages in process of change, Building support for change. 42 – 45 Four HoursCase Study, Applications, Revision and Evaluation. Subject Code J030221TitleScientific computation Work Load Per WeekL:3 T:1 Lab:3ExaminationsInt: 30 Univ: 70 Practical : 50ObjectivesThe aims of this course are to provide introductions to floating-point arithmetic, numerical analysis and numerical software. Current implementations of floating-point arithmetic will be described. The basic principles of good numerical techniques will be illustrated by examples, but it will be shown that the design of a numerical algorithm is not necessarily straightforward, even for simple problems. The emphasis of the course will be on principles and practicalities rather than mathematical analysis .Learning OutcomesIn this course, the successful student will learn to:approximate solutions of nonlinear equations interpolate data points with polynomials estimate the numerical values of derivatives and integrals numerically solve ordinary differential equations find approximate solutions of linear systems of equations (time permitting) recognize problems for which a numerical approach is appropriate analyze how and why the algorithms discussed workPre-requisitesXII Level MathematicsText Book(s)Introductory Methods of Numerical Analysis by S.S. Sastry,Numerical Methods by E.BalagurusamyFundamentals of Stastics by S.C.Gupta, Operation Research by ThahaSyllabusLec.Num.Unit TitleDetailsLearning Resources1.IntroductionWhat is scientific Computation, Difference with other puter Codes and ArithmeticInternal Representation of IntegersPage-40 (R1)3.Conversion from base-r to base -s4.Integer Arithmetic in base-r-system, Errors in Integer arithmeticLec.Num.Unit TitleDetailsLearning Resources5.Number RepresentationFloating point RepresentationPage-49 (R1)6.Fixed point Representation7.Normalized floating point8.Floating point Arithmetic9.Approximations and Errors in ComputingTaxonomy of Errors in Computing, Inherent Errors Numerical Errors, Modeling ErrorsPage-61 (R1)10.Absolute & Relative Error, Machine Epsilon Error Estimation, 11.Calculus of Finite DifferencesFinite difference operatorPage- 66(R1)12.Construction of a difference tables13.Application of Difference Tables14.Introduction to the problem and Methods of Solutions,Iterative Methods-Starting and Stopping15.Roots of Non-linear EquationsIntroduction to the problem and Methods of Solutions, Iterative Methods-Starting and StoppingPage-121 (R1)16.Bisection method, False position method Newton Raphson method, Secant method17.Fixed Point Method18.InterpolationForward method, Backward methodPage-275 (R1)19.Divided difference method20.Lagrange’s method, Inverse interpolation21.Numerical IntegrationNewton Cote’s formulaPage-371 (R1)22.Simpson’s 1/3, Simpson’s 3/8Lec.Num.Unit TitleDetailsLearning Resources23.Simultaneous linear equationGauss elimination methodPage-209(R1)24.Pivoting, ill conditioned equations25.ProbabilityDefinition, Types of ProbabilityPg 470-495(R3)26.Total Probability theorem(Multiplication rule, Baye’s Theorem, Sum rule)27.Random Variables(Discrete random variable & Continuous distribution)Introduction, DefinitionPg 506-549(R3)28.Probability distribution, probability mass function29.Expectation and Variance, Theorem on expectation30.Binomial distribution & Example31.,Poisson distribution & Example32.Exponential distribution & Example33.Normal distribution & Example34.Normal distribution & Example35.Measure of Central Tendency Mean, Mode, MedianPage 67-138 (R3)36.Measure of DispersionStandard Deviation, RangeSkewness, KurtosisPg 139-201 (R3)37.Correlation & RegressionPerson and Rank Correlation Coefficients, Multiple RegressionPg 203 299(R3)38.Operation Research ApplicationIntroduction, Models, Application in Computer sciencePage-1-28 (R5)39.Operation Research ApplicationIntroduction, Models, Application in Computer sciencePage-1-28 (R5)40.Linear programmingConcept, Mathematical modelPage-29-91 (R5)41.Simplex MethodPg -124-176 (R5)Lec.Num.Unit TitleDetailsLearning Resources42.Revised Simplex MethodPg-124-176 (R5)43.Transportation problemPg -286-354 (R5)44.Assignment problemPg -355-394 (R1)45.ExerciseReference Books:R1: Numerical Methods by E.BalagurusamyR2: Introductory Methods of Numerical Analysis by S.S. SastryR3: Fundamentals of Stastics by S.P.GuptaR4:Operation Research by Thaha R5: Operation Research by J.K.Sharma Subject Code J030222Title Dot Net Technologies Work Load Per WeekL : 3 T : 1 Lab : 4 ExaminationsInt : 100OverviewThis Paper deals with Microsoft Dot Net Technology. Which is one of the most widely used technology in software development because it fulfills almost all types of requirements of the developers involved in complex application development and having variety in their priorities. Learning OutcomesThe student after completing this course should have gained: The ability to effectively use visual studio Dot Net.An understanding of the goals and objectives of the .NET Framework. .NET is a revolutionary concept on how software should be developed and deployed.A working knowledge of the C# programming language.An understanding of how to use forms to develop GUI programs under dot NET. Pre-requisitesBasic knowledge of Object Oriented ProgrammingText Book(s)1) c#3.0 Visual Studio-2008-wrox-beginning-guides.2) C# 3.0 Herbert Schildt- Mcgraw-hill3) Beginning Microsoft Visual C# 20081Introduction to Dot Net OverviewFeatures and usageAssembliesCLR, CTS and CLSClasses provided by .NETCompilation strategies2Introducing C#3Writing a C# Program 4Variables and Expressions5Flow Control6Variables7Functions8Debugging and Error Handling9Introduction to Object-Oriented Programming10Classes11Class Members12Collections, Comparisons, and Conversions13Generics14Additional OOP Techniques15C # 3.0 Language EnhancementsInitializers ,Object Initializers, Collection Initializers ,Type Inference ,Anonymous Types ,Extension Methods16Basic Windows ProgrammingControls, The Button, The Label and LinkLabel ,The TextBox ,The RadioButton and CheckBox,The RichTextBox,The ListBox and CheckedListBox ,The ListView 17Advanced Windows Forms FeaturesMenus and Toolbars, Toolbars, SDI and MDI Applications, Creating Controls18Using Common DialogsCommon Dialogs, How to Use Dialogs,File Dialogs19Deploying Windows ApplicationsDeployment Overview, Visual Studio Setup and Deployment Project Types20Basic Web ProgrammingOverview , Runtime ,Creating a Simple Page ,Server Controls ,Event Handlers ,Input Validation21State Management ,Authentication and Authorization22Reading and Writing to a SQL Server Database23Advanced Web ProgrammingMaster Pages, Site Navigation ,User Controls ,Profiles24Web Parts, JavaScript25Web Services Before Web Services, Where to Use Web Services, Web Services Architecture, Web Services and the .NET Framework26Creating a Simple Web Service ,Testing the Web Service27Ajax ProgrammingAjax Overview ,Update Panel ,Timer Control ,Update Progress ,Web Services28Deploying Web ApplicationsInternet Information Services ,IIS Configuration ,Copying a Web Site ,Publishing a Web Site29File System Data Streams ,The Classes for Input and Output30XMLXML Documents, Using XML in Your Application31Introduction to LINQLINQ Varieties ,LINQ Query, Using the LINQ Method Syntax32Ordering Query Results ,Order by Clause ,Ordering Using Method Syntax ,Querying a Large Data Set ,Aggregate Operators ,Querying Complex Objects ,Projection: Creating New Objects in Queries ,Projection: Method Syntax ,Select Distinct Query33Any and All ,Ordering By Multiple Levels, Multi-Level Ordering Method Syntax: ThenBy ,Group Queries, First and FirstOrDefault ,Set Operators ,Joins34LINQ to SQLObject-Relational Mapping (ORM) ,Installing SQL Server and the Northwind Sample Data35First LINQ to SQL Query ,Navigating LINQ to SQL and LINQ over ,Reading Data with the DataReader ,Reading Data with the DataSet ,Updating the Database ,Deleting Rows ,Accessing Multiple Tables in a DataSet , ,XML and 37LINQ to XMLLINQ to XML Functional Constructors ,Saving and Loading an XML Document ,Loading XML from a String ,Working with XML Fragments ,Generating XML from LINQ to SQL38AttributesWhat Is an Attribute? ,ReflectionBuilt-in Attributes39XML DocumentationAdding XML Documentation,40Making Use of XML Documentation41NetworkingNetworking Overview ,Networking Programming Options ,WebClient , 42WebRequest and WebResponse43Windows Presentation FoundationWhat Is WPF? ,Anatomy of a Basic WPF Application ,WPF Fundamentals44Windows Communication FoundationWhat Is WCF? ,WCF Concepts45Windows Workflow FoundationActivities , The Workflow Runtime ,Data BindingSEMESTER-IVSubject CodeJ030225TitleObject Oriented Analysis And Design Pattern Work Load Per WeekL:3 T:1 ExaminationInternal: 30 University Exam: 70 ObjectivesTeach students OOAD using with UML and standard agile software design patterns and usage of them. Learning OutcomesUpon completion of this course, students should be able to: Write and use requirement document (Use-Cases)Identify classes from given problem statementsUse and design software blue prints using UML Identify design patterns to be required to implement for a given problem. Pre-requisitesObject Oriented Programming with Java (J030109)Software Engineering Text BooksUML Distilled, 3rd Edition, Martin FowlerDesign Patterns Elements of Reusable Object-oriented Software- Erich Gama, Richjard Helm, Ralph Jonson and Jon Vlissides Reference BookApplying UML and Patterns, Craig Larman Head First Design Patterns, Eric Freeman, Elisabeth Freeman, Kathy Sierra, Bert BatesSoftware Engineering: A Practitioner's Approach, Roger PressmanSyllabusLec.NumUnit TitleDetailsIntroductionReview of Software Development Life Cycle,Waterfall, spiral, Iterative and Incremental models Object Oriented Methods: Rational Unified Process(RUP), XP and UMLConcept of modeling, UML, Static and Dynamic Modeling, Logical and Physical Lec.NumUnit TitleDetailsGathering RequirementsConcept of Use Cases, Identifying Business Actors, Identifying the use cases, Writing Use Cases Pre and Post Conditions, Drawing Use Cases Specializing actors, Use Case RelationshipsDocumenting a process FlowConcept of action and activity, Structuring control flow by Drawing a activity diagram for a given use-case, Using fork and join, Decomposing an action, Using partitions, Signals and Swimlanes, Showing Tokens, Flow and Edges, Pins and TransformationStatic ModelingIdentifying classes and attributes from problem statements Identifying and Drawing relationshipsVisibility, Association Classes, Tangible verses Intangible ObjectAggregation, Composition, Interface realizationUsing Object DiagramsDynamic ModelingObject communication and Use Case realization using Sequence diagramMessages and Types of messages used in Sequence DiagramSequence Vs Collaboration Diagram Using State machines to describe behavior of system. Using sub-states Designing the System ArchitectureUsing Packages and component Diagrams Choosing a Network topology, Technology and using Deployment Diagrams to represent the sameReusable Design PatternsAgile Software Engineering and Design patterns Creational Patterns Creational Pattern, Why the name creational pattern? Concept of factory in OOP.Factory Method, Abstract Factory vs Factory Method Builder Pattern - need its structure and example Need of Singleton class, example and Structure Prototype overview Prototype Design PatternStructural PatternsAdapter Pattern: real life example, Software example and Structure Composite and Bridge PatternDecorator concept, example from java.io package; Structure and comparison with composite patternFa?ade and Flyweight pattern structureConcept and need of proxy, Pattern structure with exampleBehavioral PatternsWhy Behavior Patterns. Chain of Responsibility Pattern Command and Interpreter Patterns Iterator pattern example from java.util package. Mediator pattern: Role of mediator to promote loose coupling in a set of objects interacting with each other Memento: Need of save state of an object; using Memento to restore an object state by undo and redo. Concept of Observer, one to many dependency, Example of weather forcast State : how behavior of an object changes when its internal state changes.Need of Family of algorithms, how we can make all this algorithms interchangeable using Strategy pattern,Overview Template Method Template method and Interpreter Visitor: how a new operation can be defined without changing classIntroduction to Object Oriented (OO) Software MetricsIntent of OO Metrics, Distinguishing Characteristics Metrics for OO Design ModelClass and method oriented metricsMetrics for OO TestingOO for Object Oriented projectsSubject CodeJ030226TitleApplied Data Structures and Algorithm Design PatternWork Load Per WeekL:3 T:1 Lab:4 ExaminationsInt: 30 Univ: 70 Practical 50ObjectivesTo make students familiar with various data structures and algorithm design.Learning OutcomesAt the end of course students should be Familiar with various models of computation and analyze the algorithm efficiency.Various types of data structures and its usageUse different algorithm patterns to solve problemPre-requisitesAny program languageText Book(s)Data structures and Algorithms, Fundamentals of Algorithm, SyllabusLec.Num.Unit TitleDetailsLearning Resources1-3Models of ComputationDefinition of a problem, examples of problems, important problem types.Definition of algorithm, algorithm representation, correctness of algorithm, time complexity and space complexity of algorithms.Detailed model of computationSimplified model of computationHandout4-8Analysis of Algorithm EfficiencyAnalysis frameworkAsymptotic notation and basic efficiency Classes ,Analysis of non-recursive algorithmsAnalysis of recursive algorithms, Empirical analysis of algorithmsA39-48, A49-56A57-63A65-72A80-85Lec.Num.Unit TitleDetailsLearning Resources9-10Linear Data StructuresHierarchical data structuresDynamic Sets, Stacks, Queues, DequeuesBasic tree conceptsN-ary trees, breadth first and depth first traversalsBinary trees and binary tree traversal algorithmsBinary search trees- definition, inorder traversal in BST, searching in BST and its efficiencyInsertion and removal of elements in BSTImproving the efficiency of search in BST- balanced trees, definition of balance property AVL treeHandout Handout Handout Handout Handout 11-20Rebalancing – concept of rotation, insertion and removal in AVL trees, Red-black trees and B-treesHandout 21-24Algorithm design- Brute Force PatternDescription and simple examplesApplication-Selection sort and Bubble sortApplication-Sequential search and String matchingApplication-Closest pair and Convex-hullApplication-Travelling Salesman problem, Knapsack problem, Assignment problemHandoutA93-97A98-101H102-107H108-11525-28Algorithm DesignDivided and Conqure Pattern Description and simple examplesMerge sort and Quick SORTBinary search and Binary tree TraversalsMultiplication of large integer and Strassen’s matrix multiplication,Closest pair and convex hull problems. HandoutA117-127A128-135A137-141A142-146Lec.Num.Unit TitleDetailsLearning Resources29-32Algorithm Design- Decrease and Conquer PatternDescription and simple examplesInsertion sort and Topological sortingDepth-First Search and Breadth-First Search Generating Permutations and Generating SubsetsHandoutA149-154A163-166A167-17133Decrease-by-a-Constant-Factor AlgorithmsFake-coin Problem, Multiplication-a-la-Russe, Josephus Problem.A172-17634-36Variable size decrease AlgorithmComputing median and selection problem, interpolation search, searching and insertion in BST, the game of NIM.A177-18437-42 Algorithm Design-Transform and ConquerDescription and Pre-sortingBalanced Search Trees- AVL trees and2-3 treesHeaps and Heap-sortHorner’s Rule and Binary Exponentiation Problem-ReductionA187-191A202-210A211-217A218-223A224-23143-46Algorithm Design-Space and Time Trade offsHorspool’s and Boyer-Moore algorithms for string matching, Hashing-basic concepts, Hashing methods, Separate Chaining, and Open AddressingA237-241A242-251A252-25747-48Algorithm design- Dynamic Programming PatternDescription, Computing Fibonaccii Terms,Computing Binomial CoefficientWarshall’s and Floyd’s AlgorithmsKnapsack problem and Memory FunctionsHandoutA270-276A284-28849-50Algorithm Design- Greedy PatternDescription and simple examplesPrim’s and Kruskal’s AlgorithmsDijkstra’s Algorithm Huffman TreesHandoutA291-301A305-309A311-31651-52Limitations of Algorithm PowerP, NP, and NP-Complete ProblemsChallenges of Numerical AlgorithmsA377-380A382-39153-54Algorithm Design-Backtracking PatternDescription, n- Queen’s Problem, Hamiltonian Circuit Problem, Subset-Sum ProblemA393-39854-56Algorithm Design-Branch-and-Bound PatternDescription, Application to Assignment Problem, Knapsack Problem, Travelling Salesman ProblemA402-410Subject CodeJ030227TitleDistributed Programming Work Load Per WeekL:3 T:1 Lab:4 ExaminationInternal: 30 University Exam: 70 Practical: 50ObjectivesTo teach the fundamental concepts of distributed programming, with particular emphasis on enterprise application development.To introduce various distributed programming architectures and how to apply them. To lean the importance of distributed computing and outline the factors to address when designing a distributed system.Learning OutcomesUpon completion of this course, students should be able to: Understand the significance and basic concepts of distributed computing and Define technologies for distributed computing Compare the different programming architectures used for distributed computing Use JDBC, RMI and JavaIDL in applets and applications Write a Servlet and JSP to take advantages distributed Technologies Explain how object bus systems, publish-subscribe, and remote events function Explain the basic concepts of JNDI, Java Transaction Service (JTS), and Java Message Service (JMS)Pre-requisitesObject Oriented Programming with Java (J030109)Database Management Theory (J030108)Web Support Technologies (J030106)Reference BooksCay S. Horstmann and Gary Cornell ,Core Java-Volume-I, Sun Core Series, Eighth Edition, 2008Java Server Programming, Worx Press Mastering EJB, Rima Patel Sriganesh, Gerald Brose, and Micah Silverman, Wiley Publications SyllabusLec. NumUnit TitleDetailsSocket ProgrammingConcept of Socket and Port, Understanding the classes from package Relation between Socket, Input Stream and Output Stream, Writing an Echo Server Using ServerSocket and Socket, Writing a Server to handle single client. GreetServer and Others Writing Multithreaded Server to handle Multiple clients. Using Object Streams with Sockets.Java Database ConnectivityConcept and need of JDBC API, Types of JDBC DriversWriting a simple JDBC programTypes of Statements and using all that statements Types of Result SetDatabase access via socketsServlet and JSPWhat is a Servlet? Why Servlet? Writing a Compiling a first Servlet, Understanding Tomcat: Tomcat directory structure, Structure of web.xml file Configuring and running a first Servlet, Servlet Life cycle, retrieving the parameters sent by user with requestWriting thread safe Servlet, Servlet and CookiesUsing Servlet Config and Servlet ContextWriting controller Servlet, getting and using Request Dispatcher Using JDBC in ServletSession management using Servlet API.Introduction to JSP, Understanding JSP architecture and life cycle of JSP-Servlet, Implicit Objects Using Scriplets, Page and Include directives JSP Standard actions-I JSP Standard actions-IIIntroduction to Using Tag libraries Lec. NumUnit TitleDetailsRMI and CORBAUnderstanding RMI Architecture, Wring Remote Interface and Implementing it.Using rmic (RMI Compiler), using RMI registry, Writing and executing a RMI Client. Understanding the working of client, JNDI and Naming class CORBA introduction and ArchitectureAnatomy of a CORBA-based application, CORBA vs. RMICORBA IDL: The interface definition languageIDL to Java Mapping, Writing a Simple CORBA ServerNaming, Binding registering and activating objects Understanding using a tools to implement CORBA (Caffeine, Orbix)Introduction to Mobile Agents and VoyagerConcept of Software Agents, Mobile AgentMobile agent applications, security in Mobile agentsGetting Started with VoyagerProgramming with Mobile AgentsIntroduction Enterprise Java BeansIntroduction to Enterprise JavaBeansSession Beans, Writing, deploying and using stateless session bean, lifecycle of stateless bean Need of Stateful Session Bean, Writing, deploying and using stateful session bean, lifecycle of stateless beanUnderstanding Message Driven BeansNeed of Entity Bean, Persistence Mechanisms - BMP, CMP, Local and Home Interfaces, Entity Bean Implementation deploying and using, Entity Bean Lifecycle and Lifecycle Methods, Entity Vs Session Bean Understanding Container Managed Persistence (CMP)Using Java Persistence API-IUsing Java Persistence API-IISEMESTER-VSubject Code J030333TitleSoftware Project Management and Software Testing Work Load Per WeekL:3 T: 1 Lab:4ExaminationsInt: 30 Univ: 70 Practical : 50ObjectivesTo provide basic project management skills with a strong emphasis on issues and problems associated with delivering successful IT projects and how the software is tested using various techniques to improve the quality of software. This course is designed to provide an understanding of the particular issues encountered in handling IT projects and to offer students methods, techniques and 'hands-on' experience in dealing with them. Learning OutcomesUnderstand and practice the process of project management and its application in delivering successful IT projects;Evaluate a project to develop the scope of work, provide accurate cost estimates and to plan the various activities;Identify the resources required for a project and to produce a work plan and resource schedule;Understand diff. types of testing and how it is conducted.Practice the automated tools available for testing. Pre-requisitesText Book(s)A) Information Technology Project Management” Kathy schwalbe, International student edition, THOMSON course Technology, 2003B) “Software project management”Bob hughes and Mike cotterell,Third edition, Tata McGraw-HillC) “Microsoft office Project 2003 Bible”, Elaine Marmel,Wiley publishing Inc.Syllabus Lec.Num.Unit TitleDetailsLearning Resources1Introduction to project managementProject , project management, ImportanceA 1 -11 or B 1-4 2Characteristics of project how software projects are diff. than other projects, Problems with software projectsB 8 -10Lec.Num.Unit TitleDetailsLearning Resources3Phases of project life cycleInitiation phase, planning phase, execution phase, monitoring and controlling phase, closing phase. B 4 -7 or A 22 -244The stakeholder of projectAll parties involved in project, Role of Project Manager A 1 -12 , 35 -375Project management frameworkA 7 -9, 38 – 416Software tool for project managementC 21- 417Project planningIntegration management :What is integration management, plan development and execution A 50 – 708scope management What is scope management, methods for selecting project, scope statement, Work Breakdown StructureA 76 – 879Stepwise project planning Overview, main steps in Project planning: identify project scope and objective, identify project infrastructure, analyze project characteristics, identify project products and activities, estimate effort for each activity, identify risk activity, allocate resources, review plan, execute plan.B 18 -3510Use of software(Microsoft Project) to assist in project planning activitiesC 43 – 7711Project schedulingTime management: importance of Project schedules, schedules and activities, sequencing and scheduling activitiesA 109 – 114B 104 -10612project network diagram Network Planning models, duration estimation and schedule developmentA 114 -12813Critical path analysisA 122 -127 B 118 – 12314PERTA 127 -13115Use of software( Microsoft project) to assist in project schedulingC 79 – 11616Project cost managementImportance and principles of project cost managementA 144 -147B 81 -8417Resource planningA 148- 149Lec.Num.Unit TitleDetailsLearning Resources18Cost estimatingAttributes to be considered in cost estimation, factors effecting the cost, various costs involved in it.A 149 -157B 85 -8719Cost estimation methodsTraditional method: Estimation by analogy, Expert judgment, Parkinson, price to win, top down, bottom up. Hand out20COCOMO Model21Function point analysis22Cost budgetingA 157 -15923Cost controlA 159 -16724Use of software( Microsoft project) to assist in cost managementC 117 – 14725Project quality managementQuality of information technology projectA 175- 17926Stages of software quality managementA 183 -18727PMBOK, Quality standardsB 234- 236, 240 -24428Tools and techniques for quality controlB 187-196, 237-23829Project risk managementThe importance, Top risk in projects A 273 – 275, Hand out30Common sources of risk in IT projects, elements in risk mgt.A 276 – 278, 134 – 13831Risk identificationA 279-280 B 139 – 14132Risk quantificationA 280 – 286B 142 – 15633Risk response development and controlA 286 – 28834Using software to assist in project risk managementHand out35Fundamentals of TestingFundamentals of Software quality, quality views, People challenges in testingHand out36Principles of Verification and validation, Techniques of verificationHand out37V modelHand out38Testing processHand out39Unit testingHand outLec.Num.Unit TitleDetailsLearning Resources40Integration testingHand out41System Testing and Acceptance testing Hand out42Testing new product versionsHand out43Testing planning: test plan, test plan template, risk analysisHand out44Test Design, good test case, test case template, test case mistakesHand out45Testing Execution: objectives, execution considerations, test execution activities, executing testHand out46Defect management: what is defect, defect life cycle, defect management processHand out47Test Metrics: purpose, characteristics of good metrics, metrics Hand out48Functional testing toolsHand out49Unit testing tools Hand out50Test management toolsHand outReference Books:Basics of Software Project Management, NIIT, Prentice-Hall India, 2004 Software Project Management in Practice, Pankaj Jalote, Pearson Education, 2002Effective Methods for software Testing William Perry Software Testing in Real World Edward KitSOFTWARE REQUIREMENTSMicrosoft project 2003Subject CodeJ030334TitleWeb Services and SOA Applications Work Load Per WeekL:3 T:1 Lab:4 Practical: 4ExaminationInternal: 30 University Exam: 70 Practical: 50ObjectivesMake student familiar with Web Services(WS) and Service Oriented Architecture (SOA)Learning OutcomesUpon completion of this course, students should be able to: Use Java XML API for parsing, Data Binding and MessagingUnderstand the concept Web Service and SOAPIdentify the role of SOAP Writing Web Services using java and WSDLRelate Web Services with SOA Pre-requisitesWeb Support Technologies (J030106)Object Oriented Programming with Java (J030109)Distributed Programming (J030224)Reference BookJava Web Services: up and Running, Martin Kalin, Oriely, 2009Java SOA a Cook Book, Eben Hewitt, Oriely, 2009 Designing Web Services with the J2EE? 1.4 Platform JAX-RPC, SOAP, and XML Technologies, Inderjeet?Singh and others, Addison WesleySyllabusLec.NumUnit TitleDetails1.Introduction to Web Services Web Services and SOA Overview 2.What SOA provides and what not? Alternatives to SOA 3.Java API for XML Overview of XML Technologies4.Creating and Parsing XML with DOM 5.Data Binding using JAXB, JAXB Compilation6.Mapping Schema types to Java, Java to XMl binding using annotations 7.Marshaling and unmarshaling with JAXB8.Working with JAXB Object Modeling, In memory validation Lec.NumUnit TitleDetails9.The Simple Object Access Protocol (SOAP)SOAP Messaging Model , SOAP Namespaces, SOAP Envelope Header and body10.SOAP Faults, Attachments, XML Schema, Validating Message Content, SOAP Encoding11.The Java APIs for SOAP Messaging (SAAJ)The SAAJ Object Model, Parsing a SOAP Message, Reading Message Content12.Working with Namespaces, Creating a Message, Setting Message Content , Integration with the DOM and JAXP13.The Java API for XML Messaging (JAXM)Building Low-Level Web Services , Messaging Scenarios14.Point-to-Point Messaging, JAXM Message Providers15. JAXM Servlets, Creating a SOAP Connection , Sending a Message,16.The Java API for XML Messaging (JAXM)Building Low-Level Web Services , Messaging Scenarios17.Point-to-Point Messaging, JAXM Message Providers18. JAXM Servlets, Creating a SOAP Connection , Sending a Message,19.Web Services Description language (WSDL)Web Services as Component-Based Software, The Need for an IDL20.Web Services Description Language, WSDL Information Model, The Abstract Model - Service Semantics21.Message Description , Messaging Styles,22.The Concrete Model - Ports, Services, Locations 23.Extending WSDL - Bindings , Service Description24.Java API for XML Based RPCThe Java Web Services Architecture, Two Paths 25.How It Works - Build Time and Runtime26.The Web Services for J2EE Specification27.JAX-RPC Deployment28.Mapping Between WSDL/XML and Java29.Generating from WSDL and Java30.Generating Web Services Using Java CodeThe Java-to-XML Mapping, Primitive Types and Standard ClassesLec.NumUnit TitleDetails31.Value Types and JavaBeans, The Java-to-WSDL Mapping32.Simple and Complex Types, Arrays and Enumerations33.Service Endpoint Interface, Scope of Code Generation 34.Inheritance Support, Multi-Tier Application Design, Analyzing the Domain 35.Generating Java Web Services from WSDLThe XML-to-Java Mapping ,Simple and Complex Types36.Enumerations, Arrays, Miscellaneous, Optionally-Supported Constructs37.The WSDL-to-Java Mapping, Mapping Operation Inputs and Outputs38.Building a Service Client, Locating a Service, Client-Side Validation39.Creating a Web Service and Deploying the Service40.Web Services and SecurityThreats to web services, Public key and digital signature techniques 41.J2EE techniques, Securing a web service URIs 42.HTTPS, XML and SOAP Solutions, XML encryption and Signature43.WS Security, SAML, XACMLSubject Code J030335TitleSoft Computing Work Load Per WeekL:3 T:1 ExaminationsInt: 30 Univ: 70ObjectivesSoft Computing is a discipline that deals with the design of hybrid intelligent systems, which is in contrast to classical hard computing technique. A consortium of computing methodologies that provides a foundation for the conception, design, and deployment of intelligent systems and aims to formalize the human ability to make rational decisions in an environment of uncertainty, imprecision, partial truth, and approximation. The main constituents of Soft computing involves neuro computing, fuzzy logic, genetic computing and probabilistic reasoning, and their fusion in real, scientific and industrial applicationsLearning OutcomesStudents who successfully complete this course will be able to general understanding of soft computing methodologies, including artificial neural networks, fuzzy sets, fuzzy logic, fuzzy clustering techniques and genetic algorithms also design and development of certain scientific and commercial application using computational neural network models, fuzzy models, fuzzy clustering applications and genetic algorithms in specified applicationsPre-requisitesXII Level MathematicsText Book(s)Artificial intelligence by Elaine Rich, Neural Networks, Fuzzy Logic, Genetic Algorithms by S. Rajasekaran SyllabusLec.NumUnit TitleDetailsLearning Resources1Introduction to Artificial Intelligence SystemsOverview of AIHandout2Production SystemsPage29(R1)Lec.NumUnit TitleDetailsLearning Resources3Problem characteristics, Production system CharacteristicsPage 36-44(R1)4Issues in the Design of Search ProgramsPage 57 (R1)5Heuristic search techniquesHill climbingPage 64(R1)6Branch bounding techniquePage 6(R1)7Best first search & A’ algorithmPage 65(R1)8Soft computing-overview IntroductionHandout9Guiding Principle of Soft computingHandout10Importance of Soft computingHandout11Fuzzy Set TheoryIntroductionHandout12Fuzzy Sets, Fuzzy Logic, Crisp SetPage 157-186(R2)13Fuzzy Numbers and Fuzzy ArithmeticPage 157-186(R2)14Determination of Membership FunctionsPage 157-186(R2)15Crisp RelationsPage 157-186(R2)16Fuzzy RelationsPage 157-186(R2)17Fuzzy Rule based SystemPage 157-186(R2)18Defuzzification MethodsPage 157-186(R2)19ApplicationsPage 157-186(R2)20Fuzzy Mathematical ProgrammingHandout22Programming AssignmentPage 157-186(R2)23ExerciseHandout24Evolutionary ComputationsIntroductionPage 225-252(R2)25Basic conceptPage 225-252(R2)26Creation of OffspringPage 225-252(R2)27Working PrinciplePage 225-252(R2)28EncodingPage 225-252(R2)29Fitness FunctionPage 225-252(R2)30ReproductionPage 225-252(R2)31Programming assignmentPage 225-252(R2)Lec.NumUnit TitleDetailsLearning Resources32Neural NetworksIntroductionPage 11-33(R2)33Basic concepts of Neural NetworksPage 11-33(R2)34Neural Networks ArchitecturesPage 11-33(R2)35Characteristics of Neural NetworkPage 11-33(R2)36Solving optimization problems using neural networksPage 11-33(R2)37Learning MethodsPage 11-33 (R2)38Programming assignmentPage 11-33 (R2)39Learning MethodsPage 11-33 (R2)40Programming assignmentPage 157-186(R2)41Back propagation Networks Architecture Page 34-86 (R2)42Back propagation Learning’sPage 34-86 (R2)43ApplicationsPage 34-86 (R2)44Variations of Standard Back propagation AlgorithmPage 34-86(R2)45Research DirectionPage 34-86(R2)Reference Books:(R1): Artificial intelligence by Elaine Rich(R2): Neural Networks, Fuzzy Logic, Genetic Algorithms by S. RajasekaranELECTIVE SUBJECTSGROUP I : BUSINESS APPLICATIONS OF ITSubject Code J0302BIT01TitleDesign of E-Commerce Applications Work Load Per WeekL:3 T:1 ExaminationsInt: 30 Univ: 70ObjectivesThis course aims to cover the study concepts of E-commerce, E-commerce securities, E-commerce payment systems and various e-commerce applications. Learning OutcomesAt the end of the course students should understand the overall knowledge of E-commerce, Pre-requisitesText Book(s) E-commerce Concepts, Models, Strategies byC. S. V. MurthySyllabusUNIT-1 Overview of E-commerceBrief History of E-commerce, Definitions, Broad Goals of E-commerce, Technical Components, Functions of E-commerce, prospectus of E-commerce, Scope of E-commerce, Advantages, Disadvantages, E-commerce Technical Architecture, E-commerce strategies, E-commerce foundations, E-commerce goals V/s Business goals, E-commerce V/s Traditional Business, Segments of E-commerce, B2C, B2B, C2C, C2B ecommerce, Value Chain in E-commerce.UNIT-2E-Commerce and InternetElectronic Data Interchange, types of EDI, IT industry in India Internet Service Providers, types of ISP, Choosing an ISP, Communities of Internet, Cookies, World Wide Web and E-commerce, Domain Name, Electronic market dimensions, Upgrading capacity of sites, Electronic business Execution frame work, role of Intranet in B2B applications, UNIT-3E-commerce Security Security issues, Privacy issues, Basic computer security, security tools, Secure transaction, Security threats, Risk , Hacking, Viruses, Denial of Service Attacks, Malicious Code, Intruders, Attacking methods, Cryptography, Types of Cryptography, Data Encryption Standard, Firewall, Digital signature, Digital Certificate, Client Server Network security, Disaster Recovery, Secure Electronic Transactions, Secure Socket Layer, Internet security protocols, Network security, Information Technology ActUNIT-4E-commerce Payment SystemOverview of Electronic Payment technology, limitations of the traditional payment system, Requirements for E- Payment system, Electronic or digital cash, electronic checks, Online Credit Card payment system, Smart Card, How all E-commerce payment system works, Electronic Fund Transfer, UNIT-5E-commerce ApplicationsElectronic Commerce and Banking, Electronic commerce and retailing, Electronic commerce and online publishing, Online Marketing, E-advertising, E-branding, Mobile CommerceReference Books:Electronic Commerce A Manager’s Guide by Ravi Kalakota and Andrew Whinston,E-Commerce A managerial perspective by P. T. Joseph.Electronic Commerce from Vision to Fulfillment by Elias M. Awad. Subject CodeJ0302BIT02TitleIntelligent Decision Support Systems Work Load Per WeekL : 3 T: 1 ExaminationsInt : 30 Univ. : 70ObjectivesThe objective of the course is to provide an understanding of Decision Support System for Management decisions. The prerequisite for the course is knowledge of MIS. Every day managers must make countless decisions that affect them, their work groups, and the organization as a whole. Making decisions are often the most difficult part of a manager is responsibilities. This course deals with concepts, methods, applications of decision modeling to address various business issues. The basic objective of this course is to provide with an understanding of the key technical and managerial issues in the effective development and use of decision support systems in organizations. While highly effective decision support systems using traditional approaches and tools will be discussed, the focus of this course will be advanced techniques and tools to support decision making process.Learning OutcomesText Book(s)? Efraim Turban, Jay E. Aronson, Ting-Peng Liang: DSS and Intelligent Systems, PHI & Pearson Education, 2007.? Macllah: Decision Support Systems and Data Warehousing, Tata McGraw-Hill, 2003. ? Stevenson, Introduction to Management Science, 1/e, Tata McGraw-Hill , 2007. ? James A Obrien, george M Marakas: Management Information systems, 7/e, Tata McGraw-Hill, 2007.LectureNumberTopic Details01Managerial decision making and information systems Decision- Making and Computerized support- Management support systems : an overview, decision-Making Systems, Modeling, and Support Requirement for decision support for decision making and other executive work, Human decision making heuristics and bounded rationality, Types of Decision Support Systems 02DSS architecture, Decision modeling and analysis, Decision Support Developments, Executive Information Systems, Data warehousing, access, analysis, mining and visualization.03Deterministic Models: Models Required to Cope With Uncertainty, Probabilistic Models and Fuzzy Sets, Fuzzy DSS and Fuzzy Expert DSS. Application of DSS to Some Functional Areas of Management Like Finance, Marketing, Production Planning and Control Etc. Non-Optimizing Models of DSS, Simulation Techniques and Monte- Carlo Methods. 04Group Decision Support Systems Intelligent Decision support systems? Knowledge-based decision support systems? Knowledge acquisition and validation? Knowledge representation? Inference techniques Decision Making Under Uncertainty? Understanding risk in making decisions? Managerial risk taking and organizational decision making? Modeling uncertainty 05Advanced Techniques? Neural Network fundamentals? Neural Network Architecture? Simple Neural Network applications? Genetic Algorithm? Fuzzy Logic? Fuzzy Sets in decision making? Intelligent software agents and creativity? System integration and future of DSS. 06Application of DSS: Technical Feasibility and FinancialViability of DSS. Advantages and Limitations of DSS –Contemporary practices.Case Studies in any one functional area Subject CodeJ0303BIT03TitleKnowledge Management Work Load Per WeekL:3 T:1 ExaminationsInt: 30 Univ: 70ObjectivesTo provide different management techniques to handle knowledge .Learning OutcomesAfter completion of this course students will be able to handle data using KM tools, techniques and methods. They will able to solve relevant cases.Pre-requisites--Text Book(s)Knowledge Management Elias Awad & Hassan GhaziriSyllabusUNIT – 1: Introduction To Knowledge ManagementWhat is knowledge Management? , evolution of KM, challenges of KM, benefits of KM, KM myths, reasons for implementation of KM, Understanding terms-data, information, knowledge, intelligence, experiences, common sense, Attributes of knowledge, KM drives, Types of knowledge, expert knowledge, human thinking and learning, Challenges in building KM system, conventional versus KM life cycle, KMLC: System justifications, role of rapid prototyping, selecting an expert, role of knowledge developer, user training, Implementation of KM system, case study.UNIT – 2: Knowledge CreationKnowledge Creation, Nonaka’s Model of Knowledge creation and Transformation, Knowledge architecture: people core, identifying knowledge centers, Technical core, build in home, buy and outsource, Capturing Tacit Knowledge: What is knowledge capture, evaluating experts- levels of expertise, capturing single versus multiple experts tacit knowledge, Pros and cons of using single and multiple expertsUNIT - 3: Developing Relation With ExpertsDeveloping Relation With Experts: Creating the right impression, understanding the expert’s style, preparing for session, approaching multiple experts, Fuzzy Reasoning And Quality of knowledge Capture: analogies and uncertainties in information, understanding experiences, language problem, Interview as an tool: interviews, types of interviews, Guide to successful interview: setting the stage and establishing rapport, phrasing the questions, question construction, things to avoid, Reliability of information from experts, errors made by developer, problems during the interview, ending the interview, Other Knowledge Capture Techniques: On site observation, brainstorming, protocol analysis, NGT- Nominal Group Techniques, Delphi Method, Concept mapping, black boarding UNIT - 4: Knowledge CodificationWhat is knowledge codification, why codify? : diagnosis, instruction, interpretation, planning, prediction, Modes of knowledge conversion, how to codify knowledge, Codification Tools: knowledge maps, decision tables, decision trees, frames, Codification Procedures: procedures rules, case based reasoning, knowledge based agents, Knowledge Developer Skill Set: knowledge requirements, skill requirements, Quality and Quality Assurance, UNIT - 5: Knowledge TestingKnowledge Testing: definition and related issues, Approaches to Logical testing: circular errors, redundancy errors, unusable knowledge, subsumption errors, inconsistent knowledge, Approaches to User Acceptance Testing: Test team and plan, user acceptance test criteria, user acceptance test techniques, Managing the testing phase, KM System Development, Issues related to deployment: selection of the knowledge base problem, ease of understanding KM system, knowledge transfer, Integration alternatives, the issues of maintenance, organizational factor, User training and Deployment: Preparing for KM system training, combating resistance to change, Post implementation review: Security considerationsUNIT - 6: Knowledge Transfer And SharingKnowledge transfer as a step in a process: knowing-doing gap, prerequisites for transfer, Transfer methods : nature of problem, transfer strategies, inhibitors for knowledge transfer, how knowledge is transferred, Role of Internet in knowledge transfer: internet service providers, stability and reliability of the web, unique benefits of the internet, limitations, UNIT - 7: Ethical, Legal And Managerial IssuesKnowledge owners: knowledge for sale, releasing knowledge gained on the job, becoming expert via a corporate knowledge-based system, Legal Issues: Liability question, basis of liability, copyright, trademarks, trade names, warranties, strict liability, Legal disputes in KM, web linking and domain name disputes, Ethics Factor: What is ethics, ethical decision cycle, major threats to ethics KM Tools, Cases.Reference Books:Leading with Knowledge – Knowledge Management Practices in Global Infotech by Madanmohan Rao, Tata McGraw HillKnowledge Management System by Barnes SKnowledge Management Strategies by Honeycut, Prentice Hall of IndiaSubject Code J0303BIT04TitleIT Enabled Services Work Load Per WeekL: 3 T: 1 ExaminationsInt: 30 Univ: 70ObjectivesTo develop the skills to understand the process involved in ITES and learn the management skills for ITES Projects. Basics of IT services management skill set is imparted through this course. In addition, domain specific skills e.g. service level management for finance KPOs etc. will be imparted for specific and predominant domains.Learning OutcomesPre-requisitesReference Book(s)Nasscom’s Handbook on IT Enabled Services, By NasscomMGI (McKinsey Global) reports 2006 and 2007 excerptsITES Case Studies from wipro/ Infosys/ IBM etc.Service Level Management and SLA : resources from the InternetSyllabus:Unit 1: Global Outsourcing Market on a growth path: Introduction, Evolution of ITES, Key Drivers of ITES, Key benefits of IT enabled outsourcing.Unit 2: The Indian IT Enabled Services Market: The Indian IT Enabled outsourcing market: Existing size, Market Segmentation.Unit 3: The Indian Contract Services Market: Contact centers, Market size, Market Processes, Value Proposition, and Future of Indian contact center market.Project Work: Project on Indian Contract Services Market. Unit 4: Software Technologies & Frameworks: Introduction to Relevant Internet & Web Applications for ITES, Voice over IP, IP telephony, groupware, SMTP, SOAP, BizTalk servers.Unit 5: The Medical Transcription Market: Market Processes, Market size, Setup of Medical Transcription, Customers for MT unitsUnit 6: Back Office Operations, GIS, Animation, Engineering and Design Services, online Training: Business Process Outsourcing, GIS Services, Content development and animation, Engineering & Design Services.Project Work: Project on Back Office Operations, GIS, Animation, Engg. & Design ServicesUnit 7: Service Desk management:Types of Service Desks, benefits and demerits of each type, suitability of a particular type to a specific business contextUnit 8: Service level agreements: What are the components how to develop good SLA penalty clauses – performance clauses – templates of SLAs Example SLAs for various outsourced services e.g. VOIP, financial reporting.Unit 9: Service Level Management: Process metrics how to design – how to capture data on process metrics – how to monitor – SLM software / workbenches – SLM reports – workflows for SLM.Project work: SLA design for any domain specific services – role playsUnit 10: Disaster Recovery Strategies: Importance & General Strategies for organizing Disaster Recovery, Business Impact of a Disaster.Unit 10: Business Models Driving IT Enabled Service: In-house/Captive centers, Building Success strategies for in-house ITES & 3rd party providers, third Party Services providers.Unit 11: India's Challenge i n the IT Enabled Services spaceUnit 12: HR and Quality Issues in IT Enabled Services: HR in ITES, Employee Value Proposition, Balance of Rewards, Incentive Plan, Training, Quality Focus, Benchmarking quality & Performance.Unit 13: Challenges Facing the Indian IT Enabled Outsourcing Market: Perspective, Supply & Demand side, Action Plan for India.GROUP II : COMPUTER NETWORKINGSubject Code J0302CN01TitleNetwork Architecture and Design Work Load Per WeekL: 3 T: 1 Lab: 0ExaminationsInt: 30 Univ: 70ObjectivesThe aim is to help students to identify various network aspects that need to be monitored and analyzed during design and evaluation of network architecture. Learning OutcomesDesign a new network model to meet requirements for new and existing networks. Use quantitative and qualitative techniques to design or upgrade a network Making decisions on the proper network technologies, routing protocols, network topologies, node placement etc. Identify network issues, risks, bottlenecks etc . Pre-requisites ? Basic knowledge of networking concepts. Text Book(s)? Top - Down Network Design by Priscilla OppenheimerUnit I: Analyzing Business Goals and ConstraintsAnalyze typical network design business goals and changes in Enterprise networks.Identify scope of network design and Importance of network security.Analyze business constraints Budgetary Constraints 2)Staffing Constraints 3)Project SchedulingUnit II: Analyze Technical GoalsScalability Planning for Expansion 2) Expanding Access to Data 3) Constraints on scalabilityAvailability Specify Availability Requirements 2) Mean Time Between Failure 3) Mean Time to RepairNetwork Performance1)Definition 2)Optimum Network Utilization 3)Throughput 4)Accuracy 5) Efficiency 6) Response Time7)Security a)Identify Network Assetsb)Analyze Security Risksc) Developing Security Requirements8) Manageability 9) Usability 10) Adaptability 11) AffordabilityUnit III: Characterizing the Existing InternetworkCharacterizing the Network Infrastructurea) Developing Network Map1) Tools for developing Network maps2) Characterizing Large Internetworks3) Characterizing Logical ArchitectureCharacterizing Network Addressing and naming with examples Characterizing wiring and media with exampleChecking Architectural and environmental constraints- Checking for wireless Installation Checking status of Routers, Switches and Firewallsa) Tools for Characterizing Existing Network1)Protocol Analyzers2)Network Monitoring Tools3)Network Management Tools4)Remote Monitoring Tools5)Cisco ToolsUnit IV: Characterizing Network TrafficCharacterizing Traffic FlowIdentifying Major Traffic sources & storesDocumenting Traffic FlowCharacterizing Types of Traffic FlowTerminal/Host Traffic Flow 2) Client/Server Traffic Flow3) Thin Client Traffic Flow 4) Peer-to-Peer Traffic Flow5) Server/Server Traffic Flow 6)Distributed Computing Traffic Flow7) Voice Over IP Network (VoIP) Traffic FlowCharacterizing Traffic LoadCalculating Theoretical Traffic LoadDocumenting Application Usage PatternRefining Estimates Caused by ApplicationsEstimating Traffic Overhead for ProtocolsEstimating Traffic load caused by WorkstationEstimating Load caused by Routing protocolsCharacterizing Traffic BehaviorBroadcast/Multicast BehaviorNetwork Efficiency a) Frame Size b) Error Recovery Mechanisms Unit V: Designing a Network TopologyHierarchical Network Design1) Why Use Hierarchical Network Model a) Flat WAN Topologies b) Flat LAN Topologies c) Mesh Topologies d) Hierarchical Mesh TopologiesClassic Three Layer Hierarchical Model 1) Core Layer 2) Distribution Layer 3) Access LayerGuidelines for Hierarchical Network DesignRedundant Network Design Topologies 1) Backup Paths 2) Load Sharing Modular Network DesignEnterprise Composite Network Modela) Enterprise campus b) Enterprise Edge c) Service provider Edge2)Designing a Campus Network Design TopologySpanning Tree ProtocolSTP ConvergenceSelecting Root Bridge Virtual LANs - Fundamental VLAN DesignsWireless LANS - Positioning an Access PointDesigning Enterprise Edge TopologyRedundant WAN Segments 2) Multihoming Internet ConnectionVirtual Private NetworkingSite-to-Site VPNs 2) Remote-Access VPNsSecure Network Design TopologiesPlanning for Physical Security Meeting Security Goals with Firewall topologiesUnit VI: Developing Network Security StrategiesNetwork Security DesignIdentify Network Assets and RisksDeveloping a Security Plan and PolicyDeveloping Security ProceduresModularizing Security DesignSecuring Internet ConnectionsSecuring Public serversSecuring E-commerce ServersSecuring Remote-Access and VPNsUnit VII: Developing Network Management StrategiesNetwork Management Design1) Proactive network Management2) Network management Processesa) Performance Management b) Fault Managementc) Configuration Management d) Security Managemente) Accounting Management3) Network Management ArchitectureUnit VIII: Selecting Technologies and Devices for Campus networksLAN Cabling plant DesignCabling TopologiesBuilding –Cabling TopologiesCampus – Cabling TopologiesTypes of CablesLAN TechnologiesEthernet 2) IEEE 802.3Selecting Internetworking Devices for Campus Network Design with exampleHub 2) Bridge 3) Switch 4) Router 5) GatewaysUnit IX: Testing the Network DesignBuilding and Testing a Prototype Network SystemDetermining scope of Prototype SystemWriting test plan for Prototype Systema) Developing Test Objectives and Acceptance Criteriab) Determining types of tests to Runc) Documenting Network Equipment and other Resourcesd) Writing Test scriptsTools for Testing a Network Design1) Types of ToolsSpecific tools for Testing Network Design1)CiscoWorks Internetwork Performance monitor2)WANDL’s Network Planning and Analysis Tools3) OPNET Technologies 4) Agilent’s Router tester5) NETIQ Voice and Video Management Solution6) Net predict’s Net PredictorReference Book:Data Network Design Darren L. SpohnSubject Code J0302CN02TitleNetwork Programming Work Load Per WeekL:3 T: 1 Lab:1 ExaminationsInt: 30 Univ: 70ObjectivesTo enable the students to develop the necessary skills for developing robust and scalable network applicationsLearning OutcomesAt the end of this course, student should be able to Understand basic Network Programming concepts using JAVA as well as UNIX. Understanding threads for developing high performance scalable applicationsLearn about raw sockets. Pre-requisites Basic Knowledge of computer, Computer Network, Proficiency in JAVA Programming and UNIX, understanding of Inter Process CommunicationText Book(s)JAVA NETWORK PROGRAMMING Second Edition BY Elliotte Rusty Harold –O’REILLYUNIX Network Programming, Volume 1: The Sockets Network API, 3rd Edition, by W. Richard Stevens, Bill Fenner, and Andrew M. Rudoff. "UNIX Network Programming," Volume 1, second edition by W. Richard Stevens, Prentice Hall. UNIT-IOverview of Network Concepts: Review of OSI and TCP/IP models, Overview of TCP/IP Protocols:IPv4,IPv6,TCP,UDP, ICMP,IGMP,ARP,RARP, ICMPv6,BPF, DLP, The Client/Server Model, Internet Standards, Basic Web Concepts: URL, HTML, SGML,XML, HTTP, MIME, CGI, Protocol usage by common Internet Applications. Network Programming in Java: Looking up Internet Address: DNS, IP Addresses, The InetAddress Class: Creating new InetAddress Objects, Getter Methods: GetHostName(), GetHostAddress(), GetAddress(), Object Methods: Boolean equals(), Hashcode(), To String() . Retrieving Data with URLs: The URL class: creating new URLs, Splitting a URL into pieces, Retrieve Data from a URL, Utility Methods: sameFile(), toExternalForm(), Communicating with CGIs and Servelets through GET, Network Methods of Java.applet.Applet: Using java.applet.Applet to download Data, Downloading sounds, The MediaTracker class, Checking whether media has loaded, Waiting for media to load, Checking the status of MediaUNIT- IISocket Programming using JAVA: Socket for Clients: Socket Basics, The Socket class, Getting information about a socket: getInet Address(), getPort(),get LocalPort(), getLocalAddress(),closing the socket, Setting Socket options: TCP_NODELAY, SO_BINDADDR, SO_TIMEOUT, SO_LINGER, SO_SNDBUF, SO_RCVBUF, SO_KEEPALIVE, Socket Exceptions. Socket for Servers: The ServerSocket Class, Accepting and closing connections, The get Methods(), Socket options, Some useful servers : Client Tester, HTTP Servers, Secure Sockets: Secure communication, Creating secure client socket, Methods of SSLSocket Class: Event Handlers, Session Management, Client Mode, Creating secure server socket, Methods of SSLServerSocket Class: Session Management, Client Mode. UDP Datagrams and sockets: The UDP protocol, The DatagramPacket Class, The get & set methods, The DatagramSocket Class, Sending and Receiving Datagrams, Socket options, UDP Server, UDP echo Client, Multicast Sockets: Multicast addresses and groups, Clients and servers, Routers and routing, Working with Multicast Socket, Communicating with a Multicast groupUNIT-IIIThe URLConnection Class: Opening URLConnections, Reading Data from a Server, Reading the Header, Configuring the connection, Writing data to a server, Protocol Handlers: What is a protocol handler, The URLStreamHandler Class, Writing a Protocol Handler, Content Handler:What is a content Handler, The ContentHandler Class, Using Content Handler. Remote Method Invocation: RMI: Security, Object Serialization, Implementation: The Client Side, The Server SideUNIT-IVSocket Programming on UNIX Platform: Sockets: Socket address structures, Value_result argumentsByte ordering and manipulation functions and related functions, Elementary TCP Sockets: Socket, connect, bind, listen, accept, fork, exec functions, iterative and concurrent servers, close function and related functions, Application Development: TCP Echo Server, TCP Echo Client, normal startup, normal termination, Posix Signal handling, Server with multiple client- boundary conditions, server process crashes, server host crashes, server crashes and reboots, server shutdown. Socket options: Get_sockop and setsockopt functions, socket states, generic socket options, IPv4 socket options, IPv6 socket options, TCP socket options, Elementary UDP Sockets: UDP Echo server, UDP Echo Client, Lost datagrams, Multiplexing TCP and UDP SocketsUNIT-VAdvanced Sockets: IPv4 and IPv6 interoperability, Threaded servers: thread creation and termination, TCP echo server using threads, Mutexes, condition variables, Raw Sockets: Raw Socket Creations,raw socket output/input, ping programs , trace route programs, Inter Process Communication(IPC): File and record locking, Pipes, FIFO streams and messages, Name spaces, system IPC, Message Queues, semaphores. Remote Login: Terminal Line disciplines, Pseudo Terminals, Terminal Modes, control terminals, rlogin overview, RPC transparency issues.Subject Code J0303CN03TitleNetwork Administration Work Load Per WeekL:4 T: Lab:1 ExaminationsInt: 30 Univ: 70ObjectivesTo understand and implement your own networks using various networking devices and configure them for reliable performance. Learning OutcomesAt the end of this course, student should be able to Understand designing and planning network.Understand various hardware devices.Configure these devicesTroubleshoot the networkUnderstand various protocols and their functioning.Design the VLANSPre-requisites Basic Knowledge software engineeringText Book(s)CCNA Cisco Certified Network Associate Study Guide (Exam 640-802) (Certification Press) by Richard DealCCNA Cisco Certified Network Associate Study Guide fifth edition ( Certification Press) by Todd Lammle, BPB PublicationsThe Practice of System and Network Administration, Second edition by Thomas A. Limoncelli, Christina J. Hogan, and Strata R. Chalup Addison-Wesley Professional; 2 edition.SyllabusUnit 1. InternetworkingInternetworking Models,?OSI reference ModelsEthernet networking? Wireless NetworkingCisco three layer hierarchical modelUnit 2. Internet ProtocolsTCP/IP and DoD model? Application and host to host layer protocolInternet layer protocol? IP addressingIP terminology? IP Addressing schemePrivate IP addresses? Broadcast addressesNetwork address translationUnit 3. IP sub netting and variable length subnet masksSubnetting Basics?Subnet and subnet masksSubnetting Class C addresses? Subnetting Class B addressesSubnetting Class A addresses? Variable length Subnet masksVLSM design? Trouleshooting IP addressingUnit 4. Introduction to the Cisco IOSCisco router GUI? Cisco router IOSConneting to Cisco router? Setup modeCommand line interface? Router modesCLI prompts? Router Administrative functionsConfiguring router? Verify configurationUnit 5. IP routingRouting basics? IP routing processConfiguring IP routing? Routing ProtocolsRouting information protocol? Interior gateway routing protocolIntroduction to EIGRP? Introduction to open shortest path firstUnit 6. Swithching Switching services? Spanning tree protocolLAN switch type? Configuring catalyst 1900 switchesConfiguring catalyst 1900 switchesUnit 7. Virtual VLAN Basics? VLAN membershipsIdentify VLANS? VLAN trunking protocolRouting between VLANS? Configuring VLANSIntroduction to wide area networking protocols.Subject Code J0303CN04TitleNetwork Security Work Load Per WeekL:4 T: Lab:1 ExaminationsInt: 30 Univ: 70ObjectivesThis course provides an essential study of Network Security issues.Learning OutcomesAt the end of this course, student should be able to To acquire an understanding of Network Security and its changing characterTo analyze both early and contemporary threats to Network SecurityTo understand the concept of CryptographyTo know the Network Security tools and applicationsTo understand the system level SecurityTo identify and investigate threats to Network SecurityPre-requisites Basic Knowledge of computer, Network Protocols, Computer Security Text Book(s)NETWORK SECURITY ESSENTIALS: Applications and Standards BY William Stallings – Pearson WORK SECURITY :PRIVATE communication in a PUBLIC world 2nd edition BY Charlie Kaufman, Radia Perlman, Mike Speciner -Prentice Hall of India Private Limited.UNIT –I Introduction: Attacks, Services and mechanisms, Security Attacks: Passive attacks, Active attacks. Security services: Confidentiality, Authentication, Integrity, Nonrepudation, Access Control, Availability. A model of Network Security, Internet standards and RFCs, viruses, Worms, Trojan Horses, Legal issues. Basic Cryptography: Historical Background, Transposition/Substitution, Caesar Cipher. What is Cryptography: Computational Difficulty, To Publish or Not to Publish, Secret Codes, Breaking an Encryption Scheme: Cipher text only, Known Plaintext, chosen Plaintext. Types of Cryptographic functions: Secret Key Cryptography, Public Key Cryptography, Hash Algorithms, Mathematical tools for Cryptography: Substitution and Permutations, Modular Arithmetic, Euclid’s Algorithm, Finite Fields, Polynomial Arithmetic, Discrete LogarithmsUNIT-IISecret Key Cryptography: Data Encryption Standard (DES):DES overview, Permutation of the Data, generating the Per-Round Keys, A DES round, The Mangler Function, Weak and Semi-Weak Keys, International Data Encryption Algorithm (IDEA): Primitive operations, Key Expansion, One Round, Inverse Keys for Decryption, Advanced Encryption Standard: Basic Standard, Primitive Operations, Key Expansion, Rounds, Inverse Rounds, Optimization, RC4,RC5,Rijindael (AES) Key Distribution, Modes of Operation: Encrypting a Large Message: Electronic Code Book(ECB),Cipher Block Chaining(CBC),Output Feedback Mode(OFB),Cipher Feedback Mode(CFB), Counter Mode(CTR), Generating MACs: Ensuring Privacy and Integrity together, CBC with a Weak Cryptographic Checksum, CBC , Encryption and CBC Residue with Related Keys, CBC with a Cryptographic Hash, Offset Codebook Mode(OCB). Multiple Encryption DES: How many Encryptions? CBC Outside vs. Inside UNIT-IIIHashes and Message Digests: Strong and Weak collision resistance, the Birthday Paradox, Nifty things to do with Hash: Authentication, Computing a MAC with a Hash, Encryption with a Message Digest, Using Secret Key for a Hash, MD2,MD4,MD5, SHA-1, HMAC. Public Key Cryptography: Modular Arithmetic, RSA: RSA threats, Public Key Cryptography Standards: Diffie-Hellman, How secure is RSA and Diffe-Hellman? Elliptical Curve Cryptography, Zero Knowledge Proof SystemsUNIT-IVAuthentication: Overview of Authentication Systems: Password based Authentication, Address –Based Authentication, Cryptographic authentication Protocols, Password as cryptographic Keys, Trusted Intermediateries : KDCs. Certification Authorities, Certificate Revocation, Session Key Establishment, Digital Signatures, Digital Signature Standard(DSS and DSA), Authentication of People: Passwords, On-line Password Guessing, Off-Line Password Guessing, Eavesdropping, Initial Password Distribution, Authentication tokens, Physical Access, Biometrics, Security Handshake Pitfalls: Login Only, Mutual Authentication, Integrity/Encryption for Data, Mediated authentication, Picking Random Numbers, Performance Considerations, Authentication Protocol Checklist, Strong Password Protocols: Lamport’s Hash, SRP, Authentication Applications: Kerberos V4, Kerberos V5,X.509UNIT-VReal Time Communication Security and IP Security: Session Key Establishment, Perfect Forward Secrecy, Denial of service/Clogging Protection, Endpoint Identifier Hiding, Live partner Reassurance, Session Resumption, Data stream Protection, Negotiating Crypto Parameters, IP Security Overview: Applications of IP Sec, Benefits of IPSec, Routing Applications, IP security Architecture: IPSec Documents, IPSec Services, Security Associations, Authentication Header(AH), Encapsulating Security Payload(ESP), Combining security associations, Key Management: ISAKMPUNIT-VIElectronic Mail Security: Pretty Good Privacy(PGP), S/MIME, X.400, Electronic Commerce Security: Electronic Payment Systems, Secure Electronic Transaction(SET), Cyber Cash, Key Protocols, EcashIDigiCash), System Level Security: Intruder Detection, Password Management, Virus Counter Measures, Firewall Design Principals, Digital watermarking and SteganographyGROUP III : THEORETICAL COMPUTER SCIENCESubject Code J0302TC01TitleDesign of Language Processors Work Load Per WeekL:3 T:1 ExaminationsInt: 30 Univ: 70ObjectivesThis course aims to cover the main technologies associated with compiling programming languages, viz. lexical analysis, syntax analysis, type checking, run-time data organization and code-generation. Also study fundamental concepts of programming language design, specification, implementation and translation through the very practical exercise of designing, writing, documenting and testing a compiler; to survey the state of the art in compiler theory and design. Students will implement a working a compiler that translates a high-level language into assembly language for the x86.Learning OutcomesAt the end of the course students should understand the overall structure of a compiler, and will know significant details of a number of important techniques commonly used. They will be aware of the way in which language features raise challenges for compiler builders.Pre-requisitesXII Level MathematicsText Book(s)Introduction to Computer Theory by Daniel Cohen, Compilers by UllmanSyllabusLec.Num.Unit TitleDetailsLearning Resources1Review of Mathematical PreliminariesSetHandout2Relation and FunctionsHandout3Graph and TreesHandout4Principle of inductionHandout5Alphabets and languagesPage 2-7(R1)6Theory of AutomationDefinition, Description, Transition GraphPage 52-87(R1)7DFA,NFAPage 92-140(R1)Lec.Num.Unit TitleDetailsLearning Resources8Minimization of Finite AutomataPage 92-140(R1)9Equivalence of DFA & NDFAPage 92-140(R1)10Moore & Mealy machinePage 149-156(R1)11Equivalence of Moore &MealyPage 149-156(R1)12Regular ExpressionDefinition & ExamplePage 31-44(R1)13Regular set & their closer propertiesPage 31-44 (R1) 14GrammarDefinitionPage 224-259 (R1) 15Properties unrestricted grammar & their equivalencePage 224-259 (R1)16Derivation treesPage 224-259(R1) 17Simplifying CFGPage 224-259 (R1) 18Unambiguifying CFGPage 224-259 (R1) 19Normal form of CFGPage 224-259 (R1) 20Chomsky Normal formPage 224-259 (R1) 22Introduction to Compiling and one pass compilerCompilers & TranslatorsPage 1-20(R2)23Phases of CompilersPage 1-20(R2) 24Structure of a CompilerPage 1-20(R2) 25Overview of one pass CompilerPage 25(R2)26Error handlingPage 25(R2) 27Lexical AnalysisRole of lexical analyzer, specification of tokensPage 83-92R2) 28Implementation of lexical analyzerPage 83-92(R2) 29Syntax Analysis & Parsing Techniques Phase Tree, Ambiguity of parse TreePage 159(R2) 30Bottom up parsing and Top down parsingPage 181-195(R2)31LR parsers, constructing SLR and canonical LR parsing tablesPage 215-257(R2)32Introduction to YACC,LR(1)& LALR ParsersPage 215-257(R2) Lec.Num.Unit TitleDetailsLearning Resources33Code optimizationFoldingPage 585-660(R2) 34Redundant sub-expression evolutionPage 585-660(R2) 35Optimization within iterative loopsPage 585-660(R2) 36Symbol Table handling techniquesOrganization for structured and non-structured languagesPage 429-440(R2)37Linking and Loading AllocationVarious schemes of Linking and LoadingHandout38Absolute and Relocatable loaderHandout39AssemblerStatements, simple assembly schemeHandout40Design of 2 pass assemblerHandout41Assembler ImplementationHandout42InterpretersInterpreters executionHandout43Interpretive languagesHandout44Structure of interpreterHandout45Partial compilationHandout46Editors-lineWindow, screen editorsHandout47Stream and structure editorsHandout48Design and implementation issueHandoutReference Books:R1: Introduction to Computer Theory by Daniel CohnR2: Introduction to Computer Theory by Daniel Cohen, Compilers by UllmanenSubject Code J0302TC02TitleAdvanced Database Technologies Work Load Per WeekL:3 T:1 ExaminationsInt: 30 Univ: 70ObjectivesTo study the database concepts which are not covered in earlier course on this topic and thus acquaint the students with some relatively advanced issues such as distributed databases, spatial & temporal database, data warehousing etc.Learning OutcomesAt the end of the course students should be able to:Gain an awareness of basic issues in object oriented data models.Learn about the Web Database Management Systems integration technology.Familiarize with data warehousing and other advanced topics as distributed databases, spatial & temporal database. Pre-requisitesThorough knowledge of Database Management Systems.Reference Book(s)A. Fundamentals of Database Systems 3rd Edition by Elmasri & NavatheB. Database System Concepts by Korth.C. Database Systems by Thomas Connolly & Carolyn Begg.D. Data Mining Concepts & Techniques by Jiawei Han & KamberE. Data Warehousing by C.S.R. PrabhuSyllabusLec.Num.Unit TitleDetailsLearning Resources1Object Oriented Database & Object Relational DBMSOverview of Object Oriented Concepts and Characteristics.A- 361 - 3632Object identity, Object structure and Type Constructors.A- 363 - 3693.Database design for ORDBMS, Comparing RDBMS. OODBMS & ORDBMSB – 288-289Lec.Num.Unit TitleDetailsLearning Resources4Advanced Concepts in Distributed DatabasesIntroduction, distributed database concepts, Advantages and disadvantages of distributed database.Data Fragmentation, Replication and allocation techniques for distributed database design.A - 765 – 771C – 686 - 694A – 771 - 7785Dates 12 rules for distributed databases.Types of distributed database systems. C- 726 – 728A – 778 - 7816Distributed Database Architecture, Homogeneous distributed database and Heterogeneous distributed database.Hand Outs7Query Processing in distributed database.A- 781 - 7868Overview of concurrency control and recovery in distributed database.A – 786 - 7899An overview of client – server Architecture and its relationship to distributed databaseA- 789 - 79010Parallel DatabaseIntroduction, Parallel database concepts and parallel database architecture.B – 565 & Handouts.11I/O Parallelism, Partitioning techniques, Handling of Skew.B – 566 - 56912Interquery Parallelism, Intraquery Parallelism & Interoperation Parallelism. B – 568 - 58213Design of parallel systems.B – 582 - 58314Active DatabaseIntroduction, concepts, Generalized model for active database.A – 734 - 73915Design and implementation issues for Active database.Potential applications for Active database. A – 739 – 741A - 74416Temporal DatabaseConcepts, Time representation, calendars and time dimensions in temporal database. Time series data.A – 744 - 74617Incorporating time in Relational database using Tuple Versioning, Incorporating time in Object oriented database using attribute versioning.A – 747 - 754Lec.Num.Unit TitleDetailsLearning Resources18Spatial & Geographic Database.Representation of geometric information, design of database and geographic database, Representation and applications of geographic data.B- 710 - 71519Indexing of spatial data, K-d Trees, Quad trees and R- trees.20Multimedia DatabaseIntroduction, similarity based retrieval, continuous media data, multimedia data formats, and video server.A – 759 – 760B – 719 - 72221Mobile DatabaseIntroduction, mobile computing ArchitectureA – 886 - 88722Types of data in mobile application, Data Management issues.A – 888 - 88923Deductive DatabaseIntroduction, Applications of deductive database.A – 834 - 83524Web Technology and DBMSIntroduction to the internet and web, Internet and Intranet, e- commerce & e- business.C – 934 - 94725The web, HTTP, HTML, URL’s, Static and dynamic web pages.C- 949 - 94526Web as a database application platforms: Requirements for Web – DBMS integration, Web –DBMS architectureC – 954 - 95827Advantages and disadvantages of the Web – DBMS approach, Approaches to integrating the Web and DBMS.C- 958 - 96328Web – Database ApplicationsHand Outs29Data WarehouseDefinition, characteristics, benefits and need for a separate data warehouse.D – 39 - 4430OLAP and OLTP Systems.D – 4331Multidimensional data models: - Tables, spreadsheets and data cubes.D – 44 - 4832Schemas for multidimensional data models: - Star, Snowflake and Fact constellation.OLAP OperationsD – 48 – 51D- 58 - 61Lec.Num.Unit TitleDetailsLearning Resources33Data Marts, Types of data marts, Loading a data mart, Metadata for data Mart, Data model for Data mart, Maintenance of a data mart, Nature of data in data mart, S/W components of data mart.E – 1 - 534Design of data warehouse, Process of data warehouse design. Three tier architectureD- 62 - 6935OLAP servers, Data Warehouse back end tools and utilities.D – 69 - 8536Data Preprocessing, need and objectives for data preprocessing. Preprocessing Techniques.D – 105 - 10837Data CleaningD – 109 - 11238Data IntegrationD – 112 - 11439Data TransformationD - 114 - 11640Data Reduction and DiscretizationD- 116 - 136Subject CodeJ0303TC03TitleHigh Performance Computing Work Load Per WeekL : 3 T : 1ExaminationsInt:30 Univ:70Pre-requisitesText Book(s)Introduction of Parallel Computing Ananth Grama Anshul Gupta George Karypis, Vipin KumarPublisher : Addison WesleyLecture NumberBroad topic to be coveredDetails thereof to be covered1Introduction to Parallel Computing Motivating Parallelism2Scope of Parallel Computing3Parallel Programming PlatformsImplicit Parallelism: Trends in Microprocessor Architectures4Limitations of Memory System Performance5Dichotomy of Parallel Computing Platforms6Physical Organization of Parallel Platforms7Principles of Parallel Algorithm DesignPreliminaries8Decomposition Techniques9Characteristics of Tasks and Interactions10 Mapping Techniques for Load Balancing11Methods for Containing Interaction Overheads12Parallel Algorithm Models13Programming Using the Message-Passing ParadigmPrinciples of Message-Passing Programming14The Building Blocks: Send and Receive Operations15MPI: the Message Passing Interface16Topologies and Embedding17Overlapping Communication with Computation18Collective Communication and Computation Operations19Groups and Communicators20Programming Shared Address Space PlatformsThread Basics21Why Threads?22Thread Basics :Creation & Termination23Synchronization Primitives in Pthreads24Controlling Thread and Synchronization Attributes25Thread Cancellation26Composite Synchronization Constructs27 Tips for Designing Asynchronous Programs28Dense Matrix AlgorithmsMatrix-Vector Multiplication29Matrix-Matrix Multiplication30SortingIssues in Sorting on Parallel Computers31Sorting Networks32Bubble Sort and its Variants33Quicksort34Bucket and Sample Sort35Other Sorting Algorithms36Graph AlgorithmsDefinitions and Representation37Minimum Spanning Tree: Prim's Algorithm38Single-Source Shortest Paths: Dijkstra's Algorithm39Transitive Closure40Connected Components41Search Algorithms for Discrete Optimization ProblemsDefinitions and Examples42Sequential Search Algorithms43Search Overhead Factor44 Parallel Depth-First Search45 Parallel Best-First SearchSubject Code J0303TC04TitleSimulation modeling Work Load Per WeekL:3 T:1 Lab:0 ExaminationsInt: 30 Univ: 70ObjectivesComputer techniques for simulating the behavior of physical, biological, engineering and social systems, including both natural and artificial systems. Applications include scientific inquiry, engineering design, manufacturing planning, training, entertainment, and games. Learning Outcomes The student will learn the theory of computer simulation and modeling, how it is used, and methods and tools for simulation and modeling and and be able to model phenomena using discrete and continuous probability distributions, and elements from queuing theory. They will learn the techniques of pseudo-random number generation, how to test and evaluate generators in a given application, and how to use those generators to model phenomena of interest also computer simulation, conduct input modeling, verification, validation, and output analysis. They will apply knowledge and skills learned on at least one large collaborative modeling and simulation project. Pre-requisitesXII Level MathematicsText Book(s)Simulation Modelling and Analysis by Averill M. Law & David KeltonSyllabusUNIT -1 Basic Simulation Modeling Introduction, Definition of Modeling and Simulation, Types of Simulation, Steps in simulation study, Application of simulation, Discrete Vs Continuous simulation, Advantage & Disadvantages, Pitfalls, Modeling Complex system, List Processing Simulation, Simulation LanguageUNIT-2 Simulation Queuing System Characteristics Performance of Queuing Systems, Steady State BehaviorNetworks of Queues, Inventory models, Problem statement, Program organization and LogicJob shop models, Problem Statement, Simlib Program, Simulation OutputMultiteller Bank with Jockeying, Problem Statement, Simlib Program, Simulation OutputInput Modeling ,Collecting Data, Identifying Distribution, Histograms, Parameter Estimation, Goodness of Fit, Statistical models, Terminology and Concepts, Useful Statistical Models, Statistical Analysis, Distributions UNIT-3 Random Number GenerationProperties of Random Numbers, Generation of Pseudo-Random NumbersTesting for Randomness, Pitfalls, Generating Random Variates, Inverse TransformComposition Method, Convolution Method, Acceptance-Rejection TechniqueSpecial properties UNIT-4 Simulation ModelsIntroduction & Definitions, Model Details, Developing Simulation ProgramsTechniques for Increasing Model Validity & Credibility, Output Data AnalysisIntroduction, Steady-State Behavior of a Stochastic ProcessStatistical Analysis for Steady-State ParametersTechniques for Increasing Model Validity & Credibility UNIT-5 Simulation softwareHistory, Selection process, Simulation in High Level Language(C, C++, Pascal, FORTRAN) Simulation packages (Methlab/ Simulink), Interpreted vs. compiled simulatorsFuture trends, Interpreted vs. compiled simulators, ExamplesReference Books:Simulation Modelling and Analysis by Averill M. Law & David Kelton Group-IV: Advanced Programming EnvironmentsSubject CodeJ0302APE01TitleMFC Programming Work Load Per WeekL:3 T:1 P:4ExaminationInternal: 30 University Exam: 70 ObjectivesMake student comfort to develop desktop applications using MFC Learning OutcomesAt the end of this course, students should be able to: Handle multiple inheritance and polymorphism in C++Use message handling of windows Use MFC to do Graphics and System ProgrammingDevelop applications and component to take advantages of MFC SDI and MDI Pre-requisitesC Programming and Object oriented ConceptsReference BooksBjarne Stroustrup, The C++ Programming Language, Addison-Wesley, 3rd EditionJeff Prosise , Programming Windows with MFC, Microsoft Press; 2 edition, Richard Jones, Introduction to MFC Programming with Visual C++, Pearson Herbert Schildt, MFC Programming from the Ground Up, McGraw-Hill?SyllabusUnit 1: Essential C++Using Structures and Union and Class Types of constructors, need of copy constructor Implementing Inheritance in C++, Access control in InheritanceConcept of virtual function and using such functions, Concept of Virtual TableMultiple Inheritance and virtual Base classes Unit 2: Introduction to Windows Programming Model and Message HandlingOverview of developers studio, writing simple applicationWindows Software Architecture, Event-Driven ProgrammingMessages and Message EncapsulationWindows Libraries and APIs for message handling, The Message MapAdding Message Handlers with Class WizardUnit 3: MFC Class HierarchyMFC Base Classes, Elements of an MFC ProgramMFC Collection Classes, Iterating CollectionsDocuments and FramesMFC Diagnostic FacilitiesExceptionsCWnd Encapsulation of Windows, CWnd Class Hierarchy, changing window attributes, handling activation and keyboard focus Unit 4: Document/View ArchitectureThe Document/View Model?Document and View ClassesDocument Templates? Saving and Loading DocumentsUsing Multiple Views? SDI and MDI Application StylesDecoupling Document and ViewUnit 5: Serialization and Persistent DocumentsCArchive ObjectDocument SerializationSerializing PointersCreating Persistent ClassesSerializing CObject PointersSerializing CollectionsUnit 6: The Mouse and keyboardWindows Mouse ProcessingCWnd Class Mouse SupportCapturing the MouseMouse Cursor, Using MFC for Drawing with the MouseWindows Keyboard Conventions, Keystroke and Character Messages, Capturing Keystroke InputUnit 7: Using Menus and dialogsBuilding a Menu, Menu Resources Command Routing and Implementing Message HandlersSpecifying Shortcuts and Accelerators, Dealing with Unavailable OptionsCMenu Class and Dynamic Context Menus, MFC Strings and Use of StringtablesDialog Modality, Programming a Modal and Modeless DialogConnecting Code to the Dialog with ClassWizardBuilding Custom Dialogs and Handling Control MessagesUsing OCX Controls, Keyboard TraversalData Communication Between Dialog and ParentCommon Dialog Boxes, Property Sheets and Tabbed DialogsUnit 8: Using ControlsMapping Control Variables, Modifying Control AttributesPush Buttons, Check Boxes, RadioButtonsEdit ControlsList Boxes and Combo BoxesTree ControlsSpin Buttons, Progress Bars, and SlidersControl ViewsUnit 9: MDI and Multiple ViewsSDI vs. MDI ApplicationsMultiple View TypesMultiple Views Under SDI and MDIDocument TemplatesInstancing a ViewAdding a New Document ClassUnit 10: Introduction to ResourcesWindows Resources OverviewIcons, Cursors, and BitmapsToolbars and Status BarsStrings and FontsMenus and DialogsUnit 11: The Graphics Device InterfaceDevice Contexts and CDCsGDI Drawing Tools and AttributesGDI Object Creation and CleanupColorsGDI Coordinate Systems and Mapping ModesRegions and ClippingDrawing and Text FunctionsPens, Brushes, FontsBitmaps and DIBsIcons and CursorsUnit 12: Form ViewsForm, Scroll, and Edit ViewsCreating a Form View from a Dialog TemplateAdding a Form View to a DocumentHandling Messages for View ControlsInitializing and Sizing the Form View Preventing User ResizingUnit 13: Database ProgrammingMFC CapabilitiesThe Jet EngineMFC Database ClassesUsing CRecordViewOverview of SQLUsing DAO and ODBC for Browsing, Adding, Updating and Deleting RecordsDAO and ODBC Classes and taking AppWizard and Class Wizard SupportSubject Code J0302APE02TitleAdvanced Software Engineering Work Load Per WeekL:4 T: Lab:1ExaminationsInt: 30 Univ: 70ObjectivesThe course aims to develop the broad understanding of the discipline of software engineering (gained in the earlier software engineering course) by considering the wider systems engineering context in which software plays a role. It aims to examine the concept and techniques associated with a number of advanced and industrially relevant topics, relating to both the product and processes of software engineering. Learning OutcomesAt the end of this course, student should be able to Appreciate the wider engineering issues which from the background to developing complex evolving systems.Employ the selection of concept and techniques to complete a small scale study into one of the advanced topic areas.Embark on more in depth research or practice in software engineering Understand the aspects, agile, service, agent oriented software engineering. Pre-requisites Basic Knowledge software engineeringText Book(s)SOFTWARE ENGINEERING, Ian Sommerville, 8th edition, AddisonWesley 2006, ISBN -10:0321313798SOFTWARE ENGINEERING A PRACTITIONERS APPROACH fourth edition BY Roger S. Pressman McGraw Hill International EditionSyllabusUnit 1. Socio-technical Systems and system models? Emergent system properties?System engineering ? Organization, people and computer systems?Legacy system? Context model?Behavioral model? Data model?Structured modelUnit 2. Architectural Design and Distributed systems ArchitectureArchitectural design decisions? System organizationsModular decomposition styles? Control StylesReference architectures ? Multiprocessor architectureClient server? Distributed object ArchitectureInter organizational distributed computerUnit 3. Object oriented, Real time and component based software designObject and object classes? Object oriented design processDesign evolution? Real time operating systemsMonitoring and control systems? Data acquisition systemsComponent and component models? CBSE processComponent compositionUnit 4. Security and service oriented software engineeringSecurity concept? Security risk managementDesign of security? System survivabilityServices as reusable components? Service engineeringSoftware development with servicesUnit 5. Aspect Oriented Software DevelopmentCross cutting concern? Development concernsProduction concerns? GoalsWeavingUnit 6. Agile Software engineeringIntroduction? What is agile development?Agile manifesto and agile principles? Modeling and agile modelingThe gist of agile processesUnit 7. Agile MethodologiesReasons for agilityMethodologies for developing softwareWhy care about methodologies?Agile processes strength and weaknessesUnderstanding XP, Scrum, Evo, Unified Process, Crystal, Lean development, ASD, DSDM and FDDComparison of methodologies Choosing a methodologyCustomizing a methodologyUnit 8. Agent oriented software engineeringIntroductionAgent oriented softwareThe case for an Agent oriented ApproachAgent oriented software lifecycleSubject CodeJ0303APE03TitleHuman Computer Interface and Mobile Computing Work Load Per WeekL:3 T:1 P:2ExaminationInternal: 30 University Exam: 70 ObjectivesIntroduce models and principles of Human Computer Interface (HCI) and use that in Mobile programming using J2ME Learning OutcomesUpon completion of this course, students should be able to: Understand Models and principles of HCIUnderstand various mobile technologies such as GSM, SMA, CDMA and WAP ArchitectureUnderstand WAP and J2ME ArchitectureDevelop simple applications using MIDlets make efficient Use threads and memory in applicationMake HTTP network connections from the mobile device.Pre-requisitesObject Oriented Programming Reference BookAsoke K Taqlukeder, Roopa Yavagal Mobile Computing, McGraw-Hill; 2005James Keogh J2ME: The Complete Reference, McGraw-Hill Osborne Media; 2003Ben Shneiderman, Designing the User Interface, Pearson Education, 1998SyllabusLec.NumUnit TitleDetailsIntroduction to Human Computer InterfaceNeed and Importance of HCI HCI and Human DiversityGoals and Objectives of HCIModels of HCIConceptual, semantic, Syntactic and Lexical ModelGMOS Model Object-Action Interaction modelAction-Object Interaction modelLec.NumUnit TitleDetailsPrinciples of Design Principle 1: Recognition and DiversityPrinciple 2: Eight golden rules of interface designPrinciple 3: Error PreventionGuidelines for Data Display and Data EntryInteraction Styles of designDirect and Menu selection Form fillin, Command LanguageNatural LanguageComputer Supported co-operationGoals of co-operation, Synchronous Interactionsasynchronous and face to face Interactions Application to education and social issuesFuture Applications and HCIIntroduction to Mobile ComputingIntroduction to mobile computing , Characteristics of mobile devices , Issues of mobile computing Mobile Computing ArchitectureUnderstanding Global System for Mobile Communication (GSM)Concept of Short Message Service (SMS) and General Packet Radio Service (GPRS)Understanding Wireless Application Protocol (WAP)CDMA Technology, Spread spectrum technology, CDMA vs GSMWireless Data and Third Generation(3G) NetworksIntroduction to J2ME ProgrammingOverview of J2MEJ2ME ArchitectureThe Connected, Limited Device (CLDC)Configuration and Classification CLDC of Target DevicesLimitations of Java Language Support in CLDC, The java.lang PackageCLDC Collections API, The Streams ModelThe Generic Connection FrameworkLec.NumUnit TitleDetailsThe Mobile Information Device Profile, Relationship of MIDP to CLDCMIDlets, MIDlet Lifecycle, Application DescriptorsThe Java Application Manager, MIDlet Suites and, Loading Resources User Interface DesignThe High-Level User-Interface (HLU) API, Application Descriptors, Displayable HierarchyHLU: using Forms, Items, Text Fields, date and timesHLU: Choice groups, alerts, TickertsThe Low-Level User-Interface(LLU) API: Canvas Class, Using Graphics object for drawing graphics/text and controlling fontEvent HandlingMIDP Event Architecture, High-Level Event Handling, CommandsItem State Changes, Low-Level Event HandlingKeypad and Pointer InputMVC in MIDP, Model EventsThe Record Management SystemPersistence on Mobile Devices, Scope of Record ManagementOpening and managing a Record StoreUsing Streams for Record I/O, Persistence Strategies, Filtering and Sorting RecordsNetworking and TimersThe Generic Connection Framework, MIDP Connection Types, Creating an HTTP ConnectionBuilding Query Strings, Reading HTTP Responses, The WTK Network Monitor, Bandwidth Emulation Threading, Timers and Timer TasksMemory ManagementMemory Management Techniques, The WTK Memory Monitor and Efficient Data Representation Controlling Object Creation, Using Arrays Effectively, String ManipulationSubject CodeJ0303APE04TitleOpen Source Technologies Work Load Per WeekL:3 T:1 Lab : 4 ExaminationsInt : 100ObjectivesThis course is aimed to:understand open source movement worldwideuse the fastest growing open source operating system, “Linux”, todayeffectively install, use and perform basic configuration of Linux systembuild user-level skills to perform Linux System Administration in IT professionenable competency in industry-problem identification and resolutiondevelop application using LAMPLearning OutcomesText Book(s)1 Red Hat Linux Bible Christopher Negus Wiley Publishing ISBN : 0-7645-4333-42 PHP, MySQL and Apache Julie C Meloni Pearson Education ISBN : 81-297-0443-93 The Complete Reference Linux Peterson Tata McGRAW HILL ISBN : 0-07-044489-74 UNIX using Linux Jack Dent, Tony Gaddis Course Technology ( Thomson Learning) ISBN : 981-240-218-7Internet Resources:1 Open Source Phenomenon Open Source Technology : Brief Open Source : Benefits Beginner's Guide to Linux - Michael Jordan Details IntroductionOSI – Open Source Initiative?Open Source DefinitionOpen Source Licenses? Open Standard RequirementFOSS – Free and Open Source SoftwareOrigin of FOSS?Advantage and Disadvantages of FOSS?Packaging and Releasing of Open Source SoftwareIntroduction to perl programming, Object oriented perl programmingIntroduction to perl?Basic VariablesData Types?Scalar VariablesArray Variables?Hash VariablesStrings, NumbersIf and else, While and for loopsOperatorsUser I/O?Advanced OutputFile handles?Statement ModifiersFunctions?Perl 5.10 AdditionsExercises?Programming Structure and styleReferences and Data Structures?Regular ExpressionsRegular Expressions Operators?Regular Expressions ReferenceCode Reuse (Modules)?Perl Objects03PHP Programming, Advanced PHP Programming, MySql Databases, MySql Database Administration.Introduction to PHP?Syntax OverviewFile Handling?Database ConnectivitySession Handling?Command Line ProgrammingForm Handling?Introduction to MySqlCreating a Database?Creating a TableBasic Queries?Common Function and Operators04Python ProgrammingIntroduction to Python?First Embedded Python ApplicationRunning some strings?Extension ModulesBuilding and Passing Arguments?The None ObjectExceptions?Logging StdoutFiles?List/TuplesCallbacks?Setting up your own scripting concepts05Ruby Programming, Ruby of Rails WorkshopIntroduction to RubyVariables, Data Types, Operators, Symbols, StatementsConverting Data to Another Type: Type conversion to Type CastingArrays, Hashes, and RangesFunctions and Built in FunctionsControl Structures, Loops Regular Expressions and BlocksRecursionData structuresMethods, Classes, Modules, NamespacesExceptionsObject Oriented PrograamingMulti threadingFile Handling, Input and OutputBasic GUIRuby and Databases – Ruby on Rails and MySQL06Unix/LinuxIntroduction to Unix/LinuxUnix/Linux Shell Scripting ?Linux InstallationUnix/Linux System Administration?Unix/Linux System ProgrammingUnix/Linux Network Programming?Unix and Linux SecurityCoding Rules?Error LoggingClient-Server ModelInter-Process CommunicationIntroduction?PipesPopen() and Pclose() functions?Co-ProcessesFIFOs?System V IPCMessages Queues?SemaphoresShared Memeory?Client Server PropertyDevelopment ToolsGNU Cross Platforms Development Tool – chainC/C++ Compilers?C library alternativesShell Scripting?JavaPerl?PythonIntegrated programming EnvironmentsTerminal EmulatorsDevice Driver ProgrammingReal Mode and Protected Mode in 80x86 microprocessorUser and Kernel Mode ProgrammingDynamic Kernel Model (DKM) ProgrammingCharacter Device Driver programmingBlock Device Driver ProgrammingNetwork Device Driver ProgrammingProc file SystemGroup-V Embedded TechnologiesEMBEDDED SYSTEM ELECTIVES FOR MCA PROGRAMME OF BVU STRUCTURE OF EMBEDDED SYSTEM ELECTIVESSemesterSr. No.SubjectMarksSemester-IVPaper – IEmbedded System Design and Implementation100Paper – IICommunication in Embedded Systems100Semester-VPaper – IIISystem and Device Driver Programming100Paper – IVEmbedded and Real-Time Operating Systems100 PAPER - I: EMBEDDED SYSTEM DESIGN AND IMPLEMENTATIONUnit. No.Unit titleDetailsIntroduction to Embedded SystemsUnderstanding embedded systems, Categories of Embedded Systems, Requirements of embedded systems, Challenges and issues involved in embedded software development, Trends in embedded software development.Microprocessor based systemsMicroprocessor, Memory, Input/Output Devices,8/16/32 bit microprocessorsMicro-Controller based systemsMicro-controller,Program/Data memory, Internal/External memory,Instruction set, Development tools.Embedded system design Processor , Memory, Latches and buffers,Crystal, Reset Circuit, Chip select logic circuit,ADC and DAC, Display Unit, Keypads, Communication interfaces, Programmable logic devices.Software development environment for embedded systemsTarget hardware platform,Development platform,Programming languages,Operating systems,Development tools.Digital interfacingKeyboard interfacing,LED Display interfacing,LCD interfacing,Servo motor interfacing,Stepper Motor interfacing,Pulse measurementAnalog InterfacingDigital-to-analog converter interfacing,Analog-to-digital converter interfacing,ADC techniques, DAC techniques.InterruptsHardware interrupts, Software interrupts,Internal interrupts, External interrupts, Internal vector tables, Interrupt service routines, Shared data problem,Interrupt latency.MCS-series micro-controller based embedded system design and programmingInternal architecture of 8051 micro-controller,8051 assembly language programming,8051 interfacing,8051 programming on MCS-51 kitText Books: Programming Embedded systems in C and C++ - by Michael BarrThe 8051 Microcontroller: Architecture, Programming & Applications - by Kenneth J. Ayala PAPER - II: COMMUNICATION IN EMBEDDED SYSTEMSUnit No.Unit titleDetails1.Serial communication Communication parameters,RS-232 protocol,Null Modem Cable connections,PC- to-PC communication,Serial Communication with the 8051 family of micro-controllers, Microwire, SPI, 12C, CAN2.Parallel port communicationCommunication parameters,Centronic protocol,PC-to-PC Communications,Parallel Port Communication with the 8051 family of micro-controllers3.USB communicationIntroduction to USB port,USB audio,USB image capture,USB mass storage,USB infrared.4.TCP/IP socket communicationNetwork topologies,Network protocols,TCP/IP protocol stack,Ethernet connectivity,Socket programming,Communication protocols e.g. HTTP, FTP, telnet, DHCP etc,Communication Services,System integration.Text Books:The 8051 Microcontroller and Embedded systems - by Mazidi & MazidiUnix Network Programming - by W. Richard Stevens PAPER - III: SYSTEM AND DEVICE DRIVER PROGRAMMINGUnit No.Unit titleDetails1.File I/OIntroduction , File Descriptors, open() function,create() function, close() function, lseek() function,Read() function, Write() function, I/O efficiency,File Sharing, Atomic operations, dup() and dup2() functions, fcntl() functions, Ioctl() function,/dev/fd.2.Process controlIntroduction, Process Identifiers, Fork() function,Vfork() function, Exit() function, Wait() and waitpid() function, Wait3() and wait4() functions,Race conditions, Exec() function, Changing user Ids and group Ids, Interpreter files, System() function,Process counting, User identification,Process times.3.SignalsIntroduction, Signal Concepts, Signal() function, Unreliable signals, Interrupted system calls, Reentrant functions, SIGCLD sematics, Reliable signal terminology and sematics, Kill() and raise() functions,Alarm() and pause() functions; Signal Sets Sigprocmask() function, SigpendingSigaction() function, Sigsetjmp() and siglongjmp() functions, Sigsuspend() function, Abort() function,System() function, Sleep() function, Job-Control signals.4.Daemon processesIntroduction, Daemon characteristics, Coding Rules,Error Logging, Client- Server model.5.Inter- process communicationIntroduction, Pipes, Popen() and Pclose() functions,Co-Processes, FIFOs, System V IPC, MessageQueues, Semaphores, Shared memory, Client-server properties.6.Development toolsGNU cross-platform development tool-chain C/C++ compilers, C library alternatives, Shell scripting, Java, Perl, Python, Integrated programming environments,Terminal emulators7.Device driver programmingReal mode and protected mode in 80x86 microprocessors, User and Kernel mode programming,Dynamic kernel module(DKM) programming, Character device driver programming, Block device driver programming, Network device driver programming,Proc file system,Proc file system driver programming.Text Books:Device Driver Programming - by RubiniAdvanced Programming in the UNIX environment - by Richard StevensPAPER - IV: EMBEDDED AND REAL- TIME OPERATING SYSTEMSUnit. No.Unit titleDetailsIntroduction to operating systemHistory and purpose,Multi-mode execution of a processor,Case studies: DOS, Windows-98, Linux.Architecture of an operating systemKernel: Monolithic kernel Vs Micro Kernel,Device Drivers,, Libraries, Shell, Utilities,User applications.General purpose operating systemsMemory Management,Scheduling and task management,Hardware interfaces,File management,Communication.Embedded operating systemsEmbedded operating system considerations,Task scheduling,Context Switch,Task Synchronization,Embedded Windows NT,Windows XP Embedded,Open Source embedded Oss: Linux, BSD etcReal-time conceptsIntroduction,Worst Case Vs Average Case,Hard Vs Soft Real time,Spin lock Vs sleep lock,Interrupts, thread, Process,Task, Kernel, Preemption,Context switch,Single Shot threads Vs conventional threads, priorities.Real time operating systemsIntroduction to Real- Time OSs,Case study: RTLinux,Advantages and disadvantages of RTLinux,Installing RTLinux,Overview of RTLinux design,Basic RTLinux API,RTLinux module programming,Inter- process communication in RTLinux environment (e.g. real-time FIFO)Text Books: Building Embedded LINUX Systems - by Karim YaghmourLinux Kernel Programming - by Beck ................
................

In order to avoid copyright disputes, this page is only a partial summary.

Google Online Preview   Download