Scribd
Upload
3 views

DSA using C and C++

This document outlines the examination structure for the B.C.A. (Third Semester) Data Structure Using C & C++ course in 2025. It includes sections for very short answer questions, short answer questions, and long answer questions, each with specific instructions and marks allocation. Topics covered include stack, binary search trees, hashing, array data structures, and various sorting algorithms.

Uploaded by

uraj2526182
Copyright
© © All Rights Reserved
Available Formats
Download as PDF or read online on Scribd
3 views

DSA using C and C++

This document outlines the examination structure for the B.C.A. (Third Semester) Data Structure Using C & C++ course in 2025. It includes sections for very short answer questions, short answer questions, and long answer questions, each with specific instructions and marks allocation. Topics covered include stack, binary search trees, hashing, array data structures, and various sorting algorithms.

Uploaded by

uraj2526182
Copyright
© © All Rights Reserved
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 3
25/1186 B.C.A. (Third Semester) Examination, 2025 Second Paper (Data Structure Using C & C++) Time : Two Hours ] [ Maximum Marks : 75 Note : Attempt all sections as per directed. Section-A (Very Short Answer Type Questions) Note : Attempt all the question the 05 (five) questions. Each question carries O02 (two) marks and The answer of each question should not exceed 50 words. 5x2=10 1. (a) What do you mean by stack? Illustrate with example? P.T.O. a Illustrate Binary Search Tree with an ; example. (©) Explain binary search in brie. (d) Convert to Postfix: ge*7-3 "arc orb* 2-4 *a*c (e)_ What is Array? Define 20 Array with example. Section-B (Short Answer Type Questions) Note : Attempt any 05 (Five) questions out of total 08 (Eight) questions. Each question carries 5 (Five) marks and answer of each questions should not exceed 100 words. 5x5=25 @) (2) Write the inorder traversal of the following Binary Tree: @ & ©. w Q © © @ © @ ~{b) What is Hashing? Explain briefly? 2 t (©) (d) te) (f) (9) 25/1186 Convert following to binary tree? () (Asp) *(C+D) Gi) (A+B+C) * (D+E+F) What is Priority Queue? Explain its use with an example. What is Array Data Structure? What are the Application of Array. Define Inorder Traversal, preorder Traversal and Postorder Traversal. Explain the Linear Search with Algorithm? Define Sparse Array and also explain its importance? Section-C (Long Answer Type Questions) Note : Attempt any 02 (two) questions out of total 04 (four) questions. Each question carries 20 (twenty) marks and the answer of each question should not exceed 400 words. 2x20=40 3 P.T.0. /1186 (a) Write Sort note: 5+5+5+5 (i) Selection sort (ii) Deque (iii) Stack (iv) Heap sort (b) (i) Discuss Binary Search Tree and its Characteristics? (ii) What are the Application of Stack Data Structure? (c) (i) Write an Algorithm for Traversal for Binary Search Tree? (ii) What do you mean by Searching? Explain Hashing with example. (d) Differentiate between 5+5+54+5 (i) Binary Search Vs Linear search (ii) Singly vs Doubly Linked list (iii) Queue vs Deque (iv) Selection vs insertion sort

You might also like