किसानों के अध्ययन के दृष्टिकोणों पर विचार-विमर्श करें।
See Answer →स्वतंत्रता-पूर्व भारत में जनजातीय प्रशासन का विवरण दें।
See Answer →
जनजातियों और किसानों की अवधारणा पर चर्चा करें। जनजाति की विशेषताओं को परिभाषित करें।
See Answer →
What is Red-Black tree? Explain insertion and deletion operations in a Red-Black tree with the help of a suitable example.
See Answer →What is hashing? Explain the hash functions. Also, discuss the collision resolution methods in hashing.
See Answer →Write a program in 'C' language to perform binary search algorithm.
See Answer →What is a heap tree? Create a min heap tree for the following list of items inserted in the order. Also, explain the heap sort with the help of thus created heap tree.
10, 20, 5, 25, 30, 18, 3, 70, 55, 45, 12, 24
See Answer →Apply Insertion and Bubble sorting algorithms to sort the following list of items. Show, all the intermediate steps. Also, analyze the number of swap and comparison operations performed in both the methods.
5, 20, 10, 12, 30, 35, 40, 50, 45, 55, 7, 8, 2
See Answer →. What is minimum spanning tree (MST)? Apply Kruskal’s algorithm to find the MST for the following graph.
Apply Dijkstra’s algorithm to find the shortest path from the vertex ‘S’ to all other vertices for the following graph:
Define a B-tree and its properties. Create a B-tree of order-4, if the data items are inserted into an empty B-tree in the following sequence:
10, 2, 15, 25, 60, 45, 35, 80, 20, 8, 4, 55, 50, 68, 62, 40
Further, delete the items 2, 4, 8, and 10 from the B-tree.
See Answer →Define AVL tree. Create an AVL tree for the following list of data if the data are inserted in the order in an empty AVL tree.
2, 12, 15, 4, 30, 10, 1, 35, 18, 25, 28, 50, 42, 6, 8
Further delete 1, 4, 8 and 10 from the above AVL tree.
See Answer →Write a program in 'C' to implement a binary search tree (BST). Traverse and display the binary search tree in the Inorder, Preorder and Post order form.
See Answer →Draw the binary tree for which the traversal sequences are given as follows:
(i) Post order: DHKECFMNLGBA
In order: DCHEKAFBMLNG
(ii) Pre order: ABCDEFGHJK
In order: B-D-C-E-A-G-H-K-F
See Answer →Use the appropriate data structures and write a program in C to evaluate the following expressions:
Prefix expression: +, -, , 3, 2, 7, 8, 4, 1
Postfix expression: 10, 5, +, 60, 6, /, , 8, -
See Answer →Write a program in 'C' to input two matrices and perform the following operations on them.
(i) Multiply both the matrices and display the resultant matrix.
(ii) Find the sum of main diagonal elements of the resultant matrix, computed in (i)
(iii) Find the inverse of the matrix obtained after multiplication in (i)
See Answer →