CBDS2103 Data Structure Assignment Questions 2026 | Open University Malaysia

CBDS2103 Assignment Brief January 2026

ASSIGNMENT QUESTION

PURPOSE

Construct a complete C program using suitable data structures to carry out operations such as creation, insertion, deletion, searching and updating, based on an applied problem. Apply digital tools to test and verify the correctness, behaviour and performance of data structure algorithms in a given C program.

Bina satu atur cara C yang lengkap menggunakan struktur data yang sesuai untuk melaksanakan operasi seperti pembinaan, penyisipan, pemadaman, carian dan pengemaskinian berdasarkan satu masalah aplikasi. Gunakan alatan digital untuk menguji dan mengesahkan ketepatan, tingkah laku dan prestasi algoritma struktur data dalam atur cara C yang diberikan.

QUESTION 1

Tuition Centre Student Queue Management System

A tuition centre handles many walk-in student registrations daily. At present, registrations and waiting entries are written manually in a notebook. This causes long waiting times and difficulties when staff need to check names, outstanding fees, or the position of a student in the queue. Some students lose their turn, and parents complain when their child’s name is missing from the list.

To prevent further issues, the centre wants to use a simple program written in the C language to manage a queue of students waiting for class allocation. This program must store each student’s details using a structure, and manage the list of waiting students using a singly linked list built with dynamic memory allocation.

Each student record must contain:

• studentID — integer
• name — up to 50 characters
• feeBalance — float value representing the outstanding fee

Your task is to develop a complete C program that simulates this queue management system.

PROGRAM REQUIREMENTS

A. Structure and Linked List Definition

1. 1. Define a structure Student with studentID, name, and feeBalance.
   2. Create a singly linked list where each node stores a Student structure and a pointer to the next node.

B. Implement the following functions:

1. 1. EnqueueStudent – Insert a new student at the end of the queue.
   2. DequeueStudent – Remove the student at the front of the queue and display the details.
   3. SearchStudentByID – Locate a student by studentID and display the record.
   4. UpdateFeeBalance – Update the feeBalance of an existing student. Show before-and-after values.
   5. DisplayQueue – Display all student records in order of arrival.

C. Menu in main() function

Your program must include a menu that allows the user to:

• Add new student
• Serve next student
• Search student by ID
• Update fee balance
• Display queue
• Exit program

Your program must handle empty queue and invalid ID cases.

TESTING REQUIREMENTS

Your output must demonstrate:

• Minimum five students inserted using EnqueueStudent
• Queue display after all insertions
• One search for an existing student
• One search for a non-existing student
• One successful fee update operation
• Removal of at least two students
• Final display of the queue

DOCUMENTATION REQUIREMENTS

Your submission for Question 1 must include:

• A short introduction to the problem
• Full, well-commented C program
• Clear screenshots of all required outputs
• Submission of both .docx (documentation) and .c (source code) files

Programming must be performed in C language only.

(40 marks)

QUESTION 2

This question requires you to test and verify the correctness and behaviour of the program created in Question 1. You must use digital tools such as compiler messages, print tracing, or debugging features to confirm that your program is working as expected.

Prepare a testing and debugging report based on your C program.

Your report must include:

A. Test Case Table

Prepare a table containing test cases for:

• Enqueue operation
• Dequeue operation
• Searching (existing and non-existing ID)
• Updating fee balance
• Displaying the queue

Each test case must include:

1. • Input
   • Expected output
   • Actual output

B. Debugging Activity

Identify at least three errors that occurred during development. These may include:

• Pointer updates
• Incorrect conditions
• Memory issues
• Traversal problems

For each error:

1. • Explain how it was detected
   • Describe the cause
   • State the correction performed

C. Output Evidence

Provide screenshots showing:

• Execution of each function tested
• Any before/after behaviour
• Any compiler or debugging information used

Screenshots must be clear and readable.

D. Time Complexity Review

Explain the time complexity for:

• Enqueue
• Dequeue
• Search
• Update fee balance

Give a short explanation (2–3 sentences) and use O-notation.

SUBMISSION REQUIREMENTS

Report for Question 2 must include:

• Test case table
• Debugging explanations
• Output screenshots
• Time complexity review

(20 marks)

(Total: 60 marks)

Answer

Request Answer of this Assignment