On this page, you will find all the most important and most asked questions from unit 1 of the data structure subject.
Topic : Intro to DST (Key Note and Questions)
Key Note:
- Data Structure is a way to organize data so that we can perform any operation on it efficiently.
- Data type describes which type of value a variable can store. Means if a variable is of int data type it means that, that particular variable can store only integer data.
- Built-in data type is also known as predefined data type which can be directly used by any programmer to a variable types and assign value in it.
- Some example of built-in data type are int, char, float, double, short, long etc.
Questions
- What do you mean by data structure? Describe about its need and types.
- Explain primitive and non-primitive data structure.
- What is data type? Write the all built in data type of C.
Topic : Algorithm (Key Note and Questions)
Key Note:
- Algorithm can be defined as a step by step approach to solve a problem in finite steps and time. It is a human-readable solution.
- Efficiency of an Algorithm shows the quality of algorithm. Here the parameter for quality is algorithm should take less time and space to solve any problem.
- Time complexity shows time taken by an algorithm to solve a problem.
- Space complexity show space/memory taken by an algorithm to solve a problem.
Questions
- What do you mean by algorithm? Write the criteria of an algorithm and its characteristics.
- What do you mean by efficiency of an Algorithm?
- What do you mean by complexity. Explain space and time complexity.
- How you can find the complexity of an algorithm? What is the relation between the time and space complexities of an algorithm ? Justify your answer with an example.
Topic : Asymptotic (Key Note and Questions)
Key Note:
- Asymptotic notation helps to measure the complexity of an algorithm. It is of 5 types Big-Oh, Omega, Theta, Little Oh and Little Omega.
- An Abstract datatype is a datatype, whose behavior is defined by a set of values and set of operations. for example stack and queue is a perfect example of ADT.
Questions
- What do you mean by Asymptotic notations? Write a note on Big Oh, Big Theta and Big Omega.
- Explain the abstract data type.
What did you think?
Similar Reads
-
Multiplications of Two variable polynomial
Polynomial multiplication is a common operation in algebra, used in areas such as scientific computing, engineering simulations, and symbolic algebra… -
Subtraction of Two-Variable Polynomial in C
Polynomials with two variables are common in engineering, graphics, and scientific computation. While addition is frequently discussed, subtraction is equally… -
Explain the Addition of Two variable polynomial
Polynomials are fundamental in mathematics, and their use extends into computer science, engineering, physics, and more. While single-variable polynomials are… -
Reverses the Doubly Circular Linked List
Algorithm to Reverse a Doubly Circular Linked List Check if the List is Empty or Has Only One Node: If… -
Algorithm and Program in C to traverse Doubly Circular Linked List
A doubly circular linked list is a special type of linked list in which every node is connected to both… -
Polynomial representation Using Array
Polynomials are fundamental mathematical expressions used extensively in various fields. Representing them efficiently in programming is crucial for calculations and… -
Multiplication of Single Variable Polynomial : Algorithm and Program
Multiplication of single-variable polynomials is a fundamental operation in polynomial algebra. The process involves multiplying each term of one polynomial… -
Subtraction of Single variable Polynomial : Algorithm and Program
Subtracting single-variable polynomials involves reducing each corresponding term of the polynomials from each other. This process is similar to addition,… -
Addition of Single variable Polynomial : Program and Algorithm
The addition of single-variable polynomials is a fundamental concept in algebra, often encountered in mathematics and computer science. Let's break… -
Polynomial Representation Using Linked List
Polynomial representation using linked lists is a critical concept in computer science and mathematics. In this guide, we explore how…