Computer Science & Information Technology - Data Structures And Algorithms

The given definition describes which of the following terms?

Order the following algorithms by their complexity (ascending):

What is a graph in which every pair of distinct vertices are connected by a unique edge called?

Consider the following string: ALAMAKOTA, and pattern to be matched: AKO. By how many positions will the first shift be performed, using the bad character rule?

5

How many elements can be stored in a binary search tree of depth = 9?

6

For the given class, which of the following would be the best hashCode function implementation?

7

What will be the output of the following program?

8

What will be the output of the following program?

9

What is the result of the following expression in postfix notation? 40 10 / 4 * 20 +

10

Which of the following statements is true for a bubble sort structure?

11

What is represented by O(n) to Ω(n) to Θ(n)?

12

For the string text "The cat in the hat is fat on the mat now!" and the search pattern "dog" along with a performance operation of O(1), what is the search time using the Boyer-Moore algorithm?

13

What is the algorithm used in the following code?

14

What is the worst-case performance of the merge sort algorithm on a sorted list of elements?

15

What do Prim's algorithm and Kruskal's algorithm do after they take a graph?

16

For the array [ 99 3 57 93 8 9 7 71 1 ], what is the array arrangement after the first step in the insertion sort?

17

What is the Big-O for an algorithm that takes two arrays of equal size n, and returns true if the arrays are disjoint—no elements in common—by taking an element from the first array and then checking if it is in the second array?

18

Which algorithm sorts the following list [5 3 9 7] using the steps of: [5 3 9 7] -> [3 5 9 7] -> [3 5 9 7] -> [3 5 7 9] -> [3 5 7 9]?

19

Which data structure is used to convert an infix expression to prefix or postfix?

20

When do we use an adjacency list?

21

How is prime factorization a hard problem?

22

For the starting permutation [3, 57, 64, 54, 1, 35, 98], what are the steps to bubble sort into a sorted arrangement of [1, 3, 35, 54, 57, 64, 98]?

in Computer Science & Information Technology

a. [3, 57, 64, 54, 1, 35, 98] -> [3, 57, 54, 1, 35, 64, 98] -> [3, 54, 1, 35, 57, 64, 98] -> [3, 1, 35, 54, 57, 64, 98] -> [1, 3, 35, 54, 57, 64, 98] -> [1, 3, 35, 54, 57, 64, 98]
b. [3, 1, 35, 54, 57, 64, 98] -> [1, 3, 35, 54, 57, 64, 98] -> [1, 3, 35, 54, 57, 64, 98] -> [3, 57, 64, 54, 1, 35, 98] -> [3, 57, 54, 1, 35, 64, 98] -> [3, 54, 1, 35, 57, 64, 98]
c. [1, 3, 35, 54, 57, 64, 98] -> [3, 57, 64, 54, 1, 35, 98] -> [3, 1, 35, 54, 57, 64, 98] -> [1, 3, 35, 54, 57, 64, 98] -> [3, 57, 54, 1, 35, 64, 98] -> [3, 54, 1, 35, 57, 64, 98]
d. [1, 3, 35, 54, 57, 64, 98] -> [3, 54, 1, 35, 57, 64, 98] -> [3, 57, 64, 54, 1, 35, 98] -> [3, 1, 35, 54, 57, 64, 98] -> [1, 3, 35, 54, 57, 64, 98] -> [3, 57, 54, 1, 35, 64, 98] -> [1, 3, 35, 54, 57, 64, 98]

23

What data structure is a prime number used with?

24

Which of the following algorithms is a greedy algorithm?

25

What is the knapsack value for the given input?

26

Which of the following are the worst-case running times of insertion sort, merge sort, and quick sort respectively?

27

What is a graph without self loops and parallel edges called?

28

Consider the following string: KOTMAALE, and pattern to be matched: AALE. By how many positions will the first shift be performed, using the bad character and good prefix rules?

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.

Computer Science & Information Technology - Data Structures And Algorithms

Recent Packs