R23 CSE · 2-1 ✓ VERIFIED VS. PUBLISHED SYLLABUS 2026-07-09

Advanced Data Structures & Algorithm Analysis JNTUK R23 · CSE · semester 2-1 · syllabus

This JNTUK R23 professional core course is listed for Computer Science and Engineering (CSE). It is listed in semester 2-1. It carries 3 credits. The published coverage runs across 5 units, from Introduction, AVL and B-Trees through NP-Hard and NP-Complete Problems.

Verified vs. published syllabus Checked

Offered in

BranchesSemesterLTPC
CSE 2-1 30 03
SOURCE DOCKET

Published evidence

✓ Verified
Source
Checked
Record
5 published units

Verification scopeSubject name, credits, unit-wise syllabus, and course outcomes are sourced directly from JNTUK's own official R23 course structure and syllabus document, not an autonomous college's adaptation.

What you'll be able to do

  • Analyze algorithm performance using space and time complexity measures, apply asymptotic notations, and construct and manipulate AVL Trees and B-Trees for various applications
  • Apply and evaluate heap structures, graph representations, and graph traversal techniques, and implement divide-and-conquer algorithms such as quick sort, merge sort, Strassen's matrix multiplication, and convex hull computations
  • Apply greedy and dynamic programming strategies to solve optimization problems such as MST, shortest paths, knapsack, OBST, TSP, and string editing, and analyze their computational efficiency
  • Develop and analyze solutions for combinatorial problems using backtracking and branch-and-bound techniques, including 8-queens, subset sum, graph coloring, knapsack, and TSP
  • Explain and evaluate NP-hard and NP-complete problem classes, including graph and scheduling decision problems, and assess their computational intractability with reference to theoretical foundations

5 units, from Introduction, AVL and B-Trees to NP-Hard and NP-Complete Problems. Tick off units as you cover them — your progress stays on this device.

Unit-wise syllabus

0 / 5 COVERED