List of top Data Science A.I Cyber Security and Computer Sci. Questions on Programming and Data Structures

Match List I with List II
LIST ILIST II
(A) Circular Linked List(I) Recursive Function Calls
(B) Doubly Linked List(II) Round Robin Queue in CPU
(C) Stack(III) Hash Tables
(D) Singly Linked List(IV) Undo and Redo Functionality
Choose the correct answer from the options given below:
A hash function f defined as f(key) = key mod 7, with linear probing, is used to insert the keys 37, 38, 72, 48, 98, 11, 56 into a table indexed from 0 to 6. What will be the location of key 11?
The worst-case time complexity of inserting a node in a doubly linked list is:
Consider the given two statements:
S1: Kruskal’s Algorithm might produce a non-minimal spanning tree.
S2: Kruskal’s Algorithm can be efficiently implemented using the disjoint set data structure.
Choose the correct answer from the options given below:
Which of the following permutations can be obtained in the output (in the same order) using a stack assuming that the input is the sequence 1, 2, 3, 4, 5 in that order?
(A) 2
(B) 3
(C) 1
(D) 4
(E) 5
Choose the correct answer from the options given below: