Poondi, thanjavur dist



Yüklə 81,15 Kb.
səhifə4/9
tarix08.08.2018
ölçüsü81,15 Kb.
#61223
1   2   3   4   5   6   7   8   9


UNIT I Hrs 18
Algorithm Analysis – Time Space Tradeoff – Asymptotic Notations – Conditional
asymptotic notation – Removing condition from the conditional asymptotic notation -
Properties of big-Oh notation – Recurrence equations – Solving recurrence equations –
Analysis of linear search.


UNIT II Hrs 18

Divide and Conquer: General Method – Binary Search – Finding Maximum and Minimum
– Merge Sort – Greedy Algorithms: General Method – Container Loading – Knapsack
Problem.


UNITIII Hrs 18

Dynamic Programming: General Method – Multistage Graphs – All-Pair shortest paths –
Optimal binary search trees – 0/1 Knapsack – Travelling salesperson problem .


UNIT IV Hrs 18
Backtracking: General Method – 8 Queens problem – sum of subsets – graph coloring –
Hamiltonian problem – knapsack problem.


UNIT V Hrs 18
Graph Traversals – Connected Components – Spanning Trees – Biconnected
components – Branch and Bound: General Methods (FIFO & LC) – 0/1 Knapsack
problem – Introduction to NP-Hard and NP-Completeness.

TEXT BOOKS:


1. Ellis Horowitz, Sartaj Sahni and Sanguthevar Rajasekaran, Computer Algorithms/

C++, Second Edition, Universities Press, 2007. (For Units II to V)


2. K.S. Easwarakumar, Object Oriented Data Structures using C++, Vikas Publishing

House pvt. Ltd., 2000 (For Unit I)


REFERENCES:


1. T. H. Cormen, C. E. Leiserson, R.L.Rivest, and C. Stein, "Introduction to

Algorithms", Second Edition, Prentice Hall of India Pvt. Ltd, 2003.

2. Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman, "The Design and Analysis of Computer Algorithms", Pearson Education, 1999.

Semester

Subject code

Title of the course

Hours of Teaching/ Week

No.of Credits

I

14P1CSEL1C


Elective -I

NETWORK MANAGEMENT

6

4


Objective

*To know about Management Administration Techniques of Networking.

______________________________________________________________________

Unit I Hrs 18

Introduction: Need for Network management, A Model, Data Representation, Component of the framework, Structure of Management Information, MIB, Models, Conformance Statement, Co existence.

______________________________________________________________________

Unit II Hrs 18

Administration and Operation Models: Concepts of Administrative Models, Communities, Procedures, Protocols Interaction Transport Mappings, Coexistence, Network Management RFCs, Network Management Assignments.

______________________________________________________________________

Unit III Hrs 18

Network Monitoring and Control: Network Monitoring architectures, Performance Monitoring, Fault Monitoring, Account Monitoring Configuration Control, and Security Control.

______________________________________________________________________

Unit IV Hrs 18

SNMP: Network Management Concepts, Management Information, Standard MIBs, Simple Network Management Protocols (SNMP), NMPv2, Management Information Protocols, MIBs and Conformance.

______________________________________________________________________

Unit V Hrs 18

RMON: Remote Networking Monitoring, Statistics Collections, Alarms and Filters RMON2, Extension to RMON1 for RMON2 devices, OV-NNM Overview, Practical Aspects.

______________________________________________________________________

Reference:
1. William Stallings,” SNMP, SNMP2 and RMON”, Addison Wesley, 1996.

2. Marshall T. Rose,” An Introduction to Network Management”, Prentice Hall, 1996.





Semester

Subject code

Title of the course

Hours of Teaching/ Week

No. of Credits


II

14P2CSC4


Core- CLOUD BASED WEB SERVICES

5

4

Yüklə 81,15 Kb.

Dostları ilə paylaş:
1   2   3   4   5   6   7   8   9




Verilənlər bazası müəlliflik hüququ ilə müdafiə olunur ©www.genderi.org 2024
rəhbərliyinə müraciət

    Ana səhifə