# A level Data Structures Quiz 1

#### Quiz Description

In this quiz, you will be tested on A-level data structure. Data structure is a topic that is seen in Computer science and throughout your stay here at gcequiz.com, we're are going to look at what data structure is all about and the different types of data structures that we're going to look at in the A Level Data structure quizzes.

To begin with, what is data structure? Data structure is the organization, storage and management of data, storing data in such a way that getting the data and modifying it is more efficient. Also, data structure has to do with collection of data values and also the study of the relationship between the data.

You can now go ahead and test your knowledge with the quizzes provided to you by this online revision platform. The quizzes are totally free of charge so you don't need to spend a dime answering the quizzes.

Good luck

A mathematical-model with a collection of operations defined on that model is called

Correct
• Data Structure
• Algorithm
• Primitive Data Type
• Abstract Data Type

Representation of data structure in memory is known as:

Correct
• Recursive
• Abstract data type
• Storage structure
• File structure

An ADT is defined to be a mathematical model of a user-defined type along with the collection of all ____________ operations on that model

Correct
• Cardinality
• Assignment
• Primitive
• Structured

The information about an array that is used in a program will be stored in

Correct
• symbol table
• activation record
• system table
• dope vector

Which of the following abstract data types can be used to represent a many to many relation?

Correct
• Tree
• Plex
• Graph
• Both (b) and (c)

An algorithm is made up of 2 modules M1&M2. If order of M1 is f(n) & M2 is g(n) then the order of algorithm is?

Correct
• max (f(n),g(n))
• min (f(n),g(n))
• f(n) + g(n)
• f(n) X g(n)

An array of n numbers is given, where n is an even number. The maximum as well as the minimum of these n numbers needs to be determined. Which of the following is TRUE about the number of comparisons needed?

Correct
• At least 2n-c comparisons, for some constant c, are needed.
• At most 1.5n-2 comparisons are needed.
• At least nlog2n comparisons are needed.
• None of the above.

The minimum number of comparisons required to determine if an integer appears more than n/2 times in a sorted array of n integers is

Correct
• Θ(n)
• Θ(logn)
• Θ(log*n)
• Θ(1)

The data structure required to evaluate a postfix expression is

Correct
• Queue
• Stack
• ray

The data structure required to check whether an expression contains balanced parenthesis is

Correct
• Stack
• Queue
• Tree
• Array

The postfix form of the expression
(A+B)∗(C∗D-E)∗F/G is

Correct
• AB+CD ∗ E−FG/∗∗
• AB+CD ∗ E−F∗∗G/
• AB+CD ∗ E−∗F∗G/
• AB+CDE∗ −∗F∗G/

What is the postfix form of the following prefix expression -A/B*C\$DE

Correct
• ABCDE\$*/-
• ABC\$ED*/-
• A-BCDE\$*/-
• A-BCDE\$*/

The postfix form of A*B+C/D is

Correct
• *AB/CD+
• AB*CD/+
• A*BC+/D
• ABCD+/ *

Which of the following types of expressions does not require precedence rule when evaluatuated?

Correct
• Full parenthesized infix expression
• Prefix expression
• Partially parenthesized infix expression
• More than one of these

Stack can't be used to

Correct
• Evaluate an arithmetic expression in postfix form
• Implement recursion
• Convert a given arithmetic expression in infix form to its evaluate postfix form
• Allocate resources(like CPU)by the operating system