Functional units of computer
BUS STRUCTURES
Instruction & Instruction Sequencing
Addressing modes
SINGLE BUS v/s MULTIPLE BUS ORGANIZATION
Module 1 QUESTIONS
Introduction to register transfer logic
Microoperation Part 1
Microoperations part2
Processor organization methods.
Processor unit and shifter
Design of ALU
Module 3 Part 1
Part 13
Part 14
Part 12
Module 3 Part 2
Part 1
Part 2
Part 4
Part 3
Part 5
Module 1 Part 1
Module 1 Part 2
Module 4
Part 6
Part 7
Part 8
Part 9
Module 1.pdf
Module 3.pdf
Module 2.pdf
Module 4.pdf
Intrduction to operating system
OPERATING SYSTEM OPERATIONS, FUNCTIONS AND SERVICES
SYSTEM CALL AND TYPES OF SYSTEM CALLS
Structure of Operating System
previous year qn papers
System Boot Process
Process and Process states
process control block
FCFS
INTER PROCESS COMMUNICATION
PRIORITY SHEDULING NON PREMPTION
PRIORITY SHEDULING PREMPTION
PROCESS SHEDULING
ROUND ROBIN
SHEDULING CRITEIA
SHORTEST JOB SHEDULING
DEADLOCK HANDLING IN OS (DEADLOCK PREVENTION)
NECESSARY CONDITIONS FOR DEADLOCK
RESOURCE ALLOCATION GRAPH
Critical Section Problem
PETERSONS SOLUTION
SEMAPHORES
Solution to critical section problem using locks
Synchronization Hardware
BANKERS ALGORITHM (PROBLEM PART 1)
PAGING part 1
PAGE REPLACEMENT ALGORITHM & FIFO ALGORITHM
SEGMENTATION
BELADY\'S ANOMALY
FIFO
FILE ATTRIBUTES
FILE OPERATIONS
FILE SYSTEM
Part 10
Part 11
Module 2
Module 1
Module 3
Module 4 & 5
Module 5
Part 2 poperties
Part 3 characterstic
Part 1 introduction to dbms
Part 4 transaction
Part 5 advantages disadvantages
Part 6 users
Part 7 data types
Part 10 data independence
Part 9 architecture
Part 8 data models
Part 15
Part 17
Part 16
Module 3 Part 3
MODULE 4 Part 2
1. Grap Theory
2. Introduction to Graph
3. Trivial Graph
4. Null Graph
5. Finite Graph & Infinity Graph
6. Parallel Edges & Self Loop
7. Incidence and Degree of a Vertex
8. Degree of a Vertex
9. Isolated Vertex & Pendant Vertex
10. Hand Shaking Theorem (Theorem - 1)
2. OPERATIONS ON GRAPH
1. EULER GRAPH
3. HAMILTONIAN GRAPH
4. TRAVELING SALESMAN PROBLEM
5. DIRECTED GRAPH
6. FLEURY\'S ALGORITHM
QUESTION PAPER DISCUSSION
2. DISTANCE AND CENTERS IN A TREE
4. MINIMUM SPANNING TREE
18. MODULE -3 PREVIOUS YEAR QUESTION ANSWER
5. PRIMS ALGORITHM
3. ROOTED TREE, BINARY TREE
1. TREES AND GRAPH ALGORITHMS
6. PRIMS ALGORITHM QUESTION
9. Kruskal Algorithm
7. Kruskals algorithms
8. kruskals Qs 2mp4
3. CUT SET
2. EDGE CONNECTIVITY
5. FUNDAMENTAL CIRCUIT
4. Fundamental cutset
1. VERTEX CONNECTIVITY
Module 4 previous year questions
1 graph representation
2 circuit matrix
3 path matrix
4 Graph coloring
5 Chromatic Polynomial
6 Matching of Graph
7 Greedy Algorithm for coloring
8 Module 5 previous year questions
GRAPH THEORY MODULE 1 PART 2
GRAPH THEORY MODULE 1 PART 1
GRAPH THEORY MODULE 1 PART 5
GRAPH THEORY MODULE 1 PART 3
GRAPH THEORY MODULE 1 PART 4
GRAPH THEORY