Internal Examination - 2025
Diploma In Information & Communication Technology
NVQ Level 05 - I Semester
Data Structures and Algorithms K72C001M06 03 Hours
Do the all questions given below. 100 Marks
1) This question tests the student's deep understanding of basic programming concepts and control
flow using a structured language.
1. Describe the difference between variables and data types with code examples. (03 marks)
2. Write a program segment using if...else and switch/case to validate a user-entered
grade and return the grade level. (04 marks)
3. Discuss the difference between for loop, while loop, and nested loops with example outputs.
(04 marks)
4. Define recursion. Write a recursive function to calculate the factorial of a given number.
(04 marks)
5. Explain how functions help with modular programming. Illustrate your answer using a
function-based calculator program. (05 marks)
2) This question assesses logical thinking by requiring students to visualize and write algorithmic steps
clearly using flowcharts and pseudocode.
1. Draw a flowchart to sort a list of 5 numbers using bubble sort. (03 marks)
2. Write the pseudocode for the flowchart in Q2.1. (04 marks)
3. Draw a flowchart to find the 3rd largest number from a list of 10 integers. (04 marks)
4. Write pseudocode to search for a specific name in an array of names using linear search. (04 marks)
5. Convert the pseudocode in Q2.4 into a working program in Java. (05 marks)
1|Page
3) This question focuses on deep understanding and practical usage of linear and non-linear data structures.
1. Compare Arrays and Linked Lists in terms of memory allocation, access time, and insertion/deletion
complexity. (03 marks)
2. Write Java or Python code to implement a Stack using an array and demonstrate push and pop
operations. (04 marks)
3. Explain the structure and working of a Queue. (04 marks)
4. What is a binary tree? Write pseudocode for in-order traversal. (04 marks)
5. Differentiate between Maps, Sets, and Tuples with code examples in Java. (05 marks)
4) Evaluates ability to understand and implement complex sorting and searching algorithms.
1. Describe the working mechanism of Quick Sort with an example array of 8 numbers. (03 marks)
2. Write a program in Java or Java to perform Selection Sort. (04 marks)
3. Explain the difference between Linear Search and Binary Search. Include use-case scenarios.
(04 marks)
4. Write pseudocode for Binary Search and trace it with a sorted array of 10 elements. (04 marks)
5. Discuss Hashing techniques and their role in search optimization. Give a real-life example.
(05 marks)
2|Page
5) Tests real-world application development knowledge including databases and version control.
1. Describe the main steps of the Software Development Life Cycle (SDLC) and map each to a sample
project. (04 marks)
2. Write pseudocode to connect a Java application to a MySQL database and insert student records.
(05 marks)
3. Explain the purpose of Exception Handling with examples in Java. (06 marks)
4. What is Git and why is it used? Explain basic Git operations. (05 marks)
-END-
3|Page
