MANGALORE UNIVERSITY COMPUTER SCIENCE TEACHERS’ ASSOCIATION III SEMESTER BCA DATA STRUCTURES Question Bank PART A Two Mark Questions 1.Define Data structure. Give classification of data structure. 2.Define Linear and non-linear data structures. 3.What are the main two types of data structures? Explain briefly. 4.Differentiate primitive and non-primitive data structure. 5.Give 2 examples for non linear data structure 6.What is the difference between linear and non linear data structure? 7.Distinguish algorithms with sub algorithms. 8.What are the 3 types of control structures used in algorithms. 9.Write any two algorithmic notations with example. 10.Define Abstract Data Type (ADT). Give one example. 11.Find the value of ⌈7.5⌉, ⌊7.5⌋, ⌊−7.5⌋, ⌈−7.5⌉,⌊√30⌋,⌈√30⌉,⌊-18⌋,⌈-18⌉,⌊ߨ⌋,⌈ߨ⌉12.Find 26(mod 7), 495(mod 11), -26(mod 7), -371(mod 8)13.Find ⌊logଶ1000⌋,logଶଵଵ, logଶ32.14.List and explain some string operations.15.What is an array? Give the formula to find the location of a particular element in one dimensional array. 16.Write an algorithm to traverse a linear array. 17.Mention various ways of representing two dimensional arrays in the memory. 18.What do you mean by base address of an array? Give example. 19.Give the formulae to find the address of a particular location in a two dimensional array. 20.Give two advantages of linked list over arrays. 21.What is Sparse Matrix? 22.What is meant by the term overflow and underflow? 23.What is linked list? 24.What do you mean by garbage collection? 25.What do you mean by dynamic memory allocation? 26.What role does the AVAIL list play in a linked list? 27.Write an algorithm to print information of all the nodes in the linked list. 28.Draw the structure of a doubly linked list and circular linked list. 29.How is singly linked list terminated? Give diagram. 30.Write one advantage and one disadvantage of linked list over arrays. 31.What is a circular linked list? Give diagrammatic representation. 32.What is a doubly linked list? 33.Mention any two types of linked list. 34.What are the advantages of doubly linked list? 35.Mention any 2 applications of linked list. 36.What is a doubly linked list? What is the advantage over singly linked list? 37.Give diagrammatic representation of singly linked list and doubly linked list.
38.Write an algorithm to check for stack full. 39.Write an algorithm to check for stack empty. 40.Give algorithm for POP operation of stack. 41.Give algorithm for PUSH operation of stack. 42.Why stack is called LIFO list? 43.What is LIFO list? Mention its applications. 44.Mention any two applications of STACK. 45.What is a queue? Why queue is called FIFO list? 46.Give any two examples for STACK. 47.Give any two examples for QUEUE. 48.How does STACK differ from QUEUE? 49.Differentiate queue and circular queue. 50.What are the applications of the QUEUE.
- Fall '19
- raja moorthy