HSC CS Important Questions for the data structure. These questions are very important for Chapter 2 in part 1 Maharashtra Board Computer Science.
The total weightage of this chapter is 17 marks.
Explain the binary search algorithm with a suitable example
What is Binary Tree? Draw the Tree diagram for the expression. B = (3R -5T)2 – (R + Q3)
Write two features of each data structure a) Record b) linked array c) linked list d) pointer array
Explain the memory representation of the linked list with an example
What is an array? write an algorithm for traversing the linear array
What is data structure? Explain linear data structure and non-linear data structure
Define the following terms a) Group item b) elementary item c) entity d) root e) leaf f) sibling g) depth f)array g)pointer array h)tree i) binary tree j)extended binary
what is a binary tree? suitable examples show the relationship between the total number of nodes and the depth of the binary tree
what is recorded? explain how records are represented in memory using an array
Explain with a flow chart a) Iteration logic b) selection logic c) sequence logic
Explain two features of the bubble sort algorithm
Difference between linear search and binary search
state algorithm for inserting an element in the array
explain with a suitable example how the tree can be represented in memory
write an algorithm to find the smallest element in an array
In the data structure, most questions on memory representation and binary search algorithms are asked.
I hope you like my work please share with your friends with the options given below and If you have a problem comment below
