CLICK HERE FOR VARIOUS NEW JOBS 
CLICK HERE FOR VARIOUS EDUCATIONAL NEWS 
CLICK HERE FOR NEW SCHOLARSHIPS 
CLICK HERE FOR ADMISSION NOTICES 
Click And Follow On Google+ To Get Updates
Please Wait 10 Seconds... OR You CanSkip

ADMISSION NOTICES
Scholarships

Scholarship-300x291

BUDGET 2014-15
budget_2014-2015
New Date Sheets
VU SOLVED ASSIGNMENTS
Recent Posts

Posts Tagged ‘Data Structures’

VU CS601 -, DATA COMMUNICATION, FINALTERM, solve,d unsolved, past papers, Spring 2009

VU CS601 -, DATA COMMUNICATION, FINALTERM, Solve,d Unsolved, Past Papers, Spring 2009

FINALTERM  EXAMINATION

Spring 2009

CS601- Data Communication

 

Question No: 1      ( Marks: 1 ) – Please choose one

 

 

There are how many factors on which the performance of a network depends?

 

► Three

 

       ► Five

 

       ► Four

 

       ► Two

 

 

 

Question No: 2      ( Marks: 1 ) – Please choose one

 

 

_________requires the maximum number of I/O ports.

 

       ► Bus

 

       ► Star

 

       ► Mesh

 

       ► Ring

 

 

 

Question No: 3      ( Marks: 1 ) – Please choose one

 

 

Headers are added at layers 1 and 7 of OSI model.

 

       ► True

 

► False

 

 

 

Question No: 4      ( Marks: 1 ) – Please choose one

 

 

Trailer is only added at ________layer of OSI model.

 

► data link

 

       ► physical

 

       ► network

 

       ► application

 

 

 

Question No: 5      ( Marks: 1 ) – Please choose one

 

 

A sine wave must be an analog signal.

 

► True

 

       ► False

 

 

 

Question No: 6      ( Marks: 1 ) – Please choose one

 

 

If there is __________in voltage then the frequency is infinite.

 

► instantaneous change

 

       ► continuous change

 

       ► no change

 

 

 

Question No: 7      ( Marks: 1 ) – Please choose one

 

 

The inversion of the level at 1 bit is called as __________

 

► NRZ-L

 

       ► NRZ-I

 

       ► RZ

 

 

 

Question No: 8      ( Marks: 1 ) – Please choose one

 

 

The last process in PCM is _________ digital data into digital signal.

 

 

► encoding

 

► decoding

 

       ► modulating

 

 

 

Question No: 9      ( Marks: 1 ) – Please choose one

 

 

Amplitude in ASK is more resistive to EMI and Noise.

 

       ► True

 

► False

 

 

 

Question No: 10      ( Marks: 1 ) – Please choose one

 

 

If FCC regulations are followed, the carrier frequencies of adjacent AM radio stations are ____________ apart.

 

► 5 KHz

 

       ► 10 KHz

 

       ► 200 KHz

 

       ► 530 KHz

 

 

 

Question No: 11      ( Marks: 1 ) – Please choose one

 

 

In _____________ transmission, a start bit and a stop bit frame a character byte.

 

► Asynchronous serial

 

       ► Synchronous serial

 

       ► Parallel

 

       ► Asynchronous & Synchronous serial

 

 

 

Question No: 12      ( Marks: 1 ) – Please choose one

 

 

Synchronous transmission have _____________.

 

► a start bit

 

       ► a stop bit

 

       ► gaps between bytes

 

       ► none of the given

 

 

 

Question No: 13      ( Marks: 1 ) – Please choose one

 

 

Transmission media are usually categorized as _____________

 

       ► Fixed or Unfixed

 

       ► Guided or Unguided

 

       ► Determinate or Indeterminate

 

► Metallic or Nonmetallic

 

 

 

Question No: 14      ( Marks: 1 ) – Please choose one

 

 

The RG number gives us information about ________.

 

       ► Twisted pairs

 

► Coaxial cables

 

       ► Optical fibers

 

       ► all of the given

 

 

 

Question No: 15      ( Marks: 1 ) – Please choose one

 

 

Radio wave and microwave frequencies range from _________.

 

       ► 3 to 300 KHz

 

       ► 300 KHz to300 KHz to 3 GHz

 

► 3 KHz to 300 GHz

 

       ► 3 KHz to 3000 GHz

 

 

 

Question No: 16      ( Marks: 1 ) – Please choose one

 

 

All of popular Fiber optic connectors are ___________ shaped.

 

       ► Conical

 

► Barrel

 

       ► Circular

 

► Rectangular

 

 

 

Question No: 17      ( Marks: 1 ) – Please choose one

 

 

In ______________ method a signal can be directed in a straight from Antenna to antenna.

 

► Line of sight

 

       ► Ground propagation

 

       ► Sky propagation

 

       ► Microwaves

 

 

 

Question No: 18      ( Marks: 1 ) – Please choose one

 

 

Amplifiers are used to __________the signal to heat.

 

► Amplify

 

       ► Rectify

 

       ► Testify

 

       ► NUllify

 

 

 

Question No: 19      ( Marks: 1 ) – Please choose one

 

 

There are ________ basic categories of multiplexing.

 

► 3

 

       ► 4

 

       ► 2

 

       ► 5

 

 

 

Question No: 20      ( Marks: 1 ) – Please choose one

 

 

If a T-1 carries 8000 frames, the data rate is ___________

 

       ► 2.544 Mbps

 

► 1.544 Mbps

 

       ► 1.544 Kbps

 

       ► 1.544 Gbps

 

 

 

Question No: 21      ( Marks: 1 ) – Please choose one

 

 

FTTC stands for _____________

 

       ► flexible to the curb

 

► fiber to the curb

 

       ► fiber to the cable

 

       ► fiber to the center

 

 

 

Question No: 22      ( Marks: 1 ) – Please choose one

 

 

Optical signals are multiplexed using _________ at switching office to create wider BW optical signals

 

       ► WDM

 

       ► FDM

 

       ► TDM

 

       ► MUX

 

 

 

Question No: 23      ( Marks: 1 ) – Please choose one

 

 

Which error detection method consists of a parity bit for each unit as well as an entire data unit of parity bits?

 

► Simple parity check

 

       ► Two-dimensional parity check

 

       ► CRC

 

       ► Checksum

 

 

 

Question No: 24      ( Marks: 1 ) – Please choose one

 

 

If the ASCII character G is sent and the character D is received, what type of error is this?

 

       ► Single-bit

 

► Multiple-bit

 

       ► Burst

 

       ► Recoverable

 

 

 

Question No: 25      ( Marks: 1 ) – Please choose one

 

 

Flow control is needed to prevent ____________

 

       ► Bit errors

 

       ► Overflow of the sender buffer

 

       ► Overflow of the receiver buffer

 

       ► Collision between sender and receiver

 

 

 

Question No: 26      ( Marks: 1 ) – Please choose one

 

 

In data link layer, communication requires at least ___________ devices working together

 

       ► 3

 

► 2

 

       ► 4

 

       ► 5

 

 

 

Question No: 27      ( Marks: 1 ) – Please choose one

 

 

Data link control is composed of ____________ important functions.

 

       ► 2

 

► 3

 

       ► 4

 

       ► 5

 

 

 

Question No: 28      ( Marks: 1 ) – Please choose one

 

 

Error control is both error _________ and error ___________

 

► detection; correction

 

       ► detection; deletion

 

       ► detection; avoidance

 

       ► detection; forwarding

 

 

 

Question No: 29      ( Marks: 1 ) – Please choose one

 

 

ENQ/ACK stands for______________

 

► Enquiry/ Acknowledgment

 

       ► Enque/ Acknowledgment

 

       ► Enquist/ Acknowledgment

 

       ► none of the given

 

 

 

Question No: 30      ( Marks: 1 ) – Please choose one

 

 

In __________ ARQ, if a NAK is received, only the specific damaged or lost frame is retransmitted.

 

       ► Stop-and-wait

 

       ► Go-Back-N

 

       ► Selective repeat

 

       ► Stop-and-wait & Go-back-N

 

 

 

Question No: 31      ( Marks: 1 ) – Please choose one

 

 

Sliding window requires that data frames be transmitted _______________

 

► Sequentially

 

       ► Frequently

 

       ► Synchronously

 

       ► Asynchronously

 

 

 

Question No: 32      ( Marks: 1 ) – Please choose one

 

 

Which of the following combines features of the other two.

 

► ZMODEM

 

       ► YMODEM

 

       ► XMODEM

 

       ► None of given

 

 

 

Question No: 33      ( Marks: 1 ) – Please choose one

 

 

BLAST stands for :

 

► Blocked asynchronous transmission

 

► Blocked synchronous transmission

 

       ► Barrel asynchronous transmission

 

       ► Below asynchronous transmission

 

 

 

Question No: 34      ( Marks: 1 ) – Please choose one

 

 

HDLC is an acronym for ______________.

 

       ► High-duplex line communication

 

► High-level data link control

 

       ► Half-duplex digital link combination

 

       ► Host double-level circuit

 

 

 

Question No: 35      ( Marks: 1 ) – Please choose one

 

 

The HDLC ___________ field defines the beginning and end of a frame.

 

 

► Flag

 

       ► Address

 

       ► Control

 

       ► FCS

 

 

 

Question No: 36      ( Marks: 1 ) – Please choose one

 

 

The shortest frame in HDLC protocol is usually the _________ frame.

 

       ► Information

 

► Supervisory

 

       ► Management

 

       ► None of the given

 

 

 

Question No: 37      ( Marks: 1 ) – Please choose one

 

 

The PDU  has no flag fields, no CRC, and no station address

 

► TRUE

 

       ► FALSE

 

 

 

Question No: 38      ( Marks: 1 ) – Please choose one

 

 

_________ is the access protocol used by traditional Ethernet.

 

► CSMA/CD

 

       ► CSMA/CA

 

       ► Token Ring

 

       ► CSMA

 

 

 

Question No: 39      ( Marks: 1 ) – Please choose one

 

 

Repeater is an amplifier, not a regenerator.

 

► True

 

► False

 

 

 

Question No: 40      ( Marks: 1 ) – Please choose one

 

 

Bridges can divide a large ________ into smaller segments

 

       ► Network

 

       ► Packet

 

► Frame

 

       ► Address

 

 

 

Question No: 41      ( Marks: 2 )

 

 

Stop-and- wait ARQ has two control variables S and R. What are their functions? [2]

 

Go-back-n ARQ

Selective Reject ARQ

 

Question No: 42      ( Marks: 2 )

 

What’s the name of the telephone service in which there is no need of dialing.

 

 

 

Question No: 43      ( Marks: 2 )

 

 

What is meant by Transmission Impairments?

 

 

 

Question No: 44      ( Marks: 3 )

 

 

How does the checksum checker know that the received data unit is undamaged? [3]

 

 

Question No: 45      ( Marks: 3 )

 

 

What is Geosynchronous satellite?

 

 

.

Question No: 46      ( Marks: 3 )

 

 

Following abbreviations stands for?

  1. ARP
  2. RARP
  3. 3.      ICMP    

 

Question No: 47      ( Marks: 5 )

 

 

Name and discuss briefly the bits in the HDLC control field. [5]

 

 

Question No: 48      ( Marks: 5 )

 

 

Describe method of checksum briefly?

 

 

 

 

 

Question No: 49      ( Marks: 5 )

 

 

What is satellite communication?

 

 

 

Question No: 50      ( Marks: 10 )

 

 

In how many ways TDM can be implemented? Describe any one with example.

 

 

VU CS601 -, DATA COMMUNICATION, FINALTERM, Solve,d Unsolved, Past Papers, Spring 2009

VU CS301 – Data Structures FinalTerm solved unsolved past Papers

VU CS301 – Data Structures FinalTerm Solved Unsolved Past Papers

CS302                                            Glossary                                                         CS302

 

 

 

ABEL :

 

Advanced Boolean Expression Language; a software compiler language for SPLD programming; a type of hardware description language (HDL)

 

 

Adder :

 

address :

A digital circuit which forms the sum and carry of two or more numbers.

 

The location of a given storage cell or group of cells in a memory; a unique memory location containing one byte.

 

 

 

address bus :

 

Generally, a one-way group of conductors from the microprocessor to memory, containing the address information.

 

 

 

Analog :

 

 

Analog Computer :

 

 

AND Gate :

 

A signal which is continuously variable and, unlike a digital signal, does not have discrete levels. (A slide rule is analog in function.)

 

Computer which represents numerical quantities as electrical and physical variables. Solutions to mathematical problems are accomplished by manipulating these variables.

 

A basic logic gate that outputs a 1 only if both inputs are a 1 , otherwise outputs a 0. See also, NAND, NOR and OR.

 

 

BCD :

 

Binary :

 

Binary Code :

 

 

Binary Coded

Decimal :

 

Bit :

 

 

 

Boolean Algebra :

 

 

 

cascade :

 

 

Clock :

 

 

CMOS :

 

 

 

Combinational

Logic :

 

comparator :

 

 

counter :

 

See ‘Binary Coded Decimal’.

 

The binary number system has only two digits – 0 and 1.

 

A code in which each element may be either of two distinct values (eg the presence or absence of a pulse).

A coding system in which each decimal digit from 0 to 9 is represented by four bits.

 

A single digit of a binary number. A bit is either a one represented by a voltage or a zero represented by no voltage. The number 5 represented in 4 and 8 bit binary would be 0101 and 00000101 respectively.

 

The algebra of logic named for George Boole. Similar in form to ordinary algebra, but with classes, propositions, yes/no criteria, etc for variables rather than numeric quantities. It includes the operators AND, OR, NOT, IF, EXCEPT, THEN.

 

To connect ‘end-to-end’ as when several counters are connected from the terminal count output of one counter to the enable input of the next counter.

 

The device in a digital system which provides the continuous train of pulses used to synchronize the transfer of data. Sometimes referred to as “the heartbeat.”

 

(Complementary Metal Oxide Semiconductor) An advanced IC manufacturing process technology characterized by high integration, low cost, low power and high performance. CMOS is the preferred process for today’s high density ICs.

Logic circuits whose outputs depend only on the present logic inputs.

 

A digital circuit that compares the magnitudes of two quantities and produces an output indicating the relationship of the quantities.

A digital circuit capable of counting electronic events, such as pulses, by progressing

 

 

 

 

data selector :

 

 

Decoder :

 

 

Digital System :

 

 

 

 

 

 

 

 

 

emitter :

 

encoder :

 

even parity : exponent :

 

fan in :

 

fan out : flip-flop :

 

 

 

 

 

 

 

GAL :

 

 

Gate :

 

 

Gate Array :

 

 

 

Gray code :

 

 

half-adder :

 

 

High :

 

High logic :

 

through a sequence of binary states.

 

A circuit that selects data from several inputs one at a sequence and places them on the output: also called a multiplexer.

 

A logic function that uses a binary value, or address, to select between a number of outputs and to assert the selected output by placing it in its active state.

 

A system in which information is transmitted in a series of pulses. The source is periodically sampled, analyzed, and converted or coded into numerical values and transmitted. Digital transmissions typically use the binary coding used by computers so most data is in appropriate form, but verbal and visual communication must be converted. Many satellite transmissions use digital formats because noise will not interfere with the quality of the end product, producing clear and higher-resolution imagery.

One of the three regions in a bipolar junction transistor.

 

A digital circuit(device) that converts information to a coded form.

The condition of having an even number of 1s in every group of bits.

 

The part of floating point number that represents the number of places that the decimal point (or binary point) is to be moved.

The number of logic inputs into a logic gate.

 

The number of logic inputs that can be driven by the output of a logic gate.

 

A basic digital building block that, at its simplest, uses two gates cross-coupled so that the output of one gate serves as the input of the other. It is capable of changing from one state to another on application of a control signal, but can remain in that state after the signal is removed. It thus serves as a basic storage element. Most flip-flops contain additional features to make them more versatile. Many digital circuits, such as registers and counters, are a number of flip-flops connected together.

 

Generic array logic; an SPLD with a reprogrammable AND array, a fixed OR array, and programmable output logic macro cells.

 

The control terminal of a MOSFET, or alternately a basic digital logic element, for example an AND Gate, See also, OR, NAND, NOR.

 

An integrated circuit made up of digital logic gates that are not yet connected. Typically gate arrays are fabricated up to the metal layers and then a custom metal mask is designed for a customer and used to connect the gates into a customer specific circuit.

 

The mirror image of the binary counting code which changes one bit at a time when increasing or decreasing by one.

 

A digital circuit that adds two bits and produces a sum and output carry. It cannot handle input carries.

A digital logic state corresponding to a binary “l.”

In digital logic, the more positive of the two logic levels in a binary system. Normally, a

 

 

 

 

IC :

 

 

 

Inverter :

 

 

 

JK flip-flop : Karnaugh map :

 

latch :

 

Logic :

 

 

 

Low logic :

 

 

mantissa :

 

MSI :

 

 

Multiplexer :

 

 

 

 

 

 

 

 

 

 

 

NAND gate : NOR gate :

 

NOT :

 

 

octal :

 

odd parity :

 

OR gate :

 

 

overflow :

high logic level is used to represent a binary 1 or true condition.

 

(Integrated Circuit) A single piece of silicon on which thousands or millions of transistors are combined. ICs are the major building blocks of modern electronic systems.

 

In logic, a digital circuit which inverts the input signal, as for example, changing a 1 to a 0. This is equivalent logically to the NOT function. An inverter may also serve as a buffer amplifier.

A type of flip-flop that can operate in the SET, RESET, no-change, and toggle modes.

 

An arrangement of cells representing the combinations of literals in a Boolean expression and used for a systematic simplification of the expression.

A bistable digital circuit used for storing a bit.

 

One of the three major classes of ICs in most digital electronic systems: microprocessors, memory, and logic. Logic is used for data manipulation and control functions that require higher speed than a microprocessor can provide

 

In digital logic, the more negative of the two logic levels in a binary system. In positive logic, a low-logic level is used to represent a logic 0, or a not-true, condition.

The magnitude of a floating-point number.

 

Medium-scale integration’ a level of fixed-function IC complexity in which there are 12 to 99 equivalent gates per chip.

 

An electronic device normally used to scan a number of input terminals and receive data from, or send data to, the same. Multiplexers are normally one of two types:

 

  1. The cyclic type which continually and sequentially looks at each input for a request to send or receive data.

 

  1. The random type which waits in a “rest” position until other circuitry notifies it of a request to receive or send data.

 

A logic circuit in which a LOW output occurs only if all the inputs are HIGH.

 

A logic circuit which performs the OR function and then inverts the result. A NOT-OR gate.

 

The logical operator having that property which if P is a statement, then the not of P (P) is true if P is false, and the not of P (P) is false if P is true.

Describes a number system with a base of eight.

 

The condition of having an odd number of 1s in every group of bits.

 

A multiple -input gate circuit whose output is energized when any one or more of the inputs is in a prescribed state. Used in digital logic

 

The condition that occurs when the number of bits in a sum exceeds the number of bits in each of the numbers added.

 

 

 

PAL :

 

 

parity :

 

 

parity bit :

 

 

PLA :

 

queue : register :

 

Shift :

 

 

Shift register :

 

 

 

Sign bit :

 

 

 

Significant digit :

 

Programmable array logic; an SPLD with a programmable AND array and a fixed OR array with programmable output logic.

 

In relation to binary codes, the condition of evenness or oddness of the number of 1s in a code group.

 

A bit attached to each group of information bits to make the total number of 1s in a code group.

Programmable logic array; an SPLD with programmable AND and OR arrays.

 

A high-speed memory that stores instructions or data.

 

A digital circuit capable of storing and shifting binary information; typically used as a temporary storage device.

 

To move information serially right or left in a register(s). Information shifted out of a register may be lost, or it may be re-entered at the other end of the register.

 

A shift register is an electronic device which can contain several bits of information. Shift registers are normally used to collect variable input data and send this data out in a predetermined pattern.

 

Computers generally indicate whether a number is positive or negative by a sign bit, which is usually located adjacent to the most significant numerical digit. Usually zero (0) is used for positive (+) and one (1) for negative (-).

 

A digit that contributes to the preciseness of a number. The number of significant digits is counted beginning with the digit contributing the most value, called the most significant digit, and ending with the one contributing the least value, called the least significant digit.

 

 

 

toggle : Truth Table :

 

TTL :

The action of flip-flop when it changes state on each clock pulse.

 

A table that defines a logic function by listing all combinations of input values, and indicating for each combination the true output values.

 

Transistor-transistor logic; a class of integrated logic circuits that uses bipolar junction transistors.

 

 

universal gate : Either a NAND or a NOR gate; The term universal refers to the property of a gate that
permits any logic function to be implemented by that gate or by a combination of gates
of that kind.
up/down counter : A counter that can progress in either direction through a certain sequence.
VLSI : Very large-scale integration; a level of IC complexity in which there are 10,000 to
99,000 equivalent gates per chip.
volatile : A term that describes a memory that loses stored data when the power is removed.
weight : The value of digit in a number based on its position in the number.

 

VU CS301 – Data Structures FinalTerm Solved Unsolved Past Papers

VU CS301 – Data Structures FinalTerm solved unsolved past Papers Fall 2009

VU CS301 – Data Structures FinalTerm Solved Unsolved Past Papers Fall 2009

CS301 Final Term Past Papers GURU

FINALTERM EXAMINATION

 Fall 2009

 CS301- Data Structures

 

Question No: 1 ( Marks: 1 ) – Please choose one

 

The data of the problem is of 2GB and the hard disk is of 1GB capacity, to solve this

problem we should

► Use better data structures

► Increase the hard disk space

► Use the better algorithm

► Use as much data as we can store on the hard disk

 

Question No: 2 ( Marks: 1 ) – Please choose one

 

In an array list the current element is

► The first element

► The middle element

► The last element

 ► The element where the current pointer points to

 

Question No: 3 ( Marks: 1 ) – Please choose one

 

Which one of the following is a valid postfix expression?

► ab+c*d-

► abc*+d-

► abc+*d-

► (abc*)+d-

 

Question No: 4 ( Marks: 1 ) – Please choose one

 

In sequential access data structure, accessing any element in the data structure

takes different amount of time. Tell which one of the following is sequential access

data structure, Linked list

► Arrays

► Lists

► Both of these

CS301 Final Term Past Papers GURU

 

 ► None of these

 

Question No: 5 ( Marks: 1 ) – Please choose one

 

I have implemented the queue with a circular array. If data is a circular array of

CAPACITY elements, and last is an index vu solutions.com into that array, what is

the formula for the index after last?

► (last % 1) + CAPACITY

► last % (1 + CAPACITY)

► (last + 1) % CAPACITY

► last + (1 % CAPACITY)

 

Question No: 6 ( Marks: 1 ) – Please choose one

 

Which one of the following is TRUE about recursion?

► Recursion extensively uses stack memory.

► Threaded Binary Trees use the concept of recursion.

► Recursive function calls consume a lot of memory.

► Iteration is more efficient than iteration.

 

Question No: 7 ( Marks: 1 ) – Please choose one

 

Compiler uses which one of the following to evaluate a mathematical equation,

► Binary Tree

► Binary Search Tree

► Parse Tree

► AVL Tree

 

Question No: 8 ( Marks: 1 ) – Please choose one

 Which

one of the following is TRUE about iteration?

CS301 Final Term Past Papers GURU

► Iteration extensively uses stack memory.

► Threaded Binary Trees use the concept of iteration.

► Iterative function calls consumes a lot of memory.

► Recursion is more efficient than iteration.

 

Question No: 9 ( Marks: 1 ) – Please choose one

 If a max

heap is implemented using a partially filled array called data, and the array contains

n elements (n > 0), where is the entry with the greatest value? Data[0]

► data[1]

► data[n-1]

► data[n]

► data[2*n+1]

 

Question No: 10 ( Marks: 1 ) – Please choose one

 If there

are 56 internal nodes in a binary tree then how many external nodes this binary

tree will have?

► 54

► 55

► 56

► 57

 

Question No: 11 ( Marks: 1 ) – Please choose one

 Which of

the following heap method increase the value of key at position ‘p’ by the amount

‘delta’?

► increaseKey(p,delta)

► decreaseKey(p,delta)

► preculateDown(p,delta)

► remove(p,delta)

 

Question No: 12 ( Marks: 1 ) – Please choose one

 If we have

1000 sets each containing a single different person. Which of the following relation

will be true on each set:

 ► Reflexive

CS301 Final Term Past Papers GURU

► Symmetric

► Transitive

► Associative

 

Question No: 13 ( Marks: 1 ) – Please choose one

 Which one

of the following is not an example of equivalence relation:

► Electrical connectivity

► Set of people

► <= relation

► Set of pixels

 

Question No: 14 ( Marks: 1 ) – Please choose one

 A binary

tree of N nodes has _______.

► Log10 N levels

► Log2 N levels

► N / 2 levels

► N x 2 levels

 

Question No: 15 ( Marks: 1 ) – Please choose one

 Binary

Search is an algorithm of searching, used with the ______ data.

► Sorted

► Unsorted

► Heterogeneous

► Random

 

Question No: 16 ( Marks: 1 ) – Please choose one

 Consider

te following array

23 15 5 12 40 10 7

After the first pass of a particular algorithm, the array looks like

1. 5 12 23 10 7 40

Name the algorithm used

CS301 Final Term Past Papers GURU

► Heap sort

► Selection sort

► Insertion sort

► Bubble sort

 

Question No: 17 ( Marks: 1 ) – Please choose one

 Which of

the following statements is correct property of binary trees?

► A binary tree with N internal nodes has N+1 internal links.

► A binary tree with N external nodes has 2N internal nodes.

► A binary tree with N internal nodes has N+1 external nodes.

► None of above statement is a property of the binary tree.

 

Question No: 18 ( Marks: 1 ) – Please choose one

 Which of

the following is a property of binary tree?

► A binary tree of N external nodes has N internal node.

► A binary tree of N internal nodes has N+ 1 external node.

► A binary tree of N external nodes has N+ 1 internal node.

► A binary tree of N internal nodes has N- 1 external node.

 

Question No: 19 ( Marks: 1 ) – Please choose one

 Which of

the following statement is true about dummy node of threaded binary tree?

► The left pointer of dummy node points to the itself while the right pointer

points to the root of tree.

 ► The left pointer of dummy node points to the root node of the tree

while the right pointer points itself i.e. to dummy node

► The left pointer of dummy node points to the root node of the tree while the

right pointer is always NULL.

► The right pointer of dummy node points to the itself while the left pointer is

always NULL.

 

Question No: 20 ( Marks: 1 ) – Please choose one

 If the

bottom level of a binary tree is NOT completely filled, depicts that the tree is NOT a

► Expression tree

► Threaded binary tree

► complete Binary tree

► Perfectly complete Binary tree

 

Question No: 21 ( Marks: 1 ) – Please choose one

CS301 Final Term Past Papers GURU

 In a

selection sort of n elements, how many times the swap function is called to

complete the execution of the algorithm?

► n-1

► n log n

► n2

► 1

 

Question No: 22 ( Marks: 1 ) – Please choose one

 Which of

the following statement is correct about find(x) operation:

► A find(x) on element x is performed by returning exactly the same

 node that is found.

► A find(x) on element x is performed by returning the root of the tree

containing x.

► A find(x) on element x is performed by returning the whole tree itself

containing x.

► A find(x) on element x is performed by returning TRUE.

 

Question No: 23 ( Marks: 1 ) – Please choose one

 Which of

the following statement is NOT correct about find operation:

► It is not a requirement that a find operation returns any specific name,

just that finds on two elements return the same answer if and only if they are in the

same set.

► One idea might be to use a tree to represent each set, since each element in

a tree has the same root, thus the root can be used to name the set.

► Initially each set contains one element.

 ► Initially each set contains one element and it does not make sense

to make a tree of one node only.

 

Question No: 24 ( Marks: 1 ) – Please choose one

 Consider

the following postfix expression S and the initial values of the variables.

 

S = A B – C + D E F – + ^

Assume that A=3, B=2, C=1, D=1, E=2, F=3

 

What would be the final output of the stack?

CS301 Final Term Past Papers GURU

► 1

► 2

► 0

 ► -1

 

Question No: 25 ( Marks: 1 ) – Please choose one

 The

maximum number of external nodes (leaves) for a binary tree of height H is

 _________

 ► 2H

► 2H +1

► 2H -1

► 2H +2

 

Question No: 26 ( Marks: 1 ) – Please choose one

 In

threaded binary tree the NULL pointers are replaced by ,

► preorder successor or predecessor

► inorder successor or predecessor

► postorder successor or predecessor

► NULL pointers are not replaced

 

Question No: 27 ( Marks: 1 ) – Please choose one

 In a min

heap , preculateDown procedure will move smaller value______ and bigger

value______.

► left,right

► right,left

► up,down

► down,up

 

Question No: 28 ( Marks: 1 ) – Please choose one

 Which of

the following statement is correct about union:

► To perform Union of two sets, we merge the two trees by making the

root of one tree point to the root of the other.

► To perform Union of two sets, we merge the two trees by making the leaf

node of one tree point to the root of the other.

► To perform Union of two sets, merging operation of trees in not required at

all.

► None of the given options.

 

Question No: 29 ( Marks: 1 ) – Please choose one

CS301 Final Term Past Papers GURU

 Suppose A

is an array containing numbers in increasing order, but some numbers occur more

than once when using a binary search for a value, the binary search always finds

____________

► the first occurrence of a value.

► the second occurrence of a value.

► may find first or second occurrence of a value.

► None of the given options.

 

Question No: 30 ( Marks: 1 ) – Please choose one

 Let heap

stored in an array as H = [50, 40, 37, 32, 28, 22, 36, 13]. In other words, the root

of the heap contains the maximum element. What is the result of deleting 40 from

this heap

► [50,32, 37,13, 28, 22, 36]

► [37, 28, 32, 22, 36, 13]

► [37, 36, 32, 28, 13, 22]

► [37, 32, 36, 13, 28, 22]

CS301 Final Term Past Papers GURU

 FINALTERM EXAMINATION

 Fall 2009

CS301- Data Structures

Question No: 1 ( Marks: 1 ) – Please choose one

 

__________ only removes items in reverse order as they were entered.

 

 ► Stack

 

 ► Queue

 

 ► Both of these

 

 ► None of these

 

 

Question No: 2 ( Marks: 1 ) – Please choose one

 

Here is a small function definition:

void f(int i, int &k)

{

i = 1;

k = 2;

}

Suppose that a main program has two integer variables x and y, which are given

the value 0. Then the main program calls f(x,y); What are the values of x and y after the function f finishes?

 ► Both x and y are still 0.

 

 ► x is now 1, but y is still 0.

 

 ► x is still 0, but y is now 2.

 

CS301 Final Term Past Papers GURU

 ► x is now 1, and y is now 2.

 

 

 Question No: 3 ( Marks: 1 ) – Please choose one

 

Select the one FALSE  statement about binary trees:

 

 ► Every binary tree has at least one node.

 

 ► Every non-empty tree has exactly one root node.

 

 ► Every node has at most two children.

 

 ► Every non-root node has exactly one parent.

 

 

Question No: 4 ( Marks: 1 ) – Please choose one

 

Every AVL is _________________

 

 ► Binary Tree

 

 ► Complete Binary Tree

 ► None of these

 ► Binary Search Tree

 

 

 

Question No: 5 ( Marks: 1 ) – Please choose one

 

Searching an element in an AVL tree take maximum _______ time (where n is

no. of nodes in AVL tree),

 

 ► Log2(n+1)

CS301 Final Term Past Papers GURU

 

 ► Log2(n+1) -1

 ► 1.44 Log2n

 

 ► 1.66 Log2n

 

 

Question No: 6 ( Marks: 1 ) – Please choose one

 

Suppose that we have implemented a priority queue  by storing the items in a heap.

We are now executing a reheapification downward and the out-of-place node has

priority of 42. The node’s parent has a priority of 72, the left child has priority 52

and the node’s right child has priority 62. Which statement best describes the status

of the reheapification.

 

 ► The reheapification is done.

 

 ► The next step will interchange the two children of the out-of-place node.

 

 ► The next step will swap the out-of-place node with its parent.

 ► The next step will swap the out-of-place node with its left child.

 

 

 

Question No: 7 ( Marks: 1 ) – Please choose one

 

Suppose you implement a heap (with the largest element on top) in an array.

Consider the different arrays below, determine the one that cannot  possibly be a

heap:

 

 ► 7 6 5 4 3 2 1

 

 ► 7 3 6 2 1 4 5

 

CS301 Final Term Past Papers GURU

 ► 7 6 4 3 5 2 1

 

 ► 7 3 6 4 2 5 1

 

 

Question No: 8 ( Marks: 1 ) – Please choose one

 

If there are 23 external nodes in a binary tree then what will be the no. of internal

nodes in this binary tree?

 

 ► 23

 ► 24

 ► 21

 

 ► 22

 

 

 

Question No: 9 ( Marks: 1 ) – Please choose one

 

If there are N external nodes in a binary tree then what will be the no. of internal

nodes in this binary tree?

 

 ► N -1

 

 ► N+1

 

 ► N+2

 ► N

 

 

Question No: 10 ( Marks: 1 ) – Please choose one

 

Which one of the following is NOT the property of equivalence relation:

CS301 Final Term Past Papers GURU

 

 ► Reflexive

 

 ► Symmetric

 ► Transitive

 ► Associative

 

 

 

Question No: 11 ( Marks: 1 ) – Please choose one

 

The definition of Transitivity property is

 ► For all element x member of S, x R x

 

 ► For all elements x and y, x R y if and only if y R x

 

 ► For all elements x, y and z, if x R y and y R z then x R z

 

 ► For all elements w, x, y and z, if x R y and w R z then x R z

 

 

Question No: 12 ( Marks: 1 ) – Please choose one

 

Union is a _______ time operation.

 

 ► Constant

 

 ► Polynomial

 

 ► Exponential

 ► None of the given options

 

 

 

Question No: 13 ( Marks: 1 ) – Please choose one

CS301 Final Term Past Papers GURU

 

Which of the following is NOT a correct statement about Table ADT.

 

 ► In a table, the type of information in columns may be different.

 

 ► A table consists of vu solutions.com several columns, known as entities.

 

 ► The row of a table is called a record.

 

 ► A major use of table is in databases where we build and use tables for

keeping information.

 

 

 

Question No: 14 ( Marks: 1 ) – Please choose one

 

In the worst case of deletion in AVL tree requires _________.

 

 ► Only one rotation

 ► Rotation at each non-leaf node

 ► Rotation at each leaf node

 

 ► Rotations equal to log2 N

 

 

 

Question No: 15 ( Marks: 1 ) – Please choose one

 

Binary Search is an algorithm of searching, used with the ______ data.

 

 ► Sorted

 

 ► Unsorted

CS301 Final Term Past Papers GURU

 

 ► Heterogeneous

 

 ► Random

 

 

 Question No: 16 ( Marks: 1 ) – Please choose one

 

Which of the following statement is correct?

 

 ► A Threaded Binary Tree is a binary tree in which every node that does not

have a left child has a THREAD (in actual sense, a link) to its INORDER successor.

 

 ► A Threaded Binary Tree is a binary tree in which every node that does not

have a right child has a THREAD (in actual sense, a link) to its PREOREDR

successor.

 

 ► A Threaded Binary Tree is a binary tree in which every node that

does not have a right child has a THREAD (in actual sense, a link) to its

 INORDER successor.

 

 ► A Threaded Binary Tree is a binary tree in which every node that does not

have a right child has a THREAD (in actual sense, a link) to its POSTORDER

successor.

 

 

 Question No: 17 ( Marks: 1 ) – Please choose one

 

By using __________we avoid the recursive method of traversing a Tree, which

makes use of stacks and consumes a lot of memory and time.

 

 ► Binary tree only

 

 ► Threaded binary tree

 

 ► Heap data structure

CS301 Final Term Past Papers GURU

 

 ► Huffman encoding

 

 

Question No: 18 ( Marks: 1 ) – Please choose one

 

Which of the following statement is NOT true about threaded binary tree?

 

 ► Right thread of the right-most node points to the dummy  node.

 

 ► Left thread of the left-most node points to the dummy  node.

 

 ► The left pointer of dummy node points to the root node of the tree.

 

 ► Left thread of the right-most node points to the dummy  node.

 

 

Question No: 19 ( Marks: 1 ) – Please choose one

 

Consider a min heap, represented by the following array:

11,22,33,44,55

After inserting a node with value 66.Which of the following is the updated min heap?

 

 ► 11,22,33,44,55,66

 

 ► 11,22,33,44,66,55

 

 ► 11,22,33,66,44,55

 

 ► 11,22,66,33,44,55

 

 

Question No: 20 ( Marks: 1 ) – Please choose one

 

Consider a min heap, represented by the following array:

3,4,6,7,5

After calling the function deleteMin().Which of the following is the updated min

CS301 Final Term Past Papers GURU

heap?

 ► 4,6,7,5

 

 ► 6,7,5,4

 

 ► 4,5,6,7

 

 ► 4,6,5,7

 

 

Question No: 21 ( Marks: 1 ) – Please choose one

 

We can build a heap in ________ time.

 

 ► Linear

 

 ► Exponential

 

 ► Polynomial

 ► None of the given options

 

 

 

Question No: 22 ( Marks: 1 ) – Please choose one

 

Suppose we are sorting an array of eight integers using quick sort, and we have just

finished the first partitioning with the array looking like this:

2 5 1 7 9 12 11 10

Which statement is correct?

 

 ► The pivot could be either the 7 or the 9.

 

 ► The pivot could be the 7, but it is not the 9.

 

CS301 Final Term Past Papers GURU

 ► The pivot is not the 7, but it could be the 9.

 

 ► Neither the 7 nor the 9 is the pivot.

 

 

Question No: 23 ( Marks: 1 ) – Please choose one

 

Which formula is the best approximation for the depth of a heap with n nodes?

 

 ► log (base 2) of n

 

 ► The number of digits in n (base 10), e.g., 145 has three digits

 

 ► The square root of n

 ► n

 

 

 

Question No: 24 ( Marks: 1 ) – Please choose one

 

Suppose you implement a Min heap (with the smallest element on top) in an array.

Consider the different arrays below; determine the one that cannot  possibly be a

heap:

 

 ► 16, 18, 20, 22, 24, 28, 30

 

 ► 16, 20, 18, 24, 22, 30, 28

 

 ► 16, 24, 18, 28, 30, 20, 22

 

 ► 16, 24, 20, 30, 28, 18, 22

 

 

Question No: 25 ( Marks: 1 ) – Please choose one

 

While joining nodes in the building of Huffman encoding tree if there are more

nodes with same frequency, we choose the nodes _______.

CS301 Final Term Past Papers GURU

 

 ► Randomly

 ►  That occur first in the text message

 

 ► That are lexically smaller among others.

 

 ►  That are lexically greater among others

 

 

 Question No: 26 ( Marks: 1 ) – Please choose one

 

Consider the following paragraph with blanks.

A …….…….. is a linear list where …………… and ………… take place at the

same end . This end is called the …….……….

What would be the correct filling the above blank positions?

 

 ► (i) queue (ii) insertion (iii) removals (iv) top

 

 ► (i) stack (ii) insertion (iii) removals (iv) bottom

 

 ► (i) stack (ii) insertion (iii) removals (iv) top

 

 ► (i) tree (ii) insertion (iii) removals (iv) top

 

 

Question No: 27 ( Marks: 1 ) – Please choose one

 

A binary tree with 33 internal nodes has _______ links to internal nodes.

 ► 31

 ► 32

 

 ► 33

CS301 Final Term Past Papers GURU

 

 ► 66

 

 

Question No: 28 ( Marks: 1 ) – Please choose one

 

Which traversal gives a decreasing order of elements in a heap where the max

element is stored at the top?

 

 ► post-order

 

 ► level-order

 ► inorder

 ► None of the given options

 

 

 

Question No: 29 ( Marks: 1 ) – Please choose one

 

What requirement is placed on an array, so that binary search  may be used to

locate an entry?

 

 ► The array elements must form a heap.

 

 ► The array must have at least 2 entries.

 

 ► The array must be sorted.

 

 ► The array’s size must be a power of two.

 

 

Question No: 30 ( Marks: 1 ) – Please choose one

 

Which of the following is a non linear data structure?  

 

CS301 Final Term Past Papers GURU

 ► Linked List

 

 ► Stack

 

 ► Queue

 

 ► Tree

CS301 Final Term Past Papers GURU

www.VUsolutions.com

 FINALTERM EXAMINATION

 Fall 2009

CS301- Data Structures

Question No: 1 ( Marks: 1 ) – Please choose one

 

The arguments passed to a function should match in number, type and order with

the parameters in the function definition.

  ► True

 ► False

 

 

 Question No: 2 ( Marks: 1 ) – Please choose one

 

If numbers 5, 222, 4, 48 are inserted in a queue, which one will be removed first?

 ► 48

 ► 4

 ► 222

 ► 5

 

 

Question No: 3 ( Marks: 1 ) – Please choose one

 

Suppose currentNode refers to a node in a linked list (using the Node class with

member variables called data and nextNode). What statement changes currentNode

so that it refers to the next node?

 ► currentNode ++;

 ► currentNode = nextNode;

 ► currentNode += nextNode;

CS301 Final Term Past Papers GURU

 ► currentNode = currentNode->nextNode;

 

 

Question No: 4 ( Marks: 1 ) – Please choose one

 

A Compound Data Structure is the data structure which can have multiple

data items of same type or of different types. Which of the following can be

considered compound data structure?

 

 ► Arrays

 

 ► LinkLists

 

 ► Binary Search Trees

 

 ► All of the given options

 

 

Question No: 5 ( Marks: 1 ) – Please choose one

 

Here is a small function definition:

void f(int i, int &k)

{

i = 1;

k = 2;

}

Suppose that a main program has two integer variables x and y, which are given

the value 0. Then the main program calls f(x,y); What are the values of x and y after the function f finishes?

 ► Both x and y are still 0.

 

CS301 Final Term Past Papers GURU

 ► x is now 1, but y is still 0.

 ► x is still 0, but y is now 2.

 ► x is now 1, and y is now 2.

 

 

 Question No: 6 ( Marks: 1 ) – Please choose one

 

The difference between a binary tree and a binary search tree is that ,

 ► a binary search tree has two children per node whereas a binary tree can

have none, one, or two children per node

 ► in binary search tree nodes are inserted based on the values they

 contain

 ► in binary tree nodes are inserted based on the values they contain

 ► none of these

 

 

Question No: 7 ( Marks: 1 ) – Please choose one

 

Compiler uses which one of the following to evaluate a mathematical equation,

 ► Binary Tree

 ► Binary Search Tree

 ► Parse Tree

 ► AVL Tree

 

 

CS301 Final Term Past Papers GURU

 

Question No: 8 ( Marks: 1 ) – Please choose one

 

If there are 56 internal nodes in a binary tree then how many external nodes this

binary tree will have?

 ► 54

 ► 55

 ► 56

 ► 57

 

 

Question No: 9 ( Marks: 1 ) – Please choose one

 

If there are 23 external nodes in a binary tree then what will be the no. of internal

nodes in this binary tree?

 ► 23

 ► 24

 ► 21

 ► 22

 

 

 

Question No: 10 ( Marks: 1 ) – Please choose one

 

Which of the following method is helpful in creating the heap at once?

 ► insert

 ► add

CS301 Final Term Past Papers GURU

 ► update

 ► preculateDown

 

 

 

Question No: 11 ( Marks: 1 ) – Please choose one

 

The definition of vu solutions.com Transitivity property is

 ► For all element x member of S, x R x

 ► For all elements x and y, x R y if and only if y R x

 ► For all elements x, y and z, if x R y and y R z then x R z

 ► For all elements w, x, y and z, if x R y and w R z then x R z

 

 

Question No: 12 ( Marks: 1 ) – Please choose one

 

A binary tree of N nodes has _______.

 ► Log10 N levels

 ► Log2 N levels

 ► N / 2 levels

 ► N x 2 levels

 

 

Question No: 13 ( Marks: 1 ) – Please choose one

 If there

are N elements in an array then the number of maximum steps needed to find an

element using Binary Search is _______ .

 

CS301 Final Term Past Papers GURU

 ► N

 

 ► N2

 

 ► Nlog2N

 

 ► log2N

 

 

 

Question No: 14 ( Marks: 1 ) – Please choose one

 

Consider te following array

23 15 5 12 40 10 7

After the first pass of a particular algorithm, the array looks like

15 5 12 23 10 7 40

Name the algorithm used

 ► Heap sort

 

 ► Selection sort

 

 ► Insertion sort

 

 ► Bubble sort

 

 

 Question No: 15 ( Marks: 1 ) – Please choose one

 

If both pointers of the node in a binary tree are NULL then it will be a/an _______ .

 ► Inner node

 ► Leaf node

 ► Root node

 ► None of the given options

CS301 Final Term Past Papers GURU

 

 

 Question No: 16 ( Marks: 1 ) – Please choose one

 

By using __________we avoid the recursive method of traversing a Tree, which

makes use of stacks and consumes a lot of memory and time.

 ► Binary tree only

 ► Threaded binary tree

 ► Heap data structure

 ► Huffman encoding

 

 

Question No: 17 ( Marks: 1 ) – Please choose one

 

A complete binary tree of height 3 has between ________ nodes.

 ► 8 to 14

 ► 8 to 15

 ► 8 to 16

 ► 8 to 17

 

 

Question No: 18 ( Marks: 1 ) – Please choose one

 

Consider a min heap, represented by the following array:

3,4,6,7,5,10

After inserting a node with value 1.Which of the following is the updated min heap?

 ► 3,4,6,7,5,10,1

 

CS301 Final Term Past Papers GURU

 ► 3,4,6,7,5,1,10

 ► 3,4,1,5,7,10,6

 ► 1,4,3,5,7,10,6

 

 

 Question No: 19 ( Marks: 1 ) – Please choose one

 

Consider a min heap, represented by the following array:

10,30,20,70,40,50,80,60

After inserting a node with value 31.Which of the following is the updated min heap?

 ► 10,30,20,31,40,50,80,60,70

 ► 10,30,20,70,40,50,80,60,31

 ► 10,31,20,30,40,50,80,60,31

 ► 31,10,30,20,70,40,50,80,60

 

 

 

Question No: 20 ( Marks: 1 ) – Please choose one

 

Which one of the following algorithms is most widely used due to its good average

time,

 ► Bubble Sort

 ► Insertion Sort

 ► Quick Sort

 ► Merge Sort

 

 

Question No: 21 ( Marks: 1 ) – Please choose one

CS301 Final Term Past Papers GURU

 

Which of the following statement is correct about find(x) operation:

 ► A find(x) on element x is performed by returning exactly the same

 node that is found.

 ►  A find(x) on element x is performed by returning the root of the tree

containing x.

 ►  A find(x) on element x is performed by returning the whole tree itself

containing x.

 ► A find(x) on element x is performed by returning TRUE.

 

 

Question No: 22 ( Marks: 1 ) – Please choose one

 

Which of the following statement is NOT correct about find operation:

 ►  It is not a requirement that a find operation returns any specific name,

just that finds on two elements return the same answer if and only if they are in the

same set.

 ► One idea might be to use a tree to represent each set, since each element in a tree has the same root, thus the root can be used to name the set.

 ►  Initially each set contains one element.

 ► Initially each set contains one element and it does not make sense

to make a tree of one node only.

 

 

 

Question No: 23 ( Marks: 1 ) – Please choose one

 

The following are statements related to queues.

CS301 Final Term Past Papers GURU

(i) The last item to be added to a queue is the first item to be removed

(ii) A queue is a structure in which both ends are not used

(iii)

The last element hasn’t to wait until all elements preceding it on the

queue are removed

(iv)

A queue is said to be a last-in-first-out list or LIFO data structure.

Which of the above is/are related to normal queues?

 ► (iii) and (ii) only

 ► (i), (ii) and (iv) only

 ► (ii) and (iv) only

 ► None of the given options

 

 

Question No: 24 ( Marks: 1 ) – Please choose one

 

The maximum number of external nodes (leaves) for a binary tree of height H is

 _________

 ► 2H

 ► 2H +1

 ► 2H -1

 ► 2H +2

 

 

 

Question No: 25 ( Marks: 1 ) – Please choose one

 

In complete binary tree the bottom level is filled from ________

 ► Left to right

 ► Right to left

 

CS301 Final Term Past Papers GURU

 ► Not filled at all

 ► None of the given options

 

 

 

Question No: 26 ( Marks: 1 ) – Please choose one

 

We are given N items to build a heap , this can be done with _____ successive

inserts.

 ► N-1

 ► N

 ► N+1

 ► N^2

 

 

Question No: 27 ( Marks: 1 ) – Please choose one

 

Suppose we had a hash table whose hash function is “n % 12”, if the number 35 is

already in the hash table, which of the following numbers would cause a collision?

 ► 144

 ► 145

 ► 143

 ► 148

 

 

 

Question No: 28 ( Marks: 1 ) – Please choose one

 

Here is an array of ten integers:

CS301 Final Term Past Papers GURU

5 3 8 9 1 7 0 2 6 4

The array after the FIRST iteration of the large loop in a selection sort (sorting from

smallest to largest).  

 ► 0 3 8 9 1 7 5 2 6 4

 ► 2 6 4 0 3 8 9 1 7 5

 ► 2 6 4 9 1 7 0 3 8 5

 ► 0 3 8 2 6 4 9 1 7 5

 

 

Question No: 29 ( Marks: 1 ) – Please choose one

 

What requirement is placed on an array, so that binary search  may be used to

locate an entry?

 ► The array elements must form a heap.

 ► The array must have at least 2 entries.

 ► The array must be sorted.

 ► The array’s size must be a power of two.

 

 

 Question No: 30 ( Marks: 1 ) – Please choose one

 

In case of deleting a node from AVL tree, rotation could be prolong to the root node.

 ► Yes

 ► No

 

 

CS301 Final Term Past Papers GURU

FINALTERM EXAMINATION

 Fall 2009

CS301- Data Structures (Session – 4)

Question No: 1 ( Marks: 1 ) – Please choose one

 In an

array we can store data elements of different types.

► True

► False

 

Question No: 2 ( Marks: 1 ) – Please choose one

 Which one

of the following statement is NOT correct .

► In linked list the elements are necessarily to be contiguous

► In linked list the elements may locate at far positions in the memory

► In linked list each element also has the address of the element next to it

► In an array the elements are contiguous

 

Question No: 3 ( Marks: 1 ) – Please choose one

 Doubly

Linked List always has one NULL pointer.

► True

► False

 

Question No: 4 ( Marks: 1 ) – Please choose one

 A queue is

a data structure where elements are,

► inserted at the front and removed from the back.

► inserted and removed from the top.

► inserted at the back and removed from the front.

► inserted and removed from both ends.

 

Question No: 5 ( Marks: 1 ) – Please choose one

 Each node

in doubly link list has,

► 1 pointer

► 2 pointers

► 3 pointers

CS301 Final Term Past Papers GURU

 www.VUsolutions.com

► 4 pointers

 

Question No: 6 ( Marks: 1 ) – Please choose one

 I have

implemented the queue with a linked list, keeping track of a front pointer and a rear

pointer. Which of these pointers will change during an insertion into an EMPTY

queue?

► Neither changes

► Only front pointer changes.

► Only rear pointer changes.

► Both change.  

 

Question No: 7 ( Marks: 1 ) – Please choose one

 

Compiler uses which one of the following to evaluate a mathematical equation,

► Binary Tree

► Binary Search Tree

► Parse Tree

► AVL Tree

 

Question No: 8 ( Marks: 1 ) – Please choose one

 If a

complete binary tree has n number of nodes then its height will be,

2 (n+1) -1

n

2 (n) – 1

n – 1

CS301 Final Term Past Papers GURU

 www.VUsolutions.com

 

Question No: 9 ( Marks: 1 ) – Please choose one

 If a

complete binary tree has height h then its no. of nodes will be,

h+1- 1

– 1

h – 1

 

Question No: 10 ( Marks: 1 ) – Please choose one

 A binary

relation R over S is called an equivalence relation if it has following property(s)

s

 

Question No: 11 ( Marks: 1 ) – Please choose one

 Binary

Search is an algorithm of searching, used with the ______ data.

► Sorted

► Unsorted

► Heterogeneous

► Random

 

Question No: 12 ( Marks: 1 ) – Please choose one

 If there

are N elements in an array then the number of maximum steps needed to find an

element using Binary Search is _______ .

► N

CS301 Final Term Past Papers GURU

 www.VUsolutions.com

► N2

► Nlog2N

► log2N

 

Question No: 13 ( Marks: 1 ) – Please choose one

 Use of

binary tree in compression of data is known as _______ .

► Traversal

► Heap

► Union

► Huffman encoding

 

Question No: 14 ( Marks: 1 ) – Please choose one

 While

building Huffman encoding tree the new node that is the result of joining two nodes

has the frequency.

► Equal to the small frequency

► Equal to the greater

► Equal to the sum of the two frequencies

► Equal to the difference of the two frequencies

 

Question No: 15 ( Marks: 1 ) – Please choose one

 Which of

the following statements is correct property of binary trees?

► A binary tree with N internal nodes has N+1 internal links.

► A binary tree with N external nodes has 2N internal nodes.

► A binary tree with N internal nodes has N+1 external nodes.

► None of above statement is a property of the binary tree.

 

Question No: 16 ( Marks: 1 ) – Please choose one

 Which of

the following is a property of binary tree?

► A binary tree of N external nodes has N internal node.

► A binary tree of N internal nodes has N+ 1 external node.

► A binary tree of N external nodes has N+ 1 internal node.

► A binary tree of N internal nodes has N- 1 external node.

 

Question No: 17 ( Marks: 1 ) – Please choose one

 Which of

the following statement is correct?

CS301 Final Term Past Papers GURU

 www.VUsolutions.com

► A Threaded Binary Tree is a binary tree in which every node that does not

have a left child has a THREAD (in actual sense, a link) to its INORDER successor.

► A Threaded Binary Tree is a binary tree in which every node that does not

have a right child has a THREAD (in actual sense, a link) to its PREOREDR

successor.

► A Threaded Binary Tree is a binary tree in which every node that does not

have a right child has a THREAD (in actual sense, a link) to its INORDER successor.

► A Threaded Binary Tree is a binary vu solutions.com tree in which every

node that does not have a right child has a THREAD (in actual sense, a link) to its

POSTORDER successor.

 

Question No: 18 ( Marks: 1 ) – Please choose one

 Which of

the following statement is correct?

► A Threaded Binary Tree is a binary tree in which every node that does not

have a left child has a THREAD (in actual sense, a link) to its INORDER successor.

► A Threaded Binary Tree is a binary tree in which every node that does not

have a right child has a THREAD (in actual sense, a link) to its PREOREDR

successor.

► A Threaded Binary Tree is a binary tree in which every node that does not

have a left child has a THREAD (in actual sense, a link) to its INORDER predecessor.

► A Threaded Binary Tree is a binary tree in which every node that does not

have a right child has a THREAD (in actual sense, a link) to its POSTORDER

predecessor.

 

Question No: 19 ( Marks: 1 ) – Please choose one

 A

Threaded Binary Tree is a binary tree in which every node that does not have a

right child has a THREAD (in actual sense, a link) to its __________ successor.

► levelorder

► Preorder

► Inorder

► Postorder

 

Question No: 20 ( Marks: 1 ) – Please choose one

 Which of

the following statement is true about dummy node of threaded binary tree?

► This dummy node never has a value.

► This dummy node has always some dummy value.

► This dummy node has either no value or some dummy value.

► This dummy node has always some integer value.

 

CS301 Final Term Past Papers GURU

 www.VUsolutions.com

Question No: 21 ( Marks: 1 ) – Please choose one

 A

complete binary tree is a tree that is _________ filled, with the possible exception

of the bottom level.

► partially

► completely

► incompletely

► partly

 

Question No: 22 ( Marks: 1 ) – Please choose one

 

A

complete binary tree of height 3 has between ________ nodes.

► 8 to 14

► 8 to 15

► 8 to 16

► 8 to 17

 

Question No: 23 ( Marks: 1 ) – Please choose one

 We can

build a heap in ________ time.

► Linear

► Exponential

► Polynomial

► None of the given options

 

Question No: 24 ( Marks: 1 ) – Please choose one

 

Suppose

that a selection sort of 100 items has completed 42 iterations of the main loop. How

many items are now guaranteed to be in their final spot (never to be moved again)?

► 21

► 41

► 42

► 43

 

Question No: 25 ( Marks: 1 ) – Please choose one

 Suppose

you implement a Min heap (with the smallest element on top) in an array. Consider

the different arrays below; determine the one that cannot  possibly be a heap:

► 16, 18, 20, 22, 24, 28, 30

► 16, 20, 18, 24, 22, 30, 28

► 16, 24, 18, 28, 30, 20, 22

► 16, 24, 20, 30, 28, 18, 22

CS301 Final Term Past Papers GURU

 www.VUsolutions.com

 

Question No: 26 ( Marks: 1 ) – Please choose one

 Which of

the following statement is NOT correct about find operation:

► It is not a requirement that a find operation returns any specific name,

just that finds on two elements return the same answer if and only if they are in the

same set.

► One idea might be to use a tree to represent each set, since each element in

a tree has the same root, thus the root can be used to name the set.

► Initially each set contains one element.

► Initially each set contains one element and it does not make sense to make

a tree of one node only.

 

Question No: 27 ( Marks: 1 ) – Please choose one

  Consider

 the following infix expression:

x – y * a + b / c  

Which of the following is a correct equivalent expression(s) for the above?

► x y -a * b +c /

► x *y a – b c / +

► x y a * – b c / +

► x y a * – b/ + c

 

Question No: 28 ( Marks: 1 ) – Please choose one

 

A

complete binary tree of height ____  has nodes between 16 to 31 .

► 2

► 3

► 4

► 5

 

Question No: 29 ( Marks: 1 ) – Please choose one

 Here is an

array of ten integers:

5 3 8 9 1 7 0 2 6 4

The array after the FIRST iteration of the large loop in a selection sort (sorting from

smallest to largest).  

► 0 3 8 9 1 7 5 2 6 4

► 2 6 4 0 3 8 9 1 7 5

► 2 6 4 9 1 7 0 3 8 5

CS301 Final Term Past Papers GURU

 www.VUsolutions.com

► 0 3 8 2 6 4 9 1 7 5

 

Question No: 30 ( Marks: 1 ) – Please choose one

 What

requirement is placed on an array, so that binary search  may be used to locate an

entry?

► The array elements must form a heap.

► The array must have at least 2 entries.

► The array must be sorted.

► The array’s size must be a power of two.

Question # 1 of 10 ( Start time: 07:14:32 PM )

Total Marks: 1

The data type before a function name represents its,

Select correct option:

Return Type

Function data

Function arguments

Function name

 

Question # 2 of 10 ( Start time: 07:15:49 PM )

Total Marks: 1

When we call a function, its control

Select correct option:

transfers to its Prototype

transfers to its definition

returns to statement following function call

CS301 Final Term Past Papers GURU

 www.VUsolutions.com

The compiler stops execution of whole program

 

Question # 3 of 10 ( Start time: 07:16:37 PM )

Total Marks: 1

When an array of object is created dynamically then there is no way to provide

parameterized constructors for array of objects.

Select correct option:

True

False

 

Question # 4 of 10 ( Start time: 07:17:50 PM )

Total Marks: 1

Reference is not really an address it is ______________.

Select correct option:

  a synonym

 an antonym

a value

a number

 

CS301 Final Term Past Papers GURU

 www.VUsolutions.com

Question # 5 of 10 ( Start time: 07:18:22 PM )

Total Marks: 1

Which of the following concept is NOT associated with stream?

Select correct option:

Source

 Template

 Destination

State

 

Question # 6 of 10 ( Start time: 07:18:57 PM )

Total Marks: 1

___________ work more or less in the same way as macros

Select correct option:

Friend functions

Inline functions

User defined functions

Built-in functions

 

Question # 7 of 10 ( Start time: 07:19:35 PM )

Total Marks: 1

To get the memory address of a variable we use ____ .

Select correct option:

CS301 Final Term Past Papers GURU

 www.VUsolutions.com

 &

%

*

$

 

Question # 8 of 10 ( Start time: 07:20:05 PM )

Total Marks: 1

Class is a user defined___________.

Select correct option:

  data type

 memory reference

value

none of the given options.

 

Question # 9 of 10 ( Start time: 07:20:46 PM )

Total Marks: 1

The compiler generates __________________ automatically

Select correct option:

member functions

CS301 Final Term Past Papers GURU

 www.VUsolutions.com

 classes

objects of a class

  constructors

 

Question # 10 of 10 ( Start time: 07:21:14 PM )

Total Marks: 1

In_________, we try to have a precise problem statement

Select correct option:

Analysis

Design

Coding

None of the given

 

 

Question # 1 of 10 ( Start time: 08:02:27 PM )

Total Marks: 1

From the following; which on is the correct syntax of an array declaration: array size is 5 and it is of float data type?

Select correct option:

float [5] name;

name[5] float;

CS301 Final Term Past Papers GURU

 www.VUsolutions.com

float name[5];

None of the given options

 

Question # 4 of 10 ( Start time: 08:05:15 PM )

Total Marks: 1

In the case of pointer to pointer or _______________, the first pointer contains

the address of the second pointer, which contains the address of the variable,

which contains the desired value.

Select correct option:

double dereference

Single dereference

Dereference

None of the given

 

Question # 5 of 10 ( Start time: 08:06:04 PM )

Total Marks: 1

A structure is a collection of _____________under a single name.

Select correct option:

values

variables

data

None of the given

 

CS301 Final Term Past Papers GURU

Question # 6 of 10 ( Start time: 08:07:21 PM )

Total Marks: 1

The ws manipulator can be used with ______ stream(s).

Select correct option:

Output

Input

Input/Output

None of the given options

 

Question # 7 of 10 ( Start time: 08:08:44 PM )

Total Marks: 1

Look at the program code and identify the error. 1 #include 2 #define PI

3.1415926; // Defining PI 3 main() { 4 int radius = 5; 5 cout << “Area of circle with radius ” << radius << ” = ” << PI * radius * radius; }

Select correct option:

It will be compiled successfully and will not generate error

It will be compiled and returns nothing

Error exists in line number 2. Semi colon is not allowed with define directive

The value of PI cannot be defined in the beginning

  Click here to Save Answer & Move to Next Question

Question # 9 of 10 ( Start time: 08:10:51 PM )

Total Marks: 1

+= , *= , /= , etc are called,

Select correct option:

Assignment operators

CS301 Final Term Past Papers GURU

 Logical operator

Compound assignment operator

Unary operator

 

CS301 Final Term Past Papers GURU

 

Question # 1 of 10 ( Start

Total Marks: 1

time: 04:17:56 PM )

For the inorder traversal of threaded binary tree, we introduced a dummy node. The

left pointer of the dummy node is pointing to the ________ node of the tree.

Select correct option:

left most

root

right most

any of the given node

Quiz Start Time: 04:17 PM

81

Time Left sec(s)

Question # 2 of 10 ( Start

time: 04:19:19 PM )

Total Marks: 1

When a complete binary tree, represented by an array then for any array element

at position i, the parent is at position ______ .

Select correct option:

2i-1

2i

2i+1

floor(i/2)

Quiz Start Time: 04:17 PM

Time Left 85

sec(s)

Question # 3 of 10 ( Start

time: 04:20:07 PM )

Total Marks: 1

In threaded binary tree the NULL pointers are replaced by the

Select correct option:

CS301 Final Term Past Papers GURU

 preorder successor or predecessor

inorder successor or predecessor

inorder successor or predecessor

NULL pointers are not replaced

Quiz Start Time: 04:17 PM

Time Left 85

sec(s)

Question # 4 of 10 ( Start

Total Marks: 1

time: 04:20:45 PM )

Consider a binary tree, represented by the following array: A,B,C,D,E,F,G,H,I,J,K,L

Is it a strictly binary tree?

Select correct option:

Yes

No

Quiz Start Time: 04:17 PM

87

Time Left sec(s)

Question # 5 of 10 ( Start

time: 04:21:27 PM )

Total Marks: 1

We implement the heap by ______________ .

Select correct option:

Threaded Tree

AVL tree

Complete binary tree

Expression

CS301 Final Term Past Papers GURU

Quiz Start Time: 04:17 PM

Time Left 86

sec(s)

Question # 6 of 10 ( Start

Total Marks: 1

time: 04:21:57 PM )

A Threaded Binary Tree is a binary tree in which every node that does not have a

right child has a THREAD (in actual sense, a link) to its __________ successor

Select correct option:

Preorder

Inorder

Postorder

levelorder

Quiz Start Time: 04:17 PM

86

Time Left sec(s)

Question # 7 of 10 ( Start

time: 04:22:33 PM )

Total Marks: 1

See the below code and fill the appropriate answer for? void fastInorder(TreeNode*

p) { while((p=nexInorder(p)) != ? ) cout << p->getInfo(); }

Select correct option:

dummy

rootNode

LTH

RTH

Quiz Start Time: 04:17 PM

Time Left 86

sec(s)

Question # 8 of 10 ( Start

Total Marks: 1

time: 04:23:37 PM )

CS301 Final Term Past Papers GURU

In which of the following tree, parent node has key greater than or equal to its both

children?

Select correct option:

Max heap

Binary search tree

Threaded Binary tree

Complete Binary tree

Quiz Start Time: 04:17 PM

86

Time Left sec(s)

Question # 9 of 10 ( Start

time: 04:24:18 PM )

Total Marks: 1

Consider a binary tree, represented by the following array: A,B,C,D,E,F,G,I Is it a

strictly binary tree ?

Select correct option:

Yes

No

Quiz Start Time: 04:17 PM

Time Left 50

sec(s)

Question # 10 of 10 ( Start

time: 04:24:42 PM )

Total Marks: 1

When a complete binary tree, represented by an array then for any array element

at position i, the right child is at position ______ .

Select correct option:

2i-1

2i

2i+1

CS301 Final Term Past Papers GURU

 www.VUsolutions.com

floor(i/2)

CS301 Final Term Past Papers GURU

 

 

 

VU CS301 – Data Structures FinalTerm Solved Unsolved Past Papers Fall 2009

ALL NEW RESULTS
Educational News

Updated Educational News

Categories
POSTS BY DATE
December 2016
M T W T F S S
« Sep    
 1234
567891011
12131415161718
19202122232425
262728293031