GATE CSE 2023 Paper 1 — page 5

Questions 13–15 of 65. Imported answers require review unless explicitly marked reviewed.

Let SLDel be a function that deletes a node in a singly-linked list given a pointer to the node and a pointer to the head of the list. Similarly, let DLDel be another function that deletes a node in a doubly-linked list given a pointer to the node and a pointer to the head of the list. Let n denote the number of nodes in each of the linked lists. Which one of the following choices is TRUE about the worst-case time complexity of SLDel and DLDel?

Your answerChoose one option.

SLDel is O(1) and DLDel is O(n)

Both SLDel and DLDel are O(log(n))

Both SLDel and DLDel are O(1)

SLDel is O(n) and DLDel is O(1)

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Consider the Deterministic Finite-state Automaton (DFA) shown below. The DFA runs on the alphabet

, and has the set of states

, with

being the start state and

being the only final state.

Diagram for Computer Science and Information Technology question 14

Which one of the following regular expressions correctly describes the language accepted by

Your answerChoose one option.

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

The Lucas sequence

is defined by the recurrence relation:

with

and

Which one of the options given is TRUE?

Your answerChoose one option.

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

2023 · Paper 1

Question 13

Question 14

Question 15