Question 1:• 1) A-ONE of the following is a None Primitive Data Structure.• a) integer> 2)...is a storing method of strings data structure in which each tine is viewed as arecord, where al records Have the same length.• a) Fixed Length Representationb) Pointerc) Arraysb) Linked List Representatione) Variable Length Representation• 3) A sparse array has 30 elements and 24 zeros elements, its sparsity is• a) 30/24• 4) The postfix notation of the infix expression: P+Q*R is• a) RQP+*• 5...is a sequence of data structure, which are connected together via pointers.• a) Stack• 6)..is an abstract data structure technique which insert and remove data using LIFOb) 24/30c)1/(24+30)b) PQR+*c) PQR*+b) Linked Listc) queuemethodology• a) Queueb) Hash TableC) Stack > 7)....one of the following function get the element at the front of the queuewithout removing it• A) push ()b) peek ()c) Dequeue ()• 8)...is a divide and conquer search algorithm which has runtime complexity o (Log n)c) Jump search• a) Binary searchb) Linear search> 9) Data Items can added or removed from the middle of the list in ay Arrays• a) arrayb) Stackc) Linked lists

Question 1) Answers: 1) Option(c) 2) Option(a) 3) Option(b) Reasons are given below.

Question 1: 1) A-ONE of the following is a None Primitive Data Structure. a) integer b) Pointer c) Arrays 2)...is a storing method of strings data struUcture in which each tine is viewed as a record, where al records Have the same length. a) Fixed Length Representation b) Linked List Representation e) Variable Length Representation 3) A sparse array has 30 elements and 24 zeros elements, its sparsity is a) 30/24 b) 24/30 c)1/(24+30)

Question 1: 1) A-ONE of the following is a None Primitive Data Structure. a) integer b) Pointer c) Arrays 2)...is a storing method of strings data struUcture in which each tine is viewed as a record, where al records Have the same length. a) Fixed Length Representation b) Linked List Representation e) Variable Length Representation 3) A sparse array has 30 elements and 24 zeros elements, its sparsity is a) 30/24 b) 24/30 c)1/(24+30)

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

Similar questions

3. Selection Sort• The idea in a selection sort is that you locate the largest item out of a set ofunsorted items, and move it into position at the end of the unsorted items. Asorted region grows one item at a time, while an unsorted region shrinks.• As done in Part 1, fill an array with random numbers.• Write a function that locates the largest element in the portion of the arraybeginning at the start of the array, up to a given index, and swaps the largestitem with the item at the given index.• E.g. If searching a[0] to a[7] locates the largest item at a[4], a[4] and a[7] would beswapped.• Write a second function that calls the first function repeatedly, until the entirearray is sorted. (Each time the first function is called, it will search one fewerelement)
C program
T/F 9) All dimensions of a two-dimensional array must have the same number of components, as seen in[10][10].
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)…
Question 1: Array offset computation Compiling code that accesses an element of an array involves computing the base address of the array and the offset from that address to the specified element. The offset to array elements must always be computed statically. O (a) True O (b) False Save
pyhton program -Let A be an array with arbitrary length. What is the syntax for shifting A by 5 steps to the left (note the direction)?