Scribd
Upload
2 views

Algorithm and progamming

The document outlines a comprehensive curriculum on algorithms and programming, divided into five modules covering topics such as programming basics, data types and structures, pseudo code and flowcharts, control structures, and algorithmic techniques. Each module includes specific questions and tasks designed to deepen understanding of programming concepts and practices. The curriculum emphasizes practical applications through pseudo code and flowchart exercises for various difficulty levels.

Uploaded by

gesrylcherrel
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
2 views

Algorithm and progamming

The document outlines a comprehensive curriculum on algorithms and programming, divided into five modules covering topics such as programming basics, data types and structures, pseudo code and flowcharts, control structures, and algorithmic techniques. Each module includes specific questions and tasks designed to deepen understanding of programming concepts and practices. The curriculum emphasizes practical applications through pseudo code and flowchart exercises for various difficulty levels.

Uploaded by

gesrylcherrel
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

ALGORITHM AND PROGRAMMING

MODULE 1: Introduction to programming and algorithm.

1. What is a program?
2. What is an algorithm?
3. Give five characteristics of a good algorithm.
4. Give five importance of an algorithm.
5. What is a pseudo code?
6. What is a flowchart?
7. Give the different symbols in a flowchart and give their uses.

MODULE 2: Basic of Datatypes and Data structures.

1. What is a datatype?
2. What is a variable?
3. What is object?
4. Give the various types of datatypes founded in most programming languages.
5. What is a primitive datatype?
6. What is an Abstract or derived data type?
7. What is an Union?
8. What is the difference between derived and primitive datatypes?
9. Give the three importance and function of datatypes.
10. What is a data structure?
11. Give the two main categories of data structure.
12. What are linear data structure and non-linear data structure?
13. What are static and dynamic data structures?
14. Give the various type of linear data structure and describe them?
15. Give the different types of arrays.
16. What are nodes?
17. Give the various categories of link lists?
18. What is a stack?
19. Give the different operation of the stack and what the do.
20. What is a queue?
21. Give the various operation of a queue and describe them.
22. Give three life examples each of stacks and queue.
23. What is tree?
24. Give six parts of a tree.
25. Give four types of trees.
26. Give some applications of trees.
27. What is a graph?
28. Give the various parts of a graph.
29. Give the different types of graph.
30. Give four real life applications of a graph.

MODULE 3: Pseudo code and Flowchart.


Write a pseudo code and flow chart for the following;

### Easy

1. Write a simple pseudo code to calculate the sum of two numbers.


2. Create a flowchart to determine if a number is even or odd.

NOTE: Good through module 4 before you continue.

### Medium

1. Write pseudo code for finding the largest number in an array.


2. Develop a flowchart for the process of making a cup of tea.

### Intermediate

1. Construct pseudo code for a program that counts the number of vowels in a given string.
2. Draw a flowchart to find the factorial of a number using iteration.

### Hard

1. Write pseudo code to implement the binary search algorithm.


2. Create a flowchart for a program that sorts an array using the bubble sort algorithm.

### Very Hard

1. Develop pseudo code for the Dijkstra's algorithm to find the shortest path in a graph.
2. Design a flowchart to solve the Tower of Hanoi problem for n disks.

MODULE 4: CONTROL STRUCTURES.

1. What is a control structure?


2. Give the different types of control structures.
3. What is an iteration and why do we iterate in programming?
4. What is a for loop, while loop, do-while loop?
5. How do the above work?
6. What are if, else, else-if statements used for?
7. What is the used of the following in C programming;
 Break.
 Continue.
 Return.
 Go-to.

MODULE 5: algorithmic technics

Describe how the following algorithmic technics work;

 Brute force.
 Recursion.
 Divide and conquer.
 Dynamic programming.
 Back tracking.

You might also like