Explain the concept of recursion and write a recursive C program to calculate factorial of a number.
10 2 + 8 4 / * 6 3 -/
Convert the following expression to postfix using stack. Show each step clearly ((A-B)+D/((E+F)*G))
Explain the properties of binary tree and differentiate between complete binary tree, full binary tree and balanced binary tree
Insert the following nodes into an empty BST in this order: 50, 30, 70, 20, 40, 60,
What is a binary search tree? write an algorithm to search an element in BST and show it’s time complexity
If the depth of the binary tree is k, the maximum number of nodes in the binary tree is 2k -1. Justify. Also mention atleast how many nodes a tree should have given it’s depth as k.
Compare the below different hashing methods and discuss about each method in a detailed Manner.
Insert the following keys into a hash table of size 10 using linear probing: 12, 26, 31, 92, 45, 78 Show the steps and the final hash table
Circulate this solved paper with KaTeX formulas and 1-click AI step solvers to your batchmates on WhatsApp or Telegram.
Official Gujarat Technological University (GTU) examination paper and step-by-step solutions for Data Structures (DS) (Winter 2025, B.E. · Computer Engineering, Sem 3). Features complete 70-mark regular & remedial examination pattern, official marking distribution across all 5 questions, and direct 1-click official PDF download.
Transcribed for student exam preparation from Gujarat Technological University official examination archives. Questions, syllabus guidelines, and curriculum marking schemes remain the intellectual property of Gujarat Technological University.