M.Sc Computer Science Syllabus

OSMANIA UNIVERSITY
HYDERABAD
M.Sc (Computer Science) Syllabus
**********************************************************

Osmani University offers a 2-year MSc programme in Computer Science. This master's course is appropriate for students who wish to pursue Research interests in any area of Computer Science Teaching, work for good career in the IT industry. Many colleges in Hyderabad city offering M.Sc Computer Science under Osmania University.

An important aspect of this programme is the project that students undertake in the final semester in collaboration with a well-established software development company. However, it is upto the student, if they want to prepare for prject themselves. There are few colleges offering Final semester project with collaboration with well establsihed software development company. The syllabus for the course, designed by Osmania University, is broad-based and provides courses of study that cover the current and future challenges in this field. The revised syllabus of Osmani University is given below.

Semester I
1.1 Discrete Mathematical Structures
1.2 Modern Operating Systems
1.3 Microprocessors and Microcontrollers
1.4 Software Engineering
1.5 Computer Graphics
1.6 LAB - Unix & Computer Graphics
1.7 LAB- Microprocessors and Microcontrollers

Semester II
2.1 Automata, Languages, and Computation
2.2 Client Server Programming (using Java)
2.3 Computer Networks and Internet Protocols
2.4 Design and Analysis of Algorithms
Elective
2.6(a) Advance Computer Architecture
2.5(b) Embedded Systems
2.6 Network Programming Lab
2.7 Client-Server Programming Lab

Semester III
3.1 Quantitative Techniques
3.2 Artificial Intelligence
3.3 Object Oriented System Development with UML
3.4 Network Security
3.5 Parallel Programming
3.6 LAB - Network Security
3.7 LAB - OOSD

Semester IV
Academic Project.

Complete Syllabus
************************************************************************************* Semester I

M. Sc. COMPUTER SCIENCE
1.1. Discrete mathematical Structures
4 Hr. PER WEEK

UNIT - I
Mathematical Logic and proofs – Propositions from old ones – Algorithms, Truth Tables and Tautologies – Equilent Propositions – the conditional and biconditional – argument and proofs 0 predicate Logic – Logical and electric circuits – Boolean algebra – Boolean functions some applications – Minimization.
Section 1.1 to 1.9,3.1 to 3.6 of (1)

UNIT – II
Graph Theory – Basic ideas and definitions – Planer Graphic – Connectivity – Computer representations of graphs – Directed graphs and trees – paths, cycles etc.- Dijkstra’s algorithm. Euler & Hamiltoniah paths.
Section 5.1 to 5.6, 6.1 to 6.3 of (1)

UNIT – III
Elementary Combinations –Basics of counting – combinations and permutations – their enumerations with repetitions – Engineering permutations with constrained repetitions - Binomial coefficients – the binominal and multinomial theorem – the principle of inclusion – exclusion.
Section 2.1 to 2.8 of (2)

UNIT – IV
Recurrence relations – Generating functions of sequences – calculating coefficients of generating functions – Recurrence relations – Solving recurrence relations by substitution and generating the method of characteristic roots – Solution of inhomogeneous linear recurrence relations.
Section 3.1. to 3.6 of (2)

TEXT BOOKS:
1.Stephen a Wiitala, Discrete Mathematics, a Unified approach Mc Graw Hill International edition, Computer Science Series, 1987. new editions, available (if any)
2.Joe L.Mott, Abraham Kandel, Theodore P.Baker; Discrete Mathematics for Computer Scientists and Mathematics, Prentice Hall, NJ, 1986.

REFERENCE BOOKS:
1.Kenneth H.Rosen; Discrete Mathematics, Mc. Graw Hill International Editions.

***************************************************************************************************************************************

M. Sc. COMPUTER SCIENCE
1.2 Modern Operating System
4 Hr. PER WEEK
UNIT – I
Introduction to Operating Systems: Computer System Structure, Operating System
Structures : Architecture of distributed system, issues in distributed operating system, inherent Limitation of distributed system, logical clocks, global state, Distributed shared memory, Process concepts, process scheduling, inter process communication. CPU Scheduling: Criteria, Scheduling algorithms, Multiple processor scheduling, Real times scheduling, Algorithm evaluation. The critical section problem synchronization. Critical regions, Monitors, Atomic transactions.
Dead locks: System model, Dead lock characterization. Methods of handling Dead
locks, deadlock prevention, Deadlock avoidance, dead lock detection. Recovery from dead lock, combined approach to deadlock handling

UNIT – II
Introduction, Logical versus physical address space. Swapping. Allocation or frames, thrashing, other considerations, demand segmentation. Thread scheduling and dispatching, interrupt and exception handling, system service dispatching, multiprocessor synchronization, file concept, access methods, directory structure and protection. File system implementation: system structure allocation Methods, free space management, directory implementation, secondary Storage structure, disk structure, disk scheduling, disk management, swap – space management.

UNIT – III
Security: Goals of protection and security Management: Revocation of access rights.
Two case studies – one on Unix/ Linux / Solaris and another Windows Server. Failure
recovery, classification of failure, Basic approaches, check – Fault tolerance, commit protocols, voting protocols, concurrency controls, lock time safe ordering.

UNIT – IV
System Administration commands: For – Unix / Linux / Solaris : user management, resource management, network management, security management, process management, backup and recovery.
TEXT BOOKS:
1. Andrew S.Tenen Baum Modern Operating System Prentice Hall of India Easter
Economy Edition, 1998.
2. M.Singhal and H.G.Shivarathi, Advanced concepts in operating system, Mc.Graw
Hill, 1994.
3. Abraham Silberschatz and Peter B.Gavilin, Operating System concept, Addison Wesily Publishing Company, Fifth edition, 1998.
***********************************************************************************

M. Sc. COMPUTER SCIENCE
1.3. Micro processor and Micro Controllers
4 Hr. PER WEEK
UNIT I
Digital System- Number System, Logic Gate, Boolean Algebra, Flip-Flops, Registers,
Encoders, Decoders, Multiplexers, Demultiplexers, Counters, D/A and A/D Converters,
DC Powder Supplies, SMPS, UPS (Block diagram, with technical information).
(text – 1, Ch:2, Ref- 3 Ch.13)
UNIT – II
Micro Processors, 8085 – Evolution of Microprocessors and Digital Computers, memory
(Storage Type and Devices), Buses Bus Architecture, Intel 8085, Instruction Cycle,
Timing Diagrams, Addressing Modes and Instructions with simple examples.
(text – 1, Ch, 1,3,4)
UNIT – III
Microprocessors, 8085 – Intel 8086, Block Diagram and Operations, Registers,
Interrupts, Bus Cycle, Assembler Directives, and Operators, Addressing Modes and
Instructions with simple examples. Interfacing peripheral devices – PPI 8257, PIC 8259, 8253 Counter / Timer.
(text – Ch: 7,11, 2,3: ref- 4)
UNIT – IV
Micro controllers, 8051 – Detailed Architecture of Single chip Micro controller – 8051, Registers, Flags and PSW, Internal Memory, Special Function Registers, I/O Interrupts, Instructions with simple examples, Other 8 bit, 16 bit and 32 bit Micro controllers (block diagram. Only)
(text – 1: Ch: 10 text 3, Ch: 16, Text- 4, Ch:3)
Special Devices – CRT, Floppy, Hard Disk and Printer Controllers, KBD 8279, Memory
Controllers, cache controllers, CRT display printer, scanners, (Brief Technical
Descriptions).
Text books:
1.Fundamentals of Microprocessors and Microcomputers by B.Ram Dhanapat Rai
Publicaitons (P)Ltd, India.
2.Microprocessors Architecture, Programming and Application with the 8-85, 4th
Edition Ramesh S. Gaonkar Penram Inernational Publising (India).
3.Advanced Microprocessors and Peripherals, Architecture, Programming and
Interface by A.K.Ray and K.M.Bhurchandi TMH, India.
4.The 8051 Microcontroller Architecture, Programming & Applications, 2nd Edition
by Kenneth J.Ayala Penram International Publising (India).
Reference Books and Data books:
1.Digital Systems Principal and Applications, 8th Edition by Ronald J.toccl, Neal S.
Widmer Pearson Education PTe, Ltd, India
2.Digital Principles & Applications by – Albert Paul Malvino and Donald P, Leach
TMH, India.
3.Fundamentals of Digital Circuits by A. Anand Kumar PHI, India.
4.Ics & Microprocessors - Data Hand Book BPB Publications, India
5. The Intel Microprocessors 8-856/8088, 80186/188, Pentium Pro Professor
Architecture, Programming and Interfacing 4th Edition By – Barry B.Brey PHI,
India.
6. Microprocessors and Interfacing, Programming and Hardware By Douglas V.Hall
TMH, India.
7. Microprocessor Systems – The 8086/8088 Family, Arch, Prog, and Design by Yu-
cheng Liu and Glenn A.Gibson PHI, India.
8. The 8051 Microcontroller and Embedded systems by Muhammed Ali Mazidi,
Janice Gillispie Mazid person Education Pte, Ltd, India.
9. Programming and Cuistomizing The 8051 Micro controller by Myke Predko
TMH, India.
**********************************************************************************

M. Sc. COMPUTER SCIENCE
1.4 Software Engineering
4 Hr. PER WEEK
UNIT – I
Introduction to Software Engineering project size and its categories planning a software project – software developing life cycle – planning and organizational structure.
UNIT – II
Software cost estimation, Least factor – cost estimation techniques, maintenance cost estimation – Software requirement specifications -formal specification techniques.
UNIT- III
Software Design – Fundamental design concepts and relations o Modularization –
Module design techniques – detailed design consideration – Implementation issues –
Structures coding techniques – coding style – standards and guidelines – Documentation – verification and validation techniques – quality assurance – walk through and inspection – testing – format verification.
UNIT – IV
Software tools – overview of CASE – Software reliability – Software errors – Faculty –Repairs and availability – Software maintenance – Management aspects of maintenance –maintenance tools and techniques.
TEXT BOOKS:
1.RS. Pressman – Software Engineering. Mc. Graw Hill publishing Co. 1987.
Reference: Books:
1.R.Facles – Software Engineering, Mc. Graw Hill Publishing Co. 1986.

*************************************************************************************

M. Sc. COMPUTER SCIENCE
1.5 COMPUTER GRAPHICS
4 Hr. PER WEEK
UNIT – I
A survey of computer graphics, overview of graphic systems, Video Display devices,
Raster Sean systems, Random scare systems, graphic input devices, Hard copy devices. Graphics software.Output Primitives: Line-Drawing Algorithms DDA, Bresenhan line Algorithm, Midpoint circle Algorithm, Ellipse Algorithm, Polygon fill Algorithms, : Scar – line, Boundary fill, Floodfill Algorithms.
UNIT – II
Attributes of output primitives: Line Attributes, Curve Attributes, Area fill and character Attributes Two dimensional transformations: Basic transformations, homogeneous representation, composite transformation, reflection and shear transformation.
UNIT – III
Two – dimensional viewing : Viewing – pipeline, windows to view coordinate
transformation Clipping Operations: Cohen – Sutherland line clipping liang – barsky lion clipping, Nicholl-Lee Nicholl – Line Clipping – Hodgman polygone clipping, weiler Autherton polygon clipping.
UNIT – IV
Three dimensional objective representations, polygon surfaces, plygon tables, plane
Equations, cubic Berier curves, B-spline, octrees. 3D – transformations : Translation, Rotaiton, Rotations about a arbitrary point Projections: Perspective projections and parallel projections Visible surface detection: Back faced detection: Z-buffer Algorithms Depth sorting Algorithm, Area subdivision Algorithm.
TEXT BOOKS:
1.M.Pauline Baker, Computer Graphics, C-Version, Prentice Hall of India Second
Edition 1995.
Reference Books:
1.Computer Graphics by Harinton, Mc.Graw Hill Publishing Co. 1987.

**********************************************************************************

M. Sc. COMPUTER SCIENCE
1.6 (LAB UNIX AND COMPUTER GRAPHICS)
6 Hr. PER WEEK
UNIT – I
a) Shell Programming
1. Using ‘case’, them and ‘if’ Loop
2. To identify the type of a given file
3. Inter process communicating using pipes
4. To wish ‘Good morning’ and good evening’ depending on the time
b) Programmes Using System Calls:
5. Implementation of Cp(Copy) command of UNIX
6. To create a child process using fork ( ) and exce ( ) system calls
7. Process communication using signals
8. To convert upper case to lower case letters of a given ASCII file
UNIT – II
Computer Graphics (using C)
9. Line drawing algorithms – DDA and Bresenham’s method
10. Circle and eclipse drawing algorithms – parametric and Bresenham’s method
11. Algorithm for polygon inside tests and testing convexity
12. Polygon filling using scan conversion method
13. Transformation on 2-D composite objects
14. Line clipping algorithms – Sutherland – Hodgman method
15. Polygon clopping using Sutherland – Hodgman method
16. 3 – D transformation on a cube
17. Bezier curves drawing.
***********************************************************************************

M. Sc. COMPUTER SCIENCE
1.7 LAB – DIGITAL SYSTEMS, MICROPRECESSORS AND MICROCONTROLLLERS
6 Hr. PER WEEK
UNIT – I
Digital Systems:
1. Verification of The Logic Gates, Flip – Flops
2. Encoder / Decoder, Mux / Demux
3. Design of Counters
UNIT – II
1. Addition, Subtraction, Multiplication and Division
2. Fine Ones and Two’s complement of a number
3. Find Square and Square root of a number
4. Find Largest and Smallest Number in Data Array / form a Series of Numbers
5. To Arrange a Data / a Series of Number in Ascending and Descending Order
6. Write a Delay Subroutine Program, using One, Two or More Registers
7. Measurement of Physical Quantities of – Temperature, Speed of a Motor (using a
Tacho generation)
8. Interfacing a Stepper Motor, with forward and Reverse Steps
9. To Generate a Square Wave of Pulse
(text – 1, Ch; 6,9)
UNIT – III
Microprocessors – 8086
1. Addition, Subtraction, Multiplication and Division of the given Operands.
2. Find Largest and Smallest Number in Data Array/from a Series of Numbers\
3. To Arrange a Data Array/ a Series of numbers in Ascending and Descending
order.
4. Display the Message “………………” on the Monitor, String Operations.
5. Write a Program to generate a Delay of 100 ms, 100 sec, 1 minute and 10 minutes
6. To Generate Waveforms of – Sawtooth, Triangular, Pulse, Sine, by Interfacing
DCA
By using – 8086 Kit, DEBUG of DOS utility, MASM or TASM.
UNIT – IV
1. Setting up UMPS and getting a program to assemble
2. Arithmetic Operations
3. Direct and Indirect Bank Register Addressing
4. RAM Direct addressing
5. Subroutines
6. State Machines
Experiments with Universal Microprocessor Program Simulator (UMPS)
(Ref: -9, Ch.9)
**********************************************************************************

Semester III

M.SC. COMPUTER SCIENCE
3.1 QUANTITATIVE TECHNIQUES
4 Hr. per week
UNIT I:
Probability models: Mathematical, Statistical and axiomatic definitions of Probability. Addition and Multiplication rules of probability. Conditional Probability and Bayes Theorem . Discrete and continuous random variables, probability mass function, probability density function, cumulative distribution function and Mathematical expectation of a random variable. Binomial, Poisson, Uniform, Normal, Exponential and Gamma distributions, Mean and variance of these distributions. Concepts of sample, sampling distribution and standard error t, F and Chi – square distributions.

UNIT II:
Statistical Inference: Estimation of Parameters – Unbiasedness, Consistency and
efficiency Methods of maximum likelihood and moments. Interval estimation and
confidence limits of parameters of normal distribution. Testing of hypotheses – Tests of mean (s), variance (s) and proportion (s) and goodness of fit test based on Z, t, F and Chi – square distributions.

UNIT III:
Linear Programming Problem (LPP) : Formulation and solution by Graphical method of LPP. Standard LPP form and its basic solutions. Solution of LPP by simplex algorithm. Use of artificial variables and special cases in simplex algorithm. Definition of dual problem and economic interpretation of duality. Dual simplex method.

UNIT IV:
Transportation Problem(TP) : Formulations of it as LPP. Initial basic feasible solution by North – West Corner rule. Least cost and Vogel’s approximation methods. Optimum solution by modified distribution method. Assignment Problem (AP): Formulation of its as LPP. Optimum solution by Hungarian Method. Queuing Theory: Queuing system and characteristics of a queue. M/M/1 queuing system without proofs.
Reliability : Concept of reliability , failure density and Hazard function.
System reliability of series, parallel and K – out of n systems.
TEXT BOOKS:
1. Trivedi, K.S: Probability and Statistics with Reliability, Queuing and Computer Applications. Prentice Hall of India, New Delhi(1999).
2. Sharma, S.D: Operations Research, Kedarnath and Ramnath and Co. (2002).

REFERENCE BOOKS:

1. Hines, W.W., Montogemery, D.C., Goldsman, D.M. and Borror, C.M: Probability and Statistics in Engineering, Fourth Edition, John Wiley and Sons, Asia Private Limited(2003).
2. Hamdi A. Taha, Operations Research and Introduction Prentice Hall of India New Delhi(1998).
*************************************************************************************

3.2 ARTIFICIAL INTELLIGENCE
4 Hr. per week
Unit I
Artificial Intelligence-Definition, introduction to AI techniques Problems Problem spaces and search-state space search problem-production system-problem characteristics-Heuristic search – Generate and test, Hill climbing – Breadth – First search, problem reduction, Constraint satisfaction knowledge representation issues – representation and mapping-approaches-issues-the frame problem – knowledge representation using predicate logic – predicate logic, unification, resolution.

Unit II
Procedural versus declarative knowledge-Logic Programming-Forward versus backward reasoning-matching declarative knowledge representation-Semantic Nets-Frames-Conceptual dependency Scripts, CYC. Symbolic reasoning under uncertainty-Non-monotonic reasoning – Implementation of depth-First search and Breadth first search Statistical reasoning, Certainty Factors and rule based systems-Bayesian Networks – Dempster Shafter Theory – Fuzzy logic.

Unit III
Game playing-minmax search-alpha-beta heuristics-refinement intertive depending planning-Components-Goal stack planning-Nonlinear planning – hierarchical planning-Learning-Rote learning-Rote learning – Learning by taking advice – Learning from examples, explain based learning – connectist models – Neural networks, applications Natural Language processing, syntax, Semantic and pragmatic processing perception. Expert System Representation and using domain knowledge – Expert system shells – Explanation Knowledge acquisitions.

Unit IV
The brain as a dynamical system, Neurons as functions, signal monotonicity, Biological activations and signals, Neuron fields. Theory of Fuzzy sets; Definition dilation, concentration, normalizatization, reasoning with fuzzy logic, natural language computation, Fuzzy Maching algorithms.
TEXT BOOKS:
1. W.F.CLICKSIN and C.S.MELLISH, Programming in PROLOG, spinger International Student Edition.
2. Dan.W.Patterson, Introduction to Artificial Intelligence and Expert System, Prentice Hall of India.
REFERENCE BOOK:
1. Artificial Intelligence by Elanine Rich, Mc Graw Hill Book Company.
*************************************************************************************

3.2 ARTIFICIAL INTELLIGENCE
4 Hr. per week
Unit I
Artificial Intelligence-Definition, introduction to AI techniques Problems Problem spaces and search-state space search problem-production system-problem characteristics-Heuristic search – Generate and test, Hill climbing – Breadth – First search, problem reduction, Constraint satisfaction knowledge representation issues – representation and mapping-approaches-issues-the frame problem – knowledge representation using predicate logic – predicate logic, unification, resolution.

Unit II
Procedural versus declarative knowledge-Logic Programming-Forward versus backward reasoning-matching declarative knowledge representation-Semantic Nets-Frames-Conceptual dependency Scripts, CYC. Symbolic reasoning under uncertainty-Non-monotonic reasoning – Implementation of depth-First search and Breadth first search Statistical reasoning, Certainty Factors and rule based systems-Bayesian Networks – Dempster Shafter Theory – Fuzzy logic.

Unit III
Game playing-minmax search-alpha-beta heuristics-refinement intertive depending planning-Components-Goal stack planning-Nonlinear planning – hierarchical planning-Learning-Rote learning-Rote learning – Learning by taking advice – Learning from examples, explain based learning – connectist models – Neural networks, applications Natural Language processing, syntax, Semantic and pragmatic processing perception. Expert System Representation and using domain knowledge – Expert system shells – Explanation Knowledge acquisitions.

Unit IV
The brain as a dynamical system, Neurons as functions, signal monotonicity, Biological activations and signals, Neuron fields. Theory of Fuzzy sets; Definition dilation, concentration, normalizatization, reasoning with fuzzy logic, natural language computation, Fuzzy Maching algorithms.

TEXT BOOKS:
1. W.F.CLICKSIN and C.S.MELLISH, Programming in PROLOG, spinger International Student Edition.
2. Dan.W.Patterson, Introduction to Artificial Intelligence and Expert System, Prentice Hall of India.
REFERENCE BOOK:
1. Artificial Intelligence by Elanine Rich, Mc Graw Hill Book Company.
*************************************************************************************

M.Sc. COMPUTER SCIENCE
3.4 NETWORK SECURITY
Unit I
Conventional encryption, Security attacks, Security, Model for network security,
conventional encryption model, encryption techniques, DES, Triple DES, key
distribution, random number generation.

Unit II
Public – Key cryptology, principles of public – key cryptosystems, RSA algorithm,
key management, distribution of public keys, public key – distribution of
secret keys.

Unit III
Authentication and digital systems, authenticate requirements – functions
cryptographic checksum, hash function, digital signatures authentication protocols,
Kerberos, x-509 directory, authentication services, Diffie – Hellman key exchange,
digital signature standards.

Unit IV
Cryptographic algorithms, The MD 5 message digest algorithm, secure hash algorithm,
international data encryption algorithm, LUCA public key encryption – Electronic mail and management security – pretty good privacy (PGP), Privacy enhanced mail.
TEXT BOOKS:
1. William Stallings, Network and Internet work Security, Prentice Hall of India.

**************************************************************************************

M.SC. COMPUTER SCIENCE
3.5(C) PARALLEL PROGRAMMING (Elective)
4 Hr. per week
Unit I
Introduction to parallel Computing – Motivation, scope, parallel programming
platforms – Implicit parallelism, limitations of memory system performance,
dichotomy, physical organization, communication costs, principles of parallel
algorithm design – preliminaries, decomposition techniques,
(Pages No. 1 to 109 from text book).
Unit II
Tasks and interaction, mapping techniques for load balancing, methods for
containing interaction overheads, parallel algorithm models. Basic communication operations – one-to-all broadcast and all-to-one reduction and all-to-all broadcast and reduction, scatter and gather. Analytical modeling of parallel programs – performance metrics, effect of granularity, scalability. (Page 110-228 from text book).
Unit III
Programming using message passing - building blocks, message passing
interface (MPI), Topology and embedding, non-blocking communication operations,
collective communications and computation operations. Programming shared address space – threads, synchronization, controlling threads, read-write locks, barriers, OpenMP. (Pages 23 – 331 of text books)

Unit IV
Dense matrix algorithms – matrix-vector multiplication, matrix-matrix multiplication, solving a system of linear equations. Sorting algorithms – Issues, sorting networks, bubblesort, quicksort. Fast-Fourier transform – serial algorithm, binary exchange algorithm, transpose algorithm.
(Pages 337-416, 538-560)
TEXT BOOK:
1. Ananth Grama, Anshul Gupta, Geroge Karypis, Vipin Kumar – Introduction to Parallel Computing, Second Edition, Pearson 2003.
REFERENCE BOOKS:
2. Gregory V.Wilson, Practical Programming, PHI 1998.
3. Michael J. Quinn – Parallel Programming in C with MPI and OpenMP, Tata McGraw Hill.
***********************************************************************************

M.SC. COMPUTER SCIENCE
3.6 Lab – System Security Lab
Network Security Practical
Implementation of these Algorithms in Java or C/C++
A. Encryption Techniques.
* Polyalphabetic Ciphers
* Transposition techniques
* Hill Ciphers
* Playfair Ciphers
* Monoalphabetic Ciphers
* DES (Data Encryption Standard) Encryption
* Double DES
* Triple DES
B. Public Key Cryptography using RSA
* Key Generation
* Encryption & Decryption Techniques
* Diffie – Hellman key Exchange
* Hash Function
* Kerboros ( Client & Server ) in Network
* MD5 (Message Digest Algorithm)
* Secure hash Algorithms(SHA)
* Pretty Good Privacy function(services)
* Authentication
* Confidentiality
* Cipher block chaining mode(CBC)
* Electronic code book mode(ECB)
* Cipher feedback mode
* Digital Signature Algorithms
* Message Authentication code
* Hash message authentication code
* Secure Multi purpose Internet mail Extension(S/MIME)
* Envoloped Data
* Signed Data
* Clear Signing
* Internet Data Encryption Algorithms
* Encryption
* Decryption
C. Firewall installation & Configuration on Networking O.S such as Linux
Server System