REESTENOSIS INTRA STENT

Total Teaching Hours: 45

UNIT 1 : System concepts and the information systems environment: The systems concept, Definition, characteristics of a system, Types of systems, Introduction to fundamental information systems, Transaction processing systems, Management Information systems, Decision support systems, Expert systems, Office information systems, Personal and workgroup information systems.

(05 Hours)

UNIT 2 : Information system development: Definition, Preparing career as a system analyst, Interpersonal skills, Technical skills, System analysis and design skills, Multifaceted role of a system Analyst, System Development Life Cycle,

Principles of system development.

(05 Hours) UNIT 3: Cross life cycle activities: Fact-Finding, Tools, Review of literature, procedures, forms, files, on-site observation, Research and site visits, Interviews and questionnaires, Type of interviews and questionnaires, joint application development (JAD), JAD participants, How to plan and conduct AD sessions ,Benefits.

(05 Hours)

UNIT 4:Feasibility and Cost-Benefit Analysis: Feasibility considerations, Steps in feasibility analysis, Feasibility report, cost-benefit analysis, categories, data analysis, Procedure for cost benefit determination, the system proposal

(05 Hours) UNIT 5: Structured Analysis: Definition, The Tools for Structured Analysis, DFD, Data Dictionary, Decision Trees, Structured English, Decision Tables, Computer

Aided System Engineering (CASE), A CASE tool frame work (05 Hours)

UNIT 6 : System Design: Strategies for good system design, Introduction to structured design, object - oriented design, logical and physical design, Form - driven methodology, major development activities, personnel allocation and audit

considerations (06 Hours)

UNIT 7:Input/output forms design: Methods and issues for data capture and input; data entry, data input Model input methods, Batch versus on-line inputs, trends in automatic data collection technology, System user issues for input design, Internal controls for inputs, GUI controls for input design, Principles and guidelines for output design, Types of outputs, Media and formats, System users issues for output design.

Christ University, Bangalore, India 33

UNIT 8: System testing and quality assurance: Testing, different methods, Nature of test data, Test plan, activity networks for system testing, Quality assurance : goals

in system development, trends, procedure, ISO certification (04 Hours)

UNIT 9: Implementation and Software maintenance: Conversion, Activity network for conversion, Post-implementation review, Software maintenance, Primary activities of a maintenance procedure, Reducing maintenance costs

(05 Hours)

TEXT BOOKS:

1. Awad, Elias M: “System Analysis and Design” Second Edition. Galgotia

Publication Pvt.Ltd.

REFERENCE BOOKS:

1. Sen, James A: “Analysis and Design of Information Systems” Second Edition.

Mc-Graw Hill International edition, 1989.

2. Jeffrey L.Whitten: “System analysis and design methods” Fourth edition. Mc-Graw Hill International..

Christ University, Bangalore, India 34

BCA 235: OPERATING SYSTEMS

Total Teaching Hours: 45

UNIT 1: INTRODUCTION: Definition of Operating Systems, Functions of Operating Systems, Services of Operating Systems, Types of Operating Systems: Batch, Multiprogrammed, Time sharing, Real time and Distributed Operating Systems –

Spooling – System calls – Operating system Structures. (05 Hours)

UNIT 2: PROCESS MANAGEMENT: Definition of a Process – Process states – Process Control Block – Scheduling Criteria – Schedulers: Short term, Medium term and Long term schedulers – Scheduling Algorithms: FCFS, Round Robin, SJF and Priority Algorithms (preemptive and non preemptive) – Inter process Communication

(10 Hours) UNIT 3: PROCESS SYNCHRONIZATION: Critical Section Problem – Classical Problems of Synchronization: Dining Philosophers, Producer Consumer, Readers Writers

and Sleeping Barbers Problem – Semaphores – Monitors (05 Hours)

UNIT 4: DEADLOCKS: Definition of a Deadlock, Conditions for Deadlock, Handling Deadlocks: Prevention, Avoidance, Detection and Recovery (Banker’s Algorithms and

Resource Request Algorithm) (05 Hours)

UNIT 5: MEMORY MANAGEMENT: Address Mapping, Swapping. Management Methods: Single contiguous, Multiple Partitioned: Fixed size, Variable size and Dynamic size, Paging and Segmentation. Page Replacement Algorithms: FIFO and LRU

(08 Hours) UNIT 6: FILE SYSTEM: File Concept, Access Methods, Directory Structure, Protection, File System Structure, Allocation Methods, Free space Management.

(05 Hours) UNIT 7: I/O SYSTEMS: Overview of I/O Systems, I/O Interface, Secondary Storage Structure- Disk Structure, Disk Scheduling-FCFS-SSTF-SCAN-LOOK-CSCAN and CLOOK. (07 Hours)

TEXT BOOK:

1. Silberschatz, Abraham and Galvin, Peter Baer. Operating System Concepts. 5th

Edition. John Wiley and Sons

REFERENCE BOOKS:

1. Milan Milenkovic, Operating Systems Concepts and Design, McGrow Hill 1987 2. Tanenbaum, S Andrew, Operating Systems – Design and Implementation, PHI,

2001.

3. H M Deitel, Operating Systems, 2nd _{edition, California Peachpit, 2000.}

Christ University, Bangalore, India 35

BCA 236: DATA STRUCTURES

Total Teaching Hours: 45

UNIT 1: Introduction to data structures-Definition-Classification of data structures (Linear and Non-Linear), Operations on data structures. Complexity - Time-Space complexity.

(02 Hours) UNIT 2: String Processing - Strings- Storing Strings – Fixed length structures, Variable length structures with fixed maximums and linked structures-Primitive Operations on Strings-Substring, Indexing, Concatenation and Length of the string-Pattern Matching Algorithms – First Pattern Matching Algorithms and Fast Pattern Matching Algorithms.

(06 Hours) UNIT 3: Arrays- Definition – Representation of Linear arrays in memory (Both Single and Two Dimensional arrays)-Algorithm for Insertion and Deletion in one dimensional arrays (ordered and unordered arrays), advantages and disadvantages of arrays. Sparse Matrices (any two representations). Linear Search and Binary Search

(08 Hours) UNIT 4: Linked lists-Linked list- Representation of linked lists in memory-Operations on linked list (Insertion, Deletion, Display)-Circularly linked linear lists (Insertion, Deletion, Display)-Doubly linked linear list (Insertion, Deletion, Display)-Applications of

linked linear lists (08 Hours)

UNIT 5: Stacks- Concepts, Operations, sequential and linked implementation, Application of stacks- Towers of Hanoi, Infix, Prefix and Postfix expressions and Evaluation of postfix expression using stacks

(05 Hours) UNIT 6: Queues- Concepts, operations, sequential and linked implementation, Linear Queue (FIFO), Circular queues, and Deque (Introductory concepts)-Application of queues.

(06 Hours)

UNIT 7: Trees-Binary trees, Complete Binary tree, Binary Search Trees – Searching and Inserting in Binary Search Trees, Deletion in a binary search tree. Traversals on a Binary Tree (In-order, post-order, pre-order), -Application of Trees (brief overview)

(04 Hours) UNIT 8: Sorting- Bubble sort, Selection sort, Insertion sort, Merge sort , Quick sort.

(06 Hours) TEXT BOOK:

1. Seymour Lipschultz: “Data Structures”, Schaum series TMH.

REFERENCE BOOKS

1. Ellis, Horowitz: “Fundamentals of Data Structures” Galgotia Publications, 1996

2. Bhagat Singh and Thomas L Naps: “Introduction to Data structures”, Galgotia

Publications, 1995

3. Tremblay J.P and Sorenson P.G: “An Introduction to data structures with

Christ University, Bangalore, India 36