Data Structures
Authored by VIJI S
Computers
University
Used 81+ times
AI Actions
Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...
Content View
Student View
20 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
How is an array initialized in C language?
int a[3] = {1, 2, 3};
int a = {1, 2, 3};
int a[] = new int[3]
int a(3) = [1, 2, 3];
2.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Which of the following is not the type of queue?
Priority queue
Single-ended queue
Circular queue
Ordinary queue
3.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
What will the output of the following code snippet?
void solve() {
int a[] = {1, 2, 3, 4, 5};
int sum = 0;
for(int i = 0; i < 5; i++) {
if(i % 2 == 0) {
sum += *(a + i);
}
else {
sum -= *(a + i);
}
}
cout << sum << endl;
}
15
syntax error
3
2
4.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Which of the following is not the type of queue?
Single-ended queue
Circular queue
Priority queue
Ordinary queue
5.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
How are String represented in memory in C?
LinkedList of characters.
The object of some class.
An array of characters.
Same as other primitive data types.
6.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
The depth of a complete binary tree is given by
Dn = log2n+1
Dn = n log2n+1
Dn = n log2n
Dn = log2n
7.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
In Binary trees nodes with no successor are called......
Final nodes
Last nodes
Terminal nodes
End nodes
Access all questions and much more by creating a free account
Create resources
Host any resource
Get auto-graded reports
Continue with Google
Continue with Email
Continue with Microsoft
or continue with
%20(1).png)
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?
