Data Structures (3 Units C: LH 30; PH 45)
Course Contents
Primitive types, Arrays, Records Strings and String processing. Data representation in memory,
Stack and Heap allocation, Queues, Trees. Implementation strategies for stack, queues, trees.
Run time storage management; Pointers and References, linked structures.
Lab work: Writing C+/C++ functions to perform practical exercises and implement using
the algorithms on arrays, records, string processing, queues, trees, pointers and linked
structures.