Eleceng m.tech. Cse Semester I-IV Two Years

8/9/2019 Eleceng m.tech. Cse Semester I-IV Two Years

http://slidepdf.com/reader/full/eleceng-mtech-cse-semester-i-iv-two-years 1/25

FACULTY OF ENGINEERING & TECHNOLOGY

SYLLABUS

FOR

MASTER OF TECHNOLOGY

(COMPUTER SC. & ENGG.)

(Semester : I-IV)(Two Years)

EXAMINATIONS : 2010-11

________________________________________________________________________________

GURU NANAK DEV UNIVERSITY

AMRITSAR ________________________________________________________________________________

Note : Copy rights are reserved.

Nobody is allowed to print it in any form.

Defaulters will be prosecuted.

Price Rs. 60-00



M.Tech. (Computer Science) Semester System (2 Years)

2

List of Electives:

Elective – I Elective-II

Sr

No.

Option: Subject Sr. No. Option: Subject

1 (i) Advanced Software Engineering 1. (vi) Artificial Neural Networks

2 (ii) Network Programming 2. (vii) Digital Image Processing

3 (iii) Internet Technologies 3. (viii) Advanced Operating System

4 (iv) Wireless Networks 4. (ix) Software Project Management

5 (v) Network Security



M.Tech. (Computer Science) Semester System (2 Years)

3

Eligibility :

The minimum qualifications for admission to the First year of this programme shall be open to a

person who possesses any of the following qualifications:

B.Tech. /B.E. or equivalent in any branch of Engineering /Technology with atleast 60% marks in aggregate;

OR

MCA / M.Sc. (Computer Science)/ M.Sc. (IT) or equivalent with atleast 60% marks in aggregate.



M.Tech. (Computer Science) Semester-I (2 Years)

4

MCS-101

Theory of Computer Science

Marks

External Internal Term Paper Total

Time: 3 Hrs.

100 30 20 150

Note :

• Four questions from each section will be set. The examinee will attempt five questions in

all by selecting at least 2 questions from each section. All questions will carry equal

marks.

• Use of only Non-programmable & Non-storage type calculator allowed.

Section – A

Finite State Systems: DFA, NFA, ∈-NFA, 2-way finite automata; interconversion of automatas,

minimization of automata, regular expressions, Arden’s theorem, pumping lemma and itsapplications, closure properties of regular sets.

Context Free Languages: Context free grammars & languages, simplifications of context free

grammars, Chomsky & Greibach normal forms, pumping lemma & its applications, closure

properties of CFL’s, decision algorithms for CLF’s; pushdown automata, equivalence of PDA &

CFG.

Section – B

Phase Structure Languages: Turing machines, extended and restricted turing machines,

Church’s thesis, linear bounded automata, undecidability, recursive and recursively innumerable

languages, Rics’s theorem, PCP problem; simulating turing machine on computers and vice

versa.

Intractable Problems: P and NP classes, NP – complete problems; Satisfiability problem.

Computational complexities.

References:

1. [HRU] Hopcroft J.E., Motwani R. and Ullman J.D.: Introduction to Automata Theory, Languages and Computation, Second Edition, Addison-Wesley, 2001.

2. [PET] Peter L.: An Introduction to Formal Languages and Automata, Second Edition,

Narosa, 1998.

3. [HU] Hopcroft J.E. Ullman J.D.: Introduction to Automata Theory, Languages, and Computation, Narosa, 1979

4.

[MC] Mishra K.L.P. and Chandrasekaran: Theory of Computer Science, Second Edition,PHI, 1999.

5. [LP] Lewis H.R. and Papadimitriou C.R.: Elements of the Theory of Computation,

Prentice-Hall, 1981.6. [KO] Kohavi Z.: Switching and finit Automata Theory, Second Edition, Tata McGraw-

Hill, 1995.




6

MCS- 103

Data Base Management System

Marks


Time: 3 Hrs.

100 30 20 150

Note:



marks.


Section A

Basic Concepts: An overview of Database Management (Database, Database system, why

database, Data independence) An architecture, for a database system (levels of the architecture,

mappings, DBA’s Role) Introduction to Relational db systemsThe Relational Model: Relational Data objects, Domains and relations, Relational Data

Integrity, Relational Algebra, Relational Calculus and SQL language.

Section B

Database Design & Tuning: Concepts of functional dependencies, multivalued dependencies,

1NF, 2NF, 3NF, BCNF, Higher Normal Forms, An overview of the E/R Model, E/R diagrams,

Database design with the E/R model, An overview of Database Tunning in Relational Systems.

System Implementation Techniques: Recovery, Concurrency, Security & Authorization,

Integrity Advanced Database Concepts: Introduction to Object and Distributed Databases,Client Server Architecture, Data Warehousing and Data Mining.

Reference Books

1. C.J. Date: An Introduction of Database System”, The Systems Programming Series, 6/Ed,

Addison-Wesley Publishing Company, Inc., 1995.

2. Silberschatz, korth & Sudarshan, “ Database System Concepts”, Third Ed., McGraw Hill

International Editions, Computer Science Series-1997.

3. Desai, Bipin C, “ An Introduction to Database Systems”, West Publishing Company, St.

Paul, Minnesota, USA-1993.

4. Fred R. McFadden, Jeffery A. Hoffer, Mary B. Prescott, “Modern DatabaseManagement ” 5th Edition.




7

MCS: 104

Programming Concepts

Marks


Time: 3 Hrs.

100 30 20 150

Note:



marks.


Section A

Object-Oriented Concepts: Evolution of OOP, Advantages of OOP, Comparison between

Functional and OOP approach, Features of OOP Classes, User defined data types.

Programming in C++: Introduction to C++, Operators, type conversion, Control Structure,

Arrays, Defining a function, types of function, storage classes, recursion, preprocessor, header

files and standard function, structure and union, Classes, Data hiding, member function,

objects, array of class objects, nested classes, constructor and destructor, in line member

function, friend function, static class member.

Inheritance and its types, virtual function, Function overloading, operator overloading,

polymorphism, pointers file handling.

Section B

Data Structures implementations in C++: Stacks and Queues, Linked Lists, Graphs & Trees.

Web Programming: Internet basics, Markup languages classification, Creating static pages,

I/O through databases, creating dynamic images and documents.*

*Implementation through any of the scripting language(s).

References:

1. Deitel & Deitel, C++ How to program, ISBN: 9780130384744, ( Pearson Education),

2003.

2. Robert Lafore, Object Oriented Programming in C++, ISBN: 157169160X,

(Galgotia), 3rd Edition, 1998.

3. Mark Allen Weiss, Data Structure and algorithm Analysis in C++, ISBN:

9780201361223, (Pearson Education), 1998.




8

MCSP-105

Programming Lab-I

Marks


Time: 3 Hrs.

70 30 - 100

Programming exercises based on the subjects covered in first semester.



M.Tech. (Computer Science) Semester-II (2 Years)

9

MCS-201

Computer System Architecture & Organization

Marks


Time: 3 Hrs.

100 30 20 150

Note:



marks.


Section - A

Introduction to Computers: Basic Computer Organization: System Buses, Instruction Cycles

CPU Organization: Design specifications for a Simple CPU, Fetching Instructions from

Memory, Decoding Instructions, Executing Instructions, Design of a Simple ALU, Designing theControl Unit Using Hardwired Control and Microprogrammed control approach.

Memory Subsystem Organization and Interfacing, Types of Memories

I/O Subsystem Organization and Interfacing

Parallelism in Uniprocessor Systems: Trends in parallel processing, Basic Uniprocessor

Architecture, Parallel Processing Mechanism.

Parallel Computer Structures: Pipeline Computers, Array Computers, Multiprocessor Systems

Architectural Classification Schemes: Multiplicity of Instruction-Data Streams, Serial versus

Parallel Processing, Parallelism versus Pipelining

Section-B

Pipelining : An overlapped Parallelism, Principles of Linear Pipelining, Classification of Pipeline

Processors, General Pipelines and Reservation Tables Principles of Designing Pipelined Processors: Instruction Prefetch and Branch Handling, Data

Buffering and Busing Structures, Internal Forwarding and Register Tagging, Hazard Detection

and Resolution

Superscalar and Superpipeline Design: Superscalar Pipeline Design, Superpipelined Design

Structures and Algorithms for Array Processors: SIMD Array Processors, SIMD Computer

Organizations, Masking and Data Routing Mechanisms, Inter-PE Communications

SIMD Interconnection Networks: Static versus Dynamic Networks, Mesh-Connected Illiac

Network, Cube Interconnection Networks

System Interconnect Architectures: Network Properties and Routing, Static Connection

Networks, Dynamic Connection Networks

Multiprocessor Architecture: Functional Structures: Loosely Coupled Multiprocessors, Tightly

Coupled Multiprocessors

Interconnection Networks: Time Shared for Common Buses, Crossbar Switch and Multiport

Memories.

References

1. Computer Architecture and Parallel Processing , Faye A. Briggs, McGraw-Hill

International Editions

2. Computer Systems Organization & Architecture, John d. Carpinelli, Addison Wesley




10

MCS-202

Algorithm Analysis & Design

Marks


Time: 3 Hrs.

100 30 20 150

Note:



marks.


SECTION-A

Algorithm concepts: Algorithm analysis, design of efficient algorithms, complexity analysis,

asymptotic notation.

Design Strategies: Divide-and-conquer, Dynamic Programming, Greedy Method, Back-tracking,Branch-and-bound.

Data Structures: Lists, queues, graphs and trees, hash tables, binary search trees, btrees, heaps.

Sorting & Searching: Simple sorting, algorithms, Radix sorting, heap sort, quick sort, linear and

binary search algorithms.

SECTION-B

Algorithms on Graphs: Minimum cost spanning tree. Depth/Breadth First search. Path finding

problems.

Advanced Algorithms: Matrix operations, FFT, string processing, simple parallel &

approximation algorithms.

Complexity Theory: Complexity hierarchy, simple NP hard problems, NP completeness.

References1. Cormen T.H., Leiserson C.E., Rivest R.L., Introduction to Algorithms, PHI, 2000

2. Horowitz E., Sahni S., Rajasekaran S., Computer Algorithms, Galgotia Publications,

1999.

3. Aho A.V., Hopcroft J.E. Ullman J.D., The Design and Analysis of Computer Algorithms,

Pearson Education Asia, 1998, 1974

4. Knuth D.E., The Art of Computer Programming Volume 1 (Fundamental Algorithms), Narosa Publishing House, 1973

5. Knuth D.E., The Art of Computer Programming Volume 3 (Sorting and Searching),Addison-Wesley, 1973.




11

MCS-203

Computer Networks

Marks


Time: 3 Hrs.

100 30 20 150

Note:



marks.


SECTION-A

Introduction: Data Communication, Network Components, Protocol & Standards, Standard

Organization, Topologies, Transmission modes, Categories of Networks.The OSI Model: Layered architecture, Functions of layers, TCP/IP reference model, Comparison

of OSI & TCP/IP models

Signals and Transmissions: Digital data transmission, Transmission media-Guided & unguided

media, Performance of media, Switching, multiplexing, ISDN services, ATM transmission.

SECTION-B

Data Link Layer: Framing techniques, Flow control, Error Control, data link protocols, MAC

protocols and IEEE standards.

Network & Transport layer design Issues: Routing algorithms, Congestion control algorithms,

Internetworking, Services and elements of Transport protocols.

Network Security, Privacy & Services: Data representation, Data compression techniques and

cryptography, File transfer access & management, E-mail & Remote login services.

References

1. B.A. Forouzan, Data Communication & Networking .2. A.S. Tanenbaum, Computer Networks, Prentice Hall, 1992, 3rd edition.

3. William Stallings, Data & Computer Communication, McMillan Publishing Co.

4. Black, Data Networks, PHI, 1988.

5. Fred Halsall, Data Communications, Computer Networks, Pearson Education.




12

MCSP-205: Programming Lab -II

Marks


Time: 3 Hrs.

70 30 - 100

Programming exercises based on the subjects covered in second semester.




(Elective)

13

Option i: Advanced Software Engineering

Marks


Time: 3 Hrs.

100 30 20 150

Note:



marks.


Section – A

Software Project Management: Fundamentals of Software project planning, Conventional

Software Management, Evolution of Software Economics, Improvement of Software Economics,Comparison of old and modern ways of Software Management.

Software Re-engineering: Introduction Re-engineering, Restructuring and Reverse Engineering,

Re-engineering existing systems, Data Re-engineering and migration, Software Reuse and Re-

engineering.

Section-B

Object-Oriented (OO) Measurements: Introduction, Why metrics?, Classification of OO

metrics, Study of Design Metrics- method size, method internals, class size, class inheritance,

Method inheritance, class intervals and class externals.

Object-Oriented Analysis and Design: What is Object-Oriented Design? Objects, Abstraction,

Collaboration among Objects, Polymorphisms, Classes, specifying State, Specifying Behavior,

Class Relationships, Grouping, Hiding.

Software Agents: Definition, Applications, Types and Classes, Multi-Agent systems,

Characteristics & Properties Agents.

References:

1. Walker Royce , Software project management , Pearson Education, ISBN:

9780201309584, 2004.

2. Robert S. Arnold , Software Re-engineering , IEEE Comp. Society, ISBN:

9780818632723, 2003.3. Lorenz and Kidd , Object Oriented Software Metrics, Prentice Hall, ISBN 978-

0131792920, 2001. 4. Booch, Object-Oriented Analysis and Design with Applications, Addison-Wesley

Professional, 3rd Edition, ISBN: 978-0201895513 , 2007.




(Elective)

14

Option ii: Network Programming

Marks


Time: 3 Hrs.

100 30 20 150

Note:



marks.


Section – A

Introduction : TCP/IP Architecture, TCP/IP addressing, services, FTP, SMTP, TFTP,

SNMP, Network file system, domain name system, transport layer protocols, user

datagram protocol, transmission control protocol.Interprocess communications : File and record locking, pipes, FIFO’s, stream and

messages, message quues, samphorers.

Section – B

Sockets: Sockets system cells, reserved parts, stream pipes, socket option, asynchronous I/O,

Sockets and signals Transport Lay Interface : Elementary TLI functions, stream and stream pipes,

asynchronous I/O I/O multiplexing

Remote Procedure calls : Remote login, remote command execution, external data

representation.

Reference:

1. A. Stevens, “TCP/IP Illustrated”, Vol. 1-3, Pearson Education, 2004

2. R. Stevens, “Unix Network Programming”, PHI 2002.

3. D.E. Comer, “Internetworking with TCP/IP, Vol. 1, Vol. 2, Vol. 3 Principles, Protocols,

and architecture, PHI, 2000




(Elective)

15

Option iii: Internet Technologies

Marks


Time: 3 Hrs.

100 30 20 150

Note:



marks.


Section – A

Computer networks and the internet: Principles of application-layer protocols , HTTP, FTP,

e-mail, DNS, socket programming with TCP/UDP, web servers, web pages design using HTML

and XML.Multimedia networking: Applications: streaming stored audio and video, internet telephony,

RTP, scheduling and policing mechanisms, integrated services, RSVP, differentiated services:

network management, the internet network management framework

Section – B

Network security: E-mail security, privacy, SMIME, IP security: overview, architecture,

authentication, header and payload, combining security associations, key management. web security: SSL and transport layer security, SET . systems security : intruders and viruses,

firewalls: design, trusted systems.

Mobile internet - mobile network layer, mobile IP, dynamic host configuration protocol, ad hoc

networks, mobile transport layer, implications of TCP on mobility, indirect TCP, snooping TCP,

mobile TCP, transmission, selective retransmission, transaction-oriented TCP, support for mobility, file systems, WAP protocols, WML , WML script, wireless telephony applications.

References:

1. Kurose J.F. & Ross K.W., Computer Networking: A Top-Down Approach Featuring the Internet , Addison Wesley, Modules I & II, 2006.

2. Stallings W., Cryptography and Network Security Principles and practice, Pearson

Education Asia, Module III, 2005.

3. Schiller J., Mobile Communications, Addison Wesley, Module IV, 2005.

4. Deitel H.M., Deitel P.J. & Nieto T.R., Internet And World Wide Web: How to Program,

Pearson Education, 2005

5. Greenlaw R & Hepp E, In-line / On-line: Fundamentals Of The Internet And The World Wide Web, Tata McGraw Hill, 2004.

6.

Sharma V. & Sharma R, Developing e-Commerce Sites: An Integrated Approach,Addison Wesley, 1999.

7. Singhal et. al S., The Wireless Application Protocol , Pearson Education Asia, 2000

8. Goncalves M., Firewalls: A Complete Guide, Tata McGraw Hill, 2001




(Elective)

16

Option iv : Wireless Networks

Marks


Time: 3 Hrs.

100 30 20 150

Note:



marks.


Section – A

Introduction to Wireless Systems: History, Overview of Wireless Networks, Types & Range of

Wireless Communication, Wireless Network Standards, Security Issues of Wireless Technology.

Wireless Communication Technology: Antennas & Propagation, Signal Encoding Techniques,

Spread Spectrum Coding and Error Control.

Wireless Networking: Satellite Communications, Cellular Wireless Networks, Cordless Systems

and Wireless Local Loop, Mobile Communications, Mobile IP and Wireless Access Protocol.

Section – B

Wireless LANs: Introduction, Benefits, WLANs Configurations and Standards, Security, IEEE

802.11, Wireless LAN Standard, Blue tooth.

WAP: History of WAP, Architecture, and Components

Cellular Technology: Design and Principles pf Cellular Operation, Cellular Telephony

Operations, GSM

Adhoc & Sensor Networks: Introduction, Protocols, and Applications.

Books Recommended:

Wireless Communications & Networks by Stallings (2005) Pearson Education.

Wireless Communication, Principles of Practice by Rappaport, Prentice Hall, 2

nd

Edition.

Introduction to Wireless Technology by Rogers (2003), Pearson Education.

Data Over Wireless Networks: Blue tooth, WAP and Wireless LANs by Held (2001), Tata

McGraw Hill (Osborne reprint)




(Elective)

17

M.Tech (CSE) – 2nd Semester

Option v: Network Security

Marks External Internal Term Paper Total

Time: 3 Hrs.

100 30 20 150

Note:



marks.


Section – A

Introduction: Attacks, services, mechanisms, security attacks, security services, Model for

network security, Internet standards.

Conventional encryption and message confidentiality: Conventional encryption principles,

conventional encryption algorithms, cipher block modes of operations, location of encryption

devices, key distribution.

Public Key cryptography and authentication: Approaches to message authentication, Secure

Hash Functions and HMAC, Public Key Cryptography, Principles Public Key Cryptography

Algorithms, Digital signatures, Key management.

Section – B

Authentication & E mail Security: Kerberos, X.509 Directory Authentication Services-PGP-

S/MIME.

IP Security: IP security overview, IP Security Architecture, Authentication Header,Encapsulating Security Pay load, Combing Security Associations, Key Management.

Web Security: Web Security Requirements, SSL and Transport Layer Security, SETNetwork

Management Security.

System Security: Intruders, viruses related threats, Fire Design principles, Trusted Systems.

References:

1. William Stallings, Network Security Essentials Applications and Standards, Pearson

Education Asia, New Delhi, 2006

2. Kaufman, Network Security: Private Communication in a Public World , Pearson

Education Asia, New Delhi, 2005.

3. William Stallings, Cryptography and Network Security, Pearson Education Asia, New

Delhi, 2005.



M.Tech. (Computer Science) Semester-III (2 Years)

18

M.Tech (CSE) – 3rd Semester

MCS-301: Parallel Computing

Marks

External Internal Term Total

Time: 3 Hrs.

100 30 20 150

Note:



marks.


Section – A

Paradigms of Parallel Computing: Synchronous – Vector/Array, SIMD, SystolicAsynchronous – MIMD, reduction Paradigm, Hardware taxanomy: Flynn’s classification,

Handler’s classification, Software taxanomy: Kung’s taxanomy, SPMD.

Abstract Parallel Computational Models: Combinational circuits, Sorting Network, PRAM

Models, Interconnection RAMs.

Parallelism approaches – Data parallelism, control parallelism.

Performance Metrics: Laws governing performance measurements: Amdahl’s law, Austafson’s

law, Sun-Ni law, Metrics such as Speedup, efficiency, isoefficiency, utilization, sizeup,

communication overheads etc., Benchmarks.

Section-B

Scheduling and Parallelization: Load Scheduling, Types of scheduling algorithm, LoadBalancing, Loop Scheduling, Parallelization of sequential programs.

Overview of Parallel Programming Development & Support Environments: Shared memory

programming, distributed memory programming, object oriented programming, data-parallel

programming, functional and data flow programming.

References:

1. Michael J. Quinn, Parallel Computing: Theory and Practice, Tata McGraw-Hill, 4th

Edition, ISBN: 9780070512948, 2004.

2. C. Xavier and S.S.Iyenger, Introduction to Parallel Algorithms, Wiley-Interscience

Publication, ISBN: 9780471251828, 1998.

3. Wilkinision: Parallel Programming , Prentice Hall, ISBN: 9780131405639, 2004.




19


Option vi: Artificial Neural Networks

Marks


Time: 3 Hrs.

100 30 20 150

Note:



marks.


Section – A

Neural Network Technology: Evolution of ANN, Architecture of ANN, Knowledge

representation.

Neural Network Learning: Basic learning rules, supervised & unsupervised learning, LMS

Algorithm.

Single Layer Perceptrons-I: Preceptron Model, Preceptron learning algorithms: Simple learning

algorithm, pocket algorithm without and with Ratches, Linear Machines, Kessler’s construction,

Linear Machines Learning algorithm, Representing Boolean functions.

Section-B

Single Layer Perceptrons-II: Anderson’s BSB Model, Hopfield’s Model, K-Means Clustering,

Topology-Preserving Maps, ART1 and ART2.

Multilayer Perceptrons: Back-Propagation, Applications of Back-propagation: NETtalk,

Handwritten Character Recognition, Pattern Recognition.

References:

1. [SG] Gallant S.L., Neural Networks Learning & Expert Systems, MIT Press, ISBN:

9780262071451, 1993.

2. [SH] Haykin S., Neural Networks: A comprehensive Foundation, Prentice Hall, 3rd

Edition, ISBN: 9780131471399, 2007.

3. [FS] Freeman J.A., Skapura D.M., Neural Network Algorithms, Applications and Programming Techniques , Pearson Education, ISBN: 9780201513769, 2003.




20


Option vii: Digital Image Processing

Marks

External Internal Term Tota

Time: 3 Hrs.

100 30 20 150

Note:



marks.


Section – A

Introduction and Digital Image Fundamentals : The origins of Digital Image Processing,

Fundamentals Steps in Image Processing, Elements of Digital Image Processing Systems, Image

Sampling and Quantization, Some basic relationships like Neighbours, Connectivity, Distance

Measures between pixels, Linear and Non Linear Operations.

Image Enhancement: Point Operations, Histograms, Spatial Domain methods, Frequency

domain methods, Enhancement by point processing, Spatial filtering, low pass filtering, High

pass filtering, Homomorphic filtering, Colour Image Processing.

Image Restoration Degradation Model, Algebraic approach to Restoration, Inverse Filtering,

Wiener Filter, Constrained least square restoration, Interactive restoration, Restoration in spatial

domain.

Section – B

Image Compression: Coding, Interpixel and Psychovisual Redundancy, Image Compression

Models, Elements of Information Theory, Error free comparison Lossy Compression, Image

Compression Standards.

Image Segmentation: Detection of Discontinuities, Edge Linking and Boundary Detection,

Thresholding, Region Oriented Segmentation, Motion based segmentation.

Representation and Description: Representation, Boundary Descriptors, Regional Descriptors,

Use of Principal Components for Description, Introduction to Morphology, Some basic

Morphological Algorithms.

Object Recoginition: Patterns and Pattern Classes, Decision – Theoretic Methods, Structural

Methods.

References:1. Rafael C. Conzalez & Richard E. Woods, “Digital Image Processing”, 2nd Edition.

2. A.K. Jain, “Fundamental of Digital Image Processing”, PHI




21


Option viii: Advanced Operating System

Marks

External Internal Term Tota

Time: 3 Hrs.

100 30 20 150

Note:



marks.


Section – A

Attributes of Distributed Operating System : Performance and Scalability, Connectivity and

Security, Reliability and Fault Tolerance, Transparency, Network Operating Systems, Distributed

Operating Systems.

Communication in Distributed Systems : Remote Procedure Call (RPC), Remote Method

Invocation (RMI), CORBA (Common Object Request Broker Architecture), DCOM (Distributed

Component Object Model, Process Migration in Distributed Systems.

Synchronization in Distributed Systems : Mutual Exclusion in Distributed Systems : Mutual

Exclusion without Shared Memory, Agrawala and Ricart’s Distributed Mutual Exclusion

Algorithm.

Deadlock in Distributed Systems : Distributed Deadlock, Deadlock Prevention, Deadlock

Detection, A Distributed Resource Deadlock Algorithm.

Section – B

Distrubuted Systems and Web Services : Distributed File System Concepts, Network File

System (NFS).

Multicompouter Systems, Clustering, Distributed Computing, Grid Computing.

Security in Operating System : Cryptography, Access Control, Security Attacks and Security

Solutions, Key Agreement Protocols, Secure Communication Protocols, Steganography, Open

Source Security.

References :

1. Gary Nutt : Operating System, Modern Perspective, Addison Wesley.2. A.S.Tanenbaum : Modern Operating Systems, Prentice Hall.

3. M. Milenkovic : Operating Systems, McGraw Hill.

4. Deitel and Choffnes : Operating Systems, 3rd Edition, Pearson Education.

5. Brian L. Stuart : Operating Systems Principles, Design and Applications, Cengage

Learning.




22


Option ix: Software Project Management

Marks


Time: 3 Hrs.

100 30 20 150

Note:



marks.


Section – A

Planning Fundamentals: Major issues in software project planning, Planning activities Project,

master schedule, Software risk management, Risk monitoring, Risk analysis

Software cost: Major issues in estimating software cost, Cost estimation methods, Experience

based model, Parameter based model, COCOMO, Versions of COCOMO, Software size

estimation, Function points, Software project schedule, Rayleigh model.

Section – B

Functional organization: Project organization, Matrix organization, Staffing, Quality

replacements, Turnover management.

Directing a software engineering project: Issues, activities, Conflict management.

Issues in controlling a software project: Controlling activities, Threads of control, Work

breakdown structures, Earned value tracking

References:

1. Richard Thayer, Software Engineering Project Management , Tata Mc Graw Hill, 2004.

2. Donald J. Reifer, Software Management , Pearson Education, 2003.




23

MCSD-303

Dissertation (Part-I)

Marks

Internal Total

300 300

The purpose of the dissertation is:

1. To extend the students' knowledge considerably in their chosen topic.

2. To develop the skills required for originality and creativity of thinking in

Information Technology.

3. To contribute to the existing body of knowledge of Information Technology.

The dissertation will normally contain:

1. A clear indication, at appropriate stages, of original and creative elements. The level of

originality expected is likely to include the application of existing techniques to newenvironments, the use of original materials, the re-working of existing materials, and the

use of comparative approaches to the provision of information technology;

2. A discussion of its scope and aims, and its theoretical and professional significance,

including a discussion of the context in which the problem is seen as important;

3. An analysis of the topic within a critical review of the relevant literature;

4. An evaluation of methods used in the dissertation, their reliability, validity, and a

comparison with alternative methods;

5. An account of the process of obtaining the data required for the dissertation and the

results obtained;

6. An analysis of the results of the dissertation to include a discussion of their significance,

their relationship to other research, and any methodological or theoretical implications;

and7. The relationship of the findings to existing professional understanding and, where

appropriate, potential implementation difficulties.

It is not intended to restrict students to a precisely defined format for the dissertation but it should

follow the standard practices of dissertation writing. Although a written report will normally be

expected, it should be accompanied by soft copy on CD.



M.Tech. (Computer Science) Semester-IV (2 Years)

24

M.Tech. (CSE) –4th Semester

MCSD-401

Dissertation (Part-II)

Marks

External Internal Total

300 200 500

In continuation from 3rd Semester

Eleceng m.tech. Cse Semester I-IV Two Years

Documents

Transcript of Eleceng m.tech. Cse Semester I-IV Two Years