BCA

Introduction to Distributed Systems BCA367   Syllabus                         BOOK

1. Introduction to distributed systems
2. Client Server introduction
3. Synchronization in Distributed Systems
4. Limitation of Distributed systems
5. Logical Clock and Lamport's scaler clock
6. Distributed Algorithms Agreement Protocol
7. BFT
8. Fault Tolerance
9. Distributed DBMS Commit Protocols
10. Transaction
11. DBMS Schedules and the Types of Schedules
12. client Server Model
13. Deadlock
14. DDBMS - Security in Distributed Databases
15. DDBMS - Database Security & Cryptography

Operating System

1. Introduction
2. OS Services
3. OS services and system call
4. OS Structure
5. Virtual machines
6. Process Management
7. Process Scheduling
8. OS Scheduling Algorithms
9. Multi-threading
10. Memory Management
11. Paging and Segmentation
12. Virtual Memory and Page Replacement
13. Process Synchronization
14. Deadlock
15. IPC
16. OS File System
17. OS Security

Discrete mathematics is the study of mathematical structures that are fundamentally discrete rather than continuous.

Discrete Structures & Graph Theory

1.  Set Theory
2. Relation
3. Relation Matrix and Functions
4. Principle of Inclusion and Exclusion
5. Applications of PIE
6. Solution
7. Directed Graph
8. Warshall’s Algorithm- Transitive
   Closure
9. POSET
10. Sets, Relations and functions (Reference Material)

Design & Analysis of Algorithms

1. Dynamic programming and Multistage graph
2. Matrix Chain Multiplication
3. LCS
4. Knapsack
5. Travelling Salesperson problem
6. Backtracking - N Queens Problem
7. Branch and Bound
8. Amortized Analysis
9. BFS and DFS and its applications
10. MST
11. Randomized Algorithm
12. Randomized minimum cut
13. Primality Testing
14. Bin Packing
15. Problem Classes
16. Shortest Path
17. Asymptotic Notation
18. Recurrence : Master Theorem 
19. Lower bound theory (reference material )