Scribd
Upload
4 views1 page

Data Struct

This document outlines the model examination for B.Sc. (Maths) II in Data Structure at Gurukul College Pathalgaon for the academic year 2024-25. It includes details on the examination format, with all questions being compulsory and requiring students to attempt two questions from each unit. The document lists specific topics and questions across five units, covering fundamental concepts in data structures, algorithms, trees, graphs, and sorting techniques.

Uploaded by

Mahabeer Rana
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
4 views1 page

Data Struct

This document outlines the model examination for B.Sc. (Maths) II in Data Structure at Gurukul College Pathalgaon for the academic year 2024-25. It includes details on the examination format, with all questions being compulsory and requiring students to attempt two questions from each unit. The document lists specific topics and questions across five units, covering fundamental concepts in data structures, algorithms, trees, graphs, and sorting techniques.

Uploaded by

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

GURUKUL COLLEGE PATHALGAON, DIST – JASHPUR (C.G.) GURUKUL COLLEGE PATHALGAON, DIST – JASHPUR (C.G.

)
MODEL EXAMINATION – (2024-25) MODEL EXAMINATION – (2024-25)
B.Sc. (Maths) – II B.Sc. (Maths) – II
DATA STRUCTURE DATA STRUCTURE
Time: 03 Hours Marks: 100 Time: 03 Hours Marks: 100
Note:- All questions are compulsory. Attempt any two (2) questions from each Note:- All questions are compulsory. Attempt any two (2) questions from each
unit. All questions carry equal marks. unit. All questions carry equal marks.

UNIT -1 UNIT -1
1. What is Data Structure? Explain its types. 1. What is Data Structure? Explain its types.
2. What is an Array? Write a address calculation methods of array. 2. What is an Array? Write a address calculation methods of array.
3. Write an algorithm for insertion in linked list with giving suitable example. 3. Write an algorithm for insertion in linked list with giving suitable example.

UNIT -2 UNIT -2
1. Convert the following infix expression into postfix expression using stack. 1. Convert the following infix expression into postfix expression using stack.
K + L - M*N + (O^P) * W/U/V * T + Q K + L - M*N + (O^P) * W/U/V * T + Q
2. What do you understand by a stack? Describe Stack operations. 2. What do you understand by a stack? Describe Stack operations.
3. What are Queues? Explain how queues are processed using a simple example. 3. What are Queues? Explain how queues are processed using a simple example.

UNIT -3 UNIT -3
1. What are Binary Trees? Explain the types of Binary Trees with example. 1. What are Binary Trees? Explain the types of Binary Trees with example.
2. What is AVL Tree? Explain RR and LL rotation with an example. 2. What is AVL Tree? Explain RR and LL rotation with an example.
3. What is a Binary Search Tree? Explain with an example. 3. What is a Binary Search Tree? Explain with an example.

UNIT -4 UNIT -4
1. What is Graph? Explain its types. 1. What is Graph? Explain its types.
2. Explain working of Kruskal’s algorithm with example . 2. Explain working of Kruskal’s algorithm with example .
3. Describe depth first search with example. 3. Describe depth first search with example.

UNIT -5 UNIT -5
1. Describe sequential sort. 1. Describe sequential sort.
2. Define Binary Search. Explain how Binary search works with suitable example. 2. Define Binary Search. Explain how Binary search works with suitable example.
3. Describe the concept of hashing. 3. Describe the concept of hashing.

You might also like