Data structure using c (DSU) 22317 MCQ pdf with Answers

By proguy -

DSU MCQ DSU MCQ

Here you will get all Msbte dsu MCQ 22317 for the i-scheme computer diploma polytechnic known as "DSU MCQ".MSbte notes provide all semester and all branches MCQ so, Students should download msbte DSU MCQ pdf. We have covered all topics with all MCQ. Data structure mcq is topics are as follows :

3)Stack and Queue MCQ MSBTE:

In this Question bank, we had covered stack, stack operations, Queue and its operation, etc. Most of the questions are too much detail that can help in studies.

 3. Stack and Queue

 

1) Linked lists are best suited …..

A. for relatively permanent collections of data.

B. the size of the structure and the data in the structure are constantly changing.

C. data structure

D. for none of the above situation

2) The operation of processing each element in the list is known as ……

A. sorting

B. merging

C. inserting

D. traversal

 

3) The situation when in a linked list START=NULL is ….

A. Underflow

B. Overflow

C. Houseful

D. Saturated

 

4) Each node in singly linked list has …….. fields.

A. 2

B. 3

C. 1

D. 4

5) Which of the following are two-way lists?

A. Grounded header list

B. Circular header list

C. Linked list with header and trailer nodes

D. List traversed in two directions

 

6) Which is the pointer associated with the availability list?

A. FIRST

B. AVAIL

C. TOP

D. REAR

 

7) Value of first linked list index is ….

A. 0

B. 1

C. -1

D. 2

 

8) In linked lists, there are no NULL links in

A. single linked list

B. linear doubly linked list

C. circular linked list

D. linked list

9) Each node in a linked list must contain at least …..

A. Three fields

B. Two fields

C. Four fields

D. Five fields

 

10) The dummy header in linked list contain …..

A. first record of the actual data

B. last record of the actual data

C. pointer to the last record of the actual data

D. middle record of the actual data

 

11) In a linked list the ………. field contains the address of next element in the list.

A. Link field

B. Next element field

C. Start field

D. Info field

 

Table of Contents                   

READ ALSO: MCQ ON SEARCHING, MERGING AND SORTING METHODS IN DATA STRUCTURE

12) LLINK is the pointer pointing to the …

A. successor node

B. predecessor node

C. head node

D. last node

13) ………. refers to a linear collection of data items.

A. List

B. Tree

C. Graph

D. Edge

 

14) A run list is ……

A. small batches of records from a file

B. number of elements having same value

C. number of records

D. number of files in external storage

 

15) A …… indicates the end of the list.

A. Guard

B. Sentinel

C. End pointer

D. Last pointer

 

16) A …….. is a linear list in which insertions and deletions are made to from either end of the structure.

A. circular queue

B. random of queue

C. priority

D. dequeue

 

17) Indexing the …….. element in the list is not possible in linked lists.

A. middle

B. first

C. last

D. any where in between

 

18) A linear list in which the pointer points only to the successive node is ……

A. singly linked list

B. circular linked list

C. doubly linked list

D. none of the above

 

19) ………. may take place only when there is some minimum amount(or) no space left in free storage list.

A. Memory management

B. Garbage collection

C. Recycle bin

D. Memory management

 

20) A linear list in which the last node points to the first node is ……..

A. singly linked list

B. circular linked list

C. doubly linked list

D. none of the above

 

ANSWERS:

1) B. the size of the structure and the data in the structure are constantly changing.

2) D. traversal

3) A. Underflow

4) A. 2

5) D. List traversed in two directions

6) B. AVAIL

7) A. 0

8) C. circular linked list

9) B. Two fields

10) A. first record of the actual data

11) A. Link field

12) B. predecessor node

13) A. List

14) A. small batches of records from a file

15) B. Sentinel

16) D. dequeue

17) A. middle

18) A. singly linked list

19) B. Garbage collection

20) B. circular linked list

 

 

 

 

 

Download

  • Introduction to Data structure MCQ
  • ) Searching and sorting MCQ
  • Stack and Queue MCQ
  • Link list MCQ
  • Graphs and tree MCQ

    • Comments

    Post a Comment

    Popular posts from this blog

    Getting started with c programming (step-by-step) explanation

    By proguy -
    Image
    In the last session, we learned about what is C now; we will be learning some basics of c programming  so get your notebook and pen, and let's get started. Tabel of content: The c character set Constant, variable, and keyword Types of C constants Types of C constants C keywords This content is also available in audio file Your browser does not support the audio element. Communicating with a computer involves speaking the computer's language, which rules out English as a language of communication with the computer. However, there is an immediate difference between learning English and learning the c language. The best learning method is to understand the first alphabet, the alphabet combined to form a word, a word combined to form a sentence, and a sentence combined from the paragraph.                                         ...
    Read more

    22413 software engineering notes [ ⚠️] pdf | Msbte 4th semester diploma

    By proguy -
    Image
    Software Engincering is the foundation for professional processes to be followed involving principles. techniques, and practices for software development. The course provides a framework for software professionals for building quality assured software products. It cnables students to blend the domain specific knowledge with the programming skills to create quality sofiware products. we had noted all subject with topic wise placement be sure to download one-by-one 1)SEN Chapter 1 SEN Chapter 1 2)SEN Chapter 2 2)SEN Chapter 2 3)SEN Chapter 3 EN Chapter 3 4)SEN Chapter 4 SEN Chapter 4 4)SEN Chapter 4(part-1) SEN Chapter 4 5)SEN Chapter 5 SEN Chapter 5 5)SEN Chapter 5 SEN Chapter 5
    Read more

    22620 Network and Information Security NIS solved lab manual pdf

    By proguy -
    Image
    Computer network security is an important aspect of today’s world. Nowadays due to various threats designing security in an organization is an important consideration. It is essential to understand basic security principles, various threats to security, and techniques to address these threats.   The student will be able to recognize potential threats to confidentiality, integrity, and availability and also be able to implement various computer security policies. This course will introduce basic cryptographic techniques, fundamentals of computer/network security, Risks faced by computers and networks, security mechanisms, operating system security, secure System design principles, and network security principles. Also, it will create awareness about IT ACT and different Cyber laws. This course aims to help the student to attain the following industry identified competency through various teaching leaming experiences: 3. COURSE OUTCOMES (COs) The theory, practical experiences...
    Read more