1 BASICS OF COMPUTER HARDWARE AND SOFTWARE
1 THEORY OF COMPUTATION
2 POWER OF E, APPLICATION AND USES
3 FINITE AUTOMATA
4 DFA PROBLEMS
5 DFA PROBLEMS PART 2
6 DFA PROBLEMS PART 3
7 DFA PROBLEMS PART 4
8 DFA PROBLEMS PART 5
9 DFA PROBLEMS PART 6
10 COMPLEMENT OF A DFA
APPLICATIONS OF LINKED LIST
APPLICATIONS OF STACK EVALUATION OF ARITHMETIC EXPRESSION
BINARY SEARCH
CIRCULAR LINKED LIST
CIRCULAR QUEUE
COPYING OF LINKED LIST
DELETION
DELETION OF DLL (epsc)
DEQUE
DOUBLE LINKED LIST
1NF
2NF
APPLICATION OF ATTRIBUTE CLOSURE PART 1
APPLICATION OF ATTRIBUTE CLOSURE PART 2
APPLICATION OF ATTRIBUTE CLOSURE PART 3
APPLICATION OF ATTRIBUTE CLOSURE PART 4
AUGMENTATION RULE
ARMSTRONG'S AXIOMS
ATTIBUTE CLOSURE PART 1
ATTIBUTE CLOSURE PART 2
2 BASICS OF COMPUTER ARCHITECTURE
3 BASICS OF COMPUTER ARCHITECTURE PART 2
4 BASICS OF COMPUTER ARCHITECTURE PART 3
5 concepts of data and program
6 PROGRAMMING LANGUAGE
7 COMPILERS AND INTERPRETER
8 intro to structured approach in programming
9 execution of compilation of c program
10 flow charts and algorithms