- Academics
- B.Sc.CSIT
- New Course
- Freshman Year
- Sophomore Year
- Junior Year
- Senior Year

- Old Course
- Freshman Year
- Sophomore Year
- Junior Year
- Senior Year

Nature of Course: Theory (3 Hrs)

Text Books:

1. Y Langsam, MJ Augenstein and A.M, Tanenbaum Data Structures using C and C++, Prentice Hall India, Second Edition 2015

Reference Books:
1. Leen Ammeral, Programmes and Data Structures in C, Wiley Professional Computing

2. G.W Rowe, Introduction to Data Structure and Algroithms with C and C++, Prentice Hall India

3. R.L Kruse, B.P. Leung, C.L. Tondo, Data Structure and Program Design in C Prentice-Hall India

Course Synopsis: This course includes the basic foundations in of data structures and algorithms. This course covers concepts of various data structures like stack, queue, list, tree and graph. Additionally, the course includes idea of sorting and searching.

Goal:

- To introduce data abstraction and data representation in memory
- To describe, design and use of elementary data structures such as stack, queue, linked list, tree and graph
- To discuss decomposition of complex programming problems into manageable sub-problems
- To introduce algorithms and their complexity

Course Contents:

Unit 1: Introduction to Data Structure (2 Hrs.)

Defination, Abstrace Data Type, Importance of Data Structure.

Unit 2: The Stack (3 Hrs.)

Introduction, Stack as an ADT, POP and PUSH Operation, Stack Application: Evaluation of Infix, Postfix, and Prefix Expressions, Conversion of Expression.

Unit 3: Queue (3 Hrs.)

Introduction, Queue as an ADT, Primitive Operations in Queue, Linear and Circular Queue and Their Application, Enqueue and Dequeue, Priority Queue.

Unit 4: List (2 Hrs.)

Introduction, Static and Dynamic List Structure, Array Implementation of Lists, Queues as a List.

Unit 5: Linked Lists (5 Hrs.)

Introduction, Linked List as an ADT, Dynamic Implementation, Insertion & Deletion of Node To and From a List, Insertion and Deletion After and Before Nodes, Linked Stacks and Queues, Doubly Linked Lists and Its Advantages.

Unit 6: Recursion (4 Hrs.)

Introduction, Principle of Recursion, Recursion vs. Iteration, Recursion Example: TOH and Fibonacci Series, Applications of Recursion, Search Tree.

Unit 7: Trees (5 Hrs.)

Introduction, Basic Iperation in Binary tree, Tree Search and Insertion/Deletion, Binary Tree Traversals (pre-order, post -order and in-order), Tree Height, Level, and Depth, Balanced Trees: AVL Balanced Trees, Balancing Algorithm, The Huffman Algorithm, Game tree, B-Tree.

Unit 8: Sorting (5 Hrs.)

Introduction, Internal and External Sort, Insertion and Selection Sort, Exchange Sort, Bubble and Quick Sort, Merge and Radix Sort, Shell Sort, Binary Sort, Heap Sort as Priority Queue, Efficiency of Sorting, Big 'O' Notation.

Unit 9: Searching (5 Hrs.)

Introduction to Search Technique; essential of search, Sequential search, Binary search, Tree search, General Search Tree, Hashing: Hash Function and Hash Table, Collision Resolution Technique, Efficiency Comparisons of Different Search Technique.

Unit 10: Graphs (5 Hrs.)

Introduction, Graphs as an ADT, Transitive Closure, Warshall's Algorithm, Types of Graph, Graph Traversal and Spanning Forests, Kruskal's and Round-Robin Algorithms, Shortest-Path Algorithm, Greedy Algorithm, Dijkstra's Algorithm.

Unit 11: Algorighms (5 Hrs.)

Deterministic and Non-deterministic Algorithm, Divide and Conquer Algorithm, Series and Parallel Algorithm, Heuristic and Approximate Algorithms.

Laboratory Works:

There shall be 10 lab exercises based on C or Java

- Implementations of different operations related to Stack
- Implementations of different operations related to linear and circular queues
- Solutions of TOH and Fibonacci Series using Recursion
- Implementations of different operations related to linked list: singly and doubly linked
- Implementation of trees: AVL trees, Balancing of AVL
- Implementation of Merge sort
- Implementation of different searching technique: sequential, Tree and Binary
- Implementation of Graphs, Graph traversals
- Implementation of Hashing
- Implementations of Heap

Nature of Course: Theory (3 Hrs)+ Tutorial (1 Hrs)+ Practical (1 Hrs)

Text Books:

1. Mukhopadhyay P., "Theory and Methods of Survey Sampling", Prentice Hall of India, New Delhi, 1998

2. Sheldon M. Ross, "Introduction to Probability and Statistics for Engineers and Scientists", 3rd Edition, India, Academic Press, 2005

Reference Books:

1. Cochran W.G., "Sampling Techniques", 3rd Edition, John Wiley and Sons, Inc. New York, 1977

2. Hogg & Tanis, "Probability and Statistical Inference", 6th Edition, First Indian Reprint, 2002

3. Montgomery Douglas C., "Design and Analysis of Experiments", 5th Edition, John Wiley & Sons Inc., 2001

4. Upadhyay, H. P., Paudel, K.C & et al, "Elements of Business Mathematics", Pinnacle Publication

Course Synopsis: This course covers basic concept of statistics, measurement of central tendency, correlation & regression analysis, probability , sample survey, sample survey methods and design of experiment. These topics are essential tools for research.

Goal: The general objectives of this course are to provide fundamental concept of Statistics, Probability, Sample Survey and their application in the area of Social Science and Computer Application.

Course Contents:

Unit 1: Introduction to Statistics (3 Hrs.)

Meaning, Scope and Limitations of Statistics, Types and Sources of Data, Methods and Problems of Collection of Primary and Secondary Data.

Unit 2: Descriptive Statistics (6 Hrs.)

Measure of Central Tendency (Arithmetic Mean, Median, Partition Values, Mode); Measure of Dispersion
(Absolute and Relative Measures Range, Quartile Deviation, Mean Deviation, Standard Deviation, and Coefficient of Variation).

Unit 3: Correlation and Regression Analysis (6 Hrs.)

**Correlation:** Defination, Scatter Diagram, Karl Pearson's Coefficient of Correlation, Numerical Problems for Determination of Correlation Coefficients.

** Regression:** Defination, Dependent and Independent Variables, Least Square Method Only, Numerical Problems.

Unit 4: Probability (8 Hrs.)

Defination of Probability, Two basic Laws of Probability (without proof). Conditional Probability; Probability Distribution (Binomial, Poisson and Normal); Sample Numerical Problems.

Unit 5: Sample Survey (6 Hrs.)

Concept of Population and Sample; Needs of Sampling; Censuses and Sample Survey; Basic Concept of Sampling; Organizational Aspect of Sample Survey; Questionnaire Design; Sample Selection and Determinatio
of Sample Size; Sampling and Non Sampling Errors.

Unit 6: Sample Survey Methods (10 Hrs.)

Types of Sampling; Simple Random Sampling with and without Replacement; Stratified Random Sampling; Ratio and Regression Method of Estimation under Simple and Stratified Random Sampling; Systematic
Sampling; Cluster Sampling; Multistage Sampling; Probability Proportion to Size Sampling (PPS), Estimation of Population Total and its Variance, Sampling Distributions(t,x^{2},z) and Related Problems.

Unit 7: Design of Experiment (6 Hrs.)

Concept of ANalysis of Variance (ANOVA), F-Statistic and its Distribution, Linear Model in ANOVA, Analysis of One Way, Two Way Classification (l and m observations per cell) in Fixed Effect Model.

Laboratory Works:

Techniques for using the computer as a tool in the analysis of statistical problems will be introduced. SPSS software should be user for data analysis.

Nature of Course: Theory (3 Hrs)

Text Books:

1. Jeffery Whitten, Hoffer, Joey George, Joe Valacich, "Modern Systems Analysis and Design", 6/E, Prentice Hall India.

Reference Books: 1. Jeffery Whitten, Lonnie Bentley, "System Analysis and Design Methods", 7/E, McGraw-Hill

Course Synopsis: This course mainly focuses on different aspect of system analysis and design such as foundation, planning, analysis, design, implementation and maintenance.

Goal:

The general objective of this course is to provide concepts related to information systems development in a systematic approach including foundations, planning, analysis, design, implementation and maintenance.

Course Contents:

Unit 1: System Development Fundamentals (9 Hrs.)

**a. The System Development Environment**

Modern Approach of System Analysis and Design, Information System and its Type, Developing Information Systems and the Systems Development Life Cycle, The Heart of the Systems

Development, The Traditional Waterfall SDLC, Approaches for Improving Development, CASE Tools, Rapid Application Development, Service-Oriented Architecture, Agile Methodologies, eXtreme Programming,

Object-oriented
Analysis and Design.

**b. The Origins of Software**

Introduction, System Acquisition, Reuse.

**c. Managing the Information Systems Project**

Introduction, Managing Information Systems Project, Representing and Scheduling Project Plans, Using Project Management Software.

Unit 2: Planning (7 Hrs.)

**a. System Development Projects: Identification and Selection**

Introduction, Identifying and Selecting Systems Development Projects, Corporate and Information Systems Planning.

**b. System Development Projects: Initiation and Planning**

Introduction, Initiating and Planning Systems Development Projects, Process of Initiating and Planning IS Development Projects, Assessing Project Feasibility, Building
and Reviewing the Baseline

Project Plan

Unit 3: Analysis (13 Hrs.)

**a. System Requirements**

Introduction, Performing Requirements Determination, Traditional Methods for Determining Requirements, Contemporary Methods for

System Requirements, Radical
Methods for Determining System Requirements, Requirements Management Tools, Requirements Determination Using Agile Methodologies

**b. System Process Requirements**

Introduction, Process Modeling, Data Flow Diagramming Mechanics, Using Data Flow Diagramming in the Analysis Process, Modeling Logic with Decision Tables

**c. System Data Requirements **

Introduction, Conceptual Data Modeling, Gathering Information for Conceptual Data modeling, Introduction to E-R Modeling, Conceptual Data Modeling

and the E-R Model,
Representing Super-types and Sub-types, Business Rules, Role of Packaged Conceptual Data Models - Database Patterns.

Unit 4: Design (12 Hrs.)

**a. Designing Databases**

Introduction, Database Design, Relational Database Model, Normalization, Transforming E-R Diagrams into Relations, Merging Relations, Physical File and Database Design, Designing
Fields,

DesigningPhysical Tables.

**b. Designing Forms and Reports**

Introduction, Designing Forms and Reports, Formatting Forms and Reports, Assessing Usability.

**c. Designing Interfaces and Dialogues**

Introduction, Designing Interfaces and Dialogues, Interaction Methods and Devices, Designing Interfaces and Dialogues in Graphical Environments.

Unit 5: Implementation and Maintenance (4 Hrs.)

**a. System Implementation**

Introduction, System Implementation, Software Application Testing, Installation, Documenting the System, Training and Supporting Users, Organizational Issues in Systems Implementation.

**b. System Maintenance**

Introduction, Maintaining Information Systems, Conducting Systems Maintenance.

Nature of Course: Theory (3 Hrs), Tutorial (1 Hrs), Practical (2 Hrs)

Text Books:

1. Deitel & Dietel, "Java: How to program", 9^{th} Edition, Pearson Education, 2011, ISBN: 9780273759768

2. Herbert Schildt, "Java: The complete Reference", Seventh Edition, McGraw-Hill 2006, ISBN: 0072263857

Reference Books:
1. Bruce Eckel, "Thinking in Java", 4^{th} Edition, Prentice Hall, 2006, ISBN: 0-13-187248-6

2. Cay Horstmann and Grazy Cornell, "Core Java

Course Synopsis: This course includes the basic foundations in of data structures and algorithms. This course covers concepts of various data structures like stack, queue, list, tree and graph. Additionally, the course includes idea of sorting and searching.

Goal:

- To introduce data abstraction and data representation in memory
- To describe, design and use of elementary data structures such as stack, queue, linked list, tree and graph
- To discuss decomposition of complex programming problems into manageable sub-problems
- To introduce algorithms and their complexity

Course Contents:

Unit 1: Introduction to Data Structure (2 Hrs.)

Defination, Abstrace Data Type, Importance of Data Structure.

Unit 2: The Stack (3 Hrs.)

Introduction, Stack as an ADT, POP and PUSH Operation, Stack Application: Evaluation of Infix, Postfix, and Prefix Expressions, Conversion of Expression.

Unit 3: Queue (3 Hrs.)

Introduction, Queue as an ADT, Primitive Operations in Queue, Linear and Circular Queue and Their Application, Enqueue and Dequeue, Priority Queue.

Unit 4: List (2 Hrs.)

Introduction, Static and Dynamic List Structure, Array Implementation of Lists, Queues as a List.

Unit 5: Linked Lists (5 Hrs.)

Introduction, Linked List as an ADT, Dynamic Implementation, Insertion & Deletion of Node To and From a List, Insertion and Deletion After and Before Nodes, Linked Stacks and Queues, Doubly Linked Lists and Its Advantages.

Unit 6: Recursion (4 Hrs.)

Introduction, Principle of Recursion, Recursion vs. Iteration, Recursion Example: TOH and Fibonacci Series, Applications of Recursion, Search Tree.

Unit 7: Trees (5 Hrs.)

Introduction, Basic Iperation in Binary tree, Tree Search and Insertion/Deletion, Binary Tree Traversals (pre-order, post -order and in-order), Tree Height, Level, and Depth, Balanced Trees: AVL Balanced Trees, Balancing Algorithm, The Huffman Algorithm, Game tree, B-Tree.

Unit 8: Sorting (5 Hrs.)

Introduction, Internal and External Sort, Insertion and Selection Sort, Exchange Sort, Bubble and Quick Sort, Merge and Radix Sort, Shell Sort, Binary Sort, Heap Sort as Priority Queue, Efficiency of Sorting, Big 'O' Notation.

Unit 9: Searching (5 Hrs.)

Introduction to Search Technique; essential of search, Sequential search, Binary search, Tree search, General Search Tree, Hashing: Hash Function and Hash Table, Collision Resolution Technique, Efficiency Comparisons of Different Search Technique.

Unit 10: Graphs (5 Hrs.)

Introduction, Graphs as an ADT, Transitive Closure, Warshall's Algorithm, Types of Graph, Graph Traversal and Spanning Forests, Kruskal's and Round-Robin Algorithms, Shortest-Path Algorithm, Greedy Algorithm, Dijkstra's Algorithm.

Unit 11: Algorighms (5 Hrs.)

Deterministic and Non-deterministic Algorithm, Divide and Conquer Algorithm, Series and Parallel Algorithm, Heuristic and Approximate Algorithms.

Laboratory Works:

There shall be 10 lab exercises based on C or Java

- Implementations of different operations related to Stack
- Implementations of different operations related to linear and circular queues
- Solutions of TOH and Fibonacci Series using Recursion
- Implementations of different operations related to linked list: singly and doubly linked
- Implementation of trees: AVL trees, Balancing of AVL
- Implementation of Merge sort
- Implementation of different searching technique: sequential, Tree and Binary
- Implementation of Graphs, Graph traversals
- Implementation of Hashing
- Implementations of Heap

Nature of Course: Theory (3 Hrs), Practical (3 Hrs)

Text Books:

1. Harvey M. Deitel, Paul J. Deitel & Abbey Deitel, "Internet and World Wide Web: How to Program", 5^{th} Edition, Pearson Education, 2012, ISBN: 9780273764021

2. Thomas A. Powell, "HTML & CS'S: The Complete Reference", McGraw Hill, Fifth Edition, 2010, ISBN: 978-0-07-174170-5

Reference Books:

1. Matt J. Crouch, "__ASP.NET__ and __VR.NET__ Web Programming", Pearson Education Asia, 2002

2. Rahul Banerjee, "Internetworking Technologies", Prentice-Hall of India Limited. Fourth Edition, 2000

3. Thomas A. Powell, "Web Design: The Complete Reference", Tata McGraw Hill, Second Edition, 2002

Course Synopsis: This course covers different aspect of web technology such as HTML, CSS, issues of web technology, client tier, server tier and ad vanced server side issue.

Goal:

- To provide fundamental concepts of Internet, Web Technology and Web Programming.

Course Contents:

Unit 1: HTML and CSS (15 Hrs.)

**HTML Basic:** HTML Tag Reference, Global Attributes, Document, Structure Tags, Formatting Tags, Text Level Formatting, Block Level Formatting, List Tags, Hyperlink Tags, Executable Content Tags.

**Image & Imagemaps:** Introduction, Client-Side Imagemaps, Server-Side Imagemaps, Using Server-Side and Client-Side Imagemaps Together, Alternative Text for Imagemaps.

**Tables:** Introduction to HTML Tables and Their Structure, The Table tags, Alignment, Aligning Entire Table, Alignment within a Row, Alignment within a Cell, Attributes, Content Summary, Background
Color, Adding a Caption, Setting the Width, Adding a Border, Spacing Within a Cell, Spacing between the Cells, Spanning Multiple Rows or Columns, Elements that can be Placed in a Table, Table Sections
and Column Properties, Tables as a Design Tool.

**Frames:** Introduction to Frames, Applications, Frames document, The < FRAMESET > tag, Nesting < FRAMESET > tag, Placing content in frames with the < Frame > Tag, Targeting
named Frames, Creating Floating Frames, Using Hidden Frames.
**Forms:**Creating Forms, The <FORM> tag, Named Input Fields, The <INPUT> tag, Multiple lines text windows, Drop Down and List Boxes, Hidden, Text, Text Area, Password, File Upload,
Button, Submit, Reset, Radio, Checkbox, Select, Option, Forms and Scripting, Action Buttons, Labeling input files, Grouping related fields, Disabled and read-only fields, Form Field Event Handlers,
Passing Form Data.

**Style Sheets:** Defination, Importance, Different Approached to Style Sheets, Using Multiple Approaches, Linking to Style Information in Separate File, Setting up Style Information, Using the <LINK>Tag,
Embedded Style Information, Using <STYLE>Tag, Inline Style Information.

Unit 2: Issue of Web Technology (3 Hrs.)

Architectural Issues of Web Layer, Tier Technology: 2-Tier, 3-Tier and n-Tier.

Unit 3: The Client Tier (10 Hrs.)

Representing Content; Introduction to XMI,; Elements and Attributes; Rules for Writing XML; Namespaces; Schema: Simple Types and Complex Types, XSD Attributes, Default and Fixed Values, Facets, Use of Patterns, Order Indicators(All, Choice, Sequences), Occurrence Indicators ( Maxoccurs, Minoccurs),
DTD: Internal Declaration, Private External Declaration, Public External Declaration, Defining Elements and Attributes: XSL/XSLT; Xpath; Xquery; SAX; DOM , Creating XMI, Parser.

Unit 4: The Server Tier (8 Hrs.)

Web Server Concept, Creating Dynamic Content, Using Control
Flow to Control Dynamic Content Generation, Sessions and State, Error Handling, Architecting Web Application, Using Tag Libraries, Writing Tag Libraries.

Unit 5: Introduction to Advanced Server Side Issues (9 Hrs.)

Database Connectivity; Creating an SQI, statement: Select, Insert, Update, and Delete;
Authentication: Anonymous Access, Authentication by IP address and Domain, Integrated Windows Authentication; Cookies; File Handling.

Laboratory Works:

Laboratory works should be done covering all the topics listed above and a
small project work should be carried out using the concept learnt in this course. Project should he assigned on individual basis.

Nature of Course: Theory (3 Hrs), Tutorial (1 Hrs), Practical (2 Hrs)

Text Books:

1. Andrew S. Tanenbaum , “Modern Operating System 6/c “, PHI 2011/12

2. Silberschatz , P.B Galvin, G. Gagne , “Orating System Concepts 8/e” , Wilet India , 2014 ISBN : 9788126520510

Reference Books:

1. Andrew S.Tanebaum “Distributed Operating system” , Pearson

2. D M Dhamdhere “ System Programming and Operating System”, Tata McGrawHill,2009

3. P.Pal Choudhary” Operating Systems Principles and Design” PHI,2011

Course Synopsis:

This course includes the topics that help students understand operating system and it's functionality along with its types.

Goal:

The general objectives of this subject are to provide the basic feature, function and interface with the hardware and application software to run the computer smoothly.

Course Contents:

Unit 1: Introduction to Operating System (2 Hrs.)

History, Introduction and Generation of Operating System, Objectives (Resource Manager and Extended Machine), Types of Operating system, Function of Operating system.

Unit 2: Operating System Structure (2 Hrs.)

Introduction, Layered System, Kernel, Types of Kernel (Monolithic/Macro Kernel and Micro / Exo-Kernel), Client-Server Model, Virtual Machines, Shell.

Unit 3: Process Management (15 Hrs.)

**Process Concepts(3 Hrs.):** Definitions of Process, The Process Model, Process States, Process State Transition, The Process Control Block, Operations on Processes (Creation, Termination, Hierarchies, Implementation), Cooperating Processes, System Calls (Process Management, File management, Directory Management).

**Threads (1 Hr):** Definitions of Threads, Types of Thread Process (Single and Multithreaded Process), Benefits of Multithread, Multithreading Models (Manyto-One Model, One-to-One Model, Many-to Many Model).

** Inter-Process Communication and Synchronization (6 Hrs.)**
Introduction. Race Condition. Critical Regions. Avoiding. Critical Region: Mutual Exclusion And Serializability: Mutual Exclusion Conditions. Proposals for Achieving Mutual Exclusion: Disabling Iniarrupts. Lock Variable. Strict Alteration (Peterson's Solution), The TSL InstNetion, Sleep and Wakeup. Types of Mutual Exclusion (Semaphore. Monitors. Mutexes, Message Passing. Bounded Buffer).
Serializability: Locking Protocols and Time Stamp Protocols: Classical IPC Problems (Dining Philosophers. The readers and writer problems. The sleeping barber’s problem)

**Process Scheduling (5 Hrs):** Basic Concept, Type of Scheduling (Preemptive Scheduling, Nonpreemptive Scheduling, Batch, Interactive, Real Time Scheduling), Scheduling Criteria or Performance Ana
lysis, Scheduling Algorithm (Round-Robin, First Come First Served, Shortest-Job-First, Shortest Process Next, Shortest Remaining Time Next, Real Time, Priority Fair Share, Guaranteed, Lottery Scheduling
, HRN, Multiple Queue, Multilevel Feedback Queue); Some Numerical Examples on Scheduling.

Unit 4: Deadlocks (4 Hrs.)

System Model, System Resources; Preemptable and Non-Preemptable; Conditions for Resource Deadlocks, Deadlock Modeling, The OSTRICH Algorithm, Methof of Handling Deadlocks, Deadlock Prevention,
Deadlock Avoidance: Banker's Algorithm, Deadlock Detection: Resource Allocation Graph, Recovery from Deadlock.

Unit 5: Memory Management (7 Hrs.)

**Basic Memory Management (3 Hrs.):** Introduction, Memory Hierarchy, Logical Versus Physical Address Space, Memory Management with Swapping; Memory Management with Bitmaps and with Linked List; Memory
Management without Swapping, Contiguous-Memory Allocation: Memory Protection, Memory Allocation, Fragmentation (Inter Fragmentation and External Fragmentation); Non-Contiguous Memory Allocation, Fixed
Partitioning Vs. Variable Partitioning, Relocation and Protection, Coalescing and Compaction.

**Virtual Memory (4 Hrs.):** Background, Paging, Structure of Page Table; Hierarchical Page Table, Hashed Page Table, Inverted Page Table, Shared Page Table; Block Mapping Vs. Direct
Mapping, Demand Paging, Page Replacement and Page Faults, Page Replacement Algorithms: FIFO, OPR, LRU, SCP; Some Numerical Examples on Page Replacement, Thrashing, Segmentation, Segmentation With Paging.

Unit 6: Input/ Output Device Management (4 Hrs.)

Principle of I/O Hardware: I/O Devices, Device Controllers, Memory Mapped I/O, Direct Memory Access; Principle of I/O Software; Goals of I/O Software, Program I/O, Interrupt - Driven I/O, I/O Using DMA;
I?O Software Layers; Interrupts Handler, Device Drivers, Device Independent I/O Software, User-Space I/O Software; Disk; Disk Hardware; Disk Scheduling; Seek Time, Rational Delay, Transfer Time; Disk
Scheduling Algorithms: FCFS Scheduling, SSTF Scheduling, SCAN Scheduling, C-SCAN Scheduling, Lock Scheduling

Unit 7: File System Interface Management (2 Hrs.)

File Concept; File Naming, File Structure, File Type, File Access, File Attributes, File Operation and File Descriptors; Directories; Single-Level Directory Systems, Hierarchical Directory System, Path Names,
Directory Operation; Access Methods; Sequential, Direct; Protection: Types of Access Control List, Access Control Matrix.

Unit 8: Security Management (3 Hrs.)

Introduction, Security Problems, User Authentication : Passwords, Password Vulnerabilities, Encrypted Password, One Time Password and Biometrics password : User authorization, Program Threats :
Trojan Horse , Trap Door, Stack and Buffer Overflow; System Threats: Worms, Viruses , Denial of Services.

Unit 9: Distributed Operating System (4 Hrs.)

Introduction, Advantages of Distributed System Over Centralized System, Advantages of Distributed System over Independent PCs, Disadavntages
of DIstributed System , Message Passing Procedure Call, Process in Distribution System , Clock Synchronization.

Unit 10: Case Study (4 Hrs.)

DOS and Windows Operating System , Unix Operating System , Linux Operating System.

Laboratory Works:

Laboratory should be dobe covering all the topics listed above and a small project work should be carried out
using the concept learnt in this course .Project should be assigned on Individual basis.

Nature of Course: Theory (3 Hrs), Tutorial (1 Hrs), Practical (2 Hrs)

Text Books:

1. C.F Gerald and P.O Wheatley, “Applied Numerical Analysis” 4th Edition, Addison Wesley Publishing Company New York

2. S. S Sastry, “Introduction to Methods of Numerical Analysis” , Prentice-Hall India

Reference Books:

1. W. Cheney and D. Kineind, “Numerical Mathematics and Computing” 2nd edition, Brooks/Cole Publishing Co., 1985

2. W.H Press, B.P Flanner et. al., “Numerical Recipies in C” 1st Edition, Cambridge Press, 1998.

Course Synopsis:

This course covers solution of nonlinear equations, interpolation and approximation, numerical differentiation and integration and solution
of linear algebric equation, ordinary differential equations and partial diffrential equations. It provides knowledge for numerical analysis.

Goal:

The general objectives of this subject are to make students familiar with the theory of numerical analysis for solving algebric and transcendental
equations, solution of ordinary and partial differential equations, numerial differentiation and integration.

Course Contents:

Unit 1: Solution of Nonlinear Equations (10 Hrs.)

Introduction, Types of Equation, Errors in Computing, The Bisection Method, The
Method of False Position, Newton- Rhapson Method, Solution of System of Nonlinear Equation, Fixed Point Iteration and Convergence.

Unit 2: Interpolation and Approximation (8 Hrs.)

Introduction, Errors in Polynomial Interpolation, Lagrange’s Polynomials,
Newton’s Interpolation using Difference and Divided Differences, Cubic Spline Interpolation , Least Squares Method for Linear and Non-linear Data.

Unit 3: Numerical Differentiation and Integration (5 Hrs.)

Introduction to Numerical Differentiation, Newton’s Differentiation Formulas, Numerica Integration ( Trapezoidal Rule, Simpson’s ⅓ rule, ⅜ rule); Romberg Integration: Numerical Double Intergration.

Unit 4: Solution of Linear Algebric Equations (10 Hrs.)

Review of the existence of solutions and properties of matrices, Consistency of a Linear System of Equations, Gaussian Elimination Method, Gauss-Jordan Method,
Inverse of matrix using Gauss Elimination Method , Method of factorization, Iterative Methods( Jacobi & Gauss-seidel Iteration) , Power Method.

Unit 5: Solution of Ordinary Differential Equations (7 Hrs.)

Introduction to Differential Equatons, Initial Value Problem, Taylor Series Method,
Picard’s Method, Euler’s Method and its Accuracy, Heun’s Method,Runge-kutta Methods, Solution of Higher Order Equations, Boundary Value Problems, Shooting Method and It’s Algorithm.

Unit 6: Solution of Partial Differential Equations (5 Hrs.)

Introduction to Partial DIfferential Equations, Boundary Value Problems, Shooting Method and It’s Algorithm.

Laboratory Works:

Laboratory works will consists of program development and testing of Non-linear Equations, Interpolation, Numerical Differentiation and Intergration, Linear Algebric Equations, Ordinary and Partial Differential Equations using C or C++ Builder.

Nature of Course: Theory (3 Hrs), Tutorial (1 Hrs)

Course Synopsis:

This course includes the topics that provide fundamental concept and standard of software engineering so that students will be able to develop software and/or handle software project using the global standard of software.

Goal:

This course is designed to provide the students with the basic competencies required t
Identify requirements,documents the system design and maintain a developed system. It presumes a general understanding of computers and programming which are covered in the first and second semester of the degree.

Course Contents:

Unit 1: Introduction (4 Hrs.)

Definition of Software, Type if Software, Characteristic of Software, Attributes of Good Software, Definition of Software Engineering, Software Engineering Costs,
Key challenges that Software Engineering Facing, System Engineering and Software Engineering , Professional Practice.

Unit 2: Software Development Process Model (8 Hrs.)

Software Process, Software Process Model : The Waterfall Model, Evolutionary Development , Component-Based Software Engineering (CBSE); Process Iteration: Incremental Delivery, Spiral Development; Rapid Software Development: Agile Methods, Extreme programming. Rapid Application Development, Software Prototyping : Rational Unified Process( RUP),
Computer Aided Software Engineering (CASE) : Overview of CASE Approach, Classification of CASE tools.

Unit 3: Software Requirement Analysis and Specification (10 Hrs.)

System and Software Requirements, Type of Softwae Requirements: Functional and Non-Functional Requirements, Domain Requirements, User Requirements: Elicitation and Analyis of Requirements : Overview of Techniques, View Points, Interviewing , Scenarios, Use-Case Ethnography, Requirement Validation, Requirement Specification, Feasibility.

Unit 4: Software Design (10 Hrs.)

Design Concept : Abstraction. Architecture , Patterns, Modularity: cohesion, Compling: Information, Hiding , Functional Independence, Refinement; Architectural Design: Repository Model, Client Server Model, Layered Model, Modular Decomposition : procedural design using structured methods, User Interface Design :
Human - Computer Interaction, Information Presentation , Interface Evaluation : Design Noation .

Unit 5: Coding (2 Hrs.)

Programming Language and Development Tools , Selecting Languages and Tools, Good Programming Practices.

Unit 6: Software Testing and Quality Assurance (6 Hrs.)

Verification and Validation , Techniques of Testing : Black- box and white-box Testing, Inspections: Level of Testing: Unit Testing , Intergartion Testing, Interface Testing, System Testing , Alpha and Beta Testing, Regression Testing : Desiig of Test Cases, Quality Management Activities,
Product and Process Quality , Standards : ISO9000, Capability Maturity Model (CMM).

Unit 7: Software Maintenance (3 Hrs.)

Evolving Nature of Software, Different Types of Maintenance : Fault Repair, Software Application, Functionality Addition or Modification ; Maintenance Prediction,
Re-Engineering, Configuration Management (CM) : Importance of CM, Configuration Items, Versioning.

Unit 8: Managing Software Projects (2 Hrs.)

Needs for the Proper Management of Software Projects, Management Activities : Project Planning , Estimating Costs, Project Scheduling, Risk Management, Managing people.