1. A complexity of algorithm depends upon __
a) Time Only
b) Space Only
c) Both Time and Space
d) None of above
Answer: c) Both Time and Space
Reasoning: Algorithmic complexity is measured in terms of time complexity (how
long it takes to run) and space complexity (how much memory it uses).
2. An algorithm can be represented through __
a) Flow charts
b) Pseudo-codes
c) Instructions in common language
d) All of the mentioned above
Answer: d) All of the mentioned above
Reasoning: Algorithms can be expressed using flowcharts, pseudocode, or plain
language instructions.
3. There are two algorithms suppose A takes 1.41 milliseconds while B takes 0.9
milliseconds, which one of them is better considering all other things the same?
a) A is better than B
b) B is better than A
c) Both are equally good
d) None of the mentioned
Answer: b) B is better than A
Reasoning: Algorithm B takes less time (0.9 ms) to execute compared to A (1.41 ms),
so it is more efficient.
4. Considering an array list of 10 elements and the searching element is at array index 6. A
starting element is present at index zero. How many comparisons are required to search that
element using linear search?
a) 5
b) 6
c) 7
d) 8
Answer: c) 7
Reasoning: In a linear search starting from index 0, the algorithm checks elements at
indices 0, 1, 2, 3, 4, 5, and 6. This requires 7 comparisons.
5. In computer science, the computational artifacts could include __
a) Programs
b) Simulations
c) Videos
d) Programs, Simulations and videos
Answer: d) Programs, Simulations and videos
Reasoning: Computational artifacts are any digital creations made using
computational tools, including programs, simulations, and multimedia.
6. In the planning phase of computational artifact development following is included in
a) Logic
b) Data Structures
c) Control Structures
d) Logic, Data and Control Structures
Answer: d) Logic, Data and Control Structures
Reasoning: The planning phase involves designing the logic, selecting appropriate
data structures, and determining the control structures for the artifact.
7. trace method is used to __
a) Take Input
b) Hand simulate the execution algorithm.
c) Take a print
d) Align margins
Answer: b) Hand simulate the execution algorithm.
Reasoning: A trace table is used to manually simulate the execution of an algorithm
step by step to verify its correctness and understand its behavior.
8. Trace Tables are used to __
a) dry run algorithm
b) test if algorithm is giving expected output
c) show the variables change
d) a, b and c
Answer: d) a, b and c
Reasoning: Trace tables are used for dry running, testing expected output, and
tracking variable changes.
9. Algorithms are evaluated using __
a) Correctness
b) Efficiency
c) a and b
d) None of above
Answer: c) a and b
Reasoning: An algorithm is evaluated based on whether it produces the correct result
(correctness) and how efficiently it uses resources (efficiency).
1. Differentiate between
i. Clarity vs. Efficiency
Answer: Clarity refers to how easy it is for a human to read and understand an
algorithm. Efficiency refers to how well an algorithm uses computational resources
(time and memory). A clear algorithm may not be the most efficient, and an efficient
algorithm may be complex and hard to understand.
ii. Abstraction vs. Pattern recognition
Answer: Abstraction is the process of filtering out unnecessary details to focus on the
essential features of a problem. Pattern recognition is the process of identifying
similarities or recurring trends in problems that can be used to solve them more
efficiently.
iii. Pseudocode vs. Flowcharts
Answer: Pseudocode is a text-based, informal description of an algorithm using
programming-like constructs. Flowcharts are graphical representations of an
algorithm using standard symbols and arrows to show the flow of control.
iv. Data Structures vs. Control Structures
Answer: Data structures are ways of organizing and storing data (e.g., arrays, lists).
Control structures are constructs that determine the flow of execution in a program
(e.g., loops, conditionals).
v. Algorithm vs. Pseudocode
Answer: An algorithm is a step-by-step logical procedure for solving a problem.
Pseudocode is a way of writing down an algorithm in a format that resembles
programming code but is meant for human reading, not computer execution.
2. Write a note on working of Bubble Sort.
Answer: Bubble Sort is a simple sorting algorithm that repeatedly steps through the
list, compares adjacent elements, and swaps them if they are in the wrong order. The
pass through the list is repeated until the list is sorted. Larger elements "bubble" to the
end of the list.
3. Write names of commonly used computational artifacts made during computational
thinking.
Answer: Programs, simulations, models, visualizations, and videos.
4. Where we prefer to use binary search algorithm rather than linear search algorithm?
Answer: Binary search is preferred when the data is sorted and stored in a random-
access structure (like an array). It is much faster than linear search for large datasets
because it eliminates half of the remaining elements with each comparison.
5. What are the advantages of using flowcharts?
Answer: Flowcharts provide a visual representation of an algorithm, making it easier
to understand the logic. They help in identifying errors (bugs) and are useful for
documentation and communication among team members.
1. Determine the properties involved in computational thinking.
Answer: Computational thinking involves several key properties:
Decomposition: Breaking down a complex problem into smaller, more
manageable parts.
Pattern Recognition: Identifying similarities or trends within and across
problems.
Abstraction: Filtering out irrelevant details to focus on the essential features
of a problem.
Algorithm Design: Developing a step-by-step solution to the problem.
Evaluation: Assessing the solution for correctness and efficiency.
2. Sketch an algorithm that inputs length in inches and prints it in centimeters.
Answer:
text
Step 1: StartStep 2: Input length_in_inchesStep 3: length_in_cm = length_in_inches * 2.54Step 4: Print length_in_cmStep 5: End3. Implement an algorithm to print multiplication table of a number in reverse order.
Answer:
text
Step 1: StartStep 2: Input number NStep 3: Set counter = 10Step 4: While counter >= 1Step 5: result = N * counterStep 6: Print N, " x ", counter, " = ", resultStep 7: counter = counter - 1Step 8: End WhileStep 9: End4. Examine the uses of Flowcharts.
Answer: Flowcharts are used for:
Visualizing Logic: They provide a clear, visual representation of the flow of
an algorithm.
Debugging: They help in identifying logical errors and bottlenecks in a
process.
Documentation: They serve as a useful documentation tool for explaining
how a system works.
Communication: They facilitate communication between developers,
stakeholders, and team members.
Design: They are used in the design phase to plan out the steps of a
program before coding.
5. A newly developed Algorithm needs to be tested. Argue about the reasons.
Answer: Testing a newly developed algorithm is crucial for several reasons:
Correctness: To ensure the algorithm produces the correct output for all
valid inputs.
Efficiency: To verify that the algorithm runs within acceptable time and
space limits.
Edge Cases: To check how the algorithm handles unusual or extreme inputs
(e.g., empty lists, very large numbers).
Robustness: To ensure the algorithm does not crash or produce errors under
unexpected conditions.
Optimization: Testing can reveal areas where the algorithm can be
improved for better performance.
Activity 1: Complete the given trace table using the following algorithm
snippet.
Algorithm:
1. Start
2. x = 2
3. total = 0
4. REPEAT Step 5 THREE TIMES
5. total = total + x
6. Print (total)
End
Trace Table:
| Line No. | x | total | output |
| 2 | 2 | ||
| 3 | 2 | 0 | |
| 5 (1st) | 2 | 2 | |
| 6 (1st) | 2 | 2 | 2 |
| 5 (2nd) | 2 | 4 | |
| 6 (2nd) | 2 | 4 | 4 |
| 5 (3rd) | 2 | 6 | |
| 6 (3rd) | 2 | 6 | 6 |
Final Output: 2, 4, 6
Activity 2: Insertion sort algorithm
Sort the following array using insertion sort:
10 4 5 8 6 9 2Step-by-Step:
Start: [10, 4, 5, 8, 6, 9, 2]
Pass 1: [4, 10, 5, 8, 6, 9, 2]
Pass 2: [4, 5, 10, 8, 6, 9, 2]
Pass 3: [4, 5, 8, 10, 6, 9, 2]
Pass 4: [4, 5, 6, 8, 10, 9, 2]
Pass 5: [4, 5, 6, 8, 9, 10, 2]
Pass 6: [2, 4, 5, 6, 8, 9, 10]
Sorted Array: 2, 4, 5, 6, 8, 9, 10
Activity 3: Bubble sort algorithm
Sort the following array using bubble sort:
3 1 7 8 2 5 6 4 0Step-by-Step (First Pass):
[1, 3, 7, 8, 2, 5, 6, 4, 0] (Swap 3,1)
[1, 3, 7, 8, 2, 5, 6, 4, 0] (No swap)
[1, 3, 7, 8, 2, 5, 6, 4, 0] (No swap)
[1, 3, 7, 2, 8, 5, 6, 4, 0] (Swap 8,2)
[1, 3, 7, 2, 5, 8, 6, 4, 0] (Swap 8,5)
[1, 3, 7, 2, 5, 6, 8, 4, 0] (Swap 8,6)
[1, 3, 7, 2, 5, 6, 4, 8, 0] (Swap 8,4)
[1, 3, 7, 2, 5, 6, 4, 0, 8] (Swap 8,0)
After First Pass: [1, 3, 7, 2, 5, 6, 4, 0, 8]
(The process continues until the array is fully sorted.)
Final Sorted Array: 0, 1, 2, 3, 4, 5, 6, 7, 8
Activity 4: Binary Search algorithm
Consider the following sorted array of seven elements and we need to find a number 9.
2 4 5 6 8 9 10Step-by-Step:
Step 1: Middle element is 6 (index 3). 9 > 6, so search in the right half: [8, 9, 10].
Step 2: Middle element of right half is 9 (index 5). 9 == 9. Element found!
Activity 5: Linear Search algorithm
Consider the following array of eight elements and we need to find a number 9.
58 25 39 78 12 9 79 80Step-by-Step:
Step 1: Compare 58 with 9. Not equal.
Step 2: Compare 25 with 9. Not equal.
Step 3: Compare 39 with 9. Not equal.
Step 4: Compare 78 with 9. Not equal.
Step 5: Compare 12 with 9. Not equal.
Step 6: Compare 9 with 9. Element found at index 5!