11:05

RSA Algorithm Example 2 Unit 3 Cryptography Anna University

09:57

RSA Algorithm Example 1 Unit 3 Cryptography Anna University

12:50

Chinese Remainder Theorem Example 3 Unit 3 Cryptography Anna University

09:49

Diffie Hellman Algorithm Unit 3 Cryptography Anna University

15:07

Fermat Theorem Proof Unit 3 Cryptography Anna University

13:08

Chinese Remainder Theorem Example 1 Cryptography Unit 3 Anna University

06:18

Chinese Remainder Theorem Example 2 Unit 3 Cryptography Anna University

20:54

RC4 Algorithm Cryptography Anna University

13:59

Multiplicative inverse using Extended Euclidean Algorithm Cryptography Anna University

12:36

Part 2 SDES Algorithm Cryptography Anna University

10:59

Part 1 SDES Algorithm| Key generation | Cryptography Anna University

14:46

Playfair cipher technique Cryptography Anna University

07:54

Vigenere cipher technique Cryptography Anna University

03:54

Rail fence cipher technique Cryptography Anna University

26:44

Hill cipher technique Cryptography | Anna University

15:26

In complete graph of n vertices there are n-1/2 edge disjoint hamiltonian circuit if n is odd number

09:04

Prove that a graph is a tree if and only if it is minimally connected | Anna University

09:45

Prove that every tree has either one or two centre | Anna University

04:50

The number of vertices of odd degree in a graph is always even | Anna University

09:25

A simple graph with n vertices and k components can have at most ((n - k) * (n - k + 1) / 2 ) edges

08:46

A given connected graph G is an Euler graph if and only if all vertices of G are of even degree

04:42

Prove that a graph with n vertices, n - 1 edges and no circuits is connected | Anna University

10:11

Theorem Prove that a tree with n vertices has n - 1 edges | Anna University

05:24

Prove that in a graph G there is one and only path between every pair of vertices then G is a tree

08:26

Prove that a connected graph is Euler graph iff it can be decomposed into circuits| Anna University

03:10

Theorem Prove that there is one and only one path between every pair of vertices in a tree T Proof

11:15

Theorem - Every connected graph has atleast one spanning tree Proof Graph theory Anna University

20:13

Ratio And Proportion Part 2 Aptitude | Placements Competitive exams Entrance tests | Tamil

15:36

Ratio and Proportion Part 1 Aptitude | Placements, Competitive exams, Entrance tests | Tamil

08:37

Alon Matias Szegedy Algorithm Data Science and Analytics Anna University Tamil

28:47

Association rule mining example | Apriori Algorithm Data Science & Analytics Anna University Tamil

08:56

Koo and Toeug Coordinated Checkpoint Algorithm Distributed Systems Anna University Tamil

07:23

Preliminaries of Mutual Exclusion Algorithm Distributed Systems Anna University Tamil

18:26

Suzuki Kazami Algorithm Distributed Systems Unit 3 Anna University Tamil

31:23

Predictive Parsing Table Example with Parsing String Compiler Design Anna University Tamil

17:34

First and Follow Rules | LL(1) grammar | Compiler Design Anna University Tamil

34:16

Prove two regular expressions are same Thompson Subset Construction Example Compiler Design

08:17

Thompson Construction Algorithm Example Compiler Design Unit 1 Anna University Tamil

17:34

Medical Record Department | Hospital Management Anna University Tamil

07:22

Neural Networks Data Science and Analytics Anna University Tamil

11:26

Fuzzy Logic - Data Science and Analytics Anna University Tamil

16:28

Flajolet Martin Algorithm Example Data Science and Analytics Anna University Tamil

21:45

Apriori Algorithm Example Association Rule Mining Data Science and Analytics AnnaUniversity Tamil

09:28

Lamport Algorithm Unit 3 Distributed Systems Anna University Tamil

11:34

OR Model - Chandy Misra Haas Algorithm Unit 3 Distributed Systems Anna University Tamil

11:24

AND Model - Chandy Misra Haas Algorithm Distributed Systems Anna University Tamil

10:35

Maekawa Mutual Exclusion Algorithm Distributed Systems Unit 3 Anna University Tamil

05:16

Ricart Agrawala Algorithm Example Distributed Systems Unit 3 Anna University Tamil

06:41

Ricart Agrawala Algorithm Distributed Systems Unit 3 Anna University Tamil

07:18

WSP Unit 4 Mobile Computing Anna University Tamil

06:39

Mobile TCP | Mobile Computing Unit 4 Anna University Tamil

08:38

Intermediate Code Generation Syntax directed translation scheme CompilerDesign AnnaUniversity Tamil

08:42

Issues in Design of Code Generator | Unit 4 Compiler Design Anna University Tamil

06:46

Addressing array elements | Translation of Expression | Unit3 Compiler Design Anna University Tamil

09:36

Translation of Expressions - Part 1 | Unit 3 Compiler Design Anna University Tamil

12:22

Annotated Parse Tree Example | Unit 3 Compiler Design Anna University Tamil

13:48

Annotated Parse Tree Example int a,b,c | Unit 3 Compiler Design Anna University Tamil

13:14

Quadruples,Triples, Indirect triples Example | Compiler Design Anna University Tamil

07:22

Implementation of Three Address Code | Unit 3 Compiler Design Anna University Tamil

13:27

Three Address Code | Unit 3 Compiler Design Anna University Tamil