Scribd
Upload
97 views

CS301 Important Topics For Final Term

This document lists important topics for the final term of CS301, including data structures like binary trees (AVL trees, BSTs, parse trees, expression trees), heaps, disjoint sets, hashing, and sorting algorithms (merge sort, quicksort). It also mentions operations on tables, searching arrays, skip lists, and image segmentation.

Uploaded by

Muhammad ahzam
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
97 views

CS301 Important Topics For Final Term

This document lists important topics for the final term of CS301, including data structures like binary trees (AVL trees, BSTs, parse trees, expression trees), heaps, disjoint sets, hashing, and sorting algorithms (merge sort, quicksort). It also mentions operations on tables, searching arrays, skip lists, and image segmentation.

Uploaded by

Muhammad ahzam
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

For More Visit: VUStudents.

pk
CS301 Important Topics For Final Term
✓ AVL tree
✓ BST
✓ Parse tree
✓ Expression tree
✓ Huffman encoding
✓ Mathematical properties of binary tree ( MCQS)
✓ Properties of binary tree (Mcqs)
✓ Complete Binary tree
✓ Heap ,max,insertion in a heap
✓ Insertion into a min- heap
✓ Build heap
✓ PerculateDown Method
✓ GetMin Method
✓ BuildHeap Method
✓ Heap sort
✓ Disjoint set ADT
✓ Equivalence relationship
✓ Equivalence realtion
✓ Union by size
✓ Union by height
✓ Image segment ( short)
✓ Table and dictionaries
✓ Operation on table ADT
✓ Binary search
✓ Seraching an array : BS
✓ Skip list (Mcqs)
✓ Full
✓ Quad node
✓ AVL tree
✓ Hashing

For More Visit: VUStudents.pk


For More Visit: VUStudents.pk
✓ Collision
✓ Linear probing
✓ Merge sort
✓ Quicksort

For More Visit: VUStudents.pk

You might also like