Answered: Section A: Multiple Choice Questions :…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

Section A: Multiple Choice Questions : Q1: Consider searching element 45 using binary search in an array A [ ] = { 23, 34, 45, 67, 78, 54, 87, 91 }. The returned index would be a) Index [0] b) Index [2] c) Index [3] d) None of these Q2: In the context of recursive search a) Recursion terminates when the item is found b) Same function is called again and again c) Slower than iterative search d) All options are correct Q3: Which one of the following is an approach for a systematic trial and error to search an item? a) Binary search b) Backtracking c) Recursion d) Iteration Q4: In terms of time efficiency, the following method is ____. public int function(int n) { int result = 1; for (int k = 1; k returnType methodName(methodParameters) c) methodModifiers returnType methodName (methodParameters) d) methodModifiers returnType methodName(methodParameters) Q8: Given a function f(n) = n2 + 20n on an input parameter n, which of the following is true a) f(n)=O(1) b) f(n)=O(n) c) f(n)=O(logn) d) f(n)=O(n3) Q9: A normal queue, if implemented using an array of size MAX_SIZE, gets full when- a) Rear = MAX_SIZE – 1 b) Front = (rear + 1)mod MAX_SIZE c) Front = rear + 1 d) Rear = front Q10: Consider the given function. The function grows at a __________ rate public static int search(int[] x, int target) { for(int i=0; i < x.length; i++) { if (x[i]==target) return i; } return -1; // target not found } a) Constant b) Logarithm c) Linear d) Quadratic

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 2 steps with 2 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions