(i) Radix sort: - Radix sort is a distributive sorting technique. This sorting technique basically used with string type data. Sorting is a comprised by considering groups with the same first bits and ordering that group to the last bit. The ordering of a group on a given bit is a comprised by scanning down … Continue reading Write short notes on

## What is stack in data structure? Different between stack and queue?

What is stack in data structure? Different between stack and queue? Answer: - Stack is one of the most essential linear data structure. Implementation of most the of system program are based on stack data structure. We can insert or delete an element from a list, which take place from one end. The insertion of … Continue reading What is stack in data structure? Different between stack and queue?

## Explain the properties of B-tree? Write the algorithm for insertion in a B-tree.

Explain the properties of B-tree? Write the algorithm for insertion in a B-tree. Answer: - Two Russian mathematician, G.M. ADEL’SON-VEL’SKII and E.M. LANDIS, give at technique in 1962. It feasible to balance the bit of binary tree using this technique and resulting tree is called AVL tree in there owner. With the help of AVL … Continue reading Explain the properties of B-tree? Write the algorithm for insertion in a B-tree.

## Write algorithm of selection sort, bubble sort and insertion sort.

Write algorithm of selection sort, bubble sort and insertion sort. Answer: - Selection sort: - A selection sort is a very simple and straight forward sorting technique. This sorting used by selection. After each pass, an element can be selected for sorting this process continued up to the last element and finally all elements are … Continue reading Write algorithm of selection sort, bubble sort and insertion sort.

## What is binary tree? Discuss the array representation of binary tree.

What is binary tree? Discuss the array representation of binary tree. Answer: - A binary search tree is a binary tree that is either empty or in which each node passes a Key that satisfied the fallowing condition. All Keys in the left sub tree of the root precede the key in the root. The … Continue reading What is binary tree? Discuss the array representation of binary tree.

## What do you mean by AutoCAD? Explain the feature of AutoCAD in details.

What do you mean by AutoCAD? Explain the feature of AutoCAD in details. Answer: - AutoCAD is a commercial software application for 2D and 3D computer-aided design (CAD) and drafting — available since 1982 as a desktop application and since 2010 as a mobile, web- and cloud-based app marketed as AutoCAD 360. Developed and marketed by Autodesk, AutoCAD was first released in December 1982, running on microcomputers with internal graphics. Prior to … Continue reading What do you mean by AutoCAD? Explain the feature of AutoCAD in details.

## What is algorithm? Discuss but care, average case and worst case analysis of algorithm?

What is algorithm? Discuss but care, average case and worst case analysis of algorithm? Answer: - Step by step procedure designed to perform an operation, and which (like a map or flowchart) will lead to the sought result if followed correctly. Algorithms have a definite beginning and a definite end, and a finite number of steps. An algorithm produces the same output information given the same input information, and several short algorithms can … Continue reading What is algorithm? Discuss but care, average case and worst case analysis of algorithm?

## Explain about quick sort with suitable example?

Explain about quick sort with suitable example? Answer: - Quick sort is a divide and conquer algorithm. Its divided large list in mainly three parts: Elements less than pivot element. Pivot element. Elements greater than pivot element. Where pivot as middle element of large list. Let’s understand through example: List: 3 7 8 5 2 1 … Continue reading Explain about quick sort with suitable example?

## Explain traversal binary tree inorder, preorder and postorder?

Explain traversal binary tree inorder, preorder and postorder? Answer: - In computer science, tree traversal (also known as tree search) is a form of graph traversal and refers to the process of visiting (checking and/or updating) each node in a tree data structure, exactly once. Such traversals are classified by the order in which the nodes are visited. The following algorithms are … Continue reading Explain traversal binary tree inorder, preorder and postorder?

## Define binary search? How can be it stored in computer’s memory as an array? Give suitable example.

Define binary search? How can be it stored in computer’s memory as an array? Give suitable example. Answer: - C program for binary search: This code implements binary search in c language. It can only be used for sorted arrays, but it's fast as compared to linear search. If you wish to use binary search … Continue reading Define binary search? How can be it stored in computer’s memory as an array? Give suitable example.