R23
EEE · 2-1
✓ VERIFIED VS. PUBLISHED SYLLABUS 2026-07-12
Data Structures Lab
JNTUK R23 · EEE · semester 2-1 · syllabus
This JNTUK R23 skill-enhancement course is listed for Electrical and Electronics Engineering (EEE). It is listed in semester 2-1. It carries 2 credits. The published coverage runs across 5 units, from Arrays, Searching and Sorting through Trees.
Verified vs. published syllabus
Checked 12 Jul 2026
SOURCE DOCKET
Published evidence
✓ Verified
Checked 12 Jul 2026
Record Pages 18–20 · 5 published units
Verification scope The title, semester placement, credits, five-unit syllabus, complete sample-experiment lists and course outcomes are sourced directly from JNTUK's official R23 EEE course structure and syllabus PDF.
What you'll be able to do
Identify the role of data structures in organizing and accessing data. Design, implement, and apply linked lists for dynamic data storage. Develop applications using stacks and queues. Design and implement algorithms for operations on binary trees and binary search trees. Devise novel solutions to small scale programming challenges involving data structures such as stacks, queues, Trees.
5 units, from Arrays, Searching and Sorting to Trees. Tick off units as you cover them — your progress stays on this device.
Unit-wise syllabus
0 / 5 COVERED
UNIT 01 — Arrays, Searching and Sorting
Definition and importance of data structures; abstract data types (ADTs) · 1-D and 2-D arrays; row-major and column-major storage · Searching techniques: linear and binary search · Sorting techniques: bubble, selection and quick sort · Sample experiment: find the minimum and maximum elements in an array · Sample experiment: implement matrix multiplication · Sample experiment: locate an element in a sorted array using binary search · Sample experiment: implement selection sort and quick sort
UNIT 02 — Linked Lists
Singly linked lists: representation and operations · Doubly linked lists and circular linked lists · Comparing arrays and linked lists · Applications of linked lists, including polynomial addition · Sample experiment: implement insertion, deletion and traversal operations · Sample experiment: store student name, roll number and marks using a circular doubly linked list · Sample experiment: add two polynomial expressions using linked lists
UNIT 03 — Stacks
Introduction to stacks: properties and operations · Implementing stacks using arrays and linked lists · Applications: expression evaluation and infix-to-postfix conversion · Backtracking and reversing a list using a stack · Sample experiment: implement stack operations using arrays and linked lists · Sample experiment: convert an infix expression to postfix using a stack · Sample experiment: evaluate a postfix expression using a stack · Sample experiment: reverse a linked list using a stack
UNIT 04 — Queues and Deques
Introduction to queues: properties and operations · Circular queues; implementing queues using arrays and linked lists · Applications of queues such as scheduling · Double-ended queues (deques) and their operations · Sample experiment: implement queue operations using arrays and linked lists · Sample experiment: implement a circular queue using arrays and linked lists · Sample experiment: implement a deque using a linked list
UNIT 05 — Trees
Introduction to trees · Binary trees and traversals · Binary search tree: insertion, deletion and traversal · Implementing tree operations using linked lists · Sample experiment: implement binary-tree traversals using a linked list · Sample experiment: create a binary search tree, perform in-order traversal, insertion and deletion