Data Structures and Program Design Using C++ by Dheeraj Malhotra , Neha Malhotra | 9781683923701 | 2018913035 | Holooly

Information Technology

Data Structures and Program Design Using C++

56 SOLVED PROBLEMS

Question: 10.FAQ.5

Insert the keys 4, 9, 20, 35, and 49 in a chained hash table of 10 memory locations. Use hash function h(k) = k mod m. ...

Verified Answer:

Initially, the hash table is given as: Now, we wil...

Question: 3.FAQ.2

An array is given int marks[6] = { 34, 53, 87, 100, 98, 65 } ; calculate the address of marks[3] if the base address is 3000. ...

Verified Answer:

It is given that the base address of the array is ...

Question: 6.7

Consider the following array. Sort the given values in the array using the bubble sort technique. ...

Verified Answer:

In the given array, the number of elements in the ...

Question: 6.8

Sort the values given in the array using the quick sort algorithm. ...

Verified Answer:

Step 1 – First element is chosen as the pivot. Now...

Question: 6.3

Consider an array of seven numbers which is declared as: int array[ ] = {5, 16, 23, 34, 45, 56, 65} ; and the value to be searched for is 45. ...

Verified Answer:

Pass 1 – LOW = 0, HIGH = 7 - 1= 6, VAL =45 ARR[LOW...

Question: 7.6

Convert the following infix expression into a postfixexpression. a) (A + B) * C / D. b) [((A +B) * (C – D)) + (F – G)] ...

Verified Answer:

a) Expression Stack Character ( ( A ( A ...

Question: 7.6

Evaluate the given prefix expressions. a) + – 4 6 * 9 /10 50 b) + * * + 2 3 4 5 + 6 7 ...

Verified Answer:

a) character satck Opration 50 50 push 50 ...

Question: 7.6

Check whether the following given expressions are valid or not. a) ((A – B) * Y b) [(A + B) – {X + Y} * [C – D]] ...

Verified Answer:

a) Stack symbol ( ( 1 (, ( ( 2 (, ( a 3 ...

Question: 7.6

Evaluate the following postfix expressions. a) 2 3 4 + * 5 6 7 8 + * + + b) T F T F AND F F F XOR OR AND T XOR AND OR ...

Verified Answer:

a) Character Stack Operation 2 2 PUSH 2 3 2...

Question: 6.8

Convert the following infix expression into a prefix expression. a) (X – Y) / (A + B). b) (X – Y / Z) * (A / B – C) ...

Verified Answer:

a) After reversing the given infix expression ((B ...

Loading...