N Nexsus

Data Structure & Algorithms — Minor 1 2026 question paper

MMMUT Electronics and Communication Engineering previous year question paper for Data Structure & Algorithms (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 & Algorithms (BCS 205)
  • Branch: Electronics and Communication Engineering
  • Semester: 3
  • Exam: Minor 1 2026
  • Questions: 8

Questions asked in Data Structure & Algorithms Minor 1 2026

  1. Q1(a). Explain the data structure and type. List the different operations performed on data structure. [3 marks]
  2. Q1(b). Define an algorithm. List out and discuss the sequence of steps needed to design and analyze an algorithm in not more than four sentences each. [2 marks]
  3. Q1(c). Inspect, why do we need an Asymptotic notation. Explain the different Asymptotic notations with definition and example. [2 marks]
  4. 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]
  5. Q2(b). Explain Stack Data Structure and operations of stack with an example. [2 marks]
  6. Q2(c). Define array. how to declare and initialize an array. Write a program to find duplicate element in an array. [2 marks]
  7. QQ1.. Attempt any Two parts of the following. Q. 1(a) is compulsory. (Units-I)
  8. QQ2.. Attempt any Two parts of the following. Q. 2(a) is compulsory. (Units-II)