Chandigarh University

• CSE DATA STRUC

• DATA STRUCTURE IMPORTANT MCQ QUESTIONS Kindly read the instructions carefully 1. All these questions are important for examination and interview point of view, so practice them well. 2. If you have any doubt or facing any problem regarding these questions you can mail us at [email protected] or drop a message in our WhatsApp or telegram group. 3. If you want to support us, give your valuable feedback so that next time we can improve while interacting with you. 4. If you found any kind of discrepancy or any answer wrong you through social media handles may contact. 5. These questions are verified by our sources but if any answers get wrong it’s all up to you. 6. Reminder-Practice all questions well it will build your concept clear and you can easily score good in your exams. Connect with us • If you want to join our WhatsApp community then mail us at: - [email protected] • Join our Telegram group: - https://t.me/coderslodgeofficial • Like our Facebook page: - https://www.facebook.com/coderslodge • Follow us on Instagram: - https://www.instagram.com/coderslodge/ • Follow us on Twitter: - https://twitter.com/CodersLodge • Follow us on LinkedIn:- https://www.linkedin.com/company/coderslodge 1. Each Node contain minimum two fields one field called data field to store data. Another field is of type _________. a. Pointer to Character b. Pointer to Node c. Pointer to an Integer d. Pointer to Class 2. In a circular linked list a. Components are all linked together in some sequential manner. b. There is no beginning and no end. c. Components are arranged hierarchically. d. Forward and backward traversal within the list is permitted. 3. A Linear Collection of Data Elements Where the Linear Node Is Given by Means of Pointer Is Called _________ a. Graph b. Array c. Linked List d. All of the above 4. Each node in a linked list has two pairs of ………….. and ………………. a. Link field and information field b. Link field and avail field c. Avail field and information field d. Address field and link field 5. ………… is very useful in situation when data have to stored and then retrieved in reverse order. a. Stack b. Queue c. List d. Link list 6. Which of the following is true in case of a null pointer? a. Marks the end of a node. b. Is equal to '\0' in C. c. Is the address of some node. d. is also called the void pointer in C. 7. Which of the following case does not exist in complexity theory? a) Best case b) Worst case c) Average case d) Null case 8. Two dimensional arrays are also called A. tables arrays B. matrix arrays C. both of above D. none of abov