Detailed syllabus of semester – III

Operating Systems

Course Code: MSCIT-301 I.A. Marks: 25

Total Hours: 60 Exam Marks: 75

UNIT – I – 12 HOURS
Introduction: Batch Systems, Concepts of Multiprogramming and Time Sharing, Parallel,
Distributed and real time Systems, Operating System Structures, Components & Services, System
calls, System programs, Virtual machines. Process Management: Process Concept, Process
Scheduling, Threads, Inter process communication, CPU Scheduling Criteria, Scheduling
algorithm.

UNIT – II – 14 HOURS
Process Synchronization and deadlocks: The Critical Section Problem, Synchronization hardware,
Semaphores, Classical problems of synchronization, Critical regions, monitors, Dead locks –
system model, Characterization, Dead lock prevention, avoidance and detection, Recovery from
dead lock

UNIT – III – 12 HOURS

Memory Management: Logical and Physical address space, Swapping, Contiguous allocation,
Paging, Segmentation, Virtual memory-Demand paging and it’s performance, Page replacement
algorithms, Allocation of frames, thrashing, page size and other considerations. Demand
Segmentation.

UNIT – IV – 12 HOURS
File management : File Concepts, Access methods, Directory Structure, Protection and
consistency, File system structure, Allocation methods, Free space management, Directory
Implementation, Efficiency and Performance, Recovery.

UNIT – V- 10 HOURS
Protection and Security: Goals of protection, Domain Protection, Access matrix, Security Problem,
Authentication, One time password, program threats, System threads.

Created with
PDFBear.com
 TEXT BOOK
1. Abraham Silberschatz and Peter Baer Galvin, “Operating System Concepts”, 7th Edition,
Pearson Education, 2002.

REFERENCE BOOK:

1. Modern Operating Systems by Tanenbaum, Pearson Education India; Fourth edition

Created with
PDFBear.com
 Software Engineering

Paper Code: MSCIT-302 I. A Marks: 25

Total Hours: 60 Exam Marks: 75

Unit I 4 Hours
Introduction to software engineering: Basic concepts – Software and its components, Evolving
Role of Software, Software Product; Software engineering – Software Process and its
characteristics, Software Development Life Cycle
Unit II 4 Hours
Software Life Cycle Models: Waterfall Model, Incremental Process Model, RAD, Prototyping
Model, Spiral Model
Unit III 12 Hours
Software Requirements Analysis and Specifications: Requirements Engineering, Types of
Requirements, Feasibility Studies, Requirements Elicitation, Requirements Analysis – DFD, E-R
Diagram, Data Dictionary; Requirements Documentation – SRS, Requirements Validation
Unit IV 12 Hours
Software Project Planning: Activities during Software project Planning, Size Estimation – LOC,
Function Count, Cost Estimation - COCOMO, Development Time, Resources Requirements,
project Scheduling, Software Risk management
Unit IV 12 Hours
Software Design:Conceptual and Technical Design, Modularity – Module Coupling and
Cohesion, Strategy of Design – Top-Down, Bottom-UP, Hybrid, Function- Oriented; Design
Notations- Data Flow Diagrams, Data Dictionaries, Structure Charts, Pseudocode, Overview of
Object- Oriented Design

Unit V 4 Hours
Software metrics: Definition, Why Software Metrics, Categories of Metrics- Product, Process
and Project Metrics;

Unit VI 2 Hours
Documentation and Software implementation: Structured coding techniques, coding styles, and
standards; Guidelines for coding and documentation.

Created with
PDFBear.com
 Unit VII 4 Hours
Software Reliability and Quality Assurance: Basic Concepts, Failures and Faults, Software
Quality Attributes, Software Quality Factors – McCall Software Quality Model, Boehm Software
Quality Model

Unit VIII 4 Hours

Software Testing and Debugging:Basic Concepts, Testing – Verification and Validation,
Categories of Testing – Unit Testing, Integration Testing, System Testing, Acceptance Testing,
Alpha and Beta Testing, Functional Testing – Black Box Testing, White Box Testing

Unit IX 2 Hours
CASE: Basic Concepts, Scope, Reverse Software Engineering

Main Reading:

1. Software Engineering, Pressman, R.S., A Practitioner’s Approach, McGraw Hill.

2. Software Engineering (3rd ed.), By K.K Aggarwal &Yogesh Singh, Copyright © New
Age International Publishers.

Books/References:

1. Fundamentals of Software Engineering, Rajib Mall, Prentice Hall India Learning Private
Limited; Fourth edition (2 April 2014)
2. Software Engineering, Ian Sommerville, Pearson Education; Nineth edition (2013)
3. Software Engineering Concepts, Fairley, R.E., McGraw Hill Education (India) Private
Limited (23 April 2001)

Created with
PDFBear.com
 Design and Analysis of Algorithms

Paper Code: MSCIT-303 I. A Marks: 25

Total Hours: 60 Exam Marks: 75

Unit I 8 Hours
Introduction to Algorithms: Definition, Criteria for algorithms, Role of Algorithm in
Computing, Analysis of Algorithms, Complexity – asymptotic notations, orders, worst-case and
average-case, amortized complexity; Review of Basic Data Structures: Stacks, Queues, Linked
List, Trees, Graphs, Sorting and Searching– Selection Sort, Bubble Sort, Insertion Sort, Heap sort

Unit II 10 Hours
Divide and Conquer: Strategy - General Method, Master Theorem, Substitution Method, Finding
Minimum and Maximum, Merge Sort, Quick sort, Binary Search, Multiplication of Polynomials,
Performance measurement.

Unit III 8 Hours

Dynamic programming: The General,Memoization, Longest Common Subseqence, Matrix
Chain Multiplication Problem, Optimal Binary Search Trees

Unit IV 8 Hours
Greedy Method: General Method, Job Sequencing with Deadlines, Knapsack problem, Minimum
Spanning Tree – Kruskal’s Algorithm, Prim’s Algorithm; Activity Selection Problem, Huffman
Coding

Unit V 6 Hours
String Matching Problem: General Method, A simple matching algorithm, Brute - Force
algorithm, Knuth Morris Pratt (KMP algorithm), Boyer Moore Algorithm

Unit VI 8 Hours
Elementary Graph Algorithms: BFS and DFS, Topological Sort, Shortest Path problems,
Single-source shortest path problem - Dijkstra’s algorithm, Bellman Ford algorithm
Unit VII 12 Hours
Coping With Limitations of Algorithmic Power: Techniques of handling intractable problems
– State Space Tree, Backtracking – n-Queens problem, Sum of Subsets, Hamiltonian Cycle
Problem; Optimization Problems, Branch- and- Bound:- General Method, 0/1 knapsack Problem,
Traveling Salesperson problem; NP-Hard and NP-Complete Problems

Created with
PDFBear.com
 Main Reading:
1. Introduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L.
Rivestand Clifford Stein, MIT; 3rd edition (2010)
2. Fundamentals of Computer Algorithms, Ellis Horowitz, SartajSahni,
SanguthevarRajasekaran, Galgotia Publications Pvt. Ltd.

Books/References:

1. Design And Analysis Of Computer Algorithms, Aho A, Hopcroft J., Ullman J., Pearson
Education; First Edition edition (2011)
2. Introduction to the Design and Analysis of Algorithms, AnanyLevitin, 2nd Edition,
Pearson Education, 2007
3. The Design and Analysis of Algorithms, Aho A, Hopcroft J., Ullman J., Addison-
Wesley.
4. The Art of Computer Programming, Knuth. D., Vol.-I & III, Dorling Kindersley Pvt
Ltd; 3rd edition (1 December 2005).

Created with
PDFBear.com
 Artificial Intelligence

Paper Code: MSCIT-304 I. A Mark: 25

Total Hours: 60 Exam Marks: 75

Unit I 3 Hours

Introduction: What is AI? The AI Problems, The Underlying Assumption, What Is An AI

Techniques, The Level Of The Model, Criteria For Success, Some General References, One Final
Word.

Unit II 8 Hours
Problems, State Space Search & Heuristic Search Techniques : Defining The Problems as a
State Space Search, Production Systems, Production Characteristics, Production System
Characteristics, And Issues In The Design Of Search Programs, Additional Problems, Generate-
And-Test, Hill Climbing, Best-First Search, Problem Reduction, Constraint Satisfaction, Means-
Ends Analysis

Unit III 12 Hours

Knowledge representation: Knowledge Representation Issues -Representations And Mappings,
Approaches To Knowledge Representation; Using Predicate Logic - Representation Simple Facts
In Logic, Representing Instance And Isa Relationships, Computable Functions And Predicates,
Resolution; Representing Knowledge Using Rules -Procedural Versus Declarative Knowledge,
Logic Programming, Forward Versus Backward Reasoning.

Unit IV 12 Hours
Reasoning: Symbolic Reasoning Under Uncertainty -Introduction To Non-monotonic Reasoning,
Logics For Non-monotonic Reasoning; Statistical Reasoning -Probability And Bays’ Theorem,
Certainty Factors And Rule-Base Systems, Bayesian Networks, Dempster-Shafer Theory, Fuzzy
Logic; Weak Slot-and-Filler and Strong Slot-and-Filler Structures - Semantic Nets, Frames,
Conceptual Dependency, Scripts, CYC

Unit V 6 Hours
Natural Language Processing: Introduction, Syntactic Processing, Semantic Analysis, Semantic
Analysis, Discourse and Pragmatic Processing, Spell Checking

Unit VI 6 Hours
Machine learning and neural networks: Definition and examples of machine learning,
supervised learning, unsupervised learning, reinforcement learning, introduction to neural
networks.

Unit VIII 5 Hours

Created with
PDFBear.com
 Expert Systems: Representation using domain knowledge, Expert System shell, knowledge
acquisition.

Unit IX 5 Hours
AI planning systems: Definition and examples of Planning Systems, planning as search,
operator-based planning, propositional planning.

Main Reading:
1. “Artificial Intelligence” -By Elaine Rich And Kevin Knight (2nd Edition) Tata Mcgraw-Hill
2. “Artificial Intelligence: A Modern Approach”, Stuart Russel, Peter Norvig, PHI

Books/References:
1. Artifical Intelligence: A Modern Approach, Stuart Russell and Peter Norvig, Pearson;
Third edition (2013)
2. Introduction to AI & Expert Sys., Pitterson, D.N

Created with
PDFBear.com
 Elective-I

Java and Android Programming

Course Code: MSCIT-305:E1.1 I.A. Marks: 25

Total Hours: 60 Exam Marks: 75

Part I- Java Programming

Unit I (6) hrs
Basic Features, Primitive Data Types, Literals, Declaring and Initialization of Variables, Java
Operators, Expressions, Control statements and Arrays.
Unit II (10) hrs
Class Fundamentals, Creating objects, Assigning object reference variables, Introducing Methods,
Method overloading, Static methods, Constructors, overloading constructors, this Keyword, Using
Objects as Parameters, Argument passing, Returning objects, Method Overriding, Inheritance
Basics, Access Control, Multilevel Inheritance, Abstract Classes, Polymorphism, final Keyword,
Package, Defining Package, CLASSPATH, Package naming, Accessibility of Packages, Using
Package Members, Interfaces, Implementing Interfaces, Interface and Abstract Classes, String
class,.
Unit III (12) hrs
Exception Handling, Reading from an input stream and Writing to an output stream, Java Database
Connectivity, Swing based GUI.

Part II- Android Programming

Unit I (4) hrs
Basic Concepts of Android: Features of Android, Architecture of Android, Android SDK,
Android Development Tools (ADT), Creating Android Virtual Devices (AVDs), Anatomy of an
Android Application, Creating Your First Android Application.

Created with
PDFBear.com
 UNIT II (10) hrs
Activities and Intents: Understanding Activities, Linking Activities Using Intents, Calling Built-
In Applications Using Intents, Displaying Notifications.
Android User Interface: Understanding the Components of a Screen, Adapting to Display
Orientation, Managing Changes to Screen Orientation, Creating the User Interface
Programmatically, Listening for UI Notifications.
UNIT III (10) hrs
Designing User Interface Using Views: Basic Views, Picker Views, List Views.
Using Image Views to Display Pictures, Using Menus with Views, Some Additional Views.
Data Persistence: Saving and Loading User Preferences, Persisting Data to Files, Creating and
Using Databases.
UNIT IV (8) hrs
Messaging and Networking: SMS Messaging, Sending E- Mail, Displaying Maps, Getting
Location Data.

Main Reading
th
1. Herbert Schildt, JavaTM: The Complete Reference, 7 Edition, Tata McGraw Hill.
2. Wei-Meng Lee, Beginning Android™ Application Development, Wiley Publishing Inc.
Supplementary Readings
th
1. Harvey Deitel and Paul Deitel, Java: How to Program, 9 Edition, Prentice Hall.
2. Reto Meier, Professional Android™ 4 Application Development, John Wiley & Sons, Inc.
3. https://developer.android.com/training/index.html

Created with
PDFBear.com
 C# PROGRAMMING AND .NET

Course Code: MSCIT- 305:E1.2 I.A. Marks : 25

Total Hours: 60 Exam Marks: 75

UNIT – I 8 Hours
Interfaces and Collections: Defining Interfaces Using C# Invoking Interface Members at the
object Level, Exercising the Shapes Hierarchy, Understanding Explicit Interface Implementation,
Interfaces As Polymorphic Agents, Building Interface Hierarchies, Implementing,
Implementation,Interfaces Using VS .NET, understanding the IConvertible Interface, Building a
Custom Enumerator (IEnumerable and Enumerator), Building Cloneable objects ( ICloneable),
Building Comparable Objects ( I Comparable ), Exploring the system. Collections Namespace,
Building a Custom Container (Retrofitting the Cars Type).
UNIT – II 8 Hours
Callback Interfaces, Delegates, and Events, Advanced Techniques: Understanding Callback
Interfaces, Understanding the .NET Delegate Type, Members of System. Multicast Delegate, The
Simplest Possible Delegate Example, , Building More a Elaborate Delegate Example,
Understanding Asynchronous Delegates, Understanding (and Using)Events. The Advances
Keywords of C#, A Catalog of C# Keywords Building a Custom Indexer, A Variation of the Cars
Indexer Internal Representation of Type Indexer . Using C# Indexer from VB .NET. Overloading
operators, The Internal Representation of Overloading Operators, interacting with Overload
Operator from Overloaded- Operator- Challenged Languages, Creating Custom Conversion
Routines, Defining Implicit Conversion Routines, The Internal Representations of Customs
Conversion Routines
UNIT – III 8 Hours
Understanding .NET Assembles: Problems with Classic COM Binaries, An Overview of .NET
Assembly, Building a Simple File Test Assembly, A C#. Client Application, A Visual Basic .NET
Client Application, Cross Language Inheritance, Exploring the CarLibrary’s, Manifest, Exploring
the CarLibrary’s Types, Building the Multifile Assembly ,Using Assembly, Understanding Private
Assemblies, Probing for Private Assemblies (The Basics), Private A Assemblies XML
Configurations Files, Probing for Private Assemblies ( The Details), Understanding Shared

Created with
PDFBear.com
 Assembly, Understanding Shared Names, Building a Shared Assembly, Understanding Delay
Signing, Installing/Removing Shared Assembly, Using a Shared Assembly.

UNIT – 4 6 Hours
Object- Oriented Programming with C#: Forms Defining of the C# Class, Definition the
“Default Public Interface” of a Type, Recapping the Pillars of OOP, The First Pillars: C#’s
Encapsulation Services, Pseudo- Encapsulation: Creating Read-Only Fields, The Second Pillar:
C#’s Inheritance Supports, keeping Family Secrets: The “ Protected” Keyword, Nested Type
Definitions, The Third Pillar: C #’s Polymorphic Support, Casting Between .
UNIT – 5 8 Hours
Exceptions and Object Lifetime: Ode to Errors, Bugs, and Exceptions, The Role of .NET
Exception Handing, the System. Exception Base Class, Throwing a Generic Exception, Catching
Exception, CLR System – Level Exception(System. System Exception), Custom Application-
Level Exception(System. System Exception), Handling Multiple Exception, The Family Block,
the Last Chance Exception Dynamically Identifying Application – and System Level Exception
Debugging System Exception Using VS. NET, Understanding Object Lifetime, the CIT of “new’,
The Basics of Garbage Collection,, Finalization a Type, The Finalization Process, Building an Ad
Hoc Destruction Method, Garbage Collection Optimizations, The System. GC Type.
UNIT – 6 6 Hours
Interfaces and Collections: Defining Interfaces Using C# Invoking Interface Members at the
object Level, Exercising the Shapes Hierarchy, Understanding Explicit Interface Implementation,
Interfaces As Polymorphic Agents, Building Interface Hierarchies, Implementing,
Implementation, Interfaces Using VS .NET, understanding the IConvertible Interface, Building a
Custom Enumerator (IEnumerable and Enumerator), Building Cloneable objects (ICloneable),
Building Comparable Objects ( I Comparable ),
Exploring the system. Collections Namespace, Building a Custom Container (Retrofitting the Cars
Type).
UNIT – 7 8 Hours
Callback Interfaces, Delegates, and Events, Advanced Techniques:
Understanding Callback Interfaces, Understanding the .NET Delegate Type, Members of System.
Multicast Delegate, The Simplest Possible Delegate Example, Building More a Elaborate Delegate

Created with
PDFBear.com
 Example, Understanding Asynchronous Delegates, Understanding (and Using)Events. The
Advances Keywords of C#, A Catalog of C# Keywords Building a Custom Indexer, A Variation
of the Cars Indexer Internal Representation of Type Indexer . Using C# Indexer from VB .NET.
Overloading operators, The Internal Representation of Overloading Operators, interacting with
Overload Operator from Overloaded- Operator- Challenged Languages, Creating Custom
Conversion Routines, Defining Implicit Conversion Routines, The Internal Representations of
Customs Conversion Routines
UNIT – 8 8 Hours
Understanding .NET Assembles: Problems with Classic COM Binaries, An Overview of .NET
Assembly, Building a Simple File Test Assembly, A C#. Client Application, A Visual Basic .NET
Client Application, Cross Language Inheritance, Exploring the CarLibrary’s, Manifest, Exploring
the CarLibrary’s Types, Building the Multifile Assembly, Using Assembly, Understanding Private
Assemblies, Probing for Private Assemblies (The Basics), Private A Assemblies XML
Configurations Files, Probing for Private Assemblies ( The Details), Understanding Shared
Assembly, Understanding Shared Names, Building a Shared Assembly, Understanding Delay
Signing, Installing/Removing Shared Assembly, Using a Shared Assembly.
Main Readings:
1. Andrew Troelsen: Pro C# with .NET 3.0, 4th Edition, Wiley India, 2009.
2. E. Balagurusamy: Programming in C#, 2nd Edition, Tata McGraw
Hill, 2008.
Supplimentary Readings:
1. Tom Archer: Inside C#, WP Publishers, 2001.
2. Herbert Schildt: C# The Complete Reference, Tata McGraw Hill,

Created with
PDFBear.com