fill in the blanks data structures functions arrays data type root null considered apart from the detailed specifications or implementation input size amortized case index or subscript top peep or peek an attempt is made to insert an element in an arraystack or queue that is already full queue rearfront linear data structure program time complexity average case running time ( modules top down worst omega non-asymptotically is in multiple-choice questions ( ( ( ( ( ( true true false true false false true false true or false true true true true false true false fill in the blanks base address array of arrays index or subscript consecutive pointer data typenameand size the number of elements stored in it integral value fourth multiple-choice questions ( ( ( ( ( ( ( ( ( ( true false true true false false false true true false true or false false false false false true fill in the blanks null-terminated character array zero scanf( convert character into upper case when in dictionary order will come after strrev( morning index operation str is less than str puts null character consecutive - strlen