Quiz - Computer Science & Information Technology - Data Structures And Algorithms

Which problem is resolved by distributed processing?

in Computer Science & Information Technology

a. Lack of security in decentralized processing
b. Lack of responsiveness in centralized processing
c. Lack of individuality in decentralized processing
d. Lack of coordination in centralized processing

data-structures-and-algorithms

b. Lack of responsiveness in centralized processing

Which of the following is false?

in Computer Science & Information Technology

A. If adjacency list representation of a graph is used, space is saved for sparse graphs.
B. DFS and BSF can be done in O(V + E) time for adjacency list representation.
C. Search whether a specific edge exists between any two vertices is shorter while using adjacency list representation.
D. Adding a vertex in adjacency list representation is easier than adjacency matrix representation.
E. DFS and BSF can be done O(V^2) time in adjacency matrix representation.

software-engineering
data-structures-and-algorithms

C. Search whether a specific edge exists between any two vertices is shorter while using adjacency list representation.

Buttons to insert logo, title, and date and time controls are found in this group on the Design tab.

in Computer Science & Information Technology

A. Controls.
B. Header / Footer.
C. Tools.

data-structures-and-algorithms

Answer: B. Header / Footer.

In linked list implementation of a queue, the important condition for a queue to be empty is?

in Computer Science & Information Technology

a) FRONT is null
b) REAR is null
c) LINK is empty
d) FRONT==REAR-1

data-structures-and-algorithms

Ans: a) FRONT is null

What is the process in which the Python virtual machine recycles its storage known as?

in Computer Science & Information Technology

A. tombstoning
B. garbage collection
C. trash expunging
D. data dumping

data-structures-and-algorithms

Ans: B. garbage collection

Given a graph with integer edge weights between 1 and 5 (inclusive), you want to find the shortest weighted path between a pair of vertices. How would you reduce this problem to the shortest unweighted path problem, which can be solved with breadth-first search (BFS).

in Computer Science & Information Technology

What will be an ideal response?

data-structures-and-algorithms

Answer: Replace each edge with weight i with a simple path of i edges each with weight 1. Then solve with BFS

Based upon the contents of the BOOKS table in the accompanying figure, which of the following SQL statements will retrieve all books published by the publisher assigned Pubid 4?

in Computer Science & Information Technology

data-structures-and-algorithms
sql

SELECT * FROM books WHERE pubid = 4;

The ____ operator calls up functions or changes the order in which individual operations in an expression are evaluated.

in Computer Science & Information Technology

a. []
b. ()
c. ?
d. .

data-structures-and-algorithms

Ans: b. ()

You have three hundred distinct items. How many bits would you need minimum to accommodate these three hundred distinct items?

in Computer Science & Information Technology

A: 8
B: 9
C: 10
D: 11
E: 12

information-technology
data-structures-and-algorithms

Answer: B: 9

It is 9 bits because 2^8=256 it will accomodate only 256 digits .and 2^9=512 means that it will accomdate 512 digits so with 9 bits we can represent these 300 bits .

In bucket hashing, collisions are postponed until ____.

in Computer Science & Information Technology

A. the program terminates
B. the data is committed
C. the bucket is full
D. the bucket is two thirds full

data-structures-and-algorithms

Answer: C

What type of search does the following function implement?bool aSearch (int list[ ], int last,int target, int* locn){ int looker; looker = 0; while (looker < last && target != list[looker]) looker++; *locn = looker; return ( target == list[looker] );}

in Computer Science & Information Technology

A. sequential search
B. sentinel search
C. ordered list search
D. binary search

data-structures-and-algorithms

Answer: A

Linked list collision resolution uses ____ storage area(s).

in Computer Science & Information Technology

A. one
B. two
C. three
D. four

data-structures-and-algorithms

Answer: B

We call the set of keys that hash to the same location in our list ____.

in Computer Science & Information Technology

A. duplicates
B. synonyms
C. errors
D. similarities

data-structures-and-algorithms

Answer: B

In the ____, each phase merges a constant number of input files into one output file.

in Computer Science & Information Technology

A. merge sort
B. natural merge
C. distribution merge
D. phase merge

data-structures-and-algorithms

Answer: B

The efficiency of the sequential search is ____.

in Computer Science & Information Technology

A. O(n)
B. O(n log n)
C. O(log n)
D. O(n/2)

data-structures-and-algorithms

Answer: A

The memory that contains all of the home addresses is known as the ____.

in Computer Science & Information Technology

A. home area
B. home address
C. prime area
D. collision area

data-structures-and-algorithms

Answer: C

Linked list collision resolution uses a separate area to store collisions and chains all synonyms together in a linked list.

in Computer Science & Information Technology

Answer the following statement true (T) or false (F)

data-structures-and-algorithms

True

Correct.

In rotation hashing the key is the address without any algorithmic manipulation.

in Computer Science & Information Technology

Answer the following statement true (T) or false (F)

data-structures-and-algorithms

False

Correct.

We must construct our binary search algorithm so that it stops when we have checked all possible locations.

in Computer Science & Information Technology

Answer the following statement true (T) or false (F)

data-structures-and-algorithms

True

Correct.

In the heap sort algorithm ____ is selected and exchanged with the last element in the unsorted list.

in Computer Science & Information Technology

A. the last element
B. a random element
C. the largest element
D. the smallest element

data-structures-and-algorithms

Answer: C

In the ____ sort, the list at any moment is divided into two sublists, sorted and unsorted, which are divided by an imaginary wall. We select the smallest element from the unsorted sublist and exchange it with the element at the beginning of the unsorted data.

in Computer Science & Information Technology

A. shell
B. quick
C. straight selection
D. heap

data-structures-and-algorithms

Answer: C

A characteristic of a sort pass is the placement of one or more elements in a ____.

in Computer Science & Information Technology

A. sorted list
B. stack
C. queue
D. search tree

data-structures-and-algorithms

Answer: A

The heap sort efficiency is ____.

in Computer Science & Information Technology

A. O(log n)
B. O(n log n)
C. O(n²)
D. O(n)

data-structures-and-algorithms

Answer: B

According to Knuth, the best general-purpose sort is ____.

in Computer Science & Information Technology

A. heap sort
B. shell sort
C. bubble sort
D. quick sort

data-structures-and-algorithms

Answer: D

Quick sort is most efficient when the pivot is located ____ of the array.

in Computer Science & Information Technology

A. in the beginning
B. in the middle
C. in the end
D. in the second to last position

data-structures-and-algorithms

Answer: B

The efficiency of the binary search is ____.

in Computer Science & Information Technology

A. O(n)
B. O(n log n)
C. O(log n)
D. O(n/2)

data-structures-and-algorithms

Answer: C

The ____ identifies the sequence of the sorted data.

in Computer Science & Information Technology

A. sort key
B. hash key
C. sort order
D. sorting algorithm

data-structures-and-algorithms

Answer: C

Shell sort has only two additional complexities over the straight insertion sort. First, rather than a single array, we have an array of partitions. Second, whenever an exchange is made, ____.

in Computer Science & Information Technology

A. two swap operations are needed
B. the array needs to be traversed
C. a recursive call is made
D. we must fall back and verify the order of the partition

data-structures-and-algorithms

Answer: D

In the heap sort implementation, once the heap has been created, we exchange the element at the top of the heap with the last element in the heap and adjust the heap size ____.

in Computer Science & Information Technology

A. up by 1
B. down by 1
C. up by 2
D. down by 2

data-structures-and-algorithms

Answer: B

Each traversal of the whole or partial list of data during the sorting process is referred to as a "sort pass".

in Computer Science & Information Technology

Answer the following statement true (T) or false (F)

data-structures-and-algorithms

True

Correct.

Most of the work spent ordering large files is not sorting but actually merging.

in Computer Science & Information Technology

Answer the following statement true (T) or false (F)

data-structures-and-algorithms

True

Correct.

A balanced merge uses a variable number of input merge files and the same number of output merge files.

in Computer Science & Information Technology

Answer the following statement true (T) or false (F)

data-structures-and-algorithms

False

Correct.

In shell sort, no increment size is best for all situations.

in Computer Science & Information Technology

Answer the following statement true (T) or false (F)

data-structures-and-algorithms

True

Correct.

In the merging of a file, the process of copying a consecutive series of records to the merge output file after a stepdown in the alternate merge input is known as a rollout.

in Computer Science & Information Technology

Answer the following statement true (T) or false (F)

data-structures-and-algorithms

True

Correct.

When we push a vertex into the stack, we set its processed flag to 1, indicating that it ____.

in Computer Science & Information Technology

A. has been processed
B. has been visited
C. is in the stack awaiting its turn
D. should be ignored from now on

data-structures-and-algorithms

Answer: C

An algorithm with an O(n²) efficiency is more efficient than one with O(n log n) efficiency.

in Computer Science & Information Technology

Answer the following statement true (T) or false (F)

data-structures-and-algorithms

False

Correct.

The heap sort algorithm is an improved version of the shell sort.

in Computer Science & Information Technology

Answer the following statement true (T) or false (F)

data-structures-and-algorithms

False

Correct.

The shell sort efficiency is O(n²).

in Computer Science & Information Technology

Answer the following statement true (T) or false (F)

data-structures-and-algorithms

False

Correct.

A minimum spanning tree is a spanning tree in which the total weight of the lines is guaranteed to be the minimum of all possible trees in the graph.

in Computer Science & Information Technology

Answer the following statement true (T) or false (F)

data-structures-and-algorithms

True

Correct.

Dijkstra's algorithm is similar to the minimum spanning tree algorithm.

in Computer Science & Information Technology

Answer the following statement true (T) or false (F)

data-structures-and-algorithms

True

Correct.

The major limitation of using an array to store the vertices and edges of a graph is that ____.

in Computer Science & Information Technology

A. it is not as fast as a linked list
B. it uses more memory space
C. traversing it is slow
D. the number of vertices must be known in advance

data-structures-and-algorithms

Answer: D

If the graph is ____, the intersection in the adjacency matrix indicates the direction.

in Computer Science & Information Technology

A. disjoint
B. a tree
C. undirected
D. directed

data-structures-and-algorithms

Answer: D

A graph is said to be a(n) ____ if it is not connected.

in Computer Science & Information Technology

A. collection of edges
B. disjoint graph
C. unconnected graph
D. set of edges and vertices

data-structures-and-algorithms

Answer: B

When we traverse a graph, we must somehow ensure that we ____.

in Computer Science & Information Technology

A. process the data on each vertex only once
B. visit each edge only once
C. do not forget to process the data on one or more vertices
D. process the data on the unconnected vertices

data-structures-and-algorithms

Answer: A

In a graph implementation, it is advisable to identify each vertex by its physical address rather than by its key value.

in Computer Science & Information Technology

Answer the following statement true (T) or false (F)

data-structures-and-algorithms

False

Correct.

The ____ vertex operation returns the data stored in a vertex.

in Computer Science & Information Technology

A. get
B. retrieve
C. obtain
D. peek

data-structures-and-algorithms

Answer: B

In an adjacency list, the weight of a line in a network is stored as the intersection value.

in Computer Science & Information Technology

Answer the following statement true (T) or false (F)

data-structures-and-algorithms

False

Correct.

In a graph, a segment is called a line.

in Computer Science & Information Technology

Answer the following statement true (T) or false (F)

data-structures-and-algorithms

True

Correct.

The problem with the lexical m-ary tree is that after a few levels it becomes very large. To prevent this, we ____ the tree; that is, we cut all of the branches that are not needed.

in Computer Science & Information Technology

A. cleanse
B. depurate
C. prune
D. fix

data-structures-and-algorithms

Answer: C

The maximum number of data entries in a node in a four-way tree is ____.

in Computer Science & Information Technology

A. two
B. three
C. four
D. five

data-structures-and-algorithms

Answer: B

When a vertex is inserted, it is disjoint.

in Computer Science & Information Technology

Answer the following statement true (T) or false (F)

data-structures-and-algorithms

True

Correct.

In a variation of a sequential search, we can put a target in the list by adding an extra element (sentinel entry) at the end of the array and placing the target in the sentinel. The sentinel is used to optimize the loop and determine after the loop completes whether we found actual data or the sentinel.

in Computer Science & Information Technology

Answer the following statement true (T) or false (F)

data-structures-and-algorithms

True

Correct.

Find your answers, solutions and more...

We made it much easier for you to find exactly what you're looking for on Sciemce. Enjoy our search engine "Clutch."

Save a GPA. Donate your notes with us.

Quiz - Computer Science & Information Technology - Data Structures And Algorithms

Recent Packs