Programming Concepts

Course Title: Introduction to Programming (Course Code: PROG101)Assignment: Programming Concepts
Instructions:
1.
2.
3.
4.
Submission: Submit your assignment via the online platform by the due date.
Format: All answers must be typed and submitted as a single document (PDF or Word).
Deadline: The assignment is due by [insert due date].
Plagiarism: Plagiarism will not be tolerated. Ensure all work is your own, and any
references used are properly cited.
5. Marks: Each question is worth 20 marks, totaling 100 marks.
6. Late Submissions: Late submissions will incur a penalty of 10% per day.
Questions:
1. Procedural vs. Object-Oriented Programming (5 marks) Explain the difference between
procedural programming and object-oriented programming. Provide an example scenario for
each programming paradigm.
2. Recursion (5 marks) Define recursion and provide a real-world problem that can be solved
using recursion. Explain how recursion solves the problem.
3. Dynamic Programming (5 marks) Discuss the purpose and advantages of dynamic
programming in algorithm design. Provide an example problem that can be solved using
dynamic programming, and outline the steps involved.
4. Big O Notation (5 marks) Define Big O notation and explain its significance in algorithm
analysis. Using examples, demonstrate how to determine the time complexity of various
algorithms using Big O notation.
5. Linked List vs. Array (5 marks) Compare and contrast linked lists and arrays in terms of
memory allocation, performance, and usage scenarios. Provide examples of when each data
structure would be preferred.
1
SUBMISSION INSTRUCTIONS:
1.
2.
3.
4.
Ensure your assignment is properly formatted with the cover page included.
Save your document in PDF or Word format.
Submit your assignment via the online platform before the deadline.
Make sure your submission adheres to the guidelines provided in the assignment
instructions.
Note to Students: If you have any questions or need clarification on any of the assignment
questions, please don’t hesitate to reach out to your instructor. Good luck!
2