MMMUT Electronics and Communication Engineering previous year question paper for DATA STRUCTURE (BCS 205), semester 3, Minor 1 2026. All 8 questions are listed below, each with a written answer on Nexsus.
Paper details
Subject: DATA STRUCTURE (BCS 205)
Branch: Electronics and Communication Engineering
Semester: 3
Exam: Minor 1 2026
Questions: 8
Questions asked in DATA STRUCTURE Minor 1 2026
Q1(a). Inspect, why do we need an Asymptotic notation. Analyse the Complexity of Fibonacci function F(n), which is defined such that F(1) = 1, F(2) = 2, and F(n) = F(n - 2) + F(n - 1) for n > 2. [3 marks]
Q1(b). Define an algorithm. Write an algorithm to find minimum and maximum element of an array also find the minimum no. of comparison required for it. [2 marks]
Q1(c). Explain the different types of data structures. Also discuss their merits and demerits. [2 marks]
Q2(a). Explain how an infix expression can be converted to a post fix expression with an example. Convert the following infix expression into postfix expression using stack. A+(B*C-(D/E^F)*G)*H [3 marks]
Q2(b). Explain Stack Data Structure. Write an algorithm for PUSH and POP operation of stack. [2 marks]
Q2(c). Define array. An array X [-15.....10, 15.....40] requires one byte of storage. If beginning location is 1500 determine the location of X [15][20] using RMO and CMO. [2 marks]
QQ1.. Attempt any Two parts of the following. Q. 1(a) is compulsory. (Units-I)
QQ2.. Attempt any Two parts of the following. Q. 2(a) is compulsory. (Units-II)