mcasyll reg2011 revised

7/31/2019 McaSyll Reg2011 Revised

1/43

PSG COLLEGE OF TECHNOLOGY: COIMBATORE - 641 004(Autonomous college affiliated to Anna University of Technology, Coimbatore)

2011 REGULATIONS FOR MCA DEGREE PROGRAMME(for the batches of candidates admitted in 2011 - 2012 and subsequently)

NOTE: The regulations hereunder are subject to amendments as may be made by the Academic

Council of the College from time to time. Any or all such amendments will be effective from suchdate and to such batches of candidates (including those already undergoing the programme) asmay be decided by the Academic Council.

1 (a). PRELIMINARY DEFINITIONS AND NOMENCLATURE

In the following Regulations, unless the context otherwise requires

i) Programme means Degree Programme, that is MCA Degree Programme

ii) Course means a theory or practical subject that is normally studied in a semester,like Data structures, Computer System Architecture etc.

iii) University means Anna University of Technology, Coimbatore

(b). CONDITIONS FOR ADMISSION

Candidates for admission to the MCA degree programme will be required to satisfy theconditions of admission thereto prescribed by the University and Government of TamilNadu.

2. DURATION OF THE PROGRAMME

i) Minimum Duration: The programme will extend over a period of three years leading to the

Degree of Master of Computer Applications of the Anna University of Technology,

Coimbatore. The three academic years will be divided into six semesters with two

semesters per year.

Each semester shall normally consist of 90 working days.

ii) Maximum Duration: The candidate shall complete all the passing requirements of theMCA degree programme within a maximum period of 6 years, these periods reckoned fromthe commencement of the semester to which the candidate was first admitted to theprogramme.

3. STRUCTURE OF THE PROGRAMME

i) Curriculum: The curriculum will comprise courses of study as given in Section 12 infra in

accordance with the prescribed syllabi.

ii) Electives: Every candidate will be required to choose three electives (one in the 4th

semester and two in the 5th semester) from the list of electives, as given in Section 12infra.

iii) One Credit Courses: Candidates can also opt for one credit industry oriented coursesof 14 hours duration which will be offered by experts from industry / other institution / ourfaculty on specialized topics apart from the prescribed courses of study of the programme.Candidates can complete such one credit courses during the semesters 1 to 5 as and

1


2/43

when these courses are offered by different departments. A candidate will also bepermitted to register for the one credit courses of other departments provided the candidatehas fulfilled the necessary pre-requisites of the course being offered subject to approval byboth the Heads of Departments. There is no limit on the number of one credit courses acandidate can register and successfully complete during the above period.

iv)Project Work: Every candidate will be required to undertake a suitable projectin industry / research organization / department in consultation with the Head of the

Department and the faculty guide and submit the project report thereon at the endof the sixth semester on the date announced by the College/Department. Also he/shewill be required to give two review presentations about the progress of the work duringsemester 6.

.v) Mini Project: Every candidate will be required to undertake two Mini Projects-

Mini Project I and Mini Project II during the vacation immediately following thesecond and fourth semesters respectively for a period of not less than six weeks.

vi)Credit assignment: Normally one credit per lecture hour per week and 0.5 credit pertutorial / practical hour per week is assigned for each course. The exact number of creditsassigned to different courses is shown in section 12.

vii) Minimum credits: For the award of the degree, the candidate shall earn a minimum of141 credits by passing the prescribed courses of study as given in section 12.

viii) Medium of instruction: The medium of instruction, examinations, project report etc.shall be in English.

4. REQUIREMENTS OF ATTENDANCE AND PROGRESS

(i) A candidate will be qualified to appear for final examinations of any semester onlyif

a) he / she has satisfied the attendance requirements as per the norms given below: Minimum attendance for eligibility to appear for semester examinations 75%

overall attendance in all theory and laboratory courses put together.

andMinimum 70% attendance in each of the theory and laboratory courses.

.

However, a candidate who secures attendance between 60% and 70% in any

course and / or overall attendance between 65% and 75% in the current semester

due to medical reasons (hospitalization / accident / specific illness) or due to

participation in the College / University / State / National / International level sports

events with prior permission from Principal shall be given exemption from the

prescribed attendance requirement and he / she shall be permitted to appear for

the current semester examinations. Candidates who secure less than 60% in any one of the courses or secure an

overall attendance less than 65% will not be permitted to write the currentsemester examinations of all courses under any circumstances and not permittedto go to next semester.

b) his / her progress has been satisfactory and

c) his / her conduct has been satisfactory.

2


3/43

ii) Candidates who do not qualify to appear for final examinations of any semester for wantof attendance and / or progress and / or conduct have to register for and redo thatsemester programme at the next immediate available opportunity subject to theapproval of Director of Technical Education and Anna University of Technology,Coimbatore.

5. PROCEDURE FOR REJOINING THE PROGRAMME

A candidate who is required to repeat the study of any semester for want of attendance/progress/conduct or who desires to rejoin the course after a period of discontinuance orwho upon his/her own request is permitted by the authorities to repeat the study of anysemester, may join the semester which he/she is eligible or permitted to join, only at thetime of its normal commencement for a regular batch of candidates and after obtaining theapproval from the Director of Technical Education and Anna University of Technology,Coimbatore. No candidate will however be enrolled in more than one semester at anytime. In the case of repeaters, the marks secured earlier in the repeated courses will bedisregarded.

6. ASSESSMENT AND PASSING REQUIREMENTS

i)Assessment: The assessment will comprise of final examination and /or continuousassessment, carrying marks as specified in the scheme in section 12 infra. Continuousassessment marks will be awarded on assessing the candidate continuously during thesemester as per guidelines framed by the College. All assessment will be done onabsolute mark basis. However, for the purpose of reporting the performance of a candidate,letter grades and grade points will be awarded as per section 7(iii)

ii)Final Examinations: Final examinations will normally be conducted during October /November and during March / April of each year. Supplementary examinations may beconducted at such times as may be decided by the College.

A candidate will be permitted to appear for the examination of a semester only if he/shehas completed the study of that semester (vide section 5 supra). A candidate will not beallowed to register for final examination of any semester unless he/she simultaneouslyregisters for the examinations of the highest semester eligible and all the courses whichhe/she be in arrears of. In the case of examination in project work, no candidate will bepermitted to appear at the project work examination unless he /she had submitted theproject report within the prescribed date.

iii)Letter Grade and Grade Point: Each student, based on his/ her performance, will beawarded a final letter grade and grade point as given in the table infra for each course atthe end of each semester by following relative grading system.

In relative grading system, the grades are awarded to the students based on theirperformance relative to the others. The following two schemes for the award of grades arefollowed based on total number of students, n appearing for a course.

Scheme I: When the number of students, n appearing for the final examination isabove 10

For each course, the total mark, M[ M is equal to(Continuous Assessment marks (CA) +Final examination marks (FE)) in the case of theory courses or CA in the case of courseswith 100% continuous assessment component ] is computed for each student and afrequency table of marks for the whole class of strength, n is prepared. The statistical

parameters mean, and standard deviation, of the distribution of marks are arrived asgiven below:

3


4/43

==

n

i

i

n

M

1 n

M

n

i

i=

= 1

2)(

The letter grade and the grade point to each student studying a course are awarded based

on the statistical parameters, mean, and standard deviation, of the distribution ofmarks as detailed below:

Scheme II: When the number of students, n appearing for the final examination isless than or equal to 10

The grades will be finalized by the HoD, faculty teaching the course & programmecoordinator / senior faculty nominated by HoD. The passing minimum will be 50% in the

4

Total Mark, M secured by thestudent (CA +FE)

GradeGrade Point, g

M Min [ (+ 2) , 92] S 10

+ 1.2 M < + 2 A 9

+ 0.4 M < + 1. 2 B 8

- 0.4 M < + 0.4 C 7

- 1.2 M < - 0.4 D 6

- 2 M < - 1.2 E 5

M < - 2

or M less than 50% in final examinationfor theory courses or M less than 50%in total marks for theory andlaboratory courses with 100%continuous assessment component

F 0

Withdrawal from examination W 0


5/43

final examination for theory courses or 50% in total marks for theory and laboratory courseswith 100% continuous assessment component.

After the completion of the programme, the Cumulative Grade Point Average (CGPA) fromthe first semester to final semester is calculated using the formula

CGPA =

i

ii

C

Cg *

where gi is Grade point secured corresponding to the course Ci is Credit rating of the course.

iv)Passing a course:

a) A candidate, who absents or who withdraws or is disqualified as per section 4 or whosecures a letter grade F (Grade point 0) will retain the already earned continuousassessment marks for the next immediate attempt only in the examination of that courseand thereafter he/she will be solely assessed by final examination carrying the entire marksof that course.

A candidate, who absents or secures a letter grade F (Grade point 0) in any coursecarrying only continuous assessment marks, will be solely examined by a final examinationcarrying the entire marks of that course, the continuous assessment marks obtained earlierbeing disregarded.

If a candidate who has registered for a one credit course does not clear the samesuccessfully, it will be treated as withdrawal from that course; alternatively, he/she can re-register for the same course and complete it as and when it is offered subsequently prior tothe commencement of his / her pre-final semester (i.e semester 5). The one credit courseswill be evaluated by the course instructor / department faculty concerned and will carry atotal of 100 marks for continuous assessment; out of which 50 marks will be for final test to

be scheduled by the course instructor / department faculty concerned.

b) A candidate who lacks in attendance or who fails to submit the report on the 6thsemesterproject (or whose report is not accepted for reasons of incompleteness or other seriousdeficiencies) within the prescribed date or whose project work and viva-voce has beenassessed as grade F will have to register at the beginning of a subsequent semesterfollowing the final semester, redo and submit the project report at the end of that semester

and appear for final examination.

c) If a candidate fails to submit the report on project work on or before the date specified bythe college / department, he/she is deemed to have failed in the project work and awardedgrade F.

d) If a candidate fails to appear for the viva-voce examination after submitting the report onproject work on the date specified by the college / department, he/she will be marked asabsent for the project work. Such candidates will be allowed to appear for the viva-voceexamination at the next earliest opportunity, the project being evaluated at that time.

v) Supplementary Examination

a) Examination is conducted exclusively for supplementary candidatesIf a student appears in a course as a supplementary candidate, then his / her grade in thatcourse will be on par with the grade allotted for the same score in that course in theimmediate preceeding regular examination.

5


6/43

b) Examination is conducted commonly for a batch of regular and supplementarycandidatesIf a student appears in a course as a supplementary candidate when the examination in thatcourse is conducted for a batch of regular students, then his / her grade in that course will bebased on the grade allotted to the same score in that course applicable to that batch ofregular students.

8. QUALIFYING FOR THE AWARD OF DEGREE

A candidate shall be declared to have qualified for the award of the MCA Degreeprovided

i) the candidate has successfully completed the course requirements and has passed all theprescribed courses of study of the respective programme listed in section 12 within theduration specified in section 2 and

ii) no disciplinary action is pending against the candidate.

9. CLASSIFICATION OF DEGREE

i) First Class with Distinction: A candidate who qualifies for the award of the Degree(vide section 8 supra) in having passed all the courses of study of all the six semesters atthe first opportunity within six consecutive semesters after the commencement of his /herstudy and securing a CGPA of 8.50 and above shall be declared to have passed in FirstClass with Distinction. For this purpose the withdrawal from examination (vide section 10infra) will not be construed as an opportunity for appearance in the examination. Further,the authorized break of study (vide section 11 infra) will not be counted for the purpose ofclassification.

ii) First Class: A candidate who qualifies for the award of the degree (vide section 8 supra)having passed all the courses of study of semesters 1 to 6 within a maximum period of

eight consecutive semesters after commencement of his /her study and securing a CGPAof 6.50 and above shall be declared to have passed in First Class. Further, theauthorized break of study (vide section 11 infra) will not be counted for the purpose ofclassification.

iii) Second Class: All other candidates who qualify for the award of the degree shall bedeclared to have passed in Second Class.

10. WITHDRAWAL FROM EXAMINATION

i) A candidate may, for valid reasons, be granted permission to withdraw from appearing forthe examination in any course or courses of one semester examination. Also, only one

application for withdrawal is permitted for that semester examination in which withdrawal issought.

ii) Withdrawal application shall be valid only if the candidate is otherwise eligible to write theexamination and if it is made prior to the commencement of the examination in that courseor courses and also recommended by the Head of the Department.

11. TEMPORARY BREAK OF STUDY FROM THE PROGRAMME

i) A candidate is not normally permitted to temporarily break the study. However, if acandidate intends to temporarily discontinue the programme in the middle for valid reasons

6


7/43

(such as accident or hospitalization due to prolonged ill health) and to rejoin theprogramme in a later respective semester, he/she shall apply to the Principal through theHead of the Department and stating the reasons therefore.

ii) A candidate is permitted to rejoin the programme at the respective semester as and when itis offered after the break subject to the approval of Director of Technical Education and

Anna University of Technology, Coimbatore.

iii) The duration specified for passing all the courses for the purpose of classification (videsections 9(i) and (ii) supra) shall be increased by the period of such break of studypermitted.

iv) The total period for completion of the programme reckoned from, the commencement ofthe semester to which the candidate was first admitted shall not exceed the maximumperiod specified in section 2 (ii) supra irrespective of the period of break of study in orderthat he/she may be qualified for the award of the degree.

v) If any candidate is detained for want of requisite attendance, progress and conduct, theperiod spent in that semester shall not be considered as permitted 'Break of Study' andsection 11 (iii) supra is not applicable for such case.

12. MCA COURSES OF STUDY AND SCHEME OF ASSESSMENT(Minimum Credits to be earned

-141)__________________________________________________________________________________________________

Hours/WeekMaximum Mark

__________________________________________Code No. Course Lecture Tutorial Practical Credit CA FETotal

__________________________________________________________________________________________________

SEMESTER 1THEORY

11MX11 ACCOUNTING AND FINANCIALMANAGEMENT

4 0 0 4 50 50 100

11MX12 PRINCIPLES OF PROGRAMMINGLANGUAGES

4 0 0 4 50 50 100

11MX13 DISCRETE STRUCTURES4 0 0 4 50 50 100

11MX14 DATA STRUCTURES4 0 0 4 50 50 100

11MX15 COMPUTER SYSTEMARCHITECTURE

4 0 0 4 50 50 100

PRACTICAL

11MX16 PROGRAMMING LANGUAGESLABORATORY

0 0 2 1 100 - 100

11MX17 BUSINESS APPLICATIONSDEVELOPMENT LABORATORY

1 0 4 3 100 - 100

11MX18 DATA STRUCTURES LABORATORY 0 0 4 2 100 - 100

Total

7


8/43

21 0 10 26

SEMESTER 2THEORY

11MX21 MICROPROCESSOR AND ITSAPPLICATIONS

3 0 2 4 50 50 100

11MX22 OBJECT ORIENTEDPROGRAMMING

4 0 0 4 50 50 100

11MX23 ADVANCED DATA STRUCTURESAND ALGORITHMS

3 0 2 4 50 50 100

11MX24 DATABASE MANAGEMENTSYSTEM

4 0 0 4 50 50 100

11MX25 PROBABILITY AND STATISTICS 4 0 0 4 50 50 100

PRACTICAL

11MX26 OBJECT ORIENTEDPROGRAMMING LABORATORY

0 0 3 2 100 - 100

11MX27 RDBMS LABORATORY0 0 4 2 100 - 100

11MX28 PROFESSIONAL COMMUNICATION0 0 2 1 100 - 100

18 0 13 25

____________________________________________________________________________________________________

Hours/Week Maximum Mark______________________

______________________Code No. Course Lecture Tutorial Practical Credit CA FETotal

____________________________________________________________________________________________________

SEMESTER 3THEORY

11MX31 OPTIMIZATION TECHNIQUES 4 0 0 4 50 50 100

11MX32 OPERATING SYSTEMS 3 0 2 4 50 50 100

11MX33 SOFTWARE ENGINEERING4 0 0 4 50 50 100

11MX34 CLIENT INTENSIVE OBJECTCOMPUTING

3 0 0 3 50 50 100

11MX35 SYSTEM SOFTWARE 4 0 0 4 50 50 100

PRACTICAL

11MX36 CLIENT INTENSIVE OBJECTCOMPUTING LABORATORY

0 0 3 2 100 - 100

11MX37 SOFTWARE ENGINEERINGLABORATORY

0 0 3 2 100 - 100

11MX38 SYSTEM SOFTWARELABORATORY

0 0 3 2 100 - 100

8


9/43

11MX39 MINI PROJECT I AND SEMINAR 2 0 0 2 100 -100

20 0 11 27

SEMESTER 4THEORY

11MX41 INTRA - ENTERPRISE COMPUTING4 0 0 4 50 50 100

11MX42 COMPUTER NETWORKSAND TCP / IP

4 0 0 4 50 50 100

11MX43 UNIX ARCHITECTURE ANDPROGRAMMING

4 0 0 4 50 50 100

11MX44 OBJECT ORIENTED ANALYSIS ANDDESIGN

3 0 2 4 50 50 100

11MX45 ELECTIVE - I

3 0 2 4 50 50 100

PRACTICAL

11MX46 INTRA - ENTERPRISECOMPUTING LABORATORY

0 0 3 2 100 - 100

11MX47 COMPUTER NETWORKS ANDTCP / IP LABORATORY

0 0 3 2 100 - 100

11MX48 UNIX SYSTEM PROGRAMMINGLABORATORY

0 0 3 2 100 - 100

18 0 13 26

____________________________________________________________________________________________________

Hours/Week Maximum Mark______________________

______________________Code No. Course Lecture Tutorial Practical Credit CA FETotal

____________________________________________________________________________________________________

SEMESTER 5THEORY

11MX51 DATA MINING3 0 0 3 50 50 100

11MX52 INTER - ENTERPRISE COMPUTING 3 0 0 3 50 50 100

11MX53 MOBILE COMPUTING 3 0 0 3 50 50 100

11MX54 ELECTIVE II 3 0 2 4 50 50 100

11MX55 ELECTIVE III 3 0 2 4 50 50 100

PRACTICAL

11MX56DATA MINING LABORATORY 0 0 3 2 100 - 100

11MX57INTER - ENTERPRISE COMPUTINGLABORATORY

0 0 3 2 100 - 100

9


10/43

11MX58MOBILE COMPUTINGLABORATORY

0 0 3 2 100 - 100

11MX59 MINI PROJECT II AND SEMINAR2 0 0 2 100 - 100

17 0 13 25

SEMESTER 6

PROJECT WORK AND DISSERTATION12 50 50 100

ELECTIVES:

11MX01 PRINCIPLES OF MANAGEMENT

11MX02 SOFT COMPUTING

11MX03 ADVANCED DATABASE MANAGEMENT SYSTEM

11MX04 ARTIFICIAL INTELLIGENCE

11MX05 INTELLIGENT INFORMATION RETRIEVAL

11MX06 HUMAN COMPUTER INTERACTION

11MX07 COMPUTER GRAPHICS

11MX08 CRYPTOGRAPHY

11MX09 OPEN SOURCE SYSTEMS

11MX0A XML AND ITS APPLICATIONS

11MX0B MULTIMEDIA COMMUNICATION SYSTEMS

11MX0C INFORMATION STORAGE AND MANAGEMENT

11MX0D KNOWLEDGE MANAGEMENT

10


11/43

11MX0E INFORMATION LIFE CYCLE MANAGEMENT

11MX0F SEMANTIC WEB11MX0G APPLIED GRAPH THEORY11MX0H TEXT MINING

11MX0I CLOUD COMPUTING

11MX0J SECURITY IN COMPUTING

11MX0K PERVASIVE COMPUTING

11MX0L NETWORK MANAGEMENT

11MX0M SOFTWARE PROJECT MANAGEMENT AND QUALITY ASSURANCE

11XK01 CREATIVITY AND INNOVATION IN SOFTWARE PROBLEM SOLVING AND DESIGN

10 0 15 1

Theory*

An Exploration of software creativity-Discipline Vs Flexibility- Formal methods Vs Heuristics Qualitative Vs Quantitative

reasoning- Process Vs Product- Theory Vs Practice (10)

Reference Book

Robert L. Glass, Tom DeMarco, Software Creativity 2.0, developer.* Books, Georgia, 2006

*Seminars/ Guest lecturers / Industrial presentations

Project(15)

11MX11 ACCOUNTING AND FINANCIAL MANAGEMENT4 0 0 4

COST ACCOUNTING:

Cost classification Types of costs - Inventory Records & Procedures - Significance of overheadCost - Preparation of Cost sheet & Machine Hour Rate Calculation - Concept of cost volume profit analysis - Concept ofvariance - Cost control Techniques - Principles of Job Costing, batch costing , Process costing , operating costing and

Activity Based Costing.(12)

FINANCIAL ACCOUNTING: Concepts and Conventions- Double Entry Book keeping -- Books of Accounts- Preparation ofJournals, Ledger, Trial Balance, Profit and Loss Account and Balance sheet - simple problems - Methods of depreciation-

An outline of Accounts of Non-Profit making organizations.(15)

FINANCIAL RATIO ANALYSIS: Uses and Nature - preparation of Liquidity Ratios - coverage Ratios and profitabilityRatios from profit & Loss Account and Balance sheet.

(8)

11


12/43


13/43

5. Al Kelley and Ira Pohl, A Book on C Pearson Education, 2008.

11MX13 DISCRETE STRUCTURES4

0 0 4

SET THEORY: Set notation and description - basic set operations - Venn diagrams - laws of set theory - partition - minsets- Principle of inclusion and exclusion.

(6)

LOGIC: Propositions - logical operators - truth tables - normal forms - laws of logic - proofs in propositional calculus Predicates variables Quantifiers Standard Forms Inference in Predicate calculus Mathematical induction.

(13)FUNCTIONS AND RELATIONS: Injective, Surjective, Bijective functions - composition, identity, inverse; Relations -properties of relations - closure operations on relations.

(6)FORMAL LANGUAGES: Four classes of grammars (Phrase Structure, Context sensitive, Context Free, Regular) -definitions - Context free Grammar : Right most , Left most derivations Syntax trees Unambiguity, ambiguity Construction of grammars for languages Derivation of languages from grammars.

(8)FINITE AUTOMATA: Definition of deterministic finite state automaton (DFA), Non deterministic finite state automaton(NFA) - equivalence of DFA and NFA - Equivalence of regular grammars and finite automata.

(9)PUSH DOWN AUTOMATA (PDA): Informal description - definition - Deterministic PDA - Equivalence of acceptance byfinal state and empty stack - Equivalence of PDA's and Context Free languages.

(8)TURING MACHINE (TM): Introduction - Construction of simple Turing Machines - Universal TM - Halting Problem.(6)Total 56REFERENCES

1. Kenneth H Rosen, Discrete Mathematics and its Applications, Tata McGraw Hill, 2007.2. Judith L. Gersting, Mathematical structures for computer science, W.H.Freeman, 20063.

Bernard Kolman, Robert C. Busby and Sharon Ross, Discrete Mathematical Structures, Prentice Hall, 2008.

4. Peter Linz, An introduction to formal languages and automata, Jones & Bartlett, 20065.

John .E. Hopcroft, Rajeev Motwani, and Jeffrey D.Ullman, Introduction to Automata Theory, Languages and

Computation, Addison-Wesley/Pearson, 2006.6.

John C. Martin, Introduction to Languages and the Theory of Computation, Tata McGraw Hill, 2003.

11MX14 DATA STRUCTURES 4 0 0

4

INTRODUCTION: Data structures - Abstract data Types - Primitive data structures - Analysis of algorithms(6)ARRAYS: Operations - representation of one, two, three and multi dimensioned arrays Applications.(4) STRINGS: Implementation - operations - Applications

RECORDS: Implementation of variant records(4)

STACKS: Operations - implementation - Applications: Recursion handling; Parentheses matching; Evaluation ofexpressions.

(6)QUEUES: Operations - sequential implementation Circular Queues-Priority Queues - Dequeues - Applications.

(5)LISTS: Insertion and deletion of nodes - Singly linked lists, Doubly linked lists, Circular lists, Multiply linked lists - Linked

stacks - Linked queues- Applications: Addition of Polynomials; Sparse Matrix representation.(12)

TREES: Terminologies Implementation.

BINARY TREE: Properties - sequential and linked representation - binary tree traversals - Expression trees - Threadedtrees

(7)

SORTING: Insertion Sort, Selection Sort, Shell Sort, Bubble Sort, Quick Sort, Heap Sort, Merge Sort, Radix Sort Algorithms -Analysis.

(8)TABLES : Introduction - Operations- Hash Table: Hash functions, Implementation, Overflow handling techniques, LinearOpen Addressing, Chaining, Successful and unsuccessful searches.

13


14/43

(4) Total 56

REFERENCES

1. Aaron M Tanenbaum, Moshe J Augenstein and Yedidyah Langsam, "Data structures using C and C++ ", PHI Learning ,2009. .

2. Sahni Sartaj, "Data Structures, Algorithms and Applications in C++", Silicon Press, 2005.3 Mark Allen Weiss , Data Structures and Algorithm Analysis in C, Pearson Education, 2006.4. Vijayalakshmi Pai G.A, Data Structures and Algorithms: Concepts Techniques and Applications, Mc Graw Hill, 2009.

11MX15 COMPUTER SYSTEM ARCHITECTURE4

0 0 4

DIGITAL LOGIC CIRCUIT : Digital computer - Logic gates - Boolean Algebra - Simplification of Boolean functions :Boolean laws and postulates, Karnaughs Map method(6)COMBINATIONAL CIRCUITS : Half-Adder, Full-Adder Subtractor - Design of Combinational Circuits

SEQUENTIAL CIRCUITS : Basic concepts: Clocks - Flip-Flops : SR-F/F, D-F/F, JK-F/F, T-F/F, Excitation Tables-characteristic equation Edge-triggered Flip-flop

(4)DIGITAL COMPONENTS: Integrated Circuits Decoders Encoders Multiplexers DeMultiplexers Registers Register with Parallel load Shift registers: Its types - Bidirectional shift register with parallel load Asynchronous Up-down

counters - Design of synchronous counters. (4)DATA FORMATS : Introduction - Number Systems Number Bases Arithmetic Number Base conversion -

Alphanumeric character data Multimedia data formats pictures, videos, audios Other Binary codes.(4)

Internal Computer Data formats - Representing Integer Data Complements (r-1)s , rs - Fixed and Floating Pointrepresentation Floating Point Representation :Format , Normalization , Arithmetic operation IEEE 754 format PackedDecimal Format.

(4)REGISTER TRANSFER AND MICROOPERATIONS : Bus and Memory Transfer - Tri-state buffers - Arithmetic, Logic,Shift Micro-operations Arithmetic Logic Shift Unit

(4)A BASIC COMPUTER DESIGN : Stored Program Organisation - Timing and Control : Instruction Cycle - Memory ReferenceInstructions Input-Output and interrupt cycle Design of basic computer Control Unit : Design of Hardwired Control Unit

Introduction to Microprogrammed Control Unit.

(10)

CPU ORGANISATION : General Register Organisation Stack Organisation - Instruction formats Types of Interrupts RISC - Parallel Processing Pipelining Array Processors Superscalar Processors - Fault tolerance Evaluating thePerformance of a processor.

(6)INPUT AND OUTPUT ORGRANISATION : Input and Output interface Asynchronous Data transfer Modes of Transfer DMA I/O processor.

(6)MEMORY ORGANISATION : Types of Memory - Memory Hierarchy- Main Memory- Associative Memory - Cache Memory:Cache mapping schemes Replacement Policies Access time and Hit ratio Cache write Polices Cache write and miss.

(8)

Total 56REFERENCES

1. Morris Mano M, Computer System Architecture, Prentice Hall of India Pvt Ltd.,2003.2. Malvino A.P and Donald P.Leach, Digital Principles and Applications, Tata McGrawHill, 2002..3. John P. Hayes, Computer Architecture and Organization, McGraw Hill, 2003.4. William Stallings, Computer Organisation and Architecture : Designing for Performance, Prentice Hall , 2001.

11MX16 PROGRAMMING LANGUAGES LABORATORY 0 0 2 1

1. Simple programs to understand the concepts of data types.

14


15/43

2. Familiarizing conditional, control and repetition statements

3. Usage of single and multi dimensional arrays including storage operation

4. Implementation of functions, recursive functions

5. Defining and handling structures, array of structures and union

6. Implementation of pointers, operation on pointers and dynamic storage allocation

7. Creating and processing data files.

8. Creation of multi-file software and header file creation.

9. Familiarizing of C on Host and non-host environment and embedded programming.

Total 28

11MX17 BUSINESS APPLICATIONS DEVELOPMENT LAB(COBOL and Visual Basic)

1 0 4 3COBOL PROGRAMMING

INTRODUCTION TO COBOL: Introduction to COBOL language fundamentals - Designing Structured Programs - ProgramDevelopment Process - Designing COBOL Programs - Syntax and Margin Rules - COBOL Divisions and Coding - DeclaringVariables -Working Storage Fields Elementary and Group Data Items Level Numbers Conditional Names - FormattingOutput.

(4)

DESIGNING STRUCTURED PROGRAMS: Program Control - Sequence, Selection, Iteration and Case Structures -Paragraph Processing - Loops and Control - Conditional Loops - Declaring and Using Arrays Multi-Dimensional Arrays -Indexing Arrays Searching Arrays - Character Handling.

(6)

BASIC FILE PROCESSING: OPEN, Record, and CLOSE Processing Physical / Logical File Descriptions - Printing, andDisplaying Output - Sequential File Processing Sorting and Merging Indexed File Processing Screen Section.

(5)

REFERENCES

1. M.K.Roy and D.Ghosh Dastidar, COBOL Programming, Tata McGraw Hill, 2008.2. Nancy Stern and Robert A.Stern, Structured COBOL Programming, John Wiley & Sons, 2007.3. Andrew S. Philippakis, Leonard J. Kazmier, Comprehensive Cobol,Tata McGraw Hill, 1991.4. Harvey M. Deitel, Paul J. Deitel, T. R. Nieto, Visual Basic 6: How to Program, Prentice Hall PTR, 2002.

5. Eric A. Smith, Valor Whisler, Hank Marquis, Visual Basic 6: Programming Bible, John Wiley & Sons, 2009.COBOL Problems include but not limited to;

1. Implementation of simple and multiple table handling operations using PERFORM verb.2. Indexing a table and perform search operation using SET and SEARCH verbs.3. Sorting tables.4. Creation and processing of simple sequential files (fixed length records).5. MERGE AND SORT sequential files.6. Creating and processing indexed sequential and relative files.

Visual Basic:Problems include but not limited to1. University Course Registration System2. Hospital Management System3. Library Management System4. Student Information System5. Ticket Reservation System

11MX18 DATA STRUCTURES LABORATORY0 0 4 2

Implementation of the following problems:

1. Various types of Matrices and operations

15


16/43

2. Library of string operations

3. Set operations

4. An appropriate illustration using Records and Variant records

5. Stacks : Operations and applications

6. Queues : Operations and applications.

7. Linked Lists: Singly linked, Doubly linked and Circular lists

8. Binary trees and Threaded trees

9. Hash Table

70

11MX21 MICROPROCESSOR AND ITS APPLICATIONS3

0 2 4

EVOLUTION OF MICROPROCESSORS: 8 bit, 16 bit, 32 bit, 64 bit processors salient features Example ofmicroprocessor based system.

CPU STRUCTURE AND FUNCTION : Processor Organisation Instruction cycle instruction pipelining-Branch Prediction.(4)

INTERNAL AND EXTERNAL ORGANISATION OF 8086 CPU : BIU , EU Purpose of various signals Construction ofMachine code - Memory design of 8086 and 8088 microprocessors.

(4)ASSEMBLY LANGUAGE PROGRAMMING : Format Assembler Directives Instruction - Classification of instructions Programs to implement arithmetic.

(8)STRING MANIPULATION: Instructions Illustrative Examples Subroutines-Macros and procedures - Interrupt Handling ISR Programs(12)

INPUT/OUTPUT SECTION ISSUES: I/O mapped I/O, Memory mapped I/O Interrupt driven I/O Direct Memory Accesscontrollers Programmable Interrupt Controller programmable peripheral interface(6)

ADVANCED MICROPROCESSORS: Comparison of 286,386,486 processors Memory paging mechanism Features ofPentium processors its main functional units

(6)RISC PROCESSORS: Instruction characteristics RISC pipelining RISC versus CISC - Superscalar processors

Overview - Power PC - Salient features of Power PC.(2)

Total 42REFERENCES

1. Barry B. Brey, The Intel Microprocessors 8086/8088,8.186/80188,80286, 80386, 80486 and Pentium, Pentium II,Pentium III, Pentium IV Architecture, programming and interfacing based personal computers, Prentice Hall ofIndia, 2008.

2. Douglas V.Hall, Microprocessors and interface Programming and Hardware, Tata McGraw Hill, 2002.3 Peter Abel, IBM PC Assembly Language & Programming , Prentice Hall, 2006.4. Barry B. Brey, Programming the 80286, 80386, 80486 and Pentium based Computers, Prentice Hall of India, 2004.

11MXW22 OBJECT ORIENTED PROGRAMMING4 0 0 4

PRINCIPLES OF OBJECT ORIENTED PROGRAMMING: Software crisis Software Evolution - Procedure OrientedProgramming -

16


17/43

Object Oriented Programming Paradigm - Basic Concepts and Benefits of OOP - Object Oriented Programming Language -Application of OOP - Structure of C++ - Tokens, Expressions and Control Structures - Operators in C++ - Manipulators.

(8)FUNCTIONS IN C++: Function Prototyping - Call by Reference - Return by reference - Inline functions - Default, Const

Arguments -Function - Overloading - Friend and Virtual Functions - Classes and Objects - Member functions - Nesting of Memberfunctions- Private member functions - Memory allocation for Objects - Static data members - Static Member Functions - Arrays ofObjects- Objects as Function Arguments - Friend Functions - Returning Objects - Const Member functions - Pointers to Members.

(12)CONSTRUCTORS: Parameterized Constructors - Multiple Constructors in a Class - Constructors with Default Arguments -DynamicInitialization of Objects - Copy and Dynamic Constructors Destructors overloading - Overloading Unary and BinaryOperators -Overloading Binary Operators using Friend functions.

(10)

HERITANCE: Defining Derived Classes - Single Inheritance - Making a Private Member Inheritable - Multiple Inheritance Hierarchical Inheritance - Hybrid Inheritance - Virtual Base Classes - Abstract Classes - Constructors in Derived Classes -Member Classes - Nesting of Classes.

(10)

POLYMORPHISM: Introduction to Compile and Run Time Polymorphism(5)

TEMPLATES & EXCEPTION HANDLING: Introduction to Templates, Generic Functions and Generic Classes Exception

Handling Examples.(5)

STREAMS: String I/O -Character I/O - Object I/O - I/O with multiple Objects - File pointers - Disk I/O with member functions(6)

Total 56

REFERENCES

1. Bjarne Stroustrup, The C++ Programming Language, Addison Wesley, 2004.2. Stanley B Lippman, Josee Lajoie, The C++ Primer, Addison Wesley, 2005.3. Harvey M. Deitel,and Paul J. Deitel, C++ How to Program, Prentice Hall, 2007

11MX23 ADVANCED DATA STRUCTURES AND ALGORITHMS

3 0 2 4

INTODUCTION: Algorithms: Structure, properties analysis of iterative and recursive algorithms best case, worst case,average case complexities- Notations

(4)

BINARY SEARCH TREES: Operations: Insert, delete, search implementation-Analysis. (3)AVL TREES : Definition Height searching insert, delete operations- AVL rotations Examples.(5)

MULTI-WAY SEARCH TREES : m-way search trees B-Tree B+ trees - Tries Operations: Insert, delete, retrieve-

Examples.(7)

GRAPHS : Definition terminologies- Representations: Adjacency matrix, Adjacency list, Graph search methods:Breadth first Search; Depth first Search.

(5)

DIVIDE AND CONQUER : Method Examples Merge sort, Binary Search -Analysis (4)

GREEDY METHOD : Method Examples Minimum cost spanning tree, Kruskals algorithm, Prims algorithm.(4)

DYNAMIC PROGRAMMING: Method Examples All pairs shortest path problem Traveling salesman problem.(4)

17


18/43

BACK TRACKING: Method Examples Eight queens problem, Hamiltonian Cycles(3)

NP-HARD, NP-COMPLETE CLASSES: Basic concepts Non deterministic algorithms Satisfiability problem NP-hardand NP-complete Problems Cooks theorem (informal proof).(3)

Total 42

REFERENCES

1. ,Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein Introduction to Algorithms ,The MIT Press, 2009.

2. Vijayalakshmi Pai G.A, Data Structures and Algorithms: Concepts, Techniques and Applications, Tata Mc Graw Hill. ,20093. Horowitz Ellis, Sartaj Sahni and Sanguthevar Rajasekaran, Computer Algorithms/C++, Orient Black Swan, 2008.4. Horowitz Ellis and Sartaj Sahni, Fundamental of Computer Algorithms, Galgotia publications, 2004.5. Sartaj Sahni, Data Structures, Algorithms and Application in C++, Orient Longman, 2000.

11MX24 DATABASE MANAGEMENT SYSTEM

4 0 04

BASIC CONCEPTS: Introduction to databases Conventional file Processing Data Modeling for a database Threelevel architecture Data Independence Components of a Database Management System (DBMS) Advantages anddisadvantages of a DBMS.

(8)DATA MODELS : Introduction Data Associations entities, attributes, relationships Entity relationship data models(ERD) Generalization Aggregation Conversion of ERD into tables applications Introduction to Network data modeland Hierarchical data model.

(9)RELATIONAL MODEL: Introduction Relational databases Relational algebra Relational algebra queries Relationalcalculus: Tuple Relational calculus, Domain relational calculus Queries in Relational calculus.

(8)Relational database manipulation Structured Query Language (SQL) - Basic data retrieval Condition specification - SQLJoin views and update Data manipulation on relation with advanced Data types.

(8)DATA BASE DESIGN THEORY: Functional dependencies axioms Normal forms based on primary keys SecondNormal form, Third Normal form, Boyce Codd Normal form examples. Multi-valued dependencies Fourth Normal form

Data base design process Database Tuning.

Introduction to Transaction Processing.(9)

FILE ORGANIZATION : Storage device characteristics constituents of a file Serial files Sequential files IndexSequential files Direct files Secondary key retrieval Indexing using Tree structures.

(8)

DATABASE SECURITY, INTEGRITY AND CONCURRENCY CONTROL: Security and Integrity threats Defensemechanisms Distributed databases.(7)

Total 56

REFERENCES

1. Elmasri R and Navathe S.B, Fundamentals of Database Systems, Pearson Education, 2009.2. Silberschatz A., Korth H and Sudarshan S., Database System Concepts, McGraw Hill, 2006.3. Raghu Ramakrishnan and Johannes Gehrke, Database Management System, McGraw Hill, 2003.4. Thomas Condly, Carolyn Begg, Database System Pearson Eduction, 2003.

11MX25 PROBABILITY AND STATISTICS4 0 0 4

18
http://mitpress.mit.edu/catalog/author/default.asp?aid=344http://mitpress.mit.edu/catalog/author/default.asp?aid=344http://mitpress.mit.edu/catalog/author/default.asp?aid=345http://mitpress.mit.edu/catalog/author/default.asp?aid=345http://mitpress.mit.edu/catalog/author/default.asp?aid=346http://mitpress.mit.edu/catalog/author/default.asp?aid=346http://mitpress.mit.edu/catalog/author/default.asp?aid=346http://mitpress.mit.edu/catalog/author/default.asp?aid=13714http://mitpress.mit.edu/catalog/author/default.asp?aid=13714http://mitpress.mit.edu/catalog/author/default.asp?aid=344http://mitpress.mit.edu/catalog/author/default.asp?aid=345http://mitpress.mit.edu/catalog/author/default.asp?aid=346http://mitpress.mit.edu/catalog/author/default.asp?aid=13714


19/43

PROBABILITY:Axiomatic approach to Probability, law of addition & Multiplication of probability, Bayes theorem.(5)

RANDOM VARIABLES : Probability distribution functions - Joint distribution Functions - Marginal distributions -Conditional distributions - Moment generating functions, Expectation, variance.(7)

PROBABILITY DISTRIBUTIONS: Multinomial, Binomial, Poisson, Geometric, Uniform, Exponential, Normal Distributions.(11)

CORRELATON : Types of Correlation - Multiple and Partial Correlation Linear Regression

(5)ESTIMATION: Point Estimation - characteristics of estimation - interval estimation -interval estimates of mean, standarddeviation, proportion, difference in means and ratios of standard deviations.

(5)TESTING OF HYPOTHESIS: Large sample tests - tests for means, variances and proportions, Small sample test basedont, F, Chi- square distributions .

(8)

ANALYSIS OF VARIANCE: Design of Experiments CRD, RBD Models and Latin Square design.(5)TIME SERIES ANALYSIS : Components of Time series - Measurement of trend - Linear and second degree parabola.

(5)

STATISTICAL QUALITY CONTROL: Statistical basis for control charts, control limits. Control charts for variables -,X R

charts. Charts for defectives p and np charts. Chart for defects C chart.

(5)

Total 56

REFERENCES

1. Dale H Besterfield, Quality Control, Prentice-Hall, 2008.2. Ronald E.Walpole, Raymond H.Myers, Sharon L.Myers and Keying Ye, Probability & Statistics for Engineers &

Scientists, Pearson Education, 2006.3. Arnold O. Allen, Probability, Statistics and Queueing Theory with Computer Science Applications, Academic Press,20054. Trivedi K.S., Probability & Statistics with Reliability, Queueing and Computer Applications, John Wiley and sons,2001.5. Sheldon M.Ross, Probability Models, Academic Press, 2006.6. Douglas C. Montgomery Lynwood A. Johnson , Forecasting and Time Series Analysis, McGraw Hill, 1990.7. Richard Johnson, Irwin Miller, John Freund Probability and Statistics for Engineers Pearson Education , 2004.

11MX26 OBJECT ORIENTED PROGRAMMING LABORATORY 0 0 3 2

1. Arithmetic operations using array of objects and dynamic data members.

2. Creation of a class having read-only member function and processing the objects of that class.

3. Creation of a class which keeps track of the member of its instances. Usage of static data member, constructor and

destructor to maintain updated information about active objects.

4. Illustration of a data structure using dynamic objects.

5. Usage of static member to count the number of instances of a class.

6. Illustration for the need of default arguments.

7. Usage of a function to perform the same operation on more than one data type.

8. Creation of a class with generic data member.

9. Overloading the operators to do arithmetic operations on objects.

10. Acquisition of the features of an existing class and creation of a new class with added features in it.

11. Implementation of run time polymorphism.

12. Overloading stream operators and creation of user manipulators.

13. Implementation of derived class which has direct access to both its own members and the public members of the base

class.

14. Implementation of Streams to store and maintain Library system, with the features of Book Issue and Book Return.

Total 70

11MX27 RDBMS LABORATORY

19


20/43

00 4 2

1. Table designing with related queries.

2. Database designing with constraints fori. functional dependencyii. referential integrityiii. multi-valued dependency

3. Creation of views for a table.

4. Definition of triggers to handle anamolies.

5. Imposing restrictions on queries for security reasons.

Package :Creation of a package by effectively using all the facilities existing in RDBMS.

Total 70

11MX28 PROFESSIONAL COMMUNICATION0 0

2 1

READING COMPREHENSION: Reading for Critical purposes(2)

SCIENTIFIC STYLE: clarity simplicity exactness brevity unity coherence objectivity. Formal and Informal Writing.(4)Presentation Skills

(2)Introduction to soft skills

(1)Interpersonal Intrapersonal Communication

(2)Meetings

(2)Professional Report Writing

(3)Professional Values and Ethics Workshop

(4)

PRACTICALS(8)

Short speechesGroup DiscussionsMeetings

Total : 28

TEXTBOOK:Teaching Material prepared by the Faculty, Department of English.

REFERENCES

1. Rodney Huddleston and Geoffrey K. Pullam., A student s Introduction to English Grammar, Cambridge UniversityPress.

U.K. 2005.2. Bert Decker, The Art of Communicating . Decker Communications, Inc., USA 2004.3. Meenakshi Raman and Sangeeta Sharma, Technical Communication Principles and Practice, Oxford UniversityPress,

UK 2004.4. Dr. AjayRai, Effective English for Engineers and Technologies : Reading, Writing & Speaking, Crest Publishing

House,New Delhi 2003.

20


21/43

5. Paul V. Anderson, Technical Communication: A Reader centered Approach, Asia Pvt. Ltd., Singapore, 2003.6. Albert Joseph, Writing Process 2000, Prentice Hall, New Jersey.

11MX31 OPTIMIZATION TECHNIQUES4 0 0 4

INTRODUCTION : Statement of an optimization problems classification of optimization problem classical optimizationtechniques : Single variable optimizations, Multi variable optimization, equality constraints, Inequality constraints, No

constraints. (4)LINEAR PROGRAMMING: Graphical method for two dimensional problems central problems of Linear Programming Definitions Simplex Algorithm Phase I and Phase II of Simplex Method Revised Simplex Method - SimplexMultipliers Dual and Primal Dual Simplex Method Sensitivity Analysis Transportation problem and its solution

Assignment problem and its solution by Hungarian method Karmakars method statement, Conversion of the LinearProgramming problem into the required form, Algorithm.

(15)NON LINEAR PROGRAMMING (ONE DIMENSIONAL MINIMIZATION): Introduction Unrestricted search Exhaustivesearch Interval halving method Fibonacci method.

(5)NON LINEAR PROGRAMMING : (UNCONSTRAINED OPTIMIZATION): Introduction Uni-variate method Patternsearch methods Hooke and Jeeves method, Powells method-Simplex method Gradient of a function steepest descentmethod Conjugate gradient method.

(7)NON LINEAR PROGRAMMING (CONSTRAINED OPTIMIZATION): Introduction Characteristics of the problem Random search methods Complex method.

(5)NONTRADITIONAL OPTIMIZATION ALGORITHMS: Genetic Algorithm Working Principle Differences between GAand traditional method Similarities between GA and traditional methods GA for constrained Optimization Other GAoperators - Real coded GA.

(10)DYNAMIC PROGRAMMING: Introduction multistage decision processes Principles of optimality Computationprocedures.

(5)DECISION MAKING: Decisions under uncertainty, under certainty and under risk Decision trees Expected value ofperfect information and imperfect information.

(5)

Total 56REFERENCES1. Kalyanmoy Deb, Optimization for Engineering Design Algorithms and Examples, PHI Learning, 2009.2. Singiresu. S.Rao, Engineering Optimization Theory and Practice, New Age International,2006

3. Hillier / Lieberman, Introduction to Operations Research, Tata McGraw Hill , 2005.4. Hamdy A Taha , Operations Research An introduction, Pearson Education , 2002.5. Mik Misniewski, Quantitative Methods for Decision makers, Mac Millian Press, 1994.6. Kambo N.S., Mathematical Programming Techniques, Affiliated East West Press, 1991.

11MX32 OPERATING SYSTEMS3 0 2 4

INTRODUCTION: Operating Systems Objectives and Functions Evolution of Operating Systems Structure of OperatingSystem.

(2)

MEMORY MANAGEMENT: Memory hierarchy Linking and Loading the process Memory Management requirement-Fixed partitioning - Dynamic partitioning Buddy Systems Simple paging Multilevel paging Inverted paging Simple

Segmentation segmentation and paging.(6)

VIRTUAL MEMORY MANAGEMENT: Need for Virtual Memory management Demand Paging - Page Fault Routine Demand Segmentation Combined demand segmentation and paging - Operating systems policies.

(5)PROCESS DESCRIPTION AND CONTROL: Process Creation - Process states Process Description Process Control.

(5)PROCESS AND THREADS: Relationship between process and threads Thread State Thread Synchronization Typesof Thread.

(2)PROCESS SYNCHRONIZATION: Concurrent Process Principles of Concurrency Mutual Exclusion Software support Hardware Support Operating System Support -Deadlock - Deadlock Prevention, Avoidance and Detection and recovery.

(5)

21


22/43

PROCESS SCHEDULING: Types of Scheduling Scheduling Criteria Scheduling Algorithms.(4)

I/O MANAGEMENT AND DISK SCHEDULING: Organization of I/O function Evolution of I/O function Types of I/Odevices Logical Structure of I/O functions I/O Buffering Disk I/O Disk Scheduling algorithms Disk Cache.

(3)FILE MANAGEMENT: Files File management Systems File System Architecture Functions of File Management FileDirectories Secondary Storage Management File Allocation.

(4)CASE STUDIES: Windows 2000, Linux, Unix and Solaris.

(6)

Total 42

REFERENCES

1. Uresh Vahalia, Unix Internals, Pearson Education, 2010.2. Silberschatz. A, Galvin. P and Gagne.G, Operating System Concepts John Wiley, 2009.3. D. M. Dhamdhere, Operating Systems- A Concept based Approach, Tata McGraw Hill, 2008.4. William Stallings, Operating Systems:Internals and Design Principles, Prentice-Hall, 2008.5. Jim Mauro and Richard McDougall, Solaris Internals, Sun Microsystems, 2006.6. David A Solomon and Mark E Russinovich, Inside Microsoft Windows 2000 , WP Publishers, 2001.7. Charles Crowely, Operating System a Design Oriented Approach, Tata McGraw Hill, 2000.

11MX33 SOFTWARE ENGINEERING4 0 0 4

INTRODUCTION : Software Software Development - Types of software People involved in the Software Development -Software Engineering - Need for Software Engineering - Objectives and Benefits of Software Engineering - Factors thatinfluence Quality & Productivity Quality attributes - Software Process Models Software Engineering Practices

(8)

SOFTWARE PROJECT ESTIMATION: Observations on estimation project planning process Decomposition techniques-Empirical Estimation Models.

(4)

REQUIREMENTS ENGINEERING : Requirements Engineering tasks Requirements Engineering Process ElicitingRequirements Building Analysis models negotiating requirements validating requirements

(10)

DESIGN ENGINEERING: Design Process Design Concepts Design Model Modeling Architectural Design ModelingComponent Level Design User Interface Design Design Evaluation. (10)

SOFTWARE TESTING : Software Testing fundamentals Black-Box and White-Box testing Basis Path testing Requirements phase testing - Design phase testing - Program phase testing - Desk debugging and program peer view testtools - Evaluating test results - Installation phase testing - Acceptance testing Testing GUI Testing Web Applications

(12)TEST DOCUMENTATION: Reporting test results - Final test reporting - Evaluating test effectiveness - Use of testing metrics- Improving the test process.

(4)Debugging: The art of Debugging - Debugging process Debugging strategies (4)

Case Studies(4)

Total 56REFERENCES

1. Pressman R.S., Software Engineering A Practitioners Approach, Tata McGraw Hill , 2005.2. Shari Lawrence Pfleeger, Software Engineering Theory and Practice, Pearson Education , 20073. Ian Sommerville, Software Engineering, Addison Wesley, 2007.4. Pankaj Jalote, Integrated Approach to Software Engineering, Narosa Publishing House, 2006.

11MX34 CLIENT INTENSIVE OBJECT COMPUTING 3 0 0

3

22


23/43

INTRODUCTION TO CLIENT SIDE COMPUTING : Interface Environment GUI OOUI Event Driven Programming Validation

(3)INTRODUCTION TO OBJECT COMPUTING PLATFORMS : Java Virtual Machine, byte codes in java - .NET frame work Common Language Runtime Microsoft Intermediate Languages

(3)JAVA PROGRAMMING: Data Types - Operators - Control Structures - Arrays and Strings - Classes - Fundamentals -Methods - Constructors - Scope rules - this keyword - Inheritance-Reusability - Composing class - Method overloading -

Abstract classes - Virtual Functions.(4)

PACKAGES AND INTERFACES: Packages - Access protection - Importing packages - Interface - Defining andImplementing Interface - Applying Interface - Variables in Interfaces.

(4)

EXCEPTION HANDLING: Fundamentals - Exception types - Uncaught Exception - Using Try and Catch - Multiple catchclauses - Nested try statements - throw - throws - Java Built-in Exception - Creating user defined exceptions.

(4)

MULTI THREADED PROGRAMMING: Java thread model - Priorities - Synchronization - Messaging - Thread class andrunnable Interface - Main thread - Creating the Thread - Synchronization - Interthread Communication(5)

I/O, APPLETS: I/O basics - Stream - Stream Classes - Predefined stream - Reading/Writing console input - Appletfundamentals - GUI Components - Applets Swing.(5)

C#.NET PROGRAMMING: Class Object - Access specifier Inheritance Abstract class Delegates Exceptions Namespaces Interfaces(7)

SERIALIZATION AND MULTITHREADING: Serializing objects Deep serialization - Multithreading ReflectionAttributes - Indexers

(7)

Total 42

REFERENCES

1. Jesse Liberty, Programming C#, OReilly & Associates, 20102. Horstmann and Cornell, Core Java, Pearson Education, 2007.3. Herbert Schildt, "JAVA - The Complete Reference", Tata McGraw Hill, 2006.4. Ivor Horton, Beginning Java 2 JDK 5 Edition, Wiley Dreamtech India Ltd., 20045. Deitel and Deitel, "JAVA - How to Program", Prentice Hall International Inc, 2003.6. Stanley B. Lippman, C# Primer A Practical Approach, Pearson Education, 20027. Tom Archer and Andrew Whitechapel, Inside C#, Microsoft Press, 2002

11MX35 SYSTEM SOFTWARE4 0 0

4

ASSEMBLERS: Design of an Assembler data structures format of databases Pass I and Pass II phases(6)

MACRO LANGUAGE AND MACRO PROCESSORS: Macro instructions, features of a macro facility implementation.(7)

LOADERS : Loader schemes compile and go loaders , general load scheme absolute loaders direct linking loadersand their design. Other loading schemes : linking loaders, overlays, dynamic binders.

(5)COMPILERS : Introduction Structure of a compiler phases of a compiler - compiler writing tools.

(5)LEXICAL ANALYSIS : Role of a lexical analyzer finite automata regular expressions to finite automata minimizing thenumber of states of a deterministic finite automata implementation of a lexical analyzer symbol table management.

(7)PARSING TECHNIQUES : Context free grammars derivations and parse trees ambiguity capabilities of context freegrammars.

23


24/43

Top down and bottom up parsing: Shift reduce parsing Operator Precedence parsing Recursive descent parsing Predictive parsing.

(10)Automatic Parsing Techniques LR parsers canonical collection of LR (0) items construction of SLR parsing tables.

(4)

INTERMEDIATE CODE GENERATION: Postfix notation, Quadruples, triples , indirect triples Syntax directed translationschemes

(5)CODE OPTIMIZATION AND GENERATION: Code optimization techniques basic blocks DAG representation error

detection and recovery - code generation.(7)

Total 56

REFERENCES

1. John J. Donovan, Systems Programming, Tata Mc Graw Hill , 2009.2. Aho A.V.,Monica S, R.Sethi and Ullman J.D., Compilers Principles, Techniques and Tools, Addison Wesley, 2007.3. Dhamdhere D.M., Systems Programming and Operating Systems, Tata McGrawHill, 2006.4. Dhamdhere D.M., Compiler Construction , Macmillan Publishers India, 2000.

11MX36 CLIENT INTENSIVE OBJECT COMPUTING LABORATORY 0 0 3 2

1. Creation of a class which keeps track of the member of its instances. Usage of static data member, constructor and

destructor to maintain updated information about active objects.

2. Usage of static member to count the number of instances of a class.

3. Usage of a function to perform the same operation on more than one data type.

4. Creation of a class with generic data member.

5. Acquisition of the features of an existing class and creation of a new class with added features in it.

6. Implementation of run time polymorphism.

7. Designing a function to alarm, when an error occurs.

8. Implementation of derived class which has direct access to both its own members and the public members of the baseclass.

9. Implementation of Streams to store and maintain Library system, with the features of Book Issue and Book Return.

10. Conversion checking from one data type to another data type.

11. Implementation of Notepad with all basic features of Text Editor.

12. Implementation of delayed threads.

13. Checking the different alignments of various Layouts.Total 42

11MX37 SOFTWARE ENGINEERING LABORATORY0 0 3 2

1. Implementation of requirement analysis process using the appropriate tool

2. Implementation of Estimation Techniques

3. Preparation of Analysis models using appropriate tool.

4. Preparation of SRS document for a system.

5. Implement of suitable design using the appropriate tool.6. Preparation of Design document for the system considered in (2).

7. Writing of code following coding standards.

8. Automatic generation of code using appropriate tool

9. Testing the applications for unit testing

10. Testing the application for integrated testing

11. Testing application for load or volume testing

12. Implementation of debugging process using the appropriate tool

13. Using an appropriate tool for generate test cases/ test plan/ test documents

24


25/43

Total 42

11MX38 SYSTEM SOFTWARE LABORATORY 0

0 3 2

1. Design and Implementation of a Text Editor

2. Implementation of Transition diagrams for compiler design

3. Design and Implementation of a Symbol Table Manager

4. Implementation of a Lexical Analyzer (and a Symbol Table Manager)

5. Programming in LEX

6. Implementation of Bottom up Parsers: Shift Reduce parser

7. Implementation of Top down Parsers: Recursive descent Parser

8. Implementation of a Syntax Directed Translation Engines:

a. Simulate a Desk Calculator b. Generation of Postfix code.

9. Generation of quadruples for programming language statements

10. Design and Implementation of a Macro Processor

Total 42

11MX41 INTRA - ENTERPRISE COMPUTING

40 0 4

ENTERPRISE FOUNDATIONS: Enterprise software characteristics options - Enterprise Architectural overview - objectoriented software development for enterprise - Component Based software development for enterprise. Java EnterpriseSystem.

(5)ENTERPRISE DATA ENABLING: Enterprise Data - Basis of JDBC, Drivers, Connection, Statement, Result Set, AdvancedJDBC features, Distributed transactions . Other approaches for persistence.(10)

ENTERPRISE WEB ENABLING: Web Browsers and Web Servers in Enterprise. Web Programming Basis , Java Servlets -Java Server pages, JSTL. JSF, State and session management .(10)

ENTERPRISE APPLICATION ENABLING : Enterprise Java Beans, Stateless Session Beans, Stateful Session Beans,Message Driven Beans, Entity beans , Accessing and integrating EJBs.

(11)

DISTRIBUTED ENTERPRISE COMMUNICATIONS ENABLING: Distributed Enterprise Communications Basis distributedobject middleware synchronous and asynchronous Communications .(10)

CASE STUDIES: Development of Enterprise software for Hospital, University and manufacturing firm. Usage of popularframeworks for software development.(10)

Total 56

REFERENCES

1. KogenT Solutions Inc. Java Server Programming Dereamtech Press 2007.2. Eric Jendrock, Jennifer Ball, Debbie Carson, Ian Evans, Scott Fordin and Kim Haase The Java EE 5 Tutorial ,

Addison Wesley , 2006.3. Bill Burke and Richard Monson Haefel, Enterprise Java Beans 3.0 OReily, 2006.

4. Raghu R.Kodali, Jonathan R Wetherbee and Peter Zadrozny, Beginning EJB 3 Application Development, Apress,2006.5. Kito D.Mann, JavaServer Faces in Action, Manning, 2005.6. Dave Crane, Eric Pascarello and Darren Jame, Ajax in Action, Manning , 2006.7. Paul J Perrone, Venkata S.R. Krishna R and Chayanti, " Building Java Enterprise Systems with J2EE", Techmedia,20008. George Reese, Database programming, with JDBC and Java" , OReiliy , 2000.

11MX42 COMPUTER NETWORKS AND TCP/IP4 0 0 4

25


26/43

INTRODUCTION: Need and Classification of Computer Networks Network Topologies Network Applications OSIReference Model TCP/IP Model(4)

PHYSICAL LAYER : Transmission Media PSTN- Signal Characteristics - Digital and Analog Transmission Modems Parallel and Serial Transmission(6)

ERROR DETECTION AND CORRECTION : Types of Errors- Single Bit and Multiple bit errors- VRC LRC CRC-Checksum Hamming Code

(4)

DATA LINK CONTROL AND PROTOCOLS: Functions of DLL Stop and Wait ARQ Go-back-N ARQ- Selective RepeatARQ-Bit oriented Protocol PPP(6)

LOCAL AREA NETWORKS Devices: Repeaters, Hubs, Switches : L2,L3 - Introduction to IEEE Project802:Ethernet,Token Ring, FDDI-802.11(6)

Network Layer Internetworking devices - IP layer of TCP/IP and its functions - IP addressing Subnetting- classless IPaddresses-- ARP-RARP-ICMP - Routing in Internet - Intradomain routing Interdomain Routing RIP, OSPF, BGP IPSec.

(8)

TRANSPORT LAYER: Transport Services Elements of Transport Protocols - UDP - Connection oriented, Reliableservice TCP Connection establishment Connection Termination Data Transfer.

(8)

APPLICATION LAYER: Remote Login DNS FTP NAT SMTP-MIME Network Management Protocol: SNMP(10)

Total 56REFERENCES

1. Behrouz A Forouzan , "Data Communication and Networking", Mc Graw Hill, 2007.2. William Stallings, Data and Computer Communication, Prentice Hall, 20053. Behrouz A Forouzan, Sophia Chung Fegan, TCP/ IP Protocol Suite, Tata McGraw Hill, 20044. Tanenbaum A. S, "Computer Networks", Prentice Hall, 2003.5. Comer E, "Internetworking with TCP/IP, Principles Protocols and Architecture", Prentice Hall, 2001.

6. Hardy J K, "Inside Networks", Prentice Hall , 1999.

11MX43 UNIX ARCHITECTURE AND PROGRAMMING4 0 0 4

INTODUCTION TO UNIX : File System Essential Commands - General Purpose Utilities - Bourne Shell - Simple Filters Regular Expressions and grep - Advanced filters (sed, awk) - Process Commands - Communication and SchedulingCommands - Programming with Shell .

(16)SYSTEM STRUCTURE: Kernel architecture - Kernel data structure - Buffer Cache - Structure of Buffer pool - Scenariosfor buffer retrieval - Reading and Writing disk blocks - Advantages and Disadvantages of buffer cache - Inode - Structure ofregular file - Conversion of a pathname to an inode - Inode assignment to a new file - allocation of disk blocks.

(15)INTRODUCTION TO SYSTEM CALLS: Process states and transitions - Context of a process - Saving the context of aprocess - Manipulating Process address space - Process creation and termination - System Boot and INIT process -Process Scheduling.

(18)MEMORY MANAGEMENT: Swapping - Demand Paging - allocation of swap space - Data structures of demand paging -Page stealer Process -page aging and fault - Interprocess Communication

(7)Total 56

REFERENCES

1. Uresh Vahalia, "UNIX Internals:The New Frontiers", Pearson Education, 2009.2. Maurice J. Bauch, "Design of the UNIX Operating System", Prentice Hall, 2008.3. Sumitabha Das, Your Unix The Ultimate Guide, Tata McGraw Hill, 2008.4. Sumithabha Das, "Unix System V.4 - Concepts and Applications", Tata McGraw Hill , 2007.5. Keith Haviland and Dina Gray Unix System Programming , Addison Wesley, 1998

26


27/43

11MX44 OBJECT ORIENTED ANALYSIS AND DESIGN

3 0 2 4

INTRODUCTION: Introduction to Software Engineering Best practices in Software Engineering SSAD OOAD ObjectOriented Concepts.

(5)

OBJECT ORIENTED DESIGN METHODS: Booch method Object Modeling Technique Objectory method Fusionmethod Unified Modeling Language Unified process

(5)

SOFTWARE ARCHITECTURE: 4+1 View Model Views and UML Diagrams Patterns and Architecture.(5)

UNIFIED PROCESS: Structure Iterative and Incremental - Phases of the Unified Process Iterations Cycles Workflows Requirements workflow - Analysis workflow Design workflow Implementation workflow - Test workflow.

(10)

SOFTWARE PATTERNS: Reusable Software Definition Overview and Motivation Categories Pattern description.(2)

DESIGN PATTERNS: Creational Patterns: Abstract Factory Factory method Builder Prototype Singleton StructuralPatterns: Adapter Bridge Composite Decorator Faade Flyweight Proxy Behavioral Patterns: Command

Interpreter Iterator Mediator Memento Observer State Strategy Template method Visitor.(15)

Total 42

REFERENCES

1.Grady Booch , James Rumbaugh, Ivar Jacobson, Unified Modeling Language User Guide, Addison-Wesley

Professional, 2005.2.

Craig Larman, Applying UML and Patterns: An Introduction to Object-Oriented Analysis and Design and Iterative

Development, Prentice Hall, 2004.3.

Martin Fowler, Kendall Scott, UML Distilled: A Brief Guide to the Standard Object Modeling Language, Addison-

Wesley Professional, 2003.4. John Hunt, The Unified Process for Practitioners Object Oriented Design, UML and Java, Springer , 2000.5. Erich Gamma, Richard Helm, Ralph Johnson and John Vlissides, Design Patterns : Elements of Reusable Object

Oriented Software, Addison Wesley, 2006.

11MX46 INTRA - ENTERPRISE COMPUTING LABORATORY0 0 3 2

Study of multi-tier software environment.Study of web servers / web browserStudy of tools for enterprise software development and deployment

1. Package development using servlets / JSP2. Package development using remote objects with synchronous and asynchronous communication3. Package development using EJB4. Package development using frameworks like Struts, Hibernate and Spring.

Total 42

11MX47 COMPUTER NETWORKS AND TCP/IP LABORATORY0 0 3 2

1. Read a Binary string, and hence display the wave forms corresponding toa. NRZ-L and NRZ-I encodingb. Manchester and differential Manchester encoding

2. Read a Binary string, and hence display the waveforms corresponding toa. PSK with 4 different phasesb. PSK with 8 different phasesc. QAM with 4 phases and 2 Amplitudes

3. Read a 4 bit binary number and hence find the 7 bit Hamming code to facilitate a single bit error correction.4. Read a Binary string corresponding to the Message to be transmitted, and another binary string, corresponding to

generator Polynomial and hence generate the CRC check sum.

27
http://portal.acm.org/author_page.cfm?id=81100557878&coll=GUIDE&dl=GUIDE&trk=0&CFID=102161420&CFTOKEN=70779909http://portal.acm.org/author_page.cfm?id=81100637433&coll=GUIDE&dl=GUIDE&trk=0&CFID=102161420&CFTOKEN=70779909http://portal.acm.org/author_page.cfm?id=81100637433&coll=GUIDE&dl=GUIDE&trk=0&CFID=102161420&CFTOKEN=70779909http://portal.acm.org/author_page.cfm?id=81100637433&coll=GUIDE&dl=GUIDE&trk=0&CFID=102161420&CFTOKEN=70779909http://portal.acm.org/author_page.cfm?id=81100030692&coll=GUIDE&dl=GUIDE&trk=0&CFID=102161420&CFTOKEN=70779909http://portal.acm.org/author_page.cfm?id=81100030692&coll=GUIDE&dl=GUIDE&trk=0&CFID=102161420&CFTOKEN=70779909http://portal.acm.org/author_page.cfm?id=81100557878&coll=GUIDE&dl=GUIDE&trk=0&CFID=102161420&CFTOKEN=70779909http://portal.acm.org/author_page.cfm?id=81100637433&coll=GUIDE&dl=GUIDE&trk=0&CFID=102161420&CFTOKEN=70779909http://portal.acm.org/author_page.cfm?id=81100030692&coll=GUIDE&dl=GUIDE&trk=0&CFID=102161420&CFTOKEN=70779909


28/43

5. Implement Sliding Window Protocol.6. Read a binary string corresponding to an HDLC frame, and bit-stuff, if needed, and identify the frame to be transmitted.7. Read an IP Address in dotted notation, and hence , find out its network IP Address, with the help of a suitable mask.8. Create a TCP socket between a server and a client and authenticate the user.9. Implement a chat session using Socket Programming.10. Configuring a Router11. Configuring VLANS on a Router12. Creation of VTP13. Creation of Spanning Tree on a VLAN14. Building Static Routing Tables on a Router

15. Implement Vector Distance Routing Algorithm.16. Design a DNS server, and resolve a Domain Name from a Clients request.

Total 42

11MX48 UNIX SYSTEM PROGRAMMING LABORATORY0 0 3

21. Simple Programs with basic Unix Commands (essential, utilities, filters, Regular expressions)2. Simple Programs with process Commands3. Simple Programs with communication Commands4. Simple Programs with advanced filters (sed, awk)5. Programs using eval, exec, getopts6. Programming in C using file, process and IPC system calls

Note : Two Problem Sheets will be issued : 1. Shell scripts 2. System Calls Total 42

11MX51 DATA MINING3 0 0

3

DATA MINING: Motivation -Steps in Data Mining Architecture - Data Mining and Databases Data Warehouses DataMining functionalities Classification Data Mining Primitives Major issues.

(5)DATA PREPROCESSING : Descriptive data summarization -Data Cleaning Data integration and transformation DataReduction Data discretization and concept hierarchy generation.

(7)

DATA WAREHOUSE and OLAP TECHNOLOGY: Overview- Need for Data Warehouse- multidimensional data model-Data Warehouse architecture - Data Warehousing to Data mining

(4)MINING FREQUENT PATTERNS, ASSOCIATIONS AND CORRELATIONS: Basic concepts frequent itemsets,

Association rules Efficient and Scalable frequent itemset mining methods mining various kinds of Association rules(6)

CLASSIFICATION AND PREDICTION: Issues regarding classification and prediction Classification by Decision Treeinduction Bayesian Classification Rule based classification Classification using Neural NetworksPrediction Accuracy and error measures Evaluating the accuracy of classifiers and predictors

(7)CLUSTER ANALYSIS : Types of Data Partitioning Methods: k means and k Medoids Hierarchical Methods:

Agglomeratve and divisive hierarchical clustering- outlier analysis(4)

MINING TIME SERIES, SEQUENCE DATA: Trend analysis similarity search sequence patterns in transactional databases- sequential pattern mining: concepts and primitives

(4)

MINING TEXT, MULTIMEDIA AND THE WORLD WIDE WEB: Text data analysis and information retrieval- Dimensionalityreduction for text text mining approaches similarity search in multimedia data classification and prediction analysis-mining the web page layout structure mining multimedia data on the web- web usage mining.

(5)Total 42

REFERENCES1

Han Jiawei and Micheline Kamber, Data Mining Concepts and Techniques, /2e, Morgan Kaufmann, 2006.

2 Soman K P, Shyam Diwakar andV Ajay, Insight into Data Mining Theory and Practice, PHI Learning, 2006.3 Arun K Pujari , Data Mining Techniques, University Press, 2003.

28


29/43

11MX52 INTER - ENTERPRISE COMPUTING3 0 0

3

INTRODUCTION: Business Computing Globalization and development of enterprise computing. Inventory of Distributedcomputing - Service Orientation Loose Coupling Granularity - Scope variance. Software Architectures Serviceoriented architecture benefits Obstacles and roadmap for SOA. Comparison service orientation and Object andComponent orientation.

(6)

SOA ENABLING TECHNOLOGY: Introduction to XML Technologies XML DTD XSD. Web Services Basis - WebServices versus SOA. Service Discoverability - Universal Description Discovery and Integration Programming UDDI UDDI Data Model UDDI SOAP APIs Inquiry APIs Publisher APIs. Service Description and Look up - Web ServiceDefinition Language Defining Message data types Defining Operations on Messages WSDL documents usageScenarios. Service Interactions Simple Object Access Protocol SOAP Specification SOAP Message processing SOAP use of Namespaces SOAP Multipart MIME attachments. SOAP binding. State management and Security in WebServices. Web Service standards and extensions.

(10)BUSINESS PROCESS MANAGEMENT: Basic Business process management Concepts examples Business modeling

options - Basis of workflow - atomic services and composite services Service orchestration and Choreography

Business Process Execution Language. Business process reengineering and management- Combining BPM SOA WebServices Long lived Transactions.

(8)

SOA ENABLED APPLICATION: SOA modeling concepts and tools. SOA Assembly and Deploy Integration developer,Enterprise Service Bus and Process Runtime. SOA Manage - SOA Governance(6)

SOA ENABLED ENTERPRISE: Enterprise Application Integration using SOA Integrating applications and Data usingWeb Services and XML -Integration of legacy.

(8)

CASE STUDIES: Inter-Enterprise applications like Insurance Claim processing - Credit Card based online transaction Direct to Home Services.

(4)

Total 42

REFERENCES

1. Thomas Erl, SOA Principles of Service Design, Pearson Education , 2009.2. Eric Newcomer and Greg Lomow, Understanding SOA with Web Services, Pearson Education, 20093. Dirk Krafzig, Karl Banke and Dirk Slama, Enterprise SOA, Service oriented architectures best practices, PrenticeHall , 2008.4. Sandeep Chatterjee and James Webber, Developing Enterprise Web Services, Pearson Education, 20075. Thomas Erl, Service Oriented Architecture: A Field Guide to Integrating XML and Web Services, Prentice Hall, 2007.6. James McGovern, Oliver Sims, Ashish Jain and Mark Little Enterprise Service Oriented Architectures: Concepts,

Challenges Recommendations. Springer, 2006.7. Thomas Erl, Service Oriented Architecture (SOA): Concepts, Technology and Design, Prentice Hall, 2005.

11MX53 MOBILE COMPUTING3 0 0 3

INTRODUCTION: Introduction to wireless networking, Advantages and disadvantages of wireless networking, Evolution ofmobile communication generations- CDMA, FDMA, TDMA. Challenges in mobile computing Vertical and horizontalapplications of Wireless NetworkingWireless LAN and Wireless WAN.

(4)

CELLULAR CONCEPT: Wireless transmission - Frequencies for radio transmission - Regulations - Signals , Antennas ,Signal propagation ,Path loss of radio signals , Additional signal propagation effects - Multi-path propagation - Multiplexing -Space division multiplexing - Frequency division multiplexing -Time division multiplexing - Code division multiplexing -Spread spectrum - Direct sequence spread spectrum - Frequency hopping spread spectrum.(6)GSM - Mobile services - System architecture -- Handover GPRS Mobile services System Architecture.(4)

29


30/43

MOBILE DEVICES: Overview of mobile devices input mechanism Device classification 3 G devices 3 GApplications. (3)

MOBILE APPLICATIONS ARCHITECTURE : Wireless Internet Wireless Internet Architecture Smart Client SmartClient Architecture Messaging Architecture Sample Applications.(6)

Building smart client applications Mobile Operating systems Client development process Design, Development,implementation, testing and deployment phase.

Thin client development process design, development, implementation, testing and deployment phase.(8)

MOBILE INFORMATION MANAGEMENT : PIM architecture Standardization SyncML vCalendar/iCalendar vCard Mobile device Management Software Features.(6)

WIRELESS INTERNET TECHNOLOGY: World wide web WAP - Architecture - Wireless datagram protocol , Wirelesstransport layer security , Wireless transaction protocol, Wireless session protocol , Wireless application environment ,Wireless markup language(WML) , WML script.

(5)

Total 42REFERENCES

1. Martyn Mallick, Mobile and Wireless design essentials Wiley Publishing Inc, 20082. Jochen Schiller , Mobile Communications, Addison-Wesley, 2003.3 Steve Mann and Scoot Schibli, The Wireless Application Protocol, John Wiley & Sons, Inc., 2000.

4. Steve Mann , Programming Applications with the Wireless Application Protocol, John Wiley & Sons, Inc., 2000.5. Rifaat A.Dayem Mobile Data & Wireless Lan Technologies, Prentice Hall , 1997.

11MX56 DATA MINING LABORATORY0

0 3 21. Simple excises for Information Retrieval from Data bases2. Implementation of Data Preprocessing Techniques3. Implementation of Partition based and Hierarchical Clustering Algorithms4. Application of Regression based prediction to real world problems5. Implementation of decision tree and Bayesian classifiers6. Implementation of techniques demonstrative of text mining7. Implementation of techniques demonstrative of web mining

Total 42

11MX57 INTER - ENTERPRISE COMPUTING LABORATORY 0 0 3 2

1. Packages development using Business Process Execution Language.2. Package development using web services transaction.3. Package development using SOAP messages.4. Package development using web services security.5. Package development using web services reliable messaging.

Total 42

11MX58 MOBILE COMPUTING LABORATORY0

0 3 2LAB

Develop a WAP PackageSuggested S/W Environment:WML, WMLSCRIPT, ASP/JSP, MSACESS, UPSDK SimulatorSuggested Applications:WAP Enabled EmailInformation Retrieval Systems

1. Online Shopping Card2. Airline Reservation System3. WAP Portal Site4. M-Commerce applications

11MX01 PRINCIPLES OF MANAGEMENT

30


31/43

3 0 0 3

PRINCIPLES OF MANAGEMENT: Definition and significance of management functions of management society andenvironment, corporate social responsibility.

(6)

VALUE BASED MANAGEMENT: Creating shareholders value, shareholders value versus stakeholders.(5)

MINTZBERGS MANAGEMENT ROLES.

(6)

TEAM: Work Teams Importance, Types and difficulties in teams Creating effective teams.(4)

PROJECT MANAGEMENT: Definition and objectives of Project Management Phases in Project Management Cycle-Project appraisal Techniques.

(6)

HUMAN RESOURCE MANAGEMENT: Importance objectives and its functions, Human Resources Development.(4)

GROUP BEHAVIOUR: Group dynamics, conformity, sociometry group cohesiveness and leadership.(6)

CHANGE MANAGEMENT: Forces affecting the organization - Organisational Change Resistance to change -

Perspectives on organizational change.(5)

Total 42REFERENCES

1. Hahold Koontz and ODonnel, Essentials of Management, McGraw Hill, 1990.2. Leap H and Cnino M D, Personnel Human Resource Management Macmillan, 1989.3. Tripathi P C, Personnal Management and Industrial Relations, Sultan Chand , 2002.4. Sapru R K, Project Management, Excel Books, 1997.5. Stephen P. Robbins, Organisational Behaviour, Prentice Hall, 2000.

11MX02 SOFT COMPUTING3 0 0 3

ARTIFICIAL INTELLIGENCE(AI): Characteristics of AI problem - State space representation - AI search strategies: Bruteforce, depth first, breadth first, best first, hill climbing and A* algorithms.(8)

KNOWLEDGE REPRESENTATION: Logic- Propositional calculus - Predicate calculus - Rules of inference - Resolution -Unification algorithm - Semantic networks - Frames Scripts .(7)

SOFT COMPUTING AND CONVENTIONAL AI: Constituents - Characteristics - Hybrid models.(2)

FUZZY SET THEORY: Fuzzy sets - Basic definitions - Membership functions - Fuzzy rules and reasoning - Fuzzy relations- fuzzy if-then rules - Fuzzy reasoning .(10)

GENETIC ALGORITHMS: Survival of the fittest - Fitness computations - Cross over operators - Mutation - Reproduction -

Rank method - Rank space method applications.

(3)NEURAL NETWORKS: Basic concepts - Network properties - Learning in simple neurons - Single layer perceptrons -Multilayer perceptrons - Supervised and unsupervised learning Backpropagation network, Kohonen's self organizingnetwork, Hopfield network.

(12)

Total 42

REFERENCES

31


32/43

1. Peter Norvig and Stuart J. Russel, Artificial Intelligence: A Modern Approach, Prentice Hall , 2005.2. Ross Timothy J, " Fuzzy Logic with Engineering Applications", John Wiley and Sons Ltd, 2005.3. Patrick Henry Winston, "Artificial Intelligence", Pearson Education, 2004.4. Rajasekaran S and Vijayalakshmi Pai G A, Neural Networks, Fuzzy Logic and Genetic Algorithms, Prentice Hall, 2003.5. Elaine Rich and Kevin Knight, "Artificial Intelligence", Tata McGraw Hill, 2002.

11MX03 ADVANCED DATABASE MANAGEMENT SYSTEM

3 0 03

CATALOG FOR RDBMS: Query Processing and Optimization - Heuristics and Cost Estimates in Query Optimization.(7)

OBJECT ORIENTED DATABASES: Object oriented data model - Object Identity - Persistent Programming Languages -Type and Class Hierarchies and Inheritance - Complex Objects - Object Oriented Database Design.(7)

OBJECT RELATIONAL DATABASE: Nested Relations - Comparison.(7)

DISTRIBUTED DATABASES: Principles Characteristics Architecture Database Design Transactions andProcessing.

(3)

ADVANCED DATABASE MODELS: Active Databases - Temporal Databases - Spatial Databases - Multimedia Databases- Deductive Databases - Inference Mechanisms.(10)

DATABASE SECURITY: Integrity and Control - Security and Integrity Threats - Defense Mechanisms - SecuritySpecification in SQL - Statistical Database - Crash Recovery.(5)

CASE STUDY : Oracle Distributed queries Partitioning Strategies Procedural Replication Performance Tuning.(3)

Total 42

REFERENCES

1. Carlo Zaniolo and Stefano ceri, etal., Advanced Database Systems, Morgan Kaufmann , 1997.2. Abraham Silberschatz, Henry F.Korth and S.Sudarshan, Database System Concepts, McGraw Hill, 2002.3. Michael Stonebraker and Paul Brown, Object Relational DBMSs, Morgan Kaufmann, 1999.4. Thomas Connolly and Carolyn Begg, Database Systems: A Practical Approach to Design, Implementation andManagement, Pearsons Education, 2004.5. Tamer O Zsu M and Patrick Valduriez, Principles of Distributed Database Systems, Pearson Education, 2009.

11MX04 ARTIFICIAL INTELLIGENCE3 0 0

3

INTRODUCTION: Computerized reasoning - Artificial Intelligence (AI) - characteristics of an AI problem - Problemrepresentation in AI - State space representation - problem reduction.(5)

SEARCH PROCESS:AI and search process - Brute force search techniques, Depth first, Breadth first search techniques,Hill climbing, Best first search, AND/OR graphs, A* algorithm - Constraint satisfaction.

(10)AI AND GAME PLAYING: Major components of a game playing program - plausible move generator - static evaluation -function generator - Minimal strategy - Alpha - Beta techniques - problems in computer game playing programs.

(6)KNOWLEDGE REPRESENTATION: Logic, Propositional logic - Tautology - Contradiction - Normal forms - Predicate logic -Rules of inference - Resolution - Unification algorithm - Production rules - Semantic networks - Frames Scripts -Conceptual dependency.

(9)

32


33/43

KNOWLEDGE ENGINEERING: Design and architecture of expert systems - Expert system life cycle - Knowledgeacquisition difficulties - strategies - major applications areas - Qualitative study of expert systems, DENDRAL, MYCIN.

(7)MACHINE LEARNING: Frame work for learning Inductive learning Supervised, Unsupervised learning Paralleldistributed processing Genetic Algorithms.

(5)

Total 42REFERENCES

1. Stuart Russel and Peter Norvig, Artificial Intelligence a modern approach, Prentice Hall, 2003.2. Elaine Rich and Kevin Knight, Artificial Intelligence, Tata McGraw Hill, 2003.3. Patrick Henry Winston, Artificial Intelligence, Addison Wesley, 2000.4. Luger George F and Stubblefield William A, Artificial Intelligence : Structures and Strategies for Complex Problem

Solving, Pearson Education, 2002.

mcasyll reg2011 revised

Documents