mtech course structure -cse(2014-2015)

SWARNANDHRA

COLLEGE OF ENGINEERING & TECHNOLOGY

ACCREDITED BY NATIONAL BOARD OF ACCRDITATION, AICTE, NEW DELHI ACCREDITED BY NAAC WITH “A” GRADE-3.32/4 CGPA,

Recognised under 2(f) &12(B) of UGC Act 1956, Approved by AICTE, Permanently Affiliated to JNTUK, Kakinada

Seetharampuram, Narsapuram-534 280, W.G.Dt.,

ACADEMIC REGULATIONS

FOR M. Tech (REGULAR)DEGREE COURSE

Applicable for the students of M. Tech (Regular) Course from the Academic Year 2014-15 onwards The M. Tech Degree of Jawaharlal Nehru Technological University Kakinada shall be conferred on candidates who are

admitted to the program and who fulfil all the requirements for the award of the Degree. 1.0 ELIGIBILITY FOR ADMISSIONS

Admission to the above program shall be made subject to eligibility, qualification and specialization as prescribed by the University from time to time.

Admissions shall be made on the basis of merit/rank obtained by the candidates at the qualifying Entrance Test

conducted by the University or on the basis of any other order of merit as approved by the University, subject to reservations as

laid down by the Govt. from time to time. 2.0 AWARD OF M. Tech DEGREE 2.1 A student shall be declared eligible for the award of the M. Tech Degree, if he pursues a course of study in not less

than two and not more than four academic years. 2.2 The student shall register for all 80 credits and secure all the 80 credits. 2.3 The minimum instruction days in each semester are 90.

3.0 ATTENDANCE

4.1 A student shall be eligible to write University examinations if he acquires a minimum of 75% of attendance in aggregate of all the subjects.

4.2 Condonation of shortage of attendance in aggregate up to 10% (65% and above and below 75%) in each semester shall be granted by the College Academic Committee.

4.3 Shortage of Attendance below 65% in aggregate shall not be condoned. 4.4 Students whose shortage of attendance is not condoned in any semester are not eligible to write their end

semester examination of that class. 4.5 A prescribed fee shall be payable towards condonation of shortage of attendance. 4.6 A student shall not be promoted to the next semester unless he satisfies the attendance requirement of the

present semester, as applicable. They may seek readmission into that semester when offered next. If any candidate fulfills the attendance requirement in the present semester, he shall not be eligible for readmission into the same class.

5.0 EVALUATION

The performance of the candidate in each semester shall be evaluated subject-wise, with a maximum of 100 marks for

theory and 100 marks for practicals, on the basis of Internal Evaluation and End Semester Examination. 5.1 For the theory subjects 60 marks shall be awarded based on the performance in the End Semester

Examination and 40 marks shall be awarded based on the Internal Evaluation. The internal evaluation shall

be made based on the average of the marks secured in the two Mid Term-Examinations conducted-one in the middle of the Semester and the other immediately after the completion of instruction. Each mid term

examination shall be conducted for a total duration of 120 minutes with 4 questions (without choice) each

question for 10 marks. End semester examination is conducted for 60 marks for 5 questions to be answered

out of 8 questions.

5.2 For practical subjects, 60 marks shall be awarded based on the performance in the End Semester Examinations

SWARNANDHRA




Seetharampuram, Narsapuram-534 280, W.G.Dt., and 40 marks shall be awarded based on the day-to-day performance as Internal Marks.

5.3 There shall be two seminar presentations during III semester and IV semester. For seminar, a student under the supervision of a faculty member, shall collect the literature on a topic and critically review the literature and submit it to the department in a report form and shall make an oral presentation before the Project Review Committee consisting of Head of the Department, Supervisor and two other senior faculty members of the department. For each Seminar there will be only internal evaluation of 50 marks. A candidate has to secure a minimum of 50% of marks to be declared successful.

5.4 A candidate shall be deemed to have secured the minimum academic requirement in a subject if he secures a minimum of 40% of marks in the End semester Examination and a minimum aggregate of 50% of the total marks in the End Semester Examination and Internal Evaluation taken together.

5.5 In case the candidate does not secure the minimum academic requirement in any subject (as specified in 5.4) he has to reappear for the End semester Examination in that subject. A candidate shall be given one chance to re-register for each subject provided the internal marks secured by a candidate are less than 50% and has failed in the end examination. In such a case, the candidate must re-register for the subject(s) and secure the required minimum attendance. The candidate’s attendance in the re-registered subject(s) shall be calculated separately to decide upon his eligibility for writing the end examination in those subject(s). In the event of the student taking another chance, his internal marks and end examination marks obtained in the previous attempt stand cancelled. For re-registration the candidates have to apply to the University through the college by paying the requisite fees and get approval from the University before the start of the semester in which re-registration is required.

5.6 In case the candidate secures less than the required attendance in any re registered subject (s), he shall not be

permitted to write the End Examination in that subject. He shall again re-register the subject when next

offered. 5.7 Laboratory examination for M. Tech. courses must be conducted with two Examiners, one of them being the

Laboratory Class Teacher or teacher of the respective college and the second examiner shall be appointed by the

university from the panel of examiners submitted by the respective college.

6.0 EVALUATION OF PROJECT/DISSERTATION WORK

Every candidate shall be required to submit a thesis or dissertation on a topic approved by the Project Review Committee.

6.1 A Project Review Committee (PRC) shall be constituted with Head of the Department and two other senior faculty

members.

6.2 Registration of Project Work: A candidate is permitted to register for the project work after satisfying the

attendance requirement of all the subjects, both theory and practical. 6.3 After satisfying 6.2, a candidate has to submit, in consultation with his project supervisor, the title, objective and

plan of action of his project work for approval. The student can initiate the Project work, only after obtaining

the approval from the Project Review Committee (PRC). 6.4 If a candidate wishes to change his supervisor or topic of the project, he can do so with the approval of the Project Review

Committee (PRC). However, the Project Review Committee (PRC) shall examine whether or not the change of

topic/supervisor leads to a major change of his initial plans of project proposal. If yes, his date of registration for the

project work starts from the date of change of Supervisor or topic as the case may be.

6.5 A candidate shall submit his status report in two stages at least with a gap of 3 months between them. 6.6 The work on the project shall be initiated at the beginning of the II year and the duration of the project is two

semesters. A candidate is permitted to submit Project Thesis only after

successful completion of theory and practical course with the approval of PRC not earlier than 40 weeks

from the date of registration of the project work. The candidate has to pass all the theory and practical

SWARNANDHRA




Seetharampuram, Narsapuram-534 280, W.G.Dt., subjects before submission of the Thesis.

6.7 Three copies of the Project Thesis certified by the supervisor shall be submitted to the College/School/Institute. 6.8 The thesis shall be adjudicated by one examiner selected by the University. For this, the Principal of the College

shall submit a panel of 5 examiners, eminent in that field, with the help of the guide concerned and head of

the department. 6.9 If the report of the examiner is not favourable, the candidate shall revise and resubmit the Thesis, in the time frame as

decided by the PRC. If the report of the examiner is unfavorable again, the thesis shall be summarily rejected. The

candidate has to re-register for the project and complete the project within the stipulated time after taking the

approval from the University.

6.10 If the report of the examiner is favourable, Viva-Voce examination shall be conducted by a board consisting

of the Supervisor, Head of the Department and the examiner who adjudicated the Thesis. The Board shall

jointly report the candidate’s work as one of the following: A. Excellent B. Good C. Satisfactory D. Unsatisfactory

The Head of the Department shall coordinate and make arrangements for the conduct of Viva-Voce examination.

6.11 If the report of the Viva-Voce is unsatisfactory, the candidate shall retake the Viva-Voce examination only

after three months. If he fails to get a satisfactory report at the second Viva-Voce examination, the candidate

has to re-register for the project and complete the project within the stipulated time after taking the approval

from the University.

7.0 AWARD OF DEGREE AND CLASS After a student has satisfied the requirements prescribed for the completion of the program and is eligible for the

award of M. Tech. Degree he shall be placed in one of the following four classes: Class Awarded % of marks to be secured First Class with Distinction 70% and above (Without any

Supplementary Appearance )

First Class Below 70% but not less than 60% 70% and above (With any Supplementary Appearance )

Second Class Below 60% but not less than 50%

The marks in internal evaluation and end examination shall be shown separately in the memorandum of marks. .

SWARNANDHRA





COURSE STRUCTURE – PG

(CSE)

M.Tech. I SEMESTER

S. No.

Subject Code

Name of the Subject L T P C I E Total

1 MTCS1T01 Advanced Data Structures &

Algorithm Analysis 3 1 - 3 40 60 100

2 MTCS1T02 Theoretical Concepts in Computer

Science and Engineering 3 1 - 3

40 60 100

3 MTCS1T03 Advanced Computer Architecture 3 1 - 3 40 60 100 4 MTCS1T04 Advanced Data Bases 3 1 3 40 60 100 5 MTCS1T05 Distributed Systems 3 1 - 3 40 60 100 6 MTCS1T06 Secure software engineering 3 1 - 3 40 60 100 7 MTCS1L01 CSE Lab-1 - - 3 2 40 60 100 Total Credits 20 280 420 700

B.Tech. II SEMESTER

S. No.

Subject Code


1 MTCS2T01 Information Security 3 1 - 3 40 60 100

2 MTCs2T02 Advanced Computer

Networks 3 1 - 3

40 60 100

3 MTCS2T03 BIG DATA 3 1 - 3 40 60 100 4 Elective-1 3 1 - 3 40 60 100 5 Elective-2 3 1 - 3 40 60 100 6 Elective-3 3 1 - 3 40 60 100 7 MTCS2L01 CSE LAB-2 - - 3 2 40 60 100 Total Credits 20 280 420 700

Elective-1 1 MTCS2TE1 Mobile Computing 2 MTCS2TE2 Compiler Design 3 MTCS2TE3 Human Computer Interaction

Elective-2 1 MTCS2TE4 Image Processing 2 MTCS2TE5 Soft Computing 3 MTCS2TE6 Design Patterns

Elective-3 1 MTCS2TE7 Advanced Unix Programming 2 MTCS2TE8 Bio-Informatics

SWARNANDHRA





COURSE STRUCTURE – PG

(CSE)

M.Tech. III

SEMESTER

S. No.

Subject Code


1 MTCS3V01 Comprehensive Viva - - - 2 - - - 2 MTCS3S01 Seminar-1 - - - 2 - - - 3 MTCS3P01 Project Work Part-1 - - - 16 - - - Total Credits 20 - - -

M.Tech. IV

SEMESTER

S. No.

Subject Code


1 MTCS4S01 Seminar-2 - - - 2 - - - 2 MTCS4P01 Project Work Part-2 - - - 18 - - - Total Credits 20 - - -

SWARNANDHRA





I SEMESTER ADVANCED DATA STRUCTURES AND ALGORITHMS ANALYSIS

Objectives: The fundamental design, analysis, and implementation of basic data structures. Basic concepts in the specification and analysis of programs. Principles for good program design, especially the uses of data abstraction. Significance of algorithms in the computer field Various aspects of algorithm development Qualities of a good solution

UNIT I Algorithms, Performance analysis- time complexity and space complexity, Asymptotic Notation-Big Oh, Omega and Theta notations, Complexity Analysis Examples.Data structures-Linear and non linear data structures, ADT concept, Linear List ADT, Array representation, Linked representation, Vector representation, singly linked lists -insertion, deletion, search operations, doubly linked lists-insertion, deletion operations, circular lists. Representation of single, two dimensional arrays, Sparse matrices and their representation. UNIT II Stack and Queue ADTs, array and linked list representations, infix to postfix conversion using stack, implementation of recursion, Circular queue-insertion and deletion, Dequeue ADT, array and linked list representations, Priority queue ADT, implementation using Heaps, Insertion into a Max Heap, Deletion from a Max Heap, java.util package-ArrayList, Linked List, Vector classes, Stacks and Queues in java.util, Iterators in java.util. UNIT III Searching–Linear and binary search methods, Hashing-Hash functions, Collision Resolution methods-Open Addressing, Chaining, Hashing in java.util-HashMap, HashSet, Hashtable. Sorting –Bubble sort, Insertion sort, Quick sort, Merge sort, Heap sort, Radix sort, comparison of sorting methods. UNIT IV Trees- Ordinary and Binary trees terminology, Properties of Binary trees, Binary tree ADT, representations, recursive and non recursive traversals, Java code for traversals, Threaded binary trees. Graphs- Graphs terminology, Graph ADT, representations, graph traversals/search methods-dfs and bfs, Java code for graph traversals, Applications of Graphs-Minimum cost spanning tree using Kruskal’s algorithm, Dijkstra’s algorithm for Single Source Shortest Path Problem. UNIT V Search trees- Binary search tree-Binary search tree ADT, insertion, deletion and searching operations, Balanced search trees, AVL trees-Definition and examples only, Red Black trees – Definition and examples only, B-Trees-definition, insertion and searching operations, Trees in java.util- TreeSet, Tree Map Classes, Tries(examples only),Comparison of Search trees. Text compression-Huffman coding and decoding, Pattern matching-KMP algorithm. TEXT BOOKS: 1. Data structures, Algorithms and Applications in Java, S.Sahni, Universities Press. 2. Data structures and Algorithms in Java, Adam Drozdek, 3

rd edition, Cengage Learning.

3. Data structures and Algorithm Analysis in Java, M.A.Weiss, 2nd edition, Addison-Wesley (Pearson Education).

SWARNANDHRA





THEORETICAL CONCEPTS IN COMPUTER SCIENCE AND ENGINE ERING

UNIT-1

Discrete mathematical structures: Basic concepts of sets, relations, binary relations, functions; Algebraic structures- groups, free groups, congruence, homomorphism and isomorphism, poset, permutation and combination; Lattices and Boolean algebra; Vector Spaces and properties; Linear transformations and linear operators.

UNIT-2

Automata theory: Concept of language and grammar. Review of DFA, NFA, NFA with empty moves and their equivalence. Minimization of FA. Regular sets and regular expressions. Pumping lemma for regular sets, closure properties and decision algorithms for regular sets. Context free language – definition, removal of useless symbols, removal of null productions and unit productions. Normal forms of CFLs- CNF and GNF. UNIT-3 Extending Finite-State Automata: The Pushdown Automaton (PDA), Pushdown Automaton as language acceptor – acceptance with final state and empty stack. PDA and Context free languages. Ambiguity and properties of CFLs. Properties of Pushdown Automaton and relation with Finite State Automata. Pumping lemma for CFLs, Closure and decision properties of CFLs. Left and Right linear grammar and relation with Regular sets. UNIT-4 Turing Machines: Techniques for construction. Turing machines as function evaluators. Turing machines with two way infinite tape, Multi-tape Turing machines, Multi-dimensional Turing machines, non-deterministic Turing machines, Universal Turing machine. Recursive and recursively enumerable languages, unrestricted grammar. Church Turing hypothesis. Undecidability, Context-sensitive languages and linear bounded automata. UNIT-5 Computability Theory : Primitive recursive function, partial recursive function. Arithmetization: Encoding of Turing machines, recursive and recursively enumerable sets, Rice‟s theorem, degree of unsolvability. Textbook

1.Lewis and Papadimitriou, Elements of the Theory of Computation, Prentice Hall

2.Hopcroft and Ullman; Introduction to Automata Theory, Languages and Computation, Addison Wesley 3. C. L. Liu, “Elements of Discrete Mathematics”, Mcgraw Hill. 4. J. P. Tremblay and R. Manohar, “Discrete Mathematical Structures With Applications To Computer Science”, Mcgraw Hill

SWARNANDHRA





ADVANCED COMPUTER ARCHITECTURE

UNIT-I

Evolution of Computer Architecture, System Attributes to performance; Shared Memory Multiprocessors,

Distributed Memory Multiprocessors, A Taxonomy of MIMD Computers; architecture of Vector Super computers,

operational model of SIMD computer, PRAM models and PRAM variants

Conditions of Parallelism- data and resource dependencies, hardware and software parallelism, Program

partitioning and Scheduling- grain sizes and latency, grain packing and scheduling, static multi processor

scheduling, Program flow mechanisms- control flow vs data flow, demand driven mechanisms, comparison of flow mechanisms, System interconnect architectures- network properties and routing, static and dynamic connection

networks. UNIT-II

Principles of scalable performances- performance metrics and measures-parallelism profile in programs, mean

performance, efficiency, utilization and quality, benchmarks and performance measures, characteristics of parallel

processing applications, Speed up performance laws- Amdahl’s law, Gustafson’s law, memory bounded speed up model, Scalability metrics and goals,

Bus systems- back plane bus specification, Addressing and Timing protocols, Arbitration, transaction and interrupt,

IEEE future bus standard requirement set, Shared memory organizations- Interleaved memory organization, band

width and fault tolerance, memory allocation schemes, Atomicity and event ordering

UNIT-III

Linear Pipeline Processors- asynchronous and synchronous models, clocking and timing control, speedup, efficiency, and

throughput, Non linear pipeline processors- reservation and latency analysis, collision free scheduling, pipeline schedule

optimization, Instruction pipe lineinstruction pipelining, dynamic instruction scheduling, branch handling techniques,

static arithmetic pipelines.Hierarchical bus system, cross bar switch and multiport memory, multistage and

combining networks, multistage and combining networks, The cache coherence problem, message passing

mechanism-message routing schemes, deadlock virtual channels, flow control strategies, multicast routing

algorithms UNIT-IV

Vector processing principles- vector instruction types, vector access memory schemes, early super computers,

Multi vector multiprocessors-performance directed design rules, architecture of Cray and MPP, Compound vector

operations, vector loops and chaining, SIMD computer organizations UNIT-V

Latency-hiding techniques- shared virtual memory, prefetching techniques, distributed coherent caches, scalable

coherence interface, relaxed memory consistency, principles of multithreading and context switching policies,

MPD architecture, The Tera multiprocessor system, Data flow computer architecture TEXT BOOKS: 1. KAI HWANG & NARESH JOTWANI, “Advanced Computer Architecture- Parallelism, Scalability,

Programmability” Second Edition, Mc Graw Hill Publishing.

SWARNANDHRA





ADVANCED DATA BASES UNIT I Database System Applications, Purpose of Database Systems, View of Data – Data Abstraction, Instances and Schemas, Data Models – the ER Model, Relational Model, Other Models – Database Languages – DDL,DML, Database Access from Applications Programs, Transaction Management, Data Storage and Querying, Database Architecture, Database Users and Administrators, ER diagrams,. Relational Model: Introduction to the Relational Model – Integrity Constraints Over Relations, Enforcing Integrity constraints, Querying relational data, Logical data base Design, Introduction to Views –Altering Tables and Views, Relational Algebra, Basic SQL Queries, Nested Queries, Complex Integrity Constraints in SQL, Triggers UNIT II Introduction to Schema Refinement – Problems Caused by redundancy, Decompositions – Problem related to decomposition, Functional Dependencies - Reasoning about FDS, Normal Forms – FIRST, SECOND, THIRD Normal forms – BCNF –Properties of Decompositions- Loss less- join Decomposition, Dependency preserving Decomposition, Schema Refinement in Data base Design – Multi valued Dependencies – FOURTH Normal Form, Join Dependencies, FIFTH Normal form. UNIT III Transaction Management: The ACID Properties, Transactions and Schedules, Concurrent Execution of Transactions – Lock Based Concurrency Control, Deadlocks – Performance of Locking – Transaction Support in SQL. Concurrency Control: Serializability, and recoverability – Introduction to Lock Management – Lock Conversions, Dealing with Dead Locks, Specialized Locking Techniques – Concurrency Control without Locking. Crash recovery: Introduction to Crash recovery, Introduction to ARIES, the Log, and Other Recovery related Structures, the Write-Ahead Log Protocol, Check pointing, recovering from a System Crash, Media recovery UNIT IV Overview of Storage and Indexing: Data on External Storage, File Organization and Indexing – Clustered Indexes, Primary and Secondary Indexes, Index data Structures – Hash Based Indexing, Tree based Indexing Storing data: Disks and Files: -The Memory Hierarchy – Redundant Arrays of Independent Disks. Tree Structured Indexing: Intuitions for tree Indexes, Indexed Sequential Access Methods (ISAM) B+ Trees: A Dynamic Index Structure, Search, Insert, Delete. Hash Based Indexing: Static Hashing, Extendable hashing, Linear Hashing, Extendable vs. Linear Hashing. UNIT V Distributed databases: Introduction to distributed databases, Distributed DBMS architectures, Storing data in a distributed DBMS, Distributed catalog management, Distributed query processing Updating distributed data, Distributed transactions, Distributed concurrency control, Distributed recovery TEXT BOOKS:

1. Data base Management Systems, Raghu Ramakrishnan, Johannes Gehrke, TMH, 3rd

Edition, 2003. 2. Data base System Concepts, A.Silberschatz, H.F. Korth, S.Sudarshan, McGraw hill, VI edition, 2006. 3. Fundamentals of Database Systems 5th edition. Ramez Elmasri, Shamkant B.Navathe,

Pearson Education, 2008.

SWARNANDHRA





DISTRIBUTED SYSTEMS UNIT I Characterization of Distributed Systems- Introduction, Examples of Distributed systems, Resource sharing and web, challenges, System models- Introduction, Architectural and Fundamental models, Networking and Internetworking, Interprocess Communication. Distributed objects and Remote Invocation-Introduction, Communication between distributed objects, RPC, Events and notifications, Case study-Java RMI. UNIT II Operating System Support- Introduction, OS layer, Protection, Processes and Threads, Communication and Invocation, Operating system architecture, Distributed File Systems-Introduction, File Service architecture, case study- SUN network file systems. Name Services-Introduction, Name Services and the Domain Name System, Case study of the Global Name Service, Case study of the X.500 Directory Service. UNIT III Peer to Peer Systems-Introduction, Napster and its legacy, Peer to Peer middleware, Routing overlays, Overlay case studies-Pastry, Tapestry, Application case studies-Squirrel, OceanStore. Time and Global States-Introduction, Clocks, events and Process states, Synchronizing physical clocks, logical time and logical clocks, global states, distributed debugging.Coordination and Agreement - Introduction, Distributed mutual exclusion, Elections, Multicast communication, consensus and related problems. UNIT IV Transactions and Concurrency control - Introduction, Transactions, Nested Transactions, Locks, Optimistic concurrency control, Timestamp ordering, Comparison of methods for concurrency controls. Distributed Transactions - Introduction, Flat and Nested Distributed Transactions, Atomic commit protocols, Concurrency control in distributed transactions, Distributed deadlocks, Transaction recovery, Replication-Introduction, System model and group communication, Fault tolerant services, Transactions with replicated data. UNIT V Security - Introduction, Overview of Security techniques, Cryptographic algorithms, Digital signatures, Case studies-Kerberos, TLS, 802.11 WiFi. Distributed shared memory, Design and Implementation issues, Sequential consistency and Ivy case study, Release consistency and Munin case study, other consistency models, CORBA case study-Introduction, CORBA RMI, CORBA Services. TEXT BOOKS:

1. Distributed Systems Concepts and Design, G Coulouris, J Dollimore and T Kindberg, Fourth Edition, Pearson Education.

2. Distributed Systems, S.Ghosh, Chapman & Hall/CRC, Taylor & Francis Group, 2010

SWARNANDHRA





SECURE SOFTWARE ENGINEERING

UNIT I Problem, Process, and Product - Problems of software practitioners – approach through software reliability engineering- experience with SRE – SRE process – defining the product – Testing acquired software – reliability concepts- software and hardware reliability. Implementing Operational Profiles - Developing, identifying, crating, reviewing the operation – concurrence rate – occurrence probabilities- applying operation profiles UNIT II Engineering “Just Right” Reliability - Defining “failure” for the product - Choosing a common measure for all associated systems. - Setting system failure intensity objectives -Determining user needs for reliability and availability., overall reliability and availability objectives, common failure intensity objective., developed software failure intensity objectives. - Engineering software reliability strategies. Preparing for Test - Preparing test cases. - Planning number of new test cases for current release. -Allocating new test cases. - Distributing new test cases among new operations - Detailing test cases. - Preparing test procedures UNIT III Executing Test - Planning and allocating test time for the current release. - Invoking test- identifying identifying failures - Analyzing test output for deviations. – Determining which deviations are failures. Establishing when failures occurred. Guiding Test - Tracking reliability growth - Estimating failure intensity. - Using failure intensity patterns to guide test - Certifying reliability. Deploying SRE - Core material - Persuading your boss, your coworkers, and stakeholders. - Executing the deployment - Using a consultant. UNIT IV Using UML for Security - UM L diagrams for security requirement -security business process- physical security - security critical interaction - security state. Analyzing Model - Notation - formal semantics - security analysis - important security opportunities. Model based security engineering with UML - UML sec profile- Design principles for secure systems - Applying security patterns UNIT V Applications - Secure channel - Developing Secure Java program- more case studies. Tool support for UML Sec - Extending UML CASE TOOLS with analysis tools - Automated tools for UML SEC. Formal Foundations - UML machines - Rely guarantee specifications- reasoning about security properties. REFERENCES 1. John Musa D, “Software Reliability Engineering”, 2ndEdition, Tata McGraw-Hill, 2005 (Units I, II and III) 2. Jan Jürjens, “Secure Systems Development with UML”, Springer; 2004 (Unit IV and V)

SWARNANDHRA





CS LAB- I (COVERING THE EXPERIMENTS OF DATA STRUCTU RES & DATABASE MANAGEMENT SYSTEMS)

ADVANCED DATA STRUCTURES AND ALGORITHMS LAB

Sample Problems on Data structures: 1. Write Java programs that use both recursive and non-recursive functions for implementing the following searching methods:

a) Linear search b) Binary search 2. Write Java programs to implement the following using arrays and linked lists

a) List ADT 3. Write Java programs to implement the following using an array.

a) Stack ADT b) Queue ADT 4. Write a Java program that reads an infix expression and converts the expression to postfix form. (Use stack ADT). 5. Write a Java program to implement circular queue ADT using an array. 6. Write a Java program that uses both a stack and a queue to test whether the given string is a palindrome or not. 7. Write Java programs to implement the following using a singly linked list. a) Stack ADT b) Queue ADT

8.Write Java programs to implement the deque (double ended queue) ADT using a) Array b) Singly linked list c) Doubly linked list. 9.Write a Java program to implement priority queue ADT.

10. Write a Java program to perform the following operations: a) Construct a binary search tree of elements. b) Search for a key element in the above binary search tree. c) Delete an element from the above binary search tree.

11. Write a Java program to implement all the functions of a dictionary (ADT) using Hashing. 12. Write a Java program to implement Dijkstra’s algorithm for Single source shortest path problem. 13. Write Java programs that use recursive and non-recursive functions to traverse the given binary tree in a) Preorder b) Inorder c) Postorder. 14. Write Java programs for the implementation of bfs and dfs for a given graph. 15. Write Java programs for implementing the following sorting methods:

a) Bubble sort d) Merge sort g) Binary tree sort b) Insertion sort e) Heap sort c) Quick sort f) Radix sort

16. Write a Java program to perform the following operations: a) Insertion into a B-tree b) Searching in a B-tree

17. Write a Java program that implements Kruskal’s algorithm to generate minimum cost spanning tree. 18. Write a Java program that implements KMP algorithm for pattern matching.

REFERENCE BOOKS:

1. Data Structures and Algorithms in java, 3rd

edition, A.Drozdek, Cengage Learning. 2. Data Structures with Java, J.R.Hubbard, 2

nd edition, Schaum’s Outlines, TMH.

3. Data Structures and algorithms in Java, 2nd

Edition, R.Lafore, Pearson Education. 4. Data Structures using Java, D.S.Malik and P.S. Nair, Cengage Learning. 5. Data structures, Algorithms and Applications in java, 2nd Edition, S.Sahani, Universities Press. 6. Design and Analysis of Algorithms, P.H.Dave and H.B.Dave, Pearson education. 7. Data Structures and java collections frame work, W.J.Collins, Mc Graw Hill. 8. Java: the complete reference, 7

th editon, Herbert Schildt, TMH.

SWARNANDHRA





II SEMESTER

INFORMATION SECURITY UNIT -I

Introduction: Security Attacks (Interruption, Interception, Modification and Fabrication), Security Services

(Confidentiality, Authentication, Integrity, Non-repudiation, access Control and Availability) and Mechanisms, A

model for Internetwork security, Internet Standards and RFCs, Buffer overflow & format string vulnerabilities,

TCP session hijacking, ARP attacks, route table modification, UDP hijacking, and man-in-the-middle attacks. UNIT -II

Conventional Encryption:

Conventional Encryption Principles, Conventional encryption algorithms, cipher block modes of operation, location

of encryption devices, key distribution Approaches of Message Authentication, Secure Hash Functions and HMAC, UNIT- III

Public key: Public key cryptography principles, public key cryptography algorithms, digital signatures, digital

Certificates, Certificate Authority and key management Kerberos, X.509 Directory Authentication Service UNIT -IV

IP Security: IP Security Overview, IP Security Architecture, Authentication Header, Encapsulating Security

Payload, Combining Security Associations and Key Management

Web Security: Web Security Requirements, Secure Socket Layer (SSL) and Transport Layer Security (TLS),

Secure Electronic Transaction (SET)

Email Privacy: Pretty Good Privacy (PGP) and S/MIME. UNIT- V SNMP: Basic concepts of SNMP, SNMPv1 Community facility and SNMPv3, Intruders, Viruses and related threats

Fire walls: Firewall Design principles, Trusted Systems, Intrusion Detection Systems TEXT BOOKS: 1. Network Security Essentials: Applications and Standards, William Stallings, PEA. 2. Hack Proofing your Network, Russell, Kaminsky, Forest Puppy, Wiley Dreamtech

SWARNANDHRA





ADVANCED COMPUTER NETWORKS

UNIT-I Computer Networks and the Internet: What is the Internet, The Network edge, The Network core, Access Networks and physical media, ISPs and Internet Backbones, Delay and Loss in Packet-Switched Networks, History of Computer Networking and the Internet. Foundation of Networking Protocols: 5-layer TCP/IP Model, 7-Layer OSI Model, Internet Protocols and Addressing, Equal-Sized Packets Model: ATM- Networking Devices: Multiplexers, Modems and Internet Access Devices, Switching and Routing Devices, Router Structure. UNIT-II The Link Layer and Local Area Networks: Link Layers: Introduction and Services, Error-Detection and Error-Correction techniques, Multiple Access protocols, Link Layer Addressing, Ethernet, Interconnections: Hubs and Switches, PPP: The Point-to-Point Protocol, Link Virtualization. Routing and Internetworking: Network-Layer Routing, Least –cost-path algorithms, non-least-cost-path algorithms, Intradomain Routing Protocols, Interdomain Routing Protocols, Congestion control at Network Layer UNIT-III Logical Addressing: IPV4 Addresses, IPV6 Addresses – Internet Protocol: Internetworking, IPV4, IPV6, Transitions from IPV4 to IPV6 – Multicasting Techniques and Protocols: Basic Definitions and Techniques, Intradomain Multicast Protocols, Interdomain Multicast Protocols, Node-Level Multicast algorithms- Transport

and End-to-End Protocols: Transport Layer, Transmission Control Protocols (TCP),User Datagram Protocol Applications, The Web and HTTP, File Transfer: FTP, Electronic Mail in the Internet, Domain Name System (DNS) , P2P File sharing, Socet Programming with TCP and UDP , Building a Simple Web Server UNIT-IV Wireless Networks and Mobile IP: Infrastructure of Wireless Networks, Wireless LAN Technologies, IEEE 802.11 Wireless Standard, Cellular Networks Mobile IP, Wireless Mesh Networks (WMNs)-Optical Networks and WDM Systems: Overview of Optical Networks, Basic Optical Networking Devices, Large- Scale Optical Switches, Optical Routers, Wavelength Allocations in Networks, Case Study: An All-optival Switch UNIT-V VPNs,Tunneling and Overlay Networks : Virtual Private Networks(VPNs) , Multiprotocol Label

Switching(MPLS), Overlay Networks –VoIP and Multimedia Networking : Overview of IP Telephony , VoIP

Signaling Prtocols, Real-Tim Media Transport Protosols ,Distributed Multimedia Networking , Stream Control Transmission Protocol-Mobile A-Hoc Networks : Overview of Wireless Ad-Hoc Networks, Routing in Ad-Hoc

Networks, Routing Protocols for Ad-Hoc Networks – wireless Sensor Networks : Networks and Protocols

Structures, Communication Energy Model, Clustering Protocols, Routing Protocols TEXT BOOKS:

1. Computer Networking: A Top Down Approach Featuring the Internet, James F.Kurose,Keith W.Ross,Third edition,Pearson Education,2007

2. Computer and Communication networks, Nader F.Mir, Pearson Education, 2007

SWARNANDHRA





BIG DATA

UNIT I INTRODUCTION TO BIG DATA Introduction to BigData Platform – Traits of Big data -Challenges of Conventional Systems - Web Data – Evolution Of Analytic Scalability - Analytic Processes and Tools - Analysis vs Reporting - Modern Data Analytic Tools - Statistical Concepts: Sampling Distributions - Re-Sampling - Statistical Inference - Prediction Error. UNIT II DATA ANALYSIS Regression Modeling - Multivariate Analysis - Bayesian Modeling - Inference and Bayesian Networks - Support Vector and Kernel Methods - Analysis of Time Series: Linear Systems Analysis - Nonlinear Dynamics - Rule Induction - Neural Networks: Learning And Generalization - Competitive Learning - Principal Component Analysis and Neural Networks - Fuzzy Logic: Extracting Fuzzy Models from Data - Fuzzy Decision Trees - Stochastic Search Methods. UNIT IIIMINING DATA STREAMS Introduction To Streams Concepts – Stream Data Model and Architecture - Stream Computing - Sampling Data in a Stream – Filtering Streams – Counting Distinct Elements in a Stream – Estimating Moments – Counting Oneness in a Window – Decaying Window - Real time Analytics Platform(RTAP) Applications - Case Studies - Real Time Sentiment Analysis, Stock Market Predictions. UNIT IV FREQUENT ITEMSETS AND CLUSTERING Mining Frequent Itemsets - Market Based Model – Apriori Algorithm – Handling Large Data Sets in Main Memory – Limited Pass Algorithm – Counting Frequent Itemsets in a Stream – Clustering Techniques – Hierarchical – K-Means – Clustering High Dimensional Data – CLIQUE And PROCLUS – Frequent Pattern based Clustering Methods – Clustering in Non-Euclidean Space – Clustering for Streams and Parallelism. UNIT V FRAMEWORKS AND VISUALIZATION MapReduce – Hadoop, Hive, MapR – Sharding – NoSQL Databases - S3 - Hadoop Distributed File Systems – Visualizations - Visual Data Analysis Techniques - Interaction Techniques; Systems and Analytics Applications - Analytics using Statistical packages-Approaches to modeling in Analytics – correlation, regression, decision trees, classification, association-Intelligence from unstructured information-Text analytics-Understanding of emerging trends and technologies-Industry challenges and application of Analytics TEXT BOOKS:

1. Michael Berthold, David J. Hand, “Intelligent Data Analysis”, Springer, 2007. 2. AnandRajaraman and Jeffrey David Ullman, “Mining of Massive Datasets”, Cambridge

SWARNANDHRA





Elective-1

MOBILE COMPUTING

Objectives: The main objective of this course is to provide the students with the competences required for understanding and using the communications component of an universal communications environment. Students will be provided, in particular, with the knowledge required to understandemerging communications networks, their computational demands, the classes of distributed services and applications enabled by these networks, and the computational means required to create the new networks and the new applications. UNIT I WIRELESS NETWORKS: Wireless Network, Wireless Network Architecture, Wireless Switching Technology, Wireless Communication problem, Wireless Network Reference Model, Wireless Networking Issues & Standards. MOBILE COMPUTING: Mobile communication, Mobile computing, Mobile Computing Architecture, Mobile Devices, Mobile System Networks, Mobility Management UNIT II WIRELESS LAN: Infra red Vs radio transmission, Infrastructure and Ad-hoc Network, IEEE 802.11: System Architecture, Protocol Architecture, 802.11b, 802.11a, Newer Developments, HIPERLAN 1, HIPERLAN 2, Bluetooth : User Scenarios, Architecture. UNIT III GLOBAL SYSTEM FOR MOBILE COMMUNICATIONS (GSM): Mobile Services, System Architecture, Protocols, Localization & Calling, Handover, Security. GPRS: GPRS System Architecture, UMTS: UMTS System Architecture. LTE: Long Term Evolution UNIT IV MOBILE NETWORK LAYER: Mobile IP: Goals, Assumptions, Entities and Terminology, IP Packet Delivery, Agent Discovery, Registration, Tunneling and Encapsulation, Optimizations, Dynamic Host Configuration Protocol (DHCP) UNIT V MOBILE TRANSPORT LAYER: Traditional TCP, Indirect TCP, Snooping TCP, Mobile TCP, Fast retransmit/fast recovery, Transmission /time-out freezing, Selective retransmission, Transaction oriented TCP, TCP over 2.5G/3G Wireless Networks. TEXT BOOKS:

1. Jochen Schiller, “Mobile Communications”, Pearson Education, Second Edition, 2008. 2. Dr. Sunilkumar, et al “Wireless and Mobile Networks: Concepts and Protocols”, Wiley India. 3. Raj Kamal, “Mobile Computing”, OXFORD UNIVERSITY PRESS.

SWARNANDHRA





COMPILER DESIGN

UNIT I: Overview of Compilation: Phases of Compilation-Lexical Analysis, regular grammar and regular expression for common programming language features, pass and phases of translation, interpretation, bootstrapping, data structures in compilation-LEX lexical analyzer generator. UNIT II: Parsing: Context free grammar, top down parsing – backtracking, LL(1),recursive descent parsing, predictive parsing, preprocessing steps required for predictive parsing. Bottom up Parsing: -shift reduces parsing, LR and LALR Parsing, Error recovery parsing, handling ambiguous grammar. YACC – automatic parser generator. UNIT III: Semantic analysis: Intermediate forms of source programs-abstract syntax tree, Attributed grammars, syntax directed translation, conversion of popular programming languages, language constructs into intermediate code forms, type checker. Symbol Tables: Symbol Table format, organization for block structured languages, hashing, tree structures representation of scope information, block structures and nonblack structures storage allocation: static, run time stack and heap storage allocation, storage allocation for arrays, strings and records. UNIT IV: Code Generation: Processing the intermediate code – interpretation, code generation, simple code generation, code generation for basic blocks, BURS code generation and dynamic programming, register allocation by graph coloring, evaluation of code generation techniques preprocessing the intermediate code, post processing the target code, machine code generation. Code Optimization: Consideration for optimization, machine dependent and machine independent code optimization, scope of optimization, local optimization, loop optimization, frequency reduction, folding, and DAG representation. UNIT V: Data flow Analysis: Dataflow analysis, intermediate representation for flow analysis, various data flow analysis, trasfermation using data flow analysis speeding up data flow analysis, alias analysis Loop Optimization:-Dominators, loop-invariant competations, induction variables, Array bounds checks, loop unrolling. TEXT BOOKS:

1. Principles of compi; ler design – A.V. Aho. J.D. Ullman ; pearson Education 2. Modern Compiler Design – Dick Grune, Henry E. BAL, Cariel T.H. Jacobs , Wiley dreantech.

SWARNANDHRA





HUMAN COMPUTER INTERACTION

UNIT - I

Introduction: Importance of user Interface, definition, importance of good design. Benefits of good design. A brief

history of Screen design

The graphical user interface: Popularity of graphics, the concept of direct manipulation, graphical system,

Characteristics, Web user – interface popularity, characteristics- Principles of user interface. UNIT - II

Design process: Human interaction with computers, importance of human characteristics human consideration,

Human interaction speeds, understanding business junctions. UNIT- III

Screen Designing : Design goals, Screen planning and purpose, organizing screen elements, ordering of screen

data and content, screen navigation and flow, Visually pleasing composition, amount of information, focus and

emphasis, presentation information simply and meaningfully, information retrieval on web, statistical graphics,

Technological consideration in interface design. UNIT- IV

Windows: Windows new and Navigation schemes selection of window, selection of devices based and screen

based controls.

Components : Components text and messages, Icons and increases, Multimedia, colors, uses problems, choosing

colors. UNIT- V

Software tools : Specification methods, interface, Building Tools.

Interaction Devices: Keyboard and function keys, pointing devices, speech recognition digitization and

generation, image and video displays, drivers.

TEXT BOOKS : 1. Human Computer Interaction. 3/e, Alan Dix, Janet Finlay, Goryd, Abowd, Russell Beal, PEA,2004. 2. The Essential guide to user interface design,2/e, Wilbert O Galitz, Wiley DreamaTech. REFERENCE BOOKS : 1. Designing the user interface. 4/e, Ben Shneidermann , PEA. 2. User Interface Design, Soren Lauesen , PEA. 3. Interaction Design PRECE, ROGERS, SHARPS, Wiley . 4. Human Computer, Interaction Dan R.Olsan, Cengage ,2010.

SWARNANDHRA





Elective-2

IMAGE PROCESSING UNIT – I Fundamental steps of image processing, components of an image processing of system. The image model and image acquisition, sampling and quantization, relationship between pixels, distance functions, scanner. UNIT – II Statistical and spatial operations, Intensity functions transformations, histogram processing, smoothing & sharpening – spatial filters Frequency domain filters, homomorphic filtering, image filtering & restoration. Inverse and weiner filtering, FIR weiner filter, Filtering using image transforms, smoothing splines and interpolation. Morphological and other area operations, basic morphological operations, opening and closing operations, dilation erosion, Hit or Miss transform, morphological algorithms, extension to grey scale images. UNIT- III Segmentation and Edge detection region operations, basic edge detection, second order detection, crack edge detection, gradient operators, compass and laplace operators, edge linking and boundary detection, thresholding, regionbased segmentation, segmentation by morphological watersheds. Image compression: Types and requirements, statistical compression, spatial compression, contour coding, quantizing compression, image data compression-predictive technique, pixel coding, transfer coding theory, lossy and lossless predictive type coding, Digital Image Water marking. UNIT –IV Representation and Description Chain codes, Ploygonal approximation, Signature Boundary Segments, Skeltons, Boundary Descriptors, Regional Descriptors, Relational Descriptors, Principal components for Description, Relational Descriptors UNIT V Pattern Recognition Fundamentals: Basic Concepts of pattern recognition, Fundamental problems in pattern recognition system, design concepts and methodologies, example of automatic pattern recognition systems, a simple automatic pattern recognition model Pattern classification: Pattern classification by distance function: Measures of similarity, Clustering criteria, K-means algorithm, and Pattern classification by likelihood function: Pattern classification as a Statistical decision problem, Bayes classifier for normal patterns. TEXT BOOKS:

1. Digital Image Processing Third edition, Pearson Education, Rafael C. Gonzalez, Richard E. Woods 2. Pattern recognition Principles: Julus T. Tou, and Rafel C. Gonzalez, Addision-Wesly Publishing Company

SWARNANDHRA





SOFT COMPUTING

UNIT I: INTRODUCTION TO SOFT COMPUTING AND NEURAL NETWORKS Evolution of Computing - Soft Computing Constituents – From Conventional AI to Computational Intelligence - Machine Learning Basics.OPTIMIZATION: Derivative based Optimization, Descent Methods, The Method of Steepest Descent, Classical Newton’s Method, Step Size Determination, Derivative-free Optimization, Genetic Algorithms, Simulated Annealing, Random Search – Downhill Simplex Search.ARTIFICIAL INTELLIGENCE : Introduction, Knowledge Representation, Reasoning, Issues and Acquisition: Prepositional and Predicate Calculus Rule Based knowledge Representation Symbolic Reasoning Under Uncertainity Basic knowledge Representation Issues Knowledge acquisition, Heuristic Search: Techniques for Heuristic search Heuristic Classification.State Space Search: Strategies Implementation of Graph Search Search based on Recursion Patent-directed Search Production System and Learning UNIT II: GENETIC ALGORITHMS Introduction to Genetic Algorithms (GA) – Applications of GA in Machine Learning - Machine Learning Approach to Knowledge Acquisition. UNIT III: NEURAL NETWORKS Machine Learning Using Neural Network, Adaptive Networks – Feed forward Networks – Supervised Learning Neural Networks – Radial Basis Function Networks - Reinforcement Learning – Unsupervised Learning Neural Networks – Adaptive Resonance architectures – Advances in Neural networks. UNIT IV: FUZZY LOGIC Fuzzy Sets – Operations on Fuzzy Sets – Fuzzy Relations – Membership Functions-Fuzzy Rules and Fuzzy Reasoning – Fuzzy Inference Systems – Fuzzy Expert Systems – Fuzzy Decision Making. UNIT V: NEURO-FUZZY MODELING Adaptive Neuro-Fuzzy Inference Systems – Coactive Neuro-Fuzzy Modeling – Classification and Regression Trees – Data Clustering Algorithms – Rulebase Structure Identification – Neuro-Fuzzy Control – Case studies.

APPLICATIONS OF COMPUTATIONAL INTELLIGENCE: Printed Character Recognition, Inverse Kinematics Problems, Automobile Fuel Efficiency Prediction, Soft Computing for Color Recipe Prediction TEXT BOOKS:

1. Jyh-Shing Roger Jang, Chuen-Tsai Sun, Eiji Mizutani, “Neuro-Fuzzy and Soft Computing”, Prentice-Hall of India, 2003.

2. George J. Klir and Bo Yuan, “Fuzzy Sets and Fuzzy Logic-Theory and Applications”, Prentice Hall, 1995. 3. James A. Freeman and David M. Skapura, “Neural Networks Algorithms, Applications, and Programming

Techniques”, Pearson Edn., 2003.

SWARNANDHRA





DESIGN PATTERNS UNIT I Envisioning Architecture The Architecture Business Cycle, What is Software Architecture, Architectural patterns, reference models, reference architectures, architectural structures and views. Creating an Architecture Quality Attributes, Achieving qualities, Architectural styles and patterns, designing the Architecture, Documenting software architectures, Reconstructing Software Architecture. UNIT II Analyzing Architectures Architecture Evaluation, Architecture design decision making, ATAM, CBAM. UNIT III Moving from one system to many Software Product Lines, Building systems from off the shelf components, Software architecture in future. UNIT IV Patterns Pattern Description, Organizing catalogs, role in solving design problems, Selection and usage. Creational and Structural patterns Abstract factory, builder, factory method, prototype, singleton, adapter, bridge, composite, façade, flyweight, Proxy.

UNIT V Behavioral patterns Chain of responsibility, command, Interpreter, iterator, mediator, memento, observer, state, strategy, template method, visitor. Case Studies A-7E – A case study in utilizing architectural structures, The World Wide Web - a case study in interoperability, Air Traffic Control – a case study in designing for high availability, Celsius Tech – a case study in product line development TEXT BOOKS:

1. Software Architecture in Practice, second edition, Len Bass,Paul Clements Rick Karman, Pearson Education,2003.

2. Design Patterns, Erich Gamma, Pearson Education, 1995.

SWARNANDHRA





Elective-3 ADVANCED UNIX PROGRAMMING

UNIT-1: Introduction to Unix file system. Vi editor, File handling utilities, security by file permissions, process utilities, disk utilities, Networking commands, cp, mv, ln, rm, unlink, mkdir, rmdir, du, df, mount, umount, find, umask, ulimit, ps, who, w, finger, arp, ftp, telnet, rlogin.Text processing utilities and backup utilities detailed commands to be covered are: cat, tail, head, sort, nl, uniq, grep, egrep, fgrep, cut, paste, join, tee, more, pg, comm., cmp, diff, tr, awk, tar, cpio.What is a shell, shell responsibilities, pipes and input redirection, Output redirection and here documents, the shell as programming Language shell variables, conditions, history and control structures and shell programming.

UNIT-2: Unix Internals - 1

Unix file structure, directories, files and devices, system calls and device drivers, library functions, low-level file access (write, read, open, close, ioctl, lseek, fstat, stat, dup and dup2), the standard I/O (fopen, fread, fclose,fflush, fseek, fgetc, getc, getchar, fputc, putc, putchar, fgets, gets), formatted, I/O stream errors, streams, and file descriptors, file and directory maintainance (chmod, chown, unlink, link symlink, mkdir, rmdir, chdir, getcwd).

UNIT-3: Unix internals – 2

Process and signals:- what is process, process structure, starting new process, waiting for a process, zombie process, process control, process identifiers, fork function, vfork, exit, wait, exec, system, functions, user identification, process times. Signal: Signal functions, reliable signals, interrupted system calls, kill and raise functions, alarm, pause functions, abort, system, sleep functions.

UNIT-4 . Unix Internals – 3

Data Management:- Management Memory (simple memory allocation, freeing memory) file locking (creating lock files, locking regions, use of read/write locking, competing locks, other commands, deadlocks).

UNIT-5: Unix Internals – 4

Inter-process:- Pipe, process pipes, the pipe call, parent-child process, named pipes: FIFOs), Semaphores, message queues and shared memory applications of IPC.

References:

1. Advanced programming in Unix Environment (W. Richard Stevens). 2. Unix Network Programming (W. Richard Stevens).

University Press, 2012. 3. Bill Franks, “Taming the Big Data Tidal Wave: Finding Opportunities in Huge Data

Streams with Advanced Analytics”, John Wiley & sons, 2012. 4. Glenn J. Myatt, “Making Sense of Data”, John Wiley & Sons, 2007

SWARNANDHRA





5. Pete Warden, “Big Data Glossary”, O’Reilly, 2011. 6. Jiawei Han, MichelineKamber “Data Mining Concepts and Techniques”, Second Edition,

Elsevier, Reprinted 2008. 7. ONLINE RESOURCE:http://www.ee.columbia.edu/~cylin/course/bigdata/

BIOINFORMATICS

Objectives: This course is formulated to provide students an in depth knowledge of biological data analysis using compilation methods. It is also useful for investigating molecular biology problems from computational perspective. Outcome: At the end students gain expertise with existing tools and resources for computational analysis of biological data. They develop an understanding of problems related to genomics and proteomics, which will be useful in the modeling & analysis of living system. UNIT-I INTRODUCTION TO BIOINFORMATICS & SEQUENCING ALIGNMENT CONCEPTS: Need of Computers in Biotechnology Research; File Transfer Protocol (FTP), TELNET,HTTP; Bioinformatics- Introduction, Scope, Applications; Strings, Edit distance, Pair wise Alignment-Local, Global alignment; Gap- Gap penalty; Comparison of Pair wise and Multiple alignment. UNIT-II BIOLOGICAL DATABASES AND DATAMINING: Biological Information on the web-Introduction to databases; Classification of Biological databases; Information retrieval from Databases; Sequence database search- FASTA, BLAST; Amino acid substitution matrices- PAM and BLOSUM; Data Mining and Visualization (RASMOL). UNIT-III PHYLOGENETIC ANALYSIS AND PREDICTION: Understanding Evolutionary process; Origins of Molecular Phylogenetics; Common Multiple Sequence alignment methods; Phylogenetic analysis: Methods, Tools & Problems (Clustal W). UNIT-IV GENOME MAPPING AND PREDICTION: Genome sequencing; Genome Mapping; Comparative Sequence Analysis; Gene Prediction Methods &Tools, Gene Annotation; Human Genome Mapping (HGP). RNA Sequence and Structure Analysis - si-RNA design and development, micro RNA identification strategies, RNA secondary structure, RNA structure Prediction Methods. UNIT-V PROTEIN STRUCTURE PREDICTION METHODS: Basics of Protein biology (Classification, Structural Organization, Domains & Motifs); Protein Structure Prediction Concepts : Secondary & Tertiary Structure Predictions (Chou-Fasman Method, GOR Method, Neural Network method, Homology Modeling, Abintio method, Threading methods). TEXT BOOKS:

1. Bioinformatics. Genome and sequence analysis by David Mount, CSH Publications 2. Essential Bioinformatics by Jin Xiong, Cambridge University Press, 2011.

REFERENCE BOOKS: 1. Computational Molecular Biology – An Introduction by Peter Clote, Rolf Backofen, John Wiley & Sons. 2. Bioinformatics: Methods and Applications- SC Rastogi, N Mendiratta & P Rastogi. 3. Bioinformatics Principles & Applicatrions by Zhumur Ghosh, Oxford University Press

SWARNANDHRA





CS LAB- II (COVERING THE EXPERIMENTS OF INFORMATION SECURITY, MOBILE APPLICATION DEVELOPMENT LAB) INFORMATION SECURITY LAB. 1. Working with Sniffers for monitoring network communication (Ethereal) 2. Understanding of cryptographic algorithms and implementation of the same in C or C++ 3. Using open SSL for web server - browser communication 4. Using GNU PGP 5. Performance evaluation of various cryptographicalgorithms 6. Using IP TABLES on Linux and setting the filtering rules 7. Configuring S/MIME for e-mail communication 8. Understanding the buffer overflow and format string attacks 9. Using NMAP for ports monitoring 10. Implementation of proxy based security protocols in C or C++ with features like confidentiality, integrity and authentication 11. Socket programming 12. Exposure to Client Server concept using tcp/ip,blowfish, Pretty Good Privacy MOBILE APPLICATION DEVELOPMENT LAB 1.Installation of Java Wireless Toolkit (J2ME) 2 .Working with J2ME Features 3 . Threads & High Level UI 4 . Working on Drawing and Images 5 . Developing Networked Applications using the Wireless Toolkit 6 . Authentication with a Web Server

end

mtech course structure -cse(2014-2015)

Documents