BCA C Lab Component

BCA C Lab Component

University

15 Qs

quiz-placeholder

Similar activities

Unit 8: Maintain Business Resources

Unit 8: Maintain Business Resources

University

10 Qs

Tutorial 3: The Project Management Process Group

Tutorial 3: The Project Management Process Group

University

15 Qs

Business Finance (2)

Business Finance (2)

University

14 Qs

Memahami gambarajah fasa.

Memahami gambarajah fasa.

University

15 Qs

APARATO CIRCULATORIO

APARATO CIRCULATORIO

University

10 Qs

Interprocess communication

Interprocess communication

University

19 Qs

INTR. SEGUNDO PERIODO

INTR. SEGUNDO PERIODO

University

16 Qs

Catalyst Characterization: Chemical Techniques

Catalyst Characterization: Chemical Techniques

University

10 Qs

BCA C Lab Component

BCA C Lab Component

Assessment

Quiz

Other

University

Practice Problem

Medium

Created by

Roopak Sam Varghese (RCSS)

Used 2+ times

FREE Resource

AI

Enhance your content in a minute

Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...

15 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

If a stack is implemented using an array, what happens when the stack becomes full?

Elements are overwritten
Memory is dynamically increased
Stack Overflow occurs
Stack resets

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following conditions indicates that a circular queue is full when using an array?

Front == Rear
Front == (Rear + 1) % Size
Rear == (Front + 1) % Size
Front + Rear == Size - 1

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

In a circular queue, how is the next position of rear calculated after insertion?

rear = rear + 1
rear = rear - 1
rear = (rear + size - 1) % size
rear = (rear + 1) % size

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

In a double-ended queue (Deque), insertion and deletion are allowed at:

Only front
Only rear
Both front and rear
None of the above

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the advantage of a linked list over an array?

Dynamic memory allocation
Efficient random access
Fixed memory size
All of the above

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

In a circular linked list, which of the following is true?

The last node points to NULL
The last node points to the first node
The first node points to itself
All nodes point to NULL

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

In a doubly linked list, each node contains:

A pointer to the next node
Two pointers: one to the next node and one to the previous node
A pointer to the previous node
No pointers at all

Create a free account and access millions of resources

Create resources

Host any resource

Get auto-graded reports

Google

Continue with Google

Email

Continue with Email

Classlink

Continue with Classlink

Clever

Continue with Clever

or continue with

Microsoft

Microsoft

Apple

Apple

Others

Others

Already have an account?