# Untitled 1

a queue

A tree is a multilevel data structure that represents a hierarchical relationship between

finite set of individual elements called nodes.

Ear A graph is a non-linear data structure that consists of set of nodes (or vertices) and set

of edges (or arcs), which each edge going from one node to another. Each edge in the

graph depicts a relationship between pair of nodes.

ar Traversing, searching, insertion, deletion, sorting, merging, copying, concatenation are

Ear An algorithm is a sequence of steps or instructions required to solve a given problem.

key operaitons performed on a data structure.

The analysis of algorithm based on how much memory an algorithm needs to solve a

particular problem is called the space complexity of an algorithm.

ar Measure of time complexity of an algorithm where we disregard certain terms of a function

to express the efficiency of algorithm is called asymptotic complexity

For a given input, the efficiency of an algorithm is complexity is measured for average

case, best case and worst case.

QUESTION-ANSWERS

(PTU, May 2004)

Q 1. List various non-linear data structures.

Ans. Some of the non linear data structures are graphs, trees, multilinked structures like

sparse matrices etc

Q 2. What is the difference between data structure and data types?

(PTU, May 2004)

Ans. Difference between data structure and data types are as follow

Data Structure

Data structure is a logical or mathematical A data type is a term which refers to the

model of a particular organization of data. kind of data that variable may hold in a

e.g. STACK, QUEUE, LINK LIST etc.

Data Types

programming language

e.g. Integer, float, character etc.

Q 3. What are non-linear data structures? (PTU, Dec. 2006 ; May 2007, 2004)

What do you mean by non-linear data structure? Give examples.

Ans. The non-linear data structure are those which are capable of expressing more

OR

(PTU, May 2011 ; Dec. 2008)

complex relationships than that of physical adjacency. Examples of these data structures are

trees, graphs, etc.

[5:29 AM, 11/24/2017] +91 94655 53697: FIFO behaviour. Enqueue and dequeue are two basic operations that can be applied on

a queue

A tree is a multilevel data structure that represents a hierarchical relationship between

finite set of individual elements called nodes.

Ear A graph is a non-linear data structure that consists of set of nodes (or vertices) and set

of edges (or arcs), which each edge going from one node to another. Each edge in the

graph depicts a relationship between pair of nodes.

ar Traversing, searching, insertion, deletion, sorting, merging, copying, concatenation are

Ear An algorithm is a sequence of steps or instructions required to solve a given problem.

key operaitons performed on a data structure.

The analysis of algorithm based on how much memory an algorithm needs to solve a

particular problem is called the space complexity of an algorithm.

ar Measure of time complexity of an algorithm where we disregard certain terms of a function

to express the efficiency of algorithm is called asymptotic complexity

For a given input, the efficiency of an algorithm is complexity is measured for average

case, best case and worst case.

QUESTION-ANSWERS

(PTU, May 2004)

Q 1. List various non-linear data structures.

Ans. Some of the non linear data structures are graphs, trees, multilinked structures like

sparse matrices etc

Q 2. What is the difference between data structure and data types?

(PTU, May 2004)

Ans. Difference between data structure and data types are as follow

Data Structure

Data structure is a logical or mathematical A data type is a term which refers to the

model of a particular organization of data. kind of data that variable may hold in a

e.g. STACK, QUEUE, LINK LIST etc.

Data Types

programming language

e.g. Integer, float, character etc.

Q 3. What are non-linear data structures? (PTU, Dec. 2006 ; May 2007, 2004)

What do you mean by non-linear data structure? Give examples.

Ans. The non-linear data structure are those which are capable of expressing more

OR

(PTU, May 2011 ; Dec. 2008)

complex relationships than that of physical adjacency. Examples of these data structures are

trees, graphs, etc.

[5:29 AM, 11/24/2017] +91 94655 53697: FIFO behaviour. Enqueue and dequeue are two basic operations that can be applied on

a queue

A tree is a multilevel data structure that represents a hierarchical relationship between

finite set of individual elements called nodes.

Ear A graph is a non-linear data structure that consists of set of nodes (or vertices) and set

of edges (or arcs), which each edge going from one node to another. Each edge in the

graph depicts a relationship between pair of nodes.

ar Traversing, searching, insertion, deletion, sorting, merging, copying, concatenation are

Ear An algorithm is a sequence of steps or instructions required to solve a given problem.

key operaitons performed on a data structure.

The analysis of algorithm based on how much memory an algorithm needs to solve a

particular problem is called the space complexity of an algorithm.

ar Measure of time complexity of an algorithm where we disregard certain terms of a function

to express the efficiency of algorithm is called asymptotic complexity

For a given input, the efficiency of an algorithm is complexity is measured for average

case, best case and worst case.

QUESTION-ANSWERS

(PTU, May 2004)

Q 1. List various non-linear data structures.

Ans. Some of the non linear data structures are graphs, trees, multilinked structures like

sparse matrices etc

Q 2. What is the difference between data structure and data types?

(PTU, May 2004)

Ans. Difference between data structure and data types are as follow

Data Structure

Data structure is a logical or mathematical A data type is a term which refers to the

model of a particular organization of data. kind of data that variable may hold in a

e.g. STACK, QUEUE, LINK LIST etc.

Data Types

programming language

e.g. Integer, float, character etc.

Q 3. What are non-linear data structures? (PTU, Dec. 2006 ; May 2007, 2004)

What do you mean by non-linear data structure? Give examples.

Ans. The non-linear data structure are those which are capable of expressing more

OR

(PTU, May 2011 ; Dec. 2008)

complex relationships than that of physical adjacency. Examples of these data structures are

trees, graphs, etc.

[5:29 AM, 11/24/2017] +91 94655 53697: FIFO behaviour. Enqueue and dequeue are two basic operations that can be applied on

a queue

A tree is a multilevel data structure that represents a hierarchical relationship between

finite set of individual elements called nodes.

Ear A graph is a non-linear data structure that consists of set of nodes (or vertices) and set

of edges (or arcs), which each edge going from one node to another. Each edge in the

graph depicts a relationship between pair of nodes.

ar Traversing, searching, insertion, deletion, sorting, merging, copying, concatenation are

Ear An algorithm is a sequence of steps or instructions required to solve a given problem.

key operaitons performed on a data structure.

The analysis of algorithm based on how much memory an algorithm needs to solve a

particular problem is called the space complexity of an algorithm.

ar Measure of time complexity of an algorithm where we disregard certain terms of a function

to express the efficiency of algorithm is called asymptotic complexity

For a given input, the efficiency of an algorithm is complexity is measured for average

case, best case and worst case.

QUESTION-ANSWERS

(PTU, May 2004)

Q 1. List various non-linear data structures.

Ans. Some of the non linear data structures are graphs, trees, multilinked structures like

sparse matrices etc

Q 2. What is the difference between data structure and data types?

(PTU, May 2004)

Ans. Difference between data structure and data types are as follow

Data Structure

Data structure is a logical or mathematical A data type is a term which refers to the

model of a particular organization of data. kind of data that variable may hold in a

e.g. STACK, QUEUE, LINK LIST etc.

Data Types

programming language

e.g. Integer, float, character etc.

Q 3. What are non-linear data structures? (PTU, Dec. 2006 ; May 2007, 2004)

What do you mean by non-linear data structure? Give examples.

Ans. The non-linear data structure are those which are capable of expressing more

OR

(PTU, May 2011 ; Dec. 2008)

complex relationships than that of physical adjacency. Examples of these data structures are

trees, graphs, etc.

[5:29 AM, 11/24/2017] +91 94655 53697: FIFO behaviour. Enqueue and dequeue are two basic operations that can be applied on

a queue

A tree is a multilevel data structure that represents a hierarchical relationship between

finite set of individual elements called nodes.

Ear A graph is a non-linear data structure that consists of set of nodes (or vertices) and set

of edges (or arcs), which each edge going from one node to another. Each edge in the

graph depicts a relationship between pair of nodes.

ar Traversing, searching, insertion, deletion, sorting, merging, copying, concatenation are

Ear An algorithm is a sequence of steps or instructions required to solve a given problem.

key operaitons performed on a data structure.

The analysis of algorithm based on how much memory an algorithm needs to solve a

particular problem is called the space complexity of an algorithm.

ar Measure of time complexity of an algorithm where we disregard certain terms of a function

to express the efficiency of algorithm is called asymptotic complexity

For a given input, the efficiency of an algorithm is complexity is measured for average

case, best case and worst case.

QUESTION-ANSWERS

(PTU, May 2004)

Q 1. List various non-linear data structures.

Ans. Some of the non linear data structures are graphs, trees, multilinked structures like

sparse matrices etc

Q 2. What is the difference between data structure and data types?

(PTU, May 2004)

Ans. Difference between data structure and data types are as follow

Data Structure

Data structure is a logical or mathematical A data type is a term which refers to the

model of a particular organization of data. kind of data that variable may hold in a

e.g. STACK, QUEUE, LINK LIST etc.

Data Types

programming language

e.g. Integer, float, character etc.

Q 3. What are non-linear data structures? (PTU, Dec. 2006 ; May 2007, 2004)

What do you mean by non-linear data structure? Give examples.

Ans. The non-linear data structure are those which are capable of expressing more

OR

(PTU, May 2011 ; Dec. 2008)

complex relationships than that of physical adjacency. Examples of these data structures are

trees, graphs, etc.

[5:29 AM, 11/24/2017] +91 94655 53697: FIFO behaviour. Enqueue and dequeue are two basic operations that can be applied on

a queue

A tree is a multilevel data structure that represents a hierarchical relationship between

finite set of individual elements called nodes.

Ear A graph is a non-linear data structure that consists of set of nodes (or vertices) and set

of edges (or arcs), which each edge going from one node to another. Each edge in the

graph depicts a relationship between pair of nodes.

ar Traversing, searching, insertion, deletion, sorting, merging, copying, concatenation are

Ear An algorithm is a sequence of steps or instructions required to solve a given problem.

key operaitons performed on a data structure.

The analysis of algorithm based on how much memory an algorithm needs to solve a

particular problem is called the space complexity of an algorithm.

ar Measure of time complexity of an algorithm where we disregard certain terms of a function

to express the efficiency of algorithm is called asymptotic complexity

For a given input, the efficiency of an algorithm is complexity is measured for average

case, best case and worst case.

QUESTION-ANSWERS

(PTU, May 2004)

Q 1. List various non-linear data structures.

Ans. Some of the non linear data structures are graphs, trees, multilinked structures like

sparse matrices etc

Q 2. What is the difference between data structure and data types?

(PTU, May 2004)

Ans. Difference between data structure and data types are as follow

Data Structure

Data structure is a logical or mathematical A data type is a term which refers to the

model of a particular organization of data. kind of data that variable may hold in a

e.g. STACK, QUEUE, LINK LIST etc.

Data Types

programming language

e.g. Integer, float, character etc.

Q 3. What are non-linear data structures? (PTU, Dec. 2006 ; May 2007, 2004)

What do you mean by non-linear data structure? Give examples.

Ans. The non-linear data structure are those which are capable of expressing more

OR

(PTU, May 2011 ; Dec. 2008)

complex relationships than that of physical adjacency. Examples of these data structures are

trees, graphs, etc.

[5:29 AM, 11/24/2017] +91 94655 53697: FIFO behaviour. Enqueue and dequeue are two basic operations that can be applied on

a queue

A tree is a multilevel data structure that represents a hierarchical relationship between

finite set of individual elements called nodes.

Ear A graph is a non-linear data structure that consists of set of nodes (or vertices) and set

of edges (or arcs), which each edge going from one node to another. Each edge in the

graph depicts a relationship between pair of nodes.

ar Traversing, searching, insertion, deletion, sorting, merging, copying, concatenation are

Ear An algorithm is a sequence of steps or instructions required to solve a given problem.

key operaitons performed on a data structure.

The analysis of algorithm based on how much memory an algorithm needs to solve a

particular problem is called the space complexity of an algorithm.

ar Measure of time complexity of an algorithm where we disregard certain terms of a function

to express the efficiency of algorithm is called asymptotic complexity

For a given input, the efficiency of an algorithm is complexity is measured for average

case, best case and worst case.

QUESTION-ANSWERS

(PTU, May 2004)

Q 1. List various non-linear data structures.

Ans. Some of the non linear data structures are graphs, trees, multilinked structures like

sparse matrices etc

Q 2. What is the difference between data structure and data types?

(PTU, May 2004)

Ans. Difference between data structure and data types are as follow

Data Structure

Data structure is a logical or mathematical A data type is a term which refers to the

model of a particular organization of data. kind of data that variable may hold in a

e.g. STACK, QUEUE, LINK LIST etc.

Data Types

programming language

e.g. Integer, float, character etc.

Q 3. What are non-linear data structures? (PTU, Dec. 2006 ; May 2007, 2004)

What do you mean by non-linear data structure? Give examples.

Ans. The non-linear data structure are those which are capable of expressing more

OR

(PTU, May 2011 ; Dec. 2008)

complex relationships than that of physical adjacency. Examples of these data structures are

trees, graphs, etc.

[5:29 AM, 11/24/2017] +91 94655 53697: FIFO behaviour. Enqueue and dequeue are two basic operations that can be applied on

a queue

A tree is a multilevel data structure that represents a hierarchical relationship between

finite set of individual elements called nodes.

Ear A graph is a non-linear data structure that consists of set of nodes (or vertices) and set

of edges (or arcs), which each edge going from one node to another. Each edge in the

graph depicts a relationship between pair of nodes.

ar Traversing, searching, insertion, deletion, sorting, merging, copying, concatenation are

Ear An algorithm is a sequence of steps or instructions required to solve a given problem.

key operaitons performed on a data structure.

The analysis of algorithm based on how much memory an algorithm needs to solve a

particular problem is called the space complexity of an algorithm.

ar Measure of time complexity of an algorithm where we disregard certain terms of a function

to express the efficiency of algorithm is called asymptotic complexity

For a given input, the efficiency of an algorithm is complexity is measured for average

case, best case and worst case.

QUESTION-ANSWERS

(PTU, May 2004)

Q 1. List various non-linear data structures.

Ans. Some of the non linear data structures are graphs, trees, multilinked structures like

sparse matrices etc

Q 2. What is the difference between data structure and data types?

(PTU, May 2004)

Ans. Difference between data structure and data types are as follow

Data Structure

Data structure is a logical or mathematical A data type is a term which refers to the

model of a particular organization of data. kind of data that variable may hold in a

e.g. STACK, QUEUE, LINK LIST etc.

Data Types

programming language

e.g. Integer, float, character etc.

Q 3. What are non-linear data structures? (PTU, Dec. 2006 ; May 2007, 2004)

What do you mean by non-linear data structure? Give examples.

Ans. The non-linear data structure are those which are capable of expressing more

OR

(PTU, May 2011 ; Dec. 2008)

complex relationships than that of physical adjacency. Examples of these data structures are

trees, graphs, etc.