Disha Expert Team Solutions for Chapter: Data Structures, Exercise 1: Exercise

Author:Disha Expert Team

Disha Expert Team Computer Science Solutions for Exercise - Disha Expert Team Solutions for Chapter: Data Structures, Exercise 1: Exercise

Attempt the practice questions on Chapter 7: Data Structures, Exercise 1: Exercise with hints and solutions to strengthen your understanding. Professional Knowledge for IBPS & SBI Specialist IT Officer Exam solutions are prepared by Experienced Embibe Experts.

Questions from Disha Expert Team Solutions for Chapter: Data Structures, Exercise 1: Exercise with Hints & Solutions

MEDIUM
HSSC Clerk
IMPORTANT

If the address of A[l][l] and A[2][1] are 1000 and 1010 respectively and each element occupies 2 bytes then the array has been stored in _____ order.

HARD
HSSC Clerk
IMPORTANT

Which of the following statement is not FALSE?

MEDIUM
HSSC Clerk
IMPORTANT

Match the following:

A. Strassen's matrix multiplication algorithm. (p) Greedy method multiplication algorithm.
B. Kruskal's minimum weight spanning tree algorithm. (q) Dynamic programming.
C. Bi-connected components algorithm. (r) Divide and Conquer.
D. Floyd's shortest path algorithm. (s) Depth first search path algorithm.

Codes:

HARD
HSSC Clerk
IMPORTANT

Which of the following parsing methods can not handle left recursive grammars?

EASY
HSSC Clerk
IMPORTANT

Let A = 1, 2, 5, 8, 11 Which of the following is false?

MEDIUM
HSSC Clerk
IMPORTANT

An instruction that can be recognized and used without translation must be written in _____.

HARD
HSSC Clerk
IMPORTANT

Each array declaration need not give, implicitly or explicitly, the information about _____.

HARD
HSSC Clerk
IMPORTANT

A_____is an acyclic digraph, which has the only node with in-degree 0, and other nodes are in degree1.