Basic Data Structures

This course provides the introduction to programming with procedural paradigm, program design and logic. It includes the basic features of program implementation plan and program inspections (“desk checking”), problem elementary analysis and design tasks using procedural diagrams and pseudo code. It intends to provide students an overview of data organization and certain data structures covered along with a discussion of different operations which are applied to these data structures.

The aims of this course are:

•  To create programming designs which includes step-by-step algorithms and desk checking to validate problem solutions.
•  To control the structures of the algorithms implemented as well-organized computer programs.
•  To prove an understanding of structured design by implementing programs with the concept of the efficient use of code.
•  To demonstrate problem solving skills by developing algorithms
•  To explain the introduction and over view of Data Structure, Control Structure, Complexity of Algorithms
•  To understand representation and operations of different data structure (Array, LinkedList, Pointer, Stack, Queue)

Upon the successful completion of this course, students should be able to:

• Describe the major components in problem solving for a computer program.
• Create flowcharts and write pseudo code to illustrate program algorithm or process.
• Apply decision and repetition structures in program design.
• Apply recursion techniques to problem solving.
• Define the most suitable data structure and implement the program.

Textbooks:

1. Computer Programming Technique and Data Structure, University of Information Technology Press, 2019
2. Fundamentals of Data Structures by Lovely Professional University, Punjab (India)

References:

1. Programming Logic and Design, Comprehensive, Eighth Edition by Joyce Farrell
2. Theory and problems of Data Structures (International Edition) Schaum’s Outline Series in Computers by Seymour Lipschutz