Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

Data Structure and Algorithms, Cheat Sheet of Computer Science

Good for Data Structure and Algorithms

Typology: Cheat Sheet

2023/2024

Uploaded on 09/01/2024

dark-sin
dark-sin 🇮🇳

1 document

1 / 2

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
pf2

Partial preview of the text

Download Data Structure and Algorithms and more Cheat Sheet Computer Science in PDF only on Docsity!

ae | ee Si lico n - aa Institute of Technology Hotel No ior oe sy Pages:-_02 rehipg Silicon Hills, Bhubaneswar | An Autonomous Institute | 2nd Semester B.Tech End Term Back Examination 2022-23 DATA STRUCTURES AND ALGORITHMS (BTCS-T-ES-003) BRANCK(S) - Computer Engineering,Electronics & Communication Engineering,Computer Science and Technology,Computer Science & Engineering,Electrical & Electronics Engineering,Electronics and Instrumentation Engineering Duration: 03:00 Full Marks: 60 1 Answer All 4 How many rows and columns will be there in the triplet representation of the following 1 sparse matrix? 00304 Which of the following is not a linear data structure? 1 A. stack B. tree C. array D. linked list © Which of the principle is followed by stack? 1 1. FIFO 2.LIFO 3.LILO 4. Random Access 4 What is the difference between stack and queue data structures? 1 © Differentiate between single and double-linked lists. 1 f Mention at least two applications of linked list. 1 8 Acomplete binary tree has m nodes at level L. How many nodes are present at level L+3? I What do you mean by complete binary tree? Give an example. 1 Fill in the blank. 1 Using the division method, in a given hash table of size 157, the key of value 172 will be placed at position ---------------- J How to choose the pivot element in Quick sort? 1 2 Answer All 2 What is a sparse matrix’? How do you efficiently represent a sparse matrix? Explain with 3 suitable examples. © Write short notes on dequeue. we © Write a'C' function to insert a new node at the end of a single linked list. [P.T.0] ue