Канал: Computer Science Notes

Boolean Algebra - Boolean Expression to Logic Circuit

Boolean Algebra - Boolean Expression to Logic Circuit

MS Execl - LAB recording

MS Execl - LAB recording

Deadlock Avoidance - Banker's Algorithm

Deadlock Avoidance - Banker's Algorithm

Boolean Algebra

Boolean Algebra

Subtraction using Complement Method - Binary Arithmetic

Subtraction using Complement Method - Binary Arithmetic

Shortest path problems (Dijkstra algorithm) examples

Shortest path problems (Dijkstra algorithm) examples

Sec 10.6 Shortest path problems (Dijkstra algorithm)

Sec 10.6 Shortest path problems (Dijkstra algorithm)

Sec 10.4 Graph Connectivity and Sec 10.5 Eulerian, Hamiltonian paths and circuits

Sec 10.4 Graph Connectivity and Sec 10.5 Eulerian, Hamiltonian paths and circuits

Ex 10.2 10.4, Graph Connectivity

Ex 10.2 10.4, Graph Connectivity

Sec 10.1, 10.2 Graph

Sec 10.1, 10.2 Graph

Sec. 5.1 Mathematical Induction Part 2

Sec. 5.1 Mathematical Induction Part 2

Complex Counting Problems

Complex Counting Problems

Mathematical Induction Part 1

Mathematical Induction Part 1

Sec 6.1 Counting part 2

Sec 6.1 Counting part 2

Sec 6.1 Counting

Sec 6.1 Counting

Sec 4.3 Euclidean Algorithm and Sec 6.1 Counting Part 1

Sec 4.3 Euclidean Algorithm and Sec 6.1 Counting Part 1

Sec 4.3 Euclidean Algorithm

Sec 4.3 Euclidean Algorithm

Ex 4.1 and 4.3

Ex 4.1 and 4.3

Function Part 3

Function Part 3

Function part 2

Function part 2

Ex 2.4 Sequence and Summation Part 1

Ex 2.4 Sequence and Summation Part 1

Ex 2.1 and 2.2 Sets

Ex 2.1 and 2.2 Sets

Ex 2.4 Sequence and Summation Part 2

Ex 2.4 Sequence and Summation Part 2

Ex 2.2 part 2

Ex 2.2 part 2

Ex 2.1 Sets

Ex 2.1 Sets

Ex2.3: Functions

Ex2.3: Functions

Proof by Contradiction: if 3n+2 is odd then n is odd

Proof by Contradiction: if 3n+2 is odd then n is odd

Proof by Contradiction

Proof by Contradiction

Proof by Contraposition and Proof of Equivalence

Proof by Contraposition and Proof of Equivalence

Direct Proof Technique

Direct Proof Technique

Logic Circuit Part 2

Logic Circuit Part 2

Sec 1.3 Part 1

Sec 1.3 Part 1

Sec 1.4 Predicates and Quantifiers Part 1

Sec 1.4 Predicates and Quantifiers Part 1

Propositional Equivalence (p→q)∧ (p→r)= p →(q∧r) and (p→r)∧ (q→r)= (p∨q)→r

Propositional Equivalence (p→q)∧ (p→r)= p →(q∧r) and (p→r)∧ (q→r)= (p∨q)→r

Nested Quantifiers examples

Nested Quantifiers examples

Sec 1.4 Predicates and Quantifiers Part 2

Sec 1.4 Predicates and Quantifiers Part 2

Nested Quantifiers

Nested Quantifiers

Shortcut Method: Hexadecimal to Binary

Shortcut Method: Hexadecimal to Binary

Number System Conversion: Any Base (2, 8,10,16) to Any other Base (2, 8,10,16)

Number System Conversion: Any Base (2, 8,10,16) to Any other Base (2, 8,10,16)

Conversion: Decimal number to Binary, Octal and Hexadecimal (Easy Method, Solve with calculator)

Conversion: Decimal number to Binary, Octal and Hexadecimal (Easy Method, Solve with calculator)

Number System Conversion: Fractional Decimal number to Binary, Octal and Hexadecimal

Number System Conversion: Fractional Decimal number to Binary, Octal and Hexadecimal

Output Devices

Output Devices

Input Devices

Input Devices

Software Process - Principles that Guide Practice

Software Process - Principles that Guide Practice

Process Flow

Process Flow

Umbrella Activities

Umbrella Activities

Generic Framework Activities

Generic Framework Activities

Software Process

Software Process

Software Myths

Software Myths

Software Process: A layered approach

Software Process: A layered approach

Software Categories

Software Categories

Software characteristics different from Hardware

Software characteristics different from Hardware

Software Engineering Introduction

Software Engineering Introduction

killing null production

killing null production

Theorem 22 CFG to TG conversion

Theorem 22 CFG to TG conversion

killing unit production

killing unit production

ch#13 grammatical format

ch#13 grammatical format

pumping lemma explanation

pumping lemma explanation

Pumping Lemma

Pumping Lemma

Regular v/s NonRegular Languages

Regular v/s NonRegular Languages