Page 125 - IT_Bulletin
P. 125
DATA STRUCTURE AND ALGORITHMS
Course ILLUSTRATE NON-LINEAR DATA STRUCTURE. 31 34
14
Outcome 4 10
Learning DIFFERENTIATE VARIOUS TYPES OF BINARY TREE. 13 10
Outcome 1
Contents Terminologies: Root node, Terminal node, Non-Terminal node, Degree of
a node, Degree of a tree, Siblings, Depth, Level, Path, Sub tree, Forest.
Types of Tree: Binary Tree, Complete Binary Tree, Strictly Binary Tree,
Expression Tree, Binary Search Tree, AVL Tree, Threaded Binary Tree.
Learning Tree Traversal: In-order, Pre-order and Post-order. 10
Outcome 2
EXPLAIN MINIMUM SPANNING TREE AND DIFFERENT TYPES OF
GRAPH WITH REPRESENTATION.
Contents Graph: Introduction to Graph, Graph Vs Tree, Vertex, Edge,
Adjacent Vertex, Connected Graph, Simple Graph, Weighted Graph,
Complete Graph And Directed Graph.
Graph Traversal: Breadth First Search, Depth First Search.
Learning Graph Representation: Adjacent Matrix, Adjacency List 8
Outcome 3 Representation.
Minimum Spanning Tree: Kruskal's & Prim’s Techniques.
WRITE AN ALGORITHM FOR TREE & GRAPH TRAVERSAL.
Contents Algorithm of in-order, preorder and post order traversal of tree.
Method of Algorithm to traverse a graph using Breadth First Search and Depth
Assessment First Search.
LO - 1 Paper pen test (End Semester Exam)
LO - 2 Paper pen test/Assignment: Term Work (Internal)
LO - 3 Lab Assessment (Internal)
DATA STRUCTURE AND ALGORITHMS
Course ILLUSTRATE NON-LINEAR DATA STRUCTURE. 31 34
14
Outcome 4 10
Learning DIFFERENTIATE VARIOUS TYPES OF BINARY TREE. 13 10
Outcome 1
Contents Terminologies: Root node, Terminal node, Non-Terminal node, Degree of
a node, Degree of a tree, Siblings, Depth, Level, Path, Sub tree, Forest.
Types of Tree: Binary Tree, Complete Binary Tree, Strictly Binary Tree,
Expression Tree, Binary Search Tree, AVL Tree, Threaded Binary Tree.
Learning Tree Traversal: In-order, Pre-order and Post-order. 10
Outcome 2
EXPLAIN MINIMUM SPANNING TREE AND DIFFERENT TYPES OF
GRAPH WITH REPRESENTATION.
Contents Graph: Introduction to Graph, Graph Vs Tree, Vertex, Edge,
Adjacent Vertex, Connected Graph, Simple Graph, Weighted Graph,
Complete Graph And Directed Graph.
Graph Traversal: Breadth First Search, Depth First Search.
Learning Graph Representation: Adjacent Matrix, Adjacency List 8
Outcome 3 Representation.
Minimum Spanning Tree: Kruskal's & Prim’s Techniques.
WRITE AN ALGORITHM FOR TREE & GRAPH TRAVERSAL.
Contents Algorithm of in-order, preorder and post order traversal of tree.
Method of Algorithm to traverse a graph using Breadth First Search and Depth
Assessment First Search.
LO - 1 Paper pen test (End Semester Exam)
LO - 2 Paper pen test/Assignment: Term Work (Internal)
LO - 3 Lab Assessment (Internal)
DATA STRUCTURE AND ALGORITHMS
