What is the time and space complexity to delete a node from the singly linked list?

• Time complexity: O(1), Space complexity: O(1)

• Time complexity: O(1), Space complexity: O(n)

• Time complexity: O(n), Space complexity: O(1)

• Time complexity: O(n), Space complexity: O(n)

Answer explanation

option(c) :Time complexity: O(n), Space complexity: O(1) Explanation. To search for the node, we need to traverse the full linked list; hence time complexity will be O(n), and space complexity will be O(1). As to keep track, we only require a temp variable.

How many edges are present in the complete graph of n vertices?

• n(n-1)/2

• n(n+1)/2

• n

• n/2

Answer explanation

Ans. (a) n(n-1)/2 Explanation. n complete graph, all the edges are connected to each other; hence the maximum number of edges is calculated by nC2, which is equal to n(n-1)/2.

What is the cost of searching for an AVL tree?

• O(n)

• O(log (n))

• O(n*n)

• O(n*log(n))

Answer explanation

Ans. (b) O(log(n)) Explanation. AVL tree is a balanced tree. First, we check the current node value and then recur the left or right subtree accordingly. The number of comparisons is limited by height n; the time complexity is O(log(n)).

When was C programming invented?

• 1987

• 1967

• 1997

• 1977

What is the output of the following code?

def func(x=[]):

x.append(1)

return x

print(func())

print(func())

• [1] [1]

• [1] [1, 1]

• [1, 1] [1, 1]

• [1] [1] [1] [1]

What will be the output of the following code

• 1 2 3 4 5

• 1 2 3 4

• 2 3 4 5

• 5 4 3 2 1

The complexity of linear search algorithm is___

• 0(n)

• 0(log n)

• 0(n2)

• 0(n log n)

Answer explanation

explanation: the worst case complexity of linear search is 0(n)

URL stands for _______________

• Uninterrupted data locator

• Uninterrupted record locator

• Uniform record locator

• Uniform resource locator

What is a process in the context of an operating system?

• A collection of hardware components

• A program in execution

• A static piece of code

• A type of network protocol

What is the purpose of database normalization?

• To speed up queries

• To reduce redundancy and improve data integrity

• To allow for more complex queries

• To simplify database design