data structures using define data structures give some examples in how many ways can you categorize data structuresexplain each of them discuss the applications of data structures write short note on different operations that can be performed on data structures compare linked list with an array write short note on abstract data type explain the different types of data structures also discuss their merits and demerits define an algorithm explain its features with the help of suitable examples explain and compare the approaches for designing an algorithm what is modularizationgive its advantages write brief note on trees as data structure what do you understand by graph explain the criteria that you will keep in mind while choosing an appropriate algorithm to solve particular problem what do you understand by time-space trade-off what do you understand by the efficiency of an algorithm how will you express the time complexity of given algorithm discuss the significance and limitations of the big notation discuss the best caseworst caseaverage caseand amortized time complexity of an algorithm categorize algorithms based on their running time complexity give examples of functions that are in big notation as well as functions that are not in big notation explain the little notation give examples of functions that are in little notation as well as functions that are not in little notation differentiate between big and little notations explain the notation give examples of functions that are in notation as well as functions that are not in notation explain the th notation give examples of functions that are in th notation as well as functions that are not in th notation explain the notation give examples of functions that are in notation as well as functions that are in notation differentiate between big omega and little omega notations show that ( show that + + ( prove that ( show that (lg prove that ( show that / th( multiple-choice questions which data structure is defined as collection of similar data elements(aarrays (blinked lists (ctrees (dgraphs the data structure used in hierarchical data model is (aarray (blinked list (ctree (dgraph in stackinsertion is done at (atop (bfront (crear (dmid the position in queue from which an element is deleted is called as (atop (bfront (crear (dmid which data structure has fixed size(aarrays (blinked lists (ctrees (dgraphs if top max- then that the stack is (aempty (bfull (ccontains some data (dnone of these which among the following is lifo data structure(astacks (blinked lists (cqueues (dgraphs which data structure is used to represent complex relationships between the nodes(aarrays (blinked lists (ctrees (dgraphs examples of linear data structures include (aarrays (bstacks (cqueues (dall of these the running time complexity of linear time algorithm is given as (ao( (bo( (co( log (do(