0% found this document useful (0 votes)
73 views2 pages

MSCIT 101 Data Structure and Algorithms Assignment - I

The document is an assignment for the course MSCIT-101 on Data Structure and Algorithms from Dr. Babasaheb Ambedkar Open University. It includes questions on user-defined and library functions, string functions, differences between structures and unions, benefits of pointers, and sorting algorithms. Additionally, it contains multiple-choice questions related to data structure operations and principles.

Uploaded by

myemail11
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
73 views2 pages

MSCIT 101 Data Structure and Algorithms Assignment - I

The document is an assignment for the course MSCIT-101 on Data Structure and Algorithms from Dr. Babasaheb Ambedkar Open University. It includes questions on user-defined and library functions, string functions, differences between structures and unions, benefits of pointers, and sorting algorithms. Additionally, it contains multiple-choice questions related to data structure operations and principles.

Uploaded by

myemail11
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Dr.

Babasaheb Ambedkar Open University


Assignment – I
Course Code: MSCIT-101
Course Name: Data Structure and Algorithms
Total: 30

Q-1 Answer the following questions: (Any one) [10]


A) Write difference between User Defined Function and Library Function and
Give example of User Defined Function.
B) List out and explain various String Function and explain any one with example.

Q-2 Answer the following questions: (Any two) [10]


A) Write difference between Structure and Union.
B) Write benefits of using Pointer.
C) Write difference between Primitive and Non-primitive Data Structures.
D) Explain Quick Sort with Example.

Q-3 Attempt following Multiple Choice Questions: [10]


1 From following which is not the operation of data structure?
A) Operations that manipulate data in some way
B) Operations that perform a computation
C) Operations that check for syntax errors
D) Operations that monitor an object for the occurrence of a controlling event
2. Which of the following principle does Queue use?
A) LIFO principle B) FIFO principle
C) Linear tree D) Ordered array
3. Which one of the following is the process of inserting an element in the stack?
A) Insert B) Add
C) Push D) None of these
4. What is the disadvantage of array data structure?
A) The amount of memory to be allocated should be known be forehand
B) Elements of an array can be accessed in constant time.
C) lements are stored in contiguous memory blocks
D) Multiple other data structures can be implemented using array.
5. Which of the following data structures allow insertion and deletion from both
ends?
A) Stack B) Deque
C) Queue D) Strings

You might also like