Scribd
Upload
30 views2 pages

MSCIT 101 Data Structure and Algorithms Assignment - II

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 various data structures such as arrays, stacks, queues, linked lists, and sorting algorithms, along with multiple-choice questions related to these topics. The assignment is structured into three questions with specified marks for each.

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
30 views2 pages

MSCIT 101 Data Structure and Algorithms Assignment - II

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 various data structures such as arrays, stacks, queues, linked lists, and sorting algorithms, along with multiple-choice questions related to these topics. The assignment is structured into three questions with specified marks for each.

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 – II
Course Code: MSCIT-101
Course Name: Data Structure and Algorithms
Total: 30

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


A) Explain Array Data Structure with Example.
B) Explain Stack Data Structure with Example.

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


A) List out various types of Queue Data Structure and Explain Operations
on Queue Data Structure.
B) How to insert an element in singly Linked List? Explain with example.
C) What are various types of Linked List? Explain in brief.
D) Explain Bubble Sort with Example.

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


1. Which of the following is non-liner data structure?
A) Stack B) List
C) String D) Tree
2. To represent hierarchical relationship between elements, which data structure is
suitable?
A) Dequeue B) Priority
C) Tree D) Graph
3. The elements of a linked list are stored
A) In a structure
B) In an array
C) Anywhere the computer has space for them
D) In contiguous memory locations
4. Which of following data structure is more appropriate for implementing quick
sort iteratively?
A) Deque B) Stack
C) Queue D) Priority Queue
5. Finding the location of a given item in a collection of items is called
A) Discovering B) Finding
C) Mining D) Searching

You might also like