
DS QUIZ-1

Quiz
•
Computers
•
University
•
Hard
Ms.N.Deepika - PSG CT
FREE Resource
10 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
1. Which of the following is the correct way to initialize a 2D array of size 2x3 with all elements set to 0 in C?
A) int arr[2][3] = {0};
B) int arr[2][3] = {1};
int arr[2][3] = {0, 1, 2, 3, 4};
D) int arr[2][3] = {0, 0, 0};
2.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
2. Given an array of integers, what is the best approach to find the largest element in the array?
A) Use a binary search algorithm.
B) Traverse the array once, keeping track of the largest element found.
C) Sort the array and select the last element.
D) Use a hash table to store and find the largest element.
3.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
3. You are given an array containing n integers, where each integer is between 1 and n+1. One integer is missing. What is the time complexity to find the missing integer?
A) O(n)
B) O(n log n)
C) O(1)
D) O(n^2)
4.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
4. Which advantage does a linked list have over an array when dealing with dynamic data sizes?
A) Linked lists have better cache performance.
B) Linked lists use less memory per element.
C) Linked lists can grow and shrink in size more efficiently without resizing or reallocating.
D) Linked lists offer constant time access to elements.
5.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
5. What is the time complexity of merging two sorted singly linked lists into a single sorted linked list?
A) O(n + m)
B) O(n * m)
C) O(n)
D) O(m)
6.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
6. What is the optimal approach to swap every two adjacent nodes in a singly linked list?
A) Use a stack to store nodes and swap adjacent nodes.
B) Use a dummy node and swap pairs iteratively.
C) Reverse the entire list and then swap adjacent nodes.
D) Use a recursive function to swap nodes in pairs.
7.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
7. Inserting a new node before a given node temp in a doubly linked list involves which of the following steps?
A) Update temp->prev->next to point to the new node, set newNode->prev to temp->prev, and newNode->next to temp.
B) Update temp->prev->next to point to the new node, set newNode->prev to temp, and newNode->next to temp->next.
C) Set newNode->prev to temp->prev, newNode->next to temp, and update temp->prev and temp->next.
D) Set newNode->prev to temp->prev, newNode->next to temp, and update temp->prev and temp->next
Create a free account and access millions of resources
Similar Resources on Wayground
10 questions
Structure in C

Quiz
•
University
13 questions
Data Structure and Algorithms Semi-Final Examination

Quiz
•
University
10 questions
DS UNIT-2 TEST-3

Quiz
•
University
13 questions
DSA Day 2

Quiz
•
University
7 questions
DSA Day 4

Quiz
•
University
15 questions
Stack??

Quiz
•
University
15 questions
DATA STRUCTURES QUIZ

Quiz
•
University
15 questions
Quiz Struktur Data

Quiz
•
University
Popular Resources on Wayground
50 questions
Trivia 7/25

Quiz
•
12th Grade
11 questions
Standard Response Protocol

Quiz
•
6th - 8th Grade
11 questions
Negative Exponents

Quiz
•
7th - 8th Grade
12 questions
Exponent Expressions

Quiz
•
6th Grade
4 questions
Exit Ticket 7/29

Quiz
•
8th Grade
20 questions
Subject-Verb Agreement

Quiz
•
9th Grade
20 questions
One Step Equations All Operations

Quiz
•
6th - 7th Grade
18 questions
"A Quilt of a Country"

Quiz
•
9th Grade