Scroll down for Match your  questions with Sample

Note- Students need to make Changes before uploading for Avoid similarity issue in turnitin.

Another Option


0-30% Similarity in turnitin

Price is 700 per assignment

Unique assignment buy via WhatsApp   8755555879

Quick Checkout
Categories: , , Tag:


course CODE & NAME DCA1202 – Data Structure and Algorithm




  1. What are the characteristics and Building Blocks of an Algorithm? And what are Control Mechanism and Control structures?


Characteristics of an Algorithm

An algorithm is a step-by-step procedure or formula for solving a problem.


The key characteristics of an algorithm include: 


Finiteness: An algorithm must always terminate after a finite number of steps. This ensures that the algorithm will

Its Half solved only

Buy Complete from our online store




MUJ Fully solved assignment available for session FEB/MARCH 2024.


Lowest price guarantee with quality.

Charges INR 198 only per assignment. For more information you can get via mail or Whats app also

Mail id is aapkieducation@gmail.com


Our website www.smuassignment.in

After mail, we will reply you instant or maximum

1 hour.

Otherwise you can also contact on our

whatsapp no 8791490301.



  1. A. What are Binary trees? How many types of Binary trees are there, discuss?


Definition: A binary tree is a special case of tree where no node of a tree can have a degree of more than two. Therefore, a binary tree is a set of zero or more nodes T such that:

  1. i) There is a specially designated node called the root of the tree
  2. ii) The remaining nodes are partitioned into two disjointed sets, T1 and T2, each of which is a binary tree. T1



  1. Discuss the linked storage representation of binary tree.

Ans: Linked storage representation of binary tree The most popular way to present a binary tree is Linked storage representation. Binary tree consists of nodes which can have at most two child, linked representation of such tree will be stored in the form shown Fig, where LPTR and RPTR denote the address


  1. Explain the algorithms of Bubble sort and Merge sort.


Bubble sort Bubble sort is a straightforward and simplistic method of sorting data that is used very commonly. The algorithm starts at the beginning of the data set. It compares the first two elements, and if the first is greater than the second, then it swaps them. It continues doing this for each







  1. A. What is dynamic memory storage and how is link list stored in memory? Write the algorithm for traversal of a singly link list.

Ans: Dynamic representation

The efficient way of representing a linked list is using the free pool of storage. In this method, there is a memory bank (which is nothing but a collection of free memory spaces) and a memory



  1. What are the different types of link list? Write an algorithm to create circular list.


Types of Linked Lists:-



  1. Write the Algorithm to find the maximum and minimum items in a set of n element. Also explain the working of the algorithm.
  2. Ans: Write down an array of one element. Figure out how you would find the maximum and minimum of that array.
  3. Write down an array of two elements. Use the algorithm you created to solve step (1) to find the minimum and maximum of the sub-array consisting of the first element. See how the second element changes your answer.
  4. Write down an




  1. A. What is Stack? Discuss the Array implementation of a stack along with push () and pop () algorithms.



A stack is a data structures in which insertion and deletion of items are made at the one end, called the top of the stack.


We have two basic operations in stack they are push and pop.

Push Operation: Push is used to insert an item into a stack.

Pop Operation:



  1. What is Queue? Discuss the Array implementation of a queue along with enqueue () and Dequeue () algorithms.



A queue is a linear list of elements in which deletions can take place only at one end, called the front and insertions can take place only at the other end, called the rear as referred in the figure. The terms “front” and “rear” are used in describing a linear list only when it is implemented as a q