## Capgemini Data structures and algorithms MCQ

In this article, we will discuss the new pattern of questions in the Data structures and algorithms section. So, let’s start. And if you have any queries regarding the Capgemini Data structures and algorithms MCQ Question then please feel free to comment below so that we can discuss it here.

Capgemini has changed its entire curriculum for hiring in 2022. This article has been updated to reflect the most recent Capgemini Placement Papers and Solutions 2022.

They have removed some sections of their placement process and added some new ones, so make sure you read the entire article.

A good data structure is the backbone of any successful application. Data structures such as stacks, queues, and hash tables are fundamental to computer science and will be familiar to anyone who has studied programming or algorithms before.

### The latest Capgemini pseudo-code is divided into two parts.

1. Data Structures
2. Algorithm

Question 1 : Linked list are more efficient than arrays in which of the following?

Options :

a. Sequential access

b. all of the mentioned options

c. Element rearranging

d. Random access

`Answers : `

Question 2 : if you are using Bubble sort for sorting the given numbers in ascending order then find out the number of swapings needed 15, 18, 4, 11, 17

Options :

a. 7

b. 5

c. 6

d. 8

`Answers : `

Question 3 : Which of the following are the applications of stack data structure?

1. Implementation of recursive function

2. Reversing a string

3. Scheduling

Options :

a. 1 & 3

b. 1 & 2

c. 1, 2 & 3

d. 2 & 3

`Answers : `

Question 4 : By using of the following data structure you can create a circular queue?

3. Arrays

Options :

a. 1 & 3

b. 2 & 3

c. 1, 2, & 3

d. 1 & 2

`Answers : `

Question 5: Determine which of the given sequence of degree of vertices is graphic.

I. (1,2,3,3)

II.(2,3,3,3)

(Note: A sequence is graphic if there is a simple graph with the degree sequence.)

Options :

a. Both I and II

b. Neither I Nor II

c. Only II

d. Only I

`Answers : `