Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

Masters Exam samples for the student, Exams of Information Technology

Masters Exam samples for the student Masters Exam samples for the student Masters Exam samples for the student Masters Exam samples for the student Masters Exam samples for the student Masters Exam samples for the student Masters Exam samples for the student Masters Exam samples for the student Masters Exam samples for the student Masters Exam samples for the student

Typology: Exams

2019/2020

Uploaded on 09/18/2020

betelihem_dawit
betelihem_dawit 🇬🇧

1 document

1 / 38

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Page 1 of 38
M. Sc. Computer Science - First Year
Subjects Lect/ Pract/ Paper Pract Total
Week Week Hours Marks
1
Section I :
Principles of Compiler Design-I 4
4
Section II :
3
75
50
125
Principles of Compiler Design-II 4
4
2
Section I :
Digital Signal Processing-I 4
4
Section II :
3
75
50
125
Digital Signal Processing-II 4
4
3
Section I :
Mobile Computing 4
4
Section II :
3
75
50
125
Computer Simulation and Modeling 4
4
4
Section I :
Data Warehousing and Mining 4
4
Section II :
3
75
50
125
Advanced Database Systems 4
4
Total : I Year I Term 16
16
-
Total : I Year II Term 16
16
300
200
500
M. Sc. Computer Science - Second Year
Lect/ Pract/ Paper Pract Total Subjects Week Week Hours Marks
1
Section I :
Artificial Intelligence 4
4
Section II :
3
75
25
100
Image Processing 4
4
2
Section I :
Distributed Computing 4
4
Section II :
3
75
25
100
Embedded Systems 4
4
3
Elective I
I Term 4
4
II Term 4
4
3
75
25
100
4
Elective II
I Term 4
4
II Term 4
4
3
75
25
100
5
Project, I Term -
6
-
-
100
100
Total : II Year I Term 16
16
-
Total : II Year II Term 16
16
300
200
500
Elective-I Elective-II
1 Parallel Processing, (I Term) 1
Pattern Recognition, (I Term)
Advanced Computer Networks, (II Term) Computer Vision, (II Term)
2 System Security (I Term) 2
Virtual Reality & Virtual Environment (I Term)
Internet security (II Term)
Java Technology (II Term)
3 Enterprise Networking (I Term) 3
Bio Informatics (I Term)
Satellite Communications, (II Term) Intelligent Systems (II Term)
4 Fuzzy Logic & Neural networks (I Term) 4
Optimization Techniques (I Term)
Multimedia systems and convergence of
technologies (II Term) Customer Relations Management (II Term)
id2576828 pdfMachine by Broadgun Software - a great PDF writer! - a great PDF creator! - http://www.pdfmachine.com http://www.broadgun.com
pf3
pf4
pf5
pf8
pf9
pfa
pfd
pfe
pff
pf12
pf13
pf14
pf15
pf16
pf17
pf18
pf19
pf1a
pf1b
pf1c
pf1d
pf1e
pf1f
pf20
pf21
pf22
pf23
pf24
pf25
pf26

Partial preview of the text

Download Masters Exam samples for the student and more Exams Information Technology in PDF only on Docsity!

M. Sc. Computer Science - First Year

Subjects Lect/ Pract/ Paper Pract Total Week Week Hours Marks 1 Section ñ I : Principles of Compiler Design-I 4 4 Section ñ II : 3 75 50 125 Principles of Compiler Design-II 4 4 2 Section ñ I : Digital Signal Processing-I 4 4 Section ñ II : 3 75 50 125 Digital Signal Processing-II 4 4 3 Section ñ I : Mobile Computing 4 4 Section ñ II : 3 75 50 125 Computer Simulation and Modeling 4 4 4 Section ñ I : Data Warehousing and Mining 4 4 Section ñ II : 3 75 50 125 Advanced Database Systems 4 4 Total : I Year ñ I Term 16 16 - Total : I Year ñ II Term 16 16

300 200 500

M. Sc. Computer Science - Second Year

Subjects Lect/ Pract/ Paper Pract Total Week Week Hours Marks 1 Section ñ I : Artificial Intelligence 4 4 Section ñ II : 3 75 25 100 Image Processing 4 4 2 Section ñ I : Distributed Computing 4 4 Section ñ II : 3 75 25 100 Embedded Systems 4 4 3 Elective I I Term 4 4 II Term 4 4 3 75 25 100 4 Elective II I Term 4 4 II Term 4 4 3 75 25 100 5 Project, I Term - 6 - - 100 100 Total : II Year ñ I Term 16 16 - Total : II Year ñ II Term 16 16^300 200

Elective-I Elective-II 1 Parallel Processing, (I Term) 1 Pattern Recognition, (I Term) Advanced Computer Networks, (II Term) Computer Vision, (II Term) 2 System Security (I Term) 2 Virtual Reality & Virtual Environment (I Term) Internet security (II Term) Java Technology (II Term) 3 Enterprise Networking (I Term) 3 Bio Informatics (I Term) Satellite Communications, (II Term) Intelligent Systems (II Term) 4 Fuzzy Logic & Neural networks (I Term) 4 Optimization Techniques (I Term) Multimedia systems and convergence of technologies (II Term)

Customer Relations Management (II Term)

CLASS: M. Sc (Computer Science) (^) Year I

SUBJECT: PRINCIPLES OF COMPILER DESIGN, Paper I, Term I

Lecture 4 TW/Tutorial/Practical 4

Periods per week

Hours Marks Theory Examination 3 75 TW/Practical -- 50

Evaluation System

Term I  Introduction to Compilers o Compilers and translators o Why do we need translators? o The structure of a compiler o Lexical analysis o Syntax analysis o Intermediate code generation o Optimization o Code generation o Book keeping o Error handling o Compiler writing tools o Getting started  Programming languages o High-level programming languages o Definitions of programming languages o The lexical and syntactic structure of a language o Data elements o Data structures o Operators o Assignment o Statements o Program units o Data environments o Parameter transmission o Storage management  Finite automata and lexical analysis o The role of the lexical analyzer o A simple approach to the design of lexical analyzers o Regular expressions o Finite automata o From regular expressions to finite automata o Minimizing the number of states of a DFA o A language for specifying lexical analyzers o Implementation of a lexical analyzer o The scanner generator as Swiss army knife  The syntactic specification of Programming Languages o Context-free grammars o Derivations and parse trees o Capabilities of context-free grammars

 Introduction to code optimization o The principle sources of optimization o Loop optimization o The DAG representation of basic blocks o Value numbers and algebraic laws o Global data-flow analysis  More about loop optimization o Dominators o Reducible flow graphs o Depth-first search o Loop-invariant computations o Induction variable elimination o Some other loop optimizations  More about data-flow analysis o Reaching definitions again o Available expressions o Copy propagation o Backward flow problems o Very busy expressions and code hoisting o The four kinds of data-flow analysis problems o Handling pointers o Interprocedural data-flow analysis o Putting it all together  Code generation o Object programs o Problems in code generation o A machine model o A simple code generator o Register allocation and assignment o Code generation from DAGís o Peephole optimization

Practical  Debug C++ / JAVA Programs using debugger provided by different vendors along with IDE  Make a comparative study of Different features of at least two Integrated Development Environment(IDE) and compilers  Manipulation of IDEís and restoring the original setting

CLASS: M. Sc (Computer Science) Year I SUBJECT: Digital Signal Processing , Paper II, Term I Lecture 4 TW/Tutorial/Practical 4

Periods per week

Hours Marks Evaluation System Theory Examination 3 75 TW/Practical -- 50

Term I

Sequences-Representation of arbitrary sequences-Linear time variant systems-causality, stability- difference equations-frequency response-first order systems-second order systems- Discrete Fourier series-relation between continuous and discrete Systems. The z Transform- the Relation between the z Transform and the Fourier transform of a sequence-Solution of differences equation using one sided transform-geometric evaluation of the Fourier Transform- Digital Filter Realizations-structures for all zero filters-the discrete Fourier transform ñ convolution of sequences-linear convolution of finite duration sequences-the discrete Hilbert transform.

The Theory and approximation of finite duration impulse response digital filters-issues in Filter design-FIR filters Design techniques for Linear phase FIR filters-windowing-issues with windowing-frequency sampling-solution for optimization-linear programming-linear phase filters-Maximal ripple FIR Filters ñRemez exchange algorithm- Multiple band optimal FIR Filters-Design of filters with simultaneous constrains on the time and frequency response.

Theory and approximation of infinite impulse response digital filters- IIR filters-filter coefficient- Digital Filter Design ñMapping of differentials-Transformations-Direct design of digital filters- comparison between FIR filters and IIR filters

Finite word length effects in digital filters-analog to digital conversions-digital to analog conversions-types of Arithmetic in digital systems. Types of quantization in digital filters- Dynamic range Constraints-Realizations-ordering and pairing in cascade realizations-round of noise-fixed point analysis-Coefficient quantization ñ Limit cycle oscillations

Spectrum analysis and the fast fourier Trans form-introduction to Radix-2 FFTís-data shuffling and bit reversal-FFT computer programming-Decimation ñin-Frequency Algorithm ñComputing an Inverse DFT by doing a Direct DFT-Radix2 Algorithm-Spectrum analysis at a single point in the z plane-spectrum analysis in FFT Analysis-Windows in spectrum Analysis-Bluesteinís Algorithm-The chirp z transform algorithm- convolution and correlation using number theoretic transforms.

CLASS: M. Sc (Computer Science)

SUBJECT: MOBILE COMPUTING, Paper III, Term I

Lectures: 4 Hrs per week Practical: 4 Hrs per week

Theory: 75 Marks Term work / Practical: 50 Marks Objective: Recent developments in portable devices and high-bandwidth, ubiquitous wireless networks has made mobile computing a reality. Indeed, it is widely predicted that within the next few yearsí access to Internet services will be primarily from wireless devices, with desktop browsing the exception. Such predictions are based on the huge growth in the wireless phone market and the success of wireless data services. This course will help in understanding fundamental concepts, current developments in mobile communication systems and wireless computer networks. DETAILED SYLLABUS

  1. Introduction: Applications, A short history of wireless communication
  2. Wireless Transmission: Frequency for radio transmission, Signals, Antennas, Signal propagation, Multiplexing, Modulation, Spread spectrum, Cellular systems.
  3. Medium Access Control: Motivation for a specialized MAC: Hidden and Exposed terminals. Near and Far terminals; SDMA, FDMA, TDMA: Fixed TDM, Classical Aloha, Slotted Aloha, Carrier sense multiple access, Demand assigned multiple access, PRMA packet reservation multiple access, Reservation TDMA, Multiple access with collision avoidance, Polling, Inhibit sense multiple access; CDMA: Spread Aloha multiple access.
  4. Telecommunication Systems : GSM: Mobile services, System architecture, Radio interface, Protocols, Localization And Calling, Handover, Security, New data services; DECT: System architecture, Protocol architecture; TETRA, UMTS and IMT-2000: UMTS Basic architecture, UTRA FDD mode, UTRA TDD mode
  5. Satellite Systems : History, Applications, Basics: GEO, LEO, MEO; Routing, Localization, Handover, Examples
  6. Broadcast Systems : Overview, Cyclic repetition of data, Digital audio broadcasting: Multimedia object transfer protocol; Digital video broadcasting
  7. Wireless LAN : Infrared vs. Radio transmission, Infrastructure and Ad hoc Networks, IEEE 802.11: System architecture, Protocol architecture, Physical layer, Medium access control layer, MAC management, Future development; HIPERLAN: Protocol architecture, Physical layer, Channel access control. Sublayer, Medium access control Sublayer, Information bases And Networking; Bluetooth: User scenarios, Physical layer, MAC layer, Networking. Security, Link management.
  8. Wireless ATM : Motivation for WATM, Wireless ATM working group, WATM services, Reference model: Example configurations, Generic reference model; Functions: Wireless mobile terminal side, Mobility supporting network side; Radio access layer: Requirements, BRAN; Handover: Handover reference model, Handover requirements, Types of handover, Handover scenarios, Backward handover, Forward handover; Location management: Requirements for location management, Procedures and Entities; Addressing, Mobile quality of service, Access point control protocol
  1. Mobile Network Layer : Mobile IP: Goals, assumptions and requirements, Entities and Terminology, IP packet delivery, Agent advertisement and discovery, Registration, Tunneling and Encapsulation , Optimizations, Reverse tunneling, Ipv6; Dynamic host configuration protocol, Ad hoc networks: Routing, Destination sequence distance vector, Dynamic source routing, Hierarchical algorithms, Alternative metrics
  2. Mobile Transport Layer : Traditional TCP: Congestion control, Slow start, Fast retransmit/fast recovery, Implications on mobility; Indirect TCP, Snooping TCP, Mobile TCP, Fast retransmit/fast recovery, Transmission/time-out freezing, Selective retransmission, Transaction oriented TCP
  3. Support for Mobility : File systems: Consistency, Examples; World Wide Web: Hypertext transfer protocol, Hypertext markup language, Some approaches that might help wireless access, System architectures; Wireless application protocol: Architecture, Wireless datagram protocol, Wireless transport layer security, Wireless transaction protocol, Wireless session protocol, Wireless application environment, Wireless markup language, WML script, Wireless telephony application, Examples Stacks with Wap, Mobile databases, Mobile agents

Text Books:

  1. Jochen Schiller, ì Mobile communicationsî, Addison wisely , Pearson Education
  2. Wiiliam Stallings, ì Wireless Communications and Networks î

References :

  1. Rappaort, ì Wireless Communications P rincipals and Practices î
  2. YI Bing Lin , ì Wireless and Mobile Network Architectures î, John Wiley
  3. P. Nicopolitidis , ì Wireless Networks î, John Wiley
  4. K Pahlavan, P. Krishnamurthy , ì Principles of Wireless Networks î
  5. M. Richharia , ì Mobile Satellite Communication: Principles and Trends î, Pearson Education

TERM WORK

  1. Term work should consist of at least 10 practical experiments and two assignments covering the topics of the syllabus.

CLASS: M. Sc (Computer Science)

SUBJECT: COMPUTER SIMULATION AND MODELING, Paper III, Term II Lectures: 4 Hrs per week Practical: 4 Hrs per week

Theory: 75 Marks Term Work / Practical: 50 Marks Objective : In the last five decades digital computer simulation has developed from infancy to a full-fledged discipline. The field of modeling and simulation is as diverse as of man. The application of simulation continues to expand, both in terms of extent to which simulation is used and the range of applications. This course gives a comprehensive and state of art treatment of all the important aspects of a simulation study, including modeling, simulation software, model verification and validation, input modeling.

  1. W David Kelton, Randall Sadowski, Deborah Sadowski, ì Simulation with Arena î, McGRAW-HILL.

TERM WORK

  1. Term work should consist of at least 10 practical experiments/Assignments covering the topics of the syllabus.

CLASS: M. Sc (Computer Science)

SUBJECT: DATA WAREHOUSING AND MINING, Paper IV, Term I

Lectures: 4 Hrs per week Practical: 4 Hrs per week

Theory: 75 Marks Term work/Practical: 50 Marks Objectives of the course: The data warehousing part of module aims to give students a good overview of the ideas and techniques which are behind recent development in the data warehousing and online analytical processing (OLAP) fields, in terms of data models, query language, conceptual design methodologies, and storage techniques. Data mining part of the model aims to motivate, define and characterize data mining as process; to motivate, define and characterize data mining applications.

DETAILED SYLLABUS

Data Warehousing:

1. Overview And Concepts: Need for data warehousing, Basic elements of data warehousing, Trends in data warehousing. 2. Planning And Requirements: Project planning and management, Collecting the requirements. 3. Architecture And Infrastructure: Architectural components, Infrastructure and metadata. 4. Data Design And Data Representation: Principles of dimensional modeling, Dimensional modeling advanced topics, data extraction, transformation and loading, data quality. 5. Information Access And Delivery: Matching information to classes of users, OLAP in data warehouse, Data warehousing and the web. 6. Implementation And Maintenance: Physical design process, data warehouse deployment, growth and maintenance.

Data Mining:

  1. Introduction: Basics of data mining, related concepts, Data mining techniques.
  2. Data Mining Algorithms: Classification, Clustering, Association rules.
  3. Knowledge Discovery : KDD Process
  4. Web Mining: Web Content Mining, Web Structure Mining, Web Usage mining.
  5. Advanced Topics: Spatial mining, Temporal mining.
  6. Visualisation : Data generalization and summarization-based characterization, Analytical characterization: analysis of attribute relevance, Mining class comparisons: Discriminating between different classes, Mining descriptive statistical measures in large databases
  1. Data Mining Primitives, Languages, and System Architectures: Data mining primitives, Query language, Designing GUI based on a data mining query language, Architectures of data mining systems
  2. Application and Trends in Data Mining: Applications, Systems products and research prototypes, Additional themes in data mining, Trends in data mining

Text Books:

  1. Paulraj Ponnian, ì Data Warehousing Fundamentals î, John Wiley.
  2. M.H. Dunham, ì Data Mining Introductory and Advanced Topics î, Pearson Education.
  3. Han, Kamber, ì Data Mining Concepts and Techniques î, Morgan Kaufmann

References:

  1. Ralph Kimball, ì The Data Warehouse Lifecycle toolkit î, John Wiley.
  2. M Berry and G. Linoff, ì Mastering Data Mining î, John Wiley.
  3. W.H. Inmon, ì Building the Data Warehouses î, Wiley Dreamtech.
  4. R. Kimpall, ì The Data Warehouse Toolkit î, John Wiley.
  5. E.G. Mallach, ì Decision Support and Data Warehouse systems î, TMH.

TERM WORK

  1. Term work should consist of at least 10 practical experiments and two assignments covering the topics of the syllabus.

CLASS: M. Sc (Computer Science)

SUBJECT: ADVANCED DATABASE SYSTEMS, Paper IV, Term II

Lectures: 4 Hrs per week Practical: 4 Hrs per week

Theory: 75 Marks Term work/ Practical: 50 Marks Objectives: To study the further database techniques beyond which covered in the second year, and thus to acquaint the students with some relatively advanced issues. At the end of the course students should be able to: gain an awareness of the basic issues in objected oriented data models, learn about the Web-DBMS integration technology and XML for Internet database applications, familiarize with the data-warehousing and data-mining techniques and other advanced topics, apply the knowledge acquired to solve simple problems

DETAILED SYLLABUS

  1. The Extended Entity Relationship Model and Object Model: The ER model revisited, Motivation for complex data types, User defined abstract data types and structured types, Subclasses, Super classes, Inheritance, Specialization and Generalization, Constraints and characteristics of specialization and Generalization, Relationship types of degree higher than two.
  2. Object-Oriented Databases: Overview of Object-Oriented concepts, Object identity, Object structure, and type constructors, Encapsulation of operations, Methods, and Persistence, Type hierarchies and Inheritance, Type extents and queries, Complex objects; Database schema design for OODBMS; OQL, Persistent programming languages; OODBMS architecture and storage issues; Transactions and Concurrency control, Example of ODBMS

CLASS: M. Sc (Computer Science)

SUBJECT: PARALLEL PROCESSING (Elective)

Lectures: 4 Hrs per week Practical: 4 Hrs per week

Theory: 75 Marks Term Work/Practical : 25 Marks

Objective: Upon completion of this course students will be able to understand and employ the fundamental concepts and mechanisms which form the basis of the design of parallel computation models and algorithms, recognize problems and limitations to parallel systems, as well as possible solutions

DETAILED SYLLABUS

  1. Introduction: Parallel Processing Architectures: Parallelism in sequential machines, Abstract model of parallel computer, Multiprocessor architecture, Pipelining, Array processors.
  2. Programmability Issues: An overview, Operating system support, Types of operating systems, Parallel programming models, Software tools
  3. Data Dependency Analysis: Types of dependencies loop and array dependences, Loop dependence analysis, Solving diophantine equations, Program transformations
  4. Shared Memory Programming: General model of shared memory programming, Process model under UNIX
  5. Algorithms for Parallel Machines: Speedup, Complexity and cost, Histogram computation, Parallel reduction, Quadrature problem, Matrix multiplication, Parallel sorting algorithms, Solving linear systems, Probabilistic algorithms
  6. Message Passing Programming: Introduction, Model, Interface, Circuit satisfiability, Introducing collective, Benchmarking parallel performance
  7. Parallel Programming languages: Fortran90, nCUBE C, Occam, C-Linda
  8. Debugging Parallel Programs: Debugging techniques, Debugging message passing parallel programs, Debugging shared memory parallel programs
  9. Memory and I/O Subsystems: Hierarchical memory structure, Virtual memory system, Memory allocation and management, Cache allocation and management, Cache memories and management, Input output subsystems
  10. Other Parallelism Paradigms: Data flow computing, Systolic architectures, Functional and logic paradigms, Distributed shared memory
  11. Performance of Parallel Processors: Speedup and efficiency, Amdahlís law, Gustafson-Barsisís law, Karf-Flatt metric, Isoefficiency metric

Text Books:

  1. Hawang Kai and Briggs F. A., ì Computer Architecture and Parallel Processingî , McGraw Hill
  2. Jorden H. F. and Alaghaband G., ì Fundamentals of Parallel Processing î
  3. M.J. Quinn, ì Parallel Programming î, TMH

References:

  1. Shasikumar M., ì Introduction to Parallel Processingî , PHI
  2. Wilson G.V., ì Practical Parallel Programming î, PHI
  3. D. E. Culler, J.P. Singh, A. Gupta, ìParallel Computer Architecture î, Morgan Kaufman

TERM WORK

  1. Term work should consist of at least 10 practical experiments and two assignments covering the topics of the syllabus.

CLASS: M. Sc (Computer Science)

SUBJECT: ADVANCED COMPUTER NETWORKS (ELECTIVE)

Lectures: 4 Hrs per week Practical: 4 Hrs per week

Theory: 75 Marks Term work/Practical: 25 Marks

Objectives: In first part, Advanced technologies like High speed Devices etc. are to be considered. Second part Network programming is to be studied. Not just SOCKETS but also protocols, Drivers, Simulation Programming. In third part we should study Network Design, Protocols designs and analysis considering deterministic and non-deterministic approach. We expect natural thinking from student. For example he should able to consider different constraints and assume suitable data and solve the problems.

DETAILED SYLLABUS

  1. Data Communications: Business Drivers and Networking Directions : Data communication Past and future.
  2. Understanding the standards and their maker: Creating standards: players and Process, Current forums, Standard protocols, Layered reference models: The OSIRM, Standard computer architectures.
  3. Introduction to Transmission Technologies: Hardware selection in the design process.
  4. Optical Networking: SONET/SDH standards, Dense wavelength division multiplexing (DWDM), Performance and Design considerations.
  5. Physical Layer Protocols and Access Technologies: Physical Layer Protocols and Interfaces, Accessing the Network, Copper access technologies, Cable Access Technologies, Fiber Access Technologies, Air Access Technologies.
  6. Common Protocols and Interfaces in the LAN environment: Data link layers protocols, LLC and MAC sub layer protocol, Ethernet, Token Ring, Token Bus and FDDI, Bridge protocols, Switching in the LAN environment.
  7. Frame Relay: FR specification and design, VoFR: Performance and Design considerations, Advantages and disadvantages of FR.
  8. Common WAN Protocol: ATM: Many faces of ATM, ATM protocol operation (ATM cell and Transmission), ATM networking basics, Theory of operations, B- ISDN protocol reference model, PHY layer, ATM layer (Protocol model), ATM layer and cell (Definition), Traffic descriptors and parameters, Traffic and Congestion control defined, AAL Protocol model, Traffic contract and QoS, User plane overview, Control plane AAL, Management plane, Sub-DS3 ATM, ATM public services.
  9. Common Protocols and Interfaces in the Upper Layers(TCP/IP): Background (Routing protocols), TCP/IP suite, Network layer (Internetwork layer), Transport layer, Application layer, Addressing and routing design.

CLASS: M. Sc (Computer Science)

SUBJECT: INFORMATION & SYSTEM SECURITY (Elective) Lectures: 4 Hrs per week Practical: 4 Hrs per week

Theory: 75 Marks Term work/Practical: 25 Marks

Objectives of the course: Learn about the threats in computer security. Understand what puts you at a risk and how to control it. Controlling a risk is not eliminating the risk but to bring it to a tolerable level.

DETAILED SYLLABUS

  1. Introduction: Notion of different types of securities : Information Security. Computer Security : Security Goals, Relation between Security-Confidentiality, Integrity, Availability and Authorization, Vulnerabilities- Principles of Adequate protection. Operating security, Database security, Program security, Network Security (Notions Only). Attacks : Threats, Vulnerabilities and controls. The kind of problems-Interception, Interruption, Modification, Fabrication. Computer Criminals : Amateurs, Crackers, Career Criminals. Methods of Defense : Control, Hardware Controls, Software Controls, Effectiveness of Controls.
  2. Program Security: Secure programs : Fixing Faults, Unexpected Behaviour, Types of Flaws. Non-malicious program errors : Buffer overflows, Incomplete Mediation. Viruses and other malicious code : Why worry about Malicious Code, Kinds of malicious code, How viruses attach, How viruses gain control, Prevention, Control Example : The Brain virus, The Internet Worm, Web bugs. Targeted malicious code - Trapdoors, Salami Attack. Controls against program threats - Development Controls, Peer reviews, Hazard Analysis.
  3. Operating System Security: Protected objects and methods of protection, Memory address protection - Fence, Relocation, Base/Bounds Registers, Tagged Architecture, Segmentation, Paging. Control of access to general objects - Directory, Access Control List. File protection mechanism - Basics forms of Protection, Single Permissions. Authentication : Authentication basics, Password, Authentication Process Challenge-response, Biometrics. Trusted Operating systems - Security Policies for Operating Systems, Models of Security- Requirement of security systems, Multilevel Security, Access Security, Limitations of Security Systems. Trusted Operating System Design - Elements, security features, assurance, system flaws and assurance methods.
  4. Database Security: Security requirements- Integrity of Database, Confidentiality and Availablity, Reliability and integrity, Sensitive data, Interface, Multilevel database, Proposals for multilevel security
  5. Administrating Security: Security planning - Contents of a security Planning Team members, commitment to a security plan, Business continuity Plans. Risk analysis - The nature of risk, steps of risk analysis. Arguments for and against risk analysis, Organizational security policies - Purpose and goals of Organizational Security. Audience, Characteristics of a Good Security Policy. Nature of security Policies- Data sensitivity policy, Government Agency IT security policy. Physical security- Natural Disaster, Human Vandals, Interception of Sensitive Information.
  6. Legal, Privacy, and Ethical Issues in Computer Security: Protecting programs and data, Information and law, Rights of employees and employers, Software failures, Computer crime, Privacy, Ethical issues in computer society, Case studies of ethics

Text Books:

  1. C. P. Pfleeger, and S. L. Pfleeger, ì Security in Computing î, Pearson Education.
  2. Matt Bishop, ì Computer Security: Art and Science î, Pearson Education.
  3. Stallings , ì Cryptography And Network Security: Principles and practice î

References :

  1. Whitman, Mattord, ì Principles of information securityî, Thomson

CLASS: M. Sc (Computer Science) SUBJECT: NETWORK AND INTERNET SECURITY (Elective)

Lectures: 4 Hrs per week Practical: 4 Hrs per week

Theory: 75 Marks Term Work/Practical: 25 Marks

Objectives of the course: Learn about the threats in Network and Internet security. Understand what puts you at a risk and how to control it. Controlling a risk is not eliminating the risk but to bring it to a tolerable level.

DETAILED SYLLABUS

1. Security in Network: Model for Security: Threats in Networks, Stealing Passwords, Social Engineering, Bugs and Backdoors, Authentication Failures, Protocol Failure, Information Leakage.

  1. Elementary Cryptography: Terminology and Background, Cryptography and network security. Concepts of Encryption and Decryption. Cryptanalysis, Substation Cipher. Transpositions Good and Secure Encryption Algorithm. Trust worthy Encryption systems Data encryption standards (DES) and Advanced Encryption Standards (AES) Comparison of DES and AES.
  2. Classical Encryption Technique: Symmetric and Asymmetric Encryption Systems, Stream and Block Ciphers, Contemporary Symmetric Ciphers, Confidentiality using Symmetric Encryption.
  3. Public Key Encryption and HASH Functions: Public Key Cryptography and RSA, Message Authentication and Hash Function, Hash Algorithms, Digital Signatures and Authentication Protocols.
  4. Firewalls: Basic Concepts (for understanding the firewalls rules) : TCP Segment format IP Datagram format. Introduction: Kinds of Firewalls, Packet Filters. Packet Filtering. Dynamic Packet Filters. Application-Level Filtering. Circuit-Level Gateways, Firewall Configurations, Demilitarized Zone (DMZ) Networks, Distributed Firewalls, Limitation of Firewalls. Filtering Services: Reasonable Services to Filter (Filter Rules to be applied): DNS, Web, FTP, NTP. DNS (Domain Name Server): DNS overview, Protocol overview, Hierarchal Structure, Root Servers, Practical Experience. DNS Security: Unpatched Servers, Misconfigured Servers. DNS Cache Poisoning: Denial of Service Attack. Distributed Denial of Service Attack. Luring Users into a Crafted Site.

CLASS: M. Sc (Computer Science)

SUBJECT: Enterprise Networking (Elective)

Lectures: 4 Hrs per week Practical: 4 Hrs per week

Theory: 75 Marks Term Work/Practical: 25 Marks

Introduction Growth of Computer Networking, Complexity in Network Systems, Mastering the Complexity, Resource Sharing, Growth of the Internet, Probing the Internet, Interpreting A Ping Response

PART I DATA TRANSMISSION

Transmission Media Copper Wires, Glass Fibers, Radio, Satellites, Geosynchronous Satellites, Low Earth Orbit Satellites, Low Earth Orbit Satellite Arrays, Microwave, Infrared, Light Form a Laser

Local Asynchronous Communication The Need for Asynchronous Communication, Using Electric Current to Send Bits, Standards for Communication, Baud Rate, Framing, and Errors, Full Duplex Asynchronous Communication, Limitations of Real Hardware, Hardware Bandwidth and the Transmission of Bits, The Effect of Noise On Communication, Significance for Data Networking

Long-Distance Communication (Carriers, Modulation and Modems) Sending Signals across Long Distances, Modem Hardware Used for Modulation and Demodulation, Leased Analog Data Circuits, Optical, Radio Frequency, And Dialup Modems, Carrier Frequencies and Multiplexing, Base band And Broadband Technologies Wave Division Multiplexing, Spread Spectrum, Time Division Multiplexing

PART II PACKET TRANSMISSION

Packets, Frames and Error Detection The Concept of Packets, Packets and Time-Division Multiplexing, Packets and Hardware Frames, Byte Stuffing, Transmission Errors, Parity Bits and Parity Checking, Probability, Mathematics And Error Detection, Detecting Errors With Checksums, Detecting Errors With Cyclic Redundancy Checks, Combining Building Blocks, Burst Errors, Frame format And Error Detection Mechanisms

LAN Technologies and Network Topology Direct Point-To-Point Communication, Shared Communication Channels, Significance of LANs and Locality of Reference, LAN Topologies, Bus Network: Ethernet Carrier Sense on Multi- Access Networks (CSMA), Collision Detection and Back off With CSMA/CD, Wireless LANs And CSMA/CA, Bus Network: Local Talk

Hardware Addressing and Frame Type Identification Specifying a Recipient, How LAN Hardware Uses Addresses to Filter Packets Format of a Physical Address, Broadcasting, Multicasting, Multicast Addressing, Identifying Packet Contents, Frame Headers And Frame Format, Using Networks That Do Not Have Self- Identifying Frames, Network Analyzers

LAN Wiring, Physical Topology, and Interface Hardware Speeds of LANs and Computers, Network Interface Hardware, the Connection between A NIC and A Network, Original Thick Ethernet Wiring, Connection Multiplexing, Thin Ethernet Wiring Twisted Pair Ethernet, the Topology Paradox, Network Interface Cards and Wiring Schemes,

Extending LANs: Fiber Modems, Repeaters, Bridges and Switches Distance Limitation and LAN Design, Fiber Optic Extensions, Repeaters, Bridges, Frame Filtering Startup and Steady State Behavior of Bridged Networks, Planning a Bridged Network, Bridging Between Buildings, Bridging Across Longer Distances, A Cycle Of Bridges, Distributed Spanning Tree, Switching, Combining Switches And Hubs, Bridging And Switching With Other Technologies

Long-Distance Digital Connection Technologies Digital Telephony, Synchronous Communication, Digital Circuits and DSU, Telephone Standards DS Terminology and Data Rates, Lower Capacity Circuits, Intermediate Capacity Digital Circuits Highest Capacity Circuits, Optical Carrier Standards, the C Suffix, Synchronous Optical Network (SONET), the Local Subscriber Loop, ISDN, Asymmetric Digital Subscriber Line Technology Other DSL Technologies, Cable Modem Technology, Upstream Communication, Hybrid Fiber Coax

Wan Technologies and Routing Large Networks and Wide Areas, Packet Switches, Forming A WAN, Store and Forward Physical Addressing In A WAN, Next-Hop Forwarding, Source Independence, Relationship of Hierarchical Addresses to Routing, Routing In A WAN, Use of Defaults Routes, Routing Table Computation, Shortest Path Computation in a Graph, Distributed Route Computation, Distance Vector Routing

Network Ownership, Service Paradigm, and Performance Network Ownership, Virtual Private Networks, Service Paradigm, Connection Duration and Persistence, Examples of Service Paradigms, Addresses and Connection Identifiers, Network Performance Characteristics

Protocols and Layering The Need for Protocols, Protocol Suites, A Plan for Protocol Design, the Seven Layers, Stacks: Layered Software, How Layered Software Works, Multiple, Nested Headers, the Scientific Basis for Layering,

TERM WORK Term work should consist of at least 10 assignments from the aforementioned topics. A Seminar to be presented by each student as part of term works carrying 15 marks. REFERENCE Computer Network, Tuekeun, PHI Networking Technology, Jaiswal, Galgotia. Data Networking, Bertsekas, PHI Computer Networks and Internets, Douglas E. Comer Pearson Education Asia