Scribd
Upload
13 views3 pages

Analysis of PDSA Exam Topics

The document categorizes topics for the Programming, Data Structures and Algorithms (PDSA) exam into high, medium, and lower priority. High priority topics include asymptotic analysis, sorting algorithms, graph algorithms, and tree structures, while medium priority covers dynamic programming and basic data structures. The exam emphasizes both theoretical concepts and practical implementation details.

Uploaded by

24f1002200
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
13 views3 pages

Analysis of PDSA Exam Topics

The document categorizes topics for the Programming, Data Structures and Algorithms (PDSA) exam into high, medium, and lower priority. High priority topics include asymptotic analysis, sorting algorithms, graph algorithms, and tree structures, while medium priority covers dynamic programming and basic data structures. The exam emphasizes both theoretical concepts and practical implementation details.

Uploaded by

24f1002200
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/ 3

Analysis of PDSA Exam Topics

Based on the provided question papers, here's a categorized list of topics for the Programming,
Data Structures and Algorithms (PDSA) exam, organized by priority:

High Priority Topics

Asymptotic Analysis
Time complexity analysis of algorithms
Big O notation
Comparing growth rates of functions
Recurrence relations and their solutions

Sorting Algorithms
Quick Sort (worst case analysis, pivot selection)
Merge Sort (recurrence relation, implementation)
Selection Sort (number of swaps)
Insertion Sort (implementation with custom comparators)

Graph Algorithms
Breadth-First Search (BFS)
Depth-First Search (DFS)
Topological Sorting
Shortest Path Algorithms (Dijkstra's, Bellman-Ford)
Minimum Spanning Trees
Graph representations (adjacency matrix)
Network Flow and Min-Cut

Trees
Binary Search Trees (insertion, traversal)
Tree traversals (pre-order, post-order)
AVL Trees (height calculations)
Heap data structures (min-heap, max-heap)
Priority Queues

Medium Priority Topics

Dynamic Programming
Longest Increasing Subsequence
Longest Common Subsequence
Longest Decreasing Subsequence
Matrix Chain Multiplication
Optimal substructure identification

Basic Data Structures


Stacks (operations and applications)
Queues (operations and applications)
Linked Lists (singly linked with head/tail pointers)
Hash Tables (open addressing, linear probing)

Greedy Algorithms
Task scheduling with deadlines
Huffman coding

Median Finding Algorithms


Median of medians algorithm

Lower Priority Topics

Computational Complexity
NP-completeness
NP-hardness
Polynomial-time reductions

Miscellaneous
Binary Search implementation
Inversion counting in arrays
Linear Programming formulation
Independent sets and vertex covers in graphs
The exam heavily focuses on algorithm analysis, graph algorithms, and tree data structures, with
significant emphasis on dynamic programming and greedy approaches. Questions frequently
require understanding of theoretical concepts as well as practical implementation details.
⁂

You might also like