Prelim

Question 1

is a way to store data

Answer 1

data structure

Question 2

give us the possibility to manage large amounts of data efficiently for uses such as large databases and internet indexing services

Answer 2

Data structures

Question 3

are essential ingredients in creating fast and powerful algorithms. They help in managing and organizing data, reduce complexity, and increase efficiency

Answer 3

Data structures

Question 4

are basic data structures provided by programming languages to represent single values, such as integers, floating-point numbers, characters, and booleans.

Answer 4

Primitive Data Structures

Question 4

In Computer Science there are two different kinds of data structures.

Answer 4

1. Primitive Data Structures
2. Abstract Data Structures

Question 5

is a set of step-by-step instructions to solve a given problem or achieve a specific goal.
(cooking recipe)

Answer 5

algorithm

Question 6

are higher-level data structures that are built using primitive data types and provide more complex and specialized operations.
Some common examples include arrays, linked lists, stacks, queues, trees, and graphs

Answer 6

Abstract Data Structures

Question 7

are fundamental to computer programming as they provide step-by-step instructions for executing tasks

Answer 7

Algorithms

Question 8

is about finding efficient ways to store and retrieve data, to perform operations on data, and to solve specific problems

Answer 8

Data structures and algorithms (DSA)

Question 9

are used in virtually every software system, from operating systems to web applications:
- for managing large amounts of data, such as in a social network or a search engine
- for scheduling tasks, to decide which task a computer should do first
- for planning routes, like in a GPS system to find the shortest path from A to B

Answer 9

Data structures and algorithms (DSA)

Question 10

are the data structures that are used to store multiple items.
They both support the indexing of elements to access them, slicing, and iterating over the elements

Answer 10

lists and arrays

Question 11

Accessing element is fast
they are in a contiguous manner but insertion and deletion is quite expensive because all the elements are shifted from the position of inserting and deleting element linearly.

Answer 11

Python Arrays

Question 12

is actually a dynamic array .
Inserting or deleting elements at the beginning or in the middle of a list can be less efficient because it may require shifting all subsequent elements, which is a linear-time operation in the worst case

Answer 12

List

Question 13

is an inbuilt collection of items that can contain elements of multiple data types, which may be either numeric, character logical values, etc.
It is an ordered collection supporting negative indexing.
can be easily merged and copied using Python’s inbuilt functions

Answer 13

Lists

Question 14

is a vector containing homogeneous elements i.e. belonging to the same data type

Answer 14

Array

Question 15

the size of an _____ is fixed. The insertion and deletion costs are high as compared to the list, however indexing is faster in the _____ due to contiguous memory allocation. _____ can be used by importing the array module

Answer 15

Array