Introduction to analysis and design of algorithm, Growth of functions, Asymptotic notations, Recurrences, Solution of recurrences by substitution, Recurrence tree and the master method. Divide and conquer algorithms (Worst case analysis of merge sort, quick sort and heap sort algorithms), Priority queue, Data structure for disjoint sets (Disjoint set operations, linked list representation, disjoint set forests)
Module-II (13 hours)Dynamic programming approach: Matrix chain multiplication, longest common subsequence. Greedy method: Activity solution problem, Greedy verses dynamic programming, Huffman codes. Concept of backtracking, branch & bound design techniques. Graph algorithms: Minimal spanning tree (Kruskal and Prim�s algorithms), Single source shortest paths (Bellman-Ford and Dijkstra�s algorithm), Floyd�s algorithm.
Module �III (14 hours)Flow Network, Ford-Fulkerson method, Fast Fourier Transform, Rabin-Karp string matching algorithm. NP-Completeness, Polynomial time solvability, Verification and Reducibility, NP complete problems (without proof), Approximation algorithm for the traveling salesman problem.
Text book: 1. T.H. Cormen, C.E. Leiserson, R.L. Rivest and L.Stein, �Introduction to Algorithms� , Second Edition, PHI Learning, 2002 Chapters: 1, 2, 3, 4(excluding 4.4), 6, 7 (7.4.1), 15(15.2, 15.3. 15.4), 16(16.1, 16.2, 16.3), 21(21.1, 21.2, 21.3) 23, 24(24.1, 24.2, 24.3), 26(26.1, 26.2), 30(30.1, 30.2), 32(32.1, 32.2), 34, 35(35.2)Introduction � Evolution of Operating Systems, Types of operating systems, Operating System Structures, Hardware and software structures needed for an operating system. Process Management: Processes�States & Life cycle of process, Schedulers, Context Switching, Process scheduling policies�Preemptive vs. Non-preemptive, CPU scheduling algorithms, Threads�States & Life cycle of thread, thread scheduling, Types of threads & Examples. Inter-process Communication (IPC) Mechanisms�Concurrent processes, Process synchronization, Critical Section, Peterson�s Solution, Classic IPC Problems, Semaphores, Concurrent programming, Monitors.
Module-2 (14hours)Deadlock�Basic cause of deadlock, Conditions for deadlock, resource allocation graph, Wait for graph, Strategies for handling deadlocks, Starvation, Havender�s linear ordering principle, deadlock avoidance & detection, Safe state, Dijikstra�s Banker�s Algorithm. Memory Management: Main Memory, Static & Dynamic Partition schemes, multiple partitions schemes, Fragmentation, Compaction, Buddy Systems, Partition selection algorithms, de-allocation strategy, Swapping, Contiguous Memory Allocation, Paging, Structure of the Page Table, Segmentation, Virtual Memory: Demand Paging, Copy-on-Write, Page Replacement Policies, Belady�s Anomaly, Thrashing, Working set model.
Module-3 (10hrs)Storage (File and Device) Management: File-System Interface, File-System Implementation, Mass-Storage Structure, Disk Scheduling, RAID Structure, I/O Systems. Outline of : Multiprocessor Management, Protection & Security, Real-Time Operating Systems, and Multimedia Operating Systems, Case Studies: Windows XP/ Vista, Linux.
Text books:Introduction to Data Communications and Networking, Evolution of Computer Networks, General Principles of Network Design: Topologies, Network Models (ISO-OSI, TCP/IP), Network Architecture & Standardization (IEEE 802.x), Example Networks, Access Networks. Physical Layer: Theoretical Basis for Data Communication-Data, Signals, Transmission (Digital vs Analog), Throughput, Bandwidth, Bit rate, Baud Rate, Data rate measurement-Nyquist formula & Shannon capacity, Multiplexing, Transmission Media (Guided Media, Unguided media: Wireless), Switching (Circuit , Message, Packet).
Module-II (16 hours)Data Link Layer: Data Link Layer Design Issues, Error detection and Correction, Data Link Control, Elementary Data Link Protocols, Sliding Window Protocols, Protocol Verification, MAC Sub layer: Channel Allocation Problems, Multiple Access Protocols, Ethernet, Wireless LANs, Broadband Wireless, Bluetooth, Data Link Layer Switching, Network devices: Repeater, Hubs, Bridges, Switches, Routers, Gateways, Backbone networks and Virtual LANs, Wireless WANs, Virtual Circuit Networks: Frame Relay and ATM Network Layer: Network Layer Design Issues, Logical Addressing, Internet Protocol, Address Mapping, Error Reporting and Multicasting, Delivery, Forwarding, Routing Algorithms.
Module-III (12 hours)Transport Layer: Transport Service, Elements of Transport Protocols, Process to Process Delivery�UDP, TCP, Congestion Control, Congestion Control Algorithms, Quality of Service. Application Layer: DNS, Remote Logging, File transfer, SNMP, Multimedia, Ziff�s law. Security: Cryptography, Network Security, Kerberos, Internet Security: IPSec, SSL/TLS, PGP, VPN, Firewalls.
Text Books:Introduction: Data & Information, Evolution of Database Systems, Overview of a DBMS, Database System Concepts & Architecture - Data models, schemas and instances, Data Abstraction, Data Independence, Database languages and interfaces. Database Characteristics: Data modeling using Entity - Relationship (ER) Model: Entity sets, attributes and keys, Relationship types, sets, roles and structural constraints, Weak Entity types. Data Models: Relational, Network, Hierarchical and Object Oriented. The Relational model: Relational data model concepts, Codd�s 12 rules, Relational model constraints and schemas, Relational Algebra and Relational calculus, Constraints on Relations, Relational database design by ER & EER to Relational Mapping, Database Language SQL & QBE. SQL Programming Techniques: Constraints and Triggers, Views and Indexes, SQL in Server Environment.
Module 2 (16 hours)Database Design: Data dependency, Armstrong�s Axioms, Functional dependencies and Normalization of Relational Databases, First, Second and Third Normal forms, Boyce-Codd Normal form (BCNF), Relational Database design Algorithms and further dependencies, De-normalization Storage Strategies and file organizations: Disc Storage, Basic File Structures and Hashing, Indexing structures for files, multi-level indexing using B-trees and B+-trees. Query Processing and Optimization: Evaluation of Relational Algebra Expressions, Query Equivalence, Join strategies, Query Execution, Query Compiler, and Query Optimization Algorithms.
Module 3 (14 hrs)Transaction processing concepts: Introduction to Transaction Processing concepts and Theory, ACID Properties, concurrency control, Serializability and Recoverability, Database recovery techniques - Shadow paging, ARIES recovery algorithm, Database Security. Deadlock: Detection, Avoidance and Recovery. Outline of: Information Integration, Data Mining, Data Warehousing and OLAP, Database Systems and the Internet, Search Engines, Semi-structured Data Model, XML and Web Databases, Object & Object Relational Databases, Distributed Databases, Deductive Databases, Mobile Databases, Multimedia Databases, GIS.
Text Books:Probability: Introduction, Probability of an event, additive rule & multiplication rule, conditional probability Bayes� rule, random variable, discrete and continuous probability distribution, Joint probability distribution, Mathematical expectation, Variance and co-variance of random variables, Mean and co-variance of linear combination of random variables, Chebyshev theorem, Binomial & Multinomial, Hypo-geometric, Geometric, Poisson distribution.
Module 2 (13 hours)Uniform, Normal, Exponential Distribution, Weibull�s Distribution, Chi-square distribution, Sampling Distribution: Sampling distribution of S2, t- distribution, F-distribution Estimation of parameter: methods of estimation, Estimating the mean of a sinle sample, Standard error, Prediction interval, Tolerance limits, Estimating the difference between means of two samples, Estimating proportion and variance of a single sample, Estimating the difference between two proportions and variances of two samples, maximum likelihood estimation.
Module 3 (14 hours)Test of hypothesis: one and two tailed test, test on a single mean when variance is known & variance is unknown. Test on two means, test on a single mean population and test on two populations. One and two sample test for variance. ?2 test for goodness of fit and test for independence. Introduction to linear regression: Simple regression models, Method of least square, Properties of least square estimators, Inferences concerning the regression coefficients, Coeficients of determination and its application. Statistical quality control (Simple idea only)
Text Book:Fundamentals of Information Systems, Systems approach to problem solving, Developing information system solutions. Information system components, Information quality, Data resource management, Database, Data models, Information Systems in marketing, manufacturing, HRM, Accounting and Finance.
Module-II (12 hours)Information analysis and design tools : Decision tools, Decision Table, Structured Analysis, Dataflow Analysis, Tools for dataflow strategy, Developing dataflow diagrams, Leveling, Data dictionary, Structured flow chart, HIPO, Warnier/ORR diagram
Module-III (12 hours)Planning & implementation of Information Systems, Transaction Processing Systems, Executive information Systems, Decision Support Systems, Expert Systems, Knowledge Management. Computer crime, Security (Goals, risks, controls, security & recovery measures of IS, economics of information security) & ethical challenges.
Text Books:This course will focus on communication in professional (work-related) situations of the kind that BPUT graduates may expect to encounter on entering the professional domain.
Some typical forms of work-related communication, oral or written, are listed below. Practice activities for all four skills can be designed around these or similar situations.