Proposed Syllabus for MSc. CS Bastar Bv

7/31/2019 Proposed Syllabus for MSc. CS Bastar Bv

1/91

1 M.Sc. (Computer Science)

Contents1 First Year Semester-1 ............................................................................................................ 6

1.1 CS-101: Principles of Programming Languages ............................................................................... 71.2 CS102 - Advanced Networking ..................................................................................................... 121.3 CS-103: Distributed Database Concepts ......................................................................................... 15

1.4 CS-104: Design and Analysis of Algorithms .................................................................................. 171.5 CS-105- Seminar ............................................................................................................................. 191.6 CS-106: Practical Based on Course-CS-101 ................................................................................... 201.7 CS -107Practical Based on Course: CS-102 ............................................................................... 211.8 CS -108 Practical based on Course CS-103 .................................................................................... 221.9 CS -109Practical Based on Course-CS-104 ................................................................................ 23

2 First Year Semester-2 .......................................................................................................... 242.1 CS-201: Digital Image Processing .................................................................................................. 252.2 CS-202: Advanced Operating System ............................................................................................ 272.3 CS-203: Data Mining and Data Warehousing ................................................................................ 30 2.4 CS-206: Practical based on course CS-201 ..................................................................................... 322.5 CS-207 : Practical Based on Course CS-202 .................................................................................. 33

2.6 CS-208: Practical Based on CS 203: ............................................................................................... 343 Second Year Semester-3 .................................................................................................... 363.1 CS301: Software Metrics & Project Management .......................................................................... 373.2 CS-302: MOBILE COMPUTING .................................................................................................. 383.3 CS-303 SOFT COMPUTING ......................................................................................................... 423.4 CS 305 COMPILER DESIGN ........................................................................................................ 43

Electives....................................................................................................................................... 442. Functional Programming................................................................................................................. 463. Linux Kernel Programming and Introduction to Device Drivers ................................................... 484. Natural Language Processing.......................................................................................................... 505. Program Analysis ............................................................................................................................ 516. DOT NET........................................................................................................................................ 52

7. Information Systems Security ......................................................................................................... 558. Software Architecture and Design Patterns .................................................................................... 589. Software Testing Tools & Methodologies ...................................................................................... 6010. MODELLING AND SIMULATION ............................................................................................. 6511. EMBEDDED SYSTEM PROGRAMMING .................................................................................. 6612. Language Processors ....................................................................................................................... 6813. Artificial Intelligence ...................................................................................................................... 70

4 Guide Line of Project (Minor) ................................................................................................. 72PROJECT STRUCTURE ....................................................................................................................... 73

INTRODUCTION ................................................................................................................................... 73

OBJECTIVES ......................................................................................................................................... 73

IMPORTANCE OF THE MINI PROJECT .................................................................................................. 73

MINI PROJECT: TABLE OF CONTENTS .................................................................................................. 74

EXPLANATION OF CONTENTS.............................................................................................................. 76

Key Features Of The Project ................................................................................................................... 81Analysis ............................................................................................................................................... 81

Design .................................................................................................................................................. 82

Coding ................................................................................................................................................. 82


2/91


Testing ................................................................................................................................................. 82

STEPS OF THE MINI PROJECT .......................................................................................................... 83Selection of Topic Area ....................................................................................................................... 83

Project Report Planning ...................................................................................................................... 84

Project Plan ......................................................................................................................................... 84

Project Proposal Report ...................................................................................................................... 84

Project Final Report ............................................................................................................................ 85

Project Assessment ............................................................................................................................. 85

GUIDELINES FOR THE PROJECT PROPOSAL ................................................................................ 85Project Proposal .................................................................................................................................. 85

Front page ........................................................................................................................................... 85

Structure ............................................................................................................................................. 85

INTRODUCTION......................................................................................................................... 85

Problem Definition ...................................................................................................................... 86 Requirements Specification ........................................................................................................ 86

Planning and Scheduling ............................................................................................................. 86

Software and Hardware Requirements ...................................................................................... 86

Preliminary Product Description ................................................................................................. 86

Conceptual Models. .................................................................................................................... 86

REFERENCES ................................................................................................................................... 86

GUIDELINES FOR THE PROJECT REPORT ..................................................................................... 86Project Report Format ........................................................................................................................ 86

Project Report Layout ......................................................................................................................... 87

Font size and margin ........................................................................................................................... 87

Heading ............................................................................................................................................... 87

Figure and Tables ................................................................................................................................ 89

Software Requirement Specification ...................................................................................................... 89 External Interfaces of the system: They identify the information which is to flow from and totothe system............................................................................................................................................ 89

A typical SRS should include following contents: Normally IEEE standard is followed. ..................... 90PROJECT CATEGORIES ......................................................................................................................... 90

LIST OF APPLICATION AND TOOLS ........................................................................................... 91


3/91


BASTAR VISHWAVIDYALAYA JAGDALPUR

Syllabus for M.Sc. (Computer Science)

(Academic year 2012-2013)

Course Structure The entire course is a Two years and Four semester full time course. Forthree semesters there will be four theory courses and Lab courses. The last semester will beproject.

Assessment Pattern

M.Sc.(Computer Science)

Semester 1

Subject

CodeSubject Paper

Theory Marks (A)Sessional

Marks (B)Teaching Load

per Week

Max Min Max Min L T PCS-101 Principles of Programming Languages 100 40 50 30 4 2

CS-102 Advanced Networking 100 40 50 30 4 3

CS-103 Distributed Database Concepts 100 40 50 30 4 2

CS-104 Design and Analysis of Algorithms 100 40 50 30 3 3

CS-105 Seminar - - 50 30 - - 2

CS-106 Practical Based on CourseCS-101 50 30 - - - - 4




Total (Paper+Internal)(650+250)

900250 15 10 20


4/91


Semester 2

SubjectCode

Subject PaperTheory Marks (A)

Sessional


per WeekMax Min Max Min L T P

CS-201 Digital Image Processing

100 40 50 30 4 2CS-202 Advanced Operating Systems 100 40 50 30 4 2

CS-203 Data Mining and Data Warehousing 100 40 50 30 3 3

CS-204 Elective Course-1 100 40 50 30 3 3

CS-205 Project (Minor) 50 30 50 30 - - 2






900250 14 10 20

Semester 3

Subject

CodeSubject Paper




CS-301Software Metrics & ProjectManagement 100 40 50 30 4 2

CS-302 Mobile Computing 50 40 50 30 4 2

CS-303 Soft Computing 50 20 50 30 3 3CS-304 Elective Course II 50 20 50 30 3 3

CS-305 Compiler Design 50 30 50 30 - - 2

CS-306 Seminar 50 30 - - - - 4





900250 14 10 20

Semester 4

Subject

CodeSubject Paper




CS-401SYSTEM DEVELOPMENT

PROJECT200 120 100 30 2


5/91


Important information regarding the CS-204/CS-304: Elective Course

Please note that, one elective from the following list to be opted for each of the semesters

2nd and 3rd (CS-204 in semester two and CS-304 in semester three respectively) accordingto prerequisite conditions (if any).

List of Elective Courses1. Advanced Algorithms2. Functional Programming3. Linux Kernel Programming and Introduction to Device Drivers4. Natural Language Processing5. Program Analysis6. DOT NET7. Information Systems Security

8. Software Architecture and Design Patterns9. Software Testing Tools & Methodologies10. Modeling and Simulations11. Embedded System Programming12. Language Processors13. Artificial Intelligence


6/91


M.Sc.(Computer Science)

1 First Year Semester-1


7/91


1.1 CS-101: Principles of Programming Languages

Course Prerequisites:

It is assumed that student learning this course have the following background:

Experience with an OOP language (such as Java or C++)Experience with a procedural language (such as C)Working knowledge of C, C++, and Java programming.Basic algorithms and data structure concepts.

Why to study this course?

To allow Informed Design DecisionsGives insight when debuggingPermits effective use of compilers/linkers interpreters and language oriented tools.Helps to understand how language features work.Learn features, emulate missing features.Develop a greater understanding of the issues involved in programming language design andimplementationDevelop an in-depth understanding of functional, logic, and object-oriented programmingparadigmsImplement several programs in languages other than the one emphasized in the corecurriculum (Java/C++)Understand design/implementation issues involved with variable allocation and binding,control flow, types, subroutines, parameter passingDevelop thorough understanding of the compilation processTo introduce several different paradigms of programming

To gain experience with these paradigms by using example programming languagesTo understand concepts of syntax, translation, abstraction, and implementation

Course Objectives:

This course will prepare you to think about programming languages analytically:- Separate syntax from semantics- Compare programming language designs- Learn new languages more quickly- Use standard vocabulary when discussing languages- Understand basic language implementation techniques

This course focuses on both:- Theory is covered by the textbook readings, lectures, and on the tests- Implementation is covered by the homework assignments


8/91


Unit-1

1. Introduction

The Art of Language DesignThe Programming Language SpectrumWhy Study Programming Languages?

Compilation and InterpretationProgramming Environments

2. Non-Imperative Programming Models: Functional, Logic Languages

Common LISP

Basic LISP Primitives( FIRST, REST, SETF, CONS, APPEND, LIST,NTHCDR, BUTLAST,LAST,LENGTH, REVERSE, ASSOC)

Procedure definition and binding, DEFUN, LETPredicates and Conditional,

EQUAL, EQ, EQL, =, MEMBER, LISTP, ATOM, NUMBERP,SYMBOLP, NIL, NULL, IF, WHEN, UNLESS,COND, CASE

Procedure Abstraction and Recursion

Turbo PrologIntroduction, facts, Objects and Predicates, Variables, Using Rules, Controlling execution failand cut predicates

3. Names, Scopes, and Bindings

The Notion of Binding Time Object Lifetime and Storage Management : Static Allocation, Stack-Based Allocation, Heap-Based Allocation, Garbage Collection Scope Rules

o Static Scoping, Nested Subroutines, Declaration Order, Dynamic Scoping The meaning of Names in a Scope

o Aliases, Overloading, Polymorphism and Related Concepts The Binding of Referencing Environments Subroutine Closures, First-Class Values and Unlimited Extent, Object Closures Macro Expansion

Unit-24. Control Flow

Expression Evaluationo Precedence and Associativity, Assignments, Initialization, Ordering Within

Expressions, Short-Circuit Evaluation


9/91


Structured and Unstructured Flowo Structured Alternatives to gotoo Sequencingo Selection

o Short-Circuited Conditions, Case/Switch Statementso Iterationo Enumeration-Controlled Loops, Combination Loops, Iterators, Logicallyo Controlled Loopso Recursiono Iteration and Recursion, Applicative- and Normal-Order Evaluation

Unit-3

5. Data TypesIntroduction

Primitive Data TypesNumeric TypesIntegerFloating pointComplexDecimalBoolean TypesCharacter TypesCharacter String Types

Design IssuesStrings and Their Operations

String Length OperationsEvaluationImplementation of Character String Types

User defined Ordinal typesEnumeration types

DesignsEvaluation

Subrange typesAdas designEvaluation

Implementation fo used defined ordinal typesArray typesDesign issuesArrays and indices

Subscript bindings and array categories, Heterogeneous arrays, Array initializationArray operations, Rectangular and Jagged arrays, Slices, Evaluation, Implementation ofArray Types

Associative ArraysStructure and operations, Implementing associative arrays


10/91


Record typesDefinitions of records, References to record fields, Operations on recordsEvaluation, Implementation of Record types

Union TypesDesign issues, Discriminated versus Free unions, Evaluation

Implementation of Union typesPointer and Reference TypesDesign issues, Pointer operations,Pointer problems

Dangling pointers, Lost heap dynamic variablesPointers in C and C++Reference typesEvaluationImplementation of pointer and reference types

Representation of pointers and referencesSolution to dangling pointer problem

Heap management6. Subroutines and Control Abstraction.

Fundamentals of SubprogramsDesign Issues for subprogramsLocal Referencing EnvironmentsParameter-Passing MethodsParameters That are SubprogramsOverloaded SubprogramsGeneric Subroutines

Generic Functions in C++Generic Methods in Java

Design Issues for FunctionsUser-Defined Overloaded OperatorsCoroutinesThe General Semantics of Calls and ReturnsImplementing Simple SubprogramsImplementing Subprograms with Stack-Dynamic Local VariablesNested SubprogramsBlocksImplementing Dynamic Scoping

Unit-4

7. Data Abstraction and Object Orientation.Object-Oriented ProgrammingEncapsulation and Inheritance

Modules, Classes, Nesting (Inner Classes), Type Extensions, Extendingwithout Inheritance

Initialization and Finalization


11/91


Choosing a Constructor, References and Values, Execution Order, GarbageCollection

Dynamic Method BindingVirtual- and Non-Virtual Methods, Abstract Classes, Member Lookup,Polymorphism, Object Closures

Multiple InheritanceSemantic Ambiguities, Replicated Inheritance, Shared Inheritance,Mix-In Inheritance

Unit-5

8. ConcurrencyIntroduction

Multiprocessor ArchitectureCategories of concurrencyMotivations for studying concurrency

Introduction to Subprogram-level concurrency

Fundamental conceptsLanguage Design for concurrency, Design Issues

SemaphoresIntroductionCooperation synchronizationCompetition SynchronizationEvaluation

MonitorsIntroductionCooperation synchronizationCompetition SynchronizationEvaluation

Message PassingIntroductionThe concept of Synchronous Message Passing

Java ThreadsThe Thread class, PrioritiesCompetition SynchronizationCooperation Synchronization, Evaluation

Text Books:1.Scott Programming Language Pragmatics, 3e(With CD) ISBN 9788131222560Kaufmann Publishers, An Imprint of Elsevier, USA2. Concepts of Programming Languages, Eighth Edition by Robert W. Sebesta,Pearson Education.3. Introduction to Turbo Prolog by Carl Townsend4. LISP 3rd edition by Patrick Henry Winston & Berthold Klaus Paul Horn (BPB)Additional Reading:Programming Languages: Principles and Paradigms, M. Gabbrielli, S. Martini, Springer,ISBN: 9781848829138


12/91


1.2 CS102 - Advanced NetworkingUnit-1

1. Review of Basic ConceptsTCP/IP Protocol SuiteUnderlying Technologies : LAN (802.3)

Wireless Lans (802.11)Point-to-point WANSSwitched WANS

2. The Internet Layer ProtocolsReview of IPv4 ProtocolIPv6Transition from IPv4 to IPv6ICMPv4ICMPv6

3. Routing ProtocolsForwarding

Structure of a RouterRouting TablesIntraAnd Inter-Domain RoutingDistance Vector RoutingRIPOSPFBGPMulticast Routing

Unit-2

4. The Transport LayerThe Transport Service

Elements of Transport ProtocolsUDPTCP

5. MultimediaDigitizing Audio and VideoStreaming stored Audio / VideoStreaming Live Audio / VideoReal-Time Interactive Audio / VideoRTPRTCPVoice Over IP

Unit-36. Introduction To Security

The need for SecuritySecurity ApproachesPrinciples of SecurityTypes of Attacks

7. Cryptography: Concepts and TechniquesIntroduction


13/91


Plain Text and Cipher TextSubstitution TechniquesTransposition TechniquesSymmetric and Asymmetric keycryptography

Unit-48. Symmetric Key AlgorithmsAlgorithms types and modesDES

9. Asymmetric key AlgorithmsRSASymmetric and Asymmetric key CryptographyDigital Signatures

10. Digital CertificatesIntroductionDigital Certificates

Unit-511. Internet Security ProtocolsSecure Socket LayerTLSSHTTPTSPSETSSL Verses SET3-D Secure ProtocolElectronic MoneyEmail SecurityFirewallsIP SecurityVPN

12. User AuthenticationPasswordsCertificate-based AuthenticationKerberosSecurity Handshake Pitfalls

Text Books:TCP / IP Protocol Suite Fourth EditionBehrouz A. Forouzan

Computer Networks Fourth EditionAndrew Tanenbaum

Cryptography and Network Security Second EditionAtul KahateSupplementary but very useful references/texts: (Few of the references below contain latestresearch and trends related to Networks and Security and are useful for seminar/presentations bythe students.)1. Computer Network Security, Kizza, Springer, 97803872047342. Guide to Computer Network Security, Kizza, Springer, 978-1-84800-916-53. Network Security, Harrington, Elsevier, ISBN 97881312021664. Douglas E. Comer, Internetworking with TCP/IP, Vol. 1, Principles, Protocols


14/91


and Architecture Fifth Edition, Prentice Hall, 2000, ISBN 0-13-018380-6.5. William Stallings, Data and Computer Communications , Seventh Edition,Pearson Education6. Douglas E. Comer, Internetworking with TCP/IP, Vol. 2, Design, Implementationand Internals, Prentice Hall Publisher.

7. Internetworking with TCP/IP, Vol. 3, Client-server Programming andApplications by Douglas E. Comer, Prentice Hall Publisher. (Excellent referencefor distributed programming over TCP/IP networks)8. Richard Stevens, TCP/IP Illustrated, Vol. 1, by, Addison Wesley (A very practicalbook with lots of useful network diagnostic tools and programs.)9. Craig Hunt, TCP/IP Network Administration OReilly & Associates, Inc. (A mustfor network and system administrators dealing with internetworking.)10. L. Peterson and B. Davie. Morgan , Computer Networks: A Systems Approach byKaufmann Publishers Inc., ISBN 978813121045111. J. Kurose, K. Ross ``Computer Networking: A Top-Down Approach Featuring theInternet'' Addison-Wesley, '00

12. William Stallings," Cryptography And Network Security Prentice Hall /PearsonEducationGuidelines to paper setters:Frame formats of protocols are not expectedProblems should be asked on Routing Protocols , TCP, Cryptography, RSA


15/91


1.3 CS-103: Distributed Database ConceptsPre-requisites: Students should be well-versed with the basic and advanced concepts ofRDBMSObjectives:Main objective is to understand the principles and foundations of distributed databases. This

course addresses architecture, design issues, integrity control, query processing and optimization,transactions, and concurrency control & distributed transaction reliability.

Unit-1

Distributed databases: An overviewFeatures of distributed Vs centralized databasesWhy DDB? DDBMSPromises / problem areas in implementing a DDBDDBMS ArchitectureDBMS StandardizationArchitectural models for DDBMSDDBMS architecture

Distributed catalog managementUnit-2

Distributed database designAlternative design strategiesDistributed design issuesConcepts of join graphsFragmentation and allocationOverview of Query processing

Query processing problems Objectives of query processingComplexity of relational algebra operatorsCharacterization of query processorsLayers of query processing

Unit-3Query decomposition & data localization

Query decomposition Optimization of distributed queriesQuery optimization

Centralized query optimization Join ordering in fragment queries. Distributed query

optimization algorithmsCentralized query optimizationJoin ordering in fragment queriesDistributed query optimization algorithms

Unit-4

Management of distributed transactionsFramework for transaction managementSupporting atomicity of distributed transactionsConcurrency control of distributed transactionsArchitectural aspects of distributed transactions


16/91


Concurrency controlFoundations of distributed concurrency controlDistributed deadlocksConcurrency control based on timestampsOptimistic methods for distributed concurrency control

Unit-5

Distributed DBMS reliabilityReliability concepts & measuresFailures in DDBMSLocal reliability protocolsDistributed reliability protocolsDealing with site failuresNetwork partitioning

Reference Books:

1. Principles of Distributed Database Systems; 2nd Edition By M. Tamer Ozsu and PatrickValduriez Publishers: Pearson Education Asia ISBN: 81-7808-375-22. Distributed Database; Principles & Systems By Stefano Ceri and Giuseppo PelagattiPublications: McGraw-Hill International Editions ISBN: 0-07-010829-33. Database systems (2nd edition) By Raghuramakrishnan and Johannes


17/91


1.4 CS-104: Design and Analysis of AlgorithmsPrerequisites

Basic algorithms and data structure concepts.Basic programming conceptsObjectives

This course will prepare students inBasic Algorithm Analysis techniques and understand the use o asymptotic notationUnderstand different design strategiesUnderstand the use of data structures in improving algorithm performanceUnderstand classical problem and solutionsLearn a variety of useful algorithmsUnderstand classification o problems

Unit-1

AnalysisAlgorithm definition, space complexity, time complexity, worst casebest caseaverage casecomplexity, asymptotic notation, sorting algorithms (insertion sort, heap sort) , sorting in lineartime, searching algorithms, recursive algorithms ( Tower of Hanoi , Permutations).

Unit-2

Design strategiesDivide and conquer-control abstraction, binary search, merge sort, Quick sort, Strassens matrixmultiplicationGreedy method- knapsack problem, job sequencing with deadlines,Minimum-cost spanning trees, Kruskal and Prims algorithm, optimal storage on tapes, optimalmerge patterns, Huffman coding

Unit-3

Dynamic programming- matrix chain multiplication, . single source shortest paths, Dijkstrasalgorithm, Bellman- ford algorithm , all pairs shortest path, longest common subsequence, stringediting, 0/1 knapsack problem, Traveling salesperson problem.

Unit-4

Decrease and conquer: - DFS and BFS, Topological sorting, connected componentsBacktracking: General method, 8 Queens problem, Sum of subsets problem, graph coloringproblem, Hamiltonian cycle

Unit-5

Branch and Bound Technique : FIFO, LIFO, LCBB, TSP problem, 0/1 knapsack problemTransform and conquer:- Horners Rule and Binary Exponentiation Problem ReductionProblem classificationNondeterministic algorithm, The class of P, NP, NP-hard and NP- Complete problems,significance of Cooks theorem


18/91


Text BooksEllis Horowitz, Sartaj Sahni & Sanguthevar Rajasekaran, Computer Algorithms, Galgotia.T. Cormen, C. Leiserson, & R. Rivest, Algorithms, MIT Press, 1990 1

References Texts

1) A. Aho, J. Hopcroft, & J. Ullman, The Design and Analysis of Computer Algorithms,Addison Wesley, 19742) Donald Knuth, The Art of Computer Programming (3 vols., various editions, 1973-81),Addison Wesley3) The Algorithm Manual, Steven Skiena, Springer ISBN:97881848986514) Graphs, Networks and Algorithms, Jungnickel, Springer, ISBN: 3540219056


19/91


1.5 CS-105- Seminar

Suggested List of Seminar Topics:

Wireless Security

Wi-Fi and WIMAX

Digital Certificates and Digital Signatures

Mobile Security

Public Key Infrastructure


20/91


1.6 CS-106: Practical Based on Course-CS-101Principal of Programming Language

LISP

Sample Set:

1. Define a LISP function to compute sum of squares.

2. Define a LISP function to compute difference of squares. (if x > y return x 2-y2, otherwise y2-

x2)

3. Define a Recursive LISP function to solve Ackermanns Function.

4. Define a Recursive LISP function to compute factorial of a given number.

5. Define a Recursive LISP function which takes one argument as a list and returns last element

of the list. (do not use last predicate)

6. Define a Recursive LISP function which takes one argument as a list and returns a list exceptlast element of the list. (do not use butlast predicate)

7. Define a Recursive LISP function which takes one argument as a list and returns reverse of

the list. (do not use reverse predicate)

8. Define a Recursive LISP function which takes two arguments first, an atom, second, a list,

returns a list after removing first occurrence of that atom within the list.

9. Define a Recursive LISP function which appends two lists together.

10. Define a recursive LISP function which takes 2 lists as arguments and returns a list

containing alternate elements from each list.

e.g. if L1=(1 5 7) and L2=(2 4 9 3) output should be (1 2 5 4 7 9 3)

Prolog:

Sample Set of:

1. Prolog programs doing formal reasoning and resolutions proofs.

e.g. Consider the following statements: John likes all kinds of food. Apples are food.

Chicken is food. Anything anyone eats, and is still alive, means whatever he ate was a food.

Sue eats everything Bill eats. Bill eats Peanuts and is still alive. Write a Prolog program to

prove that John likes Peanuts, and to answer the question What food does Sue eat?

2. Simple Prolog programs using facts, rules, built-in I/O predicates, fail, recursion with or

without repeat predicate, and cut predicate.


21/91


1.7 CS -107Practical Based on Course: CS-102Suggested List

1.Write a C prog that contains a string (char pointer) with a value Hello World .The program

should XOR each character in this string with 0 & display the result. Repeat the exercise by an

XOR operation with 1.

2. Study phishing in more detail. Find out which popular bank sites have been phished and how .

3. Think about offering phishing prevention techniques. Which ones of them would be most

effective and why ?

4. Encrypt the following message by using ___________ technique. Key is _____.

5. Write C/Java program to implement DES algorithm logic.

6. Write C/Java program that generate the message digest of a given number.

7. Write a Java prog , which accepts the details of a base-64 encoded digital certificate, parses itand displays its main contents such as issuer name, serial number, subject name , valid from and

valid to.

8. Write a C program to perform Base-64 encoding on a 24 bit input.

9. SSL talks about security at the transport layer. What if we want to enforce security at the

lower layers

10. Investigate how to use SSL in Java & .Net. Write an SSL client and server in these

technologies.

11. Implement Kerberos.

. Download &Study at least one free real life firewall product.

13.Study how VPN is implemented.


22/91


1.8 CS -108 Practical based on Course CS-103Suggested Topic-

1. Problems on Fragmentation: Small case studies, where each case specifies the database

schema, the workload for the database is given. Based on this info, the fragmentation has to

be done ( horizontal or vertical)

2. Problems on deriving & classifying the join graphs, given the relation fragments, of a

database

3. Problems on query optimization ( Exrecise problems given in reference book , Database

systems By Raghuramakrishnan ( the 3rd reference book given in the syllabus)

4. Problems on concurrency control algorithms (similar to the problems given in exercises of

reference book 1 & 2)


23/91


1.9 CS -109Practical Based on Course-CS-104

1. Problem Assignments

A set of problems from the exercises of Text Book can be given as problem solving assignments

2. Programming AssignmentImplementing a set of algorithms And comparing their performance on an input set.


24/91


M.Sc. (Computer Science)

2

First Year Semester-2


25/91


2.1 CS-201: Digital Image ProcessingUnit-1

Introduction

Definition of Digital Image Processing, The Origins of Digital Image Processing, Examples ofFields that Use Digital Image Processing - X-ray Imaging, Ultraviolet Band, Visible and InfraredBands, Microwave Band, and Radio Band Imaging; Fundamental Steps in Digital ImageProcessing, Components of an Image Processing System,

Digital Image FundamentalsElements of Visual Perception, Light and the Electromagnetic Spectrum, Image Sensing andAcquisition - Single Sensor, Sensor Strips, Sensor Arrays, A Simple Image Formation Model;Image Sampling and Quantization - Spatial and Gray-Level Resolution, Aliasing and MoirPatterns, Zooming and Shrinking Digital Images; Some Basic Relationships Between Pixels -Neighbors, Adjacency, Connectivity, Regions, and Boundaries, Distance Measures, Image

Operations on a Pixel Basis; Linear and Nonlinear OperationsUnit-2

Image Enhancement in the Spatial DomainSome Basic Gray Level Transformations - Negatives, Log, Power-Law, Piecewise-LinearTransformations; Histogram Processing - Histogram Equalization, Histogram Matching(Specification), Local Enhancement; Enhancement Using Arithmetic/Logic Operations - ImageSubtraction, Image Averaging; Basics of Spatial Filtering, Smoothing Spatial Filters - SmoothingLinear and Order-Statistics Filters; Sharpening Spatial Filters - Use of Second Derivatives forEnhancement : The Laplacian, Use of First Derivatives for Enhancement: The Gradient;Combining Spatial Enhancement Methods

Image Enhancement in the Frequency DomainIntroduction to the Fourier Transform and the Frequency Domain - One-Dimensional FourierTransform and its Inverse, Two-Dimensional DFT and Its Inverse, Filtering in the FrequencyDomain, Correspondence between Filtering in the Spatial and Frequency Domains; Smoothingand Frequency-Domain Filters - Ideal , Butterworth, and Gaussian Lowpass Filters; SharpeningFrequency Domain Filters - Ideal , Butterworth, and Gaussian Highass Filters, Laplacian in theFrequency Domain, Unsharp Masking, High-Boost Filtering, and High-Frequency EmphasisFiltering; Homomorphic Filtering Implementation - Some Additional Properties of the 2-DFourier Transform, Computing the Inverse Fourier Transform Using a Forward TransformAlgorithm, More on Periodicity: the Need for Padding, The Convolution and CorrelationTheorems, Summary of Properties of the 2-D Fourier Transform, The Fast Fourier Transform;

Unit-3Image RestorationA Model of the Image Degradation/Restoration Process, Noise Models, Restoration in thePresence of Noise OnlySpatial Filtering - Mean, Order-Statistics, and Adaptive Filters Filters;Periodic Noise Reduction by Frequency Domain Filtering - Bandreject, Bandpass, and NotchFilters Filters; Estimating the Degradation Function - Estimation by Image Observation,Experimentation and Modeling; Inverse Filtering, Minimum Mean Square Error (Wiener)Filtering, Geometric Mean


26/91


Filter - Geometric Transformations, Spatial Transformations, Gray-Level Interpolation

Unit-4

Color Image ProcessingColor Fundamentals, Color Models - RGB, CMY, HSI; Pseudocolor Image Processing

Intensity Slicing, Gray Level to Color Transformations; Basics of Full-Color Image Processing,ColorTransformations - Formulation, Color Complements, Color Slicing, Tone and Color Corrections,Histogram Processing; Smoothing and Sharpening, Color Segmentation, Color Edge Detection,Noise in Color Images

Morphological Image ProcessingSome Basic Concepts from Set Theory, Logic Operations Involving Binary Images, Dilation andErosion, Opening and Closing, The Hit-or-Miss Transformation, Some Basic MorphologicalAlgorithms - Boundary Extraction, Region Filling, Extraction of Connected Components,Convex Hull, Thinning, Thickening; Extensions to Gray-Scale Images

Unit-5Image SegmentationDetection of Discontinuities - Point Detection, Line Detection, Edge Detection, Edge Linkingand Boundary Detection - Local Processing, Global Processing via the Hough Transform,Thresholding- The Role of Illumination, Basic Global Thresholding, Basic Adaptive Thresholding, OptimalGlobal and Adaptive Thresholding, Use of Boundary Characteristics for Histogram Improvementand Local Thresholding, Thresholds Based on Several Variables, Region-Based Segmentation -Region Growing, Region Splitting and Merging,

Representation and DescriptionChain Codes, Polygonal Approximations, Signatures, Boundary Segments, Skeletons, SimpleBoundary Descriptors, Shape Numbers, Fourier Descriptors, Statistical Moments, SimpleRegional Descriptors, Topological Descriptors, Texture, Moments of Two-DimensionalFunctions Use of Principal Components for Description, Relational Descriptors

Text Book:1. Gonzalez, R. C. and Woods, R. E. [2002/2008], Digital Image Processing, 2nd/3rd ed.,Prentice HallReference Books:1. Sonka, M., Hlavac, V., Boyle, R. [1999]. Image Processing, Analysis and Machine Vision (2 nd edition), PWS Publishing, or (3rd edition) Thompson Engineering, 20072. Gonzalez, R. C., Woods, R. E., and Eddins, S. L. [2009]. Digital Image Processing UsingMATLAB, 2nd ed., Gatesmark Publishing, Knoxville, TN.3. Anil K. Jain [2001], Fundamentals of digital image processing (2nd Edition), Prentice-Hall,NJ4. Willian K. Pratt [2001], Digital Image Processing (3rd Edition), , John Wiley & Sons, NY5. Burger, Willhelm and Burge, Mark J. [2008]. Digital Image Processing: An AlgorithmicIntroduction Using Java, Springer6. Digital Image Analysis (With CD-ROM), Kropatsch, Springer, ISBN 978038795066


27/91


7. Digital Image Processing, 6e (With CD), Jhne, Springer, ISBN:978-3-540-24035-8 2

2.2 CS-202: Advanced Operating SystemPrerequisites:

Working knowledge of C programming. Working knowledge of NASM/GAS assembler for 80x86 (32 and 64 bit) instruction Set Basic Computer Architecture concepts. Basic algorithms and data structure concepts.

Course Objectives:This course teaches Advanced Operating Systems Concepts using Unix/Linux and Windows asrepresentative examples. This course strikes a delicate balance between theory and practicalapplications In fact, most chapters start with the theory and then switches focus on how theconcepts in a C program. This course describes the programming interface to the Unix/Linuxsystem - the system call interface. It is intended for anyone writing programs that run under

Unix/Linux. Finally, it concludes with an overview of Windows Internals. This course providesan understanding of the functions of Operating Systems. It also provides provide an insight intofunctional modules of Operating Systems. It discusses the concepts underlying in the design andimplementation of Operating Systems. This course also gives implementation details at lowerlevel using Assembly language Programming by creating some interest in system call design.

Syllabus:Unit-1

1. Introduction to UNIX/Linux Kernel

System Structure, User Perspective, Assumptions about Hardware, Architecture ofUNIX Operating System. Concepts of Linux Programming, Getting Started with System Programming. Introduction to the tools on Linux, NASM

2. File and Directory I/O

inodes, structure of regular file, open, read, write, lseek, close, pipes, dup open, creat, close, lseek, read, write, file sharing, atomic operations, dup and dup2,

fcntl, ioctl, /dev/fd, stat, fstat, lstat, file types, Set-User-ID and Set-Group-ID, fileaccess permissions, ownership of new files and directories, access function, umaskfunction, chmod and fchmod, sticky bit, chown, fchown, and lchown, file size, filetruncation, file systems, link, unlink, remove, and rename functions, symbolic links,

symlink and readlink functions, file times, utime, mkdir and rmdir, readingdirectories, chdir, fchdir, and getcwd, device special files.

Scatter/Gather I/O, The Event Poll Interface, Mapping Files into Memory, Advice forNormal File I/O, Synchronized, Synchronous, and Asynchronous Operations, I/OSchedulers and I/O Performance, Files and their Metadata, Directories, Links, Copyingand Moving files, Device Nodes, Out-of-Band Communication, Monitoring File Events.


28/91


Unit-2

3. Process Environment, Process Control and Process Relationships

Process states and transitions, the context of a process, saving the context of aprocess, sleep, process creation, signals, process termination, awaiting process

termination, invoking other programs, the user id of a process Process termination, environment list, memory layout of a C program, shared

libraries, memory allocation, environment variables, setjmp and longjmp, getrlimitand setrlimit, process identifiers, fork, vfork, exit, wait and waitpid, waitid, wait3 andwait4, race conditions, exec, changing user IDs and group IDs, interpreter files,system function, process accounting, user identification, process times, Terminallogins, network logins, process groups, sessions, controlling terminal, tcgetpgrp,tcsetpgrp, and tcgetsid functions, job control, shell execution of programs, orphanedprocess groups.

The Process ID, Running a New Process, Terminating a Process, Waiting for TerminatedChild Processes, Users and Groups, Sessions and Process Groups, Daemons, Process

Scheduling, Yielding the Processor, Process Priorities, Processor Affinity .Unit-3

4. Memory ManagementThe Process Address Space, Allocating Dynamic Memory, Managing Data Segment,Anonymous Memory Mappings, Advanced Memory Allocation, Debugging MemoryAllocations, Stack-Based Allocations, Choosing a Memory Allocation Mechanism,Manipulating Memory, Locking Memory, Opportunistic Allocation.

Unit-4

5. Signal Handling

Signal concepts, signal function, unreliable signals, interrupted system calls, reentrantfunctions, SIGCLD semantics, reliable-signal technology, kill and raise, alarm andpause, signal sets, sigprocmask, sigpending, sigaction, sigsetjmp and siglongjmp,sigsuspend, abort, system function revisited, sleep, job-control signals.

Signal Concepts, Basic Signal Management, Sending a Signal, Reentrancy, SignalSets, Blocking Signals, Advanced Signal Management, Sending a Signal with aPayload.

Unit-5

6. Windows Internals

Foundation Concepts, utilities and Terms

Services, Functions, and Terms, Processes, Threads, and Jobs, Virtual Memory, KernelMode vs. User Mode Introduction to the Sysinternals Troubleshooting Utilities (File and Disk, Process,

Security, System Information and Miscellaneous Utilities) System Architecture Requirements and Design Goals, OS Model, Architecture Overview

(Portability, Symmetric Multiprocessing) Process Internals


29/91


Data Structures, Kernel variables, Performance Counters, Relevant Functions Protected Processes Flow ofCreateProcess Stage 1 through Stage 7, New Process Thread Internals

Data Structures, Kernel Variables, Performance Counters, Relevant Functions, Birth of aThread

Examining Thread Activity Limitations on Protected Process Threads Worker Factories (Thread Pools) Thread Scheduling Overview of Windows Scheduling, Priority Levels, Windows Scheduling APIs, Relevant

Tools, Real-Time Priorities, Thread States, Dispatcher Database, Quantum, SchedulingScenarios, Context Switching, Idle Thread,Priority Boosts

Job Objects

Recommended Text:1. Linux System Programming, OReilly, by Robert Love.

2. Windows Internals, Microsoft Press, by Mark E. Russinovich and David A. Soloman.3. The Design of the UNIX Operating System, PHI, by Maurice J. Bach.4. Advanced Programming in the UNIX Environment, Addison-Wesley, by Richard Stevens.5. Guide to Assembly Language Programming in Linux, Sivarama P. Dandamudi, Springer6. Professional Assembly Language, Richard Blum, Wrox, Wiley India


30/91


2.3 CS-203: Data Mining and Data WarehousingUnit-1

Introduction to Data Mining

Basic Data Mining TasksDM versus Knowledge Discovery in DatabasesData Mining IssuesData Mining MetricsSocial Implications of Data MiningOverview of Applications of Data Mining

Introduction to Data Warehousing

Architecture of DWOLAP and Data CubesDimensional Data Modeling-star, snowflake schemasData PreprocessingNeed, Data Cleaning, Data Integration & Transformation, Data

ReductionMachine LearningPattern Matching

Unit-2Data Mining Techniques

Frequent item-sets and Association rule mining: Apriori algorithm,Use of sampling for frequent item-set, FP tree algorithmGraph Mining: Frequent sub-graph mining, Tree mining, Sequence Mining

Unit-3

Classification & Prediction

Decision tree learning:Construction, performance, attribute selectionIssues: Over-fitting, tree pruning methods, missing values,continuous classesClassification and Regression Trees (CART)Bayesian Classification:

Bayes Theorem, Nave Bayes classifier,Bayesian NetworksInference

Parameter and structure learningLinear classifiersLeast squares, logistic, perceptron and SVM classifiers

PredictionLinear regressionNon-linear regression

Unit-45 Accuracy MeasuresPrecision, recall, F-measure, confusion matrix, cross-validation, bootstrap


31/91


6. Software for data mining and applications of data miningR, Weka, Sample applications of data mining

7. Clusteringk-means

Expectation Maximization (EM) algorithmHierarchical clustering, Correlation clustering

Unit-58. Brief overview of advanced techniquesActive learningReinforcement learningText miningGraphical modelsWeb Mining

Reference Books:

1. Data Mining: Concepts and Techniques, Han, Elsevier ISBN:9789380931913/97881312053582. Margaret H. Dunham, S. Sridhar, Data MiningIntroductory and Advanced Topics, PearsonEducation

3. Tom Mitchell, Machine Learning, McGraw-Hill, 1997

4. R.O. Duda, P.E. Hart, D.G. Stork. Pattern Classification. Second edition. John Wiley andSons, 2000.

5. Christopher M. Bishop, Pattern Recognition and Machine Learning, Springer 2006

6. Raghu Ramkrishnan, Johannes Gehrke, Database Management Sysstems, Second Edition,McGraw Hill International

7. Ian H.Witten, Eibe Frank Data Mining: Practical Machine Learning Tools and Techniques,Elsevier/(Morgan Kauffman), ISBN:97893805018648. [Research-Papers]: Some of the relevant research papers that contain recent results anddevelopments in data mining field


32/91


2.4 CS-206: Practical based on course CS-201Image Processing

Fundamentals and Coding Practice1. Design 128, 64, 32, 16, 8 and 4-level uniform quantizers and quantize the gray-level image,lena.pgm. Compare the results by these six different quantizers. Explain the artifacts (e.g., the

visibility of undesirable contours).2. Divide the image lena.pgm into blocks and each block has the size 4 x 4 pixels. Replace eachblock by the intensity of the (2,2) pixel within the block. The new image will be 1/4th the sizein both dimensions. Display the down-sampled imageSpatial Transforms and Filtering3. Apply power law transformation to the city.pgm image taking different values for gamma

( = 3, = 4, and = 5).4. Compute and plot (show the image and its histogram) the histogram oflena.pgm and city.pgm.Comment on what information can be discerned about the images from an examination of thehistogram.5. Apply histogram equalization to the input images lcgrain.pgm and darkgrain.pgm; submityour code and the output images.6. Reduce the salt-and-pepper noise in the circuit.pgm image; submit your code and the outputimage.Filtering in Frequency Domain and Image Restoration7. Remove the noise from the input images circuit1.pgm, circuit2.pgm, circuit3.pgm, andmoon.pgm . Submit your code and the output images.8. Restore the original images from the inputs degrade1.pgm, degrade2.pgm and degrade3.pgm.Morphological Image Processing9. Remove the noise from the input image mimage.pgm. Submit your code and the output image.10. Extract the gradient parts from the input image brain.pgm. Perform edge detection.Segmentation and Object recognition

11. Extract the rice objects from the input image rice.pgm.12. Separate the two types of blobs in the input image twoblobs.pgm.13. Develop an imaging application to detect and count human faces in an image.14. Develop an imaging application to detect and count text lines and number of words in ascanned document.NOTE:a) The submitted answer to the assignments should be a maximum of 2 pages plus the relevantfigures.b) All programming should be done using C/C++/Java/OpenCV/MATLAB.c) A copy of your complete program must be attached to your submitted answer as an appendix.


33/91


2.5 CS-207 : Practical Based on Course CS-202

1. Write your own dup2 function that performs the same service as the dup2 system call

without calling the fcntl function. Be sure to handle errors correctly.

2. Write a utility like cp(1) that copies a file containing holes, without writing the bytes of 0 tothe output file.

3. Write a C program that creates azombie, and then call system to execute the ps(1) command

to verify that the process is azombie.

4. Implement your own sig2str function.

5. Write a C program that creates a file and writes the integer 0 to the file. The process then

creates a child, and the Parent and Child alternate incrementing the counter in the file. Each

time the counter is incremented, print which process (Parent or Child) is doing theincrement.

6. Write a C program that calls fork and has the child create a new session. Verify that the child

becomes a process group leader and that the child no longer has a controlling terminal.

7. Write a C function which handles all possible signals. The function should consist of a single

loop that iterates once for every signal in the current signal mask (not once for every possible

signal).

8. Write a C program that calls sleep (60) in an infinite loop. Every five times through the loop

(every 5 minutes), fetch the current time of day and print the tm_sec field.

9. Write a C program that calls fwrite with a large buffer (a few hundred megabytes). Before

calling fwrite, call alarm to schedule a signal in 1 second. In your signal handler, print that

the signal was caught and return.

10. Any one assignment on windows internals (Compulsory) (Please note that you are not

expected to write sdk program related to windows programming).

11. Write as many programs in Assembly as you can for getting familiar with Assembly

Programming, binutils(tool chain for system programmers), OS services on Linux, Theseprograms should make use of system calls related to memory management, process

management, file management etc) (Minimum 5 programs Compulsory)

12. Understanding how the utilities of Sys-internals suit are useful for system programmer point

of view.


34/91


2.6 CS-208: Practical Based on CS 203:Practical 1: Using the WEKA WorkbenchA. Become familiar with the use of the WEKA workbench to invoke several

different machine learning schemes. Use latest stable version. Use both the graphicalinterface (Explorer) and command line interface (CLI). See Weka home page for Wekadocumentation.B. Use the following learning schemes, with the default settings to analyze the weather data (inweather.arff). For test options, first choose "Use training set", then choose "Percentage Split"using default 66% percentage split. Report model percent error rate.ZeroR (majority class)OneRNaive Bayes SimpleJ4.8C. Which of these classifiers are you more likely to trust when determining whether to play?

Why?D. What can you say about accuracy when using training set data and when using a separatepercentage to train?Practical 2: Basic classification and usage of wekaBecome familiar with the use of the WEKA workbench to invoke several different machinelearning schemes.Use latest stable version. Use both the graphical interface (Explorer) and command lineinterface (CLI).Use the following learning schemes, with the default settings to analyze the weather data (inweather.arff). For test options, first choose "Use training set", then choose "Percentage Split"using default 66% percentage split. Report model percent error rate.

- ZeroR (majority class)- OneR- Naive Bayes Simple- J4.8Which of these classifiers are you more likely to trust when determining whether to play?Why?What can you say about accuracy when using training set data and when using a separatepercentage to train?Practical 3: ClassificationIBuild different classification models using different classification algorithms (such as decisiontree, naive bayes, bayesian networks) for the IRIS dataset that comes with weka / R.. Compare

the accuracy (precision, recall, F1 measure) of these different classification algorithms.Practical 4: ClassificationIIFor this assignment, you will use the "Iris" data-set from UCI Machine Learning Repository.This data-set considers three classes of flowers : Iris Setosa, Iris Versicolour, Iris Virginica andhas 50 samples from each flower (so a total of 150 samples). For each sample, it records 4features: sepal length in cm; sepal width in cm; petal length in cm; petal width in cmTask:


35/91


1. Divide the data into 2 parts : part I containing a random set of 30 samples, and the rest intopart II.2. Use part I to get prior probabilities of each class.3. First you will use only the first feature to classify the flowers into these 3 classes. Assume thatthe class conditional distribution of "sepal length" is Gaussian for each of the 3 classes.

Estimate the parameters of the three distributions using maximum likelihood estimation. Usedata in part II.4. Using the parameters obtained above, classify the data in part II. Report on the number oferrors.5. Now use all four features in Step 3 above : assume that the class conditional distribution is a 4-dimensional Gaussian. Repeat Step 4.Practical 5: RegressionBuild a linear regression model for the housing dataset from UCI Machine learning repositoryto reduce the dimensionality of data. Which are the features selected in this reduced dataset?Build a linear regression with the reduced dataset? Compare the two models built.


36/91


M.Sc. (Computer Science)

3 Second Year

Semester-3


37/91


3.1 CS301: Software Metrics & Project Management

1. What is Project? What is Project management? Project phases and project lifecycle, organizational structure, Qualities of Project Manager.2. Project Management Components.

Project Integration Management-Project plan development and execution, changecontrols, configuration management.3. Scope Management-Strategic planning, scope planning, definition, verification andcontrol.4. Time management- Activity planning, schedule development and control.5. Cost Management- Cost estimation and Control.6. Quality Management- Quality planning and assurance.7. Human Resource Management- Organizational planning , staff acquisition.8. Communication Management-Information distribution , reporting.9. Risk Management-Risk identification, Quantification and control.10. Procurement Management- Solicitation, contract administration.

11. Software Metrics- The scope of software metrics, software metrics data collection,analyzing software data, measuring size, structure, external attributes.12. Software Reliability- Measurement and prediction, resource measurement, productivity,teams and tools.13. Planning a messurement program.

What is metrics plan?: Developing goals, questions and metrics.Where and When: Mapping measures to activities.How: Measurement tools.Who: Measurers , analyst, tools revision plans.

14. Quality StandardsCMM, PSP/TSP

References :1. Information Technology Project Management

By -Kathy Schwalbe.2. Software Metrics A rigorous and practical approach

ByNorman Fenton, Shari Lawrence Pfleeger.3: Software Engineering By- Roger Presman.


38/91


3.2 CS-302: MOBILE COMPUTING

Prerequisites Concepts of multiplexing and modulation Concepts of Networking

Conversant with OS internals Familiar with event handling

Web browsers Create and Compile Java Programs

Brief History of wireless communication

Objectives To familiarize the students with the buzz words and technology of mobile communication

Understand the GSM architecture

Understand the issues relating to Wireless applications

1. Introduction to Mobile Computing

i. Introduction and need for Mobile computingii. Mobility and portabilityiii. Mobile and Wireless devicesiv. Applicationsv. Brief History of wireless communicationBook1: Mobile Comm. By Jochen Schiller

2. Wireless Transmissioni. General Concepts of multiplexing and modulationii. Spread Spectrumiii. Cellular Systems

iv. Cellular Phone Arrayv. Mobile Phone Technologies (1G, 2G, 2.5G, 3G)Book1: Mobile Comm. By Jochen Schiller

3. Medium Access Control Layeri. Why specialized MAC?- hidden and exposed terminals- near and far terminalsii. General Concepts and comparison of SDMA, FDMA, TDMA , CDMABook1: Mobile Comm. By Jochen Sciller

4. Global System for Mobile Comm.i. Mobile Services (Bearer, Tele-and-supplementary services)ii. System Architecture- Radio subsystem- Network and switching subsystem- Operation subsystemiii. Protocols- Localization and calling


39/91


- Handoveriv. Value Added Services

- SMSArchitecture, Mobile Originated and Mobile Terminatedprocedures

- Cell Broadcast ServiceArchitecture, Message Transfer Procedure- MMS

Architecture, Protocol framework, Message TransferProcedure- Location Services

Logical Reference Model, Control Procedures, NetworkArchitecture, determination of Location Information, Locationbased servicesv. GPRSBook1: Mobile Comm. By Jochen Schiller

Book5:2G Mobile Networks: GSM and HSCSD By NishitNarang and Sumit Kasera

5. Mobile IPi. Goals, assumptions and requirementsii. Entities and terminologiesiii. Agent Discoveryiv. Registrationv. Tunneling and encapsulationvi. Reverse Tunnelingvii. IPv6viii. IP micro-mobility supportCellular IP, Hawaii, Hierarchicalmobile IPv6ix. Mobile Routing :Destination sequence distance Vector, Dynamic Source Routing,Alternative Matrix, Adhoc Routing Protocols -Flat, Hierarchical,Geographic-position-assistedBook1: Mobile Comm. By Jochen Schiller

6. Mobile TCPi. Traditional TCP- Congestion Control, Slow start, Fast retransmit / Fast recovery- Implications on mobilityii. Classical TCP improvementsIndirect TCP, Snooping TCP, Mobile TCP, Fast retransmit / Fastrecovery, Transmission / Timeout freezing, SelectiveRetransmission, Transaction oriented TCPiii. TCP over 2.5/3G wireless networksBook1: Mobile Communications By Jochen Schiller


40/91


7. Wireless Application Protocol

i. Architectureii. Wireless datagram protocoliii. Wireless transport layer security

iv. Wireless transaction protocolv. Wireless session protocolvi. Wireless application environmentvii. WMLviii. WML Scriptsix. Push Architecturex. PushPull ServicesBook1: Mobile Communications by Jochen Schiller

8. Platform/Operating Systemsi. Palm OS

ii. Windows CEiii. Embedded Linuxiv. J2ME (Introduction)v. Symbian (Introduction)vi. File Systems (Book1)Book2: Pervasive ComputingBook1: Mobile Comm. By Jochen Schiller

9. Java for Wireless Devicesi. Setting up the development environmentii. Basic Data types, Libraries (CLDC, MIDP)

Any J2ME book

10. UI Controlsi. Displayable and Display

- Image- Events and Event Handling- List and choice- Text box- Alerts

Any J2ME book11. Persistent Storage

i. Record Storesii. Recordsiii. Record EnumerationAny J2ME book

12. Network MIDletsi. The Connection Frameworkii. Connection Interface


41/91


iii. Making a connection using HTTPiv. Using datagram connectionAny J2ME book

13. Wireless Messaging

i. Architecture for Messaging applicationii. Messaging APIiii. Types of applicationsiv. Pros and cons of messaging

References: http://java.sun.com/products/wmahttp://forum.nokia.com

Books1. Mobile Communications Jochen Schiller, Pearson Education, 2nd Edition2. Pervasive Computing Technology and Architecture of Mobile Internet Applications

Jochen Burkhardt, Dr. Horst Henn, Steffen Hepper, Klaus Rintdorff, Thomas Schack , PearsonEducation3. Wireless Java Programming with J2ME Yu Feng and Dr, Jun Zhu , Techmedia Publications,1st edition4. Complete Reference J2ME5. Mobile Networks GSM and HSCSDNishit Narang, Sumit Kasera, TataMcGrawHill6. Mobile ComputingAsoke K Talukdar, Roopa R. Yavagal, TataMcGrawHill


42/91


3.3 CS-303 SOFT COMPUTING

1.IntroductionSoft computing paradigms-Neural network-Fuzzy logic-derivation free optimization methods

of Genetics algo.-soft computing characteristics.

2. Fuzzy logicsets-properties-arithmetics-member functions- fuzzy relations-relation equations-fuzzy

measures-types of uncertainity-members of uncertainitiesmeasures of fuzziness-probabilitiesVspossibilities-measures of fuzzy events.

3. Neural computingneuron modelling- learning in simple neuron-perception earning curve-prooflimitations of

perception.

4. Neural networks

Multilevel perception-algo-visualizing network behaviour-B:PN-self organizingnetwork-Kohenen algo.- Hopfield network-adaptive resonance theory-patternclassification.

5. Genetic algoIntroduction- Biological terminology-search space and fitness land scapeselements of genetic

algorithms -Genetic algo in problem solving.

Books1. JS Jang ,C.T. Sun , E.Mizutani, " Neuro-fuzzy and soft computing" Prentice International.2. Simon Haykin " Neural networks - A comprehensive foundation" PHI

3. Melanie Mitchell , " An introduction to Genetic algorithms", PHI


43/91


3.4 CS 305 COMPILER DESIGN

Unit-1Compilers-Grammars-Languages-Phases of compiler-compiler writing tools-Errors-Lexicalphase errors, syntactic phase errors, semantic phase errors

Unit-2

Role of lexical analyzer-input BufferingSpecification and Recognition of tokensLanguage forspecifyingLexical analyzer-Finite Automata-Regular expression to NFA-Optimization of DFA basedpattern matchesDesign of a Lexical Analyzer Generator

Unit-3

Parsers-CFG-derivations and parse trees-capabilities of CFG- Top own parsing-Bottom Up

parsing LR,parsing SLR, parsing LALR, parsing CLR, parsing Operator PrecedencePredictive Parsing.

Unit-4Syntax Directed Translation scheme-Implementation of Syntax Directed Translators-Intermediate code postfix notation, parse trees and syntax trees-Trees three address codeQuadruples, TriplesTranslation of Assignment statementsBoolean expressions-DeclarationFlow control statementsBack patching.

Unit-5

Principal source of optimization-Issues in the design of a code generator-Run-Time storagemanagementBasic blocks and flow graphs Next use information-Simple code generator DAGrepresentation of basic blocks-Peephole optimizationCode Generation

References:1. A.V.Aho, Ravi Sethi,J. D.ullman, Compilersprinciples ,Techniques and tools, AddisonWesley publishing company,1988.2. Allen I.Holub, compiler Design in C, Prentice Hall of India, 1993.3. Kenneth C. Louden, Compiler Construction: Principles & Practice, Thomson Learning 20034. Muchnick, Advanced Compiler Design: Implementation, Acadamic Press.5. Rajini Jindal , Compilers Construction & Design , Umesh Publications , Delhi.2002

6. Ronald Mak ,Writing Compilers and Interpreters, 2nd Edition , John Miler &Sons , 1996 .


44/91


Electives


45/91


1. CS 204/CS 304: Elective Course : Advanced Algorithm

Advanced data structures (Fibonacci heaps, splay trees, dynamic trees, B-Trees) in-memoryrepresentations and persistence of DS, Revision of Graph algorithms: Network flows (maxflow and min-cost flow/circulation)String algorithms: (10 Hrs)o String searching - (KnuthMorrisPratt algorithm, BoyerMoore string searchalgorithm, RabinKarp string search algorithm)o Suffix trees - mathematical properties of suffix treeso Applications of Suffix trees:

regular expression searches using suffix trees; Finding all maximal pairs and maximal repeats, Patricia trees

Intractable problems: approximation algorithms1. Steiner tree and TSP2. Steiner forest3. Group Steiner trees

4. Set cover via primal-dual5. k-median on a cycleInteger programming and optimization algorithms1. Formulations, complexity and relaxations2. discrete optimization,3. cutting plane methods,4. enumerative and heuristic methods5. Convex programming algorithms: ellipsoid method, interior-point methods, proximalpointmethods.Preliminary reading:

Introduction to Algorithms: by Cormen, T.H., C.E. Leiserson, R.L. Rivest, and C. Stein;

MIT Press; ISBN: 9780262032933The Algorithm Manual, Steven Skiena, Springer ISBN:9788184898651Reference Books:

Theory of Linear and Integer Programming: by Schrijver; John Wiley & Sons. ISBN:9780471982326Convex Optimization: by Boyd and Vandenberghe; Cambridge University Press; ISBN:9780521833783Approximation Algorithms: by Vazirani; Springer-Verlag: ISBN: 9783540653677Advances in Steiner Trees (Combinatorial Optimization) by Ding-Zhu Du (Editor), J.M.Smith (Editor), J. Hyam Rubinstein (Editor); Springer; ISBN: 978-0792361107Algorithms On Strings,Trees, And Sequences; by D. Gusfield; Cambridge University Press,(ISBN 052158519)Additional reading:Algorithmic Number Theory: by Bach and Shallit; MIT Press; ISBN: 9780262024051


46/91


2. CS 204/CS 304-Elective Course : Functional ProgrammingUnit-1

Introduction to Functional programmingo Expressions and values.o Functions.

o Recursion.o Types.Introduction to Haskello tupleso polymorphismo higher order functionso strings & characters

Unit-2Data types

o Data-Type declarationso Data and type constructors

o Defining functions over datatypes using patterno Abstract data typeso Polymorphismo Polymorphic Functions,o Polymorphic datatypes,o Type Constructors to define polymorphic Constructor functionso Recursive datatypeso Higher Order functions

Unit-3

The Haskell Class Systemo

Classes as predicates on typeso Instance declarationso Inheritance and dependent classeso Derived instanceso The Show classo The Eq class

Unit-4

Programs and Proofso Equational reasoningo Proofs on program equivalence

Unit-5Monadso IO monado List monado Maybe monado State monadReference BooksHaskell - The Craft of Functional Programming: by Simon Thompson, Addison-Wesley,


47/91


ISBN 0-201-34275-8Types and Programming Languages, by Benjamin C. Pierce; The MIT Press; ISBN0262162091Additional reading:Haskell 98 language and libraries - the Revised Report: by Simon Peyton Jones; Cambridge

University Press; ISBN 0521826144


48/91


3. CS-204/CS 304 -Elective Course: Linux Kernel Programming andIntroduction to Device Drivers

Objectives:

- Important concepts in OS kernel development getting hands-on Knowledge with Linux kernel- Getting to know the device driver programming.

Pre-requisite:Should have done course on Advanced Operating SystemUNIX/LINUX Internals: as Operating System.Usage and Implementation of UNIX/LINUX System CallsCourse Contents

Unit-1

Introduction to the kernel design - monolithic Vs microkernelEmpowering the kernel - drivers and moduleCommunication with the userspaceMemory Management issues in the kernel

Unit-2

Accessing Hardware- address space concepts- memory mapped and I/O- Virtual devices, char devicesHandling hardware events- interrupt handling- timers and polling

Unit-3

Kernel source code organization- Linux kernel sources and organisation- Browsing and understanding the kernel sources- Common Techniques used during Linux kernel programming

Linux module programming- Hello World- Basic Virtual device, char device, mknod,- Debugging typical kernel Oops- strace

Unit-4

Communication with the userspace- ioctls, proc,Accessing Hardware- address space concepts- memory mapped and I/Okobjects and sysfs


49/91


Unit-5

Handling hardware events- interrupt handling, bottom halves, timers- softirq, tasklets and workqueues

Sleeping and Locking- sleeping: interruptible, timed- locking: mutex, semaphores, spinlocksExploring and developing a driver for any peripheral of one embedded device. (Thecollege/Institute has complete freedom to include or exclude this chapter, as per theavailability of proper devices. Not to be asked for any examination)Reference books

Linux kernel development, Robert Love, Pearson, ISBN: 9788131758182Professional Linux Kernel Architecture, Wolfgang Mauerer, Wrox (Wiley India), ISBN9788126519293Understanding the Linux Kernel, Bovet, Cesati, Shroff/O'Reilly ISBN: 9788184040838

Linux Device Drivers, 3rd Edition, Corbet, Rubini, Greg-Kroah Hartman ,Shroff/O'Reilly , ISBN: 8173668493ARM System Developer's Guide: Designing and Optimizing System Software - Sloss,Symes, Wright


50/91


4. CS 204/CS 304- Elective Course : Natural Language Processing

PREREQUISITES1. A previous course on Artificial Intelligence will help.2. Courses of Data Structures and Algorithms should have been done.

3. Exposure to Linguistics is useful, though not mandatory.COURSE OUTLINEWords and Word Forms : Morphology fundamentals; Morphological Diversity of IndianLanguages; Morphology Paradigms; Finite State Machine Based Morphology; AutomaticMorphology Learning; Shallow Parsing; Named Entities; Maximum Entropy Models; RandomFields.Structures : Theories of Parsing, Parsing Algorithms; Robust and Scalable Parsing on NoisyText as in Web documents; Hybrid of Rule Based and Probabilistic Parsing; Scope Ambiguityand Attachment Ambiguity resolution.Meaning : Lexical Knowledge Networks, Wordnet Theory; Indian Language Wordnets andMultilingual Dictionaries; Semantic Roles; Word Sense Disambiguation; WSD and

Multilinguality; Metaphors; Coreferences.Applications of NLP: Sentiment Analysis; Text Entailment; Robust and Scalable MachineTranslation; Question Answering in Multilingual Setting; Cross Lingual Information Retrieval(CLIR).REFERENCES1. Allen, James, Natural Language Understanding, Second Edition, Benjamin/Cumming, 1995.2. Charniack, Eugene, Statistical Language Learning, MIT Press, 1993.3. Jurafsky, Dan and Martin, James, Speech and Language Processing, Second Edition,Prentice Hall, 2008.4. Manning, Christopher and Heinrich, Schutze, Foundations of Statistical Natural LanguageProcessing, MIT Press, 1999.

5. Natural Language Processing and Text Mining, Kao, Springer, ISBN-9781846281754


51/91


5. Elective Course: Program Analysis

Static analysis:Abstract interpretation (dataflow analysis)

Type systems

o simple type systemso type reconstructiono universal and existential polymorphismo subtypingo bounded quantificationo recursive typeso type operators

Model checkingo decision procedureso SAT solverso BDDs

o Partial Order Reductiono Satisfiability Modulo Theory (SMT) solvers

Theorem-proving

Dynamic AnalysisAutomated testing and debugging using model inferenceSoftware visualizationReference Books:

Logic in Computer Science - Modelling and Reasoning About Systems: by Michael Huthand Mark Ryan; Cambridge University Press (ISBN 9780521670890)Principles of Program Analysis: by Nielson and Chris Hankin, Springer ISBN 978-3-540-65410-0

Model Checking: by Clarke, Grumberg, and Peled; MIT PressDecision Procedures - An Algorithmic Point of View: by Kroening and Strichman; SpringerSoftware Visualization: by John T. Stasko, John B. Domingue, Marc H. Brown and BlaineA. Price; MIT Press (ISBN: 978-0-262-19395-5)Types and Programming Languages, by Benjamin C. Pierce; The MIT Press; ISBN0262162091


52/91


6. CS 204/CS 304: Elective Course: DOT NETObjectives:

- To understand the DOTNET framework, C# language features and Web development usingASP.NET- Evaluation will be as below

1. Theory paper : 50 marks2. Project work (either in C# or ASP.NET): 50 marks.Students are supposed to give the project demo and presentation of their project.Project Evaluation : ( to be done internally by subject teacher)a. Coding : 20 Marksb. Documentation & Demo : 15 marksc. Presentation + presentation style : 15 marksPrerequisite:

- Knowledge of object-oriented programming concepts such as data abstraction,encapsulation, inheritance, and polymorphism.- Familiarity with programming language such as C++ and/or Java.

- Knowledge of web developmentTopics to be covered:

Unit I

1. DOTNET Frameworka. Introduction to DOTNETb. DOT NET class frameworkc. Common Language Runtimei. Overviewii. Elements of .NET applicationiii. Memory Managementiv. Garbage Collector : Faster Memory allocation,

Optimizationsd. Common Language Integrationi. Common type systemii. Reflection APIe. User and Program Interface2. Introduction to C#a. Language featuresi. Variables and Expressions, type conversionii. Flow Controliii. Functions, Delegatesiv. Debugging and error handling, exception handling

( System Defined and User Defined)b. Object Oriented Conceptsi. Defining classes, class members, Interfaces, propertiesii. Access modifiers, Implementation of class, interfaceand propertiesiii. Concept of hiding base class methods, Overridingiv. Event Handlingc. Collections, Comparisons and Conversions


53/91


i. Defining and using collections, Indexers, iteratorsii. Type comparison, Value Comparisoniii. Overloading Conversion operators, as operatord. Genericsi. Using generics

ii. Defining Generics, generic Interfaces, Generic methods,Generic DelegateUnit-II

3. Window Programminga. Window Controlsi. Common Controlsii. Container Controlsiii. Menus and Toolbarsiv. Printingv. Dialogsb. Deploying Window Application

i. Deployment Overviewii. Visual studio setup and Deployment project typesiii. Microsoft windows installer architectureiv. Building the project : Installation

Unit-III

4. Data Accessa. File System Datab. XMLc. Databases and ADO.NETd. Data Binding5. Web Programminga. Basic Web programmingb. Advanced Web programmingc. Web Servicesd. Deployment Web applications

Unit-IV

6. .NET Assembliesa. Componentsb. .NET Assembly featuresc. Structure of Assembliesd. Calling assemblies, private and shared assemblies7. Networkinga. Networking overviewb. Networking programming optionsi. Webclientii. WebRequest and WebResponseiii. TcpListener &TcpClient8. Introduction to GDI+a. Overview of Graphical Drawingb. Pen Class, Brush Class, Font Class


54/91


c. Using Imagesd. Clipping, Drawing2D, Imaging

Unit-V

1. Introduction to ASP.NET

2. Server Controls and Variables, control Structures & Functionsa. Forms, webpages, HTML forms, Webformsb. Request & Response in Non-ASP.NET pagesc. Using ASP.NET Server Controlsd. Datatypes : Numeric, text, arrays, datacollectionse. Overview of Control structuresf. Functions : web controls as parameters3. Even Driven Programming and PostBacka. HTML eventsb. ASP.NET page eventsc. ASP.NET Web control eventsd. Event driven programming and postback4. Reading from Databasesa. Data pagesb. ADO.NET5. ASP.NET Server Controlsa. ASP.NET Web Controlsb. HTML Server Controlsc. Web Controls6. DOTNET assemblies and Custom Controlsa. Introduction to Coolies, Sessionsb. Session eventsc. State management Recommendations7. Web Servicesa. HTTP, XML & Web servicesb. SOAPc. Building ASP.NET web serviced. Consuming a web serviceRecommended Text and Reference books:

Beginning Visual C#, Wrox PublicationProfessional Visual C#, Wrox PublicationInside C#, by Tom Archer ISBN: 0735612889 Microsoft Press 2001, 403 pagesBeginning ASP.NET 3.5, Wrox Publication

Programming ASP.NET 3.5 by Jesse Liberty, Dan Maharry, Dan Hurwitz, OReillyIllustrated C# 2008, Solis, Publication APRESS, ISBN 978-81-8128-958-2Professional C# 4.0 and .NET 4by Christian Nagel, Bill Evjen, Jay Glynn, Karli Watson,Morgan Skinner, WROXBeginning C# Object-Oriented Programming By Dan Clark , ApressADO.NET Examples and Best Practices for C# Programmers, By Peter D. Blackburn ApressDatabase Programming with C#, By Carsten Thomsen, Apress


55/91


7. CS 204/CS 304 : Elective Course : Information Systems SecurityObjectives of the Course:1. To enable students to get sound understanding of Info-Sys-Security, Net SecurityCryptography2. To equip with knowledge and skills necessary to support for their career in Information

Security3. To develop attitude and interest along with necessary knowledge and skills among thestudents to encourage them to do further academic studies / research in this area, after thecompletion of their M.Sc. Course

Unit-IConceptual foundation of Information Systems Security- Concepts and Terminologyo Threats, Attacks, Types of attacks, Programs that attacko Vulnerabilities, Risks, Risk Assessment and Mitigation- Security & Elements / principles of Information Securityo Confidentiality, Integrity, Availability, Identification, Authentication, Authorization,

Accountability, PrivacyData Encryption techniques- Introduction, Plain text, Cipher text- Substitution techniques: Caeser cipher, Mono-alphabetic cipher, Homophonic, polygra,polyalphabetic, playfair, Hill cipher- Transposition techniques: Reil Fense technique, simple columnar, Vernam, Book cipher- Encryption & Decryption- Symmetric and Asymmetric key cryptography: Diffie-Hellman key exchange- Steganography

Unit-II

Symmetric / Secret Key Encryption

- Algorithm Types and Modes- Overview of symmetric key cryptography- DES (Data Encryption Standard)- Double DES, Triple DES- AES (Advanced Encryption Standard)- IDEA (International Data Encryption Algorithm)- Blowfish- RC4 & RC5Asymmetric key / Public Key Encryption- History & overview of asymmetric key cryptography- RSA algorithm

- key management- Deffie-Hellman key exchange- Elliptic curve cryptography

Unit-III

Message Integrity techniques- Message Digest- MD5- SHA


56/91


- Message Authentication Code (MAC) & HMAC- Digital Signature techniqueso Digital Signatures using DSA (Digital Signature Algorithm)o DSS (Digital Signature Standard) and RSADigital Certificates and PKI (Public Key Infrastructure)

- Digital Certificates- Private key management- PKIX Model- Public key cryptography standards (PKCS)- XML, PKI and Security

Unit-IVAuthentication techniques- Passwords- Authentication Tokens- Certificate Based Authentication- Biometric Authentication

- Kerberos- Key Distribution Center(KDC)- Security Handshake PitfallsInternet Security protocols- Secure Socket Layer (SSL)- Transport Layer Security (TLS) , Secure HTTP (SHTTP)- Time Stamping Protocol (TSP)- Secure Electronic Transaction ( SET)- 3-D Secure Protocol- Electronic Money- Email Security : SMTP, PEM, PGP, S/MIME- Wireless Application Protocol (WAP) Security- Security in GSM- Security in 3G

Unit-V

Server Security & Firewalls- Intrusion Detection, IDS, Intrusion Prevention Systems (IPS)- Introduction of Firewall, Packet Filters,- Application Level Gateways- Circuit Level Gateways- Firewall architecture- This chapter should also include detailed study of at least one free Firewall, IDS, IPSproducts with demonstrations ( For Internal evaluation only)Malicious Software- Malicious Code- Viruses : types, working of anti-virus software- Worms- Trojan horse, Spyware- Attacks: Hoax, Back-door, Brute Force, Dictionary, Spoofing, Denial-of-service, Man-inthe-middle, spam, E-mail Bombing & Spamming, Sniffer. Timing attack.


57/91


Recommended Books (Text and Reference):1. Atul Kahate, "Cryptography And Network Security TMH2. William Stallings," Cryptography and Network Security Prentice Hall /Pearson Education3. Cryptography and Information Security By V.K. Pachghare ( PHI Learning Private Limited)4. Introduction to Computer Security By Matt Bishop and Sathyanarayana (PEARSON

EDUCATION)5. Applied Cryptography Protocols, Algorithms, and Source Code in C By Bruice Schneier(Wiley India)6. A Classical Introduction to Cryptography, Vaudenay, Springer, 978-0-387-25464-77. A Classical Introduction to Cryptography Exercise Book, Baigneres, Springer, 978-0-387-27934-3


58/91


8. CS 204/CS 304 : Elective Course: Software Architecture and Design PatternsUnit-I

1. The

Date post:	05-Apr-2018
Category:	Documents
Upload:	ashimsarkar2006
View:	224 times
Download:	1 times

Proposed Syllabus for MSc. CS Bastar Bv

Documents