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

Let G be a directed graph whose vertex set is the set of numbers from 1 to 100. There is an edge from a vertex i to j if and only if either j = i + 1 or j = 3i. The minimum number of edges in a path in G from vertex 1 to vertex 100 is:
The following data fragment occurs in the middle of the data stream for which the byte stuffing algorithm is used: A B ESC C ESC FLAG ESC FLAG D. What is the output after stuffing?
Typically, e-mail systems support five basic functions. Arrange them in sequence.
(A) Displaying
(B) Transfer
(C) Composition
(D) Disposition
(E) Reporting
Choose the correct answer from the options given below:
The sequence of events that happen during a typical fetch operation is:
(A) MAR
(B) IR
(C) MDR
(D) Memory
(E) PC
Choose the correct answer from the options given below:
Consider a scenario in which DHCP clients and servers are on the same subnet. Here the communication between DHCP clients and servers will take place via:
In an HTTP request message, the first line is called:
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:
Consider the following statement(s) and choose the correct one.
1. PoP3 does not allow the user to organize his mail on the server.
2. In IMAP4, the user can search the contents of the email for a specific string of characters prior to downloading.
3. MIME is a supplementary protocol that allows ASCII data to be sent through email.
Choose the correct answer from the options given below:
Ten signals, each requiring 4000 Hz, are multiplexed onto a single channel using FDM. How much minimum bandwidth is required for the multiplexed channel? Assume that the guard bands are 400 Hz wide.
Match List I with List II;
LIST ILIST II
(A) Bucket sort(I) O(n²)
(B) Matrix chain multiplication(II) O(n³)
(C) Huffman codes(III) O(n log n)
(D) Dijkstra’s Algorithm(IV) O(n)
Choose the correct answer from the options given below:
Let A be the problem of finding a Hamiltonian cycle in a graph G = (V, E) with |V| divisible by 3, and B be the problem of determining if a Hamiltonian cycle exists in such graphs. Which one of the following is true?
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:
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:
Rank the following functions by order of growth (Highest running time to lowest running time):
1. n × 3^n
2. 2^log(n)
3. n^(2/3)
4. 4^n
5. 4^log(n)
Choose the correct answer from the options given below:
The worst-case time complexity of inserting a node in a doubly linked list is:
Consider the quicksort algorithm. Suppose there is a procedure for finding a pivot element which splits the list into two sub-lists, one of which contains one-fifth of the elements and the remaining elements are contained in the other sub-list. Let T(n) be the number of comparisons required to sort n elements. Then:
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?
Which of the following statement(s) is/are not true?
1. Optimal binary search tree construction can be performed efficiently using dynamic programming.
2. BFS cannot be used to find connected components of a graph.
3. Given the prefix and postfix walks over the binary tree, the binary tree cannot be uniquely constructed.
4. DFS can be used to find connected components of a graph.
Choose the correct answer from the options given below:
A list of n strings, each of length n, is sorted into lexicographic order using the merge-sort algorithm. The worst-case running time of this computation is:
Match List I with List II
LIST ILIST II
(A) Floyd-Warshall algorithm for all pair shortest paths(I) Divide and Conquer
(B) Prim’s algorithm(II) Greedy Paradigm
(C) Hamiltonian Circuit(III) Backtracking
(D) Merge Sort(IV) Dynamic Programming paradigm
Choose the correct answer from the options given below:
In which theorem \(a^{p−1} = 1 \) mod p where p is prime and a is a positive integer not divisible by p
Packet filtering firewalls are deployed on:
Computation of the discrete logarithm is the basis of the cryptographic system:
The best-known multiple-letter encryption cipher is:
In the DES algorithm, the round input is 32 bits, which is expanded to 48 bits via: