๐ Chandigarh University โ MCA/CA/B.Tech
These Mid-Semester papers are part of the official examinations of Chandigarh University,
designed to test knowledge and practical understanding of core MCA, Computer Applications, and B.Tech subjects.
๐ก Each paper encourages students to think critically, apply concepts, and showcase problem-solving skills โ helping them prepare for real-world IT challenges.
Usage Condition:
- ๐ Papers are for reference and study purposes only.
- ๐งโ๐ Students should use them responsibly and not for any malpractice.
- ๐ Availability depends on the course and year.
Design and Analysis of Algorithms
Subject Code: 24CAT-611
Semester: 2 | Time: 1 Hour | Max Marks: 20
Section A
(5 ร 2 = 10 Marks)
- What is a flowchart, and why is it useful in representing algorithms? (CO1 โ BT2)
- State the difference between Big-Oh (O) and Omega (ฮฉ) notation. (CO2 โ BT2)
- What is a B-tree, and why is it used in databases and file systems? (CO4 โ BT2)
- What is pseudocode, and how is it used in algorithm design? (CO1 โ BT2)
Section B
(2 ร 5 = 10 Marks)
- In what ways are Binary Search and Linear Search different? (CO2 โ BT3)
- Can a tree be both a Full Binary Tree and a Complete Binary Tree? Explain your answer with examples. (CO4 โ BT4)
