Skh
fs lab 1 ouput
6:07
Skh
fslab 2 output
4:12
Skh
mod 1.2 fs
4:53
Skh
sms mod1. 1
10:30
Skh
fs chapter 1 of mod-1
4:41
Skh
exp10
2:15
Skh
exp9
2:39
Skh
halting problem
2:38
Skh
pcp
3:03
Skh
btree, multilevel index
2:58
Skh
indexing
2:46
Skh
file operations
4:40
Skh
data hierarchy
4:05
Skh
Ndtm
4:14
Skh
multi tape tm
5:09
Skh
types of hashing
4:37
Skh
hashing
4:25
Skh
exp8
2:31
Skh
exp7
4:12
Skh
weighted graph
8:10
Skh
sorting
7:41
Skh
tm construction
3:26
Skh
basics of graph
3:27
Skh
representation of graph
5:22
Skh
Tm model
4:04
Skh
Theorems on cfl
3:55
Skh
Deletion bst
4:30
Skh
Expression tree
3:44
Skh
Search and insert in bst
4:28
Skh
Not cf
4:31
Skh
Pumping lemma cfl
5:16
Skh
Ds6 exp
1:42
Skh
Ds5 exp
3:10
Skh
Cfg to pda
12:29
Skh
Pda construction
6:46
Skh
Gnf form
6:56
Skh
Threaded binary tree
6:12
Skh
Tree traversal
6:16
Skh
Exp4
2:35
Skh
Tree representation
7:08
Skh
Exp3 ds
3:42
Skh
Trees basics
5:29
Skh
Lab2
3:54
Skh
Polynomial representation
5:13
Skh
Expt1 ds
5:22
Skh
Circular linked list insertion
7:53
Skh
Traversing linked list
7:47
Skh
Deletion in linked list
7:33
Skh
Linked list insertion operation
5:36
Skh
Linked list
6:36
Skh
Circular queue
8:14
Skh
Basics of queue
8:37
Skh
Recursion
6:22
Skh
Postfix evaluation
3:41
Skh
Infix to postfix
6:08
Skh
dynamic arrays for stack
9:40
Skh
23 September 2020
8:56
Skh
18 September 2020
7:50
Skh
string operation
5:45
Skh
array operations
9:57
Skh
arrays and structures
6:30
Skh
Dfa design
11:38
Skh
Non primitive data structure
6:42
Skh
Data structure basics
8:10
Skh
Finite automata basics
10:42
Skh
14 May 2020
6:32
Skh
12 May 2020
5:40
Skh
4 May 2020
11:57
Skh
25 April 2020
7:17
Skh
22 April 2020
7:10
Skh
22 April 2020
5:38
Skh
17 April 2020
9:42
Skh
13 April 2020
5:09
Skh
9 April 2020
12:08