s4 mca course schedule 2011

7/31/2019 s4 mca course schedule 2011

1/31

Master of Computer Application(2009-2012) Semester-IV

Department of Computer Science, Rajagiri College of Social Sciences 1

DEPARTMENT OF COMPUTER SCIENCE

RAJAGIRI COLLEGE OF SOCIAL SCIENCES

KALAMASSERY, KOCHI-683104

MASTER OF COMPUTER APPLICATION (2009-2012)

Course Schedule

SEMESTER IV

(20th June 20115th November 2011)


2/31



MASTER OF COMPUTER APPLICATIONS

PROGRAMME

SEMESTER IV

(20th June 2011 5th November 2011)

This semester extends over a period of 19 instructional weeks, and is scheduled to get over by

the first week of November 2011. During this semester, the students would be made familiar

with Optimization Techniques, Operating Systems, Algorithm Analysis and Design, Java and Web

Programming, Object Oriented Analysis and Design and DBMS Lab.

The teaching methodology for courses would include guided tutorials, projects and laboratory

work apart from the regular lecture sessions. The internal evaluation would be based on

continuous assessment. Academic dishonesty in any form, plagiarism or cheating in

assignments, exercises or tests from the students would be viewed very seriously. The course

lecturers would try their best to adhere to the planned schedule, but changes if any due to

unavoidable circumstances would be notified in advance. The university rules/ regulations shall

apply for external examinations.

The college has incorporated, in addition to prescribed curriculum contents, topics that are

important in its own right and that any future scientist should know throughout their career.

With this in mind, the sessions are scheduled based on six-day week. The career development

courses such as effective communication, personality grooming, aptitude tests, discussions,

seminars, talks by experts etc. are also incorporated into the semester, which would be

announced from time to time. The regular sessions are scheduled between 9.00 am to 5.00 am.

However classes can be organized even out of the normal class hours.


3/31



Key Rules

1. Students will not be allowed to enter the classroom after a faculty has entered the

classroom.

2. Students are not allowed to spend time with any other faculty member during normalclass hours unless prior permission has been obtained from the faculty engaging the

session at that time.

3. A student will not be allowed to write the university examinations for a semester

unless he or she gets a minimum of 75% of attendance for each course in that

semester.

4. In case of a student not securing condonation from the University, he/she would

have to attend the classes of that course of the subsequent batch for a period that

equals the percentage of shortage and submit such additional assignments orcoursework as may be required by the college.

5. Students who has missed a test are allowed to take retest if he/she was absent for

the exam due to medical reasons or any other unavoidable circumstances approved by

the HOD.

Procedure for taking retest:

1. The Students shall write a request letter and get the consent from theconcerned faculty and HOD before paying the fees for retest. Medical

certificate to be attached along with request letter.

2. The filled-in form and the receipt of the payment to be shown to InternalController of Examination.

3. The form with the signature of ICE to be shown to the respectivefaculties before taking the test.

6. Assignments have to be submitted on time. Late submission may fail to secure the

marks part or whole as the case may be.

7. Student attendance in co-curricular activities is compulsory.

8. Students must be seated in the examination hall at least 10 minutes before the start

of the examination. They must display their ID cards and carry hall tickets foruniversity examinations.

9. No student is allowed to enter the rooms of the faculty when they are not present

unless permission is sought from the concerned faculty.

10. All verbal interactions of students must be in English.


4/31



11. According to Government and University regulations mobile phones are prohibited

in college campuses. If found violating this rule, punishment would be a fine of Rs.

500 and confiscation of the phone along with Sim card for a week at the first

instance . if the offence is repeated, the college authorities shall confiscate the

phone without provision for return.

12. Any kind of ragging, intimidation or aggressive behavior is forbidden. Any violation

of this rule shall constitute a criminal act and shall be dealt with under provisions of

Kerala Prohibition of Ragging Act 1998 which may result in criminal prosecution.

13. Use of plastic materials is completely prohibited in the campus.

14. Use of alcohol, tobacco or any intoxicating substance in campus is prohibited.

15. Students are strictly warned not to view, save or download objectionable material of

any type from the computer. Use of any electronic or digital devise in the computer

Center is prohibited.

16. Dress code

Formals on all Mondays

Students should strictly wear ID cards when inside the campus.

Casuals allowed only on Saturdays

a. Boysi. Clean shaved everyday

ii. Professional haircutiii. Shirt Tucked in everyday

b. Girlsi. Any formal gathering girls should wear uniform saree

ii. One cotton salwar to be bought for girls as uniform (II &IV semester)

iii. Students have to select the cloth get approval from thefaculty and select a common Neck pattern stitching should

be done at a good common place.

17. Strict monitoring of absenteeism. Class tutors should bring to the notice of the staff

council and the Head, the names of irregular students and the regular absentees will

be warned. Consideration for condonation will be only given for unavoidablecircumstances like accidents, prolonged hospitalization etc Those who fall below

68% of their total attendance will repeat the semester.

18. Students are cautioned against regular absenteeism. Such students are

brought to the notice of staff council & the department Head for necessary

correction.

19. Students must wear ID cards at all times inside campus.


5/31



Time Table

Semester IV

Class Tutor: Ms. Sunu Mary Abraham

9.00-10.00 10-10.55 11.05-12.00 12.00-1.00 2.00-3.00 3.00-4.00 4.00-5.00

MondayADA

Ms. Prema

Java

Mr. Renjith

DBMS Lab

Ms. Prema

TuesdayOS

Ms. Sunu

OOMD

Ms. JayaCSTAR/UNION

WednesdayOOMD

Ms. Jaya

OS

Ms. Sunu

Java

Mr. Renjth

ThursdayOT

Ms. Manju

DBMS Lab

Ms. Prema

Java Lab

Mr. Renjith

FridayJava Lab

Mr. Renjth

ADA

Ms. Prema

OT

Ms. Manju

Aptitude

Ms Abusha

Saturday Certification

Course Code Course Title Faculty

MCA 401 Optimization Techniques Ms. Manju Ranjit

MCA 402 Operating SystemsMs. Sunu Mary Abraham (Class

Coordinator)

MCA 403 Algorithm Analysis and Design Ms. Prema S Thomas

MCA 404 Java and Web Programming Mr. Renjith P R

MCA 405(G)Elective - I (Object Oriented Modelling and

Design)Ms. Jaya Vijayan

MCA 406 DBMS Lab Ms. Prema S. Thomas

MCA 407 Java and Web Programming Lab Mr. Renjith P R


6/31



MCA Semester IV Planner 2011

Day Date Particulars

Working days

(Teaching

Days)

MONDAY 20-Jun

W1

MCA IV Class Begins D1

TUESDAY 21-Jun D2

WEDNESDAY 22-Jun D3

THURSDAY 23-Jun Grooming Session

FRIDAY 24-Jun Konfidence

SATURDAY 25-Jun Konfidence

SUNDAY

MONDAY 27-Jun

W2

D4

TUESDAY 28-Jun D5

WEDNESDAY 29-Jun D6

THURSDAY 30-Jun D7

FRIDAY 1-Jul Konfidence

SATURDAY 2-Jul Konfidence

SUNDAY 3-Jul

MONDAY 4-Jul

W3

D8

TUESDAY 5-Jul D9

WEDNESDAY 6-Jul D10

THURSDAY 7-Jul D11

FRIDAY 8-Jul D12

SATURDAY 9-Jul SECOND SATURDAY

SUNDAY 10-Jul

MONDAY 11-Jul

W4

D13

TUESDAY 12-Jul D14

WEDNESDAY 13-Jul D15

THURSDAY 14-Jul D16

FRIDAY 15-Jul D17

SATURDAY 16-Jul D18

SUNDAY 17-Jul

MONDAY 18-Jul

W5

D19

TUESDAY 19-Jul D20WEDNESDAY 20-Jul D21

THURSDAY 21-Jul D22

FRIDAY 22-Jul D23

SATURDAY 23-Jul D24

SUNDAY 24-Jul

MONDAY 25-Jul W6 D25


7/31



TUESDAY 26-Jul D26

WEDNESDAY 27-Jul D27

THURSDAY 28-Jul Konfidence

FRIDAY 29-Jul Konfidence

SATURDAY 30-Jul KARKADAKA VAAVU

SUNDAY 31-Jul

MONDAY 1-Aug

W7

IAT-1 D28

TUESDAY 2-Aug IAT-1 D29

WEDNESDAY 3-Aug IAT-1 D30

THURSDAY 4-Aug IAT-1 D31

FRIDAY 5-Aug IAT-1 D32

SATURDAY 6-Aug D33

SUNDAY 7-Aug

MONDAY 8-Aug

W8

D34

TUESDAY 9-Aug D35

WEDNESDAY 10-Aug D36

THURSDAY 11-Aug D37

FRIDAY 12-Aug CSI WORKSHOP

SATURDAY 13-Aug SECOND SATURDAY

SUNDAY 14-Aug

MONDAY 15-Aug INDEPENDENCE DAY

TUESDAY 16-Aug

W9

D38


THURSDAY 18-Aug D40

FRIDAY 19-Aug D41

SATURDAY 20-Aug D42

SUNDAY 21-Aug

MONDAY 22-Aug

W10

D43

TUESDAY 23-Aug D44


THURSDAY 25-Aug D46

FRIDAY 26-Aug D47

SATURDAY 27-Aug D48

SUNDAY 28-Aug

MONDAY 29-Aug

W11

D49TUESDAY 30-Aug ID-UL-FITR


THURSDAY 1-Sep D51

FRIDAY 2-Sep D52

SATURDAY 3-SepONAM HOLIDAYS

SUNDAY 4-Sep


8/31



MONDAY 5-Sep

TUESDAY 6-Sep

WEDNESDAY 7-Sep

THURSDAY 8-Sep

FRIDAY 9-Sep

SATURDAY 10-Sep

SUNDAY 11-Sep

MONDAY 12-Sep

TUESDAY 13-Sep

W12

D53

WEDNESDAY 14-Sep D54

THURSDAY 15-Sep D55

FRIDAY 16-Sep D56

SATURDAY 17-Sep D57

SUNDAY 18-Sep

MONDAY 19-Sep

W13

D58

TUESDAY 20-Sep D59

WEDNESDAY 21-Sep SREE NARAYANA GURU SAMADHI

THURSDAY 22-Sep D60

FRIDAY 23-Sep D61

SATURDAY 24-Sep RETREAT

SUNDAY 25-Sep

MONDAY 26-Sep

W14

D62

TUESDAY 27-Sep D63

WEDNESDAY 28-Sep D64

THURSDAY 29-Sep D65

FRIDAY 30-Sep D66

SATURDAY 1-Oct D67

SUNDAY 2-Oct

MONDAY 3-Oct

W15

D68

TUESDAY 4-Oct D69

WEDNESDAY 5-Oct VIJAYA DASHAMI

THURSDAY 6-Oct MAHANAVAMI

FRIDAY 7-Oct D70

SATURDAY 8-Oct SECOND SATURDAY

SUNDAY 9-OctMONDAY 10-Oct

W16

IAT-2 D71

TUESDAY 11-Oct IAT-2 D72

WEDNESDAY 12-Oct IAT-2 D73

THURSDAY 13-Oct IAT-2 D74

FRIDAY 14-Oct IAT-2 D75

SATURDAY 15-Oct D76


9/31



SUNDAY 16-Oct

MONDAY 17-Oct

W17

D77

TUESDAY 18-Oct D78

WEDNESDAY 19-Oct D79

THURSDAY 20-Oct D80

FRIDAY 21-Oct D81

SATURDAY 22-Oct D82

SUNDAY 23-Oct

MONDAY 24-Oct

W18

D83

TUESDAY 25-Oct D84

WEDNESDAY 26-Oct DEEPAVALI

THURSDAY 27-Oct D85

FRIDAY 28-Oct CSI WORKSHOP

SATURDAY 29-Oct D86

SUNDAY 30-Oct

MONDAY 31-Oct

W19

D87

TUESDAY 1-Nov D88

WEDNESDAY 2-Nov D89

THURSDAY 3-Nov D90

FRIDAY 4-Nov D91

SATURDAY 5-Nov D92


10/31



OPTIMIZATION TECHNIQUES

Course Lecturer: Manju Ranjit

Course Code: MCA-401

COURSE OBJECTIVES:

To make the students able to use Optimization Techniques in solving problems in

real life scenario

EVALUATION STRATEGY

The internal evaluation is based on the participants attendance, class participation,

assignments, seminars and internal assessment and continuous evaluation tests

Weightage Criteria of evaluation

Internal Assessment Test1 : 7 Internal Assessment Test2 : 7 Seminar : 4 Attendance : 3 Assignments : 4

Total : 25

SYLLABUS

Module 1

Linear Programming problem Mathematical formulation, assumptions in linear

programming, graphical method of solution, simplex method, Big-M method and Two

phase method, Dual simplex method.

Module 2

Integer Programming Introduction, Gomorys cutting plane method, Fractional cut

method-Mixed integer and branch and bound techniques.

Transportation Problem-General transportation problem, finding an initial basic feasible

solution, Loops in transportation tables, Degeneracy, Optimality method-MODI method.

Assignment Problem- Hungarian Method, Traveling salesman problem.

Module 3

Game theory Introduction, two-person zero-sum games, some basic terms, the

maxmini-minimax principle, games without saddle points-Mixed Strategies, graphic

solution of 2 * n and m*2 games, dominance property.

Simulation Introduction, Definition of Monte-Carlo Simulation.


11/31



Module 4

Dynamic Programming Introduction, The Recursive equation approach, Algorithm,

Solution of a L.P.P by Dynamic Programming.

Sequencing Models-Processing n jobs through 2 machines, n jobs through 3 machines,

two jobs through m machines.

Networking Analysis CPM&PERT Network minimization, shortest route problem,maximal-flow problem, Project scheduling, critical path calculations, PERT calculation.

Module 5

Queuing Theory Introduction, Queuing system, Elements of Queuing system,

Characteristics of Queuing system, Classification of Queuing Models, Poisson Queuing

systems-Model I (M/M/1): (:FIFO)-Characteristics of Model I and waiting time

characteristics. Characteristics of (M/M/1):(N/FIFO), (M/M/C):( /FIFIO),

(M/M/C):(N/FIFO)-all without derivation

Text book:

1) Operation Research by Kanti Swarup, P.KGuptha , Man Mohan 11th editionSultan Chand & Sons Publication.

Reference:

1. Operation Research-An introduction by Hamdy A Taha. Prentice Hall.2. Introduction To Management Science, Anderson, Thomson Learning, 11Edn.3. Operation Research Applications and Algorithms, Winston, Thomson Learning,

4Edn.

4. Introduction to Operation Research by Hiller/Lieberman. McGraw Hill.5. Operation Research by Dr. Kalavathy.S. Vikas Publishing

Assignments

Topics for the assignments will be announced in the class during course.

TEACHING SCHEDULE

Session Topics Remarks

1Game theory- Introduction, two-person zero-sum games,

some basic terms

2

The maxmini-minimax principle, games without saddle

points

3 Mixed strategies

4 Graphic solution of 2*n and m*2 games

5 Dominance property

6 Simulation-Introduction, Monte Carlo

7LPP-mathematical formulation, assumptions, graphical

method


12/31



8 Simplex method

9Big M method and Two phase method.

10 Dual simplex method.

11

Integer programming Introduction, Gomorys cutting plane

method.

12Fractional cut method-Mixed integer and branch and

bound techniques.

13Transportation Problem-General transportation problem,

finding an initial basic feasible solution.

14Loops in transportation tables, Degeneracy, Optimality method-

MODI method.

15Assignment Problem- Hungarian Method, Traveling

salesman problem.

Internal Assessment Test-I

16Dynamic Programming Introduction, The Recursiveequation approach, Algorithm, Solution of a L.P.P by

Dynamic Programming.

17Sequencing Models-Processing n jobs through 2 machines,

n jobs through 3 machines, two jobs through m machines

18Networking Analysis CPM&PERT Network minimization,

shortest route problem, maximal-flow problem.

19Project scheduling, critical path calculations, PERT

calculation.

20Queuing Theory Introduction, Queuing system, Elements

of Queuing system, Characteristics of Queuing system

21

Classification of Queuing Models, Poisson Queuing

systems-Model I (M/M/1): (:FIFO)-Characteristics of

Model I and waiting time characteristics.

22 Characteristics of (M/M/1):(N/FIFO), (M/M/C):( /FIFIO)

23 Characteristics of M/M/C):(N/FIFO)

Internal Assessment Test-II

24Problem solving(Previous years question paper and other

important problems)

25 Problem solving

26 Problem solving

27 seminar

28 seminar

29 seminar

30 Problem solving


13/31



OPERATING SYSTEMS

Course Lecturer: Ms. Sunu Mary Abraham


COURSE OBJECTIVES:

Understand the terminology surrounding and describing operating systems

Exposure to basic resource management techniques (scheduling or time

management, space management) and principles and how they can be

implemented. Deadlock avoidance, file system organization, and security.

Understand fundamental operating system abstractions such as processes,

threads, files, smaphores, IPC abstractions, shared memory regions, etc.,

Understand the principles of concurrency and synchronization

Understand the basic concepts and commands of UNIX Operating System

EVALUATION STRATEGY




Internal Assessment Tests : 14 Attendance : 3 Assignments/Continuous Evaluation : 8

Total : 25

SYLLABUS

Module I

Evolution of operating systems:-Serial processing, Batch Processing, multiprogramming.

Types of operating systems-Batch-multi programming-Time sharing -Real time and

distributed operating systems.

File Management:-File structure, File types, File access, File attributes, File operations.

Directories-Flat directory systems, hierarchical directory systems. File system

implementation-Allocation methods-contiguous allocation, linked allocation, indexedallocation.

Module II

Processor Management:-Job and process concept, Concurrent Processes. Operating

system view of processes, process-state transition diagram, PCB (Process control block),

Threads, Process scheduling, Operations on Processes, Operating system services.


14/31



Process Scheduling:-Types of schedulers, scheduling and performance criteria,

scheduling algorithms, multiple processor scheduling

Inter process synchronization and communication-Concurrent Processes-Precedence

graph-hierarchy of process, need for inter process synchronization, critical section

problem, mutual exclusion-mutual exclusion algorithms, semaphores-definition busywait implementation, hardware implementation of semaphores-test and set instruction,

monitors, inter process communication using messages.

Module III

Memory Management:-Preliminaries-address binding, dynamic linking and loading,

Overlays, logical versus physical address space, Swapping, Contiguous allocation Paging-

principles of page allocation, structure of page table- hardware support, multi level

paging, hierarchical paging, inverted page table, shared pages.

Segmentation-principles of operation, hardware, implementation of segment table,

protection and sharing, fragmentation, segmentation with paging.

Virtual Memory-Demand paging performance. Page replacement-page replacement

algorithms. Thrashing, Segmentation and paging implementation of virtual memory,

hierarchical address translation tables and MMUS.

Module IV

Deadlocks: -Definition Deadlock characterization-Resource allocation graph, methods

for handling deadlocks, deadlock prevention, deadlock avoidance-safe state-resource

allocation graph algorithm-Bankers algorithm, deadlock detection, recovery from

deadlock, combined approach to deadlock handling.

Module VDevice Management:-Disk structure, Disk scheduling-FCFS-SSTF-C-Scan-Look, Disk

management, Swap space management, Disk reliability, Protection- goals of protection,

policies and mechanisms-Access matrix and its implementations , dynamic protection-

language base protection. Security-security.

Case Study: -Brief discussion on Unix Operating System

Text book:

1.

Abraham Silberschatz and Peter Baer Galvin, Operating System Concepts,(Fifth Edition) Addison Wesley.

Reference:

1) Bach M The design of the Unix Operating system, Prentice Hall India.2) Understanding Operating systems, Flynn, Thomson Learning, 4Edn.3) Guide to Operating systems, Palmer, Thomson Learning, 1Edn.


15/31



4) Milan Milenkovic Operating systems TATA Mc GrawHill.Assignments


TEACHING SCHEDULE


1Module 1:- Introduction to OS, Types of OS, Functions of

OS

2File Management:-File structure, File types, File access,

File attributes, File operations.

3Directories-Flat directory systems, hierarchical directory

systems.

4 File system implementation-Allocation methods-contiguous allocation, linked allocation, indexed allocation.

5

Module 2:- Processor Management:-Job and process

concept, Concurrent Processes. Operating system view of

processes, process-state transition diagram, PCB, Threads

6Process scheduling, Operations on Processes, Operating

system services.

7

Process scheduling, Process Scheduling:-Types of

schedulers, scheduling and performance criteria,

scheduling algorithms, multiple processor scheduling

8

Inter process synchronization and communication-

Concurrent Processes-Precedence graph-hierarchy of

process, need for inter process synchronization

9critical section problem, mutual exclusion-mutual

exclusion algorithms

10

Semaphores-definition busy wait implementation,

hardware implementation of semaphores-test and set

instruction

11 Monitors, inter process communication using messages.

12

Module 3:- Memory Management:-Preliminaries-address

binding , dynamic linking and loading, Overlays. logical

versus physical address space, Swapping, Contiguousallocation

13

Paging-principles of page allocation. structure of page

table- hardware support, multi level paging, hierarchical

paging, inverted page table, shared pages.

14Segmentation-principles of operation, hardware,

implementation of segment table, protection and sharing,


16/31



fragmentation, segmentation with paging.

Internal Assessment Test-1

15Virtual Memory-Demand paging performance. Page

replacement-page replacement algorithms.

16

Thrashing, Segmentation and paging implementation of

virtual memory,17 Hierarchical address translation tables and MMUS.

18

Module 4:- Deadlocks: -Definition Deadlock

characterization-Resource allocation graph, methods for

handling deadlocks,

19Deadlock prevention, deadlock avoidance-safe state-

resource allocation graph algorithm-Bankers algorithm,.

20Deadlock detection, recovery from deadlock, combined

approach to deadlock handling

21Module 5:- Device Management:-Disk structure, Disk

scheduling-FCFS-SSTF-C-Scan-Look, Disk management,

22Swap space management, Disk reliability, Protection- goals

of protection, policies and mechanisms

23Access matrix and its implementations, dynamic

protection-language base protection. Security-security.

24 Case Study: -Brief discussion on Unix Operating System

25 Unix Commands

26 Unix Commands

27 Process management in Unix

28 Memory Management in Unix

29 I/O Management in Unix30 Question Paper Discussion



17/31



Algorithm Analysis And Design

Course Lecturer: Prema S. Thomas


COURSE OBJECTIVES:

To familiarize the students with the basics of Design and Analysis of Computer

Algorithms.

EVALUATION STRATEGY





Total : 25

SYLLABUSModule I

Introduction Algorithms-design strategies-concepts in performance analysis space

complexity, time complexity- asymptotic notation- practical complexities, performance

measurement.

Module II

Divide and conquer method General method, Finding the maximum and minimum,

merge sort, Quick sort, Selection sort, Strassens matrix multiplication.

Module III

Greedy Method and Dynamic programming method The general method, Knapsack

problem, Job sequencing with dead lines, Minimum cost spanning tree- prims algorithm

and kruskals algorithm, optimal storage on tapes. Dynamic programming- General

method, multistage graphs, All pairs shortest paths, The traveling salesperson problem.

Module IV

Backtracking and branch and bound techniques The general method, The 8 queens

problem, Sum of subsets. Branch and Bound- least cost search, control abstraction for

LC search.


18/31



Module V

Lower bound theory and NP Hard problem Comparison trees- searching, sorting and

selection. Concepts of NP hard and NP-complete problems, non deterministic

algorithms, Classes of NP hard and NP complete. COOKS theorem.

Text book:1) Fundamentals of computer algorithms- Ellis Horowitz, Sartaj Sahni, Sanguthevar

Rajeshekharan (Galgotia ).

Reference:

1) Fundamentals of algorithms Gilles Brassard, Paul Bratley (PHI)2) Introduction to the design and analysis of algorithms Anany Levitin (Pearson)3) Computer algorithms Introduction to design and analysis Sara Baase, Allen

Van Gelder (Pearson)

Assignments


TEACHING SCHEDULE


1 Algorithm Introduction

2 Algorithm Design Strategies

3 Time and Space Complexity,

4 Asymptotic notation, Practical Complexities

5 Performance measurement.

6 Divide and Conquer Approach

7 Finding Minimum and Maximum

8 Merge Sort & Quick Sort

9 Selection sort10 Strassens Matrix Multiplication

11 Greedy Strategy

12 Knapsack problem

13 Job sequencing with deadlines

14 Minimum cost spanning tree


19/31



15 PRIMs Algoritnm, KRUSKALs Algorithm

16 Optimal Storage on Tapes

Internal Assessment Test-I

17 Dynamic Programming

18 Multistage graph problem

19 All pair shortest path

20 Dijkstras Algorithm

21 Traveling Salesman Problem

22 Backtracking

23 8-Queens Problem, Sum of subsets

24 Branch and Bound Technique

25 LC Search methods26 Lower Bound Technique

27 Comparison Tree for sorting and searching

28 NP Hard & NP Complete problems

29 Non deterministic algorithms, Classes of NP hard and NP

30 COOKS theorem

Internal Assessment Test-II


20/31



JAVA AND WEB PROGRAMMING

Course Lecturer: Mr. Renjith PR


COURSE OBJECTIVES:

To make students learn to use object based programming concepts using Java

To make students learn to code and successfully execute a programs using Java

as the programming language.

A concentrated study of the Java language and its applications

EVALUATION STRATEGYThe internal evaluation is based on the participants attendance, class participation,




Total : 25

SYLLABUS

Module-I

Introduction to Java: Overview of java, why java is important to the internet, Javas

magic: The Byte code, The java buzzwords, Lexical issues. Data types, variables and

arrays: Different data types, literals, variables, type conversion and casting, automatic

type promotions in expression, arrays Operators: arithmetic operators, bitwise

operators, relational operators, Boolean logical operators, assignment operators, the ?

Operator, operator precedence. Control statement: Selection statement, iteration

statement, jump statement

Module- II

Introducing classes: class fundamentals, constructors, garbage collections, overloaded

methods and constructors, Object parameter, recursion, understanding final and static


21/31



keywords, nested and inner class, command line arguments Inheritance: Basics, super,

multilevel hierarchy, method overriding, dynamic method dispatch, abstract classes

Packages and interfaces: packages, access protection, importing package, interface

Module- IIIException Handling: Exception handling fundamentals, multiple catch clauses, nested

try statements, built-in exceptions, creating our own exception. Multithreaded

programming: Java thread model, creating thread, creating multiple threads, thread

priorities, synchronization, interthread communication I/O Basics: reading and writing

console base input and output, rereading and writing files, String Handling, java.lang

package.

Module-IV

Event Handling: the delegation Event model, Adapter class, Working with AWT controls

layout managers and menus, applet programming

Module-V

Java database programming: Different JDBC drivers,ODBC and JDBC JDBC Overview

JDBC implementation Connection class Statements Other JDBC classes HTML,

JavaScript: Introduction, Eventhandlers, javascript in forms and frames. Java Servlets:

Java Servlets and CGI programming, Benefits, Lifecycle of a Servlet, simple java servlet,

reading data from a client, Reading Http Request Header, sending data to a client and

writing the HTTP Response Header, working with Cookies, tracking sessions, Security

Issues. JSP: JSP basics, tags, Request string, Displaying Values Using an Expression to Set

an Attribute, Declaring Variables and Methods, Cookies, Session Object, Sharing Data

Between JSP pages, Error handling in JSP

Text book

1. JAVA The Complete Reference- Patrick Naughton and Herbert Schidt.- fifth Edition

Tata McGraw Hill.

2. The Complete reference J2SE - Jim Keogh Tata McGraw Hills

References:

1. Programming and Problem Solving With Java, Slack, Thomson Learning, 1Edn.

2. Java Programming Advanced Topics, Wigglesworth, Thomson Learning, 3Edn.

3. Java Programming, John P. Flynt , Thomson Learning, 2Edn.

4. Ken Arnold and James Gosling, The Java Programming language, Addison Wesley, 2nd

Edition, 1998


22/31



5. Patrick Naughton and Herbert Schidt.- The Complete Reference, JAVA fifth Edition

Tata McGraw Hill.

6. Maydene Fisher, Jon Ellis, Jonathan Bruce; JDBC API Tutorial and Reference, Third

Edition, Publisher: Addison-Wesley Professional,2003

7. Java Servlets IInd edition Karl Moss Tata McGraw Hils8. Professional JSP Wrox

9. Thinking java Bruce Eckel Pearson Education Association

10.JavaScript: A Beginner's Guide, Second Edition By John Pollock, McGraw-Hill

Professional Publisher

Websites

Youtube : Java Programming Tutorial by the new boston

Assignments

Topics for the assignments will be either announced in the class during course or put in

the shared folder.

TEACHING SCHEDULE


1Module 1

Java Overview

2 Data Types, Arrays,

3 Operators, Control Statements

4Module 2

Class fundamentals

5 Inheritance

6 Inheritance continues

7 Inheritance continues

8 Packages & Interfaces9 Packages & Interfaces continues

10Module 3

Exception handling

11 Exception handling continues

12 Multithreaded programming


23/31



13 Multithreaded programming continues

14 Multithreaded programming continues


15 IO Basics

16 Module 4Event Handling

17 Event Handling continues




21Module 5

Java Database programming

22 HTML, Javascript

23 Java Servlets24 Java Servlets continues

25 Java Servlets continues

26 Java Servlets continues

27 JSP

28 JSP continues

29 JSP continues

30 Revision



24/31



OBJECT ORIENTED MODELING AND DESIGN

Course Lecturer: Jaya Vijayan

Course Code: MCA-405(G)

COURSE OBJECTIVES:

The objective of this course is to teach students the importance of object oriented

systems, methodology, modeling and UML, object oriented analysis and design.

EVALUATION STRATEGY


assignments, seminars, internal assessment and continuous evaluation tests.


Internal Assessment/Continuous Evaluation : 14 Attendance : 3 Assignment : 8

Total : 25

SYLLABUS:

Module 1

Concepts: - Objects, Attributes and Methods, Encapsulation and Information Hiding

Messages, Class Hierarchy, Inheritance, Polymorphism, Genericity.

Object Oriented System Development, Methodology.

Module 2

Unified Modeling Language:- Introduction, UML diagrams, Class diagrams, Use-Case

Diagrams, UML Dynamic Modeling.

Module 3


25/31



Analysis:- Object Oriented Analysis Process, Object Analysis: Classification, Identifying

Relationships, Attributes & Methods.

Module 4

Design:- The Object Oriented Design process & design Axioms, Designing classes, Accesslayer: Object Storage & Object Interoperability, View Layer: Designing Interface.

Module 5

Implementation:- S/W Implementation, Component diagrams, Deployment diagrams,

S/W Testing and Maintenance.

Text Book :-

Object-Oriented Modeling and Design., Rumbaugh, Blaha, Lorensen., Pearson Education

References:-

1. Object Oriented System Analysis and Design, Satzinger, Thomson Learning 1Edn.2. Object Oriented System Development using the Unified Modeling Language.,

Bahrami A., McGraw-Hill

3. Page-Johns, Meilir., Fundamentals of Object oriented Design in UML, PearsonEducation Asia,2000.

4. Object Oriented System Analysis and Design using UML., Bennet, McRobb andFarmer., McGraw-Hill

5. The Unified Modeling Language Reference Manual., Rumbaugh, Jacobson andBooch., Pearson Education Asia.

Assignments

Assignments are to be submitted on specific date. If the assignment is not submitted by

the due date, internal assessment for the assignment will be zero. Topics for the

assignments will be announced in the class during course.

TEACHING SCHEDULE

TOPICS

Session 1Module1- Objectives,Introduction,Objects, Attributes and

Methods, Encapsulation


26/31



Session 2Information Hiding Messages, Class Hierarchy, Inheritance,

Polymorphism, Genericity

Session 3 Object Oriented System Development, Methodology

Session 4 Module 2 -UML diagrams- Class diagramsSession 5 Class Modelling

Session 6 Class Modeling

Session 7 Class Modeling

Session 8 Interaction Modelling -Use-Case Diagrams

Session 9 Interaction Modelling -Use-Case Diagrams

Session 10 UML-Dynamic Modelling




Session 14 ReviewSession 15 IAT 1

Session 16 Module 3 -Object Oriented Analysis Process, Object Analysis

Session 17Classification, Identifying Relationships, Attributes & Methods.

Session 18 Module 4 -The Object Oriented Design process & design Axioms

Session 19 Designing classes, Access layer: Object Storage & ObjectInteroperability, View Layer:

Session 20Designing Interface.

Session 21 Module 5- S/W Implementation

Session 22 Component diagrams

Session 23 Deployment diagrams

Session 24 S/W Testing and Maintenance.

Session 25 Presentations of UML Diagrams (Miniproject)


27/31





Session 28 IAT 2

Session 29 Revision

Session 30 Question Paper Discussion


28/31



DBMS LAB

Course Lecturer: Ms. Prema S Thomas


OBJECTIVES

To introduce the concept of designing a database, normalizing the database and

manipulate the database with the help of SQL Statements

EVALUATION STRATEGY




Internals

Rough record : 14 Attendance : 3 IAT : 8

Total : 25

Externals

Fair record : 10 Viva-voce : 15 Logic : 20 Coding & documentation : 15 Debugging : 5 Output : 10

75

REFERENCES1. Database Management Systems-Ramakrishnan, Gehrke2. Database System Concepts-Korth, Sudarshan3. An Introduction to database system- Bipin C Desai

LAB ASSIGNMENTS1. Table Design- Using foreign key and Normalization


29/31



2. Practice SQL Data Definition Language(DDL) commands

a) Table creation and alteration(include integrity constraints such as primary

key,

referential integrity constraints, check, unique and null constraints both column and

table level

b) Other database objects such as view, index, cluster, sequence, synonym etc.

3. Practice SQL Data Manipulation Language (DML) commands

a) Row insertion, deletion and updating

b) Retrieval of data

i) Simple select query

ii) Select with where options (include all relational and logical operators)

iii) Functions: Numeric, Data, Character, Conversion and Group functions with

having

clause.

iv) Set operators

v) Sorting data

vi) Sub query (returning single row, multiple rows, more than one column,

correlated sub query)vii) Joining tables( single join, self join, outer join)

4. Practice Transaction Control Language (TCL) commands (Grant, revoke, commit and

save point options)

5. Usage of triggers, functions and procedures

6. Development of sample applications using Oracle as Back End Sample applications

may include

i). Payroll Informationii).Student Information System

iii). Bank Transaction

iv). Library Information System etc.


30/31



JAVA AND WEB PROGRAMMING LAB

Course Lecturer: Mr. Renjith PR


COURSE OBJECTIVES:

To make students learn to use object based programming concepts using Java

To make students learn to code and successfully execute a programs using Java

as the programming language.

A concentrated study of the Java language and its applications

EVALUATION STRATEGY

The internal evaluation is based on the participants attendance, class participation,assignments, seminars and internal assessment and continuous evaluation tests


Internals

Rough record : 14 Attendance : 3 IAT : 8

Total : 25

Externals

Fair record : 10 Viva-voce : 15 algorithm : 20 coding & documentation : 15 debugging : 5 output : 10

75

REFERENCES

1. Programming and Problem Solving With Java, Slack, Thomson Learning, 1Edn.

2. Java Programming Advanced Topics, Wigglesworth, Thomson Learning, 3Edn.

3. Java Programming, John P. Flynt , Thomson Learning, 2Edn.


31/31


4. Ken Arnold and James Gosling, The Java Programming language, Addison Wesley, 2nd

Edition, 1998

5. Patrick Naughton and Herbert Schidt.- The Complete Reference, JAVA fifth Edition

Tata McGraw Hill.

6. Maydene Fisher, Jon Ellis, Jonathan Bruce; JDBC API Tutorial and Reference, ThirdEdition, Publisher: Addison-Wesley Professional,2003

7. Java Servlets IInd edition Karl Moss Tata McGraw Hils

8. Professional JSP Wrox

9. Thinking java Bruce Eckel Pearson Education Association

10.JavaScript: A Beginner's Guide, Second Edition By John Pollock, McGraw-Hill

Professional Publisher

Websites

Youtube : Java Programming Tutorial by the new boston

PROGRAMS

(Covers the following topics. Detailed list will be given in class)

(to be done using windows/linux)

1. Programs to illustrating classes, objects, methods, constructors, destructors etc.

2. Programs to implement overloading, polymorphism, inheritance

3. Programs demonstrating the usage of packages

4. Program using files, streams, exception handling

5. Programs using threads, synchronization and string handling

6. Programs using AWT package

7. Programs to create simple applets

8. Programs using JDBC

9. Programs demonstrating networking

10. Web page design using HTML

11. Programming exercises on JavaScript, form validation etc.

12. Programs using Servlets and JSP

s4 mca course schedule 2011

Documents