NOIDA INTERNATIONAL UNIVERSITY GREATER NOIDA

MASTER OF SCIENCE (COMPUTER SCIENCE) (2 Years Course) 1st to 4th semester

The Course of Study and the Scheme of Examinations

1st Semester S.No Course Code Subject Period Evaluation Scheme Total

Credits Sessional Exam External

Exam Subject Total

L T P CA TA Total

1 MCS-101 Computer and C Programming.

3 1 0 20 20 40 60 100 4

2 MCS -102 Advanced DBMS 3 1 0 20 20 40 60 100 4

3 MCS -103 Discrete Mathematics Structure 3 1 0 20 20 40 60 100 4

4 MCS -104 Computer Organization and Architecture

3 1 0 20 20 40 60 100 4

5 MCS -105 Advanced Industrial Communication 4 0 0 20 20 40 60 100 2

PRACTICALS

6 MCS -151 (Lab)

C-Programming Lab

0 0 4 - - 40 60 100 2

7 MCS -152 (Lab) Advanced DBMS Lab 0 0 4 - - 40 60 100 2

Total 700 22

2nd Semester

S.No Course Code Subject Period Evaluation Scheme Total Credits Sessional Exam External

Exam Subject Total

L T P CA TA Total

1 MCS -201 Data Structure Using C 3 1 0 20 20 40 60 100 4

2 MCS -202 Software Engineering 3 1 0 20 20 40 60 100 4

3 MCS -203 Computer Network 3 1 0 20 20 40 60 100 4

4 MCS -204 Operating System 3 1 0 20 20 40 60 100 4

5 MCS -205 Information Security and Cyber Law 3 1 0 20 20 40 60 100 4

PRACTICALS

6 MCS-251 Data Structure Using C Lab

0 0 4 - - 40 60 100 2

7 MCS -252 Operating System Lab 0 0 4 - - 40 60 100 2

Total 700 24

3rd Semester

S.No Course Code

Subject Period Evaluation Scheme Total Credits Sessional Exam External

Exam Subject Total

L T P CA TA Total

1 MCS -301 Object-Oriented Programming using UML

3 1 0 20 20 40 60 100 4

2 MCS -302 Design and Analysis of Algorithm

3 1 0 20 20 40 60 100 4

3 MCS -303 Data Mining & Warehousing 3 1 0 20 20 40 60 100 4

4 MCS -304 Theory of Computation 3 1 0 20 20 40 60 100 4

5. MCS-305 Compiler Design/Cryptography and Network Security

3 1 0 20 20 40 60 100 4

PRACTICALS

5 MCS -351 (Lab)

OOP using UML Lab

0 0 4 - - 40 60 100 2

6 MCS -352 (Lab)

Design and Analysis of Algorithm Lab 0 0 4 - - 40 60 100 2

Total 700 24

4th Semester

1. MCS-401 .Net Framework 3 1 0 20 20 40 60 100 4

2. MCS-402 Entrepreneurship 3 1 0 20 20 40 60 100 4

SEMESTER 1

MCS 101 COMPUTER PROGRAMMING WITH C

Computer Programming with C Code: MCS -101 CONTACTS: 3L + 1 T CREDITS: 4

3 MCS-451 .Net Framework Lab 2 0 0 20 20 40 60 100 2

4 MCS-452 Industrial Project 0 0 10 - - 200 300 500 10

Total 800 20

Unit – I: C Fundamentals: Character Set, Identifier & Keywords, Data Types, Variables, Operators and expressions, Symbolic Constants, Preprocessor Directives, and Library Functions.

Unit – II: Control Structure and Functions: If statement, if-else statement, nested if-else, conditional operators, while, do-while and for loop, multiple initialization of for loop, break and continue statement. Function definition, passing values between functions, call by value and call by reference.

Unit – III: Arrays and Structure: Definition and classification of arrays, string definition and standard library string functions, defining a structure, Array vs Structure, Initialization of a structure, Nested structure

Unit – VI: Pointers and File Handling: Pointers variables, Pointer operator, array of pointer, pointers to functions, dynamic allocation functions, File I/O: Types of I/O, console I/O functions sfrintf() and sscanf() functions, file operations, file opening modes, record I/O in files

Reference: 1.Let Us C:Yashvint Kanitkar[BPB] 2.C The Complete Reference,rdSchildt, TMH 3.Practical C Programming,3 Ed,Oualline,SPD/O'REILLY

MCS 102 ADVANCE DATABASE MANAGEMENT SYSTEM

Advance Database Management System Code: MCS- 102 CONTACTS: 3L + 1 T CREDITS: 4 Unit I Data base system vs. file system, data models, , relational model, database languages, DDL, DML, database access for applications programs, data base users and administrator, transaction

management, history of data base systems, data base design and ER diagrams, attributes and entity sets, relationships and relationship sets, additional features of ER model, concept design with the ER model, and conceptual design for large enterprises, Codds Rules.

Unit II Data Base Design: Functional Dependency and Decomposition - Functional Dependency - Decomposition. Normalization - Introduction - Normalization - Normal Forms INF, 2NF, 3NF - BCNF - 4 NF - 5 NF. Unit III Examples of basic SQL queries, nested queries, correlated nested queries set, comparison operators, aggregative operators, NULL values, comparison using null values, logical connectivity, AND, OR and NOTR, impact on SQL constructs, outer joins, disallowing NULL values, complex integrity constraints in SQL triggers and active data bases.

Unit IV Data Base Recovery Systems: Introduction - Recovery Concepts - Types of Failures - Types of Recovery - Recovery Techniques - Buffer Management. Data Base Security: Goals - Firewalls - Data Encryption Unit V ACID properties, transactions and schedules, concurrent execution of transaction, lock based concurrency control, performance locking, and transaction support in SQL, crash recovery, concurrency control, Serializability and recoverability, lock management, lock conversions, dealing with dead locks, specialized locking techniques, concurrency without locking, crash recovery:

References:

1. Elmasri Navathe, Data Base Management System, Pearson Education, 2008. 2. S.K. Singh, ”Database Systems Concepts, Design and Applications”, Pearson Education Pte. Ltd., New Delhi: 2006. 3. C. J. Date, Introduction to Database Systems, Pearson Education, 2009. 4. Silberschatz, Korth, Database System Concepts, McGraw hill, 5th edition, 2005. 5. Rob, Coronel & Thomson, Database Systems Design: Implementation and Management, 2009.

MCS 103 DISCRETE MATHEMATICS STRUCTURE Discrete Mathematics Structure Code: MCS - 103 CONTACTS: 3L + 1 T CREDITS: 4 Unit I Properties of binary relations, equivalence, compatibility and partial ordering relations, functions: inverse function comports of functions, recursive functions, lattice and its properties,

algebraic structures: algebraic systems examples and general properties, semi groups, groups sub groups‟ homomorphism, isomorphism. Unit II Statements and notations, connectives, well-formed formulas, truth tables, tautology, equivalence implication, normal forms, predicates: predicative logic, free & bound variables, rules of inference, consistency, proof of contradiction, automatic theorem proving. Unit III Basis of counting, combinations & permutations, with repetitions, constrained repetitions, binomial co-efficient, binomial multinomial theorems, the principles of inclusion – exclusion. Unit IV Generating functions, function of sequences calculating coefficient of generating function, recurrence relations, solving recurrence relation by substitution and generating funds, characteristics roots solution of in homogeneous recurrence relation. Unit V Representation of graph, DFS, BFS, spanning trees, planar graphs.graph theory and applications, basic concepts isomorphism and sub graphs, multi graphs and Euler circuits, Hamiltonian graphs, chromatic numbers References:

1. Discrete and Combinational Mathematics- An Applied Introduction-5th Edition – Ralph. P.Grimaldi, Pearson Education 2. Discrete Mathematical Structures with applications to computer science Trembly J.P. &Manohar .P, TMH 3. Discrete Mathematics and its Applications, Kenneth H. Rosen, Fifth Edition.TMH. 4. Discrete Mathematics with Applications, Thomas Koshy, Elsevier 5. Discrete Mathematical Structures, BernandKolman, Roberty C.

MCS 104 COMPUTER ORGANIZATION AND ARCHITECTURE

Computer Organization and Architecture Code: MCS -104 CONTACTS: 3L + 1 T CREDITS: 4 Unit I Basis Computer Architecture, Functional Organisation, Register Organisation, Arithmetic and Logic Unit, Central Processing unit, Instruction Formats. CPU architecture, instruction format, addressing mode, stacks and handling of interrupts. Assembly language - Elementary problems

Unit II

Addressing Modes. Data Transfer and Manipulation, interrupts RISC/CISC architecture.

Register transfer and macro-operations, Register Transfer Languages (RTL). Arithmetic, Logic and Shift Macro-operations, Sequencing, Micro-program sequences.

Unit III

Memory & Storage: Processor Vs. Memory speed: Cache memory. Associative memory, Virtual memory and Memory management. Pipeline & vector processing

Unit IV

Input/ Output organization: Peripheral devices, I/O Asynchronous Data Transfer: Strobe Control, Data Transfer Schemes (Programmed, Initiated, DW, Transfer)

Unit V

Memory Hierarchy, Main Memory, Auxiliary Memory, Cache Memory

Books:

Ø Moris Mano, “Computer System Architecture”, PHI Publications, 2002. Ø R. P. Jain, “Modern Digital Electronics”, TMH, 3rd Edition, 2003. Ø Computer System Architecture (Third Edition),. Morris Mono - Pearson Prentice

Hall,2007.

MCS 105 INDUSTRIALCOMMUNICATION INDUSTRIAL COMMUNICATION Code: MCS- 105 CONTACTS: 2 L + 0 T CREDITS: 2 UNIT-I (Business Communication) Difference between general and business communication, this should cover general and technical writing, oral communications and listening skill. UNIT-II (Expression) Expression: Practical communication skill development, business presentation with multimedia,

speaking skill, prepared speech, extempore speech UNIT-III (Reading Skills) Reading skill: comprehension test, technical report writing, writing: precise, technical/business letter, organization of writing material, poster presentation UNIT-IV (Literature) Of Studies: Francis Bacon UNIT-V (Presentation) Writing technical document, preparing software user manual, preparing project documentation. Reference: 1.Business Correspondence & Report Writing, Sharma, TMH 2.Business Communication Strategies, Monipally, TMH 3.English for Technical Communication ,Laxminarayanan,Scitech 4. Business Communication, Kaul,PHI

MCS-151- C-Programming Lab- (Based ON Theory MCS 101) MCS-152- Advanced DBMS Lab- (Based ON Theory MCS 102)

SEMESTER 2

MCS 201 DATA STRUCTURE USING - C DATA STRUCTURE USING - C Code: MCS- 201 CONTACTS: 3L + 1 T CREDITS: 4 Unit-I

Arrays: Representation of single and multidimensional arrays; sparse arrays - lower and upper triangular matrices and Tri-diagonal matrices.

Unit-II

Stacks and Queues: Introduction and primitive operations on stack; Stack application, Infix, postfix, prefix expressions; Evaluation of postfix expression; Conversion from infix to postfix, Introduction and primitive operation on queues. Unit-III

Lists: Introduction to linked lists; Sequential and linked lists, operations such as traversal, insertion, deletion, searching, Two way lists and Use of headers. Trees: Introduction and terminology; Traversal of binary trees; Recursive algorithms for tree operations such as traversal, insertion, deletion; threaded trees, binary search trees, trees in search algorithm. B- tree. B+ tree and applications. Unit-IV

Sorting Techniques: Insertion sort, selection sort, merge sort, heap sort. Searching Techniques: Linear search, binary search and hashing. Unit-V

File structure: physical storage devices and their characteristics, constituents of a file viz. fields, records, fixed and variable length records, primary and secondary keys; file operations, basic file system operations, file organizations: serial sequential, index sequential, direct , inverted, hashing function and collision handling methods. Reference:

Ø E. Horowitz and S. Sahani, “Fundamentals of Data Structures”, Galgotia Booksource Pvt. Ltd,

Ø 2003 Ø R. S. Salaria, “Data Structure & Algorithms”, Khanna Book Publishing Co. (P) Ltd.,

2002. Ø P. S. Deshpande and O.G. Kakde, “C & Data Structure”, Wiley Dreamtech, 1stEdition,

2003. Ø Y. Langsam et. al., “Data Structures using C and C++”, PHI, 1999. Ø Schaum’s outline series, “Data Structure”, TMH, 2002

MCS 202 SOFTWARE ENGINEERING

SOFTWARE ENGINEERING Code: MC S- 202 CONTACTS: 3L + 1 T CREDITS: 4

UNIT-1 Introduction Software life cycle models: Waterfall, Prototype,Evolutionary and Spiral models, Overview of Quality Standards like ISO 9001, SEI-CMM.

UNIT-2 Software Metrics and Project Planning Size Metrics like LOC, Token Count, Function Count, Design Metrics, Data Structure Metrics, Information Flow Metrics. Cost estimation, static, Single and multivariate models, COCOMO model, Putnam Resource Allocation Model, Risk management.

UNIT-3 Software Requirement Analysis, design and coding Problem Analysis, Software Requirement and Specifications, Behavioural and non-behavioural requirements, Software Prototyping Cohesion & Coupling, Classification of Cohesiveness & Coupling, Function Oriented Design, Object Oriented Design, User Interface Design Top-down and bottom-up Structured programming, Information hiding.

UNIT-4 Software Reliability, Testing and Maintenance Failure and Faults, Reliability Models: Basic Model, Logarithmic Poisson Model, Software process, Functional testing: Boundary value analysis, Equivalence class testing, Decision table testing, Cause effect graphing, Structural testing: path testing, Data flow and mutation testing, unit testing, integration and system testing, Debugging, Testing Tools, & Standards. Management of maintenance, Maintenance Process, Maintenance Models, Reverse Engineering, Software RE-engineering.

UNIT-5 UML: Introduction to UML, Use Case Diagrams, Class Diagram: State Diagram in UML Activity Diagram in UML. Sequence Diagram in UML Collaboration Diagram in UML

Reference: • Text: K. K. Aggarwal & Yogesh Singh, .Software Engineering., 2nd Ed, New Age

International, 2005. • R. S. Pressman, ―Software Engineering – A practitioner‘s approachǁ, 5th Ed., McGraw

Hill Int. Ed., 2001.

MCS 203 COMPUTER NETWORKS

Computer Networks Code: MC S -203 CONTACTS: 3L + 1 T CREDITS: 4 Unit-I

Data communications concepts: Digital and analog , parallel and serial, synchronous and asynchronous, simplex, half duplex, duplex, multiplexing, Transmission media: Wired (physical): Twisted pair, Coaxial cable, Optical Fiber.

Communication switching techniques: Circuit switching, message switching, packet switching. Unit-II

Introduction to Computer Network : Network Topologies, Types of Network, OSI and TCP/IP Models: Layers and their functions, comparison of models. Data Link Layer Fundamentals: Framing, Basics of Error Detection, Forward Error Correction, Cyclic Redundancy Check codes for Error Detection. Unit-III

Media Access Protocols : The advantages of Multiple-Access Sharing of Channel Resource, ALOHA, Carrier Sense Multiple Access (CSMA), CSMA with Collision Detection (CSMA/CD), Token Ring, Token Bus, Asynchronous Transfer Mode (ATM). Unit-IV

Network Layer: Host to Host Delivery: IP Addressing and Routing, Gateway, N/W Layer Protocols: ARP, IPV4, ICMP, IPV6. Transport Layer: Process-to-Process Delivery: UDP, TCP Congestion Control & Quality of Service. Unit-V

Application Layer: Client Server Model, Domain Name System (DNS), E-mail (SMTP), File Transfer (FTP) and Model TCP/IP. Reference:

Ø A.S. Tanebaum : Computer Networks (4th ed.), Prentice-Hall of India. Ø W. Tomasi : Introduction to Data Communications and Networking, Pearson, Education. Ø P.C. Gupta : Data Communications and Computer Networks, Prentice-Hall of India. Ø Behrouz Forouzan and S.C., Fegan : Data Communications and Networking, McGraw

Hill. Ø L.L. Peterson and B.S. Davie : Computer Networks : A system Approach, Morgan

Kaufmann. Ø William Stalilngs : Data and Computer Communications, Pearson Education.

MCS-204 OPERATING SYSTEM

OPERATING SYSTEM Code: MC S- 204 CONTACTS: 3L + 1 T CREDITS: 4

Unit-I

Fundamentals of Operating system: Introduction to Operating System, its need and Operating System services, Early systems, Structures - Simple Batch, Multi programmed, timeshared, Personal Computer, Parallel, Distributed Systems, Real-Time Systems. Process Management: Process concept, Operation on processes, Cooperating Processes, Threads, and Inter-process Communication. Unit-II

CPU Scheduling: Basic concepts, Scheduling criteria, Scheduling algorithms : FCFS, SJF, Round Robin & Queue Algorithms. Deadlocks: Deadlock characterization, Methods for handling deadlocks, Banker’s Algorithm. Unit-III

Memory Management: Logical versus Physical address space, Swapping, Contiguous allocation, Paging, Segmentation. Virtual Memory: Demand paging, Performance of demand paging, Page replacement, Page replacement algorithms, Thrashing. Unit-IV

File management: File system Structure, Allocation methods: Contiguous allocation, Linked allocation, Indexed allocation, Free space management: Bit vector, Linked list, Grouping, Counting.

Unit-V

Device Management: Disk structure, Disk scheduling: FCFS, SSTF, SCAN, C-SCAN, LOOK, C-LOOK. References:

Ø Abraham Silberschatz, Peter B. Galvin, “ Operating System Concepts”, Addison-Wesley Ø publishing. Co., 7th. Ed., 2004. Ø Nutt Gary, "Operating Systems", Addison Wesley Publication, 2000. Ø Andrew S. Tannenbaum, "Modern Operating Systems", Pearson Education Asia, Second Ø Edition, 2001. Ø William Stallings, "Operating Systems, "Internals and Design Principles", 4th Edition,

PH, Ø 2001. Ø Ekta Walia, "Operating Systems Concepts", Khanna Publishes, New Delhi, 2002.

MCS- 205 INFORMATION SECURITY AND CYBER SECURITY

INFORMATION SECURITY AND CYBER SECURITY Code: MC S- 205 CONTACTS: 3L + 1 T CREDITS: 4

UNIT-I

History of Information Systems and its Importance, basics, Changing Nature of Information Systems, Need of Distributed Information Systems, Role of Internet and Web Services, Information System Threats and attacks, Classification of Threats and Assessing Damages. UNIT-II Basic Principles of Information Security, Confidentiality, Integrity Availability and other terms in Information Security, Information Classification and their Roles. Security Threats to E Commerce, Virtual Organization, Business Transactions on Web, E-Governance and EDI, Concepts in Electronics payment systems, E Cash, Credit/Debit Cards. UNIT-III Physical Security- Needs, Disaster and Controls, Basic Tenets of Physical Security and Physical Entry Controls, Access Control- Biometrics, Factors in Biometrics Systems, Benefits, Criteria for selection of biometrics, Design Issues in Biometric Systems, Interoperability Issues, Economic and Social Aspects, Legal Challenges. UNIT-IV Model of Cryptographic Systems, Issues in Documents Security, System of Keys, Public Key Cryptography, Digital Signature, Requirement of Digital Signature System, Finger Prints, Firewalls, Design and Implementation Issues, Policies. Network Security- Basic Concepts, Dimensions, Perimeter for Network Protection, Network Attacks, Need of Intrusion Monitoring and Detection, Intrusion Detection. UNIT-V Laws, Investigation and Ethics: Cyber Crime, Information Security and Law, Types & overview of Cyber Crimes, Cyber Law Issues in E-Business Management. Overview of Indian IT Act, Ethical Issues in Intellectual property rights, Copy Right, Patents, Data privacy and protection, Domain Name, Software piracy, Plagiarism, Issues in ethical hacking. References :

Ø Godbole,“ Information Systems Security”, Willey Ø Merkov, Breithaupt,“ Information Security”, Pearson Education Ø Yadav, “Foundations of Information Technology”, New Age, Delhi Ø Schou, Shoemaker, “ Information Assurance for the Enterprise”, Tata McGraw Hill Ø Sood,“Cyber Laws Simplified”, Mc Graw Hill Ø Furnell, “Computer Insecurity”, Springer.

MCS-251: Data Structure Using C Lab- Lab (Based on Theory MCS-201) MCS-252: OPERATING SYSTEM Lab- Lab (Based on Theory MCS-204)

SEMESTER 3

MCS 301 OOPS USING UML

Oops Using UML Code: MCS- 301 CONTACTS: 3L + 1 T CREDITS: 4

UNIT I INTRODUCTION • An overview - Object basics - Object state and properties, Behavior, Methods, Messages. • Object Oriented system development life cycle. • Benefits of OO Methodology, Overview of Prominent OO Methodologies. Introduction to UML, Important views & diagram to be modelled for system by UML, Factional view(models): • Use case diagram, Requirement Capture with Use case, Building blocks of Use Case diagram - actors, use case guidelines for use case models, Relationships between use cases - extend, include, generalize, Activity diagram a. Elements of Activity Diagram - Action state, Activity state, Object node, Control and Object flow, Guidelines for Creating Activity Diagrams.

UNIT II Static structural view (Models)Classes, values and attributes, operations and methods, responsibilities for classes, abstract classes, access specification(visibility of attributes and operations). Relationships among classes: Associations, Dependencies., Inheritance - Generalizations, Aggregation. Adornments on Association: association names, association classes, qualified association, n-ary associations, ternary and reflexive association. Dependency relationships among classes, notations Notes in class diagram, Extension mechanisms, Metadata, Refinements, Derived , data, constraint, stereotypes, Package & interface notation.

UNIT III Class Modeling and Design Approaches: Three approaches for identifying classes - using Noun phrases, Abstraction, Use Case Diagram. Comparison of approaches. Using combination of approaches. Flexibility guidelines for class diagram: Cohesion, Coupling, Forms of coupling (identity, representational, subclass, inheritance), class Generalization, class specialization versus aggregation. Behavioral (Dynamic structural view): • State diagram, State Diagram Notations, events (signal events, change events, Time events). b. State Diagram states (composite states, parallel states, History states).

UNIT IV • Interaction diagrams: Sequence diagram - Sequence diagram notations and examples, iterations, conditional messaging, branching, object creation and destruction, time constraints, origin of links, Activations in sequence diagram. Collaboration diagram - Collaboration diagram notations and examples, iterations, conditional messaging, branching, object creation and destruction, time constraints, origin of links, activations in sequence diagram.

UNIT V Approaches for developing dynamic systems: Top - down approach for dynamic systems. Bottom - up approach for dynamic systems. Flexibility Guidelines for Behavioral Design - guidelines for allocating and designing behaviors that lead to more fexible design. Architectural view: a. Logical architecture: dependency, class visibility, sub systems. b. Hardware architecture: deployment diagram notations, nodes, object migration between node c. Process architecture: what are process and threads and their notations in UML, object synchronization, invocation schemes for threads ( UML notations for different types of invocations). d. Implementation architecture: component diagram notations and examples.

References:

l. Designing Flexible Object Oriented systems with UML - Charles Ritcher

2. Object Oriented Analysis & Design, Sat/.inger. Jackson, Burd Thomson

3. Object oriented Modeling and Design with UML - James Rumbaugh. Micheal Blaha (second edition)

4. The Unified Modeling Language User Guide - Grady Booch, James Rumbaugh, Ivar Jacobson.

5. Object Oriented Modeling and Design - James Rumbaugh

6. Teach Yourself UML in 24 Hours - Joseph Schmuilers

7. Object-Oriented Analysis and Design: using UML Mike O'Docherty Wiley Publication

.

MCS -302 DESGIN AND ANALYSIS OF ALGORITHM

Design and analysis of Algorithm Code: MC S- 302 CONTACTS: 3L + 1 T CREDITS: 4 UNIT-I Introduction - Algorithm - Specification - Performance Analysis - Divide - And Conquer

- General Method - Binary Search - Finding the Maximum and Minimum - Merge Sort - Quick Sort. UNIT-II The Greedy Method - General Method - Knapsack Problem - Tree Vertex Splitting Dynamic Programming - General Method - Multistage Graphs - All pairs shortest paths - Single - Source Shortest paths - The traveling salesperson problem - Flow shop scheduling. UNIT-III Basic Traversal and Search Techniques - Binary Trees - Graphs - Connected Components and Spanning Trees - Biconnected Components. UNIT-IV Backtracking - General Method - 8 Queens Problem - Graph Coloring - Branch and Bound - Method - 0/1 Knapsack Problem. UNIT-V NP-Hard and NP-Complete Problem - Basic Concepts - Cooke’s Theorem - NP-Hard Problems - Clique Decision Problem - Job Shop Scheduling - Code generation with Common Sub expressions - Approximation Algorithms - Introduction - Absolute Approximations - E-Approximations. Reference: 1. Sara Baase and Allen Van Gelde, “Computer Algorithms, Introduction to Design and Analysis”, 3rd Edition, Pearson Education, Delhi, 2002. 2. Aho, Hoporoft and Ullman, “The Design and Analysis of Computer Algorithm”, Pearson Education, Delhi, 2001. 3. Basu S.K.,”Design Methods and Analysis of Algorithms”, PHI, 2006. 4. Brassad and Bratley,”Fundamentals of Algorithms”, PHI, 1995. 5. Sanjoy Dasgupta, Christos Papadimitriou, Umesh vazirani, “Algorithms”, TMG, 2007.

MCS- 303 Data warehousing & Data Mining

Data Warehousing and Data Mining Code: MCS- 303 CONTACTS: 3L + 1 T CREDITS: 4 Unit I Data Warehousing: Overview, Definition, Data Warehousing Components, 8 Building a Data Warehouse, Warehouse Database, Mapping the Data Warehouse to a Multiprocessor

Architecture, Difference between Database System and Data Warehouse, Multi Dimensional Data Model, Data Cubes, Stars, Snow Flakes, Fact Constellations, Concept hierarchy, Process Architecture, 3 Tier Architecture, Data Marting.

Unit II Data Warehouse Process and Technology: Warehousing Strategy, Warehouse 8 /management and Support Processes, Warehouse Planning and Implementation, Hardware and Operating Systems for Data Warehousing, Client/Server Computing Model & Data Warehousing. Parallel Processors & Cluster Systems, Data Extraction, Cleanup & Transformation Tools, Warehouse Metadata

Unit III Data Mining: Overview, Motivation, Definition & Functionalities, Data 8 Processing, Form of Data Preprocessing, Data Cleaning: Missing Values, Noisy Data,(Binning, Clustering, Regression, Computer and Human inspection),Inconsistent Data, Data Integration and Transformation. Data Reduction:-Data Cube Aggregation, Dimensionality reduction, Decision Tree.

Unit IV Classification: Definition, Data Generalization, Analytical Characterization, Analysis of attribute relevance, Mining Class comparisons, Statistical measures in large Databases, Statistical-Based Algorithms, Distance-Based Algorithms, Decision Tree-Based Algorithms. Clustering: Introduction, Similarity and Distance Measures. Hierarchical Clustering- CURE and Chameleon. Density Based Methods-DBSCAN, OPTICS. Grid Based Methods- STING, CLIQUE. Model Based Method –Statistical Approach, Association rules: Introduction, Large Itemsets,

Unit V Data Visualization and Overall Perspective: Aggregation, Historical 8 information, Query Facility, OLAP function and Tools. OLAP Servers, ROLAP, MOLAP, HOLAP, Data Mining interface, Security, Backup and Recovery, Tuning Data Warehouse, Testing Data Warehouse.

References: 1. Alex Berson, Stephen J. Smith “Data Warehousing, Data-Mining & OLAP”, TMH 2. Mark Humphries, Michael W. Hawkins, Michelle C. Dy, “ Data Warehousing: Architecture and Implementation”, Pearson 3. Margaret H. Dunham, S. Sridhar,”Data Mining:Introductory and Advanced Topics” Pearson Education 4. Arun K. Pujari, “Data Mining Techniques” Universities Press 5. Pieter Adriaans, Dolf Zantinge, “Data-Mining”, Pearson Education

MCS- 304 THEORY OF COMPUTATION

Theory of Computation Code: MCS 304 CONTACTS: 3L + 1 T CREDITS: 4

Unit – I Introduction; Alphabets, Strings and Languages; Automata and Grammars, Deterministic finite Automata (DFA)-Formal Definition, Simplified notation: State transition graph, Transition table, Language of DFA, Nondeterministic finite Automata (NFA), NFA with epsilon transition, Language of NFA, Equivalence of NFA and DFA, Minimization of Finite Automata, Distinguishing one string from other, Myhill-Nerode Theorem

Unit – II Regular expression (RE) , Definition, Operators of regular expression and their precedence, Algebraic laws for Regular expressions, Kleen’s Theorem, Regular expression to FA, DFA to Regular expression, Arden Theorem, Non Regular Languages, Pumping Lemma for regular Languages . Application of Pumping Lemma, Closure properties of Regular Languages, Decision properties of Regular Languages, FA with output: Moore and Mealy machine, Equivalence of Moore and Mealy Machine, Applications and Limitation of FA.

Unit – III Context free grammar (CFG) and Context Free Languages (CFL): Definition, Examples, Derivation , Derivation trees, Ambiguity in Grammar, Inherent ambiguity, Ambiguous to Unambiguous CFG, Useless symbols, Simplification of CFGs, Normal forms for CFGs: CNF and GNF, Closure proper ties of CFLs,

Unit – IV Push Down Automata (PDA): Description and definition, Instantaneous Description, Language of PDA, Acceptance by Final state, Acceptance by empty stack, Deterministic PDA, Equivalence of PDA and CFG, CFG to PDA and PDA to CFG, Two stack PDA

Unit – V Turing machines (TM): Basic model, definition and representation, Instantaneous Description, Language acceptance by TM, Variants of Turing Machine, TM as Computer of Integer functions, Universal TM, Church’s Thesis, Recursive and recursively enumerable languages, Halting problem, Post correspondence problem (PCP), Modified PCP, Introduction to recursive function theory

References : 1. Hopcroft, Ullman, “Introduction to Automata Theory, Languages and Computation”, Pearson Education . 2. K.L.P. Mishra and N.Chandrasekaran, “Theory of Computer Science : Automata, Languages and Computation”, PHI Learning Private Limited, Delhi India. 3.Peter Linz, "An Introduction to Formal Language and Automata", Narosa Publishing house. 4. Y.N.Singh “Mathematical Foundation of Computer Science”, New Age International. 5. Papadimitrou, C. and Lewis, C.L., “Elements of the Theory of Computation”, PHI Learning Private Limited, Delhi India. 6. K.Krithivasan and R.Rama; Introduction to Formal Languages, Automata Theory and Computation; Pearson Education.

MCS- 305 Compiler Design

Compiler Design Code: MCS- 305 CONTACTS: 3L + 1 T CREDITS: 4 Unit – I Introduction to Compiler, Phases and passes, Bootstrapping, Finite state machines and regular expressions and their applications to lexical analysis, Optimization of DFA-Based Pattern

Matchers implementation of lexical analyzers, lexical-analyzer generator, LEX-compiler, Formal grammars and their application to syntax analysis, BNF notation, ambiguity, YACC. The syntactic specification of programming languages: Context free grammars, derivation and parse trees, capabilities of CFG.

Unit – II Basic Parsing Techniques: Parsers, Shift reduce parsing, operator precedence parsing, top down parsing, predictive parsers Automatic Construction of efficient Parsers: LR parsers, the canonical Collection of LR(0) items, constructing SLR parsing tables, constructing Canonical LR parsing tables, Constructing LALR parsing tables, using ambiguous grammars, an automatic parser generator, implementation of LR parsing tables.

Unit – III Syntax-directed Translation: Syntax-directed Translation schemes, Implementation of Syntax directed Translators, Intermediate code, postfix notation, Parse trees & syntax trees, three address code, quadruple & triples, translation of assignment statements, Boolean expressions, statements that alter the flow of control, postfix translation, translation with a top down parser. More about translation: Array references in arithmetic expressions, procedures call, declarations and case statements.

Unit – IV Symbol Tables: Data structure for symbols tables, representing scope information. Run-Time Administration: Implementation of simple stack allocation scheme, storage allocation in block structured language. Error Detection & Recovery: Lexical Phase errors, syntactic phase errors semantic errors.

Unit – V Code Generation: Design Issues, the Target Language. Addresses in the Target Code, Basic Blocks and Flow Graphs, Optimization of Basic Blocks, Code Generator. Code optimization: Machine-Independent Optimizations, Loop optimization, DAG representation of basic blocks, value numbers and algebraic laws, Global Data-Flow analysis

References:

1. Aho, Sethi & Ullman, "Compilers: Principles, Techniques and Tools”, Pearson Education 2. V Raghvan, “ Principles of Compiler Design”, TMH 3. Kenneth Louden,” Compiler Construction”, Cengage Learning. 4. Charles Fischer and Ricard LeBlanc,” Crafting a Compiler with C”, Pearson Education

MCS 351: OOP Using UML Lab (Based on Theory MCS-301) MCS 352: Design and analysis of Algorithm Lab (Based on Theory MCS-302)

FOURTH SEMESTER

MCS- 401 .Net PROGRAMMING

.Net PROGRAMMING Code: MCS- 305

CONTACTS: 3L + 1 T CREDITS: 4 UNIT - I C# Fundamentals: Basic classes, declarations, conditionals, loops, arrays, strings, enumerations, structures, and Encapsulation, inheritance, polymorphism, Structured exception handling. Understanding interface types UNIT - II Delegates, Events, and Lambdas: basics of each -- very important for event driven (GUI), Understanding the garbage collector, creating and working with .NET assemblies. UNIT - III Windows Forms and WPF: Basic windows programming: forms, component class, control class, control events, menus, status bars, tool bars, interacting with the registry. Indexers, Operator Overloading, Custom Type Conversion, Extension Methods, Anonymous Types, Pointer Types UNIT - IV Input, Output, and Serialization: System.IO, Directory and File Types, StreamReaders and StreamWriters, working with binary data, configuring objects for serialization, Working with and creating custom generic types. UNIT - IV Processes, AppDomains, Contexts, Threading, Type Reflection, Late Binding, Attribute-based programming: Advanced topics from the text will be discussed as time permits. We can decide as a class on what to explore if we get to this point.

MCS- 402 ENTERPRENEURSHIP & DEVELOPMENT

ENTERPRENEURSHIP & DEVELOPMENT Code: MCS- 305 CONTACTS: 3L + 1 T CREDITS: 4

UNIT I: Entrepreneur- Concept on percent - Functions and clarifications of entrepreneurs - Characteristics of entrepreneur - Nature and importance of ,entrepreneur - Entrepreneur vs. professional manager - Women entrepreneurs. UNIT II: Concept of Entrepreneurship - Entrepreneurship and environment-Policies governing entrepreneurs, entrepreneurial development programmes - Institutions for - entrepreneurship development, entrepreneurship. Entrepreneurship -Entrepreneurship development in other countries. UNIT III: Institutions for Entrepreneurial Development - Role of constancy organisations - Role of financial institutions -Bank finance to entrepreneurs Entrepreneurship development: Role of development financial institutions. UNIT IV: Concept of project and classification of project identification project formulation - project report - project design - project appraisal - profitability appraisal - project planning - social cost benefit analysis - financial analysis and project financing. UNIT V: Financial analysis - Ratio analysis - Investment process; Break even analysis - Profitability analysis social cost - Benefit analysis - Budget and planning process, applicability of the factories Act. References:

Ø Vasanta Desai: Dynamics of entrepreneurial development and management; Ø Vasanta Desai: Entrepreneurial development; Ø Peter F. Drucker: Innovation and development; Ø M.V. Deshpande: Entrepreneurship of small scale industries; Ø Balakrishnan, G. Financing of small scale industries. MCS-451 .Net Lab (Based on Theory MCS-401) MCS-452 Major Project (Any Language)