M.tech (Computer Science & Engineering) Session 2011-12

7/31/2019 M.tech (Computer Science & Engineering) Session 2011-12

1/13


2/13

M . D . U

N I V E R S I T Y

, R O H T A K

( H A R Y A N A )

S C H E M E O F S T U D I E S & E X A M I N A T I O N F O R M A S T E R O F T E C H N O L O G Y C O U R S E

I N

S E M E S T E R - I

C O M P U T E R S C I E N C E & E N G I N E E R I N G - 2

0 1 1 - 1 2

C o u r s e

N o .

C o u r s e T

i t l e

T e a c h

i n g

S c h e d u l e

M a r

k

C r e

d i t s D u r a t

i o n

L

T

P

S e s s

i o n a

l

E x a m

T o t a l

o f E x a m

M T C E - 6

0 1 A C o m p u

t e r s y s t e m s o

f t w a r e

4

-

-

5 0

1 0 0

1 5 0

4

3

M T C E - 6 0 3 A M a t

h e m a t

i c a l

f o u n

d a t i o n o f

C o m p u

t e r

4

-

-

5 0

1 0 0

1 5 0

4

3

S c i e n c e

M T C E - 6 0 5 A A n a

l y s i s a n

d D e s

i g n o f

A l g o r

i t h m s

4

-

-

5 0

1 0 0

1 5 0

4

3

M T C E - 6 0 7 A E l e c

t i v e

I

4

-

-

5 0

1 0 0

1 5 0

4

3

M T C E - 6 0 9 A

O O P S l a b .

-

-

4

5 0

5 0

1 0 0

4

3

M T C E - 6 1 1 A I n t e r n e t

l a b

-

-

4

5 0

5 0

1 0 0

2

3

M T C E - 6 1 3 A S e m

i n a r

-

-

2

5 0

-

5 0

1

-

T o t a l

1 6

-

1 0

3 5 0

5 0 0

8 5 0

2 1

-

E L E C T I V E - 1

M T C E 6 0 7 ( A ) I n t e r n e t

& W e b

T e c h n o l o g y

M T C E 6 0 7 ( B ) E m b e d d e d

S y s t e m s

N o t e :

1 .

T h e p a p e r s e

t t e r s h a l

l s e t e a c h

t h e o r y p a p e r o f

1 0 0 m a r

k s c o v e r i n g

t h e e n

t i r e s y

l l a b u s a n

d t h e s a m e w

i l l b e e v a l u a t e d o n m a r

k s .

2 .

T h e

S e s s

i o n a

b l e o f

T h e o r y

/ P r a c t i c a l

C o u r s e s s h a l

l a l s o b e e v a l u a

t e d o n

t h e

b a s i s o f m a r

k s .

3 .

T h e c h o i c e o f s t u d e n

t s f o r a n y e l e c

t i v e s h a l

l n o t

b e b i n d

i n g o n

t h e

D e p

t t . t o o f

f e r

i t .

M . D . U

N I V E R S I T Y

, R O H T A K

( H A R Y A N A )

S C H E M E O F S T U D I E S & E X A M I N A T I O N F O R M A S T E R O F T E C H N O L O G Y C O U R S E

I N

S E M E S T E R - I

I

C O M P U T E R S C I E N C E & E N G I N E E R I N G

C o u r s e

N o .

C o u r s e T

i t l e

T e a c h

i n g

S c h e d u

l

M a r

k s

C r e

d i t s D u r a t

i o n

L

T

P

S e s s

i o n a

l

E x a m

T o t a l

o f E x a m

M T C E - 6 0 2 A S o f t C o m p u

t i n g

4

-

-

5 0

1 0 0

1 5 0

4

3

M T C E - 6 0 4 A R e s o u r c e

M a n a g e m e n

t i n C o m . S

y t .

4

-

-

5 0

1 0 0

1 5 0

4

3

M T C E - 6 0 6 A M o b

i l e s

& W i r e l e s s

C o m m u n

i c a t

i o n

4

-

-

5 0

1 0 0

1 5 0

4

3

M T C E - 6

0 8 A E l e c

t i v e

I I

4

-

4

5 0

1 0 0

1 5 0

4

3

M T C E - 6

1 0 A O p e r a

t i n g

S y s t e m

L a b .

-

-

4

5 0

5 0

1 0 0

2

3

M T C E - 6 1 2 A S o f t C o m p u

t i n g

L a b .

-

-

2

5 0

5 0

1 0 0

2

3

M T C E - 6 1 4 A S e m

i n a r

-

-

2

5 0

-

5 0

1

-

T o t a l

1 6

-

1 0

3 5 0

5 0 0

8 5 0

2 1

-

E L E C T I V E - 1

I

M T C E 6 0 8 ( A ) S o f t w a r e

V e r i f

i c a t

i o n

V a l i d a t

i o n

& T e s t

i n g

M T C E 6 0 8 ( B ) A d v a n c e

d M i c r o p r o c e s s o r s

N o t e :

1 .

T h e p a p e r s e

t t e r s h a l

l s e t e a c h

t h e o r y p a p e r o f

1 0 0 m a r

k s c o v e r i n g

t h e e n

t i r e s y

l l a b u s a n

d t h e s a m e w

i l l b e e v a l u a t e d o n m a r

k s .

2 .

T h e

S e s s

i o n a

b l e o f

T h e o r y

/ P r a c t i c a l

C o u r s e s s h a l

l a l s o b e e v a l u a

t e d o n

t h e

b a s i s o f m a r

k s .

3 .

T h e c h o i c e o f s t u d e n

t s f o r a n y e l e c

t i v e s h a l

l n o t

b e b i n d

i n g o n

t h e

D e p

t t . t o o f

f e r i

t .

Maharshi Dayanand University, Rohtak 1 2 Syllabus M.Tech. (Computer Science & Engineering)


3/13


4/13

1st SemesterMTCE 601A

COMPUTER SYSTEM SOFTWARETheory Marks : 100 L T PSessional : 50 4 0 0

------Total 150Time : 3 hrs. Credits : 4

Introduct ion to Object Oriented Programming and Object OrientedDesign.

Concepts of classes, objects, abstraction, encapsulation, inheritance,function overloading, virtual functions, function overiding, templates.

Object modeling : Class and object diagrams, association, aggregation,generalization, dynamic modeling and functional modeling.

Introduction to UML : Class diagrams, Use cases, interaction diagrams,collaboration diagrams, deployment diagrams.

Principles of class design : Open close principle, Liskov's substitutionprinciple, dependency inversion principle, package cohesion principleetc.

System Software design issue. Design of assemblers, macroprocessors, linkers and loaders, dynamic linking.

References

1. Object Oriented Programming with C++ By Robert Lafore

2. Object Oriented Modeling and Design By James Rumbagh

3. System Programming By Dhamdhere

4. System Programming By Donovan

5. Object Oriented Analysis & Design By Grady Booch


M.D. UNIVERSITY, ROHTAK (HARYANA)Scheme of Grading System (I to IV Semesters)Master of Technology Degree Course(M.Tech)

The grade awarded to a student in any particular course will be basedon his/her performance in class work, attendance, seasonal tests,tutorial tests, home assignments, laboratory work, viva-voceexamination, main examination, etc.

The letter grades that can be awarded & their equivalent grade pointare listed below :


5/13

MTCE 603AMATHEMATICAL FOUNDATIONS OF COMPUTER

SCIENCETheory Marks : 100 L T PSessional : 50 4 0 0


Regular Grammar and Finite automata,NDFA and DFA, NDFA toDFA conversion, Pumping Lemma to checking the regularity of regulargrammars, Reduction of states and design of equivalent finite automata,Context Free Grammar, possible defects in CFG and their removal,Chomsky and Greibach Normal Form. Push down automata, designof CFG corresponding to PDA and vice versa, Design of parser usingPDA, Linear bound automata.Turing machines as language recognizer, computer for positive integers,enumerator, universal Turing machine, halting problem, multi-tape andmulti-head turing machine, Post Machine, solvability and undecidability,Rice's theorem, equivalence of general recursive and Turing computablefunction, primitive recursive function, post correspondence problem.Introduction to complexity theory, space and time complexity of turingmachine.References

1. Introduction to automata theory, language & computation-

Hopcroaft & O.D. Ullman, R Mothwani, 2001, AW

2. Introduction to formal Languages & Automata-Peter Linz, 2001,Narosa Publ.

3. Fundamentals of the Theory of Computation-Principles andPractice by Ramond Greenlaw and H.James Hoover, 1998,Harcourt India Pvt. Ltd.

4. Elements of theory of computation by H.R. Lewis & Ch.Papaditriou, 1998, PHI.

5. Introduction to languages and the Theory of Computation by JohnC. Martin 2003, T.M.H.

MTCE 605AANALYSIS & DESIGN OF ALGORITHMS

Theory Marks : 100 L T PSessional : 50 4 0 0


Unit 1 : Analyzing Algorithms & ProblemsIntroduction to algorithms, Time and Space Complexity, Basicelements of data structures like linked, stacks and queues, trees,graphs, recursion. Different types of sorting algorithms and theircomplexities.Unit 2 : Dynamic Sets, Searching and GraphsIntroduction, Array, amortized time analysis, red black trees, hashing,heaps, dynamic equivalence relations and union-find programs, priorityqueues with decrease key operations, traversing graphs, DFS, stronglyconnected components, biconnected componenets, minimum spanningtree , single source shortest paths, all pair shortest paths.Unit 3 : Greedy and Dynamic MethodsIntroduction to greedy and dynamic methods, their algorithms, andcomparative study.Unit 4 : Backtracking and Branch-and-boundGeneral backtracking and Branch and Bound Methods, 8 queen, sumof subset, graph coloring, Hamilton cycles,0/1 knapsack problem.Unit 5 : NP-Hard and NP Complete problems

Basic Concepts, cooks theorem, NP-Hard graph problems, NP hardSchedulingUnit 6 : Parallel AlgorithmsIntroduction, parallelism, PRAM and other models, some simplePRAM algorithms, handling write conflicts, Merging and Sorting,finding Connected Components.Unit 7 : Approximation AlgorithmsIntroduction, Absolute Approximation, e-approximation, polynomialtime approximation schemes, fully polynomial time approximation

schemes, String matching algorithms.



6/13

References :

Fundamentals of Computer Algorithms Sartaj Sahni, Ellis Horowitz

Design and Analysis of Algorithms AV Aho, E Hoproft,JD Ullman

Fundamental Algorithms (The Art of DE Knuth

Computer Programming Vol. I)A Discipline of Programming ED DijkstraWriting Efficient Programs Jon DL Bently

MTCE 607A (A)INTERNET & WEB TECHNOLOGY



Unit 1 : IntroductionInternet Protocol model, Internet Addresses, IP routing concepts, TableDriven and next hop routing, other routing related protocols, InternetAccess through PPP, SLIP, WWW, Web servers, Browsers.Unit 2 : Router TechnologyHubs, Bridges, Routers, Routing Protools, Routing Security, switchbased routing, routing in unicast enviroment, multicasting, mobilerouting.Unit 3 : Web Server TechnologyWeb's Robot global access to information, HTML, HTTP, Accessinga web server, publishing on web server, secure HTTP, Secure SocketsLayer, WWW Proxies, IIS, Case study of apache web server.Unit 4 : Browsing SystemsSearching and web casting Technique, popular web servers, basicfeatures bookmarks, cookies, progress indicators, customization of browsers, browsing tricks, next generation web browsing, searchengines, architecture of search engines, search tools, web crawlers,types of crawlers, scalable web crawler, incremental crawler, parallelcrawler, focused crawler, agent based crawler, case study of IE.

Unit 5 : Web site DevelopmentHTML, XHTML, DHTML, XML, Structuring data, namespaces,XML schema Documents, Document Object Model, DOM methods,Simple API for XML, XSL, SOAP, ASP. Net.Security and management issues for creating a web site.

Reference Books :1. Fundamentals of the Internet and the World Wide Web, RaymondGreenlaw and Ellen Hepp-2001, TMH.

2. Internet & World Wide Programming, Deitel, Deitel & Nieto, 2000Pearson Education.

3. Beginning XHTML by Frank Boumpery, Cassandra Greer, DaveRagett, Jenny Raggett, Subastian Schnitenbaumer & ted Wugofski,2000, WROX press (Indian shroff Publ. SPD) Ist edition.

4. Complete reference guide to java script, Aron Weiss, QUIE, 19975. Intranet & Internet Engg. By Minoli6. Internet & Web Technology By Rajkamal.

MTCE 607A (B)EMBEDDED SYSTEMS



Real time operating system overview, Exposure to Windows CE,QNX, Micro kernels Introduction to process models. Interrupt routinesin an RTOs environment, encapsulation semaphores and queues, hardreal-time scheduling considerations, saving memory space.

16 & 32 bit microprocessors and micro controller and DSP hardwarewith reference to Embedded system.

Embedded software development tools and compilers-host: and targetmachines linkers/locators for embedded software, cross compilers,cross assembles and tool chairs, GCC compiler, basic concepts of

device drivers, serial communication interface device driver. System

Maharshi Dayanand University, Rohtak 9 10 Syllabus M.Tech. (ComputerScience & Engineering)


7/13

synthesis of Harware/Software co-emulation, simulation, speed of emulators. JTAGOCD.

Communication protocols with special reference to embeddedsystem.TCP/IP,UDP wireless protocols, IRDA, Blue tooth IEEE8.2.11.

References :1. An embedded system primer by devid E Simon Addison Wesley,

1999.2. Programming for Embedded system by Dreamtch software team.3. Embedded System design by Rajkamal (TMH)4. Embedded Real Time System Programming by lyer Gupta (TMH)

MTCE 611AOOPS lab

L T P4 0 0

Credits : 2

Practicals based on theory paper Computer System Software

MTCE 613AInternet lab

L T P4 0 0

Credits : 2

Practicals based on theory paper Elective I

2nd SemesterMTCE 602A

SOFT COMPUTINGTheory Marks : 100 L T PSessional : 50 4 0 0


Neural Networks : History, overview of biological Neuro-system,Mathematical Models of Neurons, ANN architecture, Learning rules,Learning Paradigms-Supervised, Unsupervised and reinforcementLearning ANN training algorithms-perceptrons, Training rules, Delta,Back Propagation Algorithm, Multilayer Perceptron Model, HopfieldNetworks, Associative Memories, Applications of Artificial NeuralNetworks.

Fuzzy Logic : Introduction to fuzzy Logic, Classical and Fuzzy Sets,Overview of Classical Sets, Membership Function, Fuzzy rulegeneration.

Operations on Fuzzy Sets : Compliment, Intersection, Union,Combination of Operations, Aggregation Operation.

Fuzzy Arithmetic : Fuzzy Numbers, Linguistic Variables, ArithmeticOperations on Intervals & Numbers, Lattice of Fuzzy Numbers, FuzzyEquations.

Classical Logic, Multi-valued Logics, Fuzzy Propositions, Fuzzy

Qualifiers, Linguistic Hedges.Uncertainty based information : Information & Uncertainty,

Nonspecificity of Fuzzy & Crisp Sets, Fuzziness of Fuzzy Sets.

References :

1. Neural Networks Simon Haykin

2. Neural Networks Kosko

3. Fuzzy Logic & Fuzzy Sets Klir & Yuan

4. Neutral networks Satish Kumar



8/13

MTCE 604ARESOURCE MANAGEMENT OF COMPUTER SYSTEMS


------Total 150

Time : 3 hrs. Credits : 4Historical perspectives, concurrent process; mutual exclusion andsynchronization, system calls and protection; context switching andthe notion of a process and threads; synchronization and protectionissues, scheduling memory management including virtual memory andpaging techniques;I/0 architecture and device management, procesdeadlocks-models of deadlock resources; graph reduction method,deadlock detection, prevention and avoidance.Distributed opera ting : Architecture, design issues, Lamport's logicclocks, vector clocks, causal ordering of messages, distributed mutualexclusion, token and non token based algorithms. Distributed file systemMechanism for building DFS, design issues of DFS, case studies,Protection and security, access matrix model, implementation of accessmatrix model usir the capabilities, access control list, lock & keymethods. Advance model Advance models : Take grant method, BellLa Padula method.Case studies. Laboratory experiments on internals of Linux, WindowsNT.References :1. Design of the Unix operating system Maurice Bach2. Distributed Operating System Tanenbaum3. Principles of Operating System William Stallings

MTCE 606AMOBILE AND WIRELESS COMMUNICATION



Uni t 1 : IntroductionApplication, history, market, reference model and overview.

Wireless Transmission-Frequencies, signals, antennae, signal

propagation, multiplexing, modulation, spread spectrum, cellularsystem.

MAC and Telecommunication System :

Specialized MAC, SDMA, FDMA, TDMA-fixed TDM, classicalALOHA, Slotted, ALOHA, CSMA, DAMA, PKMA,

reservationTDMA. Collision avoidance, polling inhibit sense multipleaccess. CDMA, comparison, CSM-mobile services, architecture radiointerface, protocol, localization, calling handover, security, new dataservices, Introduction to W'LL.

Satellite and Broadcast Systems :

History, Applications, GEO, LEO, MEO, routing, localization,handover in satellite system. Digital audio and video broadcasting.

Wireless LAN :

IEEE 802 11-System and protocol architecture, physical lyer.MAC

layered management. Bluetooth-User scenarios, physical lyer, MAClayer, networking, security and link management.

Mobile network Layer :

Mobile IP-goals, assumption, requirement, entities, terminology, IPpacket delivery.

Agent advertisement and discovery, registration, tunneling,encapsulation, optimization, reverse tunneling, IPv6.

DHCP. Adhoc Networks -routing, destination sequence distancevector, dynamic source routing, hierarchical algorithm, algorithm,alternative metric.Mobile Transport Layer :

Traditional TCP, Indirect 'TCP, Snooping ;TCP, Mobile TCP fastretransmission, Transaction oriented TCP.

Support for Mobility :

File, System, WWW-HIT,HTML, system architecture.WAP-architecture, wireless datagram, protocol, wireless transport layersecurity, wireless transaction protocol, application environment,telephony application.



9/13

References :

1. Jochen Schiller,"Mobile Communication", Pearson Education,2002.

2. Lee,"Mobile Cellular Telecommunications" McGRAW-Hill, 2ndEdition.

3. Wireless Communications : Theodore S Rappaport; Pearsons

Elective II MTCE 608A(A)SOFTWARE VERIFICATION, VALIDATION AND TESTING



Unit 1 : IntroductionDefinition of testing, goals, psychology, model for testing, effectivetesting, limitations of testing.Unit 2 : Testing terminology and MethodologyDefs of Failure, faults or bug, error, incident, test case, test ware, lifecycle of bug, bug effects, bug classification, test case design, testingmethodology, development of test strategy, verification, validation,testing life cycle model, testing techniques, testing principles.Unit 3 : Verification and validationVerification activities, verification of requirements, verification of HLdesign, verification of data design, verification of architectural design,verification of UI design, verification of LL design, intro to validationactivities.Unit 4 : Black Box testingBoundary value analysis, equivalence class partitroning, state tablebased testing, decision table based, graph based testing, error guessing.Unit 5 : White Box testingLogic coverage criteria, basic path testing, graph matrices, loop testing,data flow testing, mutation testing.

Unit 6 : Static testingTypes of static testing, technical reviews, inspections, inspectionprocess, structured walk through, walk through process, adv. of statictesting.Unit 7 : Validation Testing

Unit testing, drivers stubs, integration testing, methods, effect of modulecoupling and cohesion, functional testing, sytem testing, recoverytesting, security testing, stress testing, performance testing, usabilitytesting.Unit 8 : Test Automation and debuggingS/w measurement and testing, testing metrics, tools, debugging designof practical test cases, reducing no of test cases, regression testingand test case mgmt.Reference :

1. Software Engg. By Pressman2. Software Engg. By Dr. K.K. Aggarwal & Yogesh Singh3. Software Engg. By Jawadekar4. Software Engg. By Sheeman

MTCE 608A(B)ADVANCED MICROPROCESSORS



Architecture of 8086/8088-Digital Computers, Microprocessors,8086/8088, Architecture, Memory Organization, Addressing Modes,Assembly directives, Symbols, Variables and constants, Data Definitionand storage allocation directives, structure, records, Assigning Namesto Expressions, Segment Definition, alignment directives, ValueReturning Attribute-operators.The 8086/8088-Instructions-Instruction formats, instruction execution

Timing,, assembler, instruction format, Data transfer Instruction,

Maharshi Dayanand University, Rohtak 15 16 Syllabus M.Tech.(Computer Science & Engineering)


10/13

Arithmetic Instruction, Branch Instruction, and conditional andunconditional, loop instructions, NOP and HLT instructions. Flagmanipulation instructions, logical instructions, Shift and RotateInstructions, String Instructions. Assembly Language Programming .Advanced Processors-Introduction, Intel 80286, Intel 80386, Intel80486, Intel Pentium and Intel Pentium Proprocessor-Internal Block Diagram Only.

I/O Programming-Fundamentals, I/O Considerations, ProgrammedI/O, Block, Transfer & DMA. Interrupt I/O Design Example.

Basic 8086/88 Minimum Mode, maximum mode interrupt prioritymanagement based on single and multiple 8259, I/O interfaces,Asynchronous, Synchronous, data transfer 8231A ProgrammableCommunications interface, 8255 A Programmable Peripheral Interface.

Micro Processor Application-Data Acquisition system, TemperatureMonitoring,Speed Control etc.

References :1. Microprocessors and interfacing : D.V.Hall; TMH2. The 8088 & 8086 Microprocessors-Programming, interfacing,

Hardare & Application : Triebel & Singh; PHI3. Microcomputer systems; the 8086/8088 Family : Architecture,

Programming & Design : Yu-Chang Liu & GlennA Gibson; PHI.4. Microprocessors By Berry

5. Advanced Microprocessors and Interfacing : Badri Ram; TMH

MTCE 610AOperating System Lab

L T P0 0 4

Credits : 2

Practicals based on theory paper Resource Management in Computer

Systems.

MTCE 612ASoft Computing Lab

L T P0 0 4

Credits : 2

Practicals based on theory Soft Computing

3rd SemesterMTCE 701A

KNOWLEDGE BASED SYSTEM DESIGNTheory Marks : 100 L T PSessional : 50 4 0 0


Introduction ot Logic, Propositional Logic concepts, SemanticTebleaux and Resolution in Propositional logic, FOPL, SemanticTebleaux and Resolution in FOPL, Logic Programming in Prolog.

Knowledge representation, semantic nets, partitioned nets, parallelimplementation of semantic nets. Frames, Common Sense reasoningand thematic role frames, Architecture of knowledge based system,rule based systems, forward and backward chaining, Frame basedsystems.

Search techniques. Uninformed Search, DFS, BFS, Iterative deepening

Heuristic Search, A*, Hill Climbing etc.Uncertainty management in Expert Systems, Fuzzy Logic, ProbabilisticMethods, Bayesian Theory, Dempster Shafer Theory, Bayes Network,introduction to agents and their application to intelligent systems.

References :

1. Artificial Intelligence Nilsl J Nilson2. Artificial Intelligence Elain Rich and Kevin knight3. Artificial Intelligence- Staurt Russel and Peter norvig

A modern approach

4. Artifical intelligence Patrick Henry Winston

Maharshi Dayanand University, Rohtak 17 18 Syllabus M.Tech.(Computer Science & Engineering)


11/13

MTCE 703AADVANCED DBMS



Introduction : Architecture. Advantages, Disadvantages, Data models,relational algebra, SQL, Normal forms.Query Processing : General strategies for query processing,transformations, expected size, statistics in estimation, queryimprovement, query 'evaluation, view processing, query processor.Recovery : Reliability, transactions, recovery in centralized DBMS,reflecting updates, Buffer management, logging schemes, disasterrecovery.Concurrency : Introduction, serializability, concurrency control,locking schemes, timestamp based ordering, optimistic scheduling,multiversion techniques, deadlocks.Object Oriented Data base Development : Introduction, Objectdefinition language, creating object instances, Object query language.Distributed Databases : Basic concepts, options for distributing adatabase, distributed DBMS.Data warehousing : Introduction, basic concepts, data warehousearchitecture, data characteristics, reconciled data lyer, datatransformation, derived data layer, user interface.

Object Relational Databases : Basic concepts, enhanced SQL,advantages of object relational approach.References :1. An Introduction to database systems by Bipin C. Desai, Galgotia

Publications.2. Modern Database Management by Feffray A. Lioffer, Mary

B. Prescotl, Fred R Mcfadden, 6th edition, Pearson Education.3. Principles of distributed database systems, by M.Tamer &

Valduriez, 2nd edition, LPE Pearson education.4. Database system concepts by Korth.

MTCE 705ASYSTEM AND NETWORK ADMINISTRATION

L T P4 0 0

Credits : 4

Unit 1 : N/w AdministrationIntroduction to networks, TCP/IP model, IP addressing, SubnettingNAT, VLAN. Basic Concepts of proxy server, webserver,DNS,Firewall, Router, Mail Server and their respective configurationsettings. Various Interconnecting Devices; Hub, Switch, Bridges,Routers, Gateway, repeater, brouter. Knowledge about variousnetwork related commands : ping, netstat, tracert, traceroute, ifconfg,ipconfig etc. Steps folowed in establishing a network.Unit 2 : SecurityConcept of Security, its need, issues, cryptography techniques :ciphers,substitution cipher, transposition, symmetric key algorithms like AES,DES, public key algo's like RSA, Authentication algorithms IPSEC,VAN, Digital Signatures, IDS, Firewall. Types of attacks, accesscontrol list, filtering rules.Unit 3 : Host AdministrationIntroduction to system Administration, what are the necessary issuesto be tackled in host management, installation of unix, linux, windowsOS, formatting file systems like FAT, NTFS, etc., Booting process invarious OS, User accounts, group accounts, passwords, shadowpasswords, directory structure of analysis of host machine and howto improve the systems performance.Unit 4 : Knowledge of UNIX commands, administration basedcommands, Shell scripting, AWK, Perl.References :1. The unix programming Brain Kemighen & Rob Pike

environment2. Design of the Unix Maurice Bach

operating system3. Advanced Unix programmer's Stephen Prato

Guide4. Unix Concepts and Sumitabha Das :

applications-Featuring

5. SCO Unix and Linux,



12/13

MTCE 707 A (A)SOFTWARE PROJECT MANAGEMENT



Project Life Cycle Models : What is a Project Life Cycle Model. AFramework for studying different life cycle models. The waterfallmodel, The prototyping model, The rapid Application Development(RAD) model, The spiral model and its variants. Process ModelsCharacteristics of a process, what constitutes and effective processwhy are the processes important, Process models, Commonmisconceptions about processes.Metrics : The metrics roadmap, A typical metrics strategy, what shouldyou measure, Set targets and track them, Understanding and trying tominimize variability, Act on data, People and organizational isses inmetrics programs, Common pitfalls to watch out for in Metricprograms, Metrics Implementation checklist and tools.Software Configuration Management : The processes and activitiesof software Configuration management, configuration status accountingConfiguration Audit, Software configuration management ingeographically distributed teams, Metrics in software configurationmanagement, Software configuration management tools andautomation.

Software Quality' Assurance : How do you define quality, why isquality important in software, quality control and quality assurance,Cost and benefits of quality, Software quality analyst's functions, Somepopular misconceptions about the SQA's role, Software qualityassurance tools Organizational Structures, Profile of a successful SQA,Measures of SQA success, Pitfalls to watch out for in the SQA's role.Risk Management : What is risk management and why it isimportant Risk Management Cycle, Risk Identification; Common Toolsand Techniques, Risk quantification, Risk Monitoring, Risk mitigation.Risks and mitigation in the context of Global Project Teams. SomePractical Techniques in Risk Management, Metrics in risk management.

Project Initiation : Activities during project initiation, Outputs, qualityrecords and completion criteria for the project intimation phase,Interfaces to the process database.Project Planning and Tracking : Components of project planningand tracking. The "What Cost" part of a Project Plan, the "When"part of project planning. The "How" part of a project plan. The "By

Whom" part of a Project management Plan, Putting it all together. Thesoftware project management plan, Activities specific to pro jecttracking, Interfaces to the process database.Project Closure : When does project closure happen. Why shouldwe explicitly do a Closure? An Effective Closure process, Issues thatGet Discussed During Cloure, Metrics for Project Closure, Interfacesto Process Database.Software Requirements Gathering : Inputs and Start Criteria forrequirements Gathering, Dimensions of Requirements Gathering, Stepsto be followed during requirements, gathering, Outputs and Qualityrecords from the requirements phase, Skill Sets required during the

requirements phase.Differences for a shrink-wrapped Software,Challenges During the Requirements Management Phase, Metrics forthe Requirements Phase.Estimation : What is estimation? When and why is estimationdone?.The three phases of estimation, Estimation Methodology, Formalmodels for size estimation, Translating size estimate into effort Estimate,Translating effort estimates into schedule estimates, Common challengesduring estimation, Metrics for the estimation processes. Design andDevelopment Phases : Some differences in our chosen approach. Silentfeatures of design, Evolving an Architecture/Blueprint, Design forReusability, Technology choices/constraints, Design of standards,Design of portability, User interface issues, Design for testability,Design for Diagnosability, Design for insall ability Inter-operabilitydesign, Inter-operability design, Challenges during design anddevelopment phases, Skill sets for design, Challenges during designand development phases, Skill sets for design and development,Metrics for design and development phase. Project Management inTesting Phase; What is testing, What are the activities that make upTesting?, The Scheduling and types of tests, People issues in testing,Management structures for testing in global teams, Metrics for TestingPhase. Project Management in the Maintanance phase : Activities

during the maintenance phase, Management issues during the



13/13

M.tech (Computer Science & Engineering) Session 2011-12

Documents

Transcript of M.tech (Computer Science & Engineering) Session 2011-12