0% found this document useful (0 votes)
5 views1 page

CT1 PSPP

This document outlines the structure and content of a Cycle Test for the course GE3151 - Problem Solving and Python Programming at Dhirajlal Gandhi College of Technology. It includes various questions related to algorithms, pseudocode, programming languages, and flowcharts, divided into three parts with specified marks. The test aims to assess students' understanding of algorithmic problem solving and programming concepts.

Uploaded by

Aathish Kumar.P
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
5 views1 page

CT1 PSPP

This document outlines the structure and content of a Cycle Test for the course GE3151 - Problem Solving and Python Programming at Dhirajlal Gandhi College of Technology. It includes various questions related to algorithms, pseudocode, programming languages, and flowcharts, divided into three parts with specified marks. The test aims to assess students' understanding of algorithmic problem solving and programming concepts.

Uploaded by

Aathish Kumar.P
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

DHIRAJLAL GANDHI COLLEGE OF TECHNOLOGY, SALEM

Department of Agricultural, Civil, Mechanical and R&A Engineering

Year/Sem I/I Time 2 hours


Max.Marks 60 Date 15.10.2024(AN)
CYCLE TEST-I
GE3151 / PROBLEM SOLVING AND PYTHON PROGRAMMING
PART-A(10X2=20) BL COs
L1 CO1
1. What is an algorithm? State the qualities of good algorithm.
L1 CO1
2. What is a pseudocode? Mention its benefits.
L4 CO1
3. How will you analyze the efficiency of an algorithm?
L1 CO1
4. List the steps involved in identification of computation problem.
L1 CO1
5. What is a programming language? List down its types.
Explain the steps involved in Algorithmic problem solving. L2 CO1
6.
Define an iterative statement. L1 CO1
7.
Distinguish between top-down and bottom-up approach to design
L4 CO1
8. algorithm.

Draw a flow chart to find factorial of a number. L6 CO1


9.
Write an algorithm to find whether the given number is ODD or EVEN. L6 CO1
10.
PART-B(3X10=30)
11. Explain the building blocks of algorithm. L2 CO1

12. Draw a flow chart and write algorithm to find the smallest of three L6 CO1
numbers.
13. State the Towers of Hanoi Problem. Outline a solution the Towers of Hanoi CO1
problem with relevant diagrams and write its recursive algorithm. L3

PART-C(1X10=10)

14. What are the simple strategies for developing algorithms? L2 CO1

Course Coordinator Module Coordinator HOD/Programme Coordinator

You might also like