M.sc Syllabusgfgghggg

SyllabusFor

M.Sc. ITM

2008-2010

Master of Science

In

Information Technology Management

Ravenshaw UniversityCuttack

Course OutlineM.Sc. ITM

1st Year

1st Semester

Sl No Subject Paper Code MarksTheory

1 Comp. Architecture and Design MITM 1.1.1 1002 Mathematics Foundation for IT MITM 1.1.2 1003 Data Structure Using C MITM 1.1.3 1004 Operating System MITM 1.1.4 1005 Data Base Management System MITM 1.1.5 1006 Organisational Behavior MITM 1.1.6 100

Practical7 C with Data Structure MITM 1.1.7 1008 SQL/PL SQL MITM 1.1.8 100

Total 800

2nd Semester


1 Computer Graphics MITM 1.2.9 1002 Data Communication and Networking MITM 1.2.10 1003 Software Engineering using UML MITM 1.2.11 1004 Accounting for Decision Making MITM 1.2.12 1005 International Business MITM 1.2.13 1006 ** Elective-I MITM 1.2.14 100

Practical7 Computer Graphics Using C & C++ MITM 1.2.15 1008 Networking Lab MITM 1.2.16 100

Total 800

M.Sc. ITM 2nd Year3rd Semester


1 Data Mining MITM 2.3.17 1002 Artificial Intelligence MITM 2.3.18 1003 Human Resource Management MITM 2.3.19 1004 Web Technology MITM 2.3.20 1005 Security & Cryptography MITM 2.3.21 1006 ** Elective –II MITM 2.3.22 100

Practical7 Web Designing with Java MITM 2.3.23 1008 Mini Project MITM 2.3.24 100

Total 800

4th Semester

Internship (Project) (MITM 2.4.25) – 300

ELECTIVES

ELECTIVE I (SEMESTER II)

Analysis and Design of Algorithms (MITM 1.2.14)/ Multimedia (MITM 1.2.14)/ Bio-Informatics (MITM 1.2.14).

ELECTIVE II (SEMESTER III)

Embedded System (MITM 2.3.22)/ Managerial Economics (MITM 2.3.22)/ Parallel Computing (MITM 2.3.22).

Semester - I

COMPUTER ARCHITECTURE AND DESIGN (MITM 1.1.1)

UNIT I: INFORMATION REPRESENTATION

1.1 Number system1.2 Precision and range, BCD code, ASCII and EBCDIC1.3 Digital Electronics

1.3.1 Boolean Algebra1.3.2 Logic gates1.3.3 Truth tables1.3.4 Karnaugh map1.3.5 Flip-Flops (D-Flip Flop, JK-Flip-Flop, & Master Slave Flip Flop)

UNIT II: PRINCIPLES OF COMPUTER DESIGN

2.1 Software, Hardware Interaction2.2 Layers in computer architecture2.3 Processor- Memory Structure2.4 RTL structure, Hardware Description Language(HDL)2.5 Logic circuit level structure

2.5.1 Combinational RTL components2.5.2 Multiplexer, De-multiplexer,2.5.3 Encoder , Decoder2.5.4 Parity Generator and Checker2.5.5 Adder/ Subtractor, Programmable Logic Devices

2.6 Sequential RTL Components2.6.1 Shift Registers

2.6.1.1 Serial in Serial out.2.6.1.2 Serial in Parallel out.

2.6.2 Counters2.6.2.1 Synchronous Binary up Counter2.6.2.2 Asynchronous Binary up Counter

UNIT III: CENTRAL PROCESSING UNIT

3.1 Machine language instructions3.2 Addressing modes, instruction types3.3 Instruction set selection3.4 Instruction cycle and Execution Cycle.3.5 Arithmetic Logic Unit3.6 Control Unit

3.6.1 Data path and control path design3.6.2 RISC Vs CISC3.6.3 Pipelining in CPU design, Super scalar3.6.4 Super scalar processors

Department of Information Technology Management, Ravenshaw University, Cuttack

1

UNIT IV: MEMORY SUBSYSTEM4.1 Storage technologies4.2 Memory array organization4.3 Memory hierarchy, Interleaving4.4 Cache and Virtual Memories.

UNIT V: INPUT/OUTPUT DEVICES AND CHARACTERISTICS

5.1 Input/Output Processing5.1.1 Bus interface, 5.1.2 Data Transfer Techniques5.1.3 I/O interrupts, Channels.5.1.4 SPEC Benchmark for Performance Evaluation.

Text Book: 1.Pal Choudhury P(1994) Computer Organisation and Design(PHI) 2. M. Mano, Computer System and Architecture (PHI)

Reference1. Rajaraman and Radhakrishnan , Introduction to Digital Computer Design (PHI)2. Stalling W, Computer Organisation and Architecture(PHI)


2

MATHEMATICS FOUNDATION FOR IT (MITM 1.1.2)

UNIT I LOGIC1.1 Fundamentals of Logic1.2 Logical Interfaces1.3 Methods of Proof of an Implication1.4 First order Logic and other methods of proofs1.5 Rules of interfaces for quantifier propositions.

UNIT II RELATIONS AND DIGRAPHSSets, operation on sets, relation and digraphsSpecial properties of binary relationsEquivalence relationsOrdering relationsLattices and enumerationOperations on relations paths and closuresDirected graphs and adjacency matrices

UNIT III ELEMENTARY COMBINATORY

3.1 Basics of counting enumeration of combinations and permutations with repetition3.2 The principles of inclusion and exclusion

UNIT IV GRAPHS4.1 Basic concepts4.2 Isomorphism and sub graphs4.3 Trees and their properties4.4 Spanning trees, directed trees4.5 Binary trees, planner graphs4.6 Euler’s formula4.7 Multi graphs and Euler graphs4.8 Hamiltonian graphs

UNIT V BOOLEAN ALGEBRAIntroductionBoolean AlgebraBoolean FunctionsSwitching MechanismMinimization of Boolean Functions

Text Book

Discrete Mathematics for computer scientist and mathematicians, Mott, Kandel & Barker (PHI)


3

DATA STRUCTURE USING C (MITM 1.1.3)

UNIT I INTRODUCTION

1.1 Data Types in ‘C’1.2 Abstract data types1.3 Sequence as value definitions1.4 ADT for varying- length character strings1.5 Pointers in ‘C’1.6 Data structure and ‘C’1.7 Arrays in ‘C’1.8 Using one dimensional array1.9 Implementing one dimensional array1.10 Character strings in ‘C’1.11 Character string operation1.12 Two dimensional arrays1.13 Multi dimensional arrays1.14 Structure s in ‘C’1.15 Implementing structure1.16 Unions1.17 Implementation of Unions1.18 Structure parameters1.19 Representing other data structures1.20 Allocation of storage and scope variables1.21 Recursion1.22 Recursive definition and process1.23 Properties of recursive definition or algorithms1.24 Fibonacci sequence

UNIT II THE STACK

2.1 Primitive operations2.2 Example2.3 Representing stacks in ‘C’2.4 Implementing the POP operations2.5 Testing for exceptional conditions2.6 The PUSH operation2.7 Example : Infix, Postfix, Prefix2.8 Basic definition and example2.9 Evaluating a postfix expression2.10 Queue an lists2.11 The queue and its sequential representation2.12 ‘C’ implementation of Queues2.13 Insert operation2.14 Linked List2.15 Inserting and removing modes from a list2.16 Linked implementation of stacks2.17 Get node and free node operations2.18 Linked implementation of queue 2.19 Linked list as a data structure


4

2.20 Example of list operations2.21 List implementation of priority queue2.22 Header nodes2.23 List in ‘C’2.24 Array implementation of list2.25 Limitations of the array implementation2.26 Allocating and freeing dynamic variables2.27 Linked list using dynamic variable2.28 Queues as list in ‘C

UNIT III TREES3.1 Binary Trees3.2 Operation on binary trees3.3 Application of binary trees3.4 Binary tree representation

3.4.1 Node representation of binary trees3.4.2 Internal and external nodes

3.5 The Huffman algorithm3.6 Tree traversal

UNIT IV SORTING4.1 General background4.2 O rotation4.3 Efficiency of sorting4.4 Bubble sort4.5 Quick sort4.6 Efficiency of quick sort4.7 Heap sort4.8 Insertion sort4.9 Simple insertion sort4.10 Shell sort4.11 Merge sort

UNIT V SEARCHING5.1 Basic searching techniques5.2 Algorithm notation5.3 Sequential searching5.4 Inserting/ deleting a binary search tree5.5 Graphs and their applications5.6 Graphs5.7 Shortest path algorithm(Prim’s Algo)

Text books1. Data Structure using C (PHI), Tanenbaum2. Data Structure using C, Amiya Rath


5

OPERATING SYSTEM (MITM 1.1.4)

UNIT I: INTRODUCTION1.1 Introduction to O.S.1.2 Process management1.3 Process concept

1.3.1 Process state1.3.2 Process control block

1.4 Process scheduling1.4.1 Schedulers1.4.2 Context switches1.4.3 Operation on process1.4.4 Process creation1.4.5 Process termination

UNIT II: CPU SHEDULING2.1 Basic Concept2.2 CPU –I/O burst cycle.2.3 CPU Scheduler.2.4 Primitive scheduling2.5 Scheduling algorithm

2.5.1 Firs come first served scheduling(FCFS)2.5.2 Shortest –Job-First scheduling(SJF)2.5.3 Priority scheduling2.5.4 Round –Robin scheduling(RR)2.5.5 Multilevel Queue scheduling

UNIT III: DEADLOCKS3.1 System Model3.2 Deadlock Characterization.3.3 Method of Handling Deadlock3.4 Deadlock Prevention3.5 Deadlock Avoidance3.6 Deadlock Detection3.7 Deadlock Recovery

UNIT IV: MEMORY MANAGEMENT4.1 Background

4.1.1 Logical Vs Physical address4.1.2 Swapping4.1.3 Paging

4.2 Virtual Memory4.2.1 Background4.2.2 Demanding Paging4.2.3 Performance of Demand Paging4.2.4 Page Replacement Algorithm


6

UNIT V: FILE SYSTEM INTERFACE5.1 File concept

5.1.1 Access methods5.1.2 Directory structure5.1.3 Protection

5.2 I/O System5.2.1 Overview5.2.2 I/O Hardware5.2.3 Application I/O interface

Text Book: Operating system concepts- Silverschatz and Galvin- Wesley Publication.


7

DATABASE MANAGEMENT SYSTEM (MITM 1.1.5)

UNIT-I AN OVERVIEW OF DATABASE MANAGEMENT SYSTEM

What is database system?An architecture for a database systemPurposeThe Three level of the architecture.The database administratorData base user.An introduction to relation databases.Mapping Constraints.Keys.Primary KeyCandidate KeyForeign KeyEntity Relationship DiagramWeak E-R DiagramExtended E-R DiagramReduction of a schema to tables. UNIT II RELATIONAL MODELIntroductionThe Relational AlgebraThe tuple relation calculusThe domain relation calculusSQLIntroductionData definitionData manipulation retrieval operation, update operation.Table Expression.Conditional Expression.Aggregate function.Null Values.Nested QueriesQuery by Example.

UNIT III INTEGRITY CONSTRAINTS3.1 Introduction3.2 Domain constraints3.3 Assertions3.4 Triggers3.5 Functional dependency

3.5.1 Introduction3.5.2 Basic definitions3.5.3 Trivial and non trivial dependency3.5.4 Closer of a set of dependency3.5.5 Closure of a set attributes


8

3.6 Normalization3.6.1 1 NF3.6.2 2 NF3.6.3 3 NF3.6.4 BCNF

UNIT IV INDEXING AND HASHING4.1 Basic concepts4.2 Ordered indices4.3 B+ tree index files4.4 Static hashing4.5 Dynamic hashing4.6 Query processing4.7 Sorting4.8 Join operation

UNIT V DATA PROTECTION5.1 Introduction 5.2 Recovery5.3 Concurrency5.4 Security5.5 Integrity5.6 Distributed database and client server systems

5.6.1 Introduction5.6.2 Distributed data storage5.6.3 Distributed query processing

5.7 Commit protocol5.8 Client server systems

Text Book:1. C.J.Date, Addision –Wiseley Publication2. Silverschatz, Korth and Sudersan, TMH


9

ORGANISATIONAL BEHAVIOUR (MITM 1.1.6)

UNIT I: ORGINISATIONAL BEHAVIOUR1.1 Management roles1.2 Management skills1.3 Challenges and opportunities for OB1.4 Models of OB1.5 Foundation of HRM & OB

1.5.1 Historical development of HR & OB1.5.2 Research foundation of OB

1.6 Communication1.6.1 The two way communication

1.6.1.1 Non verbal communication1.6.1.2 Downward and upward communication

1.6.2 Barriers to communication1.6.3 Informal Communication

UNIT II: PERSONALITY2.1 Personality Determinants2.2 Personality Attribute that influence OB2.3 Attitude

2.3.1 Concept of Attitude2.3.2 Types & Function of Attitude.

2.4 Motivation2.4.1 Theories of motivation

2.5 Perception2.5.1 Perceptual selectivity2.5.2 Social Perception

UNIT III: LEADERSHIP3.1 Leadership Theories3.2 Conflicts

3.2.1 Types of Conflict3.2.2 Conflict Process

3.3 Work Team3.3.1 Benefits of work team3.3.2 Types of work team3.3.3 Shaping individual to team player & TQM

UNIT IV: ORGANISATIONAL CHANGE4.1 Forces of change4.2 Lewin’s three step model to O.C.4.3 Work Stress and Stress Management4.4 Organizational Development

4.4.1 O.D. Process4.4.2 Client – Consultant Relationship

4.5 Organizational Development Intervention4.5.1 Types of Intervention

UNIT V: ORGANISATIONAL STRUCTURE5.1 Elements to design an Organization Structure5.2 Types of Organization

5.2.1 Line Organisation


10

5.2.2 Function Organisation5.2.3 Line and Staff Organisation5.2.4 Division Organisation5.2.5 Matrix Organisation5.2.6 Virtual Organisation

Text: Engineering Enterprise – BPBOrganization Behavior – L.N. Prasad


11

PRACTICAL

DATA STRUCTURE USING C (MITM 1.1.7)

UNIT-1Use of Abstract data type, program based on abstract data type, pointer concept, basic programming based on string (Using library function and without using library functions), concept of array, programming based on ID and 2D (Like symmetric matrix, multiplication of matrix, transpose of matrix, Lower triangular and upper triangular Matrix), simple program based on structure, using recursion to find Fibonacci series.

UNIT-2

Push ( ), Pop (), traverse ( ) programming in stack (Static representation only), addition and deletion in a static Queue, adding a new node at the begin (In single like list only), display the node, court the number of nodes present in linked list.

UNIT-3

Program based on tree traversal, concept of strictly binary tree, complete binary tree.

UNIT-4

Program based on sorting (bubble sort, Insertion sort, selection sort, Quick sort)

UNIT-5

Program based on searching Technique (linear search, binary search), searching of elements from a given array (Demonstration in lab).


12

PRACTICALSQL/PLSQL (MITM 1.1.8)

Unit-1The Oracle database environment Basic architecture conceptsOracle 10g ArchitectureMain features of 9i and 10gSQL BufferData TypesData Storage

Unit - 2Basic SQL*PLUS commands

Data Definition Language

CREATE, TRUNCATE, ALTER, DROP, RENAME, DESCRIBE

Data Manipulation Language

INSERT, UPDATE, DELETE

Using script files, START, @, GET , SAVE, LIST, PROMPT, PAUSE, ACCEPT, DEFINE, SPOOL

Unit - 3

Writing Query

Basic SELECT Statement

Writing the statement in sqlplus, Running the SELECT statement

Ordering the output

Single Column, Descending order, Multiple column sort

Conditional retrieval of data

Working with complex conditions, AND OR NOT LIKE BETWEEN

Working with variables

Creating and using variables, Command substitution

Pseudo columns and functions


13

Pseudo Columns, Rownum, Sysdate, UPPER, LOWER, INITCAP, RPAD(), RTRIM(), SUBSTR(), INSTR(), TRANSLATE(), REPLACE(), GREATEST(), LEAST(), DECODE

Working with date functions

TO_CHAR(), TO_DATE(), MONTHS_BETWEEN(), ADD_MONTHS(), LAST_DAY(), NEXT_DAY()

Aggregating data using group functions

GROUP BY, HAVING

Unit - 4

Working with database Constraints & Joins

Joining

Joining Condition,Self Join, Equijoin, Outer Join

Using Declarative Constraints

Not Null Constraint, Check Constraint, Unique Constraint, Primary Key Constraint, References Constraint

Using the SET operators

Union, Intersect, Minus

Database Security

Object Privileges, Granting access to objects

Views

Prerequisite, Simple View, Complex View, Inline View

Unit - 5

PL/SQL

Blocks

Structure, Writing Anonymous Blocks

Variables

Oracle Data types, TYPE and ROWTYPE declarations, Value assignments

Control structures Department of Information Technology Management, Ravenshaw

University, Cuttack14

IF ELSE ENDIF statement, IF ELSIF ELSE ENDIF statement, case end case, LOOP END LOOP statement, WHILE condition, FOR condition, Operators

Cursors

Implicit and Explicit Cursors, Cursor Manipulation statements, OPEN, FETCH ,CLOSE EXIT WHEN, Parameterizing Cursors

Procedures

Creating and Calling Procedures

Triggers

Database triggers, Calling procedures from triggers

COMPUTER GRAPHICS (MITM 1.2.9)

UNIT-1 COMPUTER GRAPHICS1.1. Computer Aided Design1.2. Presentation Graphics, Computer Art, Entertainment 1.3. Education Training1.4. Visualization, Image Processing, Graphical User Interface1.5. Overview of Graphics System

1.5.1 Video Display Device1.5.2 Raster Scan and Random Scan System

1.6 Output Primitives1.6.1. Points and lines, Bresenham’s Line Algorithm.1.6.2 Midpoint circle algorithm, Filled area primitives.

1.7 Attributes of Output Primitives.1.8 Line, Curve, Colour

1.8.1 Area fills, and character attributes.

UNIT-2 TWO DIMENSIONAL GEOMETRIC TRANSFORMATIONS2.1 Basic Transformation(Translation, Rotation, Scaling)2.2 Matrix representation and homogenous coordination2.3 Composite Transformation, Reflection shear.2.4 Two dimensional viewing

2.4.1 The viewing Pipe-line2.4.2 Viewing Coordinate Reference frame2.4.3 Window-to-viewpoint coordinates transformation.

2.5 Line Clipping (Cohen Sutherland Algorithm)2.5.1 Polygon clipping-(Sutherland-Hodgemen Algorithm)

UNIT-3 THREE DIMENSIONAL OBJECT REPRESENTATION3.1 Polygon Series3.2 Quadratic surface3.3 Spline Representative


15

3.4 Beizer Curves and surfaces3.5 B-Spline Curves and surface

UNIT-4 THREE DIMENSIONAL TRANSFORMATIONS4.1 Three Dimensional Geometric and Modeling Transformation

4.1.1 Translation, Rotation, Scaling, Reflection4.1.2. Shears, Composite Transformation

4.2 Three Dimensional Viewing4.2.1 View pipeline4.2.2. Viewing coordinates4.2.3. Projections (Parallel and Prospective).

UNIT-55.1. Visible

5.1.1 Surface detection Methods, backface detection5.1.2 Depth Buffer, A-Buffer, Scan-line and Depth sorting

5.2 Illumination Models5.2.1. Halftone Patterns and Dithering Technique

5.3 Surface Rendering Model5.3.1 Polygon Rendering Methods, Gouraud and phong shading

Text BookD. Heam & M.P. Baker: Computer Graphics, PHI, 1999

DATA COMMUNICATION AND NETWORKING (MITM 1.2.10)

UNIT-1 OSI REFERENCE MODEL 1.1 Physical Layer1.2 Data link Layer1.3 Network Layer1.4 Transport Layer1.5 Presentation Layer1.6 Session Layer 1.7 Application Layer

UNIT-2 PULSE COMMUNICATION SYSTEM2.1 Principles of PWM2.2 Principles of PPM2.3 Principles of PCM2.4 Fundamental of data Communication Systems

2.4.1 Characteristics of data transmission Circuit 2.4.1.1 Bandwidth requirement2.4.1.2 Data transfer rate 2.4.1.3 Noise 2.4.1.4 Crosstalk 2.4.1.5 Echo suppressor2.4.1.6 Distortion

2.5 Digital Codes2.5.1 Binary Code2.5.2 ASCII Code2.5.3 EBCDIC code

2.6 Error Detection and Correction Technique 2.6.1 Principles of constants ratio code

2.6.2 Principles of redundant codes


16

2.6.3. Retransmission 2.6.4. Forward error correcting codes 2.6.5. Hamming codes

UNIT-3 PHYSICAL LAYER 3.1. Transmission Media

3.1.1 Guided Media3.1.1.1 UTP/STP cables 3.1.1.2 Coaxial Cable.3.1.1.3 Fiber Optic Cable.

3.1.2. Unguided Media3.1.2.1 Basics RF (Radio Frequency) Communication 3.1.2.2 Basics of Micro Wave Communication3.1.2.3 Satellite communication

3.2. Switching & Multiplexing3.2.1 Frequency Division Multiplexing 3.2.2 Time Division Multiplexing 3.2.3 Circuit Switching 3.2.4 Packet Switching 3.2.5 Message Switching

UNIT-4 ROUTER & ROUTING

4.1 Introduction to Routing4.2 Factors Affecting Routing Algorithms 4.3 Routing Algorithms

4.3.1 Distance Vector Routing 4.3.2 Introduction

4.3.2.1 Function of Distance Vector Routing4.3.2.2 Routing Table4.3.2.3 Routing Table updation

4.3.3 Link State Routing4.3.3.1 Introduction4.3.3.2 Packet Cost4.3.3.3 Working of Link State Routing 4.3.3.4 Link State Packet, Link State Data Base

4.4 Types of Routing4.4.1 Static Routing4.4.2 Dynamic Routing

UNIT-5 TCP/IP (DNS, E-MAIL FTP, TFTP)

5.1 TCP/IP Basics.5.2 The concepts IP Addresses 5.3 Domain name system5.4 E Mail5.5 File Transfer protocol 5.6 Trivial File Transfer Protocol


17

Text Book:1. Data Communication & Networks, Achyut S Godbole, TMH

Data Communication and Networking, Forouzan, TMH

SOFTWARE ENGINEERING USING UML (MITM 1.2.11)

UNIT-1 INTRODUCTION TO SOFTWARE ENGINEERING

1.1. Introduction.1.1.1. Definition1.1.2. Objective1.1.3. Software life cycle models

1.1.3.1 Classical waterfall model1.1.3.2 Iterative waterfall model1.1.3.3 Prototyping model 1.1.3.4 Spiral model

1.2 Requirement Analysis & specification.1.2.1. Requirement gathering and Analysis.1.2.2. Software Requirement specification (SRS).

1.2.2.1 Contents of the SRS Document1.2.2.2. Requirement Methods.1.2.2.3. Communication Technique

UNIT-2 SOFTWARE DESIGN & ANALYSIS2.1 What is a good Software Design?

2.1.1 Cohesion and coupling.2.1.2 Modularity.2.1.3 Neat Arrangement

2.2 Software Design Approaches 2.2.1 Function Oriented Design 2.2.2 Object Oriented Design

2.3 Design Concepts2.3.1 Abstraction 2.3.2 Architecture


18

2.3.3 Information hiding 2.3.4 Functional Independence 2.3.5 Refinement

UNIT-3 OBJECT MODELING USING UML

3.1 Overview of object oriented concepts3.1.1 Basic Mechanisms 3.1.2 Advantages of object oriented design(OOD)

3.2 Unified Modeling language (UML) 3.2.1 UML Diagrams

3.3 USE CASE Model.3.4 CLASS Diagram 3.5 Activity Diagram3.6 Interaction Diagram3.7 State Chart Diagram

UNIT-4 CODING & TESTING 4.1 Coding

4.1.1.1 Coding standards and guidelines 4.2 Code review

4.2.1 Code Inspection 4.3 Testing

4.3.1 What is testing?4.3.2 Verification & Validation 4.3.3 Design test cases

4.4 Black box Testing4.4.1 Equivalence class partitioning 4.4.2 Boundary Value Analysis

4.5 White box Testing4.5.1 Control flow Testing

4.5.1.1 Statement Coverage 4.5.1.2 Branch Coverage

4.5.2 Data Flow Based Testing4.6 Debugging

UNIT-5 SOFTWARE RELIABILITY, QUALITY MANAGEMENT AND MAINTENANCE

5.1 Software Reliability5.1.1 Hardware vs. Software Reliability5.1.2 Reliability Metrics

5.2 Software Quality5.2.1 Software Quality Management System

5.2.1.1 ISO 90005.3 Computer Aided Software Engineering 5.4 Software MaintenanceDepartment of Information Technology Management, Ravenshaw


5.4.1 Types of Software Maintenance 5.4.2 Problems associated with Software Maintenance5.4.3 Estimation of Maintenance Cost

Text Book: 1. Fundamental of Software Engineering, Rajib Mall, PHI

Software Engineering Practitioner’s Approach, TMH


20

ACCOUNTS FOR DECISION MAKING (MITM 1.2.12)

UNIT-1 BASICS1.1 Meaning, Objective1.2 Need and branches of Accounting, Merits and Limitations of financial

Accounting1.3 Basic accounting terms, Accounting concepts and conventions.1.4 Journal and ledger, Sub-division of journal.

UNIT-2 TRIAL BALANCE2.1 Error and Suspense Account (Without rectification of error).2.2 Capital and Revenue (Income and expenditure)2.3 Depreciation Accounting2.4 Meaning Causes and types of depreciation (Simple problems form Straight

line method and fixed percentage on Diminishing balance Method only).

UNIT-3 FINAL ACCOUNT (SIMPLE)3.1 Final Account (With adjustment)3.2 Simple problems only

UNIT-4 MEANING4.1 Object, Function and Elements of cost sheet or statement of cost (Simple

problems without tender and quotations)4.2 Classification of costs. Budget and Budgetary control 4.3 Meaning of Budget and Budgetary control Objectives4.4 Merits and Limitations of Budgetary control, Classification and types of

Budgets. (Simple problems only from flexible budgets and receipt and payment method of cash budgets)

4.5 Responsibility. Accounting and Reporting Nature and Requirements of Responsibility Accounting.

4.6 Cost control through Responsibility Accounting (without problems).

UNIT-5 STANDARD COSTING MEANING 5.1 Steps involved in standard costing5.2 Standard costing Vs. Budgetary Control.5.3 Types of Standards, Merits and limitations of standard costing.5.4 Analysis of variances meaning and types of variances.5.5 Direct Material variance, Direct Labour variance, Overhead Variance and

Sales Variance (Simple or no problem).5.6 Marginal Costing meaning characteristics and assumptions of marginal

costing, Marginal Costing Vs. Absorption Costing Contribution and P/V Ratio.

5.7 Cost-Volume-Profit Analysis, Ascertainment of BEP and Margin of safety (Simple problems).

5.8 Managerial Decisions, Pricing profit planning make of Buy, key of limiting factors, Suitable sale Mix, Alternative methods of production.

5.9 Optimum level of Activity and evaluation of performance (Simple Problems).


21

INTERNATIONAL BUSINESS (MITM 1.2.13)

UNIT-1 INTRODUCTION & THEORIES OF INTERNATIONAL BUSINESS1.1 Definition of International Business1.2 Nature of International Business1.3 Difference between International & Domestic Business1.4 Advantages and problems in International Business1.5 Stages in internationalization 1.6 Theories of International Business

UNIT-2 ENTERING INTERNATIONAL BUSINESS2.1 Entry and expanding International Business2.2 International Business Analysis2.3 Modes of Entry, Exporting, Licensing, Franchising & Contract

manufacturing 2.4 International Business Strategies2.5 Turnkey projects, FDI, Mergers & acquisitions.

UNIT-3 GLOBALISATION

3.1 Meaning, Definition, features of Globalization3.2 Barriers of globalization, Advantage and disadvantage of globalization3.3 Evolution of globalization, Methods of globalization.3.4 Essential Conditions of globalization3.5 How globalization is helping India.

UNIT-4 MNCS & INTERNATIONAL BUSINESS 4.1 Introduction and Definition4.2 Globalization and growth of MNCs4.3 Distinction between globalization among India Companies.4.4 MNC, Global Companies, TNC4.5 Merits and Demerits going MNCs4.6 MNCs in India.

UNIT-5 FOREIGN EXCHANGE5.1 Why foreign Exchange?5.2 Concept of Exchange rate determination5.3 Concept of current account convertibility5.4 Concept of capital account convertibility5.5 Balance of trades, Balance of payment’5.6 B.O.P. disequilibrium as measure as for rectification

Ref. Books:

1. International Business-N.V. Badi, Vrinda Publication. ND 912. International Business contract Management-S.K.Nayar-Vrinda Publication,

ND-91

Text Books:


22

1. Building Data Mining Application for CRM by Alex Berson. Stsphen Smith, Kurt Thearling (Tata Mc Graw)

ELECTIVE 1 (MITM 1.2.14)

ONE SUBJECT IS TO BE SELECTED AS ELECTIVE – I FROM FOLLOWING LIST FOR SEMESTER II

ANALYSIS DESIGN OF ALGORITHMS/ MULTIMEDIA/ BIO-INFORMATICS.

N.B: THE DETAILS SYLABII OF ABOVE SUBJECTS ARE AVAILABLE AT THE END OF THE SYLLABUS WITH PAPER CODE (MITM 1.2.14)


23

PRACTICALComputer Graphics Using C & C++ (MITM 1.2.15)

Unit -I

1. Using graphics.h

Demonstrate the background concepts of enabling graphics mode in C and usage of various graphic functions available in graphics.h

2. Animation

Writing simple animation programs by using graphics library.

Unit- II

3. Line Drawing

Demonstrate background concepts of DDA, Bresenham’s Algorithm and implementing line drawing algorithm in C.

4. Circle

Demonstrate background concepts of Bresenham’s Mid Point Circle Algorithm and Implementing Mid Point Circle drawing algorithm in C.

Unit -III

5. Transformation

Demonstrate background concepts of 2D transformation and implementing transformation, rotation using C.

6. Line Clipping

Demonstrate background concepts of Line Clipping and implementing Line Clipping using C.

Unit-IV

7. Polygon Clipping

Demonstrate background concepts of Polygon Clipping and implementing Poly Clipping using C.

8. Beize Curve

Demonstrate background concepts Beize Curve and implementing Beize Curve using C.

Unit-V

9. Scaling

Demonstrate background concepts Scaling and implementing Scaling using C.

10. Line, Curve, Color

Demonstrate Area Fill, Character Attributes, initializing.


24

PRACTICALNetworking Lab (MITM 1.2.16)

UNIT – I1. Cabling and Cable Testing:

Demonstrate the back-ground concepts and the hands-on-activities involved in preparing a patch/cross cable using UTP Cat-5 cable.

2. Using the Multi-Meter:Demonstrate the back-ground concepts and the hands-on-activities involved in measuring AC / DC Voltage and checking continuity as well as earthing.

UNIT – II

3. Installing and Configuring a Virtual PC:Demonstrate the back-ground concepts and the hands-on-activities involved in creating a Windows XP Professional Computer using Microsoft Virtual PC 2007.

4. Establishing a Peer-to-Peer Network:Demonstrate the back-ground concepts and the hands-on-activities involved in establishing a peer-to-peer network using a star topology.

UNIT – III5. Configuring Net-Meeting:

Demonstrate the back-ground concepts and the hands-on-activities involved in configuring Microsoft Net-Meeting in an already existing Peer-to-Peer Network.

6. Installing Windows Server 2003:Demonstrate the back-ground concepts and the hands-on-activities involved in installing Microsoft Windows Server 2003.

UNIT – IV7. Installing and Configuring a DHCP Server:

Demonstrate the back-ground concepts and the hands-on-activities involved in installing and configuring a DHCP Server on an existing Windows Server 2003.

8. Installing and Configuring a DNS Server:Demonstrate the back-ground concepts and the hands-on-activities involved in installing a DNS Server on an existing Windows Server 2003.

UNIT – V

9. Installing and Configuring Active Directory Services:Demonstrate the back-ground concepts and the hands-on-activities involved in installing and configuring Active Directory Services on an existing Windows Server 2003.

10. Configuring the Internet:Demonstrate the back-ground concepts and the hands-on-activities involved in configuring an XP Professional Computer for internet access and sharing, using a telephone line and modem.


25

SEMESTER III


26

DATA MINING APPLICATION FOR CRM (MITM 2.3.17)

UNIT I CUSTOMER RELATIONSHIPS

1.1 Introduction1.2 What is Data Mining?1.3 Data mining and customer relationship management

1.3.1 How data mining helps data marketing?1.3.2 Scoring1.3.3 The role of campaign management software1.3.4 Increasing customer lifetime value1.3.5 Combining data mining and campaign management1.3.6 Evaluating the benefits of a data mining model

UNIT II DATA MINING AND DATA WAREHOUSING – A CONNECTED VIEW

2.1 Introduction 2.2 Data mining and data warehousing the connection

2.2.1 Data warehousing ROI2.2.2 Operational and informational data stores2.2.3 Definition and characteristics of a data warehouse2.2.4 Data warehouse architecture

2.3 Data mining2.3.1 Data mining defined2.3.2 Data mining application domains2.3.3 Data mining categories and research focus

UNIT III CUSTOMER RELATIONSHIP MANAGEMENT

3.1 Introduction 3.2 The most profitable customer3.3 Customer relationship management

3.3.1 The customer centered database3.3.2 Managing campaigns

3.4 The evolution of marketing3.5 Closed loop marketing3.6 The CRM architecture3.7 Next generation CRM3.8 foundation – Technology and Tools

UNIT IV DATA MINING

4.1 What is data mining?4.2 Discovery vs. predication4.3 Over fitting4.4 State of the industry


27

4.4.1 Targeted solution4.4.2 Business tools4.4.3 Business analyst tools4.4.4 Research analyst tools

4.5 Data mining methodology4.5.1 What is pattern? What is model?4.5.2 Visualizing a pattern4.5.3 A note on terminology4.5.4 A note on knowledge and wisdom4.5.5 Sampling4.5.6 Validating the model

UNIT V CUSTOMER PROFITABILITY

5.1 Introduction5.2 Why calculate customer profitability?5.3 The effect of loyalty on customer profitability5.4 Customer loyalty and the law of compound effect5.5 What is customer relationship management?5.6 Optimizing customer profitability through data mining5.7 Predicting future profitability5.8 Using customer profitability to guide marketing5.9 Incremental customer profitability

Text BookBuilding Data Mining Application for CRM, Alex Berson, Stephen Smith, Kurt Thearling, TMH


28

ARTIFICIAL INTELLIGENCE (MITM 2.3.18)

UNIT IIntroduction to AI, Application areas of AI, State-space search: production system design, production system characteristics.Search techniquesBlind search: depth first search, breadth first searchHeuristic search techniques: Hill climbing, best first search. Branch and bound, A*, AO*

UNIT IIGame playing: Min- Max search, Alpha- Beta cutoffKnowledge Logic: Skolemizing queries, Unification algorithm, Modus ponen, Resolution

UNIT IIIStructured knowledge representation: semantic nets, frames, conceptual dependency scripts.Expert system: expert system need & justification, rule bases architecture.Non-production system architecture case studies of expert system: MYCIN, R1

UNIT IVConcept of learning, types of learning, genetic algorithm, neural networks.Natural language processing: introduction syntactic processing,Knowledge organization & Management: Introduction, HAM

UNIT VLISP: syntax and numeric functions. Basic list manipulation function, functions, predicate and conditionals, input, output and local variables, iteration and recursion, property list and arrayProlog: function, syntax and predicate

Text Book:1. Artificial Intelligence, Paterson2. Artificial Intelligence, Knight & Ritche


29

HUMAN RESOURCE MANAGEMENT (MITM 2.3.19)

UNIT I1.1 History of HRM1.2 Functions of HRM1.3 Roles of challenges to HR executives1.4 Organizational structure and HRM1.5 Formal and informal, Tall & Flat Organization, Line & Staff Function & role of HR In

an Organization1.6 Concept of IHRM, Approaches to IHRM1.7 Features affecting IHRM1.8 HR planning at different levels1.9 Managing the forecasted demand and supply

UNIT IIJob analysis and modern management techniqueRecruitment and its source of recruitmentSelection and it’s process of selectionSelection tests, interviews & placementConcepts of socialization with its strategies

UNIT III3.1 Performance appraisal and the approaches3.2 Performance of appraisal methods3.3 Drawbacks/pitfalls in performance appraisal3.4 Employee training and methods of training

UNIT IV4.1 Compensation Management4.2 Concepts of wage and salary administration4.3 Types of incentive plans

UNIT V5.1 Occupational safety and health

5.1.1 Cause of safety and health in work place5.1.2 Stress and its consequences on employee performance

5.2 Grievance handling5.2.1 Steps in grievance handling procedure & grievance committee

5.3 Disciplinary action5.3.1 Types of disciplinary action

5.4 Quality of work life5.4.1 Methods to improve QWL

Text Book:1. Human Resource Management, K.Aswathappa, TMH2. Essential of Human Resource Management and Industry, P.Subbarao, Himalaya Pub.


30

WEB TECHNOLOGY (MITM 2.3.20)

UNIT I INTRODUCTION TO HTML & JAVA SCRIPT

1.1 Internet concepts and WWW1.2 Introduction to HTML

1.2.1 Basic tags of HTML1.2.1.1 Common Tags: HTML,TITLE, BODY, HEADER1.2.1.2 Formatting Tags: P,B,I,U,FONT,BR,HR1.2.1.3 Images and Linking: IMG, A1.2.1.4 List and Table Structure1.2.1.5 Frame and Frameset

1.2.2 Forms and Controls1.2.2.1 FORM1.2.2.2 Text, Radio, Checkbox1.2.2.3 Select1.2.2.4 Button

1.3 Introduction to Java Script1.3.1 Elements of Java Script

1.3.1.1 Variables1.3.1.2 Data Types1.3.1.3 Operators1.3.1.4 Control Statements1.3.1.5 Functions

1.3.2 Dialogs: Performing I/O1.3.3 Objects in Java Script such as Date, Math, String1.3.4 Document Object Model: Document, Form, Controls1.3.5 Event Handling

UNIT II EXTENDED MARK-UP LANGUAGE

2.1 Introduction and Feature2.2 Use of XML2.3 XML document, Creating XML, DTD2.4 Reading XML2.5 XML and HTML


31

UNIT III JAVA APPLET & SERVLET3.1 Applet

3.1.1 Creating and Managing Applets3.1.2 Introduction to JDBC and its Components3.1.3 Implementing JDBC in Applet

3.2 Servlet3.2.1 Creating Servlet3.2.2 Managing request and response in Servlet3.2.3 Servlet Collaboration3.2.4 Session Tracking

UNIT IV JAVA SERVER PAGES & ENTERPRISE JAVA BEANS4.1 JSPs

4.1.1 Introduction4.1.2 Structure of JSP4.1.3 Implementation of JSP

4.2 EJB4.2.1 Introduction4.2.2 Components of EJB4.2.3 Implementing EJB

UNIT V RMI AND JAVA NETWORKING5.1 Remote Method Invocation

5.1.1 Introduction5.1.2 Structure of RMI5.1.3 Implementing RMI

5.2 Java Networking5.2.1 Introduction5.2.2 Datagram and Sockets5.2.3 Implementing Sockets

5.3 File Formats: gif, jpeg, png

Reference1. Teach yourself web technologies part I & II- I. Bayross. BPB2. Web Design in a Nutshell- J. Niederst, SPD 3. Java Server Programming- J2EE Edition – A Subramanyam, SPD4. Step by Step XML- M.Young, PHI


32

CRYPTOGRAPHY & SECURITY (MITM 2.3.21)

UNIT I

1.1 Services, Mechanisms and attack1.2 The OSI Security Architecture1.3 A model for Network Security

1.3.1 Symmetric Cipher Model1.3.2 Cryptography, Cryptoanalysis1.3.3 Substitution Technique1.3.4 Seaser Cipher1.3.5 Monoalphabetic Cipher1.3.6 Playfair Cipher

1.4 Transposition Technique

UNIT II

2.1 Data Encryption Standard (DES)2.2 Block Cipher Principles2.3 Stream Cipher2.4 Block Cipher2.5 The avalanche Effect2.6 The strength of DES2.7 Block Cipher Design Principles and Block Cipher Mode of operation

UNIT III

3.1 Modular Arithmetic 3.2 Euclid’s Algorithm 3.3 Finite fields of the form GF(P)3.4 Principle of public key crypto systems3.5 Applications for public key crypto systems3.6 The RSA algorithm3.7 The security of RSA3.8 Diffie Hellman key exchange

UNIT IV

4.1 Authentication requirement 4.2 Authentication functions

4.2.1 Message encryption4.2.2 Message authentication code4.2.3 Hash Function

4.3 MD5 Message Digest Algorithm4.3.1 MD5 Logic


33

UNIT V

5.1 Digital Signatures5.1.1 Direct Digital Signature5.1.2 Arbitrated Digital Signature5.1.3 Authentication Protocol

5.1.3.1 Mutual Authentication5.1.3.2 Symmetric Encryption Approach5.1.3.3 Public Key Encryption Approach

5.1.4 Digital Signature Standard5.1.5 Kerberos

5.1.5.1 Kerberos Version 4

Text Book1. Cryptography and Network Security principles & practices, W. Stallings, Pearson

Education2. Cryptography: theory & practices, D. Stinson, CRC Press

Ref. BookHandbook of applied cryptography, A. Menezes, p.Van. OOrscg, S. Vanstans, CRC Press


34

ELECTIVE II (MITM 2.3.22)

ONE SUBJECT IS TO BE SELECTED AS ELECTIVE – II FROM FOLLOWING LIST FOR SEMESTER III

EMBEDDED SYSTEM/ MANAGERIAL ECONOMICS/ PARALLEL COMPUTING.

N.B: THE DETAIL SYLABII OF ABOVE SUBJECTS ARE AVAILABLE AT THE END OF THE SYLLABUS WITH PAPER CODE (MITM 2.3.22)


35

Practical

WEB DESIGNING WITH JAVA (MITM 2.3.23)

UNIT I

1. HTML

Writing HTML scripts with various html tags & Different Controls.

2. JAVA SCRIPT

Writing Java Script, Using Variables, Data Types, Operators, Control Statements, and Functions.

UNIT II3. EXTENDED MARK-UP LANGUAGE

Creating XML, DTD, Reading XML4. JAVA APPLET

Demonstrate background concepts of Applet, Procedure to create, compile and execute java applet.

UNIT III5. JDBC

Demonstrate Background concepts of JDBC, Procedure to implement JDBC in Applet.6. SERVLET

Creating Servlet, Managing request and response in Servlet, Servlet Collaboration

UNIT IV7. JAVA SERVER PAGES Demonstrate background concepts of JSP, Structure of JSP, Implementation of JSP

8. ENTERPRISE JAVA BEANSDemonstrate Background Concepts of EJB, Components of EJB, Implementing EJB

UNIT V9. RMI Demonstrate Background concepts of Remote Method Invocation, Implementing RMI10. JAVA NETWORKINGDemonstrate background concept of Java Networking, Datagram and Sockets, Implementing

Sockets


36


37

Mini ProjectMITM (2.3.24)

Key Features

DETAIL OF PROJECT GUIDELINES IS AVAILABLE IN THE DEPARTMENT.


38

Internship (Project)

(MITM 2.4.25)

Understand the key activities of the of the Internship Project,

Know your Roles and Responsibilities,

Understand how to select a project topic,

Understand how to start the project,

Preparation and Implementation of Live Project,

Know the guidelines for proposal and report preparation,

Know the Evaluation scheme, and

Know the Assessment guidelines.

DETAIL OF PROJECT GUIDELINES IS AVAILABLE IN THE DEPARTMENT.


39

ELECTIVE I

ANALYSIS AND DESIGN OF ALGORITHM (MITM 1.2.14)

UNIT I ALGORITHM AND COMPLEXITY1.1 Asymptotic notation, orders, worst case, best case and average case1.2 Notations

1.2.1 Big Oh(O), 1.2.2 Big OMEGA(Ω)1.2.3 Small Oh(O)1.2.4 Small Omega(ω)1.2.5 Theta

1.3 Master method1.3.1 Examples1.3.2 Iterative method

UNIT II BASIC TECHNIQUES2.1 Divide and conquer technique2.2 Quick sort (best case, worst case)2.3 Randomized quick sort2.4 Dynamic programming2.5 TSP (Traveling Salesman Problem)

UNIT III BASIC TECHNIQUES OF GREEDY 3.1 Greedy method3.2 Activity selection problem3.3 Job sequence with deadlines3.4 Matrix chain multiplication

UNIT IV SEARCHING AND SORTING TECHNIQUE4.1 Back tracking ( 8 Queen’s problem)4.2 Branch and bound

4.2.1 Four queen problem4.2.2 15 puzzle problem

4.3 The decision tree model4.4 Sort

4.4.1 Bubble sort4.4.2 Heap sort

4.6 String matching (Rabin Karp Only)

UNIT V GRAPH THEORY

5.1 Graph algorithm5.2 BFS, DFS5.3 Shortest path algorithm

5.3.1 Dijkstra’ algorithm5.3.2 Prims’ algorithm

5.4 Theory of NP completeness(only theory)

Book: Algorithm Designing, Sahani & OthersDepartment of Information Technology Management, Ravenshaw


ELECTIVE I

BIOINFORMATICS (MITM 1.2.14)

UNIT I BASIC CONCEPT OF MOLECULAR BIOLOGY1.1 Cellular architecture1.2 Nucleic Acid (RNA, DNA), DNA Replication1.3 Repair And Recombination1.4 Transcription, translation1.5 Genetic codes, gene expression1.6 Protein structure and function, molecular biology and tools1.7 Statistical methods, estimation, Hypothesis testing1.8 Random walks, Markov models

UNIT II SUFFIX TREES2.1 Definition and examples2.2 Ukkonen’s linear time suffix tree algorithm2.3 Applications ( exact string matching, Longest common sub strings of two strings,

recognizing DNA contamination)

UNIT III PAIR WISE SEQUENTIAL ALIGNMENT (LOCAL)3.1 HMM for pair wise alignment3.2 Multiple string alignment3.3 Need of MSA, Family & super family representation, multiple sequence3.4 Comparison for structural interferences , multiple alignment with sum of pairs

consensus objective functions3.5 Profile HMM for multiple sequence alignment3.6 Database searching for similar sequence (FASTA BLAST), PAM, BLOSOM

substitution matrices

UNIT IV SEQUENCING4.1 Fragment assembly (Shortest common super string. Algorithm based on multigraph)4.2 Sequencing by Hybridization, protein sequencing

UNIT V MOTIF PREDICTION5.1 Gene prediction5.2 Introduction protein prediction


41

ELECTIVE I

MULTIMEDIA (MITM 1.2.14)

UNIT I MULTIMEDIA1.1 Definition1.2 CD-ROM and the multimedia highway1.3 Uses of multimedia1.4 Introduction to making multimedia1.5 The stages of project1.6 Requirements of make good multimedia1.7 Multimedia skills and training1.8 The multimedia tea1.9 Training opportunities in multimedia

UNIT II MULTIMEDIA BUILDING BLOCKS2.1 Text2.2 Sound2.3 Images2.4 Animation2.5 Video2.6 Assembling and delivering a project

2.6.1 Planning and costing2.6.2 Designing and producing2.6.3 Content and talent2.6.4 Delivering2.6.5 CD-ROM Technology

UNIT III MULTIMEDIA AND THE INTERNET3.1 History3.2 Internet working3.3 Connections3.4 Internet services3.5 The World Wide Web3.6 Tools for the WWW3.7 Web servers3.8 Web browsers3.9 Web page makers and editors3.10 Plug-ins and delivery vehicles

UNIT IV MULTIMEDIA WITH HTML4.1 HTML4.2 VRML4.3 Designing for the WWW4.4 Working on the web4.5 Text for the web4.6 Images for the web4.7 Sound for the web4.8 Animation for the web


42

UNIT V MULTIMEDIA APPLICATIONS5.1 Media communication5.2 Media consumption5.3 Media entertainment5.4 Multimedia games

Text bookMultimedia making it wok, Tay Vaughan, TMI

Ref. book1. Multimedia systems design, K. Andleigh and K. Thakkarar, PHI2. Multimedia: Computing Communication & application3. Advanced Multimedia Programming4. Multimedia Literacy


43

ELECTIVE II

MANAGERIAL ECONOMICS (MITM 2.3.22)

UNIT I NATURE AND SCOPE OF MANAGERIAL ECONOMICS1.1 Concepts & techniques1.2 Nature of business decision making1.3 Marginal analysis1.4 Marginal utility1.5 Marginal rate of substitution(MRS)1.6 Demand theory & laws1.7 Demand function1.8 Income & substitution effect1.9 Review reference theory1.10 Demand forecasting

UNIT II PRODUCTION & COST CURVES2.1 Cost curves2.2 Various effect affecting cost curves2.3 Returns to scale2.4 Break even analysis

UNIT III THEORY OF FIRM3.1 Firm structure3.2 Profit maximization3.3 Sales maximization3.4 Organization slack3.5 Ownership & control

UNIT IV MARKET STRUCTURE4.1 Competition4.2 Monopoly4.3 Duopoly4.4 Oligopoly4.5 Non-price competition4.6 Monopolistic competition

UNIT V RECENT DEVELOPMENT AND APPLICATION5.1 Scale, scope& core competition of firm5.2 Centralisation and Decentralisation5.3 Role of management in co-ordination5.4 Globalisation for economics activity5.5 Innovation in ownership5.6 Case studies

Books1. Managerial Economics, M. Adhikary2. Micro Economics, P.N. Chopra, Maheswari

Economic theory & Operation analysis, W.J. Bannol


44

ELECTIVE II

EMBEDDED SYSTEM (MITM 2.3.22)

UNIT I FAMILY OF 8051

The 8051 Microcontrollers- Microcontrollers and Embedded Processors, Overview Of The 8051 Family.8051 Assembly Language Programming- Inside the 8051, Introduction to 8051 Assembly Programming, Assembling and Running an 8051 Program. The Program Counter And Rom Space In The 805 L Data Types And Directives, 8051 Flag Bits And PSW Register. 8051 Register Banks and StackJump. Loop and Call Instructions - Loop and Jump Instructions. Call Instructions. Time Delay Generation and Calculation.

UNIT II ACCESSING MEMORY IN 8051

I/O Port Programming- Pin Description of the 8051, I/O Programming. Bit Manipulation 8051 Addressing Modes- Immediate And Register Addressing Modes. Accessing Memory Using Various Addressing Modes.

UNIT III INSTRUCTION IN 8051

Arithmetic Instruction and Programs- Unsigned Addition and Subtraction. Unsigned Multiplication and Division. Signed Number Concepts and Arithmetic Operations.Logic Instructions and Programs- Logic and Compare Instructions. Rotate and Swap Instructions. BCD And ASCII Application Programs.Single –Bit Instruction and Programming- Single – Bit Instruction Programming. Single-Bit Operations with CY. Reading Input Pins vs. Latch

UNIT IV PROGRAMMING TIMER IN 8051

Timer/ Counter Programming In the 8051- Programming 8051 Timers. Counter Programming8051 Serial Communication- Basics of Serial Communication. 8051 Connection to RS232. 8051 Serial Communication Programming.

UNIT V INTERRUPTS IN 8051

Interrupts Programming- 8051 Interrupts, Programming Timer Interrupts, Programming External Hardware Interrupts, Programming The Serial Communication Interrupts, Interrupt Priority in the 8051.Real Time Operating System- Introduction, Types and Classifications of RTOS, Task, Scheduling, Process, Semaphores, Application.

Reference book1. Embedded System using 8051 Microcontroller- Majdi & Majdi2. Embedded Software Premire.


45

ELECTIVE II

PARALLEL COMPUTING (MITM 2.3.22)

UNIT I1.1 Introduction To Parallel Computing1.2 Motivating Parallelism1.3 Scope Of Parallel Computing1.4 Parallel Programming Platforms

1.4.1 Implicit Parallelism1.4.2 Limitation Of Memory System Performance1.4.3 Dichotomy Of Parallel Computing Platform1.4.4 Physical Organization Of Parallel Platforms1.4.5 Communication Cost Of Parallel Machines1.4.6 Routing Mechanism For Interconnection Networks1.4.7 Impact Of Process, Processor Mapping & Mapping Technique

UNIT II2.1 Principle Of Parallel Algorithm Design

2.1.1 Preliminaries2.1.2 Decomposition Technique2.1.3 Characteristic Of Task And Interaction2.1.4 Mapping Techniques For Load Balancing2.1.5 Methods For Containing Interaction Over Head2.1.6 Parallel Algorithm Models

UNIT III3.1 Analytical Models Of Parallel Programs

3.1.1 Source Of Overhead In Parallel Programs3.1.2 Performance Metrics For Parallel Systems3.1.3 The Effect Of Granularity On Performance3.1.4 Scalability Of Parallel System3.1.5 Minimum Execution Time And Minimum Cost-Optional Execution Time3.1.6 Other Scalability Matrices

UNIT IV4.1 Basic Communication Operation

4.1.1 One To All Broadcast & All-One Reduction4.1.2 All- All Broadcast And Reduction4.1.3 Scatter & Gather4.1.4 All- All Personalized Communication4.1.5 Circular Shift

4.2 Introduction to MPIP principle of message4.2.1 Passing Programming4.2.2 The Building Blocks (Send & Receive Operation)4.2.3 MPI- The Message Passing Interface4.2.4 Collective Communication And Communication Operations


46

4.2.5 Examples Of Matrices4.2.5.1 Matrix Multiplication4.2.5.2 1D Matrix Vector, Multiplication Using MPI

UNIT V5.1 Matrix Vector Multiplication5.2 Matrix-Matrix Multiplication ( A Simple Parallel Algorithm, Cannon’s Algorithm)5.3 A Simple Gaussion Elimination Algorithm5.4 Solving A Triangular System ( Back Substitution)5.5 Issue In Sorting On Parallel Computers, Odd-Even Transposition Quick Sort

Text Book1. Introduction To Parallel Computing 2nd Edition, Ananath Grama, Ansal Gupta, Pearson


47

Semester IV


48

M.sc Syllabusgfgghggg

Documents

Transcript of M.sc Syllabusgfgghggg