bharati vidyapeeth - web viewblock diagram of general register organization, control word, block...

2010

MCA SYLLABUS

BHARATI VIDYAPEETH

Bharati 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 like

(3)

BHARATI 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;

(4)

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.

(5)

BHARATI VIDYAPEETH DEEMED UNIVERSITY, PUNEFACULTY OF MANAGEMENT STUDIES

MASTER 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.

(6)

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.

i. The candidate should have secured at least 45% (40% for SC/ST) in aggregate at graduate level university examination.

ii. The knowledge of mathematics / Statistics at XII level or higher level is essential except for BCA, B.Sc. (Computer), BCS graduates.

iii. 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.

7 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 PASSING

A) Passing Rules

1. A student is allowed to appear for Semester Examination provided the aggregate percentage of attendance is at least 75 % for each Semester.

2. 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.

3. 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.

(7)

The subjects are as follows:

Sr. No

Semester

CourseCode

Subject Name Sr. No.

Sem ester

CourseCode

Subject Name

1 I J030107 Self Learning Course –I

1 II J030115 Self Learning Course – II

2. I J030108 Societal Concerns and Life Skills

2 II J030116

Communication Skills

1 III J030223 Self Learning Course –III

1 IV J030231 Self Learning Course – IV

2 III J030224 Foreign Language

2 IV J030132 Entrepreneurship Skills

1 V J030339 Self Learning Course – V

2 V J030340 Research Patterns in Information Technology and Applications.

B) Award of class:

1. No class shall be awarded to any Semester Examination separately

2. 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 together

3. The award of class shall be as follows:

Less than 40 % Fail

40 % 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 RULES

i. 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.

(8)

10. COURSE STRUCTURESEMESTER – I

Sr. No

Sub. Code

Subject Title Workload Marks

T P Tot. Uni. Int. Pr. Tot.

1 J030101 Basics of Software

Development Skills

4 - 4 70 30 - 100

2 J030102 Procedure Oriented

Programming

4 4 8 70 30 50 150

3 J030103 Computer Architecture

and Assembly

Language Programming

4 4 8 70 30 50 150

4 J030104 Business Process

Modeling **

4 - 4 70 30 - 100

5 J030105 Computational

Mathematics I

4 - 4 70 30 - 100

6 J030106 Web supporting

Technologies

3 4 7 - - 100 100

7 J030107 Self Learning Course -I 2 - - - 50 - 50

8 J030108 Societal Concerns and

Life Skills

1 - 1 - 50 - 50

Total 26 12 38 350 250 200 800

** 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.

(9)

SEMESTER – IISr. No

Sub. Code



9 J030109 Database Management Systems

4 4 8 70 30 50 150

10 J030110 Object Oriented Programming

4 4 8 70 30 50 150

11 J030111 Operating System Concepts and Case Studies

4 - 4 70 30 - 100

12 J030112 Financial management and Accounting Principles

4 - 4 70 30 - 100

13 J030113 Computational Mathematics II

4 - 4 70 30 - 100

14 J030114 Minor Software Project -1 - 4 4 - - 100 100

15 J030115 Self Learning Course –II 2 - - - 50 - 50

16 J030116 Communication Skills 4 - 4 - 50 - 50

Total 26 12 38 350 250 200 800

SEMESTER – IIISr. No

Sub. Code



17 J030217 Software Engineering 4 - 4 70 30 - 100

18 J030218 Linux Programming 4 4 8 70 30 50 150

19 J030219 Computer Networks 4 - 4 70 30 - 100

20 J030220 Organizational Behaviour and Change Management

4 - 4 70 30 - 100

21 J030221 Scientific Computation 4 4 8 70 30 50 150

22 J030222 Dot NET Technologies 4 4 8 - - 100 100

23 J030223 Self Learning Course –III 2 - - - 50 - 50

24 J030224 Foreign Language 2 - 2 - 50 - 50

Total 28 12 38 350 250 200 800

(10)

SEMESTER – IVSr. No

Sub. Code Subject Title Workload Marks


25 J030225 Object Oriented Analysis and Design Patterns

4 - 4 70 30 - 100

26 J030226 Applied Data Structures and Algorithm Design Patterns

4 4 8 70 30 50 150

27 J030227 Distributed Programming 4 4 8 70 30 50 150

28 Elective-I 4 - 4 70 30 - 100

29 Elective-II 4 - 4 70 30 - 100

30 J030230 Minor Project-II - 4 4 - - 100 100

31 J030231 Self Learning Course –IV 2 - - - 50 - 50

32 J030232 Entrepreneurship Skills 4 - 4 - 50 - 50

Total 26 12 38 350 250 200 800

SEMESTER – VSr. No

Sub. Code



33 J030333 Software Project Management and Software Testing

4 4 8 70 30 50 150

34 J030334 Web services and SOA Applications

4 4 8 70 30 50 150

35 J030335 Soft Computing 4 - 4 70 30 - 100

36 Elective-III 4 - 4 70 30 - 100

37 Elective-IV 4 - 4 70 30 - 100

38 J030338 Minor Project-III - 4 4 - - 100 100

39 J030339 Self Learning Course –V 2 - - - 50 - 50

40 J030340 Research Patterns in Information Technology and Applications

4 - 4 - 50 - 50

Total 26 12 38 350 250 200 800

(11)

SEMESTER – VISr. No

Sub. Code

Subject Title University Examination

41 J030341 Major Software Project Letter Grade: A, B, or F

11. ELECTIVES

From 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 IT

Paper No Code Number Subject Title

1 J0302BIT01 Design of E-commerce Applications

2 J0302BIT02 Intelligent Decision Support Systems

3 J0303BIT03 Knowledge Management

4 J0303BIT04 IT Enabled Services

Group II : Computer Networking


1 J0302CN01 Network Architecture and Design

2 J0302CN02 Network Programming

3 J0303CN03 Network Administration

4 J0303CN04 Network Security

Group III : Theoretical Computer Science


1 J0302TC01 Design of Language Processors

2 J0302TC02 Advanced Database Technologies

3 J0303TC03 High Performance Computing

4 J0303TC04 Simulation Modeling

(12)

Group IV : Advanced Programming Environments


1 J0302APE01 MFC Programming

2 J0302APE02 Advanced Software Engineering

3 J0303APE03 Human Computer Interface Design and Mobile Computing

4 J0303APE04 Open Source Technologies

Group V : Embedded Technologies


1 J0302ET01 Embedded System Design and Implementation

2 J0302ET02 Communication in Embedded Systems

3 J0303ET03 System and Device Driver Programming

4 J0303ET04 Embedded and Real-Time Operating Systems

12. 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.

(13)

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 Project

Students 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 Project

Every 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 fail

Note: For major software projects in semester VI; there will be one panel of examiners for 30 students.

(14)

17. Subject wise Syllabus

SEMESTER-ISubject Code J030101

Title Basic Software Development Skills

Work Load Per Week L:3 T:1 Lab:0

Examinations Internal: 30 University: 70

Objectives The 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 Outcomes At 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-requisites XII 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.

Syllabus

Lec.Num.

Unit Title Details Learning Resources

1 Systems Concepts Definition of a System, Elements of system, Characteristics of a System, Types of Systems

Hand Out

2 Task Performing Systems (TPS)

Components of TPS, DoS Model, Windows Model, Unix Model, LAN Model

Hand Out

3 Hardware System Block Diagram, Analysis of CPU Hand Out

4 Analysis of Internal Memory Hand Out

5 Analysis of Arithmetic Logic Unit,

Input Devices, Output Devices and

Control Unit

Hand Out

(15)

Subject Code J030101

Lec.Num.


6 Analysis of Firmware Hand Out7 Operating Systems Definition of O.S.,Functions of Operating

Systems, Types and examples of Operating SystemsUser Interface of Windows

Hand Out

8 Data Communication and Networking

Introduction, Data communication Process, Communication concepts

9 Communication Types, Data transmission Medias

10 Types of Network: LAN,WAN,MAN, Topologies of LAN

11 Components Of LAN: Media, NIC, NOS, Bridges, HUB, Routers, Brouters, Switch, Repeaters, Gateways, Modem

12 Communication Protocols, Roles of communication Protocol, layered protocols.

13 Communication Processors: Multiplexers, Concentrators, Front End Processors.

14 Asynchronous & Synchronous Transmission, Switching Techniques.

15 Client/Server Computing16 Application Software Word Processors Hand Out

17 Spread Sheets Hand Out

18 Data Base Management Systems Hand Out

19 Presentation Managers Hand Out

20 Internet Systems Hand Out

21 CAD Systems, Expert Systems Hand Out

22 Abstraction Definition and Goals of Abstraction, Major Types of Abstraction- Problem Abstraction, Procedure Abstraction, Data Abstraction, and Program Abstraction

Hand Out

23 Problem Abstraction Definition of the terms Problem and Problem Abstraction, Examples of Problem Abstraction

Hand Out

(16)


Lec.Num.


24 Procedure Abstraction Top-Down Approach to Problem Solving, Definition of Procedure and Procedure Abstraction, Examples

Hand Out

25 Data Abstraction Nature and Types of Data, Internal and External Representations of Data, Bits and Bytes, ExamplesRepresentation of Non-numeric Data- ASCII, Unicode. Examples

Hand Out

26 Number Representations

Representation of Non-negative Integers, radix-r representation, conversion from radix-r to radix-s

Hand Out

27 Addition and Subtraction ofRadix-r Integers, Error Detection

Hand Out

28 Multiplication of Radix-r IntegersDivision of Radix-r Integers, Computing the remainder

Hand Out

29 BCD Representation and Arithmetic Hand Out

30 Representation of Integers

Sign-Magnitude forms and Arithmetic r-1th and r th complement forms, Arithmetic in r th complement form

Hand Out

31 Representation of Rationals

Definition of Rational Numbers, Rational Arithmetic

Hand Out

32 Representation of Real Numbers

Mantissa and Fraction form, Exponent form, Normalization, IEEE 745 form, concept of precision

Hand Out

33 Addition and Subtraction of FloatsMultiplication and Division of Floats

Hand Out

34 Errors in Floating Point Arithmetic Hand Out

35 Representation of Strings

Definition of String, Counted String Representation, Null Terminated Strings

Hand Out

36 String Manipulation Hand Out

(17)


Lec.Num.


37 Introduction to Computer Languages

Computer Languages, Language Types, Definition of ProgramPrograms in Machine Language

Hand Out

38 Assembly Language, Programs in Assembly Language, Interpreters

Hand Out

39 Higher Level Languages, Major Paradigms-Procedure Oriented, Object Based, Object Oriented, Logic Based, Functional anguages, ExamplesCompilers and Translation Process

Hand Out

40 Program Abstraction Definition of Program Abstraction and concept of an algorithm

Hand Out

41 Algorithm Representation-Pseudo Code, Algorithm Representation- Flow Charts

Hand Out

42 Elementary Algorithms for Search, Sort, and Merge

Hand Out

43 Recursive Algorithms Definition and Examples Hand Out44 Programming Meaning of Programming, Concept of

Modular ProgrammingHand Out

45 Computer Maintenance Introduction, Typical causes of System Failure & Disaster Recovery.

Pages

46 Computer Virus Computer Viruses, Trojan Horse, Worms. Some reported viruses.

Pages

47 File infectors, Disk Infectors, Partition Infectors, Boot Infectors, Companion Viruses, CMOS Virus, and Hardware Virus.

Pages

48 Societal Impacts of Information Technology

Computer Privacy, Security & Integrity. Pages

(18)


Title Procedure Oriented Programming


Examinations Int: 30 Univ: 70

Practical Examination: 50

Objectives This 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 Outcomes At 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 programs


Text Book(s) Any suitable books or Handout can be used

Syllabus

Lec.Num.

Unit Title Details

1 Learning a Computer Language

Natural Languages and Computer Languages- Symbols, Alphabet, Vocabulary and Reserved words, High level words and Identifiers, Sentences and Statements

2 Executable and Non-Executable Statements, Types of Executable Statements- Input Statements, Assignment and Arithmetic Statements, Control Statements- Sequential, Selection, Iteration Statements, Output Statements

3 Concepts of a Program and subprogram, Procedures and functions

4 Syntactic, Semantic, and Logical Errors in a program;

(19)

Program Correctness- Verification and Validation, Concept of Test Data

5 Introduction to computer Language C

Concepts of Machine, Assembly, and Higher Level Languages, Origins of C

(20)

Lec.Num.

Unit Title Details

6 Characters and Character Set of C,Tokens in C, The function main()

7 Eight-Statement C Non-executable Statements in C- Comments and Type Declarations

8 Input and Output Statements in C- scanf(), printf ()9 Selection Statement in C- if, if..else, conditional operator as a

simplification of if..else10 Iteration Statement in C- while11 Assignment and Arithmetic Statements12 User Defined Data

TypesKey word struct- Access to components, Examples

13 Key word enum and its uses14 Concept of a function Function declaration, Function Definition, and Function Use;

Variable Scope and Storage Classes15 Operators, Precedence,

and AssociativityOperators and operands, Unary and Binary Operators, Concept of Expression, Arithmetic Expressions, Relational Expressions, Assignment Expressions.

16 Evaluation of Expressions, Concepts of Precedence and Associativity, Table of Precedence and Associativity.

17 Selection Structures Key words case, switch, break, default, go to18 Iteration structures for, do..while, continue, break19 Arrays Definition, , Random Access to elements -Capacity, Size,

Operator [ ], initializing, reading into, writing to and traversing an array

20 Two-dimensional Arrays21 Arrays as arguments to functions22 Pointers Direct and Indirect Access; need of pointers, de-referencing,

constant and variable pointers.23 Semantics of array and function declarations. Using key word

const in array declarations24 Function pointers

25 pointers as arguments to functions and as return types, generic pointer void *

26 Parsing pointer declarations

27 Recursive functions Effect of function calls, Definition of recursive functions. Examples

28 Miscellaneous concepts Bit-wise operators, key word union

(21)

Lec.Num.

Unit Title Details

29 File Handling in C Concept of a File-File attributes, File organizations, File Access

30 Sequential Files in C

31 Direct Access Files in C

32 Indexed Sequential Files in C

33 Strings Strings in C and String manipulation functions

34 Header Files Understanding stdio.h

35 Understanding assert.h, limits.h, stdlib.h

36 Understanding alloc.h and Dynamic Memory Management

37 Elementary Data Structures

Concept of Data Structure and Abstract Data Type

38 ADT Array and ADT Sorted Array

39 ADT Linked List

40 Elementary Data Structures

ADT Stack and UDT StackAsArray

41 UDT Stack As Linked List

42 ADT Queue and UDT Queue AS Array

43 Circular Queue

44 UDT Queue AS Linked List

45 ADT Doubly Linked List

46 Applications of Stacks

47 Applications of Queues

48 Applications of Dequeues

(22)

Subject Code J030103Title Computer Architecture and Assembly Language

Programming Work Load Per Week L:3 T: 1 Lab:4 Examinations Int: 30 Univ: 70 Practical : 50Objectives - Investigate the basic organization of instruction sets, lan-

guage translation, and program execution.- Understand the basic organization for data storage and ac-

cess across various media.- Compare and contrast implications of various computer ar-

chitectural attributes.- Describe basics of assembly Language

Learning Outcomes At 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 Edition

B) PC Assembly Language by Paul A. CarterSyllabusLec.Num.


1 Digital computer and logic gates

Meaning of Digital computer, study of AND, OR, NAND, NOR, Inverter, Buffer, XOR, XNOR.

A 1 -37

2 Boolean algebra Boolean algebra (Boolean function, truth table, logic diagram, basic identities, Demorgans theorem

3 Flip flop Flip flop SR, D, JK, T, Edge triggered flip flops4 Combinational

circuitsBasic, Half adder and full adder combinational circuits. Flip flop input equation, state table, state diagram

(23)

Lec.Num.


5 Sequential circuits Flip flop input equation, state table, state diagram. Example.

6 Integrated circuits and decoders

Basic, IC families, decoder basic, NAND gate decoder, encoder

A 41 -58

7 Multiplexers and Registers

Basics, 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 load

9 Register Transfer and Micro operations

Register transfer language, register transfer, control function, examples.

A-93-97

10 Bus and Memory transfer

Common bus, bus system, bus selection, three state bus, memory transfer (read and write)

A 93 - 119

11 Arithmetic micro operations

Basic, binary adder, binary adder subtractor, binary incrementer, 4 bit arithematic circuit

12 Logic micro operations

Basic, special symbols, list of logic micro operations, hardware implementation

13 Shift micro operations and arithmetic logic shift unit

Logical shift, circular shift, arithmetic shift, hardware implementation, arithmetic logic shift unit structure and functions

14 Instruction cycle Fetch, decode, read, execute instruction, Instruction cycle flowchart

A 139 - 145

15 Memory reference instructions

AND, ADD,LDA,STA,BUN,BSA, ISZ Instructions A 145-150

16 Input output and interrupt

Input output configuration, Input output instructions, program interrupt, interrupt cycle

A 150 - 157

17 Design of basic computer and accumulator logic

Basic hardware components, control logic gate, control of register and memory, control of common bus, basic accumulator logic.

A 157 - 167

18 Control memory Basics, control address register, sequencer, pipeline register

A 213 - 235

19 Address sequencing Basics, conditional branching, mapping of instruction, subroutine

(24)

Lec.Num.


20 Micro program Example Instruction format, Micro instruction format, microoperation, symbolic microprogram, binary microprogram

21 General register and stack organization

Block diagram of General register organization, control word, Block diagram of stack organization, register stack, memory stack

A 241 - 273

22 Instruction formats Bacis, three address, two address, one address, zero address instruction

23 Addressing modes Implied 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

24 Data transfer and manipulation

Data transfer instruction, data manipulation instructions, arithmetic instructions, logical and bit manipulation instruction

25 RISC and CISC A 282 - 28526 Input/Output

OrganizationPeripheral devices, input output interface, I/O bus, I/O versus memory bus, isolated versus memory mapped I/O.

A 381-390

27 Asynchronous data transfer, Priority interrupt

Strobe control, handshaking, Asynchronous serial transfer, Daisy chaining Priority, parallel Priority interrupt, Priority encoder, interrupt cycle.

A 391-402

28 Direct memory Access Direct memory Access controller, Direct memory Access transfer, introduction to I/O processor.

A 415-420

29 Introduction to ALP Introduction to Assembly language, importance, Decimal, binary, octal, hexadecimal number systems.

B 1-25

30 Machine language, Assembly language,Instruction operands, Basic instructions

31 Directives, input output, Debugging32 Creating a Program, writing First program,

Compiler dependencies, Assembling the code

(25)

Lec.Num.


33 Compiling the C code, Linking the object files, Understanding an assembly listing file, skeleton file

34 Working with integers Integer representation, Sign extension, Two’s complement arithmetic, Example pro-gram, Extended precision arithmetic

B 27 - 62

35 Control structures Comparisons, Branch instructions, The loop instructions

36 Translating standard control structures

If statements, While loops, Do while loops

37 Shift Operations Logical shifts, Use of shifts Arithmetic shifts, Rotate shifts

38 Boolean bitwise opera-tions

The AND, The OR , The XOR operation,The NOT operation, The TEST instruction, Uses of bit operations

39 Avoiding Conditional Branches Manipulat-ing bits in C, The bitwise operators of C, Using bitwise operators in C

40 Big and Little Endian Representations, When to Care About Little and Big Endian Counting Bits, Method one, Method two, Method three

41 Sub Programs Indirect addressing, stack, CALL and RETURN instructions.

B 65 -91

42 Calling Conventions, Passing parameters on the stack, Local variables on the stack Multi-Module Programs

43 Interfacing assembly with C language, Re-cursive subprograms, Review of C variable storage types

44 Arrays Defining arrays, Accessing elements of ar-rays, More advanced indirect addressing, Multidimensional Arrays

B 95 -111

45 Array/String Instructions, Reading and writ-ing memory, The REP instruction prefix , Comparison string instructions, The REPx instruction prefixes

(26)

Lec.Num.


46 Floating point Floating Point Representation, Non-integral binary numbers, IEEE floating point repre-sentation

B 117 - 135

47 Floating Point Arithmetic, Addition, Subtraction, Multiplication and division

48 The Numeric Coprocessor, Hardware, In-structions, Quadratic formula, Reading ar-ray from file

49 80 X 86 non floating point instructions B 173 - 179

50 80 X 86 non floating point instructions

Reference Books:

Computer Organization and Design: The Hardware/Software Interface,” Revised Printing Third Edition, by David A. Patterson and John L. Hennessy

Introduction to Digital Computer Design V. Rajaraman & Radhakrishnan

IBM PC Assembly Language and Programming. Peter Abel. 2001. Fifth Edition. Prentice Hall

(27)

Subject Code J030104Title Business Process Modeling Work Load Per Week L:3 T:1 Examinations Int : 30 Univ: 70Objectives The main objective is to

a) aimed at acquainting students with the evolution and practice of marketing

Learning Outcomes At the end of this course, student should be able to(a) Evolution of management thought and major

contributions(b) Process of management(c) Emerging trends in management

Pre-requisites -----Book 1. MIS Strategic Engineering Cases --- Arpita Gopal

Excel BooksSyllabus

Lec.Num.

Unit Title Details

1. 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 function The value concept and value cycle

5. Strategic marketing and marketing strategies decisions

6. Consumer behavior and market research

7. Marketing control; Customer relationship management

8. Use of IT in marketing Management

9. Finance function Introduction to financial management.

10. Inventory control

11. Ratio analysis

12. Financial leverage; Capital budgeting;

13. Decisions under uncertainty

14. Role of IT in Financial Management

(28)

Unit no. Topic No. of lectures(Clock hours)

1. Human Resource function

Introduction to Human Capital Management, Personnel administration

2 Training & development

3. Compensation management

4. Manpower planning

5, Performance management

6. Workflow management

7. Role of IT in Human Resource management

8. Production and Operations function

Introduction Production Planning & Control

9. Materials management; Inventory management, Stores management

10. Logistics and supply chain management

11. TQM and TPM,

12. Vendor selection and rating

13. Role of IT in Production and Operation management

14. Professionalisation of Management

Professionalism, Impact of globalisation, post globalisation era

15. Multinational Corporation Meaning, salient features, MNC’s, Business strategies

16. Emerging Trends in Management

Concepts of EBO, KRA, Downsizing, VRS, Outsourcing, Six Sigma, BPR

17. Engineering MIS ER Diagrams and its notations

18. Essentials of databases

19. Converting ER Diagrams into database

20. Engineering the business logic

21. Engineering Data Flow Diagrams

22. Engineering the user interface

23. File organizations

24. MIS related to various Business Process

Payroll Management System

25. Resource Allocation Management System

26. Banking Management System

27. Human Resource Management System

28. MIS for Marketing Department

29. MIS for Inventory Department

30. MIS for Purchase Department

(29)


Title Computational Mathematics I

Work Load Per Week L:3 T:1


Objectives The 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 Outcomes At 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.


Text Book(s) Rosen Kenneth H., Discrete Mathematics and its Applications, Tata McGra-Hill, Sixth Edition, 2007

Syllabus

Lec.Num.


1 Propositional Logic Propositions, connectives, conditionals, bi-conditionals, truth tables, Translations from and to propositional logic

Pages 1-10

2 Truth Tables of Compound Propositions, Precedence of Logical Operators, Translating English Sentences

Pages 10-12

3 Applications of Propositional Logic to System Specifications, Boolean Searches, and Logic Puzzles. Logic and Bit Operations

Pages 12-15

4 Logical Equivalences, Using DeMorgan's Laws, Constructing New Equivalences

Pages 21-27

5 Predicate Logic Predicates, Quantifiers, Quantifiers with restricted domains

Pages 30-38

6 Precedence of Quantifiers, Binding Variables, Logical Equivalences involving Quantifiers, Negating Quantified Expressions

Pages 38-41

(30)

Lec.Num.


7 Translating from English to Logical Expressions, Logic Programming Using Prolog.

Pages 41-46

8 Nested Quantifiers, Translating Nested Quantifiers into English and Vice versa

Pages 51-58

9 Rules of Inference Valid Arguments, Modus Ponens, Using Rules of Inference to Build Arguments

Pages 61-68

10 Principle of Resolution and its Applications Pages 68-69

11 Fallacies, Rules of Inference for Quantified Statements

Pages 69-72

12 Using Prolog for Inferences Hand Out

13 Sets Basic Concepts of Sets, Power set, Partition of a set, Cartesian Products

Pages 111-118

14 Set Operations, Set Identities Pages 121-125

15 Computer Representation of Sets,Algorithms to Perform Set Operations,Computation of Power Set

Pages 129-130and Hand Out

16 Functions Definition of Function, One to One function, Onto function

Pages 133-138

17 Inverse and Composition of FunctionsSome Important Functions

Pages 139-146

18 The Growth of Functions Big-O notation Pages 180-183

19 Growth of Combinations of Functions Pages 184-188

20 Big -Omega and Big-Theta Notation Pages 189-190

21 Complexity of Algorithms Pages 193-199

22 Modular Arithmetic Pages 200-205

23 Applications of Congruences Pages 205-208

24 Integers and Related Algorithms

Primes and Greatest Common Divisors, Least Common Multiple

Pages 210-217

25 Algorithms for Integer Operations Pages 219-229

26 Applications of Number Theory Pages 231-237

27 Computer Arithmetic with Large Numbers, Pseudo Primes, Public Key Cryptography

Pages 237-244

28 Matrix Algorithms Pages246-252

(31)

Lec.Num.


29 Boolean Matrices, Operations on Boolean Matrices

Pages 252-254

30 Induction, Recursion, & Program Correctness

Mathematical Induction Hand Out

31 Recursive definition of Functions Hand Out

32 Recursive Algorithms Hand Out

33 Program Correctness Hand Out

34 Relations Definition, Functions as Relations, Relations on a Set, Properties of Relations, Combining Relations

Pages 463-469

35 N-ary Relations, Databases and Relations, Operations on n-ary Relations, SQL

Pages 474-480

36 Representing Relations Using Boolean Matrices

Pages 482-484

37 Representing Relations Using Digraphs Pages 485-486

38 Reflexive Closure, Symmetric Closure, Paths in a Directed Graph

Pages 488-491

39 Transitive Closure and Warshall's Algorithm Pages 491-497

40 Equivalence Relations, Equivalence Classes, Partitions

Pages 499-506

41 Compatibility Relations and their Computation

Hand Out

42 Partial Orderings, Hasse Diagrams Pages 510-516

43 Maximal and Minimal Elements, Lattices, Topological Sorting and Applications

Pages 516-522

44 Boolean Algebra Boolean Expressions, Boolean Functions, Identities of Boolean Algebra, Duality

Pages 693-697

45 Representing Boolean Functions, Sum-of-Product Expansions, Product-of-Sum Expansions, Functional Completeness

Pages 701-703

46 Logic Gates, Combinations of Gates, Examples of Circuits

Pages 704-709

47 Minimization of Circuits, Karnaugh Maps Pages 710-718

48 Don't Care Conditions, Quine-McCluskey Method

Pages 719-723

+

(32)


Title WEB Supporting Technologies

Work Load Per Week T:3 Lab: 4

Examinations Practical 100

Objectives Make student familiar with the development of Web applica-tions using HTML, XHTML, JavaScript and XML. Topics cov-ered 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 Outcomes Upon 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 develop-

ment, including XML, CSS and XSL.

Pre-requisites None

Text 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 Wrox

Syllabus

Lec.Num.


1 Overview of Internet and Intranet

Understanding internet and its need, concept of intranet, difference between internet and intranet, a brief history, internet applications, Internet Service Providers(ISP)

B1:Pages 5-9

2 Concept of client and server, web browser and web server, communicating on the internet, concept of domain- Physical domain, virtual domain, registering a domain

B1:Pages 10-13

(33)

Lec.Num.


3 Need of IP addressing, Process to assign IP addresses, world Wide Web

B1:Pages 13-17

4 Introduction To HTML Overview of HTML, concept of Tag, types of HTML tags, structure of HTML program

B1:Pages 29-33

5 Common HTML Text Formatting Through HTML:Emphasizing Material In a Web Page:

B1:Pages 40-91

6 Using Image tag, attributes of Image tag,Lists: Using unordered, ordered, definition lists

7 Handling Tables To define header rows & data rows, use of caption tag, changing height & width of table, cellpadding, cellspacing, bgcolor, colspan, rowspan

B1:Page 99-116

8 Linking Documents Concept of hyperlink, types of hyperlinks, linking to the beginning of document, linking to a particular location in a document, image as hyperlinks and image mapping

B1:Page 125 - 153

9 Frames Introduction To frames, using frames & framesets, named frames

B1:Pages163-179

10 Cascading Style Sheets Introducing CSS, font attributes, color and background attributes, text attributes, border attributes, margin related attributes, list attributes

B1:Pages 497-507

11 Using class and span tag B1:Pages 508-512

12 Types of style sheets: inline, embedded and external Style Sheets

B1:Pages 513-514

13 Introduction To Javascript

Introduction to scripting, overview of Java Script, advantages, client side java Script, capturing user input, writing Javascript into HTML

B1:Pages 293-299

14 Basic JavaScript Techniques

Data types, literals, variables and operators, Java Script arrays, dense array, operators, expressions

B1:Pages 300-312

(34)

Lec.Num.


15 Java Script Programming Constructs

Assignment, data declaration, if, switch, while, for, do while, label, break, continue, function call, return, with, delete, method invocation.

B1:Pages 313-317

16 Javascript Technological Issues

Types of functions in Java Script- Built in functions,

B1:Pages 317-318

17 User defined functions, function declaration, passing parameters, variable scope, return values, recursive functions.

B1:Pages319 -323

18 Placing text into browser, dialog boxes -Alert dialog box, prompt dialog box, confirm dialog box, window objects

B1:Pages 324-331

19 Java Script Document Object Model

Understanding JDOM, Java Script Assisted Style Sheets, understanding objects in HTML

B1:Pages 341-345

20 Browser objects, how a javascript enabled browser handles the document object, Form element array

B1:Pages 346-349

21 Access to elements of a web page, manipulation of web page element

B1:Pages 349-351

22 Handling web page events using Javascript, Javascript event handlers

B1:Pages 351-353

23 Forms Used By Web Site

Form object, form object’s Method, properties of form elements, methods of form element,

B1:Pages 361-375

24 Different elements - text, password, button, submit, reset, checkbox, Radio, TextArea, select & option,

B1:Pages 376-395

25 Other built-in Object-String object, math object, date object,

B1:Pages 401-406

26 User defined objects- creation, instances, objects within objects,

B1:Pages 406-410

27 Cookies Concept of cookies, setting a cookie, supply values to cookies.

B1: Pages 425-430

(35)

Lec.Num.


28 Working With JSSS Introducing JSSS, DIV tag, B1:Pages 515-521

29 Layers, to move forward B1:Pages 523-535

30 XML Basics Introducing XML, The XML syntax and rules, why XML

B2: Pages 1-28

31 Comparison with XTML, Using CSS and Data Source Object to render XML Document

Handout

32 Defining a XML Structure

Introduction to DTD, Internal and external DTD, legal building blocks of an XML, Defining elements using XML

B2:Pages: 135-167

33 Defining attributes, entities, using DTD in xml file

34 XML namespace, Introduction to schema, Why schema,

B2: 169-210

35 Data types in schema, defining and using Schema.

36 XML Parsers XML Parser, validating, non-validating, stream-based and tree based parsers

B2:Pages 58-59

37 Choosing parsing method-DOM, SAX B2:Pages69-71

38 Introduction To XSL Overview of XSL, XSLT style sheets, XSLT processing model, uses of XSL

B3:Pages 15-20

39 XSLT Basics XSLT processing: processing model, processing a document, push and pull models.

B3:Pages 62-67

40 XSLT elements B3:Pages 77-102

41 XSLT Functions B3:Pages 106-109

42 XSL Transformation XSL formatting objects, XSLT Browser Compliance

B2: 154- 156

43 XSL transformations, using XSL transformation

B2:Pages 157-168

44 Modular XSLT Select attribute of <xsl:variable>, variable selection and node sets,

B3:Pages 114-119

45 parameter power: parameters and the outside world, named templates

B3:Pages 123-132

(36)

SEMESTER-II


Title Data Base Management Systems


Examinations Internal : 30 University: 70 Practical :50

Objectives The main objective is to teach the concepts related to data-base its techniques and operations. SQL (Structured Query Language) is introduced in this subject. This helps creates strong foundation for application of data design.

Learning Outcomes At 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-requisites Basics of Software Development Skills and Modeling Business Processes

Text Book(s) Korth. Database Systems Concepts , Tata McGra-Hill, Fifth Edition, 2006

Syllabus

Lec.Num.


1 Basic Concepts Database and Need for DBMSDatabase System versus File Systems, Database Users

Pages 1-05

2 Architecture and IntroductionData Models

3-tier Architecture, View of Data, Instances and Schema, Data Models(Hierarchical, Network)

Pages 5-10

3 Entity –Relationship Model Entities ,Relationships, Keys, different types of attributes, E-R Diagram conventions, degree, cardinality, participation, composite Entities, Strong and Weak Entity,

Pages 27-36Pages 42-46

4 E-R Diagram with case study, Reduction of E-R Schema to tables with example

HandoutPage-62Handout

(37)

Lec.Num.


5 Extended E-R and Relational Model

Superclass and Subclass Entity types, Attribute inheritance Aggregation, Specialization, Generalization with examples, Logical view of Data, ( Table and its characteristics) Concept Domain, tuple

Pages-47-55Handout

6 Relational Model(cont)Relational Algebra

Keys ( composite, candidate, primary,secondary, Foreign), Integrity Rules, Relational Set Operators (Union, Intersect, Difference, Product, Select, Project, ,Divide, Assignment)

Handout

7 Relational Algebra Relational 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 rules

Handout

8 Interactive SQL –I Database 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 demos

Pages 137-148

Handout

9 Interactive SQL –I set operations( union, intersect, minus) Aggregate Functions(AVG, Min, Max, Count, Sum) Null Values, Check constraint, Views with query demo

Handout

10 Normalization Functional Dependencies, Normal Forms(1NF,2NF,3NF,BCNF) with examples

Pages 260-270

11 Normalization(cont) -I Case Study on normalization Handout

12 Normalization(cont) -II

Decomposition, Lossless join and dependency preserving Decomposition

Pages 271-278

13 Normalization(cont) –III

Case Study on Normalization-II Handout

14 File Structure File Organization, Organization of records in file(Sequential, Clustering)

Pages 415-426

15 Indexing and Hashing

Basic concepts, indices, B+ Tree index file, B- tree index file

Pages 445-464

(38)

Lec.Num.


16 Static Hashing, dynamic Hashing Pages 465-471

17 Transaction and Concurrency Control

Concept of transaction, transaction state, ACID properties, Serializability

Pages 565-570,576

18 Lock based protocols, timestamp based protocols,

Pages 591-607

19 Multiple Granularity, Multiple Version Techniques, Deadlock and its Handling

Pages 609-615

20 Backup and Recovery Techniques

Failure Classification, Recovery & Atomicity, Log Based Recovery, Checkpoints

Pages 639,644,645

21 Shadow Paging, Recovery with concurrent transactions, Failure with loss of non-volatile storage

Pages653-660,663

22 Distributed Databases Homogeneous and Heterogeneous Database, Distributed Data Storage,Data Replication, Data Fragmentation, Transparency

Pages 709-713

23 Distributed Transactions-System Structure, System Failure Modes, Commit Protocols-2 phase commit, 3-phase commit

Pages 713-717Pages 717-719

24 Concurrency Control in DD

Locking Protocols, Single Lock Manager, Distributed Lock Manager

Pages 722-726

25 Deadlock Handling, Availability Distributed Query Processing-Query Transformation, Heterogeneous Distributed Databases

Pages-728-731Pages 735-737Pages 738-739

26 Oracle (DATATYPES )Interactive SQL -II

Data 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 demo

Pages113-116Pages 137-143

(39)

Lec.Num.


27 Unique 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 alterWith SQL demo

Pages 145-155

28 Interactive SQL-III Arithmetic Operators, Logical Operators, Range Searching, Pattern Matching(use like predicate)

Pages 160-165

29 Interactive SQL-III Dual , Numeric Functions, Aggregate Functions, String Functions, Date conversion functions TO_CHAR,TO_DATE

Pages 165-183

30 Interactive SQL-IV Group 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-208

31 Interactive SQL-IV Joins – Equi join, Inner join, Outer join, Cross join, self join with demos

Pages 208-220

32 Advance 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 demos

Pages239-256

33 Views- defined on multiple table, destroying views Sequences creating, altering, dropping With demos

Pages 258-261

34 Security Management Using SQL and OOPS in Oracle

Grant Privilege, Revoke PrivilegesWith demos, Object types, Nested Tables, Varying arrays, Large objects,References with demos

Page 269-270Pages274-276

35 OOPS in Oracle Features of Objects, structure of simple object with demo, object views.

Pages 277-287

36 Introduction PL/SQL Advantages PL/SQL, Generic PL/SQL block, PL/SQL Data Types, Control Structure- conditional control, Iterative control ,Sequential control

Pages320-331

(41)

Lec.Num.


37 Control Structure With demos Pages320-331

38 PL/SQL Transactions Commit, Rollback, Save point with demo, Processing PL/SQL block, Cursor, Types of cursor , Implicit cursor with attributes and demo

Pages334-339

39 Cursors Explicit cursor with attributes, cursor for loops, parameterized cursors with demos

Pages 340-350

40 PL/SQL Security Types of Locks ,Level of Locks, Explicit Locking, using lock table statements, releasing locks

Pages 353- 357

41 Explicit lock using SQL and PL/SQL ,DeadLock , Error handling in PL/SQL

Pages 358-369

42 Exception Handling Oracle Named Exception Handlers,User-Named Exception Handlers,User Defined Exception Handlers(I/O validations), User Defined Exception Handling with demo

Page 370-376

43 PL/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 demo

Pages 379-382

44 Functions Creating function, keywords and parameters, using a function with demo

Pages 382-387

45 Database Triggers Introduction, Uses of Database Triggers, Database Triggers Vs Procedure, Types of Triggers

Pages 403-406

46 Triggers Deleting Trigger, and demo of trigger and common errors done while working with triggers

Pages 407Handout

Note @ 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.Date

(42)

Database Management Systems - Ramkrishnan and Gehrke


Title Object Oriented Programming


Examination Internal: 30 University Exam: 70 Practical: 50

Objectives Make the students familiar with Object Oriented programming principles using Java. Also tech them concurrent, input/output and event-driven programming using java.

Learning Outcomes At the end of this course, student should be able toDesign interfaces, abstract and concrete classesUse concurrent programming, java Collections and utility classesAble to achieve object persistence using object serialization.Design applications using event driven programming.

Pre-requisites Any Programming Language

Text Book Herbert Schildt, Java: The Complete Reference, McGraw-Hill Osborne Media; Seventh Edition, 2007

Reference Book Cay S. Horstmann and Gary Cornell ,Core Java-Volume-I, Sun Core Series, Eighth Edition, 2008

* Learning resources contains page numbers from text books.Syllabus

Lec.Num


1. Introduction to Java Programming

Features of Java, Java compiler, JVM, 10-14

2. Structure of Java Program, writing and executing first Java Program

21-23

3. Basic Data types, Conversion between them, Using Scanner class, Wrapper Classes, Auto boxing and unboxing

4. String and String Buffer, Concept of Object pool: String Literal Pool,

359-384

5. Object identity and equality with example of String object, Using Math Class

418-420

6. Arrays in java,Object Cloning, Shallow verses deep copy 413-414

7. Introduction to Exception handling in Java Pack-ages in Java, User defined packages

205 – 222

(43)

Lec.Num


8. Classes and Object Concept

What is class and Object? Constructing an Object from a class, Types of constructors, this keyword

105, 122, 144

9. Writing a Simple Class, Adding Methods to the Class, creating an object and using it.

10. Method overloading, static fields and Methods B2: 132

11. Methods and parameter passing, pass by value and pass by reference, UML notation for class

138-143

12. Using final methods, Garbage Collection 143-145

13. Inner Class, outer class members and accessibility in inner classes

145-148

14. Enumeration in java 255-263

15. Inheritance and Polymorphism

Is_a or kind_of relationship, a simple example, UML notation for inheritance

157-163

16. Inheritance and method overriding, using super, Polymorphism, Dynamic and static binding

163-177

17. Abstract classes and Interfaces, realization of interface, UML notation for interface & realization

177-202

18. Method signature and Overriding, overriding methods throwing exception, Multiple Inheritance through interfaces

19. Concurrent Pro-gramming

Java Thread Model, Life cycle of a thread, thread class and its methods, thread Priorities

223-226

20. Creating a thread from thread class, and Runable interface, Choosing a right approach

226-231

21. thread synchronization 232- 241

22. Inter thread Communication-I, wait(), notify() and notifyAll() methods.

242-254

23. Inter thread Communication-II 242-254

24. Java Input/Out-put

A File Class, Concept of stream, InputStream and OutputStream: FileInput and FileOutput Streams

556-561

25. FilterInput Stream, DataInput and Data Output Streams , Introduction to Readers and Writers

562-578

26. File Reader, File Writer, Input Stream Reader, Buffered Reader, and Print Writer classes

578-586

27. Object Streams: ObjectInputStream and Ob-jectOutPutStream, wrting simple object

592-598

(44)

Lec.Num


28. Serialization & Object persistent, using static and transient data, Serialization and object hierarchy

592-598

29. Java Collections and Utility Classes

Collection Basics- A Collection Hierarchy, Using ArrayList and Vector, LinkedList, Using a Iterator

437

30. Set: HashSet, LinkedHashSet, TreeSet , Compa-rable and Comparator interfaces

441

31. Map, Hashmap, HashTable, TreeMap, Linked-HashMap

464

32. Utility Classes:Date, Calendar, GregorianCalen-dar, TimeZone, SimpleTimeZone and Locale Classes

503-525

33. Formatting Number, date and currency 525-539

34. Generics-I: basics, class parameters 315-324

35. Generics-II: bounded types, using wild cards, era-sures

327-349

36. Introduction to GUI Program-ming

AWT Basics, AWT Component Hierarchy 663-667

37. Graphics Programming, Graphics object and Drawing font with various fonts. Event Delegation model, drawing on canvas,

676-

38. Using MouseListener and MouseMotionListener for Free hand drawing Overriding update() method,

723-737

39. Layout Managers, Programming with Label, Textfield, TextArea and Buttons, ActionListener

702- 707, 719-721

40. Check Boxes, RadioButtons List and Choice, Scrollbar, AdjustmentListener and ItemListener

707-719

41. Designing Menu Applications, WindowListener 737-742

42. What is an Applet? Why it required? Applet Class, Applet life cycle.

617-622

43. Applet parameters 630-632

44. Using getCodeBase(), getDocumentBase(), getAp-pletContext() methods.

633-635

Note: supplementary Event Handling 637-662

(45)


Title Operating Systems Concepts and Case Studies

Work Load Per Week L:3 T: 1 Lab:1


Objectives The overall aim of this course is to provide a general under-standing 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 Outcomes At 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 devices

Understand functioning and working of Windows as well as Unix operating system.

Pre-requisites

Text Book(s) A) Operating systems design and implementation byAndrew Tanenbaum and Albert WoodhullB) Operating systems concept and design by Milan Milenkovic

Syllabus

Lec.Num.


1 Introduction Definition, Importance and functions of operating systems

Hand out

2. Types of operating systems

Batch, Timesharing, Multitasking, multiprogramming, multiprocessing

B 10 - 18

3 Online operating system, Real time, distributed operating systems

4 Different views of operating system

Command language users view, system call users view

5 Operating system concept

Processes, Files, The shell A 15 -20

6 Operating system structure

Monolithic system, layered system, Virtual Machine, Client server model

A 37 - 43

7 Case Study Installation of various operating systems (windows, Linux )

Hand out

8 Unix History, General Structure of Unix Hand out

(46)

Lec.Num.


9 The shell of Unix operating system Hand out

10 Windows History, Design principles and architecture

Hand out

11 Windows overall karnel Hand out

12 Processes Process concept, Implicit and explicit tasking, process relationship (cooperation and competitions)

B 28 -32

13 Operating systems view of processes

Process control block, Process state, process state transition, process switching, threading

B-43 -83

14 OS services for process management

CREATE, DELEATE, ABORT, FORK/JOIN, SUSPEND, RESUME, DELAY, GETATTRIBUTE, CHANGE PRIRITY

15 Scheduling and types of Schedulers

Scheduling, Need, Long term Scheduler, medium term Scheduler, short term Scheduler, Scheduler design

16 Scheduling algorithms First come first served, shortest remaining time next, Time slice scheduling,

17 Priority based preemptive scheduling, multiple level queues, multiple level queues with feedback, Guaranteed scheduling, Lottery scheduling

18 Performance Evolution First come first served, shortest remaining time next, Time slice scheduling

19 Case Study Unix processes and scheduling Hand out

20 Windows processes and scheduling Hand out

21 Memory Management Basic Memory Management, monoprogramming without paging or swapping, multiprogramming with fixed partitions.

B 310 - 356

22 swapping Memory Management with bit maps, Memory Management with linked list.

23 Virtual Memory Paging, Page tables, Multilevel page table, Translation lookaside buffer

24 Page replacement algorithms

Optimal 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

(47)

Lec.Num.


25 Design issues for paging

The working set model, Local versus global allocation policies, Page size, Virtual memory size.

26 Segmentations Segmentation, Implementation of pure segmentation, segmentation with paging with example.

27 Memory management in Unix Hand out

28 Memory management in windows Hand out

29 Interprocess communication and Synchronization

Need for Interprocess Synchronization, Mutual Exclusion, first algorithm, Second algorithm, third Algorithm

B 88 - 104

30 Semaphore Semaphore definition, Busy- wait implementation, characteristics of Semaphore

31 Queuing implementation of semaphore B 112 -114

32 Classical Problems in concurrent programming

Producer consumer problem with an unbounded buffer, Producer consumer problem with an bounded buffer

B 114 - 125

33 Reader writer problem

34 Critical region and conditional critical region, what are monitors? Need of it, format of monitor with example.

B 132 -156

35 Messages Basics, issues in message implementation, naming, copying, Synchronous vs asynchronous message exchange, message length, ICS with messages, interrupt signaling via messages.

36 Deadlock Conditions to occurs the deadlock, Reusable and consumable resources, deadlock prevention

B 166 - 179

37 Deadlock Avoidance, resource request, resource release, detection and recovery

38 case study Unix case study Hand out

39 Windows case study Hand out

40 File systems Files- naming, structure, types, access, attributes, operation. Directories- system, path and operations.

A 402 - 452

41 File system implementation

Implementing file and directories, disk space management, file system reliability and performance.

(48)

Lec.Num.


42 Security Environment, Security flaws, Security attacks, principles for Security, user authentication.

43 Protection Mechanism Protection domains, access control lists, capabilities.

44 Unix file management and security Hand out

45 Windows file management and security Hand out

46 Input/ output Principles of I/O hardware: I/O devices, device controller, DMA

A 154 -166

47 Principles of I/O software : goals, interrupt handler, device drivers, Device independent I/O software.

48 RAM Disk Hardware and software, DISKS Hardware and software.

A 196 -222

49 Input output management in Unix Hand out

50 Input output management in Windows Hand out

Reference 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.

(49)


Title Financial Management and Accounting Principles

Work Load Per Week L :3 T :1

Examinations Int : 30 Univ: 70

Objectives To 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 Outcomes At 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 PublicationsM N Arora Eighth EditionR3) Financial Management, Galgotia Publishing Company, R P Rustagi Third Edition

Syllabus

Lec.Num.


1 Financial Accounting Meaning, objectives and scope of Financial Accounting, Users

R1 1 to 8

2 Functions of Financial Accounting R1 3 to 6

3 Accounting Concepts R1 18 to 26

(50)

Lec.Num.


5 Introduction to GAAP and Accounting Standards issued by ICAI.

R1 17R1 28 to 36

6 Journal Principles of Double entry Book-Keeping, classification of Accounts, Rules of journalizing the transactions.

R1 38 to 59

7 Recording the transactions in Journal (Practical Questions)

R1 60 to 64

8 Combined entries with trade discount and cash discount.

R1 62

9 Practice of problems on Journal R1 62

10 Ledger Need and utility of ledger with format R1 64

11 Posting journal entries to ledger and preparation of Trial Balance

R1 64 to 68

12 Final accounts Process of finalization of accounts and adjustment entries.

R1 258 to290

13 Preparation of Trading, P&L A/C and Balance Sheet of a Proprietary firmWith adjustments. (Practical Questions)

R1 291 to 325

14 Practice of Final accounts problems

15 Contents of Annual Report of a joint stock company.

Hand out

16 Cost Accounting Concept of Cost centre and Cost unitObjectives of Cost Accounting

R2 1.1 to 1.11

17 Classification of Costs R2 1.15 to 1.26

18 Management Accounting

Definition, nature and scope of Management Accounting

R2 14.1 to 14.6

19 Distinction between Financial, Accounting and Management Accounting.

R2 14.6 to 14.7

20 Advantages and limitations of Management Accounting.

R2 14.3 to 14.8

21 Budgetary Control Meaning and objectives of Budgetary Control

R2 15.1 to15.4

(51)

Lec.Num.


22 Types of budget, Advantages & limitations of Budgetary Control

R2 15.4 to 15.5

23 Preparation of Flexible Budgets(Practical Questions)

R2 15.23 to15.29

24 Budgetary Control Preparation of Cash Budget(Practical Questions)

R2 15.18 to 15.21

25 Standard Costing Meaning, application of standard Costing, Advantages and Limitations

R2 16.1 to16.5

26 Variance Analysis MCV, MUV, MPV (Practical Questions)

R2 16.10 to 16.16

27 LCV, LEV, LRV (Practical Questions) R2 16.20 to 16.26

28 Marginal Costing Concept of Marginal Costing, features advantages and limitations.

R2 18.1 to 18.12

29 Cost Volume Profit Analysis R2 18.1 to 18.12

30 BEP, P/V ration, Margin of Safety(Practical Questions)

R2 18.1 to 18.12

31 Ratio Analysis Concept and significance of Ratio Analysis R3 47 to 52

32 Understanding Liquidity and Profitability Ratio.

R3 61 to 63

33 Understanding Funds Flow Statement and Cash Flow Statement

R3 121 to 123, 134to 139

34 Financial management

Meaning, nature and scope of Financial Management

R3 3 to 7

35 Objectives: profit Maximization and Wealth Maximization.

R3 9 to 11

36 Capital Budgeting Importance and process R3 215

37 Capital Budgeting PBP, NPV, PI(Practical Questions)

R3 239 to 254

38 Practice of Capital Budgeting problems

39 Management of Working Capital

Concept of Working Capital Types, Operating Cycle

R3 605 to 607

40 Factors affecting requirement of working capital

R3 609

(52)

Lec.Num.


41 Estimation of working Capital requirement. R3 627

42 Long Term Sources of Finance

Sources of Long term finance- Shares, Debentures, Retained earnings, financing through bank & F.I.s

R3 767 to 771

43 Dividend Decision Factors affecting Dividend Decision, Dividend policies

R3 561 to 562, 585

44 Understanding the concept of capital Structure

R3 511to 513

45 Understanding the concept of Cost of capital

R3 399 to400

Reference Books:

1. S.N. Maheshwari, “Financial Cost and Management Accounting”, Sultan chand & Sons2. I.M. Pandey, “Financial Management”, Vikas Publications.3. Financial Accounting Tulsian4. Accountancy by Paul5. Management Accounting Khan & Jain

(53)


Title Computational Mathematics- II



Objectives This 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 Outcomes At 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-requisites XII Level Mathematics and Computational Mathematics I (J03005)

Text Book(s) Rosen Kenneth H., Discrete Mathematics and its Applications, Tata McGra-Hill, Sixth Edition, 2007

Syllabus

Lec.Num.


1 Basic Counting Principles Product Rule and Extended Product Rule; Examples; Sum Rule and Extended Sum Rule; Examples;

Pages 335 to 341

2 Complex Counting Problems Handout

3 Pigeonhole Principle and Generalized Pigeonhole Principle

Pages 341 to 353

4 Permutations and Combinations

Permutations; Combinations Pages 355 to 360

5 Binomial Theorem; Pascal's Identity and Triangle; Identities of the Binomial Coefficients

Pages 363 to 368

6 Permutations with repetitions; Combinations with repetitions;

Pages 370 to 374

7 Permutations with Indistinguishable Objects

Pages 375 to 379

8 Generating Permutations Pages 382 to 384

9 Generating Combinations; Computation of Binomial coefficients

Hand Out

10 Advanced Counting Techniques

Recurrence Relations; Modeling with recurrence Relations

Pages 393 to 40011

(54)

Lec.Num.


11 Solving homogeneous Linear Recurrence Relations with Constant Coefficients

Pages 404 to 408

12 More Examples Pages 408 to 411

13 Solving Non-homogeneous Recurrence Relations

Pages 411 to 415

14 Divide and Conquer Algorithms and Recurrence Relations

Pages 418 to 420

15 More Examples Pages 421 to 423

16 Generating Functions Useful Power Series; Extended Binomial Theorem

Pages 428 to 432

17 Counting Problems and Generating Functions

Pages 432 to 437

18 Using Generating Functions to Solve Recurrence Relations

Pages 437 to 439

19 Generalized Inclusion-Exclusion Principle

Pages 444 to 448

20 Applications of Inclusion-Exclusion Principle; Derangements

Pages 449 to 456

21 Graphs and Graph Models Basic Definitions and Examples Pages 533 to 539

22 Handshaking Theorem Pages 541 to 545

23 Special Simple Graphs; Applications; New Graphs from Old

Pages 545 to 552

24 Graph Representations Adjacency Lists; Adjacency Matrices; Incidence Matrices;

Pages 555 to 559

25 Isomorphism of Graphs Pages 559 to 562

26 Connectivity in Graphs Paths, Simple Paths, Cycles, Simple Cycles

Pages 565 to 568

27 Connectedness in Undirected Graphs; Connected Components

Pages 568 to 570

28 Connectedness in Directed Graphs; Paths and Isomorphism; Counting Paths between Vertices

Pages 570 to 573

(55)

Lec.Num.


29 Euler and Hamiltonian Paths

Euler Paths and Euler Circuits Pages 577 to 582

30 Hamiltonian Paths and Circuits Pages 583 to 587

31 Shortest Path Problems Shortest Path Problem; Dijkstra's Algorithm; Traveling Salesman Problem

Pages 591 to 599

32 Planar Graphs and Graph Coloring

Planar Graphs Pages 601 to 603

33 Euler's Formula; Kuratowski's Theorem

Pages 603 to 609

34 Coloring, Chromatic Number; Four Color Theorem

Pages 610 to 615

35 Applications of Graph Coloring Pages 615 to 616

36 Trees Basic Definitions; Pages 627 to 634

37 Properties of Trees Pages 634 to 637

38 Applications of Trees Binary Search Trees Pages 639 to 642

39 Decision Trees ; Prefix Codes Pages 642 to 647

40 Game Trees Pages 648 to 651

41 Heaps Hand Out

42 Tree Traversal Universal Address System, Traversal Algorithms

Pages 654 to 666

43 Spanning Trees Definition; Depth First Search; Breadth First Search

Pages 668 to 678

44 Minimum Spanning Trees Prim's Algorithm Pages 682to 683

45 Kruskal's Algorithm Pages 684 to 685

(56)

SEMESTER-III

Subject Code J030217Title Software EngineeringWork Load Per Week L:3 T: 1 Lab:1Examinations Int: 30 Univ: 70Objectives To introduce the methodologies involved in the development

and maintenance of software over its entire life cycle.Learning Outcomes At 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 Edition

SyllabusLec.Num.


1 Introduction to Software Engineering

Software, software characteristics, software types, software components

Hand out

2 Definition of Software engineering, importance, principles of software engineering: (Separation of concerns, Modularity, Abstraction Anticipation of change, Generality, Incrementability, Consistency)

Hand out

3 Difference between software engineering and software programming, Members involved in software development

Hand out

4 Software engineering a layered technology, process method and tools, generic view

22 - 26

5 Software process General software development life cycle (all the phases of the life cycle is covered in detail)

Hand out

(57)

Lec.Num.


6 Waterfall model with advantages and disadvantages, Prototyping model with advantages and disadvantages

28 - 34

7 Spiral model, advantages and disadvantages, Rapid application development model with advantages and disadvantages, Incremental model

34 – 42

8 Feasibility study Need of Feasibility study, types of Feasibility study, steps in feasibility study

Hand out

9 Why Cost Benefit analysis? Importance of cost Benefit analysis, Cost Benefit analysis process

Hand out

10 Requirement Engineering

What is Requirement Engineering, Types of requirements

Hand out

11 Requirement elicitation techniques– Traditional methods: Review of documents, on site observation, Interview and questionnaires

Hand out

12 Requirement elicitation techniques– Modern methods: Prototyping, workshop, Brainstorming, JAD, Videoconferencing, Use case etc.

Hand out

13 Requirement analysis Process Hand out14 Need of Requirement verification and

validations, Verification and validation process, Verification and validation document outline

Hand out

15 Principles of Requirement Specification, Software Requirement Specification document Outline

Hand out

16 Characteristics of good SRS: correct, complete, unambiguous, consistent, modifiable, traceable, Understandable

Hand out

17 Software Inspection Need of the Review , types of software reviews

Hand out

18 Members involved in inspection team, check list

Hand out

19 Detailed Inspection process Hand out

(58)

Lec.Num.


20 Analysis concept and modeling

Analysis principles : Information domain, modeling, partitioning, essential and implementation views

278 - 285

21 Data Modeling: Data objects, attributes, relationships, Cardinality, Modality

301 - 309

22 Entity relationship diagramming Mechanism Hand out23 Functional Modeling: Importance, tools for

functional modeling309 – 312, Hand out

24 Data flow diagramming Mechanism Hand out25 Behavioral Modeling 316 - 32026 Data Dictionary: Importance of Data

Dictionary, Preparation of data dictionary.330 – 334 Hand out

27 Design concept and Methods

Software Design and software Engineering, Design process and principles

341 - 346

28 Design concepts: Abstraction, Refinement, Modularity, Architecture, control hierarchy, structural partitioning, Data structure, procedure and data hiding

346 - 356

29 Modular design: Functional independence, Cohesion and coupling

357 - 361

30 Data Design : principles of Data Specification, database design

371 - 373

31 Architectural design: contributors, area of application, Process: Transform flow and transaction flow

373 - 377

32 User Interface design User Interface design : Elements of good design, design issues, Features of modern GUI, Guidelines for interface design

393 – 395403 - 406Hand out

33 Procedural design: structured programming, Program design language

406 -412

34 Decision tree and decision table Hand outReport Design

35 Software quality assurance

Quality concept: (quality, quality control, quality assurance, cost of quality), SQA issues and activities

180 - 184

36 Formal Technical review : Review meeting, review reporting and review guidelines

190 -194

37 Definition and classifications of software Defects, SQA plan

Hand out

(59)

Lec.Num.


38 Software quality standards: ISO and CMM standards

202 – 204Hand out

39 Software configuration management

What is configuration management, Baseline, Software configuration items

210 - 214

40 SCM process, identification of objects, Version control

214 – 220

41 Change control, configuration audits and status reporting

220 - 224

42 Software reuse Management issues: Roadblocks to reuse, hardware analogy, suggestions reuse process: Reusable Artifacts, Process model

729 - 735

43 Domain engineering: Domain analysis process, Characterization functions, structure modeling and points

735 - 740

44 Building 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 - 751

45 Reengineering Business process Reengineering: Business process, Principles and BPR model.

757 -762

46 Software reengineering: Software Maintenance, Software reengineering process model

762 - 767

47 Reverse engineering: to understand processing and data, Reverse engineering user interfaces

767 - 773

48 Restructuring: Code and Data restructuringforward engineering: forward engineering for client server architecture, forward engineering user interfaces

773 - 778

49 Computer Aided software engineering

What is CASE? Importance of CASE tools, future of CASE tools

Hand out

50 Tools for information engineering, Project planning tools, risk analysis tools, Project management and testing tools.

808 - 813

51 Tools for Quality assurance, configuration management, Analysis and design, Database management, Interface design and programming tools.

808 - 813

(60)


Title Linux Programming


Examinations Int : 30 Univ: 70 Practical : 50

Objectives This 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 Outcomes The 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

Programming

Text Book(s) UNIX- Concepts and Application– by Sumitabha Das. Beginning Linux Programming – by Richard Stones &

Neil Matthew

LectureNumber

Topic Details References

01 Introduction :- Operating System, Various Definitions Operating systems, Evolution of O.S.

A P 4 and

Handouts

02 Types of Operating System, Characteristics of O.S. and Functions Handouts

03 Structure of DOS and Linux Operating System Handouts

04 KDE, Gnome and Text Based Environments Handouts

05 Features of Unix / Linux Operating System, Installing Linux A P 25

06 Understanding the major Linux distributions.

Open Source licensing – GPL and others

A P 17

(61)

07 Understanding Open Source., Background and history of Linux Handouts

(62)

LectureNumber


08 Basic Commands & Utilities

Commands for Handling Ordinary files

cat, cp, rm, mv, more, wc, od, cmp, comm, tar, zip, unzip

A P 83 - 102

09 Basic Commands & Utilities

Pwd, mkdir, rmdir, ls, chmod

A P 65-79

A P 106-116

11 Process, process basics, The Shell Process, Parents and Children, Process status (ps command), Process system calls – fork, exec, wait

A P173-180

12 Running Jobs in Background, Killing Process with signals A P182-185

13 Simple Filters – pr, head, cut, paste, sort, unique, tr A P228-239

14 Filters using regular expression A P246-263

15 Advanced Filters – awk, printf A P382-389

16 Shell, Shell Scripts, Various types of Shells A P194-205

17 Shell Programming, Variables, Simple Scripts

Control sequences and Structures, Functions

B P29-52

A P271-298

18 Creating & Executing Shell Scripts Handouts

19 Creating & Executing Shell Scripts Handouts

20C programming under Linux Environment Handouts21

22232425

System Calls for the files and I/O

A P 493 - 526

A P 493 - 5262627

System Calls for the Process Control

A P534-570

A P534-5702829 Process & Signals – Process, Process structure, system

processes, Process scheduling, threads, signals, signal handlingB P 321-337

B P 321-337303132 Inter Process Communication – pipe, process pipe – popen,

pclose, parent child processes, named pipesB P 364-307

3334 Semaphores, Message Queues, and Shared Memory –

semaphores, semaphores definition, Unix semaphore facilities, shared memory, shared memory functions, message queues

B P 409 - 434

3536

(63)

LectureNumber


37 Sockets – socket, socket functions, socket attributes, socket types, socket protocols, creating a socket, socket communication

B P 435- 4633839 Programming GNOME – An introduction to GNOME, GNOME

Architecture, programming in GNOME using GTK +, Button, List Box

B P 569 - 59440

41 The Perl Programming – variables, arrays, operators and functions

B P 595 - 625

42Programming With Internet – writing HTML program, client and server side maps, CGI (Common Gateway Interface) , Writing a server side CGI program,

B P 626 - 65543444545

(64)


Title Computer Networks



Objectives To 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 technologies

Learning Outcomes At the end of this course, student should be able to Understand the basic Architecture of computer Network

and functioning of different layers Understand application of different protocols Understand concept of advanced Networks

Pre-requisites Basic Knowledge of computer

Text Book(s) A) A.S. Tanenbaum, Computer Networks (4th ed.), Prentice-Hall of India, 2003

B) W.Behrouz Forouzan and S.C. Fegan, Data Communication and Networking, McGraw Hill, 2006

Syllabus

Lec.Num.


1-2 Introduction to Computer Networks

What is Computer Network, Network Goals and Motivations Application of Networks Classification of Networks

Hand out

3-4 Network software: Network Protocols Protocol Hierarchies Design issues for the Layers Connection Oriented and

Connectionless Services Service Primitives Relation of services to Protocols

A-26 to 36

(65)

Lec.Num.


5-6 Network Models: The OSI Reference Model The TCP/IP Reference Model Comparison of OSI and TCP/IP

Reference Model A critique of OSI Model A critique of TCP/IP Model

A-37 to 48

7-8 Examples of some networks:Internet, X.25, ISDN, Frame relay, ATM, Ethernet, Wireless Lans- (wi-fi)

A-49 to 68

9 Data Transmission(Physical Layer)

Signals: Analog and Digital Signals, Data Rate, Transmission Impairment, Signal Measurement : Throughput, Propagation Speed and Time, Wavelength, Frequency, Bandwidth, Spectrum

Handout

10 Transmission Media& its Characteristics: Guided and Unguided Media

B – 191 to 211

11-14 Synchronous and Asynchronous Transmission

Multiplexing: FDM,WDM,TDM Switching: Circuit ,Message and Packet

Switching Mobile Telephone Systems:1G-AMPS,2G-GSM,GPRS,EDGE,CDMA3G-UMTS, WCDMA, CDMA-2000

Handout

15-16 Data Link Layer Data link Layer Design Issues: Services provided to Network Layer, Framing, Error Control, Flow Control

A-183 to 199

17-18 Elementary Data Link Protocols: ARQ, Stop and Wait ARQ, Sliding Window ARQ, Go-Back-N ARQ, Selective Reject ARQ

B – 311 to 346

19 Examples of Data Link Protocol: HDLC,SDLC,PPP

A+B

(66)

Lec.Num.


20-22 Media Access Control

Channel Allocation Problem: Static Channel Allocation, dynamic Channel Allocation

Advantages of Multiple Access sharing of Channel Resource

Contention Based Media Access Protocols: Pure ALOHA, slotted ALOHA, Carrier Sense Multiple Access(CSMA), CSMA/CD,CSMA/CA

A-247 to 259

23-24 Ethernet: as a Example of Physical and MAC Layer

Polling based Media Access Control Protocols: Token Ring, Token bus

A-271 to 286Handout

25-26 Data Link Layer Switching: Bridges, Spanning Tree Bridges, Remote Bridges, Other connecting Devices: Hub, Routers, Switch, Repeaters, Gateways.

Handout

27-28 Network Layer Network Layer Design Issues: Store and Forward PacketSwitching Services to Transport Layer Implementation of Connection Oriented and

Connectionless Services Comparison of Virtual Circuit and Datagram

Subnet

A-343 to 349

29-30 Routing Algorithms:Static/ Dynamic, Direct/ Indirect, Shortest Path Routing, Flooding, Distance Vector Routing, Link State Routing, Hierarchical Routing, Broadcast Routing, Multicast Routing

Handout

31-32 Congestion Control Algorithms:General Principal of Congestion Control, congestion prevention polices, Load shedding, Jitter Control

Handout

33-35 Internetworking and Network Layer in Internet

Tunneling Internetwork Routing Fragmentation IP-Protocol IP-Address Classes(A,B,C,D,E)

Broadcast address , Multicast address, Network Mask, Subnetting

Internet control Protocol-ICMP,IGMP OSPF-Interior Gateway Routing Protocol BGP-Exterior Gateway Routing Protocol

A-431 to 472 + Handout

(67)

Internet Multicasting Mobile-IP IPv6

36-37 Transport and Application Support Protocols

Transport service, Service Primitives Berkley Sockets Elements of Transport control: addressing,

connection establishment and release, flow control & buffering, multiplexing, crash recovery

Internet Transport Protocols: TCP/UDP Remote Procedure Calls,RTP

A-481 to 572

(68)

Lec.Num.


38-39 Session Layer : Token ConceptPresentation Layer: Data Encryption and Data Security, Message AuthenticationApplication Layer: Domain Name Service, Telnet, FTP, SMTP, SNMP, WWW

Handout

40-42 Advance Networks

Concept 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 Networks

Handout

43-46 Mobile Ad-hoc Networks

Introductory 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.

Handout

47-50 Wireless Sensor Networks

Sensor 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.

Handout

(69)

COURSE NO:- J030220COURSE TITLE:- ORGANIZATIONAL BEHAVIOR AND CHANGE

MANAGEMENTCOURSE OBJECTIVES:-

1. 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.

2. 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.

3. 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.

4. CONFLICTIntroduction, Definition, Nature and Types of Conflicts. Constructive and Destructive conflicts, Conflicts at Individual , Group and Organizational Levels. Approaches to Conflict Resolution.

5. LEADERSHIPConcept and definition, Theories of leadership, Trait theories, contingency theories, and situational theories.

(70)

6. 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.

7. CASES AND EXCERCISES

Books of References:

John. W. Newstrom and Keith Davis. – Organizational Behavior (Tata Mc Graw- Hill Publication) Fifth Reprint 2000

Robert Kreitner and Angelo Kinicki – Organization Behavior (Tata Mc Graw- Hill Publication) International Edition 2004

Organizational Behavior – Fred Luthans.

Organizational Behavior – Stephens. P Robbins.

Organizational Behavior – Aswathappa.

SESSIONS DURATION COVERAGE

1. One Hour Definition, Scope, importance of OB, Organization, Management and OB.

2. One Hour Historical Evolution of OB, Industrial Revolution, Scientific Management, The Human relations Movement and developments of recent origin.

3. One Hour Different Models of organizational Behavior, Autocratic, Custodial, Supportive, Collegial and SOBC Models.

4. One Hour Recent 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 Hours Emotions, positive and negative, understanding and developing personal and social competence through emotional intelligence.

9 – 11. Three Hours Perception, Definition, Perceptual selectivity, information processing, social perception, attribution and managerial challenges.

12 – 14 Three Hours Attitudes, Formation & Dimensions of attitudes, Job satisfaction, Organizational commitment, meaning, outcomes and guidelines to enhance Organizational commitment.

(71)

SESSIONS DURATION COVERAGE

15 – 20 Six Hours Motivation- Human Needs and Drives, Theories - Content theories, Process theories and contemporary theories.

21 – 23 Three Hours Learning , definition, Theories- Conditioning , Social and Experiential theories. Application of learning.

24 - 28 Five Hours Groups – Definition, Stages of Group Development, Group Dynamics, Groups & Teams, Creating a Good team and Case analysis or Exercise.

29 - 31 Three Hours Introduction, Nature and Type of Conflicts, individual, Group and organizational Conflicts.

32 - 36 Five Hours Leadership, Concept, Definition. Theories – Trait Theory, Contingency and Situational Theories.

37 – 41 Five Hours Need 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 Hours Case Study, Applications, Revision and Evaluation.

(72)

Subject Code J030221Title Scientific computation Work Load Per Week

L:3 T:1 Lab:3

Examinations Int: 30 Univ: 70 Practical : 50Objectives The 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 Outcomes

In 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 work

Pre-requisites XII 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 Thaha

Syllabus

Lec.Num.


1. Introduction What is scientific Computation, Difference with other Computation

Handout

2. Computer Codes and Arithmetic

Internal Representation of Integers Page-40 (R1)

3. Conversion from base-r to base -s

4. Integer Arithmetic in base-r-system, Errors in Integer arithmetic

(73)

Lec.Num

.


5. Number Representation

Floating point Representation Page-49 (R1)

6. Fixed point Representation

7. Normalized floating point

8. Floating point Arithmetic

9. Approximations and Errors in Computing

Taxonomy of Errors in Computing, Inherent Errors Numerical Errors, Modeling Errors

Page-61 (R1)

10. Absolute & Relative Error, Machine Epsilon Error Estimation,

11. Calculus of Finite Differences

Finite difference operator Page- 66(R1)

12. Construction of a difference tables

13. Application of Difference Tables

14. Introduction to the problem and Methods of Solutions,Iterative Methods-Starting and Stopping

15. Roots of Non-linear Equations

Introduction to the problem and Methods of Solutions, Iterative Methods-Starting and Stopping

Page-121 (R1)

16. Bisection method, False position method Newton Raphson method, Secant method

17. Fixed Point Method

18. Interpolation Forward method, Backward method Page-275 (R1)

19. Divided difference method

20. Lagrange’s method, Inverse interpolation

21. Numerical Integration

Newton Cote’s formula Page-371 (R1)

22. Simpson’s 1/3, Simpson’s 3/8

(74)

Lec.Num.


23. Simultaneous linear equation Gauss elimination method Page-209(R1)

24. Pivoting, ill conditioned equations

25. Probability Definition, Types of Probability Pg 470-495(R3)

26. Total Probability theorem(Multiplication rule, Baye’s Theorem, Sum rule)

27. Random Variables(Discrete random variable & Continuous distribution)

Introduction, Definition Pg 506-549(R3)

28. Probability distribution, probability mass function

29. Expectation and Variance, Theorem on expectation

30. Binomial distribution & Example

31., Poisson distribution & Example

32. Exponential distribution & Example

33. Normal distribution & Example

34. Normal distribution & Example

35. Measure of Central Tendency Mean, Mode, Median Page 67-138 (R3)

36. Measure of Dispersion Standard Deviation, RangeSkewness, Kurtosis

Pg 139-201 (R3)

37. Correlation & Regression Person and Rank Correlation Coefficients, Multiple Regression

Pg 203 299(R3)

38. Operation Research Application Introduction, Models, Application in Computer science

Page-1-28 (R5)

39. Operation Research Application Introduction, Models, Application in Computer science

Page-1-28 (R5)

40. Linear programming Concept, Mathematical model Page-29-91 (R5)

41. Simplex Method Pg -124-176 (R5)

(75)

Lec.Num.


42. Revised Simplex Method Pg-124-176 (R5)

43. Transportation problem Pg -286-354 (R5)

44. Assignment problem Pg -355-394 (R1)

45. Exercise

Reference Books:

R1: Numerical Methods by E.Balagurusamy

R2: Introductory Methods of Numerical Analysis by S.S. Sastry

R3: Fundamentals of Stastics by S.P.Gupta

R4:Operation Research by Thaha

R5: Operation Research by J.K.Sharma

(76)


Title Dot Net Technologies

Work Load Per Week L : 3 T : 1 Lab : 4

Examinations Int : 100

Overview This 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 Outcomes The student after completing this course should have gained:1. The ability to effectively use visual studio Dot Net.2. An understanding of the goals and objectives of

the .NET Framework. .NET is a revolutionary concept on how software should be developed and deployed.

3. A working knowledge of the C# programming language.4. An understanding of how to use forms to develop GUI

programs under dot NET.

Pre-requisites Basic knowledge of Object Oriented Programming

Text Book(s) 1) c#3.0 Visual Studio-2008-wrox-beginning-guides.2) C# 3.0 Herbert Schildt- Mcgraw-hill3) Beginning Microsoft Visual C# 2008

1 Introduction to Dot Net Framework

.NET Overview

Features and usage

Assemblies

CLR, CTS and CLS

Classes provided by .NET

Compilation strategies

2 Introducing C#

3 Writing a C# Program

4 Variables and Expressions

5 Flow Control

6 Variables

7 Functions

8 Debugging and Error Handling

(77)

9 Introduction to Object-Oriented Programming

10 Classes

11 Class Members

12 Collections, Comparisons, and Conversions

13 Generics

14 Additional OOP Techniques

15 C # 3.0 Language Enhancements Initializers ,Object Initializers, Collection Initializers ,

Type Inference ,

Anonymous Types ,

Extension Methods

16 Basic Windows Programming Controls, The Button,

The Label and LinkLabel ,

The TextBox ,

The RadioButton and CheckBox,

The RichTextBox,

The ListBox and CheckedListBox ,

The ListView

17 Advanced Windows Forms Features

Menus and Toolbars, Toolbars, SDI and MDI Applications, Creating Controls

18 Using Common Dialogs Common Dialogs,

How to Use Dialogs,

File Dialogs

19 Deploying Windows Applications Deployment Overview, Visual Studio Setup and Deployment Project Types

20 Basic Web Programming Overview ,

ASP.NET Runtime ,

Creating a Simple Page ,

Server Controls ,

Event Handlers ,

Input Validation

21 State Management ,

Authentication and Authorization

22 Reading and Writing to a SQL Server Database

23 Advanced Web Programming Master Pages,

(78)

Site Navigation ,

User Controls ,Profiles

24 Web Parts, JavaScript

25 Web Services Before Web Services, Where to Use Web Services, Web Services Architecture, Web Services and the .NET Framework

26 Creating a Simple ASP.NET Web Service ,

Testing the Web Service

27 Ajax Programming Ajax Overview ,

Update Panel ,

Timer Control ,

Update Progress ,

Web Services

28 Deploying Web Applications Internet Information Services ,

IIS Configuration ,

Copying a Web Site ,

Publishing a Web Site

29 File System Data Streams ,

The Classes for Input and Output

30 XML XML Documents, Using XML in Your Application

31 Introduction to LINQ LINQ Varieties ,

LINQ Query, Using the LINQ Method Syntax

32 Ordering 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 Query

33 Any and All ,

Ordering By Multiple Levels, Multi-Level Ordering Method Syntax: ThenBy ,

Group Queries, First and FirstOrDefault ,Set Operators ,Joins

34 LINQ to SQL Object-Relational Mapping (ORM) ,

(79)

Installing SQL Server and the Northwind Sample Data

35 First LINQ to SQL Query ,

Navigating LINQ to SQL Relationships

36 ADO.NET and LINQ over DataSet ADO.NET,

Reading Data with the DataReader ,

Reading Data with the DataSet ,

Updating the Database ,

Deleting Rows ,

Accessing Multiple Tables in a DataSet , ADO.NET ,

XML and ADO.NET

37 LINQ to XML LINQ to XML Functional Constructors ,

Saving and Loading an XML Document ,

Loading XML from a String ,

Working with XML Fragments ,

Generating XML from LINQ to SQL

38 Attributes What Is an Attribute? ,

Reflection

Built-in Attributes

39 XML Documentation Adding XML Documentation,

40 Making Use of XML Documentation

41 Networking Networking Overview ,

Networking Programming Options ,

WebClient ,

42 WebRequest and WebResponse

43 Windows Presentation Foundation What Is WPF? ,

Anatomy of a Basic WPF Application ,

WPF Fundamentals

44 Windows Communication Foundation

What Is WCF? ,

WCF Concepts

45 Windows Workflow Foundation Activities ,

The Workflow Runtime ,

Data Binding

(80)

SEMESTER-IV


Title Object Oriented Analysis And Design Pattern


Examination Internal: 30 University Exam: 70

Objectives Teach students OOAD using with UML and standard agile software design patterns and usage of them.

Learning Outcomes Upon completion of this course, students should be able to:1. Write and use requirement document (Use-Cases)2. Identify classes from given problem statements3. Use and design software blue prints using UML4. Identify design patterns to be required to implement for a

given problem.

Pre-requisites Object Oriented Programming with Java (J030109)Software Engineering

Text Books 1. UML Distilled, 3rd Edition, Martin Fowler2. Design Patterns Elements of Reusable Object-oriented

Software- Erich Gama, Richjard Helm, Ralph Jonson and Jon Vlissides

Reference Book 1. Applying UML and Patterns, Craig Larman2. Head First Design Patterns, Eric Freeman, Elisabeth

Freeman, Kathy Sierra, Bert Bates3. Software Engineering: A Practitioner's Approach, Roger

Pressman

Syllabus

Lec.Num

Unit Title Details

1 Introduction Review of Software Development Life Cycle,Waterfall, spiral, Iterative and Incremental models

2 Object Oriented Methods: Rational Unified Process(RUP), XP and UML

3 Concept of modeling, UML, Static and Dynamic Modeling, Logical and Physical

(81)

Lec.Num

Unit Title Details

4 Gathering Requirements

Concept of Use Cases, Identifying Business Actors, Identifying the use cases, Writing Use Cases

5 Pre and Post Conditions, Drawing Use Cases

6 Specializing actors, Use Case Relationships

7 Documenting a process Flow

Concept of action and activity, Structuring control flow by Drawing a activity diagram for a given use-case,

8 Using fork and join, Decomposing an action, Using partitions, Signals and Swimlanes,

9 Showing Tokens, Flow and Edges, Pins and Transformation

10 Static Modeling Identifying classes and attributes from problem statements

11 Identifying and Drawing relationships

12 Visibility, Association Classes, Tangible verses Intangible Object

13 Aggregation, Composition, Interface realization

14 Using Object Diagrams

15 Dynamic Modeling

Object communication and Use Case realization using Sequence diagram

16 Messages and Types of messages used in Sequence Diagram

17 Sequence Vs Collaboration Diagram

18 Using State machines to describe behavior of system. Using sub-states

19 Designing the System Architecture

Using Packages and component Diagrams

20 Choosing a Network topology, Technology and using Deployment Diagrams to represent the same

21 Reusable Design Patterns

Agile Software Engineering and Design patterns

22 Creational Patterns

Creational Pattern, Why the name creational pattern?Concept of factory in OOP.Factory Method, Abstract Factory vs Factory Method

23 Builder Pattern - need its structure and example

24 Need of Singleton class, example and StructurePrototype overview

25 Prototype Design Pattern

(82)

26 Structural Patterns

Adapter Pattern: real life example, Software example and Structure

27 Composite and Bridge Pattern

28 Decorator concept, example from java.io package;Structure and comparison with composite pattern

29 Façade and Flyweight pattern structure

30 Concept and need of proxy, Pattern structure with example

31 Behavioral Patterns

Why Behavior Patterns. Chain of Responsibility Pattern

32 Command and Interpreter Patterns

33 Iterator pattern example from java.util package.

34 Mediator pattern:Role of mediator to promote loose coupling in a set of objects interacting with each other

35 Memento:Need of save state of an object; using Memento to restore an object state by undo and redo.

36 Concept of Observer, one to many dependency, Example of weather forcast

37 State : how behavior of an object changes when its internal state changes.

38 Need of Family of algorithms, how we can make all this algorithms interchangeable using Strategy pattern,Overview Template Method

39 Template method and Interpreter

40 Visitor: how a new operation can be defined without changing class

41 Introduction to Object Oriented (OO) Software

Intent of OO Metrics, Distinguishing Characteristics

42 Metrics for OO Design Model

43 Class and method oriented metrics

44 Metrics for OO Testing

45 OO for Object Oriented projects

(83)


Title Applied Data Structures and Algorithm Design Pattern


Examinations Int: 30 Univ: 70 Practical 50

Objectives To make students familiar with various data structures and algorithm design.

Learning Outcomes At the end of course students should be1. Familiar with various models of computation and analyze the al-

gorithm efficiency.2. Various types of data structures and its usage3. Use different algorithm patterns to solve problem

Pre-requisites Any program language

Text Book(s) 1. Data structures and Algorithms,2. Fundamentals of Algorithm,

Syllabus

Lec.Num.


1-3 Models of Computation Definition of a problem, examples of problems, important problem types.Definition of algorithm, algorithm repre-sentation, correctness of algorithm, time complexity and space complexity of al-gorithms.Detailed model of computationSimplified model of computation

Handout

4-8 Analysis of Algorithm Effi-ciency

Analysis frameworkAsymptotic notation and basic efficiencyClasses ,Analysis of non-recursive algo-rithmsAnalysis of recursive algorithms, Empirical analysis of algorithms

A39-48,A49-56A57-63A65-72A80-85

(84)

Lec.Num.


9-10 Linear Data StructuresHierarchical data structures

Dynamic Sets, Stacks, Queues, De-queuesBasic tree conceptsN-ary trees, breadth first and depth first traversalsBinary trees and binary tree traversal al-gorithmsBinary 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 tree

Handout

Handout

Handout

Handout

Handout

11-20

Rebalancing – concept of rotation, in-sertion and removal in AVL trees, Red-black trees and B-trees

Handout

21-24

Algorithm design- Brute Force Pattern

Description and simple examplesApplication-Selection sort and Bubble sortApplication-Sequential search and String matchingApplication-Closest pair and Convex-hullApplication-Travelling Salesman prob-lem, Knapsack problem, Assignment problem

HandoutA93-97A98-101H102-107H108-115

25-28

Algorithm DesignDivided and Conqure Pat-tern

Description and simple examplesMerge sort and Quick SORTBinary search and Binary tree Traver-salsMultiplication of large integer and Strassen’s matrix multiplication,Closest pair and convex hull problems.

HandoutA117-127A128-135A137-141A142-146

(85)

Lec.Num.


29-32

Algorithm Design- Decrease and Conquer Pattern

Description and simple examplesInsertion sort and Topological sortingDepth-First Search and Breadth-First Search Generating Permutations and Generating Subsets

HandoutA149-154A163-166A167-171

33 Decrease-by-a-Constant-Factor Algorithms

Fake-coin Problem, Multiplication-a-la-Russe, Josephus Problem.

A172-176

34-36

Variable size decrease Algo-rithm

Computing median and selection prob-lem, interpolation search, searching and insertion in BST, the game of NIM.

A177-184

37-42

Algorithm Design-Transform and Conquer

Description and Pre-sortingBalanced Search Trees- AVL trees and2-3 treesHeaps and Heap-sortHorner’s Rule and Binary Exponentia-tion Problem-Reduction

A187-191A202-210A211-217A218-223A224-231

43-46

Algorithm Design-Space and Time Trade offs

Horspool’s and Boyer-Moore algorithms for string matching, Hashing-basic con-cepts, Hashing methods, Separate Chaining, and Open Addressing

A237-241A242-251A252-257

47-48

Algorithm design- Dynamic Programming Pattern

Description, Computing Fibonaccii Terms,Computing Binomial CoefficientWarshall’s and Floyd’s AlgorithmsKnapsack problem and Memory Func-tions

HandoutA270-276A284-288

49-50

Algorithm Design- Greedy Pattern

Description and simple examplesPrim’s and Kruskal’s AlgorithmsDijkstra’s Algorithm Huffman Trees

HandoutA291-301A305-309A311-316

51-52

Limitations of Algorithm Power

P, NP, and NP-Complete ProblemsChallenges of Numerical Algorithms

A377-380A382-391

53-54

Algorithm Design-Backtracking Pattern

Description, n- Queen’s Problem, Hamil-tonian Circuit Problem, Subset-Sum Problem

A393-398

54-56

Algorithm Design-Branch-and-Bound Pattern

Description, Application to Assignment Problem, Knapsack Problem, Travelling Salesman Problem

A402-410

(86)


Title Distributed Programming



Practical: 50

Objectives 1) To teach the fundamental concepts of distributed pro-gramming, with particular emphasis on enterprise appli-cation development.

2) To introduce various distributed programming architec-tures and how to apply them.

3) To lean the importance of distributed computing and outline the factors to address when designing a distributed system.

Learning Outcomes Upon completion of this course, students should be able to: Understand the significance and basic concepts of dis-

tributed computing and Define technologies for distrib-uted 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-requisites Object Oriented Programming with Java (J030109)Database Management Theory (J030108)Web Support Technologies (J030106)

Reference Books 1. Cay S. Horstmann and Gary Cornell ,Core Java-Volume-I, Sun Core Series, Eighth Edition, 2008

2. Java Server Programming, Worx Press3. Mastering EJB, Rima Patel Sriganesh, Gerald Brose,

and Micah Silverman, Wiley Publications

(87)

Syllabus

Lec. Num Unit Title Details

1. Socket Programming

Concept of Socket and Port, Understanding the classes from java.net package

2. Relation between Socket, Input Stream and Output Stream, Writing an Echo Server

3. Using ServerSocket and Socket, Writing a Server to handle single client. GreetServer and Others

4. Writing Multithreaded Server to handle Multiple clients.

5. Using Object Streams with Sockets.

6. Java Database Connectivity

Concept and need of JDBC API, Types of JDBC Drivers

7. Writing a simple JDBC program

8. Types of Statements and using all that statements

9. Types of Result Set

10. Database access via sockets

11. Servlet and JSP What is a Servlet? Why Servlet? Writing a Compiling a first Servlet, Understanding Tomcat: Tomcat directory structure, Structure of web.xml file

12. Configuring and running a first Servlet, Servlet Life cycle, retrieving the parameters sent by user with request

13. Writing thread safe Servlet, Servlet and Cookies

14. Using Servlet Config and Servlet Context

15. Writing controller Servlet, getting and using Request Dispatcher

16. Using JDBC in Servlet

17. Session management using Servlet API.

18. Introduction to JSP, Understanding JSP architecture and life cycle of JSP-Servlet, Implicit Objects

19. Using Scriplets, Page and Include directives

20. JSP Standard actions-I

21. JSP Standard actions-II

22. Introduction to Using Tag libraries

(88)

Lec. Num Unit Title Details23. RMI and CORBA Understanding RMI Architecture, Wring Remote Interface and

Implementing it.

24. Using rmic (RMI Compiler), using RMI registry, Writing and executing a RMI Client.

25. Understanding the working of client, JNDI and Naming class

26. CORBA introduction and Architecture

27. Anatomy of a CORBA-based application, CORBA vs. RMI

28. CORBA IDL: The interface definition language

29. IDL to Java Mapping, Writing a Simple CORBA Server

30. Naming, Binding registering and activating objects31. Understanding using a tools to implement CORBA (Caffeine,

Orbix)

32. Introduction to Mobile Agents and Voyager

Concept of Software Agents, Mobile Agent

33. Mobile agent applications, security in Mobile agents

34. Getting Started with Voyager

35. Programming with Mobile Agents

36. Introduction Enterprise Java Beans

Introduction to Enterprise JavaBeans

37. Session Beans, Writing, deploying and using stateless session bean, lifecycle of stateless bean

38. Need of Stateful Session Bean, Writing, deploying and using stateful session bean, lifecycle of stateless bean

39. Understanding Message Driven Beans

40. Need of Entity Bean, Persistence Mechanisms - BMP, CMP, Local and Home Interfaces, Entity Bean Implementation

41. deploying and using, Entity Bean Lifecycle and Lifecycle Methods, Entity Vs Session Bean

42. Understanding Container Managed Persistence (CMP)

43. Using Java Persistence API-I

44. Using Java Persistence API-II

(89)

SEMESTER-VSubject Code J030333

Title Software Project Management and Software Testing


Examinations Int: 30 Univ: 70 Practical : 50

Objectives To provide basic project management skills with a strong em-phasis 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 partic-ular issues encountered in handling IT projects and to offer students methods, techniques and 'hands-on' experience in dealing with them.

Learning Outcomes Understand and practice the process of project manage-ment 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 pro-duce a work plan and resource schedule;

Understand diff. types of testing and how it is conducted. Practice the automated tools available for testing.

Pre-requisites

Text Book(s) A) Information Technology Project Management” Kathy schwalbe, International student edition, THOMSON course Technology, 2003

B) “Software project management”Bob hughes and Mike cotterell,Third edition, Tata McGraw-Hill

C) “Microsoft office Project 2003 Bible”, Elaine Marmel,Wiley publishing Inc.

Syllabus

Lec.Num.


1 Introduction to project management

Project , project management, Importance

A 1 -11 or B 1-4

2 Characteristics of project how software projects are diff. than other projects, Problems with software projects

B 8 -10

(90)

Lec.Num.


3 Phases of project life cycle Initiation phase, planning phase, execution phase, monitoring and controlling phase, closing phase.

B 4 -7 or A 22 -24

4 The stakeholder of project All parties involved in project, Role of Project Manager

A 1 -12 , 35 -37

5 Project management framework A 7 -9, 38 – 41

6 Software tool for project management C 21- 417 Project planning Integration management :What is

integration management, plan development and execution

A 50 – 70

8 scope management What is scope management, methods for selecting project, scope statement, Work Breakdown Structure

A 76 – 87

9 Stepwise 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 -35

10 Use of software(Microsoft Project) to assist in project planning activities

C 43 – 77

11 Project scheduling Time management: importance of Project schedules, schedules and activities, sequencing and scheduling activities

A 109 – 114B 104 -106

12 project network diagram Network Planning models, duration estimation and schedule development

A 114 -128

13 Critical path analysis A 122 -127B 118 – 123

14 PERT A 127 -13115 Use of software( Microsoft project) to

assist in project schedulingC 79 – 116

16 Project cost management Importance and principles of project cost management

A 144 -147B 81 -84

17 Resource planning A 148- 149

(91)

Lec.Num.


18 Cost estimating Attributes to be considered in cost estimation, factors effecting the cost, various costs involved in it.

A 149 -157B 85 -87

19 Cost estimation methods Traditional method: Estimation by analogy, Expert judgment, Parkinson, price to win, top down, bottom up.

Hand out

20 COCOMO Model21 Function point analysis22 Cost budgeting A 157 -15923 Cost control A 159 -16724 Use of software( Microsoft project) to

assist in cost managementC 117 – 147

25 Project quality management Quality of information technology project

A 175- 179

26 Stages of software quality management

A 183 -187

27 PMBOK, Quality standards B 234- 236, 240 -244

28 Tools and techniques for quality control

B 187-196, 237-238

29 Project risk management The importance, Top risk in projects A 273 – 275, Hand out

30 Common sources of risk in IT projects, elements in risk mgt.

A 276 – 278, 134 – 138

31 Risk identification A 279-280B 139 – 141

32 Risk quantification A 280 – 286B 142 – 156

33 Risk response development and control

A 286 – 288

34 Using software to assist in project risk management

Hand out

35 Fundamentals of Testing Fundamentals of Software quality, quality views, People challenges in testing

Hand out

36 Principles of Verification and validation, Techniques of verification

Hand out

37 V model Hand out38 Testing process Hand out39 Unit testing Hand out

(92)

Lec.Num.


40 Integration testing Hand out41 System Testing and Acceptance

testingHand out

42 Testing new product versions Hand out43 Testing planning: test plan, test plan

template, risk analysisHand out

44 Test Design, good test case, test case template, test case mistakes

Hand out

45 Testing Execution: objectives, execution considerations, test execution activities, executing test

Hand out

46 Defect management: what is defect, defect life cycle, defect management process

Hand out

47 Test Metrics: purpose, characteristics of good metrics, metrics

Hand out

48 Functional testing tools Hand out49 Unit testing tools Hand out50 Test management tools Hand out

Reference Books:

Basics of Software Project Management, NIIT, Prentice-Hall India, 2004 Software Project Man-agement in Practice, Pankaj Jalote, Pearson Education, 2002

Effective Methods for software Testing William Perry Software Testing in Real World Edward Kit

SOFTWARE REQUIREMENTS

Microsoft project 2003

(93)


Title Web Services and SOA Applications

Work Load Per Week L:3 T:1 Lab:4 Practical: 4


Practical: 50

Objectives Make student familiar with Web Services(WS) and Service Oriented Architecture (SOA)

Learning Outcomes Upon completion of this course, students should be able to: Use Java XML API for parsing, Data Binding and Messaging Understand the concept Web Service and SOAP Identify the role of SOAP Writing Web Services using java and WSDL Relate Web Services with SOA

Pre-requisites Web Support Technologies (J030106)Object Oriented Programming with Java (J030109)Distributed Programming (J030224)

Reference Book 1. Java Web Services: up and Running, Martin Kalin, Oriely, 20092. Java SOA a Cook Book, Eben Hewitt, Oriely, 20093. Designing Web Services with the J2EE™ 1.4 Platform JAX-

RPC, SOAP, and XML Technologies, Inderjeet Singh and others, Addison Wesley

Syllabus

Lec.Num

Unit Title Details

1. 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 Technologies

4. Creating and Parsing XML with DOM

5. Data Binding using JAXB, JAXB Compilation

6. Mapping Schema types to Java, Java to XMl binding using annotations

7. Marshaling and unmarshaling with JAXB

8. Working with JAXB Object Modeling, In memory validation

(94)

Lec.Num

Unit Title Details

9. The Simple Object Access Protocol (SOAP)

SOAP Messaging Model , SOAP Namespaces, SOAP Envelope Header and body

10. SOAP Faults, Attachments, XML Schema, Validating Message Content, SOAP Encoding

11. The Java APIs for SOAP Messaging (SAAJ)

The SAAJ Object Model, Parsing a SOAP Message, Reading Message Content

12. Working with Namespaces, Creating a Message, Setting Message Content , Integration with the DOM and JAXP

13. The Java API for XML Messaging (JAXM)

Building Low-Level Web Services , Messaging Scenarios

14. Point-to-Point Messaging, JAXM Message Providers

15. JAXM Servlets, Creating a SOAP Connection , Sending a Message,

16. The Java API for XML Messaging (JAXM)

Building Low-Level Web Services , Messaging Scenarios

17. Point-to-Point Messaging, JAXM Message Providers

18. 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 IDL

20. Web Services Description Language, WSDL Information Model, The Abstract Model - Service Semantics

21. Message Description , Messaging Styles,

22. The Concrete Model - Ports, Services, Locations

23. Extending WSDL - Bindings , Service Description

24. Java API for XML Based RPC

The Java Web Services Architecture, Two Paths

25. How It Works - Build Time and Runtime

26. The Web Services for J2EE Specification

27. JAX-RPC Deployment

28. Mapping Between WSDL/XML and Java

29. Generating from WSDL and Java

30. Generating Web Services Using Java Code

The Java-to-XML Mapping, Primitive Types and Standard Classes

(95)

Lec.Num

Unit Title Details

31. Value Types and JavaBeans, The Java-to-WSDL Mapping

32. Simple and Complex Types, Arrays and Enumerations

33. Service Endpoint Interface, Scope of Code Generation

34. Inheritance Support, Multi-Tier Application Design, Analyzing the Domain

35. Generating Java Web Services from WSDL

The XML-to-Java Mapping ,Simple and Complex Types

36. Enumerations, Arrays, Miscellaneous, Optionally-Supported Constructs

37. The WSDL-to-Java Mapping, Mapping Operation Inputs and Outputs

38. Building a Service Client, Locating a Service, Client-Side Validation

39. Creating a Web Service and Deploying the Service

40. Web Services and Security

Threats 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 Signature

43. WS Security, SAML, XACML

(96)


Title Soft Computing



Objectives Soft 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 applications

Learning Outcomes Students 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 applications


Text Book(s) Artificial intelligence by Elaine Rich, Neural Networks, Fuzzy Logic, Genetic Algorithms by S. Rajasekaran

Syllabus

Lec.Num


1 Introduction to Artificial Intelligence Systems

Overview of AI Handout

2 Production Systems Page29(R1)

(97)

Lec.Num


3 Problem characteristics, Production system Characteristics

Page 36-44(R1)

4 Issues in the Design of Search Programs

Page 57 (R1)

5 Heuristic search techniques

Hill climbing Page 64(R1)

6 Branch bounding technique Page 6(R1)

7 Best first search & A’ algorithm Page 65(R1)

8 Soft computing-overview Introduction Handout

9 Guiding Principle of Soft computing Handout

10 Importance of Soft computing Handout

11 Fuzzy Set Theory Introduction Handout

12 Fuzzy Sets, Fuzzy Logic, Crisp Set Page 157-186(R2)

13 Fuzzy Numbers and Fuzzy Arithmetic

Page 157-186(R2)

14 Determination of Membership Functions

Page 157-186(R2)

15 Crisp Relations Page 157-186(R2)

16 Fuzzy Relations Page 157-186(R2)

17 Fuzzy Rule based System Page 157-186(R2)

18 Defuzzification Methods Page 157-186(R2)

19 Applications Page 157-186(R2)

20 Fuzzy Mathematical Programming Handout

22 Programming Assignment Page 157-186(R2)

23 Exercise Handout

24 Evolutionary Computations

Introduction Page 225-252(R2)

25 Basic concept Page 225-252(R2)

26 Creation of Offspring Page 225-252(R2)

27 Working Principle Page 225-252(R2)

28 Encoding Page 225-252(R2)

29 Fitness Function Page 225-252(R2)

30 Reproduction Page 225-252(R2)

31 Programming assignment Page 225-252(R2)

(98)

Lec.Num


32 Neural Networks Introduction Page 11-33(R2)

33 Basic concepts of Neural Networks Page 11-33(R2)

34 Neural Networks Architectures Page 11-33(R2)

35 Characteristics of Neural Network Page 11-33(R2)

36 Solving optimization problems using neural networks

Page 11-33(R2)

37 Learning Methods Page 11-33 (R2)

38 Programming assignment Page 11-33 (R2)

39 Learning Methods Page 11-33 (R2)

40 Programming assignment Page 157-186(R2)

41 Back propagation Networks Architecture

Page 34-86 (R2)

42 Back propagation Learning’s Page 34-86 (R2)

43 Applications Page 34-86 (R2)

44 Variations of Standard Back propagation Algorithm

Page 34-86(R2)

45 Research Direction Page 34-86(R2)

Reference Books:(R1): Artificial intelligence by Elaine Rich(R2): Neural Networks, Fuzzy Logic, Genetic Algorithms by S. Rajasekaran

(99)

ELECTIVE SUBJECTSGROUP I : BUSINESS APPLICATIONS OF IT

Subject Code J0302BIT01

Title Design of E-Commerce Applications



Objectives This course aims to cover the study concepts of E-com-merce, E-commerce securities, E-commerce payment systems and various e-commerce applications.

Learning Outcomes At the end of the course students should understand the overall knowledge of E-commerce,

Pre-requisites

Text Book(s) E-commerce Concepts, Models, Strategies byC. S. V. Murthy

Syllabus

UNIT-1Overview of E-commerce

Brief 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 Internet

Electronic 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,

(100)

Information Technology Act

UNIT-4E-commerce Payment System

Overview 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 Applications

Electronic Commerce and Banking, Electronic commerce and retailing, Electronic commerce and online publishing, Online Marketing, E-advertising, E-branding, Mobile Commerce

Reference Books:1. Electronic Commerce A Manager’s Guide by Ravi Kalakota and Andrew Whinston,2. E-Commerce A managerial perspective by P. T. Joseph.3. Electronic Commerce from Vision to Fulfillment by Elias M. Awad.

(101)


Title Intelligent Decision Support Systems

Work Load Per Week L : 3 T: 1

Examinations Int : 30 Univ. : 70

Objectives The 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 Outcomes

Text 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.

LectureNumber

Topic Details

01 Managerial 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

(102)

02 DSS architecture, Decision modeling and analysis, Decision Support Developments, Executive Information Systems, Data warehousing, access, analysis, mining and visualization.

03 Deterministic 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.

04 Group 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

05 Advanced 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.

06 Application of DSS: Technical Feasibility and FinancialViability of DSS. Advantages and Limitations of DSS –Contemporary practices.Case Studies in any one functional area

(103)


Title Knowledge Management



Objectives To provide different management techniques to handle knowledge .

Learning Outcomes After 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 Ghaziri

Syllabus

UNIT – 1: Introduction To Knowledge Management

What 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 Creation

Knowledge 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 experts

UNIT - 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 Codification

(104)

What 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 Testing

Knowledge 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 considerations

UNIT - 6: Knowledge Transfer And Sharing

Knowledge 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 Issues

Knowledge 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:1. Leading with Knowledge – Knowledge Management Practices in Global Infotech by

Madanmohan Rao, Tata McGraw Hill

2. Knowledge Management System by Barnes S

3. Knowledge Management Strategies by Honeycut, Prentice Hall of India

(105)


Title IT Enabled Services

Work Load Per Week L: 3 T: 1


Objectives To 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 Outcomes

Pre-requisites

Reference Book(s) 1. Nasscom’s Handbook on IT Enabled Services, By Nasscom

2. MGI (McKinsey Global) reports 2006 and 2007 excerpts

3. ITES Case Studies from wipro/ Infosys/ IBM etc.4. Service Level Management and SLA : resources

from the Internet

Syllabus:

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 units

(106)

Unit 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 Services

Unit 7: Service Desk management:Types of Service Desks, benefits and demerits of each type, suitability of a particular type to a specific business context

Unit 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 plays

Unit 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 space

Unit 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.

(107)

GROUP II : COMPUTER NETWORKING

Subject Code J0302CN01

Title Network Architecture and Design

Work Load Per Week L: 3 T: 1 Lab: 0


Objectives The 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 Outcomes Design 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 place-ment etc.

Identify network issues, risks, bottlenecks etc .

Pre-requisites • Basic knowledge of networking concepts.

Text Book(s) • Top - Down Network Design by Priscilla Oppenheimer

Unit 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 1) Budgetary Constraints 2)Staffing Constraints 3)Project Scheduling

Unit II: Analyze Technical GoalsScalability 1) Planning for Expansion 2) Expanding Access to Data 3) Constraints on scalability

Availability 1) Specify Availability Requirements 2) Mean Time Between Failure 3) Mean Time to Repair

Network 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) Affordability

Unit III: Characterizing the Existing Internetwork(108)

Characterizing the Network Infrastructurea) Developing Network Map

1) Tools for developing Network maps2) Characterizing Large Internetworks3) Characterizing Logical Architecture

Characterizing 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 Firewalls

a) Tools for Characterizing Existing Network1) Protocol Analyzers2) Network Monitoring Tools3) Network Management Tools4) Remote Monitoring Tools5) Cisco Tools

Unit IV: Characterizing Network TrafficCharacterizing Traffic Flow1) Identifying Major Traffic sources & stores2) Documenting Traffic FlowCharacterizing Types of Traffic Flow1) Terminal/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 Load1) Calculating Theoretical Traffic Load2) Documenting Application Usage PatternRefining Estimates Caused by Applications1) Estimating Traffic Overhead for Protocols2) Estimating Traffic load caused by Workstation3) Estimating Load caused by Routing protocolsCharacterizing Traffic Behavior1) Broadcast/Multicast Behavior2) Network Efficiency a) Frame Size b) Error Recovery Mechanisms

(109)

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 Design1) Enterprise Composite Network Modela) Enterprise campus b) Enterprise Edge c) Service provider Edge2) Designing a Campus Network Design Topology1) Spanning Tree Protocola) STP Convergenceb) Selecting Root Bridge Virtual LANs - Fundamental VLAN DesignsWireless LANS - Positioning an Access PointDesigning Enterprise Edge Topology1) Redundant WAN Segments 2) Multihoming Internet ConnectionVirtual Private Networking1) Site-to-Site VPNs 2) Remote-Access VPNsSecure Network Design Topologies1) Planning for Physical Security 2) Meeting Security Goals with Firewall topologies

Unit VI: Developing Network Security StrategiesNetwork Security Design1) Identify Network Assets and Risks2) Developing a Security Plan and Policy3) Developing Security ProceduresModularizing Security Design1) Securing Internet Connectionsa) Securing Public serversb) Securing E-commerce Servers2) Securing Remote-Access and VPNs

Unit VII: Developing Network Management StrategiesNetwork Management Design1) Proactive network Management2) Network management Processesa) Performance Management b) Fault Managementc) Configuration Management d) Security Management

(110)

e) Accounting Management3) Network Management Architecture

Unit VIII: Selecting Technologies and Devices for Campus networksLAN Cabling plant Design1) Cabling Topologiesa) Building –Cabling Topologiesb) Campus – Cabling Topologiesc) Types of CablesLAN Technologies1) Ethernet 2) IEEE 802.3

Selecting Internetworking Devices for Campus Network Design with example1) Hub 2) Bridge 3) Switch 4) Router 5) Gateways

Unit IX: Testing the Network DesignBuilding and Testing a Prototype Network System1) Determining scope of Prototype System2) Writing 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 scripts

Tools 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 Predictor

Reference Book: Data Network Design Darren L. Spohn

(111)


Title Network Programming



Objectives To enable the students to develop the necessary skills for developing robust and scalable network applications

Learning Outcomes At 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 applications Learn about raw sockets.

Pre-requisites Basic Knowledge of computer, Computer Network, Proficiency in JAVA Programming and UNIX, understanding of Inter Process Communication

Text Book(s) A) JAVA NETWORK PROGRAMMING Second Edition BY Elliotte Rusty Harold –O’REILLY

B) UNIX Network Programming, Volume 1: The Sock - ets Network API, 3rd Edition, by W. Richard Stevens, Bill Fenner, and Andrew M. Rudoff.

C) "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 Media

UNIT- 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,

(112)

http://www.awprofessional.com/bookstore/product.asp?isbn=0131411551&rl=1

http://www.awprofessional.com/bookstore/product.asp?isbn=0131411551&rl=1

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 group

UNIT-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 Side

UNIT-IVSocket Programming on UNIX Platform: Sockets: Socket address structures, Value_result arguments

Byte 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 Sockets

UNIT-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.

(113)


Title Network Administration

Work Load Per Week L:4 T: Lab:1


Objectives To understand and implement your own networks using various networking devices and configure them for reliable performance.

Learning Outcomes At the end of this course, student should be able to Understand designing and planning network. Understand various hardware devices. Configure these devices Troubleshoot the network Understand various protocols and their functioning. Design the VLANS

Pre-requisites Basic Knowledge software engineering

Text 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.

Syllabus

Unit 1. Internetworking Internetworking Models, OSI reference Models Ethernet networking Wireless Networking Cisco three layer hierarchical model

Unit 2. Internet Protocols TCP/IP and DoD model Application and host to host layer protocol Internet layer protocol IP addressing IP terminology IP Addressing scheme Private IP addresses Broadcast addresses Network address translation

(114)

Unit 3. IP sub netting and variable length subnet masks Subnetting Basics Subnet and subnet masks Subnetting Class C addresses Subnetting Class B addresses Subnetting Class A addresses Variable length Subnet masks VLSM design Trouleshooting IP addressing

Unit 4. Introduction to the Cisco IOS Cisco router GUI Cisco router IOS Conneting to Cisco router Setup mode Command line interface Router modes CLI prompts Router Administrative functions Configuring router Verify configuration

Unit 5. IP routing Routing basics IP routing process Configuring IP routing Routing Protocols Routing information protocol Interior gateway routing protocol Introduction to EIGRP Introduction to open shortest path first

Unit 6. Swithching Switching services Spanning tree protocol LAN switch type Configuring catalyst 1900 switches Configuring catalyst 1900 switches

Unit 7. Virtual VLAN Basics VLAN memberships Identify VLANS VLAN trunking protocol Routing between VLANS Configuring VLANSIntroduction to wide area networking protocols.

(115)


Title Network Security



Objectives This course provides an essential study of Network Secu-rity issues.

Learning Outcomes At the end of this course, student should be able to To acquire an understanding of Network Security and

its changing character

To analyze both early and contemporary threats to Network Security

To understand the concept of Cryptography

To know the Network Security tools and applications

To understand the system level Security

To identify and investigate threats to Network Security

Pre-requisites Basic Knowledge of computer, Network Protocols, Computer Security

Text Book(s) A) NETWORK SECURITY ESSENTIALS: Applications and Standards BY William Stallings – Pearson Publications.

B) NETWORK 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 Logarithms

UNIT-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

(116)

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 Systems

UNIT-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: ISAKMP

UNIT-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 Steganography

(117)

GROUP III : THEORETICAL COMPUTER SCIENCE

Subject Code J0302TC01

Title Design of Language Processors



Objectives This course aims to cover the main technologies associ-ated with compiling programming languages, viz. lexical analysis, syntax analysis, type checking, run-time data or-ganization 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 lan-guage for the x86.

Learning Outcomes At 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.


Text Book(s) Introduction to Computer Theory by Daniel Cohen, Compilers by Ullman

Syllabus

Lec.Num.


1 Review of Mathematical Preliminaries

Set Handout

2 Relation and Functions Handout

3 Graph and Trees Handout

4 Principle of induction Handout

5 Alphabets and languages Page 2-7(R1)

6 Theory of Automation Definition, Description, Transition Graph

Page 52-87(R1)

7 DFA,NFA Page 92-140(R1)

(118)

Lec.Num.


8 Minimization of Finite Automata

Page 92-140(R1)

9 Equivalence of DFA & NDFA Page 92-140(R1)

10 Moore & Mealy machine Page 149-156(R1)

11 Equivalence of Moore &Mealy Page 149-156(R1)

12 Regular Expression Definition & Example Page 31-44(R1)

13 Regular set & their closer properties

Page 31-44 (R1)

14 Grammar Definition Page 224-259 (R1)

15 Properties unrestricted grammar & their equivalence

Page 224-259 (R1)

16 Derivation trees Page 224-259(R1)

17 Simplifying CFG Page 224-259 (R1)

18 Unambiguifying CFG Page 224-259 (R1)

19 Normal form of CFG Page 224-259 (R1)

20 Chomsky Normal form Page 224-259 (R1)

22 Introduction to Compiling and one pass compiler

Compilers & Translators Page 1-20(R2)

23 Phases of Compilers Page 1-20(R2)

24 Structure of a Compiler Page 1-20(R2)

25 Overview of one pass Compiler

Page 25(R2)

26 Error handling Page 25(R2)

27 Lexical Analysis Role of lexical analyzer, specification of tokens

Page 83-92R2)

28 Implementation of lexical analyzer

Page 83-92(R2)

29 Syntax Analysis & Parsing Techniques

Phase Tree, Ambiguity of parse Tree

Page 159(R2)

30 Bottom up parsing and Top down parsing

Page 181-195(R2)

31 LR parsers, constructing SLR and canonical LR parsing tables

Page 215-257(R2)

32 Introduction to YACC,LR(1)& LALR Parsers

Page 215-257(R2)

(119)

Lec.Num.


33 Code optimization Folding Page 585-660(R2)

34 Redundant sub-expression evolution

Page 585-660(R2)

35 Optimization within iterative loops

Page 585-660(R2)

36 Symbol Table handling techniques

Organization for structured and non-structured languages

Page 429-440(R2)

37 Linking and Loading Allocation

Various schemes of Linking and Loading

Handout

38 Absolute and Relocatable loader

Handout

39 Assembler Statements, simple assembly scheme

Handout

40 Design of 2 pass assembler Handout

41 Assembler Implementation Handout

42 Interpreters Interpreters execution Handout

43 Interpretive languages Handout

44 Structure of interpreter Handout

45 Partial compilation Handout

46 Editors-line Window, screen editors Handout

47 Stream and structure editors Handout

48 Design and implementation issue

Handout

Reference Books:

R1: Introduction to Computer Theory by Daniel Cohn

R2: Introduction to Computer Theory by Daniel Cohen, Compilers by Ullmanen

(120)


Title Advanced Database Technologies



Objectives To 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 Outcomes At the end of the course students should be able to:1. Gain an awareness of basic issues in object

oriented data models.2. Learn about the Web Database Management

Systems integration technology.3. Familiarize with data warehousing and other

advanced topics as distributed databases, spatial & temporal database.

Pre-requisites Thorough 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. Prabhu

Syllabus

Lec.Num.


1 Object Oriented Database & Object Relational DBMS

Overview of Object Oriented Concepts and Characteristics.

A- 361 - 363

2 Object identity, Object structure and Type Constructors.

A- 363 - 369

3. Database design for ORDBMS, Comparing RDBMS. OODBMS & ORDBMS

B – 288-289

(121)

Lec.Num.


4 Advanced Concepts in Distributed Databases

Introduction, 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 - 778

5 Dates 12 rules for distributed databases.Types of distributed database systems.

C- 726 – 728A – 778 - 781

6 Distributed Database Architecture, Homogeneous distributed database and Heterogeneous distributed database.

Hand Outs

7 Query Processing in distributed database.

A- 781 - 786

8 Overview of concurrency control and recovery in distributed database.

A – 786 - 789

9 An overview of client – server Architecture and its relationship to distributed database

A- 789 - 790

10 Parallel Database Introduction, Parallel database concepts and parallel database architecture.

B – 565 & Handouts.

11 I/O Parallelism, Partitioning techniques, Handling of Skew.

B – 566 - 569

12 Interquery Parallelism, Intraquery Parallelism & Interoperation Parallelism.

B – 568 - 582

13 Design of parallel systems. B – 582 - 583

14 Active Database Introduction, concepts, Generalized model for active database.

A – 734 - 739

15 Design and implementation issues for Active database.Potential applications for Active database.

A – 739 – 741A - 744

16 Temporal Database Concepts, Time representation, calendars and time dimensions in temporal database. Time series data.

A – 744 - 746

17 Incorporating time in Relational database using Tuple Versioning, Incorporating time in Object oriented database using attribute versioning.

A – 747 - 754

(122)

Lec.Num.


18 Spatial & Geographic Database.

Representation of geometric information, design of database and geographic database, Representation and applications of geographic data.

B- 710 - 715

19 Indexing of spatial data, K-d Trees, Quad trees and R- trees.

20 Multimedia Database Introduction, similarity based retrieval, continuous media data, multimedia data formats, and video server.

A – 759 – 760B – 719 - 722

21 Mobile Database Introduction, mobile computing Architecture

A – 886 - 887

22 Types of data in mobile application, Data Management issues.

A – 888 - 889

23 Deductive Database Introduction, Applications of deductive database.

A – 834 - 835

24 Web Technology and DBMS Introduction to the internet and web, Internet and Intranet, e- commerce & e- business.

C – 934 - 947

25 The web, HTTP, HTML, URL’s, Static and dynamic web pages.

C- 949 - 945

26 Web as a database application platforms: Requirements for Web – DBMS integration, Web –DBMS architecture

C – 954 - 958

27 Advantages and disadvantages of the Web – DBMS approach, Approaches to integrating the Web and DBMS.

C- 958 - 963

28 Web – Database Applications Hand Outs

29 Data Warehouse Definition, characteristics, benefits and need for a separate data warehouse.

D – 39 - 44

30 OLAP and OLTP Systems. D – 43

31 Multidimensional data models: - Tables, spreadsheets and data cubes.

D – 44 - 48

32 Schemas for multidimensional data models: - Star, Snowflake and Fact constellation.OLAP Operations

D – 48 – 51D- 58 - 61

(123)

Lec.Num.


33 Data 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 - 5

34 Design of data warehouse, Process of data warehouse design. Three tier architecture

D- 62 - 69

35 OLAP servers, Data Warehouse back end tools and utilities.

D – 69 - 85

36 Data Preprocessing, need and objectives for data preprocessing. Preprocessing Techniques.

D – 105 - 108

37 Data Cleaning D – 109 - 112

38 Data Integration D – 112 - 114

39 Data Transformation D - 114 - 116

40 Data Reduction and Discretization D- 116 - 136

(124)


Title High Performance Computing

Work Load Per Week L : 3 T : 1

Examinations Int:30 Univ:70

Pre-requisites

Text Book(s) Introduction of Parallel Computing Ananth Grama Anshul Gupta George Karypis, Vipin KumarPublisher : Addison Wesley

Lecture Number Broad topic to be covered Details thereof to be covered

1 Introduction to Parallel Computing Motivating Parallelism

2 Scope of Parallel Computing

3 Parallel Programming Platforms Implicit Parallelism: Trends in Microprocessor Architectures

4 Limitations of Memory System Performance

5 Dichotomy of Parallel Computing Platforms

6 Physical Organization of Parallel Platforms

7 Principles of Parallel Algorithm Design

Preliminaries

8 Decomposition Techniques

9 Characteristics of Tasks and Interactions

10 Mapping Techniques for Load Balancing

11 Methods for Containing Interaction Overheads

12 Parallel Algorithm Models

13 Programming Using the Message-Passing Paradigm

Principles of Message-Passing Programming

14 The Building Blocks: Send and Receive Operations

15 MPI: the Message Passing Interface

(125)

16 Topologies and Embedding

17 Overlapping Communication with Computation

18 Collective Communication and Computation Operations

19 Groups and Communicators

20 Programming Shared Address Space Platforms

Thread Basics

21 Why Threads?

22 Thread Basics :Creation & Termination

23 Synchronization Primitives in Pthreads

24 Controlling Thread and Synchronization Attributes

25 Thread Cancellation

26 Composite Synchronization Constructs

27 Tips for Designing Asynchronous Programs

28 Dense Matrix Algorithms Matrix-Vector Multiplication

29 Matrix-Matrix Multiplication

30 Sorting Issues in Sorting on Parallel Computers

31 Sorting Networks

32 Bubble Sort and its Variants

33 Quicksort

34 Bucket and Sample Sort

35 Other Sorting Algorithms

36 Graph Algorithms Definitions and Representation

37 Minimum Spanning Tree: Prim's Algorithm

(126)

38 Single-Source Shortest Paths: Dijkstra's Algorithm

39 Transitive Closure

40 Connected Components

41 Search Algorithms for Discrete Optimization Problems

Definitions and Examples

42 Sequential Search Algorithms

43 Search Overhead Factor

44 Parallel Depth-First Search

45 Parallel Best-First Search


Title Simulation modeling



Objectives Computer 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.

(127)


Text Book(s) Simulation Modelling and Analysis by Averill M. Law & David Kelton

Syllabus

UNIT -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 Language

UNIT-2 Simulation Queuing SystemCharacteristics Performance of Queuing Systems, Steady State Behavior

Networks of Queues, Inventory models, Problem statement, Program organization and Logic

Job shop models, Problem Statement, Simlib Program, Simulation Output

Multiteller Bank with Jockeying, Problem Statement, Simlib Program, Simulation Output

Input 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 Generation

Properties of Random Numbers, Generation of Pseudo-Random Numbers

Testing for Randomness, Pitfalls, Generating Random Variates, Inverse Transform

Composition Method, Convolution Method, Acceptance-Rejection Technique

Special properties

UNIT-4 Simulation Models

Introduction & Definitions, Model Details, Developing Simulation Programs

Techniques for Increasing Model Validity & Credibility, Output Data Analysis

Introduction, Steady-State Behavior of a Stochastic Process

Statistical Analysis for Steady-State Parameters

Techniques for Increasing Model Validity & Credibility

UNIT-5 Simulation software

History, Selection process, Simulation in High Level Language(C, C++, Pascal, FORTRAN)

Simulation packages (Methlab/ Simulink), Interpreted vs. compiled simulators

Future trends, Interpreted vs. compiled simulators, Examples

(128)

Reference Books:

Simulation Modelling and Analysis by Averill M. Law & David Kelton

Group-IV: Advanced Programming Environments

(129)

Subject Code J0302APE01

Title MFC Programming

Work Load Per Week L:3 T:1 P:4


Objectives Make student comfort to develop desktop applications using MFC

Learning Outcomes At the end of this course, students should be able to:1. Handle multiple inheritance and polymorphism in C++2. Use message handling of windows3. Use MFC to do Graphics and System Programming4. Develop applications and component to take advantages of

MFC SDI and MDI

Pre-requisites C Programming and Object oriented Concepts

Reference Books 1) Bjarne Stroustrup, The C++ Programming Language, Addison-Wesley, 3rd Edition

2) Jeff Prosise , Programming Windows with MFC, Microsoft Press; 2 edition,

3) Richard Jones , Introduction to MFC Programming with Visual C++, Pearson

4) Herbert Schildt, MFC Programming from the Ground Up, Mc-Graw-Hill

Syllabus

Unit 1: Essential C++ Using Structures and Union and Class Types of constructors, need of copy constructor Implementing Inheritance in C++, Access control in Inheritance Concept of virtual function and using such functions, Concept of Virtual Table Multiple Inheritance and virtual Base classes

Unit 2: Introduction to Windows Programming Model and Message Handling Overview of developers studio, writing simple application Windows Software Architecture, Event-Driven Programming Messages and Message Encapsulation Windows Libraries and APIs for message handling, The Message Map Adding Message Handlers with Class Wizard

Unit 3: MFC Class Hierarchy MFC Base Classes, Elements of an MFC Program MFC Collection Classes, Iterating Collections Documents and Frames MFC Diagnostic Facilities

(130)

http://www.pearsoned.co.uk/Bookshop/Results.asp?iCurPage=1&Type=1&Author=Richard+Jones&Download=1&SearchTerm=Richard+Jones

Exceptions CWnd Encapsulation of Windows, CWnd Class Hierarchy, changing window attributes,

handling activation and keyboard focus

Unit 4: Document/View Architecture The Document/View Model Document and View Classes Document Templates Saving and Loading Documents Using Multiple Views SDI and MDI Application Styles Decoupling Document and View

Unit 5: Serialization and Persistent Documents CArchive Object Document Serialization Serializing Pointers Creating Persistent Classes Serializing CObject Pointers Serializing Collections

Unit 6: The Mouse and keyboard Windows Mouse Processing CWnd Class Mouse Support Capturing the Mouse Mouse Cursor, Using MFC for Drawing with the Mouse Windows Keyboard Conventions, Keystroke and Character Messages, Capturing Key-

stroke Input

Unit 7: Using Menus and dialogs Building a Menu, Menu Resources Command Routing and Implementing Message Handlers Specifying Shortcuts and Accelerators, Dealing with Unavailable Options CMenu Class and Dynamic Context Menus, MFC Strings and Use of Stringtables Dialog Modality, Programming a Modal and Modeless Dialog Connecting Code to the Dialog with ClassWizard Building Custom Dialogs and Handling Control Messages Using OCX Controls, Keyboard Traversal Data Communication Between Dialog and Parent Common Dialog Boxes, Property Sheets and Tabbed Dialogs

Unit 8: Using Controls Mapping Control Variables, Modifying Control Attributes Push Buttons, Check Boxes, RadioButtons Edit Controls List Boxes and Combo Boxes Tree Controls Spin Buttons, Progress Bars, and Sliders Control Views

(131)

Unit 9: MDI and Multiple Views SDI vs. MDI Applications Multiple View Types Multiple Views Under SDI and MDI Document Templates Instancing a View Adding a New Document Class

Unit 10: Introduction to Resources Windows Resources Overview Icons, Cursors, and Bitmaps Toolbars and Status Bars Strings and Fonts Menus and Dialogs

Unit 11: The Graphics Device Interface Device Contexts and CDCs GDI Drawing Tools and Attributes GDI Object Creation and Cleanup Colors GDI Coordinate Systems and Mapping Modes Regions and Clipping Drawing and Text Functions Pens, Brushes, Fonts Bitmaps and DIBs Icons and Cursors

Unit 12: Form Views Form, Scroll, and Edit Views Creating a Form View from a Dialog Template Adding a Form View to a Document Handling Messages for View Controls Initializing and Sizing the Form View Preventing User Resizing

Unit 13: Database Programming MFC Capabilities The Jet Engine MFC Database Classes Using CRecordView Overview of SQL Using DAO and ODBC for Browsing, Adding, Updating and Deleting Records DAO and ODBC Classes and taking AppWizard and Class Wizard Support

(132)


Title Advanced Software Engineering



Objectives The course aims to develop the broad understanding of the disci-pline of software engineering (gained in the earlier software engi-neering course) by considering the wider systems engineering con-text in which software plays a role. It aims to examine the concept and techniques associated with a number of advanced and industri-ally relevant topics, relating to both the product and processes of software engineering.

Learning Outcomes At 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 engineering

Text 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 Edition

Syllabus

Unit 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 model

Unit 2. Architectural Design and Distributed systems Architecture Architectural design decisions System organizations Modular decomposition styles Control Styles Reference architectures Multiprocessor architecture Client server Distributed object Architecture Inter organizational distributed computer

Unit 3. Object oriented, Real time and component based software design(133)

Object and object classes Object oriented design process Design evolution Real time operating systems Monitoring and control systems Data acquisition systems Component and component models CBSE process Component composition

Unit 4. Security and service oriented software engineering Security concept Security risk management Design of security System survivability Services as reusable components Service engineering Software development with services

Unit 5. Aspect Oriented Software Development Cross cutting concern Development concerns Production concerns Goals Weaving

Unit 6. Agile Software engineering Introduction What is agile development? Agile manifesto and agile principles Modeling and agile modeling The gist of agile processes

Unit 7. Agile Methodologies Reasons for agility Methodologies for developing software Why care about methodologies? Agile processes strength and weaknesses Understanding XP, Scrum, Evo, Unified Process, Crystal, Lean development, ASD,

DSDM and FDD Comparison of methodologies Choosing a methodology Customizing a methodology

Unit 8. Agent oriented software engineering Introduction Agent oriented software The case for an Agent oriented Approach Agent oriented software lifecycle

(134)


Title Human Computer Interface and Mobile Computing

Work Load Per Week L:3 T:1 P:2


Objectives Introduce models and principles of Human Computer Interface (HCI) and use that in Mobile programming using J2ME

Learning Outcomes Upon completion of this course, students should be able to:1. Understand Models and principles of HCI2. Understand various mobile technologies such as GSM,

SMA, CDMA and WAP Architecture3. Understand WAP and J2ME Architecture4. Develop simple applications using MIDlets5. make efficient Use threads and memory in application6. Make HTTP network connections from the mobile device.

Pre-requisites Object Oriented Programming

Reference Book 1. Asoke K Taqlukeder, Roopa Yavagal Mobile Computing, McGraw-Hill; 2005

2. James Keogh J2ME: The Complete Reference, McGraw-Hill Osborne Media; 2003

3. Ben Shneiderman, Designing the User Interface, Pear-son Education, 1998

Syllabus

Lec.Num

Unit Title Details

1 Introduction to Human Computer Interface

Need and Importance of HCI

2 HCI and Human Diversity

3 Goals and Objectives of HCI

4 Models of HCI Conceptual, semantic, Syntactic and Lexical Model

5 GMOS Model

6 Object-Action Interaction model

7 Action-Object Interaction model

(135)

Lec.Num

Unit Title Details

8 Principles of Design

Principle 1: Recognition and Diversity

9 Principle 2: Eight golden rules of interface design

10 Principle 3: Error Prevention

11 Guidelines for Data Display and Data Entry

12 Interaction Styles of design

Direct and Menu selection

13 Form fillin, Command Language

14 Natural Language

15 Computer Supported co-operation

Goals of co-operation, Synchronous Interactions

16 asynchronous and face to face Interactions

17 Application to education and social issues

18 Future Applications and HCI

19 Introduction to Mobile Computing

Introduction to mobile computing , Characteristics of mobile devices , Issues of mobile computing

20 Mobile Computing Architecture

21 Understanding Global System for Mobile Communication (GSM)

22 Concept of Short Message Service (SMS) and General Packet Radio Service (GPRS)

23 Understanding Wireless Application Protocol (WAP)

24 CDMA Technology, Spread spectrum technology, CDMA vs GSM

25 Wireless Data and Third Generation(3G) Networks

26 Introduction to J2ME Programming

Overview of J2ME

27 J2ME Architecture

28 The Connected, Limited Device (CLDC)Configuration and Classifi-cation CLDC of Target Devices

29 Limitations of Java Language Support in CLDC, The java.lang Package

30 CLDC Collections API, The Streams Model

31 The Generic Connection Framework

(136)

Lec.Num

Unit Title Details

32 The Mobile Information Device Profile, Relationship of MIDP to CLDC

33 MIDlets, MIDlet Lifecycle, Application Descriptors

34 The Java Application Manager, MIDlet Suites and, Loading Re-sources

35 User Interface Design

The High-Level User-Interface (HLU) API, Application Descriptors, Displayable Hierarchy

36 HLU: using Forms, Items, Text Fields, date and times

37 HLU: Choice groups, alerts, Tickerts

38 The Low-Level User-Interface(LLU) API: Canvas Class, Using Graphics object for drawing graphics/text and controlling font

39

40 Event Handling MIDP Event Architecture, High-Level Event Handling, Commands

41 Item State Changes, Low-Level Event Handling

42 Keypad and Pointer Input

43 MVC in MIDP, Model Events

44 The Record Management System

Persistence on Mobile Devices, Scope of Record Management

45 Opening and managing a Record Store

46 Using Streams for Record I/O, Persistence Strategies, Filtering and Sorting Records

47 Networking and Timers

The Generic Connection Framework, MIDP Connection Types, Cre-ating an HTTP Connection

48 Building Query Strings, Reading HTTP Responses,

49 The WTK Network Monitor, Bandwidth Emulation

50 Threading, Timers and Timer Tasks

51 Memory Management

Memory Management Techniques, The WTK Memory Monitor and Efficient Data Representation

52 Controlling Object Creation, Using Arrays Effectively, String Manip-ulation

(137)


Title Open Source Technologies

Work Load Per Week

L:3 T:1 Lab : 4

Examinations Int : 100

Objectives This course is aimed to: understand open source movement worldwide use the fastest growing open source operating system, “Linux”, to-

day effectively install, use and perform basic configuration of Linux

system build user-level skills to perform Linux System Administration in

IT profession enable competency in industry-problem identification and resolu-

tion develop application using LAMP

Learning Outcomes

Text 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-7

Internet Resources:1 Open Source Phenomenon http://opensource.org/2 Open Source Technology : Brief

http://www-128.ibm.com/developerworks/opensource/newto/3 Open Source : Benefits http://www.sun.com/software/opensource/4 Beginner's Guide to Linux - Michael Jordan http://www.linux.org/lessons/beginner/

(138)

http://www.linux.org/lessons/beginner/

LectureNumber Topic Details

01 Introduction OSI – Open Source Initiative Open Source Definition Open Source Licenses Open Standard Requirement FOSS – Free and Open Source Software Origin of FOSS Advantage and Disadvantages of FOSS

Packaging and Releasing of Open Source Software

02 Introduction to perl programming, Object oriented perl programming Introduction to perl Basic Variables Data Types Scalar Variables Array Variables Hash Variables Strings, Numbers If and else, While and for loops Operators User I/O Advanced Output File handles Statement Modifiers Functions Perl 5.10 Additions Exercises Programming Structure and style References and Data Structures Regular Expressions Regular Expressions Operators Regular Expressions Reference Code Reuse (Modules) Perl Objects

03 PHP Programming, Advanced PHP Programming, MySql Databases, MySql Database Administration.

Introduction to PHP Syntax Overview File Handling Database Connectivity Session Handling Command Line Programming Form Handling Introduction to MySql Creating a Database Creating a Table Basic Queries Common Function and Operators

04 Python Programming Introduction to Python First Embedded Python Application Running some strings Extension Modules Building and Passing Arguments The None Object Exceptions Logging Stdout Files List/Tuples Callbacks Setting up your own scripting concepts

(139)

05 Ruby Programming, Ruby of Rails Workshop Introduction to Ruby Variables, Data Types, Operators, Symbols, Statements Converting Data to Another Type: Type conversion to Type Casting Arrays, Hashes, and Ranges Functions and Built in Functions Control Structures, Loops Regular Expressions and Blocks Recursion Data structures Methods, Classes, Modules, Namespaces Exceptions Object Oriented Prograaming Multi threading File Handling, Input and Output Basic GUI Ruby and Databases – Ruby on Rails and MySQL06 Unix/Linux Introduction to Unix/Linux Unix/Linux Shell Scripting Linux Installation Unix/Linux System Administration Unix/Linux System Programming Unix/Linux Network Programming Unix and Linux Security Coding Rules Error Logging Client-Server Model

Inter-Process Communication Introduction Pipes Popen() and Pclose() functions Co-Processes FIFOs System V IPC Messages Queues Semaphores Shared Memeory Client Server Property

Development Tools GNU Cross Platforms Development Tool – chain C/C++ Compilers C library alternatives Shell Scripting Java Perl Python Integrated programming Environments Terminal Emulators

Device Driver Programming Real Mode and Protected Mode in 80x86 microprocessor User and Kernel Mode Programming Dynamic Kernel Model (DKM) Programming Character Device Driver programming Block Device Driver Programming Network Device Driver Programming Proc file SystemGroup-V Embedded Technologies

(140)

EMBEDDED SYSTEM ELECTIVES FOR MCA PROGRAMME OF BVU STRUCTURE OF EMBEDDED SYSTEM ELECTIVES

Semester Sr. No. Subject Marks

Semester-IVPaper – I Embedded System Design and Implementation 100

Paper – II Communication in Embedded Systems 100

Semester-VPaper – III System and Device Driver Programming 100

Paper – IV Embedded and Real-Time Operating Systems 100

(141)

PAPER - I: EMBEDDED SYSTEM DESIGN AND IMPLEMENTATION

Unit. No.

Unit title Details

1. Introduction to Embedded Systems

Understanding embedded systems, Categories of Embedded Systems, Requirements of embedded systems, Challenges and issues involved in embedded software development, Trends in embedded software development.

2. Microprocessor based systems

Microprocessor, Memory, Input/Output Devices,8/16/32 bit microprocessors

3. Micro-Controller based systems

Micro-controller,Program/Data memory, Internal/External memory,Instruction set, Development tools.

4. 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.

5. Software development environment for embedded systems

Target hardware platform,Development platform,Programming languages,Operating systems,Development tools.

6. Digital interfacing Keyboard interfacing,LED Display interfacing,LCD interfacing,Servo motor interfacing,Stepper Motor interfacing,Pulse measurement

7. Analog Interfacing Digital-to-analog converter interfacing,Analog-to-digital converter interfacing,ADC techniques, DAC techniques.

8. Interrupts Hardware interrupts, Software interrupts,Internal interrupts, External interrupts, Internal vector tables, Interrupt service routines, Shared data problem,Interrupt latency.

9. MCS-series micro-controller based embedded system design and programming

Internal architecture of 8051 micro-controller,8051 assembly language programming,8051 interfacing,8051 programming on MCS-51 kit

Text Books: o Programming Embedded systems in C and C++ - by Michael Barr

(142)

o The 8051 Microcontroller: Architecture, Programming & Applications - by Kenneth J. Ayala PAPER - II: COMMUNICATION IN EMBEDDED SYSTEMS

Unit No.

Unit title Details

1. 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, CAN

2. Parallel port communication

Communication parameters,

Centronic protocol,

PC-to-PC Communications,

Parallel Port Communication with the 8051 family of micro-controllers

3. USB communication Introduction to USB port,

USB audio,

USB image capture,

USB mass storage,

USB infrared.

4. TCP/IP socket communication

Network 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:o The 8051 Microcontroller and Embedded systems - by Mazidi & Mazidi

o Unix Network Programming - by W. Richard Stevens

(143)

PAPER - III: SYSTEM AND DEVICE DRIVER PROGRAMMING

Unit No.

Unit title Details

1. File I/O Introduction , 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 control Introduction, 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. Signals Introduction, 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 processes Introduction, Daemon characteristics, Coding Rules,Error Logging, Client- Server model.

5. Inter- process communication

Introduction, Pipes, Popen() and Pclose() functions,Co-Processes, FIFOs, System V IPC, MessageQueues, Semaphores, Shared memory, Client-server properties.

6. Development tools GNU cross-platform development tool-chain C/C++ compilers, C library alternatives, Shell scripting, Java, Perl, Python, Integrated programming environments,Terminal emulators

7. Device driver programming

Real 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:o Device Driver Programming - by Rubinio Advanced Programming in the UNIX environment - by Richard Stevens

(144)

PAPER - IV: EMBEDDED AND REAL- TIME OPERATING SYSTEMS

Unit. No.

Unit title Details

Introduction to operating system

History and purpose,Multi-mode execution of a processor,Case studies: DOS, Windows-98, Linux.

Architecture of an operating system

Kernel: Monolithic kernel Vs Micro Kernel,Device Drivers,, Libraries, Shell, Utilities,User applications.

General purpose operating systems

Memory Management,Scheduling and task management,Hardware interfaces,File management,Communication.

Embedded operating systems

Embedded operating system considerations,Task scheduling,Context Switch,Task Synchronization,Embedded Windows NT,Windows XP Embedded,Open Source embedded Oss: Linux, BSD etc

Real-time concepts Introduction,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 systems

Introduction 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: o Building Embedded LINUX Systems - by Karim Yaghmouro Linux Kernel Programming - by Beck

(145)