Scribd
Upload
9 views2 pages

Data Structures: Concepts and Comparisons

This document is a tutorial for a Data Structure course at the Institute of Technology and Management, containing a series of questions and topics for students to explore. Key topics include definitions and types of data structures, comparisons between arrays and linked lists, complexities of algorithms, and specific algorithms for data manipulation. Additionally, it covers concepts such as time-space trade-offs, asymptotic notation, and polynomial addition using linked lists.

Uploaded by

Anamta Khan
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

Data Structures: Concepts and Comparisons

This document is a tutorial for a Data Structure course at the Institute of Technology and Management, containing a series of questions and topics for students to explore. Key topics include definitions and types of data structures, comparisons between arrays and linked lists, complexities of algorithms, and specific algorithms for data manipulation. Additionally, it covers concepts such as time-space trade-offs, asymptotic notation, and polynomial addition using linked lists.

Uploaded by

Anamta Khan
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

ITM

Institute of Technology and Management


(341)
Department of Computer Science & Engineering

Tutorial-1
DATA STRUCTURE

Attempt all questions

1) What is Data Structure. Describe it’s need and types.


2) Difference between Array and Linked list .
3) What is the relation between the time and space
complexities of an algorithm?
4) Write an algorithm to insert a node at the end in a circular
linked list .
5) Explain best,worst and average case analysis
6) Define Time -Space trade -off.
7) Define Circular linked list.
8) What is asymptotic Notation ? What are the three types of
asymptotic notation with graph? Explain.
9) Define a sparse matrix .
10) Define Time complexity and Space Complexity.
11) Difference Linear and non linear data structure.
12) What are the built in data types in C?
13) Define abstraction.
14) Why we use linked list?
15) Write the Advantages of linked lists.
16) Given an array arr[1............10][1...........15] with a base value of
100 and the size of each elements is 1 byte in memory find the
address of arr[8][6] with the help of column major order.
17) Difference between Primitive and non primitive data structure.
18) Difference between Single linked list and Doubly linked list.
19) What is asymptotic Notation ? What are the three types of
asymptotic notation with graph? Explain.
20) Add these polynomial using a linked list
P(X)=15X10+3X5+10
Q(X)=10X8+16X5+5X2
21) Explain Row major order and column major order in detail with
explanation formula expression.
ITM
Institute of Technology and Management
(341)
Department of Computer Science & Engineering

22) What is an abstract data types


23) Define Array with its types
24) Drawback of linked list

You might also like