Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

Cs 2nd Year, 1st Sem > Chapter 1 > Flashcards

Chapter 1 Flashcards

1
Q

are values or set of values.

A

Data

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

refers to single unit of values.

A

Data Item

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Data items that are divided into sub items are called as

A

Group Items

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Data items that cannot be divided are called as

A

Elementary Items

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

An entity is that which contains certain attributes or properties, which may be assigned values.

A

Attribute and Entity

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Entities of similar attributes form an entity set.

A

Entity Set

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

is a single elementary unit of information representing an attribute of an entity.

A

Field

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

is a collection of field values of a given entity.

A

Record

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

is a collection of records of the entities in a given entity set.

A

File

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Algorithm should be clear and unambiguous. Each of its steps (or phases), and their inputs/outputs should be clear and must lead to only one meaning.

A

Unambiguous

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

An algorithm should have 0 or more well-defined inputs.

A

Input

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

An algorithm should have 1 or more well-defined outputs, and should match the desired output.

A

Output

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Algorithms must terminate after a finite number of steps.

A

Finiteness

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Should be feasible with the available resources.

A

Feasibility

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

An algorithm should have step-by-step directions, which should be independent of any programming code.

A

Independent

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

the programmatic way of storing data so that data can be used efficiently.

A

Data Structures

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

a computer procedure that is a lot like a recipe (called a procedure) and tells your computer precisely what steps to take to solve a problem or reach a goal.

A

Algorithm

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

are called inputs

A

The ingredients

19
Q

are called the outputs.

A

the results

20
Q

is a kind of data structure that stores the data of only one type.

A

Primitive data structure

21
Q

is a type of data structure that can store the data of more than one type.

A

Non-primitive data structure

22
Q

is a step-by-step procedure, which defines a set of instructions to be executed in a certain order to get the desired output.

A

Algorithm

23
Q

is all about data structures and algorithms.

A

Programming

24
Q

are used to hold data

A

Data structures

25
Q

are used to solve the problem using that data.

A

Algorithms

26
Q

goes through solutions to standard problems in detail and gives you an insight into how efficient it is to use each one of them.

A

Data structures and algorithms (DSA)

27
Q

is a way to classify various types of data such as integer, string, etc.

A

Data Type

28
Q

Those data types for which a language has built-in support are known as

A

Built-in Data types

29
Q

Those data types which are implementation independent as they can be implemented in one or the other way are known as

A

derived data types

30
Q

is a systematic way to organize data in order to use it efficiently.

A

Data Structure

31
Q

provides the internal representation of a data structure

A

Implementation

32
Q

Data structure implementation should implement its interface correctly.

A

Correctness

33
Q

Running time or the execution time of operations of data structure must be as small as possible.

A

Time Complexity

34
Q

Memory usage of a data structure operation should be as little as possible.

A

Space Complexity

35
Q

This step involves breaking the problem into smaller sub-problems.

A

Divide/Break

36
Q

This step receives a lot of smaller sub-problems to be solved.

A

Conquer/Solve

37
Q

When the smaller sub-problems are solved, this stage recursively combines them until they formulate a solution of the original problem.

A

Merge/Combine

38
Q

are linear data structures that follow a particular order to add or remove entities.

A

Stacksandqueues

39
Q

is an Abstract Data Type (ADT)

A

stack

40
Q

Pushing (storing) an element on the stack.

A

push()

41
Q

Removing (accessing) an element from the stack. When data is PUSHed onto stack.

A

pop()

42
Q

get the top data element of the stack, without removing it.

A

peek()

43
Q

check if stack is full.

A

IsFull()

44
Q

check if stack is empty.

A

isEmpty()

Cs 2nd Year, 1st Sem (8 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions