DATASTRUCTURES FOR DS
Authored by Mahaboob Shaik
Computers
University
Used 1+ times
AI Actions
Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...
Content View
Student View
15 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
How to access value of 2nd element in an array?
*arr+2
*(arr+1)
*arr+1
&arr[1]
2.
MULTIPLE CHOICE QUESTION
20 sec • 1 pt
Advantage of Linear(Array) Representation
Elements can be accessed easily
can not increase/decrease size of array
insertion and deletion is easy in array
None of the above
3.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
which of the following causes reference to the element beyond boudary of array?
int *p1=(int *) malloc(20);
p1[5]=10;
int arr[5];
arr[4]=100;
int arr[5];
int *p=arr+2;
p[2]=100;
None of the above
4.
MULTIPLE CHOICE QUESTION
20 sec • 1 pt
Memory Leakage leads to
restart of the program
starvation
Memory release
memory allotment
5.
MULTIPLE CHOICE QUESTION
20 sec • 1 pt
Which is the primitive data structure in the following
linked list
Tree
Stack
Pointer
6.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Output of the following code?
char arr[]=[97,100,97,97,0];
printf("%s",arr);
971009797
9710097970
adaa
Error
7.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Output of the following code
int arr[7]={0};
int *p=arr+3;
printf("%d",p[3]);
0
3
1
6
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?
