MCA Syllabus –P.G. Dept. of Computer Science, …. (IT)_1_4_9_2015.pdfMIT-2T3-C Software Engineering Core 4 ... Department of Computer Science, IUST 2 Semester-IV ... guided and

Department of Computer Science

Islamic University of Science and Technology

Proposed

Credit Based Choice Based Curriculum

for

Master of Science in Information

Technology

(M.Sc. IT) Programme

2015 Onwards

MSc IT Syllabus – Department of Computer Science, IUST

1

Structure of CBCS Curriculum for MSc IT

Semester-I (24 Credit Semester)

Course Code Course name Paper

category

Hours / Week Credits

L T P

16 Core Credit Units

MIT-1T1-C Advanced Programming Concepts in C /

C++

Core 3 0 2 4

MIT-1T2-C Database Management System Core 3 0 2 4

MIT-1T3-C Discrete Mathematics Core 4 0 0 4

MIT-1T4-C Fundamentals of IT Core 4 0 0 4

6 Elective Credit Units

MIT-1E1-DCE Digital Electronics DCE 3 0 0 3

MIT-1E2-DCE Elements of Business Management DCE 3 0 0 3

MIT-1E3-DCE E-Commerce DCE 3 0 0 3

MIT-1E4-DCE Technical Communication DCE 3 0 0 3

2 credit units to be taken from outside departments

Semester-II(24 Credit Semester)


category


L T P


MIT-2T1-C Data and File Structures Core 3 0 2 4

MIT-2T2-C Computer Graphics Core 3 0 2 4

MIT-2T3-C Software Engineering Core 4 0 0 4

MIT-2T4-C Computer Organization and Architecture Core 4 0 0 4


MIT-2E1-DCE Operational Research DCE 3 0 0 3

MIT-2E2-DCE Open Source Technologies DCE 3 0 0 3

MIT-2E3-DCE Information Systems DCE 3 0 0 3

MIT-2E4-DCE Green Technologies DCE 3 0 0 3


Semester-III(24 Credit Semester)


category


L T P


MIT-3T1-C Design and Analysis of Algorithms Core 3 0 2 4

MIT-3T2-C Java / Dot Net Core 3 0 2 4

MIT-3T3-C Data Communication and Computer

Networks

Core 4 0 0 4

MIT-3T4-C Operating System Core 4 0 0 4


MIT-3E1-DCE Programming Languages and Paradigms DCE 3 0 0 3

MIT-3E2-DCE Artificial Intelligence DCE 3 0 0 3

MIT-3E3-DCE Soft Computing DCE 3 0 0 3

MIT-3E4-DCE Parallel and Distributed Computing DCE 3 0 0 3



2

Semester-IV(24 Credit Semester)


category


L T P


MIT-4T1-C Project Work Core 0 0 4 4

MIT-4T2-C Multimedia and Data Mining Technologies Core 3 0 2 4

MIT-4T3-C Research Methodologies Core 4 0 0 4

MIT-4T4-C Theory of Formal Languages Core 4 0 0 4


MIT-4E1-DCE Network Security DCE 3 0 0 3

MIT-4E2-DCE Bio Informatics DCE 3 0 0 3

MIT-4E3-DCE Cloud and Grid Computing DCE 3 0 0 3

MIT-4E4-DCE Information Security and Networks DCE 3 0 0 3

MIT-4E5-DCE Pattern Recognition DCE 3 0 0 3



3

Semester - I


4

Semester-I (24 Credit Semester)


category


L T P


MIT-1T1-C Advanced Programming Concepts in C /

C++

Core 3 0 2 4

MIT-1T2-C Database Management System Core 3 0 2 4

MIT-1T3-C Discrete Mathematics Core 4 0 0 4

MIT-1T4-C Fundamentals of IT Core 4 0 0 4


MIT-1E1-DCE Digital Electronics DCE 3 0 0 3

MIT-1E2-DCE Elements of Business Management DCE 3 0 0 3

MIT-1E3-DCE E-Commerce DCE 3 0 0 3

MIT-1E4-DCE Technical Communication DCE 3 0 0 3



5

Course No: MIT-1T1-C

Course Title: Advanced Programming Concepts in C / C++

UNIT I

C programming language: Evolution, Features & Importance. Basic Structure of C programs,

Character Set, Identifiers, Reserved Words, Data Types, Constants, Variables, Symbolic Constants,

Casting, and Standard Libraries.

Logical and Control Structures: Assignment, Arithmetic, Relational, Logical, Compound,

Increment, Decrement, Bitwise Operators & Special Operators.

IF, IF – ELSE, ?:, SWITCH CASE.

Looping Constructs: FOR, WHILE, DO-WHILE, EXIT, BREAK, CONTINUE

UNIT II

Functions: Concepts, Elements, Prototypes & Types. Storage classes. Recursion. Command-line

arguments. Multifile programming. Preprocessing.

Arrays: Types of arrays, initialization, passing arrays to functions, dynamic arrays. Character Arrays

& Strings. String-handling functions. Pointers: Concepts, Variables, swapping data, swapping

address v/s data, pointers & arrays, pointers to pointers, pointer to strings, pointer arithmetic,

additional operators, pointers to functions, void pointers

UNIT III

Structures and Unions: Syntax & use, members, structures & pointers, array of structures,

structures & functions, structure within structures.

OOPS: Evolution and need of C++, Advantages over Procedural programming, Introduction to

classes and objects, Basic OOPS programming, Constructors and Destructors, Copy Constructors.

UNIT IV

Inheritance and Polymorphism: Inheritance. Polymorphism (static and dynamic),function

overloading, function overriding, virtual functions, & operator overloading.

Files: File processing in C & C++.

Templates: Concepts, Function & Class templates, Standard Template library: Containers,

Algorithms, Iterators and Function objects.

TEXT BOOKS:

1. Dietel & Dietel, “How to program”, Pearson Education

2. Robert Lafore, “Object Orientation with C++ Programming”, Waite Group

REFERENCES:

1. Herbert Schildt, “C++ The Complete Reference”, Tata McGraw Hill

2. Dennis Richie & Kernighan, “C Programming Language”, Prentice Hall


6


Course Title: Database Management System

UNIT I

Basic Concepts and Conceptual Database Design: Database Users, Characteristics of the Database,

Advantage of using Database Systems, Data Models, schemas and instances, Three Tier Architecture

& Data Independence, Database Languages & Interfaces. Overview of Legacy Data Base

Management Systems. Data Modeling Using The Entity-Relationship Model – Entities, Attributes

and Relationships, Cardinality of Relationships, Strong and Weak Entity Sets, Translating your ER

Model into Relational Model.

UNIT II

Relational Model, Languages & Systems: Relational Data Model, Relational Model Concepts,

Relational Model Constraints, Relational Algebra, SQL – A Relational Database Language, Data

Definition & Manipulation in SQL, Queries in SQL, Specifying Constraints in SQL, Practicing SQL

commands using ORACLE. Case Study – ORACLE.

UNIT III

Functional Dependencies & Normalization for Relational Databases: Functional Dependencies,

Normal Forms based on primary keys, General Definitions of Second and Third Normal Forms,

Boyce-Codd Normal Form, Multivalued Dependencies.

Case Study – Table Normalization.

UNIT IV

Transaction Management: Transaction Concept and State, Desirable Properties of a Transaction,

Characterizing Schedules based on Serializability and Recoverability, Concurrency Control

Techniques: Lock-Based Protocols, Timestamp-based Protocols, Validation–based Protocols.

Database Recovery Techniques: Recovery Concepts, Recovery based on Deferred Update and

Immediate Update. Shadow Paging. Overview of Object Oriented Database Management Systems,

Distributed Data Base Management Systems.

REFERENCES:

1. Korth, Silberschatz, “Database System Concepts”, TMH

2. Steve Bobrowski, “Oracle 8 Architecture”, TMH

3. Date C. J., “An Introduction to Database Systems”,Narosa Publishing

4. Elmsari and Navathe, “Fundamentals of Database Systmes”, A. Wesley

5. Ullman J. D., “Principles of Database Systems”, Galgotia Publications

6. William Page, “Using Oracle 8i – Special Edition”, Que/PHI

7. Ivan Bayross, ”SQL & PL/SQL Using Oracle 8i & 9i with SQLJ”, BPB

8. Desai.B, "An introduction to Database Concepts", Galgotia Publications


7


Course Title: Discrete Mathematics

UNIT I

Sets: Review of set concepts & operations on sets. Functions: Domain, Range, One-to-One, Onto,

Inverses and Composition, One-to-One Correspondence and the Cardinality of a Set, sequences &

summations, the growth of functions. Methods of Proof: Different methods of proof, Direct Proof,

Indirect Proof, Mathematical Induction for proving algorithms. Propositions & logical operations,

Notation, Connections, Normal forms and Truth Tables. Equivalence and Implications. Theory of

inference for statement calculus, Predicate calculus, Quantifiers, Rules of Logic.

UNIT II

Principles of counting: The Principle of Inclusion-Exclusion, Applications of inclusion-exclusion

principle, The Addition and Multiplication Rules, The Pigeon-Hole Principle . Permutation &

combinations. Relations and digraphs, Properties of relations, Binary Relations, Equivalence

relations, Matrix representation of relations and digraphs, Computer representation of relations and

digraphs, Recurrence relations and Manipulation of relations.

UNIT III

Partially Ordered Sets (Posets), External elements of partially ordered sets. Lattices. Finite Boolean

algebra, Function on Boolean algebra’s, Boolean functions as Boolean polynomials. Groups and

applications: Monoids, semigroups, Product and quotients of algebraic structures, Isomorphism,

homomorphism, automorphism, Normal subgroups, Codes and group codes.

UNIT IV

Overview of Formal Languages: Representation of special languages and grammars, finite state

machines. Graph theory: Definition, paths, circuits, reachability, connectedness. Matrix

representation of graphs, trees, tree traversal, trees and sorting, spanning trees, minimal spanning

trees, Transitive closure, Warshall’s Algorithms, Eularian and Hamiltonian graphs, graph coloring,

Storage representations of graphs.

REFERENCES:

1. KOLMAN/REHMAN,“Discrete Mathematical Structures“, Pearson Education

2. LIU ,“Elements of Discrete Mathematics“, Tata McGraw Hill

3. SCHAUMS ,“Discrete Mathematics“, Tata McGraw Hill

4. NICODEMI ,“Discrete Mathematics“, CBS

5. KENNETH H. ROSEN ,“Discrete Mathematics and Its Applications”, The Random

House/Birkhauser Mathematics series


8


Course Title: Fundamentals of IT

UNIT I

Introduction to computers, characteristics of computers, generations and types of computers, block

diagram of computer system. Input and output devices, storage devices. Booting process. Hardware

and Software concept. Firmware.

UNIT II

Programming Language classifications: Machine language, assembly language and high level

language. Translators, compilers, interpreters and assemblers.

Operating system- features, functions and types of OS.

UNIT III

Data communication: Definition, criteria, process of communication, types of computer networks.

Concept of LAN, MAN and WAN. Transmission media: guided and unguided media. Internet

basics, internet protocols, browsers, WWW, email, Telnet, FTP, benefits of Internet and Limitations.

UNIT IV

Latest IT trends- Electronic E conferencing and Teleconferencing, E commerce, AI( Artificial

Intelligence), Geographic information system( GIS). Role of IT in different areas- Education,

industry, banking, marketing.

REFERENCES:

1. P. K. Sinha , “Computer Fundamentals, 2005”, BPB, New Delhi.

2. V. RajaRaman, ”Introduction to computers”, TMH


9

Course No: MIT-1E1-DCE

Course Title: Digital Electronics

UNIT I

Introduction- Digital Systems; Data representation and coding. Number Systems and Codes-

Positional number system; Binary, octal and hexadecimal number systems; Methods of base

conversions; Binary, octal and hexadecimal arithmetic; Representation of signed numbers; Fixed and

floating point numbers; Binary coded decimal codes; Gray codes; Error detection and correction

codes - parity check codes and Hamming code.

UNIT II

Combinatorial Logic- Definition and specification; Truth table; Basic logic operation and logic

gates. Boolean Algebra and Switching Functions- Basic postulates and fundamental theorems of

Boolean algebra; Standard representation of logic functions - SOP and POS forms; Simplification of

switching functions - K-map and Quine-McCluskey tabular methods; Synthesis of combinational

logic circuits.

UNIT III

Sequential Logic - Definition and Basic sequential circuits- latches and flip-flops: SR-latch, D-latch,

D flip-flop, JK flip-flop, T flip-flop; Timing hazards and races; timing specifications, asynchronous

and synchronous counters, counter design with state equations, Registers , serial in serial out shift

registers, tri-state register.

TEXTBOOKS:

1. Morris Mano, “Digital Design” PHI

2. “Digital Electronics”, Bignill& Donovan.

3. “Digital Integrated Circuit” A.K.Gautam-Katson Publication.

REFERENCES:

1. Taub and Schilling “Digital Integrated Electronics”,TMH

2. Bartee , Thomas C. / “Fundamentals of Digital Computers”/ Tata McGraw-Hill

3. Gopalan, K. “Gopal” / “Introduction To Digital Microelectronic Circuits” / Tata McGraw-Hill

4. Millman, Jocob&Taub, Herbert / “Pulse, Digital & Switching Waveforms” / Tata McGraw-Hill

5. Malvino, A.P. & Leach, Donald P. / “Digital Principles & Applications” / Tata McGraw-Hill

6. Tokheim, H. Roger L. /“Digital Electronics Principles & Application”/ Tata McGraw-Hill / 6th

Ed.


10


Course Title: Elements of Business Management

UNIT I

Evolution of Management thought- Classical, Behavioral and Management Science. Approaches;

Managerial Process, functions, skills and roles in an organization. Planning concepts, process and

parameters. Types of planning. The control process: concepts and significance, Importance of

organization, formal organization elements; organizational chart. Planning, recruitment and

selection; Sources of recruitment, selection criteria.

UNIT II

Motivation: meanings and approaches. Work motivation. The content theories of work motivation –

Maslow’s Need Hierarchy theory; Herzberg’s motivation theory; meaning of leadership, theories of

leadership- trait and situational theories. Management control and audits; accounting audit. The

management audit; purpose and scope.

UNIT III

Individual decision making and problem solving; Understanding and managing Group Processes

Interpersonal and Group dynamics. Concept: Leadership skills; Theories of Leadership; Trait theory;

Situation theory; Path- Goal leadership Model; Understanding and Managing Organizational

System; Organizational Design Structure.

REFERENCES:

1. George R. Terry and Stephan G. Franklin, “Principles of Management”.

2. Banerjee shyam, “principles and practices of management”.

3. Knootz, Harold and C.O. Dinell, “Management a system contingency analysis of managerial

functions”.


11


Course Title: E-Commerce

UNIT I

E-Commerce (Introduction and Definition), Goals of E-Commerce, Technical Components,

Functions, Advantages and Disadvantages, Applications

The Internet and WWW - Evolution of Internet, Domain Names and Internet Organization (.edu ,

.com , .mil .gov ,.net etc), Internet Service provider.

UNIT II

E commerce business models: key elements of business model, Business to Consumer(B2C) model,

B2B model, consumer to consumer model(C2C).Building E commerce- system development life

cycle, choosing software and hardware e commerce, site tools. Benefits of website, Registering a

Domain Name, Web promotion. Internet Security , Secure Transaction, Computer Crime (Types of

Crimes), Threats.

UNIT III

Electronic Data Interchange, Introduction, Concepts of EDI and Limitation, Application of EDI,

Disadvantages of EDI, EDI model, Electronic payment System, Introduction, Types, Strategies for

developing electronic commerce web sites, Net marketplaces- characteristics of net marketplaces,

types of net marketplaces, E distributors, E procurement, Exchanges. Online content providers-

digital copyrights and electronic publishing

REFERENCES:

1. e-Commerce Concepts , Models , Strategies by G.S.V Murthy

2. E-Commerce by Kamlesh K Bajaj and Debjani Nag

3. Electronic Commerce by Gary P. Schneider

4. E commerce: by Laudon


12


Course Title: Technical Communication

UNIT I

Technical Communication: Basics of Technical Communication, Barriers to Communication &

Technology in Communication. Communicating in the Workplace: Problem Solving in Workplace

Communication, Human factors in the communication failure. Guidelines for ethical

communication. Active Listening: Introduction, types of listening, traits of a good listener, Active

vs. Passive listening & implications of good listening.

UNIT II

Introduction to Effective Presentation strategies: defining purpose, analyzing audience and locale,

organizing contents, preparing outline, visual-aids, understanding nuances of delivery, kinesics,

proxemics, paralinguistics, chronemics. Interviews: introduction, objectives, types of interviews &

job interviews, guidelines for surviving a job interview. Group Communication: Introduction, Group

discussion, Organizational Group discussions & meeting conferences.

UNIT III

Paragraph Development: Central components of a paragraph, length of a paragraph and techniques

for paragraph development. The art of condensation, steps for effective précis writing, samples &

guidelines. Memo reports: Purpose of memo reports, elements of a usable memo, interpersonal

considerations in writing a memo, common types of memo report. Letters & Employment

correspondence: Application letters and business correspondence, How applicants are screened for

personal qualities, electronic job hunting.

REFERENCES:

1. Meenakshi Raman and Sangeeta Sharma, “Technical Communication”, Oxford University Press

2. William Pfeiffer, Padmaja,”Technical Communication A Practical Approach”, Pearson

Education.


13

Semester - II


14

Semester-II(24 Credit Semester)


category


L T P


MIT-2T1-C Data and File Structures Core 3 0 2 4

MIT-2T2-C Computer Graphics Core 3 0 2 4

MIT-2T3-C Software Engineering Core 4 0 0 4

MIT-2T4-C Computer Organization and Architecture Core 4 0 0 4


MIT-2E1-DCE Operational Research DCE 3 0 0 3

MIT-2E2-DCE Open Source Technologies DCE 3 0 0 3

MIT-2E3-DCE Information Systems DCE 3 0 0 3

MIT-2E4-DCE Green Technologies DCE 3 0 0 3



15

Course No.: MIT-2T1-C

Course Title: Data & File Structures

UNIT I

INTRODUCTION TO DATA STRUCTURE: Data Management concepts, Data types – primitive

and non-primitive, Performance Analysis and Measurement (Time and space analysis of algorithms-

Average, best and worst case analysis), Types of Data Structures- Linear & Non Linear Data

Structures.

UNIT II

LINEAR DATA STRUCTURE Array: Representation of arrays, Applications of arrays, sparse

matrix and its representation Stack: Stack-Definitions & Concepts, Operations On Stacks,

Applications of Stacks, Polish Expression, Reverse Polish Expression And Their Compilation,

Recursion, Tower of Hanoi Queue: Representation Of Queue, Operations On Queue, Circular

Queue, Priority Queue, Array representation of Priority Queue, Double Ended Queue, Applications

of Queue Linked List: Singly Linked List, Doubly Linked list, Circular linked list ,Linked

implementation of Stack, Linked implementation of Queue, Applications of linked list.

UNIT III

NONLINEAR DATA STRUCTURE : Tree-Definitions and Concepts, Representation of binary tree,

Binary tree traversal (Inorder, postorder, preorder), Threaded binary tree, Binary search trees,

Conversion of General Trees To Binary Trees, Applications Of Trees, AVL trees, 2-3 trees, Height

Balanced, Weight Balance, Graph-Matrix Representation Of Graphs, Elementary Graph

operations,(Breadth First Search, Depth First Search, Spanning Trees, Shortest path, Minimal

spanning tree )

UNIT IV

HASHING AND FILE STRUCTURES : Hashing: The symbol table, Hashing Functions, Collision

Resolution Techniques, File Structure: Concepts of fields, records and files, Sequential, Indexed and

Relative/Random File Organization, Indexing structure for index files, hashing for direct files,

Multi-Key file organization and access methods, Sorting – Bubble Sort, Selection Sort, Quick Sort,

Insertion Sort Merge Sort, Searching – Sequential Search and Binary Search

REFERENCES:

1. An Introduction to Data Structures with Applications. by Jean-Paul Tremblay & Paul G.

Sorenson Tata McGraw Hill.

2. Data Structures using C & C++ -By TenenbaunPrenctice-Hall International.

3. Fundamentals of Data Structures in C++-By SartajSahani.

4. Data Structures: A Pseudo-code approach with C -By Gilberg&Forouzan Publisher Thomson

Learning.


16


Course Title: Computer Graphics

UNIT I

Introduction to Computer Graphics. Applications of Computer Graphics. Graphic Display Devices_

Raster, Refresh, Random. Display Buffer, Concept of Double Buffering and Segmentation of

Display Buffer. Use of Lookup tables.

UNIT II

2-D Graphics. Cartesian and Homogeneous Coordinate Systems. Line drawing algorithms

(Bressenham’s and DDA). Circle and Ellipse Drawing Algorithms. 2-Dimensional Transformations.

Concepts of Window & Viewport, Window to Viewport Transformations. Filling, Boundary and

Flood fill algorithms.

UNIT III

Clipping, Line Clipping Algorithms (Cohen-Sutherland Algorithm), 3-D Graphics, Projections:

perspective and parallel projection transformations. 3-Dimensional Transformations. Hidden Surface

Removal Techniques, Z-Buffer Algorithm, Back Face Detection.

UNIT IV

Curves and Surfaces, Splines, Spline specification, Interpolated & Approximated Splines. Bezier

Splines, Bezier Curves, Cubic Bezier Curves, Bezier Surfaces. B-Splines curves and surfaces.

Fractals - Fractal Generation Procedure. Introduction to Illumination models and Surface rendering

methods.

TEXT BOOK:

1. Hearn and Baker “ Computer Graphics” 2nd Edition , Pearson Education.

REFERENCES:

1. W.M.Newman and Sproull. “Principles of interactive Computer Graphics” ,TMH

2. Steven Harrington.” Computer Graphics a Programming Approach” McGraw Hill.

3. Plastock and Kelley. “Schaums outline of theory and problems of computer Graphics”

4. David F Frogers and J Alan Adams. “Procedural Elements of Computer Graphics” McGraw

Hill

5. David F Rogers and J Alan Adams. “Mathematical Elements of Computer Graphics” McGraw

Hill

6. James. D. Foley, A Vandametal “Computer Graphics” Pearson.


17


Course Title: Software Engineering

UNIT I

Software Engineering: Definition & Evolution, its Role & Impact in Computer Science. Software

Process, Characteristics of a SW Process, CMMI, TSP & PSP, Software Product, Characteristics of a

Good Software Product, Software Process Models, Comparative Study & Applications. Basic

concepts of Agile Process.

Software Requirements Analysis (SRA): Requirements - Types, Steps Involved in SRA. SW

Requirements Specification (SRS): Need & Characteristics for an SRS, Components of an SRS,

Prototype for a Good SRS. Structured Analysis: DFD’S, Control Flow Diagrams, Data Dictionary,

State Transition Diagrams, and Entity - Relationship Diagrams. Case Study: Developing a Complete

SRS.

UNITII

Software Design: Concepts & Principles, Design Considerations & Good Design. Characterization

of Effective Modular Design (Functional Independence, Cohesion, Coupling). Design: Architectural

Design, Procedural Design, Interface Design, & Data Design. SW Architecture Styles: (Dataflow,

Call & Return Architectures, Independent Process Architectures, Virtual Machine Architectures).

Concept of Verification & Validation. Goals of SW Testing, Testing Principles.

UNIT III

Approaches to the Design of Test Cases: Black Box & White Box Testing, Techniques used by these

Approaches: Basis Path & Loop Testing, Graph Based Testing, Equivalence Partitioning,

Cyclomatic Complexity, Documentation of Test Cases, Phases in Testing Activity : Unit,

Integration, Validation & System Tests.

Software Project Management, Phases of Management, Project Planning & Control, Scheduling,

Organization & Team Structures, Project Estimation Techniques – KLOC, FP & COCOMO, Risk

Analysis & Management, Software Quality Assurance, Software Configuration Management.

UNIT IV

Technical Metrics for Software. Object Oriented Software Engineering: Object Oriented Paradigm,

Concepts - Classes & Objects, Inheritance, Abstraction & Polymorphism. Concept of OOA & OOD.

Design Methodology: Dynamic Modeling, Functional Modeling.

Advanced Concepts: Software Reuse, Re-engineering, Reverse Engineering, Restructuring,

Client/Server Software Engineering, Computer Aided Software Engineering, Advances & Future

Scope in Software Engineering.

REFERENCES:

1. .Pressman, Roger, “Software Engineering- A Practitioners Approach”, McGraw Hill

2. S.L. Pfleeger, “Software Engineering- Theory & Practice”, Pearson Education

3. Gheezi, Jazayeri Et Al, “Fundamentals Of Software Engineering”, PHI

4. Ian Sommerville, “Software Engineering”, Pearson Education

5. PankajJalote, “An Integrated Approach To Software Engineering”, Narosa

6. Hans Van Vliet, “Software Engineering- Principles & Practice”, Wiley


18


Course Title: Computer Organization and Architecture

UNIT I

Evolution & interpretation of the concept of Computer Architecture at different levels of abstraction.

The concept of Computer Architecture at Multilevel Hierarchical Framework. Register Organization.

Interconnection Structures, Bus Interconnections, Integer/Floating Point Arithmetic &

Representation, Instruction Cycle & Interrupts. Instruction Set Characteristics & Functions.

Addressing Modes & Formats.

UNIT II

Processor Organization: ALU, Design of Arithmetic Circuit, Design of Logic Circuit & Design of

ALU. Processor Unit: Design of Accumulator. Control Organization: Hardwired / Micro-

Programmed Control, Control Memory, Address Sequencing, Design of Control Unit & Micro-

Program Examples.

UNIT III

Memory Hierarchy, Main Memory: RAM/ROM Chips. Memory Address Map, Memory Connection

to CPU, Associative Memory, Hardware Organization – Match Logic, Read/Write Operation, Cache

Memory, Virtual Memory, Memory Management – Associated Hardware, I/O Organization.

Peripheral Devices: I/O Interfaces, Asynchronous Data Transfer, Modes of Transfer, Direct Memory

Access & I/O Processor.

UNIT IV

RISC Architectures – their characteristics & comparison to CISC, Introduction to Parallel

Processing, Basic Parallelization Techniques. Pipelining – Arithmetic & Instruction Pipelining,

RISC Pipeline, Vector & Array Processors. Multiprocessor System Architectures & their

Characteristics, Interconnection Structures, Inter-processor Arbitration, Inter-processor

Communication & Synchronization, Cache Coherence Issues. Introduction to Super Scalar

Processors

REFERENCES:

1. V.C. Hamacher, A.G. Vranesic& S.G. Zaky, “Computer Organization”, Tata McGraw Hill

2. J.P Hayes, “Computer Architecture & Organization”, Tata Mcgraw Hill

3. Morris Mano, “Computer System Architecture”, PHI.

4. W. Stallings, “computer organization and architecture”.

5. M. J. Flynn, “Computer Architecture”, Narosa

6. David A. Patterson, John L. Hannessey, ” Computer Organization”

7. GovaindaRajalu, “Computer Architecture & Design ” TMH


19

Course No.: MIT-2E1-DCE

Course Title: Operational Research

UNIT I

Linear Programming: L P formulation, Graphical methods for LPP with 2 variables, Simplex

Algorithm Duality theorem in linear programming and applications. Transportation problem:

Formulation, methods of selecting initial feasible solutions, Degeneracy and resolution. Assignment

problem: Balanced and Unbalanced problems and resolution.

UNIT II

Network Analysis: Shortest routes, Enumeration and applications. Max flow problem, Min Cut and

max-flow min-cut theorems. PERT & CPM: Use and design of PERT and CPM, critical path

calculation. Dynamic Programming: Characteristics of dynamic programming problem, Bellman’s

optimality principles, dynamic programming under certainty, shortest route problem.

UNIT III

Game theory: definition and explanation, saddle points, Dominance mixed strategies, games without

saddle points, 2*N games. Replacement and Sequencing models: Replacement of items that fail and

deteriorate. Group & individual replacement. Sequencing problems, Johnsons algorithm for

processing m jobs through 2 , 3 and n machines, Inventory models: introduction to inventory

problems and their analytical structure.

REFERENCES:

1. Hamdy A. Taha, “Operations Research: An Introduction”, Pearson

2. Sharma J. K., “Operations Research: Theory and Applications”, Macmillan India

3. Gross Donald, “Fundamentals of Queuing Theory”, 3rd Ed., John Wiley

4. Mokhtar S. Bazaraa, “Linear Programming and Network Flows”, John Wiley

5. Hiller Lieberman, “Introduction to Operations Research”, TMH

6. Laudon, “Decsion Support Systems”, PHI

7. Davis Olson, “Management Infromation Systems”, TMH

8. N.D.Vohra, “Quatitative Techniques in management”, TMH


20


Course Title: Open Source Technologies

UNIT 1

Overview of Open Source Software. Need of Open Sources –Advantages of Open sources –

Applications- Licensing, Certification , Comparison with close source / Proprietary software , Free

Software . Open source vs source available, Widely used open source software licenses : Apache

License, BSD license, GNU General Public License, GNU Lesser General Public License, MIT

License, Eclipse Public License.

UNIT 2

Open Source OS : Installation of Linux (Redhat-CentOS): Theory about Multiboot Environment,

Command Line: Basic File System Management Task, Understanding FHS of Linux. Overview of

other OS : Ubuntu and Ubuntu Server. Mobile OS : Android , overview and architecture.

Open Source Languages and Web Servers :Overview of PHP, Basic syntax and usage. Python

programming language basics, JQuery.

Open Source Web servers: Installation, configuration and administration of Apache, Nginx.

UNIT 3

Open Source Tools , IDE, RDBMS:

Eclipse IDE , OpenStack cloud technology, Version Control Systems , GIT , CVS.

Open Source Repositories : GitHub, SourceForge, Google Code.

Open Source RDBMS: MySQL basics, installation and usage.

PostgreSQL,NoSQL, MongoDB, Hadoop.

REFERENCES:

1. Understanding Open Source and Free Software Licensing - By Andrew M. St. Laurent,

2. Oreily Media.

3. Apache HTTP Server Documentation Version 2.2 by byApache Software Foundation

4. MySQL 5.5 Reference Manual (Chapter 2 and 3 of manual) (e-Resource)

5. The Complete Guide to Linux System Administration by Nicholas Wells, CengageLearning.


21


Course Title: Information Systems

UNIT I

Introduction to System Theory: Types of Systems; Concepts of Data, Information, Knowledge &

Intelligence; Attributes of Information. Information Systems: Basic Concepts & framework.

Evolution of Information Systems, Role of Information Systems, Dimensions & Categories of

Information Systems, Contemporary Approaches to Information Systems; Technical, Behavioral &

Socio-technical Understanding of Information .

UNIT II

Management Information Systems: Introduction, Concepts & framework. Fundamental Types of

Management Information Systems, Organization and Information systems, Managerial Decision

Making Process, Organizational Information systems. Information Processing: Storage and

Processing tools, Data & File Environment, Database Systems, Database management systems &

database services.

UNIT III

Decision Support Systems: Overview, Concepts, Characteristics, Capabilities, Components &

Classification. Relevance of Relational Database Management Systems in DSS, DSS design, tools,

construction and Generators. Design identification and building of DGMS.MBMS: Model types,

Dichotomous Model of mind and Simons Model. Introduction to Expert system and Executive

support system

REFERENCES:

1. Laudon, “Management Information Systems”, Pearson

2. Jawadekar, ”Management Infromation Systems”,

3. Kroenke, Management Information Systems”, Mc-Graw Hill.

4. Mudrick R.G., Ross, J.E. &Gleggt, J.R.”Information Systems for Modern Management”, PHI.

5. Jayashankar: Decision Support Systems, Mc-Graw Hill.

6. Stephen Haag and Maeve Cummings, “Information Systems Essentials”, McGraw-Hill

7. Ralph Stair, "Principles of Information Systems”, ISBN: 0619064897


22


Course Title: Green Technologies

UNIT I

Wind: basic concepts, sources and uses of wind, scientific principles of wind, Energy concept:

kinetic energy, electromagnetism, wind turbine technology, Electricity concept: production,

transmission, storage and uses of wind electricity, Hydroelectric and fuel cells: sources and uses,

production, transmission ,storage and uses of hydroelectric and fuel cell electricity, small

hydropower systems

UNIT II

Solar energy: basic concepts, sources and uses, energy concept: reflection, absorption and

concentration of solar energy, introduction to photovoltaics, types of photovoltaic systems, solar

cells and solar modules. Green management, nuclear energy

UNIT III

Biomass: concepts, sources and uses, biofuel, heat energy, production and transmission of biomass

electricity, Energy conversion, basics of ecology and environment, natural resources, global

environment issues and environment risk management, recycling. Concept of ecological footprints.

REFERENCES:

1. Foundation of Green IT: Marty Poniatowski

2. Powering the dream: the history and promise of green technology: Alexix Madrigal

3. Understanding photovoltaics: jay warmke

4. Green technology-Earth friendly innovations:Geetha Sobha


23

Semester - III


24

Semester-III(24 Credit Semester)


category


L T P


MIT-3T1-C Design and Analysis of Algorithms Core 3 0 2 4

MIT-3T2-C Java / Dot Net Core 3 0 2 4

MIT-3T3-C Data Communication and Computer

Networks

Core 4 0 0 4

MIT-3T4-C Operating System Core 4 0 0 4


MIT-3E1-DCE Programming Languages and Paradigms DCE 3 0 0 3

MIT-3E2-DCE Artificial Intelligence DCE 3 0 0 3

MIT-3E3-DCE Soft Computing DCE 3 0 0 3

MIT-3E4-DCE Parallel and Distributed Computing DCE 3 0 0 3



25


Course Title: Design and Analysis of Algorithms

UNIT I

Introduction to Algorithms, Analysis of algorithms, Designing Algorithms, Growth of Functions,

Asymptotic notations, Recurrences , Substitution method , Iteration method, Recursion trees , The

Master Method, Time and Space Complexity study of some basic algorithms.

UNIT II

Randomized Algorithms: Identifying the repeated element, Primality testing, Advantages and

Disadvantages.

Divide and Conquer, General method, Binary search, Quick sort.

Greedy Method, General method, Knapsack problem, Single source shortest paths.

UNIT III

Dynamic programming, General methods, All pair shortest paths, Traveling salesman problems.

Backtracking, General method, 8-Queen problem, Sum of subsets, Knapsack problem.

Branch and Bound, General method, Least Cost Branch and Bound, 8-Queen Problem,

UNIT IV

Lower boundary theory, Lower bound theory through reductions, P and NP problems. NP hard and

NP complete problems. Approximate Algorithms and their need, The vertex Cover Problem, The

traveling salesman problem, The subset sum problem.

TEXT BOOKS:

1. Pearson Horowitz, Sahni, “ Fundamentals of Computer Algorithms”, Galgotia Publications

2. Goodrich and Tamassia, “Algorithm design”.

REFERENCES:

1. Coremen, Leiserson, Rivest,Stein, “Introduction to Algorithms”, 2nd edition, PHI.

2. Aho, Hopcroft and Ullman, “The Design and Analysis of Computer Algorithms”, Pearson.


26


Course Title: Java / Dot Net

EL1: Dot Net

UNIT- I

An Overview of .NET Technology: Features of .NET, Understanding .NET Framework, Main

Components of .NET Framework, The Common Language Runtime, The Common Language

Specification, The Common Type System, .NET Class Libraries, Assemblies, Metadata and

Attributes. Introduction to Visual Studio.NET: Exploring Visual Studio.NET Interface.

UNIT -II

Overview of C#, Implementing OOP in C#, Console Application using C#, Basic Input and Output

Operations, Using Value-Type Variables, Common Type System, Built-In Data Types, User-

Defined Data Types, Converting Data Types, Operators in C#, Conditional Constructs, Using Loop

Construct, Break and Continue Statement. Working with Methods in C#, Encapsulating Data with

Properties, Static Members and Methods in C#. String Handling in C#. Polymorphism and

Inheritance in C#, Understanding Abstract Classes, Object class, Boxing and Unboxing Types,

Nested Classes, Sealed Classes, Interfaces, Function Overloading, Constructor Overloading,

Operator Overloading, Events and Delegates in C#, Exception Handling, Multithreading,

Collections. Window Applications using .NET, Event handling in C#, Attributes and Reflection in

C#, Custom Attributes in C#, Introduction to VC#.NET, Exploring VC#.NET IDE.

UNIT -III

Introducing Web Application, Components of Web Application, Building a Web Form, HTML

Server Controls. ASP.NET, Using Visual Web Developer, Designing a Simple Web Form. Including

C# Code in ASP.NET, Hosting the Web Page, IIS Web Server. Different Types of Application in

ASP.NET, Application Structure, Application Boundary, Class Files, Saving Data of Web Forms,

Using View State, Using Control State, Hidden Fields, Cookies, Query Strings, Application State,

Session State, Profile Properties, Event Handling in a Web, Delegates in a Web Application, Custom

Controls, Registering and Using the Custom Control. Data Bound Control, Implementing Late

Binding, Customizing Server Controls, Server Control Templates. Form Navigation: Using

Hyperlinks, Smart Tags, Postback Handling, Response.Redirect, Method, Server.Transfer Method

UNIT -IV

An Overview of ADO.NET, Design Goals of ADO.NET, ADO.NET Architecture, Objects Used in

ADO.NET Model, .NET Framework Data Providers, .NET Framework Data Provider for SQL

Server, Provider for Oracle, ADO.NET DataSet Object Model, Data Binding, Types of Data

Binding, Generating DataSet, Binding Controls to the DataSet, Executing SQL Commands, Creating

Parameterized Queries, Handling Errors Using ErrorProvider Class, Data Updation and Conflict

Management, Optimistic Concurrency Control, Pessimistic Concurrency Control‘Last in Wins’

Concurrency Control, Maintaining Data Concurrency, Resolving Concurrency Through Data

Adapter.

REFERENCES:

1. Evangelous Petroutsos,”Mastering Visual basic.Net”, BPB Publication

2. Steven Holzner, “Visual Basic .net Programming”, Black book, Dreamtech Press

3. “ASP .Net for beginner”,Wrox Publications

4. “ASP .Net : Unleashed” , SAMS Publications


27

EL2: JAVA

UNIT I

Introduction to J2EE:- J2EE Overview, J2EE Architecture, Components, Containers and

Connectors. J2EE API’s, J2EE Modules (Web App, EJB JAR, App Client) Structure of J2EE

Application (Enterprise Archive)Packaging and Deploying J2EE Applications

JDBC: Introduction to JDBC, types of JDBC drivers, Executing sql statements, prepared statements,

and callable statements. Row sets, JDBC transactions..

UNIT II

Servlets: Web Application Basics.Architecture and challenges of Web Applications.Introduction to

servlet,Servlet life cycle.Developing and Deploying Servlets. Exploring Deployment Descriptor

(web.xml). Handling Request and Response, Initializing a Servlet, Accessing Database, Servlet

Chaining, Session Tracking & Management, Dealing with cookies, Transferring Request, Accessing

Web Context, Passing INIT and CONTEXT Parameter, Sharing information using scope object,

Controlling concurrent access, User Authentication. Filtering Request and Response, Programming

Filter, Filter Mapping, Servlet Listeners.

UNIT III

Java Server Pages (JSP):- Basic JSP Architecture, Life Cycle of JSP (Translation, compilation),

JSP Tags and Expressions, JSP with Database, JSP Implicit Objects, Tag Libraries, JSP Expression

Language (EL), Using Custom Tag, JSP Capabilities: Exception Handling, Session Management,

Directives, JSP with Java Bean.

UNIT IV

Struts:- What is Struts? Struts Architecture, overview on MVC Design pattern. Struts framework

and MVC, Request handling in struts. Struts main components. Struts classes- ActionForward,

ActionForm,ActionServlet, Action classes.Understanding struts-config.xml, Understanding Action

Mappings, Struts flow with an example application, The view components (Struts tag labraries,

Message resource bundles).

Struts Tiles Framework.Struts Validation Framework, Internationalizing Struts Application

REFERENCES:

1. Herbert Schildt, “The Complete Reference Java-2 “ , Tata Mcgraw Hill.

2. Dietel&Dietel, “Java: How to Program Java 2, Pearson Education.

3. Horstmann& Cornell, “Java2 Vol-1 & Vol-2”,Pearson Education.

4. E. BalaGurudamy, “Programming with java A Primer”, TMH

5. ”Beginning java”, WROX

6. “Advanced Java”, WROX


28


Course Title: Data Communication and Computer Networks

UNIT I

Principles of Data Communication, Data Communication Model & Tasks, Concept of Bandwidth &

Channel Capacity, Nyquist’sLaw & Shannon’s Law for Quantification of Capacity, Data Rate

Versus Baud Rate, Sampling and its types, Nyquist Criterion for Sampling, Data Transmission

Concepts, Characteristics of Signals: Digital Signals, Analog Signals (Amplitude, Frequency,

Period, Wavelength, Signal to Noise Ratio).

UNIT II

Data Encoding: NRZ-L, NRZ-I Encoding, Multilevel Binary & Biphase Encoding Techniques &

their implementations. ASK, FSK, PSK & QPSK. PCM: Sampling & Quantization & Modulation,

Delta Modulation, Amplitude Modulation. Reliable Transmission of Data: Asynchronous &

Synchronous Transmission, Multiplexing: Concepts & Types (FDM, Synchronous & Statistical

TDM). Error Detection: Parity Based, CRC-Based, Checksum Based. Error Control & Recovery

Techniques, Concept of ARQ Standard & its Versions.

UNIT III

Goals & Applications of Computer Network. OSI model. TCP/IP protocol suite. LAN: Ethernet and

Token Ring. WAN: Concept, Characteristics, & Architecture: WAN subnet. Internetworking

Concept & Architectural Model, Connection Oriented & Connectionless Approaches, Packet

switching and Circuit switching. Concept of Autonomous Systems. Internet Layer Protocols: IP

(Addressing: Classful and classless IP Addressing, IP Multicasting, Routing, Fragmentation &

Reassembly).

UNIT IV

ICMP, ARP, RARP. Routing Protocols: Interior (OSPF), Exterior (BGP). Transport Layer Protocols:

TCP & UDP. Socket API for Network Programming: Concept of Port and Sockets. Basic Server

Architectures. TCP Server & Client. UDP Server & Client. Network Security: Principles of Security,

Firewalls & their Components, Encryption Techniques & examples of Encryption Standard (DES,

AES & RSA).

REFERENCES:

1. Computer Networks ,A.S. Tanenbaum, Pearson Education

2. Data Communications and Networking ,Forouzan, Tata McGraw Hill Company

3. Computer Network, S.S.Shinde, New Age International Publisher.

4. Data and Computer Communication , Shashi Banzal ,Firewall media

5. Data & Computer communication, William Stallings, Pearson


29


Course Title: Operating System

UNIT I

Overview of an Operating system, Resource Management, OS Interface, Process Management

Concepts, Interprocess Communication, Process Scheduling, Synchronization, Deadlocks.

UNIT II

Memory Management, Linking, Loading, Memory Allocation, Design Issues & Problems, Virtual

Memory, Fragmentation, Implementing Virtual Memory, Paging, Segmentation, Virtual Memory

Design Techniques, Buffering Techniques, Spooling.

UNIT III

File Management-File Systems & I/O Device Drivers, Disk Driver, Access Strategies, File Systems,

File System Organization, Design Techniques. Multiprocessor Systems. Types of Multiprocessor

Operating Systems, Functions & Requirements, Design & Implementation Issues.

UNIT IV

Case Studies: UNIX/LINUX/Windows NT OS, Users View, Design Principles, Implementation,

Process Management, Memory Management, File System, I/O System.

REFERENCES:

1. Dietel H.M. “An Introduction To Operating System”, Addison Wesley

2. Milenkovic M., “An Operating System – Concepts & Design”, McGraw Hill

3. Peterson, J.L. Abraham, Silberschatz, “Operating System Concepts”, Addison Wesley

4. Tanenbaum, A.S., “Modern Operating System”, PHI

5. Karnetkar, “UNIX Shell Programming”, BPB

6. W.Stallings, “Operating systems”

7. Dhamdhere, “An Operating System –Design and principles”

8. Mukesh Singhal &Viranjan G. Shivratri ,”Advanced concepts in Operating Systems”, TMH

9. Madnick E, Donovan J, “Operating Systems”, TMH


30

Course No.: MIT-3EL1-DCE

Course Title: Programming Languages and Paradigms

UNIT I

The role of Programming Languages: Towards Higher Level Languages programming paradigms,

Language implementation. Language Description: Syntactic Structures, Expression Notations,

Abstract Syntax trees, Lexical Syntax. Data Representation: The role of types, basic types, arrays,

unions and variant records, Sets, Pointers, Two String tables, types and error checking. Procedure

Activations: Introduction to Procedures, parameter passing methods, nested scope in source text,

activation records, lexical scope: procedures as in C.

UNIT II

Object oriented Programming: class declarations in C++, dynamic allocation in C++, Information

hiding. Functional Programming : Language of expressions , types, values and operations ,

approaches to expression evaluation, lexical scope, type checking, Function declaration by cases ,

Functions as first-class values, Implicit types, data types exception handling. Introduction to Prolog,

data structures in Prolog, Programming techniques, controls in Prolog, Cuts

UNIT III

An introduction to concurrent Programming: Parallelism in hardware, Streams: implicit

synchronization, concurrency as interleaving, Liveliness properties, safe accesses to shared data

concurrency in ADA. Language Description: Semantic Methods, Synthesized attributes, Attribute

grammars, natural semantics, Denotational Semantics.

REFERENCES:

1. Ravi Sethi,“ Programming Languages ,Concepts and Constructs”, Pearson Education

2. Freidman, Wand , Haynes, ”Essentials of Programming Languages”, PHI.


31


Course Title: Artificial Intelligence

UNIT I

Introduction, intelligent agents: Agents and Environments, the concept of rationality, the nature of

environments, structure of agents, problem solving agents, and problem formulation.

UNIT II

Searching for solutions, uniformed search strategies. Search with partial information (Heuristic

search) Greedy best first search, A* search, Memory bounded heuristic search, Heuristic functions.

Local search Algorithms: Hill climbing, simulated, annealing search, local beam search, genetical

algorithms. Planning: Classical planning problem, Expressiveness and extension.

UNIT III

Game Playing: Adversial search, Games, minimax, algorithm, optimal decisions in multiplayer

games, Alpha-Beta pruning, Evaluation functions, cutting of Search. Knowledge representation

Reasoning and Agents: knowledge – Based Agents, the Wumpus world, logic. First order logic.

Inference in first order logic, propositional vs. first order inference, unification & lifts forward

chaining, Backward chaining, Resolution.

REFRENCES:

1. Introduction to Artificial Intelligence – Rajendra Akerkar, PHI.

2. Artificial Intelligence – A Modern Approach. Second Edition, Stuart Russel, Peter Norvig,

PHI/Pearson Education.

3. Artificial Intelligence, 3rd Edition, Patrick Henry Winston., Pearson Edition

4. Artificial Intelligence and Expert Systems – Patterson PHI

5. Expert Systems: Principles and Programming- Fourth Edn, Giarrantana/ Riley, Thomson


32


Course Title: Soft Computing

UNIT I

Soft Computing and AI: Introduction and applications of soft computing, soft computing vs. hard

computing,. Artificial Intelligence: introduction and application, Intelligent Agents, Structure of

Intelligent Agents ,.

UNIT II

Neural Networks and Fuzzy Logic:

Neural networks: Characteristics, artificial neural net terminology, Model of a neuron, Topology,

Learning, types of learning Fuzzy set theory, Fuzzy set versus crisp set, Crisp relation & fuzzy

relations, Fuzzy systems: crisp logic, fuzzy logic, introduction & features of membership functions.

UNIT III

Genetic algorithm : Fundamentals, basic concepts, working principle, encoding, fitness function,

reproduction, Genetic modeling: Inheritance operator, cross over, inversion & deletion, mutation

operator, Bitwise operator, Generational Cycle, Convergence of GA

REFERENCES:

1. Artificial Intelligence-A Modern Approach” – by Stuart Russell, Peter Norvig, , Pearson

Education

2. Neural Networks, Fuzzy Logic & Genetic Algorithms, Synthesis & applications, S,

Rajasekaran & G.A. Vijayalakshmi Pai, PHI Publication.

3. Introduction to artificial neural systems - by J.M. Zurada.(Jaico Pub)

4. Artificial Intelligence, Rich E and Knight K, TMH, New Delhi.

5. Neural Network fundamental with Graph , Algo.&Appl, by Bose, TMH

6. Neural Network & Fuzzy System, by Kosko PHI Publication

7. Neural Networks & Fuzzy Logic - by Bart Kosko

8. Neural computing theory & practice - by P.D. wasserman (ANZA PUB).

9. Principles of Soft Computing, S.N. Sivanandam & S.N. Deepa, Wiley Publications


33


Course Title: Parallel and Distributed Computing

UNIT I

Characterization of Distributed System, Design Issues & User Requirements. Inter-process

Communication-Synchronous & Asynchronous, Client – Server Communication, Group

Communication, Remote Procedure Call- Design Issues & Implementation.

UNIT II

Distributed OS- Design Issues - File Service Design Issues. Name Service, Time & Coordination-

Physical & Logical Clocks, Distributed Co-Ordination.

Replication- Issues & Implementation Shared Data & Transactions- Distributed Transactions,

Concurrency Control, Recovery & Fault Tolerance, Security- Design Issues & Case Studies.

UNIT IV

Parallel Model, languages and Compilers: Parallel programming model, parallel languages and

compilers, dependence analysis of data arrays, code optimization and scheduling, loop

parallelization and pipelining.

Parallel program development and environment: parallel programming environments,

synchronization and multiprocessing models, shared variable program structure, message-passing

program development, mapping programs onto multicomputer.

REFERENCES:

1. Coulouri,“Distributed Systems”

2. Tanenbaum,“Distributed Operating System”.

3. Raynal,“Distributed Algorithms”.

4. Kai Hwang,“Advanced computer architecture,Parallelism,Scalability,Programming”, TMH

5. V. RajaRaman,” Elements of Parallel Computing”


34

DEPARTMENT OF COMPUTER SCIENCE ISLAMIC UNIVERSITY OF SCIENCE & TECHNLOGY

Scheme of Examination(CBCS 2015)

M.Sc. IT:

Semester I – Semester III

Subject Max. Marks Total Marks Core I 100

400 Core II 100

Core III 100

Core IV 100

Disciplinary Centric Elective I 75 150

Disciplinary Centric Elective II 75

Open Elective 50 50

GRAND TOTAL 600

Documents

MCA Syllabus –P.G. Dept. of Computer Science, …. (IT)_1_4_9_2015.pdfMIT-2T3-C Software Engineering Core 4 ... Department of Computer Science, IUST 2 Semester-IV ... guided and