NIC Exam Important notes

1.       Preemptive scheduling

2.       Planar graph

3.       How to find number of graphs==2 ^n(n-1)/2  n is the number of veritces

4.       Eular graph : V-e+f=2
5.    Non-Contiguous Allocation in Operating System
6. Finite state automata

7. Melay and Moore Machine