Oct 30, 2014

Welcome message from author

This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript

UNIVERSITY OF KERALA

REGULATIONS AND SCHEME

for

M. Tech. Degree Programme (2008 Scheme)

in

Computer Science & Engineering

1

M. Tech. DEGREE COURSE REGULATIONS w. e. f. 2008 ADMISSIONS

1. General:

The M Tech degree course is for 2 years comprising of 4 semesters. Duration is counted from the first registration date of the student( in the first semester). Credit system is adopted for the course. Grade point average is calculated on the basis of all courses taken by the student. The total credits for the course is 69. The distribution of these credits among the various course work is as follows:

2. Distribution of credits among the various Course Work:

Table 1: Distribution of credits for various coursework

Course work

Weekly hours Credits allotted

Theory subject

3 3

Seminar 2 or 3 2

Laboratory 2 or 3 1

Project – (Part 1 & Part 2) - 3

Industrial training/interaction

- 1

Research Methodology - 1

Thesis –Preliminary - 4

Thesis - 12

2

3. Distribution of credits among the four Semesters:

Table 2: Distribution of credits among the semesters

Semester Course work contentTotal creditsTotal creditsallotted

Allotted creditssemester-wise

I

6 Theory Subjects 6 x 3 = 18

22Seminar 1 x 2 = 2

Laboratory 1 x 1 = 1

Project - Part 1(to be continued in the second semester)

1 x 1 = 1

II

6 Theory Subjects2 core subjects, 2 Stream Electives,1 Departmental elective and 1 Interdisciplinary Elective

2 x 3 + 2 x 3 +1 x 3 +1 x 3 = 18

23Laboratory 1 x 1 = 1

Seminar 1 x 2 = 2

Project - Part 2 1 x 2 = 2

III2 Theory subjects(Stream Electives) 2 x 3 = 6

12 Research methodology 1 x 1 = 1Industrial Training 1 x 1 = 1 Thesis - Preliminary 1 x 4 = 4

IV Thesis 12 12Total credits for four semesters 69

4. Details of course work contents:

4.1 Academic Committee:

This refers to the Academic Committee of the concerned institution comprising of (i) Principal, (ii) Dean (PG. studies) (iii) Heads of all departments offering PG. Courses and (iv) Course coordinators of P G. Courses in the departments offering PG. Courses.

4.2 Course coordinator:

The Professor in charge of PG. Courses in each Department will be the course coordinator for M Tech/ M. Planning (Housing) course in that Department.

4.3 Department Committee:

Each Department will have a Department Committee to look after the PG. Courses. This Committee will consist of (i) Head of the Department (ii) The Course coordinator (iii) Faculty in charge of each Stream and (iv) One student representative.

3

4.4 Evaluation Committee:

Each Department has to constitute an evaluation committee to evaluate seminars, projects, pre- submission seminar for the Thesis etc., consisting of at-least three members. The internal guide and another expert in the area of specialisation shall be the two essential members of this committee.

4.5 Course work content:

Semester I

The student has to credit 6 theory subjects. All the subjects will be core subjects out of which one will be from the area of Mathematics. In addition, the student has to take up 1 Seminar, 1 laboratory and a project which is to be continued in the second semester and to be completed by the end of second semester.

Semester II

The student has to credit 6 theory subjects, one Seminar, one laboratory and one project (continuation of Project-part 1) in this semester. Among the six subjects, one would be an inter-disciplinary elective as advised by the course coordinator in consultation with the academic Committee: two would be core subjects offered in the stream concerned, two would be stream electives and remaining one would be a departmental elective. Stream and departmental electives are to be selected from the list of electives for each department. The student has to continue the project work commenced in the first semester and submit a project report at the end of this semester.

The seminar which the student has to credit would be on a topic different from his /her project work.

Semester III

The student has to credit 2 subjects from the Stream Electives listed and a course on research methodology. He/She has to undergo an Industrial Training during the semester break after semester II and complete it within 15 calendar days from the start of the III semester. For crediting the industrial Training/Interaction, the student has to undertake the training in an Industrial organization /R&D organization for a period of not less than two weeks. The student is required to submit an industrial training report and present it before the evaluation committee.

Thesis Preliminary comprises of a preliminary thesis work, two seminars and submission of thesis preliminary report. The first seminar would highlight the topic, objectives, methodology and expected results. The first seminar shall he conducted in the first half of this semester. The second seminar is the presentation of the work they have completed for the thesis-preliminary and scope of the work, which is to be accomplished in the fourth semester.

4

Weightages for the 4 credits allotted for the Thesis Preliminary

( i) Internal evaluation of the thesis-preliminary work by the guide - 50% (ii) Internal evaluation of the thesis-preliminary by the Evaluation Committee - 50%

Semester IV:

In the fourth semester there will be only thesis work. The fourth semester thesis must be the extension of thesis preliminary work. Towards the end of the semester there would be a pre-submission seminar to assess the quality and quantum of the work by the Evaluation Committee. This would be the pre-qualifying exercise for the students for getting approval from the Department Committee for the submission of Thesis. At least one technical paper is to be prepared for possible publication in Journals/ Conferences. The final evaluation of the Thesis would be external evaluation. The 12 credits allotted may be proportionally distributed between external and internal evaluation as follows. As far as possible, the student shall be encouraged to do their work in the parent institute itself.

Weightage of marks for the Thesis

Internal Evaluation of the Thesis work by the guide - 200 MarksInternal Evaluation of the Thesis by the Evaluation Committee - 200 Marks Final Evaluation of the Thesis work by the Internal and ExternalExaminers- (Evaluation of Thesis: 100 marks + Viva Voce: 100 marks) - 200 Marks

Facility for Students to do thesis outside the parent Institute:

As far as possible the students shall be encouraged to do their thesis work in the parent institute itself. However if found essential, they may be permitted for continuing their Thesis in the IVth semester outside the parent Institute with the approval of the Department Committee. For students who are availing this facility, the following conditions are to be observed.

1. The student has to get prior approval from the Department Committee for availing this facility as well as choice of the Institution/industry/ R&D organization with which the student is associated for continuing his/her thesis work. 2. If they are doing their thesis work in an Educational Institute, then the Institute is to be preferably an institution of national repute like IITs, IISc, etc. 3. Students availing this facility should continue as regular students of the parent institute itself. 4. They should have a guide each in the parent institution and the external Institution/industry/ R&D organization in which the student is associated for doing the thesis work.5. The student also has to furnish a certificate from the guide of the organization concerned stating the willingness to supervise the thesis work through the Institution/industry/ R&D organization with which the student is associated for his/her thesis work and has to submit the same to the Department Committee.6. The student has to furnish his /her monthly progress as well as attendance report signed by the external guide and submit the same to the concerned Internal guide.

5

7. The external guide and the internal guide are to be preferably present during all the stages of evaluation of the thesis work. In case the external guide is not present, the internal guide can alone take the responsibility of conducting the evaluation.

5. Evaluation Process:

In the first semester, second semester and the third semester, all the subjects to be credited are evaluated through internal assessment and examinations. The Written examination for the first semester will be conducted by the University. The Written examination for the second and third semesters would be through internal examination. The answer scripts of the internal examination in the second and third semester shall also to be valued by two examiners; the first examiner being the staff member handling the subject and a second examiner specialised in the area of the subject.

The seminars, project, Industrial Training/Interaction programme etc. will be evaluated by the Evaluation Committee. The laboratory work will be evaluated by the staff member/(s) concerned.

In the third semester, Thesis- Preliminary will be evaluated by the Evaluation Committee. The internal evaluation of the Thesis in the IV Semester. would be done by the Evaluation committee. Final evaluation of Thesis would be conducted by the guide and an expert from outside the Institute appointed by the University.

The University evaluation of thesis work and viva-voce examination will be taken up only after the student completes all core, elective as well as other course requirements satisfactorily.

5.1 Weightage of marks The following will be the weightage of marks for the different subjects

a. Theory subjects Continuous assessment - 50 marks University/internal examination - 100 marks

(For continuous evaluation, minimum 4 assignments and 2 tests shall be considered. The marks shall be distributed as follows; Attendance 20%, Assignment-30% and Tests- 50%)

b. Laboratory based subjects Continuous assessment - 50 marks

5.2 Grade and Grade PointsA student is awarded a letter grade in each course he/she has registered for,

indicating his/her overall performance in that course. There are eight letter grades S, A, B, C, D, E, F and I. The correspondence between grades and points (on a 10-point scale) rating is given in Table 3.

If a student does not satisfy all the requirements for a course during the second and/or third semester for a genuine reason, the teacher concerned may award grade I(incomplete). The student will be given a chance to satisfy the requirements within a

6

stipulated date as decided by the Department Committee. Once the student satisfies this within the time, the I grade will be converted by the Department committee to a regular letter grade. If the student fails to satisfy the requirements within this extra time allotted then, I grade is automatically converted to an F Grade.

5.3. Substitution of courses:

A student getting an F or E grade in a course must either reappear for the subsequent chance of the examination or substitute the course with another course as suggested by the Department Committee. The student is allowed for substitution only if the course concerned is not a core course. A student is not allowed to register for more than one semester at a time. Hence substitution is allowed only after completing the regular course work.

5.4 Classification of Grades based on Marks scored:

The grades are allotted based on the percentage of total marks (Continuous evaluation and Written examination put together) scored by the student in each subject. Appropriate grades in that subject is then allotted based on the classification given in Table.3. In case a student has taken more than two chances in passing a subject only minimum pass grade D will be allotted in that subject irrespective of the actual marks scored.

Table 3: Classification of grades based on percentage of marks

S Percentage of marks Grades allotted Grade points1 90 % and above S 102 80 % or above but

less than 90%A 9

3 70 % or above but less than 80%

B 8

4 60 % or above but less than 70%

C 7

5 50 % or above but less than 60%

D 6

6 40 % or above but less than 50%

E 4

7 Less than 40% F 08 I Incomplete

5.5 Computation of SGPA (Semester Grade Point Average) and CGPA (Cumulative Grade Point Average):

The SGPA is an overall academic performance of a student in all the courses he/she has registered during a given semester. It is computed as follows: If a student is awarded G1, G2 etc. grades in courses with corresponding credit units U1, U2 etc., the SGPA is given by

SGPA = (U1*G1 + U2*G2+… ) / (U1+U2+ ….)

7

Similarly the CGPA indicates the cumulative academic performance in all the courses taken including the current semester.

CGPA for ith semester = Σ (SGPA)i x Si )/ Σ Si

Where (SGPA)i = SGPA in the ith semester and Si = total credits in the ith semester

5.6. Academic performance requirement:

The minimum CGPA requirement for the M. Tech Programme is 6.0 in every semester with the following provisions. If a student scores CGPA below 6 in any semester he/she may be allowed to continue in the programme only on the recommendation of the Academic Committee. A student is given only three chances to reappear for the examination in the subject in which he has failed ( scoring E or F Grade ) within a period of 5 years from the time of his/her registration to the M Tech course, provided the student has obtained minimum attendance requirement.

5.7 Class Distinction:

Minimum pass requirement for each written paper is 50 %. A student is eligible for the degree on completion of 69 credits obtaining at least D in each subject and a CGPA of at least 6.0. A student is placed in first class with Distinction if he/she has CGPA ≥ 9. He/ she is placed in First Class if his/ her CGPA is 7≥ and < 9.

5.8 Attendance requirements:

A student should have a minimum of 75% attendance in all the semesters, Medical leave is granted only twice during the entire duration of the M Tech (two years) and the student becomes eligible to avail the medical leave only if he/she has a minimum of 60% attendance. The percentage of attendance for a subject will be indicated by a code number/letter as given in Table 4 and will be included in the grade card:

Table 4: Attendance code

Attendance Rounded to Code95% and above H

85% to 94% 975% to 84% 8Below 75% W

6. Structure of Syllabus and Question Paper:

8

The syllabus would be of non-modular structure. The question paper shall cover entire syllabus and contain 20% choice.

7. Time limit for completion of Coursework:

The student who has registered for the M. Tech. course has to complete all the requirements for awarding the degree within 5 years from the date of admission to the course.

9

Scheme of studies

Computer Science & Engineering

1

M.Tech Degree ProgrammeComputer Science & EngineeringCurriculum & Scheme of Examinations

SCHEME

SEMESTER I

Code Name of the Subjects Credits Hrs/ Week

Duration of Exam

Evaluation (Marks)

Internal External Total

RCC1001 Mathematical Foundations of Computer Science 3 3 3 50 100 150

RCC1002 Computer Architecture 3 3 3 50 100 150

RCC1003 Software Engineering Principles 3 3 3 50 100 150

RCC1004 Advanced Operating Systems 3 3 3 50 100 150

RCC1005 Advanced Networks 3 3 3 50 100 150

RCC1006 Advanced Compiler Design 3 3 3 50 100 150

RCC1101 Seminar 2 2 50 - 50

RCC1102 Laboratory 1 2 50 - 50

RCC1103 Project Part I 1 50 - 50

Total 22 450 600 1050

1

SEMESTER II

Code Name of the Subjects Credits Hrs/Week

Duration of Exam

Evaluation(Marks)

Internal External Total

RCC2001 Advanced Topics in Algorithms 3 3 3 50 100 150

RCC2002 Advanced Data Base Management Systems 3 3 3 50 100 150

* Elective -1(Stream Elective) 3 3 3 50 100 150

* Elective -II(Stream Elective) 3 3 3 50 100 150

* Elective -III(Department Elective) 3 3 3 50 100 150

** Elective -IV(Inter Disciplinary Elective) 3 3 3 50 100 150

RCC2101 Seminar 2 2 - 50 - 50

RCC2102 Laboratory 1 2 - 50 - 50

RCC2103 Project – Part II 2 - 100 - 100

Total 23 500 600 1100

* The students can select three electives (Elective I, II and III), from the list of STREAM / DEPARTMENT ELECTIVES – for Semester II, for the current

semester as advised by the course – coordinator. ** The students can select one elective (Elective IV), from the list of INTER DISCIPLINARY ELECTIVES as advised by the course-coordinator.

List of Stream / Department Electives-for Semester II

1. RCE 2001 Parallel Algorithms2. RCE 2002 Security in Computing3. RCE 2003 Cryptography

1

4. RCE 2004 Parallel Computing5. RCE 2005 Computational Geometry6. RCE 2006 Advanced Computer Graphics7. RCE 2007 Soft Computing8. RCE 2008 Data Warehousing9. RCE 2009 Pattern recognition

List of Inter Disciplinary Electives

1. API 2001 Urban Environment Management

2. API 2002 Energy Environment & Buildings

3. API 2003 Energy Efficiency and Micoclimate

4. API 2004 Rural Planning and Development

5. CSI 2001 Finite Element Analysis

6. CSI 2002 Theory of Plates and Shells

7. CSI 2003 Advanced Mechanics of Materials

8. CSI 2004 Mechanics of Composites

9. CSI 2005 Random Vibration

10. CEI 2001 Philosophy of Technology

11. CEI 2002 Environmental Management

12. CEI 2003 Environment and Pollution

13. CGI 2001 Geotechnical Engineering for Infrastructure Projects

14. CHI 2001 Fuzzy Sets and Systems in Engineering

15. CTI 2001 Optimisation Techniques

16. CMI 2001 Personnel Management

17. EMI 2001 Biomedical Instrumentation

18. EGI 2001 Navigation, Guidance And Control

19. EPI 2001 Energy Conservation and Management

20. ECI 2001 Engineering Optimization

21. MII 2001 Heuristics for Optimization

22. MII 2002 Financial Management

23. MII 2003 Organizational behavior

24. MII 2004 Operations Research

25. MII 2005 Management Information Systems

26. MDI 2001 Applied Finite Element Methods

27. MDI 2002 Acoustics and Noise Control for Engineers

28. MPI 2001 Computational Fluid Dynamics

29. MTI 2001 Numerical Methods

30. MRI 2001 Finite Element Methods

31. MRI 2002 Advanced Numerical Techniques for Engineers

32. MRI 2003 Total Quality Management

33. MRI 2004 Optimisation Techniques

1

34. TAI 2001 Mechatronics

35. TMI 2001 Fuzzy Systems & Applications

1. TSI 2001 Artificial Neural Networks

2. RCI 2001 Object Oriented Modeling and Designing

3. RCI 2002 Embedded & Real Time Systems

4. RCI 2003 Software Project Management

5. RCI 2004 .NET Programming

SEMESTER III

Code Name of the Subjects Credits Hrs/Week

duration of Exam

Evaluation(Marks)

Internal External Total

* Elective -V (Stream Elective) 3 3 3 50 100 150

* Elective -VI (Stream Elective) 3 3 3 50 100 150

RCC3101 Research Methodology 1 - - 50 - 50

RCC3102 Industrial Training/Interaction 1 -

-50

-50

RCC3102 Thesis-Preliminary 4 14 - 200 - 200

Total 12 20 400 200 600

1. The students can select two electives (Elective V and VI), from the list of STREAM ELECTIVES – for Semester III, for the current semester as advised by the course – coordinator.

List of Stream Electives-for Semester III1. RCE 3001 Software Testing2. RCE 3002 Image Processing3. RCE 3003 Mobile Computing4. RCE 3004 Data Mining5. RCE 3005 Fault Tolerant Systems2 RCE 3006 Distributed Computing

SEMESTER – IV

1

Code Name of the Subjects

Credits Hrs/ Week

Evaluation(Marks)

Internal External Total

Sessional Guide Thesis Viva

Viva Voce

RCC4101 Thesis-Final 12 29 200 200 100 100 600

Total 12 29 200 200 100 100 600

Note: 6 to 10 hrs per week is allotted for department assistance

1

SYLLABUS

Computer Science & Engineering

1

SEMESTER I2-1-0-3

RCC1001. MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE

Formal Logic: Statement, Symbolic Representation and Tautologies, Quantifiers, Predicator and validity, Normal form. Propositional Logic, Predicate Logic, Logic Programming and Proof of correctness. Resolution and Unification

Proof, Relation and Analysis of Algorithm: Techniques for theorem proving: Direct Proof, Proof by Contra position, Proof by exhausting cases and proof by contradiction, principle of mathematical induction, principle of complete induction. Recursive definitions. Solution methods for linear, first-order recurrence relations with constant coefficients.

Sets and Combinations : Sets, Subsets, power sets, binary and unary operations on a set, set operations/set identities, fundamental counting principles, principle of inclusion, exclusion and pigeonhole principle, permutation and combination, pascal’s triangles, binomial theorem, representation of discrete structures.

Relation/function and matrices: Relation, properties of binary relation, operation on binary rotation, closures, partial ordering, equivalence relation, Function properties of function, composition of function, inverse, binary and n-ary operations, characteristics for Permutation function, composition of cycles, Boolean matrices, Boolean matrices multiplication.

Lattices & Boolean Algebra: Lattices: definition, sub lattices, direct product, homomorphism Boolean algebra: definition, properties, isomorphic structures (in particular, structures with binary operations) sub algebra, direct product and homo-morphism, Boolean function, Boolean expression, representation & minimization of Boolean function.

Graph Theory: Terminology, isomorphic graphs, Euler’s formula (proof) four color problem (without proof) and the chromatic number of a graph, five color theorem. Trees terminology, directed graphs, Computer representation of graphs, Warshall’s, algorithms, Decision Trees, Euler path & hamiltonian circuits, Shortest path & minimal spanning trees, Depth-first and breadth first search, trees associated with DFS & BFS). Connected components, in order, preorder & post order trees traversal algorithms.

Modeling arithmetic, computation and languages: definition of group, monoid & semi group, simple examples from arithmetic of numbers and matrices, modular arithmetic, transformation & formulation, strings, elementary group theorem-uniqueness of identity and inverses; definition of subgroup, definition and examples of group isomorphism. Lagranges’ theorem and Cayley’s theorem (without proof).

1

Definition of finite state machines, and Kleene’s theorem, unreachable states, limitations of Finite state machines, definition of Turing machines and some examples, Turing machines need for recognition and compute functions, Church-Turing thesis (overview), Definition of the set P and the set NP, Introduction to formal languages & grammars.

Text:1. J.P. Tremblay & R. Manohar, “Discrete Mathematical Structure with

Application to Computer Science”, TMH, New Delhi (2000).2. Kolman, Busby & Ross “Discrete Mathematical Structures”, PHI.3. Iyengar, Chandrasekaran and Venkatesh, “Discrete Mathematics”, Vikas

Publication.4. Peter Linz, “An Introduction to Formal Languages and Automata”, Narosa

Publishing House.

Reference:

1. J. Truss, “Discrete Mathematics”, Addison Wesley.2. C.L.Liu, “Elements of Discrete Mathematics”, McGraw Hill Book

Company.3. M.Lipson & Lipshutz, “Discrete Mathematics”, Schaum’s Outline series.4. J.E.Hopcroft & J.D.Ullman, “Introduction to Automata Theory, Languages

and Computation”, Addison Wesley.

Note : 20% choice may be given while setting the question paper

1

2-1-0-3

RCC1002. COMPUTER ARCHITECTURE

Parallel computer Model: State of computing, multiprocessor & multi-computer multivector & SIMD, VLSI Models. Instruction Level parallel Processing.

Pipe lined processors: Linear and Non-linear pipelines, carry-save adder pipes for integer multiplication, 4 stage fixed point multiplication of 8 bit integer. Non-linear pipe theory, State transition diagram, Issue latencies for non-linear pipes, Use of delay to improve issue latencies.

Scalar and Super scalar processing – data control and resource dependencies, register renaming, reservation stations, reorder buffers, Case studies-Power PC 620, CISC processors with RISC core-Pentium Pro, Branch Control.

Data Parallel Architecture: Introduction, Static and dynamic interconnection networks, omega and baseline networks, SIMD systems, case study – MPP and CMS, Vector Processing, Case study – Cray family, Introduction to Systolic architecture , example matrix multiplication.

Multiprocessors and Multicomputers: cache coherence and Synchronization mechanism. Three generation of multicomputers, Data Flow Architecture: Data Flow and Hybrid Architecture – Data Flow Architecture. Case Study: VLIW Architecture – Super scalar and RISC processor, SPARC.

Text1. Dezso Sima, Terence Fountain, Peter Kacsuk, “Advanced Computer

Architectures – A design space approach”, Pearson Education 1997.2. Kai Hwang, “Advanced Computer Architecture Parallelism, Scalability,

Programmability”, Tata Mc Graw Hill, 2003.

References1. Hennessy J. L., D. Patterson, “Computer Architecture – A quantitative

Approach”, Morgan Kauffman (4/e), 20062. Michael J Flynn, “Computer Architecture- Pipelined And Parallel Processor

Design”, Narosa Publications, 2003.

Note : 20% choice may be given while setting the question paper

1

2-1-0-3RCC1003. SOFTWARE ENGINEERING PRINCIPLES

Introduction: Software Crisis, Software Processes & Characteristics, Software life cycle models, Waterfall, Prototype, Evolutionary and Spiral Models, Overview of Quality Standards like ISO 9001, SEI – CMM.

Software Requirements analysis & specifications: Requirement engineering, requirement elicitation techniques like FAST, QFD & Use case approach, requirements analysis using DFD, Data dictionaries & ER Diagrams, Requirements documentation, Nature of SRS, Characteristics & organization of SRS.

Software Project Planning: Size Estimation like lines of Code & Function Count, Cost Estimation Models, Static single & Multivariable Models, COCOMO, COCOMO-II, Putnam resource allocation model, Risk Management.

Software Design: Cohesion & Coupling, Classification of Cohesiveness & Coupling, Function Oriented Design, Object Oriented Design, User Interface Design.

Software Metrics: Software measurements: What & Why, Token Count, Halstead Software Science Measures, Design Metrics, Data Structure Metrics, Information Flow Metrics.

Software Testing: Testing process, Design of test cases, functional testing: Boundary value analysis, Equivalence class testing, Decision table testing, Cause effect graphing, Structural testing, Path Testing, Data flow and mutation testing, Unit Testing, Integration and System Testing, Debugging, Alpha & Beta Testing, Regression Testing, Testing Tools & Standards.

Software Reliability: Importance, Hardware Reliability & Software Reliability, Failure and Faults, Reliability Models, Basic Model, Logarithmic Poisson Model, Calender time Component.

Software Maintenance: Management of Maintenance, Maintenance Process, Maintenance Models, Reverse Engineering, Software Re-engineering, Configuration Management, Documentation.

Software Tools and Environment: Programming environments, Requirements analysis and design modeling tools, configuration management tools, Tool integration mechanisms.

Text:1. R. S. Pressman, “Software Engineering – A practitioner’s approach”, 5 th

ed., McGraw Hill Int. Ed., 2001.

2

2. K.K. Aggarwal & Yogesh Singh, “Software Engineering”, New Age International, 2001.

Reference:1. R. Fairley, “Software Engineering Concepts”, Tata McGraw Hill, 1997.2. P. Jalote, “An Integrated approach to Software Engineering”, Narosa, 1991.3. Stephen R. Schach, “Classical & Object Oriented Software Engineering”,

IRWIN, 1996.4. James Peter, W Pedrycz, “Software Engineering”, John Wiley & Sons1. Sommerville, “Software Engineering ”, 6th ed. Pearson Education, 2002.

Note : 20% choice may be given while setting the question paper

2

2-0-1-3RCC1004. ADVANCED OPERATING SYSTEMS

Uniprocessing operating system: Review of Operating system concepts. Process Concept – Threads process Scheduling – process synchronization – Interprocess Communication - semaphores – Messages – Monitors – critical Regions – conditional critical regions – dead Locks. Real and virtual Memory management Schemes.

Multiprocessor Operating System: Multiprocessor UNIX design goals - Master slave and multithreaded UNIX - Multicomputer UNIX extensions.

Distributed Operating System: Introduction - Design Issues. Communication in distributed systems Layered protocols – ATM - client server model - remote Procedure call – Group communication.

Synchronization distributed systems: Clock Synchronization – Mutual Exclusion – Election algorithms – Atomic transactions - Deadlocks in distributed systems. Processes and processors in distributed systems: Threads – system models - Processor allocation - Scheduling in distributed Systems.

Distributed file system – Design and implementation – Trends in distributed file systems. Case study AMOEBA, MACH, Recent trends and developments.

Text:1. A.S.Tanenbaum, “Modern Operating Systems”, PHI Edition, 19922. A.S.Tanenbaum, “Distributed Operating systems”, PHI.3. M. Singhal and N.G.Sivarathri, “Advanced Concepts in Operating

Systems”, M.C.Grawhill Inc. 1994.References:

1. J.L.Peterson and A. Silberchatz, “Operating System Concepts”2. M.Maekawa, A.E.Oldehoeft And R.R. Oldehoeft, “Operating systems.”3. M.Milenkovic, “Operating Systems : Concepts and Design” , McGrawhill

Inc Newyork, 19924. K.Khawng, “Advanced Computer Archiecture : Parallelism , Scalability,

Programmmability”, M.C.Grawhill Inc, 19935. C.Crowley, “Operating Systems – A design Oriented Approach”, Irwin 1997.

Note : 20% choice may be given while setting the question paper

2

2-0-1-3RCC1005. ADVANCED NETWORKS

Introduction, Protocols and TCP/IP Suite- The need for a protocol architecture, the TCP/IP Protocol Architecture, The OSI Model, Inter networking. TCP and IP- Transmission Control Protocol (TCP), User Datagram Protocol, The Internet Protocol, IPv6.

High Speed Networks- Frame relay, Packet Switching Networks, Frame Relay Networks, ATM Protocol Architecture, ATM Logical connections, ATM cells, Service categories, ATM Adaptation Layer, High Speed LANS- emergence, Ethernet, Fibre Channel, Wireless LANS.

Congestion and Traffic Management: Congestion control in Data Networks and Internets, Link Level Flow and Error Control, TCP Traffic Control, Traffic and Congestion Control in ATM Networks.

Addressing and Routing: Addressing – Flat, Classless, Hierarchical, Multicast, Anycast Routing, Overview of existing routing, Interior and Exterior Routing Protocols.

Quality of services in IP Networks: Integrated and Differentiated Services, Integrated Services Architecture (ISA), Queueing Discipline, Random Early Detection, Differentiated Services. Protocols for QoS Support, Resource Reservation : RSVP, MultiProtocol label Switching, Real Time Transport Protocol(RTP).

Compression and Future Network Applications: Overview of Information Theory, Information and Entropy, Coding, Lossless Compression- RunTime encoding technique, Facsimile Compression, Arithmetic Coding, String matching algorithm, Lossy Compression: Discrete Cosine Transform, Wavelet Compression, JPEG Image Compression, MPEG Video Compression.

Text :1. William Stallings, “High Speed Networks and Internets – Performance

and Quality of Service”, Pearson India 2005 2. William Stallings, “Data and Communication”, Prentice Hall India 19973. A.S Tanenbaum, “Computer Networks”, Prentice Hall India 1997

Note : 20% choice may be given while setting the question paper

2

2-0-1-3RCC1006. ADVANCED COMPILER DESIGN

Introduction to Advanced Topics Review of compiler phases, Informal Compiler Algorithm Notation, Symbol Table Structure, Intermediate Representations, Run Time Issues, Support for Polymorphic and Symbolic Languages.

Analysis -Control Flow Analysis, Data Flow Analysis, Dependency analysis, Alias analysis

Optimization –Introduction, Review of Early Optimizations, Redundancy Elimination, Loop Optimizations, Procedure Optimization

Machine Dependent tasks- Register Allocation, Local and Global Instruction Scheduling, Advanced Topics in Code Scheduling, Low Level Optimizations, Introduction to inter-procedural analysis and scheduling.

Text 1. Steven Muchnick, “Advanced Compiler Design Implementation”, Morgan

Kauffmann Publishers, 19972. Aho A. V, Sethi R. and Ullman J. D. “Compilers: Principles, Techniques

and Tools”, Addison Wesley, 1986

References

1. Appel A. W. “Modern Compiler Implementation in C”, Cambridge University Press, 2000.

Note : 20% choice may be given while setting the question paper

2

0-0-2-2RCC1101. SEMINAR

The student has to present a seminar in in one of the current topics in the stream of specialization. The student will undertake a detailed study based on current published papers, journals, books on chosen subject, present the seminar and submit seminar report at the end of the semester.

Marks :

Seminar report evaluation : 25Seminar presentation : 25

2

0-0-2-1RCC1102. LABORATORY

Experiments are based on topics covered in Advanced Compiler Design and exercises to be done on

Construction of Control Flow Graph from intermediate codeElimination of unreachable codeLiveness analysisDead code eliminationConversion of intermediate code to Static Single Assignment formConstant propagation on SSA form

2

0-0-0-1RCC1103. PROJECT-Part I

Each student is expected to do a project work independently in any area related to their field of study in Computer Science & Engineering under the guidance of a faculty member. The project has two parts (Part I in Semester I and Part II in Semester II). The project can be conveniently divided into two parts as advised by the guide and the first part is to be completed in the Semester. The student has to submit a report of the work completed in soft bonded form and make a presentation before the evaluation Committee at the end of the semester. The second volume is the final project report to be submitted in the second semester.

Marks :

Project work and report evaluation : 25Presentation & Viva Voce : 25

2

SEMESTER II2-0-1-3

RCC2001. ADVANCED TOPICS IN ALGORITHMS

Review of basic concepts: Worst-case and average case analysis; Big oh, small oh, omega and theta notations, solving recurrence equations. Overview of basic data structures, Advanced data structures, e.g., binomial queues, fibonacci heaps, the union find data structure. Amortization, Self-adjusting and persistent data structures. Applications and analysis. Lower bounds in structured models of computation.

Overview of basic design paradigms such as incremental approach; divide and conquer, greedy paradigm; dynamic programming backtracking; branch and bound; pruning; transformations; preprocessing and case studies illustrating each design methodologies with complete analysis of algorithms. Basics of randomized algorithms, their practical significance.

Advanced graph algorithms, matching, Network flow algorithms, label setting and label correcting algorithms, maximum and minimum flow algorithms, applications to OR/optimization.

Stringology, Pattern matching, BM algorithms, KMP algorithms, Geometric Algorithms- Plane sweep algorithm, convex hull algorithm, Triangulation. Computational number theory, GCD algorithm, Primality tests, quadratic residues, applications to cryptography.

Lower bound theory, Information theoretic bounds. Adversary arguments, NP completeness, Basic techniques for proving NP completeness case studies. Approximate algorithms, Scheduling problems, set cover problem, Bin packing problem, polynomial time approximate schemes.

Text:1. T.H. Cormen, C.E. Leiserson and R.L.Rivest, “Introduction to algorithms”,

Prentice-hall of India Private Limited, New Delhi, 2004. 2. Gilles Brassard and Paul Braatley, “Fundamentals of algorithms”, Prentice-

hall of India Private Limited, New Delhi, 1997. 3. Alfred V. Aho, John E. Hopcroft, and J.D. Ullman. “The Design and

Analysisof Computer Algorithms”. Pearson India.

Reference

1. E. Horowitz, and S. Sahni, “Fundamentals of Computer Algorithms”, Computer Science Press, Galgotia Publications.

Note : 20% choice may be given while setting the question paper

2

2-0-1-3

RCC2002. ADVANCED DATA BASE MANAGEMENT SYSTEMS

Introduction of DBMS: Types of DBMS and their advantages and disadvantagesIntroduction of RDBMS, Types of relational query language, Normalization, Relation and semantic data models, Data dependencies, Synthesis of data base schemas, Query processing and Query optimization. Database protection in RDBMS –Database Integrity, Active and Real Time Databases- Inferences control and Auditing

Distributed Databases: concepts, structure, trade-offs, Homogeneous, Heterogeneous, Federated and Multi database System. Distributed schema design, query processing and optimization. Methods of data distribution –fragmentation, replication, design & advance concepts of DDBMS

Concurrency control and Database Recovery: Transaction Processing with databases, ACID in depth, The success of Transaction Processing based on the strict application of the ACID requirement, Transaction and Serializability of schedules. Lock based and Non locking protocols. Multi level concurrency control schemas, Concurrency control in replicated distributed databases. Commit protocols and database recovery

Introduction to object oriented databases, Deductive databases. Performance evaluation of database systems. An overview of:- Data warehousing Concepts Architecture, Dataflows, Tools & Technologies, Data Mining & OLAP, Spatial & Temporal databases, Multimedia databases. Mobile Databases.

Text:1. Elmasri, Navathe, “Fundamentals of Database Systems”, Pearson Education.2. Henry F. Korth, A Silberschatz, “Database Concepts”, Tata Mc Graw Hill.3. Thomas Conolly, Carolyn Begg, “Database Systems”, Pearson Education.

Reference

1. Alexis Leon, Mathews Leon, “Database Management Systems”. Vikas, 20022. C.J.Date , “An Introduction to DBMS”, Narosa Publishing House.

Note : 20% choice may be given while setting the question paper

LIST OF DEPARTMENT ELECTIVESFOR SEMESTER II

3-0-0-3RCE2001. PARALLEL ALGORITHMS

2

Parallel computer. Need of parallel computers, models of computation, Analyzing algorithms, expressing algorithms. Broadcast, All sums and selection algorithms on SIMD. Searching a sorted sequence – EREW, CREW SMSIMD algorithms. Searching a random sequence – SMSIMD, tree and Mesh interconnection super computers.

Sorting – Sorting on a linear array, sorting on a mesh, sorting on EREW SIMD computer, MIMD enumeration sort, MIMD quick sort, sorting on other networks. Matrix Transposition, Mesh transpose, shuffle transpose, EREW transpose.

Matrix operations – matrix- by matrix multiplications, mesh multiplications, cube multiplication, Matrix by vector multiplication. Linear array multiplication, tree multiplications. Solving numerical problems, solving systems of linear equations- SIMD algorithms and MIMD algorithms.

Numerical problems – finding roots of nonlinear equations – SIMD and MIMD algorithms, solving partial differential equations, computing eigen values.

Graph theoretical problems – solving graph theoretical problems, computing connectivity matrix, finding connected components, all pairs shortest path, traversing combinatorial spaces, sequential tree traversals, Minimal alpha- Beta tree , MIMD Alpha-Beta algorithms, parallel cut-off storage requirements, recent trends and developments.

Text:1. S.G.Akl, “Design and Analysis of parallel algorithms”, Prentice--Hall

International Editions (Prentice--Hall, Inc. 1989).

References:1. S.G.Akl, “Parallel Sorting algorithm”, Academic Press, 19852. M.J.Quin, “Parallel computing – theory and practice”, McGraw-Hill, New

York, 1994.3. S. Lakshmivarahan and S.K.Dhall, “Analysis and design of parallel

algorithms – Arithmetic & Matrix problems”, by McGraw-Hill, New York, 1990

1. V. Kumar, A. Grama, A. Gupta, and G. Karypis, “Introduction to Parallel Computing”, San Francisco: Benjamin Cummings / Addison Wesley, 2002

Note : 20% choice may be given while setting the question paper

3

2-0-1-3

RCE2002. SECURITY IN COMPUTING

Computer security, attacks, computer criminals, defense methods, cryptography, substitution ciphering, transpositions, DES, AES, public-key encryption, uses of encryption.

Program security, secure programs, viruses and other malicious code, control against program threats, protection in general-purpose OS, protected resources and methods of protection, user authentication.

Designing trusted OS, models of security, database security, security requirements, reliability and integrity, inference. Multi level data bases.

Threats in networks, network security controls, firewalls, secure e-mail, intrusion detection, administering security, Legal, privacy, and ethical issues in computer security. Case studies.

Text

1. C. P. Pfleeger and S. L. Pfleeger, “Security in Computing”, 3/e, Pearson Education, 2003.

2. Stallings W., “Cryptography and Network Security Principles and Practice”, 3/e, Pearson Education Asia, 2003.

References

1. Stallings W., “Network Security Essentials: Applications and Standards”, Pearson Education Asia, 2002

Note : 20% choice may be given while setting the question paper

3

2-0-1-3

RCE2003. CRYPTOGRAPHY

Preliminaries : Origins of Cryptography – Issues in Cryptography – codes and Ciphers – review of complexity results – Preliminary ideas of factoring and primality testing – gcd and its complexity – review of finite fields and cyclic groups.

Symmetric Key Cryptosystems - Block ciphers : affine Ciphers, Substitution ciphers, Vigenere, Hill Cipher – DES, Feistel Ciphers and the problem of breaking them, Congruences, Complete residue systems-Modular Arithmetic – The field Z/pZ – Euler’s Theorem and Fermat’s Little theorem – Euler’s ф function – Chinese Remainder Theorem.

Stream Ciphers : Information Theoretic considerations – Linear feedback shift registers and associated results - Geffe Geneartor – one way functions and Trapdoor – Diffe Hellman Key Exchange – Bit commitment using symmetric key.

Public key Cryptosystems : Discrete Logarithm, hash functions, RSA and its correctness – Modular Exponentiations – Miller Rabin – Selfridge Primality testing – El Gammal Crypto systems – Authentication – Digital Signatures – Merkle – Hellman knapsack Public Key Cipher

Factoring and other Topics : Pollard ҏρ –heuristic – Pollard ҏ - 1 Algorithm, Continued Fraction factoring Algorithm. Quadratic Sieve algorithm, Number Field Sieve, Zero knowledge proof idea recent developments.

Text:

1. William Stallings, “Cryptography and Network Security”, PHI

Reference:

1. A.J.Menezes, P. Van Oorschot and S. Vanstone, “Handbook of Applied Cryptography”, CRC Press

2. Koblitz. N, “Course on Number Theory and Cryptography”, Springer Verlag, 1986.

Note : 20% choice may be given while setting the question paper

3-0-0-3

RCE2004. PARALLEL COMPUTING

Introduction : Paradigms of parallel computing: Synchronous – vector/array, SIMD, Systolic; Asynchronous – MIMD, reduction paradigm.

3

Hardware taxonomy : Flynn’s classifications, Handler’s classifications.Software taxonomy : King’s taxonomy, SPMD.

Abstract parallel computational models : Combinational circuits – Sorting network, PRAM models, Interconnection RAMs. Parallelism approaches – data parallelism, control parallelismPerformance Metrices: Laws governing performance measurements. Metrices-speedups, efficiency, utilization, communication overheads, single/multiple program performances, benchmarks.

Parallel Processors: Taxonomy and topology – shared memory multiprocessors, distributed memory networks. Processor organization – static and dynamic inter connections. Embeddings and simulations.

Parallel Programming: Shared memory programming, distributed memory programming, object oriented programming, data parallel programming, functional and data flow programming.

Scheduling and parallelization: Scheduling parallel programs. Loop scheduling. Parallelization of sequential programs. Parallel programming support environments.

Text :

1. M.J. Quinn. “Parallel Computing: Theory and Practice”, Mc Graw Hill, New York, 1994.

2. T.G. Lewis and H. El.Rewini, “Introduction to Parallel Computing”, Prentice Hall, New Jersey, 1992.

3. T.G. Lewis. “Parallel Programming : A Machine Independent Approach”, IEEE Computer Society Press, Los Alamitos, 1994.

Note : 20% choice may be given while setting the question paper

2-1-0-3RCE2005. COMPUTATIONAL GEOMETRY

Geometric Preliminaries, DCEL ( Doubly Connected Edge List) data structure, Geometric Duality, Geometric Searching - Planar Straight Line Graph (PSLG), Point Location Problem, Location of a point in a planar subdivision, Plane Sweep Algorithm, Slab method, Chain method, Regularization of PSLG , Range Searching Problems.Convex Hulls, Convex Hull Algorithms in the Plane -- Graham’s Scan Algorithm, Jarvi’s March, Divide and Conquer Algorithm, Dynamic Convex Hull Algorithm.

3

Triangulation—Triangulation of a point set, Triangulation Algorithms, Polygon Triangulation, Convexity, Helly’s theorem, Delauny Triangulation

Voronoi Diagrams- Applications in the plane , Post Office Problem. Arrangements of Lines-- Zone Theorem, Many Faces in arrangements, Constructing the arrangements, Forbidden graph theorem, Bipartite graph for many face problems

Randomized Algorithms, Many face complexity. Linear Programming—Linear Programming in Two Dimensions, Prune-- Eliminate Redundant Half- Planes, Bisect—Decrease the Range of the Linear Program, The geometry of pruning, bisecting and searching.

Introduction to Visibility Problems-- Definition of direct visibility, Point visibility and Edge visibility, Algorithm for computing point-visible region inside a polygon, Kernel of polygon , Linear time algorithm for computing Kernel.

Text:

1. Franco P. Preparata, Michael Ian Shamos, “Computational Geometry- An Introduction”, Texts and Monographs in Computer Science , Springer – Verlag

2. Herbert Edelsbrunner , “Algorithms in Combinatorial Geometry”, EATCS Monographs on theoretical computer science, Springer – Verlag.

3. Art Gallery Theorems, Joseph O’ Rourke, Oxford Press.

References :

3. J. Laszlo Michael, “Computational Geometry and Computer Graphics in C++” , Prentice- Hall of India, 1999.

Note : 20% choice may be given while setting the question paper

3

2-0-1-3RCE2006. ADVANCED COMPUTER GRAPHICS

Introduction: Applications of computer graphics, Elements of pictures created in computer graphics, Graphics display devices. Basic raster graphics algorithms for drawing 2D primitives: Midpoint line & circle algorithm, 2D geometric transformations and 2D viewing: Basic transformations, Matrix representations and homogeneous coordinates, Composite transformations.

3D concepts & 3D object representations: Polygon surfaces, Curved lines and surfaces, Quadric surfaces, Spline representations, Bezier curves and surfaces, B-spline curves and surfaces. 3D geometric transformations and 3D viewing: Translation, Rotation, Scaling, Viewing pipeline, Viewing coordinates, Parallel projections & Perspective projections.

Device-independent programming and OpenGL. User Interface Software,Graphics Standard, Open GL, Solid Modeling, Achromatic and Coloured light: Representing solids, Regularized Boolean set operations, Primitive instancing, Sweep representations, Boundary representations, Spatial-partitioning representations, Constructive solid geometry, Comparison of representations, User Interfaces for solid modeling. Achromatic light, Chromatic colour, Colour models for raster graphics, Reproducing colour, Using colour in computer graphics.

Visible-surface detection methods: Classification, Back-face detection, Depth-buffer method, Scan-line method, Depth-sorting method, BSP-tree method & Area-subdivision method, Visible-surface ray tracing. Illumination and shading: Illumination models, Shading models for polygons, Surface details, Shadows, Transparency.

Text 1.James D. Foley, Andries Van Dam, Steven K. Feiner & John F. Hughes,

“Computer Graphics Principles & Practice, Second Edition in C”, Pearson Education.

2.Donald Hearn & M. Pauline Baker, “Computer Graphics, C Version, Second Edition”, Pearson Education.

3.Francis S Hill Jr, “Computer Graphics Using Open GL”, Pearson India 4.Dave Shreiner , Mason Woo, Jachie Neider, Tom Davis “ Open GL

Programming Guide”, Pearson India.

Reference 1. A. Plastock & Zhigang Xiang, “Schaum’s Outline of Computer

Graphics”, Second Edition, Tata McGraw-Hill

Note : 20% choice may be given while setting the question paper

3

2-0-1-3RCE2007. SOFT COMPUTING

Neural Networks: History, overview of biological Neuro-system, Mathematical Models of Neurons, ANN architecture, Learning rules, Learning Paradigms-Supervised, Unsupervised and reinforcement Learning.

ANN training Algorithms-perceptions, Training rules, Delta, Back Propagation Algorithm, Multilayer Perceptron Model, Hopfield Networks, Associative Memories, Applications of Artificial Neural Networks.

Fuzzy Logic: Introduction to Fuzzy Logic, Classical and Fuzzy Sets: Overview of Classical Sets, Membership Function, Fuzzy rule generation.

Operations on Fuzzy Sets: Compliment, Intersections, Unions, Combinations of Operations, Aggregation Operations. Fuzzy Arithmetic: Fuzzy Numbers, Linguistic Variables, Arithmetic Operations on Intervals & Numbers, Lattice of Fuzzy Numbers, Fuzzy Equations.

Fuzzy Logic: Classical Logic, Multivalued Logics, Fuzzy Propositions, Fuzzy Qualifiers, Linguistic Hedges. Uncertainty based Information: Information & Uncertainty, Nonspecificity of Fuzzy & Crisp Sets, Fuzziness of Fuzzy Sets.

Introduction of Neuro-Fuzzy Systems: Architecture of Neuro Fuzzy Networks. Application of Fuzzy Logic: Medicine, Economics etc. Genetic Algorithm: An Overview, GA in problem solving, Implementation of GA

Text:1. Anderson J.A., “An Introduction to Neural Networks”, PHI, 1999.2. Hertz J. Krogh, R.G. Palmer, “Introduction to the Theory of Neural

Computation”, Addison-Wesley, California, 1991.3. G.J. Klir & B. Yuan, “Fuzzy Sets & Fuzzy Logic”, PHI, 1995.4. Melanie Mitchell, “An Introduction to Genetic Algorithm”, PHI, 1998.Reference:1. Simon Haykin, “Neural Networks-A Comprehensive Foundations”,

Pearson India, 20051. Freeman J.A. & D.M. Skapura, “Neural Networks: Algorithms,

Applications and Programming Techniques”, Addison Wesley, Reading, Mass, (1992).

Note : 20% choice may be given while setting the question paper

3

2-0-1-3RCE2008. DATA WAREHOUSING

Data Warehousing: Introduction to Data Warehousing: Evolution of Data Warehousing, Data Warehousing concepts, Benefits of Data Warehousing, Comparison of OLTP and Data Warehousing, Problems of Data Warehousing.

Data Warehousing Architecture, Operational Data and Datastore, Load Manager, Warehouse Manager, Query Manager, Detailed Data, Lightly and Highly summarised Data, Archive/Backup Data, Meta-Data, architecture model, 2-tier, 3-tier and 4-tier data warehouse, end user Access tools.

Data Warehousing Tools and Technology- Tools and Technologies: Extraction, cleaning and Transformation tools, Data Warehouse DBMS, Data Warehouse Meta-Data, Administration and management tools, operational vs. information systems. OLAP & DSS support in data warehouse.

Distributed Data Warehouse- Types of Distributed Data Warehouses, Nature of development Efforts, Distributed Data Warehouse Development, Building the Warehouse on multiple levels.

Types of Data Warehouses & Data Warehouse Design- Host based, single stage, LAN based, Multistage, stationary distributed & virtual data-warehouses. Data warehousing Design: Designing Data warehouse Database, Database Design Methodology for Data Warehouses, Data Warehousing design Using Oracle.

Overview of Data Mining and OLAP- Knowledge discovery : Knowledge discovery through statistical techniques, Knowledge discovery through neural networks, Fuzzy technology & genetic algorithms.

Text:

1. W.H.Inmon, “Building the Data Warehouse”, 3rd Edition, John Wiley & Sons.2. W.H.Inmon, C.Kelly,“Developing the Data Warehouse”, John Wiley & Sons.3. Thomas Connoly, Carolyn Begg-“Database Systems-A practical approach

to Design, Implementation and management” 3rd Edition Pearson Education

Reference:

1. W.H.Inmon, C.L.Gassey, “Managing the Data Warehouse”, John Wiley & Sons.

1. Fayyad, Usama M. et. al., “Advances in knowledge discovery & Data Mining”, MIT Press.

Note : 20% choice may be given while setting the question paper

3

2-0-1-3RCE2009. PATTERN RECOGNITION

Introduction- Introduction to statistical, syntactic and descriptive approaches, features and feature extraction, learning. Bayes Decision theory- introduction, continuous case, 2-category Classification, minimum error rate classification, classifiers, discriminant functions, and decision surfaces. Error probabilities and integrals, normal density, discriminant functions for normal density, Bayes Decision theory Discrete case.

Parameter estimation and supervised learning- Maximum likelihood estimation, the Bayes classifier, learning the mean of a normal density, general bayesian learning. Nonparametric technic- density estimation, parzen windows, k-nearest Neighbor estimation, estimation of posterior probabilities, kn nearest neighbor rule, nearest- neighbor rule, k-nearest neighbor rule.

Linear discriminant functions- linear discriminant functions and decision surfaces, generalized linear discriminant functions, 2-category linearly separable case, non-separable behavior, linear programming procedures. Multiplayer neural networks- Feed forward operation and classification, Back propagation algorithm, error surfaces, back propagation as feature mapping, practical techniques for improving back propagation.

Supervised learning and clustering- Mixture densities and identifiably, maximum likelihood estimates, application to normal mixtures, unsupervised Bayesian learning, data description and clustering, Hierarchical clustering, low dimensional representation of multidimensional map

Text 1. Duda and Hart P.E, “Pattern classification and scene analysis”, John wiley

and sons, NY, 1973.2. Earl Gose, Richard Johnsonbaugh, and Steve Jost; “Pattern Recognition

and Image Analysis”, PHI Pvte. Ltd., NewDelhi-1, 1999.

References:1. Fu K.S., “Syntactic Pattern recognition and applications”, Prentice Hall,

Eaglewood cliffs, N.J., 19822. Rochard O. Duda and Hart P.E, and David G Stork, “Pattern classification,

2nd Edn.”, John Wiley & Sons Inc., 2001.

Note : 20% choice may be given while setting the question paper

3

INTER DISCIPLINARY ELECTIVES FOR SEMESTER II2-1-0-3

RCI2001. OBJECT ORIENTED MODELING AND DESIGN

Structural Modeling: Object Oriented Fundamentals, Basic structural Modeling, UML Model, Class Diagrams, Object Diagrams, Packages and Interfaces, Case Studies.

Behavioral and architectural Modeling: Use Case Diagrams, Interaction Diagrams, State Chart Diagrams, Collaborations, Design Patterns, Component Diagrams, Deployment Diagrams, Case Studies

Object oriented Testing Methodologies: Implications of Inheritance on Testing, State Based Testing, Adequacy and Coverage, Scenario Based Testing, Testing Workflow, Case Studies, Object Oriented Metrics

Components: Abuses of inheritance, danger of polymorphism, mix-in classes, rings of operations, class cohesion and support of states and behavior, components and objects, design of a component, lightweight and heavy weight components, advantages and disadvantages of using components.

Text

1. Page Jones M., “Fundamentals of Object Oriented Design in UML”, Pearson Education

2. Booch G., Rumbaugh J. & Jacobsons I., “The Unified Modeling Language User Guide”, Addison Wesley

3. Bahrami A., “Object Oriented System Development”, McGraw Hill

References

1. Baugh J., Jacobson I. & Booch G., “The unified Modeling Language Reference Manual”, Addison Wesley

2. Man C., “Applying UML & Patterns: An Introduction to Object – Oriented Analysis & Design”, Addison Wesley

3. Ooley R. & Stevens P., “Using UML: Software Engineering with Objects & Components”, Addison Wesley

Note : 20% choice may be given while setting the question paper

3

2-0-1-3

RCI2002 . EMBEDDED & REAL TIME SYSTEMS

Introduction: An Embedded System; Characteristics of Embedded Systems; Software embedded into a system; Real Time Definitions, Events and Determinism, Synchronous & Asynchronous Events, Determinism, Time-Loading, Real-Time Design Issues, Example Real Time Systems. Embedded Microcontroller Cores and Architecture: 8051 micro controller; Architecture; Instruction sets; Assembly language programming; I/O port programming; Timer / counter programming, Serial Communication; Interrupts programming. Real Time specifications and design technique: Mathematical specifications, flow charts, structure charts, Finite state automata, data flow diagrams, Petri Nets, Warnier Orr Notation, State charts.Processor And Memory Organization: Structural Units in a Processor; Memory Devices, Memory selection for an embedded system; Direct Memory Access, DMA controllers; Interfacing Processor, Memory and I/O Devices; Interrupt servicing (handling) mechanism; Context and the periods for context-switching; Deadline and interrupt latency.Language Features: Parameter passing, Recursion, Dynamic allocation, Typing, exception handling, abstract data typing. Real Time Kernels: Real Time and Embedded Operating Systems; Interrupt Routines in RTOS environment; co routines, Interrupt driven systems, Foreground/background systems, Full-featured Real Time Operating Systems.Inter-Process Communication and Synchronisation Of Processes: Multiple processes in an application; Problem of sharing data by multiple tasks and routines; Inter Process Communication, Mailboxes, Critical Regions, Semaphores, Deadlock.Programming Languages and Tools: Desired language characteristics; Data typing; Control Structures; Packages; Exception Handling; Overloading; Multitasking; Task Scheduling; Timing specification; Programming environments; Runtime support.System Performance Analysis and Optimisation: Response time calculations, Interrupt latency, Time-loading and its Measurement, Reducing response times and time loading, I/O performanceFault Tolerance and Reliability: Reliability definitions, Testing: unit and system level; Fault tolerance-N-version programming, built in test software, CPU and Memory testing.

Text:1. Rajkamal; “Embedded Systems Architecture; Programming and Design”; Tata

McGraw Hill Publications.2. Phillip A. Laplante, “ Real –Time Systems Design and Analysis” -3rd Edition,

Apr 2004. Wiley-IEEE Press

References1. C.M. Krishna; Kang G.Shin; “Real Time Systems”; McGraw-Hill; 1997.2. Mohammed Ali Mazidi; Janice Gillispie Mazidi “The 8051

Microcontroller and Embedded Systems”; Pearson Education Asia 2002.3. David E Simon, “An Embedded software primer”; Addison Wesley; 2000.4. Raymond J.A. Buhr; Donald L. Bailey; “An Introduction To Real Time

Systems”; Prentice Hall International; 1999.

4

5. Rajkamal, “Microcontrollers: Architecture, Programming, Interfacing and System Design”, Pearson Education.

Note : 20% choice may be given while setting the question paper

4

3-0-0-3

RCI2003. SOFTWARE PROJECT MANAGEMENT

Introduction to Software Project Management: Software development as a project; Stakeholders in software project; Software product, process, resources, quality, and cost; Objectives, issues, and problems relating to software projects.

Overview of Project Planning: Steps in project planning; Defining scope and objectives; work breakdown structure; Time, cost, and resource estimation; Alternatives in planning

Project Evaluation: Strategic assessment; Technical assessment; Cost-benefit analysis; Cash flow forecasting; Cost-benefit evaluation techniques; Break-even analysis; Risk evaluation

Selection of Appropriate Project Approach: Choosing development technology and methodology; choice of process model; Rapid application development; Waterfall model; V-process model; Spiral model; Prototyping; Incremental delivery.

Software Effort Estimation Problem in software estimation; Effort estimation techniques; Expert judgement; Estimation by analogy; Delphi technique; Algorithmic methods; Top-down and bottom-up estimation; Function point analysis; Object points; COCOMO model.

Activity Planning Network planning model; Activity-on-arrow network; Precedence network; Forward pass; Backward pass; Critical path; Slack and float.

Risk Analysis and Management Nature and categories of risk in software development; risk Identification; Risk assessment; Risk mitigation, monitoring, and management; Evaluating schedule risk using PERT.

Recourse Allocation Nature of project resources; Identifying resource requirement of activities; Allocating and scheduling resources; cost of resources; Standard, planned, and actual cost; Cost variance; time-cost trade-off.

Project Tracking and Control Measurement of physical and financial progress; Earned value analysis; Status reports; Milestone reports; Change control.

Contract Management Outsourcing of products and services; Types of contracts; Stages in contract placement; Terms of contract; Contract monitoring; Acceptance testing

Managing People and Organizing Teams Organizational behaviour; Recruitment and placement; Motivation; Group behaviour; Individual and group decision making; Leadership and leadership styles; forms of organizational structures.

Software Quality Assurance Planning for quality; Product versus process quality management; Procedural and quantitative approaches; Defect analysis and

4

prevention; Statistical process control; Pareto analysis; Causal analysis; Quality standards; ISO 9000; Capability Maturity Model; Quality audit.

Configuration Management Configuration management process; Software configuration items; Version control; change control; Configuration audit; Status reporting.

Text:1. Bob Hughes and Mike Cotterell, “Software Project Management”, Third

Edition 2002, McGraw-Hill 2. Pankaj Jalote, “Software Project Management in Practice”, 2002, Pearson

Education Asia.

Reference:1. Roger S. Pressman, “Software Engineering: A practitioner’s Approach”,

Fifth Edition 2001 McGraw-Hill2. Robert T. Futrell, Donald F. Shafer, and Linda I.. Shafer, “Quality

Software Project Management” 2002, Pearson Education Asia.3. Ramesh Gopalaswamy, “Managing Global Software Projects”, 2003, Tata

McGraw-Hill

Note : 20% choice may be given while setting the question paper

4

2-0-1-3RCI2004. .NET PROGRAMMING

.Net architecture, Namespheres, Assemblies, object oriented features, memory management, interoperation with IOM, transaction in .NET, Structured exception handling, code access security. VB.NET Similarities & differences with Visual Basic, windows focus, ADO.NET, working with databases, object oriented features. ASP.NETSimilarities & difference with ASP, Architecture, web-form, development, XML, databases interface. C++ .NETSimilarities & differences with C/C++, Creating components, window four, menus, validation, database interface. .NETSecurity framework, .NET performance counters, Managed / Unmanaged code, .NET configuration files.

Text1. A. Chakraborti et. al., “Microsoft .NET framework”, PHI, 20022. M. Reynolds et. al., “.NET Enterprise”, Wrox/SPD, 20023. J. P. Hamilton, “Object Oriented Programming with VB .NET”, O’reilly, 2002

Note : 20% choice may be given while setting the question paper

4

0-0-2-2RCC2101. SEMINAR

Each student is required to select a topic on advanced technologies in Computer Science / Information Technology, and get it approved for a seminar to be presented in the class. Each student should also prepare a well documented report on the seminar as per an approved format and submit to the department. The seminar and report will be evaluated for the award of sessional marks.

The seminar, which she/he has to credit in this semester, would be on another topic different from their project work.

Marks :

Seminar report evaluation : 25Seminar presentation : 25

4

0-0-2-1

RCC2102. LABORATORY

Experiments are based on topics covered in Advanced Operating Systems and exercises to be carried out on

Process schedulingIPC & synchronizationMemory managementFile systemsSecurityDevice drivers and input/output

4

0-0-0-2RCC2103. PROJECT - Part II

The student has to undertake an individual project work, submit a project report, which will be evaluated by the Evaluation Committee.

Marks :

Project work & report evaluation : 50Presentation & Viva Voce : 50

SEMESTER III

LIST OF DEPARTMENT ELECTIVES FOR SEMESTER III3-0-0-3

4

RCE3001. SOFTWARE TESTING

Introduction: What is software testing and why it is so hard?, Error, Fault, Failure, Incident, Test Cases, Testing Process, Limitations of Testing, No absolute proof of correctness, Overview of Graph Theory.

Functional Testing: Boundary Value Analysis, Equivalence Class Testing, Decision Table Based Testing, Cause Effect Graphing Technique.Structural Testing: Path testing, DD-Paths, Cyclomatic Complexity, Graph Metrics, Data Flow Testing, Mutation testing.

Reducing the number of test cases: Prioritization guidelines, Priority category, Scheme, Risk Analysis, Regression Testing, Slice based testingTesting Activities: Unit Testing, Levels of Testing, Integration Testing, System Testing, Debugging, Domain Testing.

Object Oriented Testing: Issues in Object Oriented Testing, Class Testing, GUI Testing, Object Oriented Integration and System Testing.

Testing web applications, testing mobile applications Testing Tools: Static Testing Tools, Dynamic Testing Tools, Characteristics of Modern Tools.

Text:1. William Perry, “Effective Methods for Software Testing”, John Wiley &

Sons, New York, 1995.2. Cem Kaner, Jack Falk, Nguyen Quoc, “Testing Computer Software”,

Second Edition, Van Nostrand Reinhold, New York, 1993.3. Boris Beizer, “Software Testing Techniques”, Second Volume, Second

Edition, Van Nostrand Reinhold, New York, 1990.4. Louise Tamres, “Software Testing”, Pearson Education Asia, 2002 Reference:1. Roger S. Pressman, “Software Engineering – A Practitioner’s Approach”,

Fifth Edition, McGraw-Hill International Edition, New Delhi, 2001.2. Boris Beizer, “Black-Box Testing – Techniques for Functional Testing of

Software and Systems”, John Wiley & Sons Inc., New York, 1995.1. K.K. Aggarwal & Yogesh Singh, “Software Engineering”, New Age

International Publishers, New Delhi, 2003.

Note : 20% choice may be given while setting the question paper

4

2-0-1-3

RCE3002. IMAGE PROCESSING

Introduction - digital image representation - fundamental steps in image processing - elements of digital image processing systems - digital image fundamentals - elements of visual perception - a simple image model - sampling and quantization - basic relationship between pixels – image geometry - image transforms - introduction to Fourier transform – discrete Fourier transform - some properties of 2d-fourier transform (DFT)- other separable image transforms - hotelling transform

Image enhancement - point processing - spatial filtering - frequency domain - image restoration - degradation model - diagonalization of circulant and block circulant matrices - inverse filtering - least mean square filter

Image compression - image compression models - elements of information theory - error-free compression - lossy compression - image compression standards

Image reconstruction from projections - basics of projection - parallel beam and fan beam projection - method of generating projections - Fourier slice theorem - filtered back projection algorithms - testing back projection algorithms

Text:1. Rafael C., Gonzalez & Woods R.E., “Digital Image Processing”, Pearson

Education.Reference:1. Rosenfeld A. & Kak A.C., “Digital Picture Processing”, Academic Press2. Jain A.K, “Fundamentals of Digital Image Processing”, Prentice Hall,

Eaglewood Cliffs, NJ3. Schalkoff R. J., “Digital Image Processing and Computer Vision”, John

Wiley4. Pratt W.K., “Digital Image Processing”, John Wiley

Note : 20% choice may be given while setting the question paper

2-0-1-3RCE3003. MOBILE COMPUTING

Introduction to wireless, mobile and cellular mobile systems : Wireless transmissions, signal propagation, multiplexing, modulation, spread spectrum, cellular mobile telephone systems, basic cellular system, analog and digital

4

cellular systems - Elements of cellular radio system design – frequency reuse, co channel interference, cell splitting.

Medium access control : Motivation specialized MAC, SDMA, FDMA, TDMA, CDMA, Frequency management and channel assignment – fixed, non-fixed channel assignment algorithms, Hand off and dropped calls-initiation of handoff, delaying, forced handoff, queuing handoff, power difference, mobile assisted cell-site and inter system handoff.

Mobile telecommunication standards, satellite and broadcast systems: GSM, DECT, TETRA, UMTS and IMT 2000, CTEO, LEO and MEO, Digital audio and video broadcasting, Wireless LANs IEEE 802.11, HIPERLAN, Bluetooth

Network support for mobile systems : Cellular analog, cellular digital switching equipment, MTSO interconnection, mobile network layer-IP packet delivery, advertisement and discovery, registration, tunneling and encapsulation, reverse tunneling, IPV6, DHCP, adhoc networks, Wireless ATM-WATM services, reference model, functions, radio access layer, handover, location management, addressing, mobile QoS, access point control protocol.

Mobile Transport and application layer protocol. Review of traditional TCP, Indirect TCP, Snooping TCP, mobile TCP, fast retransmit/fast recover, transmission/timeout freezing, selective retransmission, transaction oriented TCP, file systems, WWW, WAP

Text

1. JOCHEN SCHILLER, “Mobile communication”, Pearson Education Asia Publications , 2000.

2. WILLIAM C.Y.Lee , “Mobile Cellular Telecommunication”, McGraw Hill International Editions, 1995.

Note : 20% choice may be given while setting the question paper

2-0-1-3

RCE3004. DATA MINING

Introduction, Data warehousing – Multidimensional datamodel, OLAP operation, Warehouse schema Data Wareshousing architecture, warehouse server, Metadata, OLAP engine, Datawarehouse Backend Process. Data Mining – Data Mining Tasks –Knowledge Discovery DataBase Vs Data mining, Datamining Issues, DBMS Vs Data mining. Data mining techniques, Other mining problems, Issues and challenges in datamining, datamining application areas, Datamining applications.

5

Classification – statistical based algorithm, Distance based algorithm, Decision Tree Based AlgorithmAssociation Rules – Introduction, Methods to discover association rules, A Priori algorithm, Partition algorithm, Pincer – search algorithm, Dynamic Itemset counting algorithm, FP-tree growth algorithm, Discussion on different algorithms, Incremental algorithm, Boder algorithm, Generalized association rule. Clustering techniques- Hierarchical algorithm, Partitioning algorithm, Clustering large databases, Comparison of different clustering algorithms

Decision trees – Introduction, Tree construction Principle, Best split, splitting Indices, Splitting criteria, Decision tree constructive algorithms, CART, ID3, C4.5 Rainforest, Approximate methods, CLOUDS, BOAT, Pruning techniques, Integrating of pruning and construction.Neural network, Learning in neural network, unsupervised learning, Data mining using Neural Networks, Genetic algorithm, Rough sets, support vector machines. Web Mining. Web content mining- web structure mining, web usage mining

Temporal and Spatial Data Mining – Introduction, What is Temporal Data mining? Various Temporal association rules, sequence mining, The GSP algorithm, SPADE, SPIRIT, WUM, Episode discovery, Event Prediction problem, Time-series analysis, spatial association rules, spatial classifications, spatial mining, spatial Mining tasks, spatial clustering algorithms, spatial trends.

Books :1. Margaret H Dunham, “Data Mining – Introductory and Advanced Topics”,

Pearson India, 2005.2. Arun K. Pujari, “Data Mining Techniques”, Universities Press 2001.3. Alex Berson, Stephen smith & Kurt Thearling, “Building Data Mining

Applications for CRM”, Tata Mcgraw – Hill.

References:8. Richard J Roiger, Michael W Geatz, “Data Mining A Tutorial Based

Primer”, Pearson India 2005

Note : 20% choice may be given while setting the question paper

5

3-0-0-3

RCE3005. FAULT TOLERANT SYSTEMS

Basic concept of reliability - definition, reliability and failure rate, relation between reliability and meantime between failures, maintainability, series and parallel systems. Fault in digital system - failure and fault, modeling of faults, temporary fault. Test generation- fault diagnosis of digital systems, test generation for combinational logic circuits, detection of multiple faults in combinational logic circuits, random testing, signature analysis.

Fault tolerant design of digital systems - The importance of fault tolerance, basic concepts, static redundancy, hybrid redundancy, self-purging redundancy, sift-out modular redundancy, SMR reconfiguration scheme, Fault tolerant design of memory system using error correcting codes, time redundancy, software redundancy, Fail-soft operation, Practical fault tolerant systems, A scheme for fault tolerant design of VLSI chips.

Self-checking and fail-safe logic- Introduction, design of totally self-checking checkers self-checking sequential machines, partially self checking circuits, strongly fault-secure circuits, fail-safe design, totally self checking PLA design.

Design for testability- What is testability?, controllability and observability, design of testable combinational logic circuits, Testable design of sequential circuits, The Scan-path techniques for testable sequential circuit design, Level- sensitive scan design (LSSD). Random access scan technique, Built-in test, Design for autonomous self-test. Designing testability into logic boards.

Text 1. Parag K Lala, “Fault tolerant and fault testable hardware design”, PHI

International

Note : 20% choice may be given while setting the question paper

2-0-1-3

RCE3006. DISTRIBUTED COMPUTING

5

Distributed Systems: Characterization of Distributed Systems, System Models-architectural and fundamental models, Networking and Inter networking, Inter Process communication.

Distributed Objects and Remote Invocation, RPC, Processes and threads, Security, Digital Signatures, Cryptography pragmatics, Distributed File systems.

Name Services and Domain Name System, Directory and Discovery Services, Synchronizing physical clocks, logical time and logical clocks, Distributed Mutual Exclusion, Elections.

Transactions and Concurrency Control, Distributed Transactions, Distributed Deadlocks, Transaction Recovery, Fault-tolerant Services, Distributed Shared Memory, CORBA Case Study.

Text1. Coulouris G., Dollimore J. & Kindberg T., "Distributed Systems Concepts

And Design", Pearson Education2. Tanenbaum A.S, Maarten V.S., “Distributed Systems Principles and

Paradigms”, PHI

References1. Chow R. & Johnson T., "Distributed Operating Systems and Algorithms",

Addison Wesley2. Tanenbaum A. S., "Distributed Operating Systems", PHI

Note : 20% choice may be given while setting the question paper

0-0-0-1RCC3101. RESEARCH METHODOLOGY

Introduction – Meaning of Research – Objectives of research – motivation in research – types of research – research approaches – significance of research – research methods Vs methodology – criteria for good research.

Defining research problem – what is a research problem - selecting the problem- necessity of defining the problem – literature review – importance of literature review in

5

defining a problem – critical literature review – identifying gap areas from literature review.

Research design – meaning of research design–need – features of good design- important concepts relating to research design – different types – developing a research plan.

Method of data collection – collection of data – observation method – interview method – questionnaire method – processing and analyzing data – processing options – types of analysis – interpretations of results.

Report writing – types of reports – research report, research proposal, technical paper-significance – different steps in the preparation – layout, structure and language of typical reports – simple exercises – oral presentation – planning, preparation, practice – making presentation – answering questions – use of visual aids – quality and proper usage – importance of effective communication with illustrations.

References :

1. Coley SM & Scheinberg CA, 1990, Proposal Writing, Newbury – Sage Publications.

2. Leedy PD, Practical Research -Planning and Design, 4th edition, MW Mac Millan Publishing Co.

3. Day Ra How to write and Publish a scientific paper”, Cambridge University Press 1989

4. Earl Babbie – The Practice of Social Research – Wordsworth Publishing Company – 1994

5. Institute of town Planners – India6. C.S. Yadav – City Planning – Administration & Participation7. J.H. Ansari, Mahavir – ITPI reading Material on Planning Techniques.

0-0-0-1

RCC3102. INDUSTRIAL TRAINING

For crediting the industrial Training/Interaction, the student has to undertake a training in an Industrial organization /R&D organisation/ Planning & Design organisation for a period of not less than two weeks and not more than 4 weeks. The aim of the Industrial Training/Interaction is to orient the student towards their thesis work. The Industrial Training/Interaction course would begin soon after their second semester exams have ended. They have to submit a report of the Industrial Training/Interaction programme and present it before the Evaluation Committee. The report shall be approved by the organization / industry where the student has undergone the training.

Marks:

5

Evaluation of reports : 25Seminar presentation : 25

5

0-0-14-4RCC3103. THESIS PRELIMENARY

The main objective of the Thesis is to provide an opportunity to each student to do an independent study and research on the area of specialization. The student is required to explore in depth and develop a topic of his/her own choice, which adds significantly to the body of knowledge existing in the relevant field. The student has to undertake and complete preliminary work on the stream of specialization during the semester. The fourth semester Thesis shall be an extension of this work in the same area. The student has to present Seminars and submit an interim Thesis Report. The Seminar and Report shall be evaluated by the Evaluation Committee. The first Seminar would highlight the topic, objectives, methodology and expected results. The first Seminar shall be conducted in the first half of this semester. The second Seminar is presentation of the interim Thesis Report of the work they have completed and scope of work which is to be accomplished in the fourth semester.

Marks :

Evaluation of the Thesis -preliminary work by the guide : 100 Evaluation of the Thesis -preliminary work by the Evaluation Committee : 100

SEMESTER – IV0-0-29-12

RCC4101. THESIS

The student has to continue the Thesis work identified In the Third semester . There shall be two seminars (Mid term evaluation on the progress of the work and

5

the Pre-submission seminar to assess the quality and quantum of the work). At least one technical paper is to prepared for possible publication in Journals / Conferences. The final evaluation of the Thesis shall be an External Evaluation. The marks for the Thesis may be proportionately distributed between External and Internal evaluation as follows.

Marks :

Internal Evaluation of the Thesis work by the Guide : 200 Internal Evaluation of the Thesis work by the Evaluation Committee : 200Final Evaluation of the Thesis work by the Internal & External Examiners (Evaluation of Thesis : 100 + Viva Voce : 100) : 200

5

Related Documents