Disha Expert Team Solutions for Chapter: Practice Sets, Exercise 7: PRACTICE SET - 7

Author:Disha Expert Team

Disha Expert Team Computer Science Solutions for Exercise - Disha Expert Team Solutions for Chapter: Practice Sets, Exercise 7: PRACTICE SET - 7

Attempt the free practice questions on Chapter 16: Practice Sets, Exercise 7: PRACTICE SET - 7 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: Practice Sets, Exercise 7: PRACTICE SET - 7 with Hints & Solutions

MEDIUM
HSSC Clerk
IMPORTANT

Which of the following algorithm can be used to sort n integers in the range (1,...........n2) in O(n) time?

EASY
HSSC Clerk
IMPORTANT

Booth algorithm for integer multiplication gives the worst performance when the multiplier pattern is _____.

EASY
HSSC Clerk
IMPORTANT

What can be said about the array representation of a circular queue when it contains only one element?

MEDIUM
HSSC Clerk
IMPORTANT

Which of the following algorithms solves the all-pair shortest path problem?

MEDIUM
HSSC Clerk
IMPORTANT

If the non-terminal on the left-hand side is repeated as the first symbol of the right-hand side. The phenomenon is called _____.

MEDIUM
HSSC Clerk
IMPORTANT

The _____ device provides a digital interface for connecting routers and digital circuits.

MEDIUM
HSSC Clerk
IMPORTANT

What error are you likely to get when you run the following program? 
main()
{
struct emp;
{
char name [20];
float sal;
}
struct emp e[10]
OJ; i
nti;
for (i = 0; i < = 9; i ++) 
scanf("%s%f', e[i]. na e & e [i]. sal));
}