Scribd
Upload
9 views2 pages

Om DSAprepration

Uploaded by

Omkumar Yadav
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
9 views2 pages

Om DSAprepration

Uploaded by

Omkumar Yadav
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

UNIT 1

1. Define data structure. Also classify the data structure.


2. Write algorithm to add two polynomial equations.
3. Write a algorithm to insert a node at end in singly linked list.
4. Write a algorithm to inserting t a node at least into circular linked list.
5. Explain time and space complexity.
6. Compare Array and linked list.
7. Explain deletion operation from linked list with example.
8. Explain sparse matrix and their representation.
9. Describe big O notation used in algorithm.
10. A 2D array dymed as [1…….7] [1……5] required four bytes of storage space for each element if
the array is sorted in row major ferm then calculate the address of element located at[5,3]
where the base address is 400.
11. Given an array and a number ,find two integers that sum to the given number. Write an
algorithm for this.
12. Write a algorithm to insert a node at beginning ,middle and end in singly linked list.

UNIT 1 (PYQ)

1.What are the advantages of linked list over array? (4) [2022]

2.Given an array and a number, find two integer that sum to the given number. Write an
algorithm for this? (8) [2022]

3. what is time complexity? Explain the significance of big0, theta and omega notations.

4 an array VAL [ 1……15] [ 1……10] is stored in the memory with each element requiring 4
bytes of storage. If the base address of the array VAL is 1500, determine the location of VAL
[12] [9] when the array VAL is stored.

(i) Row wise


(ii) Column wise (8) [2022]
5.What are the various operations can be performed in data structure? (4) [2022 nov ]

6.What are asymptotic notations? Also explain Big O(h) notation, omega(h), theta(h) notaton. (4) [2022
nov]

7.What is meant by the term “Row-major-order and “column-major-order”? Consider a 2-D array A[20]
[50] which requires 4 byte of storage. Let the base address of data is 2000. Determine the location of
A[10][10] when the array is stored as :

(i) raw major order

(ii) coloumn-major order (8) [ 22 n]

8. What are the ways to insert a node into lined list


Write an algorithm for inserting a node at first position. (8) [ 22 N]

(b) Define header node in a circular linked list and design (8) [23A]

(c) Explain all types of asymptotic notations in brief. (8) [23 A ]

(d) define Two way linked lists and design an algorithm to find a LOC and insert a new item a linked array
(8) [23 A]

10.(a) Explain the efficiency of an algorithm in terms of

space and time complexity. 4 [23 n]

(b) write an algorithm to insert a new node at end

Of singly linked list 8 [23 n]

(c) given an array and the number find two integers

That some to the given number write an algorithm for

This. 8 [23 n ]

(d) explain sparse matrices and their representation. 8 [23 n ]

You might also like