Operating Systems: Concepts and Scheduling

Operating System (BCSE-507)

• Focuses on the evolution, structure, and functions of operating systems.
• Explores processes, threads, and scheduling policies.
• Covers process concurrency, synchronization, and deadlock principles.
• Examines various memory management schemes.
• Includes virtual memory, disk management, I/O management, and file systems.
• The course duration is 9 hours, with three lectures per week.
• Assessment includes continuous evaluation (40 marks) and an end semester exam (60 marks).

Fundamental Concepts

• Discusses OS generations, types (Layered, Monolithic, Microkernel), and OS services.
• Case studies on UNIX and WINDOWS.
• Explores processes: definition, relationships, states, transitions, PCB, and context switching.
• Multithreading includes definitions, states, benefits, and types.

Process Scheduling

• Addresses scheduling objectives and scheduler types.
• Includes CPU utilization, throughput, turnaround time, and response time.
• Scheduling algorithms: FCFS, SJF, RR, RM, EDF and multiprocessor scheduling.
• Covers Inter-process communication and classical IPC problems.
• Focuses on deadlock conditions, prevention, avoidance using Banker's algorithm, and recovery.

Memory Management

• Basics of memory management are covered, including logical and physical address mapping
• Memory allocation strategies include contiguous allocation (fixed and variable partitions) plus internal/external fragmentation and compaction
• Paging principles of operation include page allocation
• Hardware support of paging is discussed along with the disadvantages
• Virtual memory concepts include basics, hardware/control structures, locality of reference, and page faults
• Memory concepts include overlays, working sets, dirty pages/bits, and demand paging strategies
• Page replacement algorithms: Optimal FIFO, Second Chance (SC), Not Recently Used (NRU), and Least Recently Used (LRU)

File and Disk Management

• Covers file concepts, access methods, types, operations, directory and file system structures
• Explores allocation methods like contiguous, linked, and indexed
• Explores free-space management using bit vectors, linked lists, and grouping
• Discusses directory implementation using linear lists and hash tables
• Disk management covers disk structure
• Explores disk scheduling algorithms
• Focuses on disk reliability, formatting, boot-blocks, and bad blocks
• Provides information about resource protection mechanisms

Linux Programming Lab (BCSE-507L)

• Aims to teach basic Unix commands and practical CPU scheduling/page replacement implementations
• Explains effective use of Linux utilities and shell scripting
• Focuses on print statements to get total waiting time, average waiting time, total turnaround time, average turnaround time & Gantt Chart for the given policies: FCFS, SJF, Priority & RR
• Course duration is 2 hours per week for practical sessions with continuous evaluation and end semester exam

Algorithms (BCSE-508)

• Objective is to analyze algorithm performance, apply design paradigms, and study shortest path algorithms
• Covers efficient algorithm determination and problems lacking efficient algorithms
• Asymptotic performance & solving techniques are covered

Problem Solving & Algorithm Design

• Explores algorithm analysis and asymptotic notation
• Covers sorting in linear time
• Focuses on divide and conquer strategies, like merge sort and quick sort

Greedy Algorithms

• Elements, activity-selection, optimal merge patterns, and Huffman coding
• Addresses job scheduling with deadlines
• Focuses on the Knapsack problem
• Discusses minimum spanning trees using Kruskal and Prim's algorithms
• Examines single-source shortest paths using Dijkstra's algorithm

Dynamic Programming

• Elements
• 0/1 Knapsack problem
• Matrix-chain multiplication
• Longest common subsequence
• All pairs shortest paths (Floyd-Warshall algorithm, transitive closure)

Backtracking, Branch and Bound

• Backtracking Overview covers an 8-Queen problem and a Knapsack problem
• Branch and Bound topics: LC searching, bounding, FIFO, LC Branch and Bound, 0/1 Knapsack, and the Traveling Salesman Problem are covered
• Introduction to P, NP, NP-hard, and NP-complete problems

Graph Algorithms

• Focuses on topological sort, strongly connected components, and shortest paths in directed acyclic graphs
• Includes Bellman-Ford algorithm for single-source shortest paths
• Discusses difference constraints
• Covers the Ford-Fulkerson method for flow networks
• Deals with maximum bipartite matching

Design & Analysis of Algorithms Lab (BCSE-508L)

• Aims to teach algorithm design and analysis, classical sorting, search algorithms, optimization, and graph algorithms
• Covers incremental insertion sort
• Touches on Non-Comparison Sort (Counting Sort)
• Discusses Quick Sort and Merge Sort (Divide and Conquer approach)
• Includes Greedy methods for Task Scheduling, Activity Selection, and Knapsack problems
• Covers Dijkstra’s Shortest Path Algorithm
• Touches on Dynamic Programming methods for Matrix Chain Multiplication and Longest Common Subsequence
• Mentions 8-Queen problems (backtracking method)
• Touches on 0-1 Knapsack problems, covered by branch and bound methods
• Problems use cases are to sort elements, and determine thief’s value to get the highest value

Computer Networks (BCSE-509)

• Provides an understanding of modern network architectures from design and performance perspectives
• Topics include wide-area networks (WANs), local area networks (LANs), and Wireless LANs (WLANs).

Network Components, Standards, and Protocols

• Focuses on data representation, network topologies, protocols, and standards
• Covers the OSI model and transmission media
• Explores wired, wireless, connecting, and virtual LANs
• Includes techniques for bandwidth utilization like multiplexing and spread spectrum concepts

Data Link Layer

• Error detection and correction
• Includes Hamming Distance, CRC, flow control, and error control protocols
• Discusses Stop and Wait, Go back-N ARQ, Selective Repeat ARQ, Sliding Window, Piggybacking, Random and multiple access protocols
• ALOHA and CSMA variants etc

Network and Transport Layers

• Network Layer Switching and Addressing: Covers logical addressing (IPV4, IPV6), address mapping (ARP, RARP, BOOTP, DHCP), delivery, and unicast routing protocols
• Focuses on the Transport Layer: process-to-process communication via User Datagram Protocol (UDP) and Transmission Control Protocol (TCP), SCTP
• QoS improvements are also discussed
• Quality of Service and Congestion Control are covered

Application Layer

• Includes Domain Name Space (DNS), DDNS and application examples are listed
• Protocols like TELNET, EMAIL, File Transfer Protocol (FTP), WWW, HTTP, and SNMP
• Bluetooth, Firewalls and Basic concepts of Cryptography are discussed in this segment.

Computer Networks Lab (BCSE-509L)

• Objectives: To know the working of interconnection devices, learn how to configure various interfaces, explore static and dynamic routing protocols, and route redistribution
• Explores network connecting devices, Cisco Router, and Cisco Discovery Protocol
• Focuses on LAN configuration, and interconnection using Cisco Packet Tracer

Database Management System (BCSE-510)

• Aims to provide an understanding of DBMS and RDBMS concepts
• Covers database designs, schemas, and languages (DDL, DQL, DML, DCL)
• Focuses on database security and normalization concepts for system design.

Data Models & Architectures

• Database system architecture includes Data Abstraction, Data Independence, data models, schemes
• Logical database design includes Database design issues and Responsibility of database administrator, three levels architecture, and introduction to client server
• Data Definition Language (DDL) and Data Manipulation Language (DML) overview is provided
• Focuses on object data models including Entity-relationship model, network model, relational, and object oriented data models.

Relational Query Languages/Commercial DBMS

• Concepts include relational algebra, tuple/domain relational calculus, SQL3, DDL/DML - Open source and Commercial DBMS are touched upon. MYSQL, ORACLE, DB2, SQL server
• Relational database design covers domains,Armstrong's axioms, Normal forms, Dependency preservation and lossless design
• Query processing and optimization cover query equivalence, join strategies, and optimization algorithms.

Storage and Transaction Strategies

• The basic B-tree storage strategies, and hashing are covered
• Transaction processing touches upon Concurrency control, ACID, Serializability, locking and timestamp schedulers
• Multi-version and optimistic Concurrency Control schemes are also discussed along with database recovery

Security and Advanced Topics

• Database Security concepts such as Authentication, Authorization, and access control are mentioned
• DAC, MAC and RBAC models, Intrusion detection, along with SQL Injection attacks are explained
• Advanced topics: Object-oriented, object relational, logical, and distributed databases, Data warehousing, and data mining are introduced.

Database Management System Lab (BCSE-510L)

• Focuses on practical implementation of DBMS concepts with a relational DBMS
• Lab Objectives: Creating and Altering Tables with necessary constraints, keys and data types in relational DBMS
• Inserting data and manipulating data as per needs is goal with the implementation of Operations on relations (tables) using MySQL

Company Database

• The company database tracks of employees, departments, and projects with employee, department, department location, project, which is used as an example in a study.
• A company is organized into departments, each with a unique name/number, and a manager
• Departments control a number of projects also, each with unique properties
• Data tracked for each employee includes name, employee ID, address, salary, sex, and birth date and each is assigned to one department

Airline Database

• Airplane Databases consist of flights being associated with airplane types. Can Land is about what type of airplane types can land where.
• Airline database is designed to identify the operation for reservations. Types of constraints are applied to schema.
• Constraint types include key, entity integrity, and Referential Integrity.
• Referential Integrity relates to what constraints the AIRLINE schema holds.

Agile Development (BCSE-511)

• Focuses on agile software development using scrum
• The goal is practical, high-quality software creation in small teams

Agile Fundamentals

• Agile Introduces conventional SDLC challenges
• Key points also include include the agile manifesto and values
• Other principles include traditional vs. agile approaches and agile method classification.

Agile Scrum Framework

• Scrum Introduction
• This segment goes over project phases, Agile Estimation, and planning poker games
• The focus is upon Scrum from a role perspective like Product Owner, Scrum Master, Scrum Team, and tools used for project management.

Agile Processes

• Characterizations range from user stories, agile design and principles, Refactoring, and Continuous Integration are all explored
• Focuses refactoring from a need perspective with a touch on techniques.

Agile Testing

• The agile lifecycle and testing impact
• Covers testing user stories (acceptance tests and scenarios), automated tests, and agile tools test support

Agile Development Lab (BCSE-511L)

• Focus to understand agile practice is to learn Agile Methodology, and apply the principles
• One should understand agile benefits for project success.

Software & SDLC

• Understand the Objectives/Importance of SDLC approach and various process with use of SDLC phases, Project description
• Learn background and driving forces for Agile practice
• Understand Agile development practice for given Objectives and vision

UML and Sample Project

• Be thorough with developing sample projects with sample Objectives or Vision statements, use cases and UML diagrams
• How does one compile: Project release map, user stories, story-boarding tasks and detailed release plans, Product road-maps, and Story-mapping
• How does one construct: Product-backlog and Sprint-Backlogs
• How does one do demonstrations: Sprint-1,Sprint2 with final project as per proposal as the end goal.

Design Patterns (BCSE-512)

• Covers object-oriented (OO) concepts and design patterns with uml

Core Concepts

• Working with classes and inheritance in software design, strong typing, and substitution
• Discusses Polymorphism, abstract classes, interfaces, and UML

OO Code patterns

• Topics involve Strategy, Observer, Decorator, Simple Factory, Factory Methods, Abstract Factory, Singleton, Commanded, Template Method, Iterator, Composite Model, State, Proxy and Compound Patterns.
• Library management is demonstrated with OO code patterns.

Project II (PR-II)

• Requires project development during the semester with work evaluation based on rubrics
• Focus is phases of development to solve life problems, coding, testing, and writing reports rubrics with Excellent (5 marks), Vary Good (4 Marks), Good (3 Marks), Poor (2 marks)