Skip to content

Data Structures (BLGM231)

Data types. Binary and decimal Integers. Floating point number. Pointers. Arrays. Structures. Array of structures. Self-referential structures. Dynamic memory allocation. Concept of Abstract Data Type (ADT). Memory allocation of arrays. Linked lists (singly linked, doubly linked, circular). Dynamic implementation of lists. The stack. Infix, postfix, and prefix notations. Applications of the stack: Infix-to-postfix conversion, evaluation of postfix expressions. Recursion. Binary search. The towers of Hanoi problem. Queues. Trees and their applications. Binary tree representations. Binary tree traversals. Binary search trees (definition, operations). Heaps (Pre-requisite: CMPE 112)

Credit: 4

Lecture Hour (hrs/week): 4

Lab (hrs/week): 0

Tutorial (hrs/week): 1

Related Programs