IT-303 Data Structure Notes
5 notes for Data Structure, unit by unit.
Notes for IT-303
- Unit 1 · Short notes Introduction Data and data types · Data objects · Primitive and non‑primitive data structures · Linear and non‑linear data structures · Traversing operations on data structures · Searching operations on data structures
- Unit 2 · Short notes Arrays & Structure Declaration of arrays · Insertion, deletion and merging of arrays · One‑dimensional and two‑dimensional arrays · Row‑major and column‑major representation · Address calculation in arrays · Storing values in arrays
- Unit 3 · Short notes Stacks & Queues Basic concepts of stacks and queues · Array representation of stacks · Stack operations: push, pop, create, getTop, empty · Linked representation of stacks · Multiple stacks · Applications of stacks: infix, prefix, postfix conversion and arithmetic expression evaluation
- Unit 4 · Short notes Linked List Basic terminology of linked lists · Memory allocation and deallocation for linked lists · Variants: head pointer, head node · Linear and circular linked lists · Doubly linked list creation, deletion, insertion, traversal · Singly circular linked list
- Unit 5 · Short notes Trees and Graphs General tree terminology and representation · Types of trees · Binary tree realization and properties · Binary tree traversals: inorder, preorder, postorder · Applications of trees · Graph basic terminology and representations
More for IT-303
Other 3rd semester IT subjects
- ES-301 Energy & Environmental Engineering
- IT-302 Discrete Structure
- IT-304 Object Oriented Programming & Methodology
- IT-305 Digital Circuits and Systems
- IT-306 Java Programming Lab