Data structures and algorithms unit i

Data structures and algorithms unit i

• 1.
  Data Structures andAlgorithms Unit I Q. 01 # is____________ inC. A) Directive B) Keyword C) Character D) Constant Q. 02 C is ____________ programminglanguage. A) Case Sensitive B) NonCase sensitive C) Machine Level D) LowerLevel Q. 03 Whichfunctionisnot standardlibraryfunction? A) printf() B) scanf() C) getch() D) main() Q. 04 In C program there is/are ____________ main() function/functions A) 1 B) 2 C) 3 D) Many Q. 05 Whichis notstandard headerfile inC. A) stdio.h B) conio.h C) math.h D) array.h Q. 06 Whichis notthe primary/builtindatatype? A) char B) float C) int D) Array Q. 07 Whichis notderiveddatatype? A) structure B) union C) array D) Float Q. 08 Memorycan be sharedinwhichdata type? A) structure B) union C) integer D) Character Q. 09 Character needs_____ bytesand integerneeds____bits. A) 1,16 B) 2,8 C) 1,8 D) 2,32 Q. 10 Signedint/char/floatneed______ bitsto store signedinformation? A) 1 B) 2 C) 0 D) 8 Q. 11 What isrange of signedint? A) -32768 to +32767 B) 0 to 65535 C) 0 to 255 D) -128 to +127 Q. 12 What isrange of signedcharcter?
• 2.
  A) -32768 to+32767 B) 0 to 65535 C) 0 to 255 D) -128 to +127 Q. 13 Whichdata type will be requiredtostore 2.0 A) float B) int C) char D) signedchar Q. 14 -1 cannot be storedin________ data type. A) char B) unsignedint C) Float D) Long int Q. 15 What will be value of zvariable? int a,b,c; a=3,b=2; z=a/b; A) 1 B) 1.5 C) 1.0 D) 0 Q. 15 What will be value of zvariable? int a,b;float z; a=3,b=2; z=a/b; A) 1 B) 1.5 C) 1.0 D) 0 Q. 15 What will be value of zvariable? int a;float b,z; a=3,b=2; z=a/b; A) 1 B) 1.5 C) 1.0 D) 0 Q. 18 IF functioncall the same functionthenitiscalledas _________ A) Recursive function B) Non-Recursive Function C) LibraryFunction D) User DefinedFunction Q. 19 A alphanumericvaluethatdose notchange during executionof aprogram iscalled______ A) variable B) constant C) symbol D) Macro Q. 20 If integerneedstwobytesof storage,thenthe maximumvalueof asignedintegeris…………. A) 215 -1 B) 215 C) 216 D) 216 -1 Q. 21 Whichnumbersystemisusuallyfollowedinatypical 32-bitcomputer? A) 2 B) 10 C) 16 D) 32
• 3.
  Data Structures andAlgorithms Unit I Quiz – II Q. 23 One of the statementsisfalse. A) intis a builtin data type B) typedef isuser defineddatatype C) structure isderived data type D) Array is builtin data type Q. 24 Give the value of the expression (523/10)%10 A) 5 B) 3 C) 2 D) None of these Q. 25 Logical operatorsare……….. A) && B) II C) ! D) All Q. 26 ArithmeticOperatorsare ________ A) + - / * B) && || ! C) ++ -- D) None of these Q. 27 Bitwise operatorsare ________ A) + - / * B) && || C) & | D) ++ -- Q. 28 X=5; printf(“%d%d%d”,++x,x++,++x) whatwill be printed? A) 6 8 8 B) 8 6 6 C) 6 6 6 D) 6 6 8 Q. 29 Give the value of z whenz= sizeof(15.3); A) 4 B) 2 C) 1 D) 5 Q. 30 Give outputof the followingprogram. a=10; e=~a; printf(“%d”,e); A) -10 B) -11 C) -9 D) 10 Q. 31 x=5; z=(x==5)+6,(x==5)+2 What will be the value of z A) 7 B) 3 C) 6 D) 2 Q. 32 Z=(x=5,x++); printf(“%d”,z); What isprinted?
• 4.
  A) 5 B)6 C) 11 D) 10 Q. 33 Integerdivisionina‘C’program resultsin……. A) Truncation B) Rounding C) Overflow D) None of these Q. 34 Whena functionisrecursivelycalled,all automatic(local) variables……… A) Are initialized during each executionofthe function B) Are retainedfromthe lastexecution C) Are maintainedina queue D) Are alwaysretained Q. 35 printf(“%d”,4%3); printf(“%d”,4%-3); printf(“%d”,-4%3); printf(“%d”,-4%-3); What isResult.? A) 1,-1,-1,1 B) 1 1 -1 -1 C) 1 1 1 1 D) 1 -1 -1 -1 Q. 36 Assume a=13, b=25 and c=5 what will be x if x=(c+b)?a:b+2 A) 12 B) 27 C) 13 D) 25 Q. 37 Give outputfor followingprogram x=5; Switch(x) { case 5: printf(“1”); case 4: printf(“2”); case 3: printf(“3”);break; case 2: printf(“4”); case 1: printf(“5”); } A) 1 2 3 B) 1 2 3 4 5 C) 4 5 D) 1 2 Q. 38 Give the outputof the followingprogram x=3;y=5; If (x>=y); printf(“n%d”,x); printf(“%d”,y); A) 3 5 B) 0 C) 3 D) 5
• 5.
  Data Structures andAlgorithms Unit I Quiz – III Q. 39 a) while(1) { } b) for (; ;) { } c) while (i++) { i=i+1;} d) while (i==i) { i=i+1;} Which isnot an infiniteloopif i=6? Q. 40 A staticvariable isdeclared…. A) Inside afunction B) Outside the bodyof functions C) Both (a)and(b) D) None of the above Q. 41 What isoutput? for(i=1;i<6;i++); { if (i=3) continue; else printf(“%d”,i); } A) 1 2 3 4 5 B) 1 2 4 5 C) 2 4 5 D) NONE OF THESE Q. 42 The variableswhichcanbe accessedby all modulesinaprogram are called……….. A) Local B) Global C) Internal D) External Q. 43 The statementthattransferscontrol to the beginningof the loopiscalled…… A) break; B) continue; C) exit; D) goto; Q. 44 The loopin whichthe statementswithinthe loopare executedatleastonce iscalled……. A) do-while B) for C) Goto D) While Q. 45 How manytimesthe followingprogramwouldprint(“abc”)? main() { printf(“nabc”); main(); } A) Infinite B) 32767 times C) Till stack overflows D) 65536 times Q. 46 The statementthattransferscontrol to the beginningof the loopiscalled A) break; B) continue; C) exit; D) goto;
• 6.
  Q. 47 Writeoutputof the followingstatement if(-1) printf(“Error”); else printf(“no error”) A) Error B) No error C) Garbage value D) No output Q. 48 Time complexityof analgorithmdependsupon……… A) Size of input B) Frequencycount C) Speedof computer D) Both a and b Q. 49 There are 4 differentalgorithmsforsolvingaproblem.Theirtime complexitiesare O(n),O(n2 ),O(logn) and O(nlogn).Whichisthe bestalgorithm? A) O(n) B) O(n2 ) C) O(logn) D) O(nlogn) Q. 50 The time complexityof linearsearchalgorithmoveranarrayof n elementsis…….. A) O(n) B) O(n2 ) C) O(logn) D) O(nlogn) Q. 51 The time requiredtosearchan elementinalinkedlistof lengthnis………. A) O(n) B) O(n2 ) C) O(logn) D) O(nlogn) Q. 52 Time complexityof linearsearchis……… A) O(n) B) O(n2 ) C) O(logn) D) O(nlogn) Q. 53 Time complexityof binarysearchis….. A) O(n) B) O(n2 ) C) O(logn) D) O(nlogn) Q. 54 Bestcase time complexityof binarysearchis….. A) O(1) B) O(n) C) O(logn) D) O(nlogn) Q. 55 Whichis the followingcase doesnotexistingincomplexitytheory? A) Best B) Worst C) Average D) Null Q. 56 Whichstatementcannotbe usedinsequential searchtoimplement1by 1 elementsearching? A) for B) while C) Switch D) Goto
• 7.
  Data Structures andAlgorithms Unit I Quiz – IV Q.57.The statementprintf(“%d”,++10) A) 11 B) 10 C) syntax error D) Garbage value Q.58 Considerfollowingcode fragment and choose the correct option voidmain() { inta=10,b=20,c=30; printf(“%d%d”,a,b,c); } A) syntax error B)10 20 C)10 20 0 D) 20 30 Q.59 What will be the output of followingcode void main() { int i; for(i=0;i<3;i++) printf(“%d”,i); } A)3 B)4 C)Syntax Error D)Runtime Error Q.60.What will be the output of followingcode #include<stdio.h> void main() { int i; for (i=-1;i<-3;i++) printf(“%d”,i); } a)-1 -2 b)-1 -2 -3 c)syntax error d) no output Q.61.The value obtainedby the functionis givenback usingkeywords_____ A) static b)const c)return d)none of these Q.62. .what will be the output? Printf(“%f”,5/2); A)2 B)2.5 C)garbage value D)undefined Q.63.What will be the output of the followingcode? void main() { inti=1; if(i--) printf(“%d”,i); if(i++) printf(“%d”,i);
• 8.
  } A) 0 B)1 C) syntax error d) no output Q.64.what will be the output? Main() { Static i=0; Int j; If(i++<5) { Printf (“%d”,i); Exit(0); } j=10; Printf(“%d%D”,j,main()); } A) 1 2 3 4 5 B)1 2 3 4 C)1 D)none of these Q.65.consider the code fragment for the output_______ Voidmain() { int i=0,a[3]; a[i]=i++; printf(“%d”,a[i]); } A)0 B)1 C)garbage value D)syntax error Q.65.consider the code fragment for the output_______ Voidmain() { int i=0,a[3]; a[i]=++i; printf(“%d”,a[i]); } A)0 B)1 C)garbage value D)syntax error
• 9.
  Unit II: Pointers& Structures in C QUIZ I Q.1 sorting is useful for_____ A) respondingthe queries B) making searchingeasier and efficient C) report generation D) all of these Q.2 which of the following sorting method is the slowest? A) quick sort B) merge sort c) bubble sort D) none of these Q.3.A sort which compares adjacent elements in a list and switches wherever necessary is___ A) insertion sort B) bubble sort C) selection sort D) none of these Q.4 consider that n elementsare to be sorted.The worst case complexity of bubble sort is___ A)O(1) B)O(log2n) C)O(n) D)O(n2) Q.5.the total number of comparisos in bubble sort is A )O(1) B)O(log2n) C)O(n) D)O(n2) Q.6 The selection sort is basically a method of repetead A) interchange B)searching C)position adjustment D)none of these Q.7 what will be the output of the followimg code? int main() { printf("Hello",worldn); return 0; } A) Hello B) Hello world c) world D) none of thsese Q.8what will be the output of the followimg code? int main() { int i=10,*a; void *b; a=b=&i; printf("%u%u",a++,b++); return 0; } A) 10 garbage value B) address will bedisplayed twice C) syntax error D) none of thses Q.9 what will be the output of the followimg code? int main() { char str[]="Teena"; str[0]='M'; printf("%s",str); str="Meena"; printf("%s",str); return 0; } A)Teena Teena B)Teena Meena C)syntax error D)none of these Q.10 what will be the output of the following code?
• 10.
  int main() { char str[]="Tango"; char*const p=str; *p='M'; printf("%sn",str); return 0; } A)Tango B)MTango C)Mango D)TMango Q.11what will be the output of the following code? void main() { int a=10,b=20; int *arr[]={&a,&b}; printf("%d",(*a)[1]); } A)10 B)20 C)syntax error D)run time error Q.12 how many bits are absolutely necessary to store an ASCII character A)7 B)8 C)15 D)16 Q.13 what will be the output of the following code if the base address of an array is 1200 and size of an integer 4 bytes int main() { int a[3][4]={1,2,3,4,5,6,7,8,9,10,11,12}; printf("%u %u %un",a[0]+1,*(a[0]+1),*(*(a+0)+1)); return 0; } A) 1204 2 2 B) 1196 2 2 C) 1204 4 4 D) 1204 2 4 Q.14 what will be the output of the following code? void main() { int a[]={1,2,3,4,5},j,*p; p=a; for(j=0;j<5;j++) { printf("%d",*p); p++; } } A) syntax error B)runtime error C)1 2 3 4 5 D)garbage 1 2 3 4 Q.15 which of the following is a collection of different data type elements? A) Array B) structure C) string D) all of the above Q.16 which of the following can not be a structure member? A) Another structure B) array C) function D) none of these Unit II: Pointers & Structures in C QUIZ II Q.17 what issimilar betweenstructure,unionand enum?
• 11.
  A) All ofthemletyou define new values B) All of themletyoudefine newpointers C) All of themletyou define newstructures D) All ofthem letyou define newdata types Q.18 what will be the output of the followingcode? Struct { inta; char str[20]; }; voidmain() { struct s; s.a=10; printf("%d",s.a); } A)10 B)syntax error C)runtime error D)nooutput Q.19 what will be the output of the followingcode? intmain() { enumdays{mon=-1,tue,wed=10,thu,fri,sat}; printf("%d%d%d%d%d%dn",mon,tue,wed,thu,fri,sat); return0; } A)-1 0 10 11 12 13 B) -1 0 10 1 2 3 C)-1 0 10 2 3 4 D)-1 0 10 0 0 0 Q.20 what will be the output of the followingcode? intmain() { uniona { inti; char ch[2]; }; uniona u; u.ch[0]=10; u.ch[1]=20; printf("%d%d%d",u.ch[0],u.ch[1],u.i); return0; } A)10 20 515 B)515 20 10 C)10 20 0 D)none of these Q.21 Considerthe two statement i) char *p=0; ii)char *Q=NULL A)onlyIisvalid B)onlyii isvalid C) both I and ii are the same D)none of these Q.22 point out the error in the followingcode intmain()
• 12.
  { int*x; *x=100; return0; } A) Invalidassignment B)suspiciouspointerconversion C) no error D) none of these Q.23 point out the error in the followingcode intmain() { inta[]={10,20,30,40,50}; intj; for(j=0;j<5;j++) { printf(“%d”,a); a++; } return0; } A) Declaration error B) Lvalue required C) suspiciouspointerconversion D)expressionsyntax Q.24 what will be the output of the followingcode? intmain() { printf(“%c”,7[“helloworld”]); return0; } A)syntax error B)itwill printt7 C)itwill print r D)nothingwill be printed Q.25 what will be the output of the followingcode? voidmain() { inta=10,b=20; int*arr[]={&a,&b}; printf(“%d”,(*arr)[0]); } A)10 B)20 C)syntax error D)runtime error Unit II: Pointers & Structures in C QUIZ III Q.27 what will be the output of the following code? Union test { Double a; int b[10]; Char c; } u; Assume double=8bytes, int=4bytes and char=1byte A) 8 B) 4 C) 80 D) 40 Q.28 what will be the output of the following code? structstud
• 13.
  { int roll_no; structstud *s; }; A)Error in structure declaration B) there is no error C) linker error D) none of these Q.29 what will be the output of the following code? int main() { int x=65; int y=sizeof(x++); printf(“%d”,x); Return 0; } A) 65 B) 66 C) syntax error D) none of these Q.30 the membersof the union are accessed by____ A) Dot operator B) pointer -> operator C) both A and B D) none of these Q.31 Choose the correct option I. A union can not be nested in a structure II.Nested union unions are allowed A)I is true and II is false B)I is false and II is true C)I and II both are true D)I and II both are false Q.32 Choose the correct option I. structure can contain elementsof different size II.union elementscan not be of different size A)I is true and II is false B)I is falseand II is true C)I and II both are true D)I and II both are false Q.33 How many bits are absolutely necessary to store an ASCII character? A) 7 B) 8 C) 15 D) 16 Q.38 The process of transforming one bit pattern into another by bitwise operation is called A) Biting B) chopping C) masking D) none of these Q. 39which bitwise operator is suitable for turning on a particular bit in a number? A) &&operator B) || operator C) &operator D)| operator Q.40 The most significant bit lost in following operation A) << B)>> C) & D)| Q.41What will be the output of the following code? int main() { int a=10; a=~a; printf(“%d”,a); } A)-9 B)-10 C)-11 D) depends upon the compiler
• 14.
  Q.42 what willbe the output of the following code? int main() { printf(“%x”,-2<<1); return 0; } A) ffff B) 000 C) fffc D) none of these Q.43 what will be the output of the following code? int main() { int a=10; a=~a; printf(“%d”,a); } A)-9 B)-10 C)-11 D) depends upon the compiler Q.44 the library function used to find the last occurrence of given character A) Strchr B) sternest C) strstr D) strrchr Q.45____sort uses divide and conquer algorithmic technique. A) Bubble sort B) insertion sort C) merge sort D) none of these Q.46 what will be the output of the following code? int main() { printf(8+“Welcome Friendn”); Return 0; } A) Syntax error B) Welcome C) Friend D) Welcome Friend Unit III: Data Structure Using Linked Organization QUIZ I Q.1 Linked lists is best suited A).for relativelypermanentcollectionsof data B). for the size of the structure and the data in the structure are constantly changing C).for bothof above situation D).for none of above situation Q 2 which of the following data structure is not linear data structure? a. Arrays b. Linked lists c. Both of above d. None of above Q.3 Value of the first linked list index is _______ a. One b. Zero c. -1 d. None of these Q.4 Which of the following data structures are indexed structures? A) linear arrays B) linked lists C) Both of above D) None of above
• 15.
  Q.5 The situationwhen in a linked list START=NULL is A) Underflow B) overflow C) houseful D) saturated Q.6 which of the following statement is false? A) Arrays are dense lists and static data structure B) Data elements in linked list need not be stored in adjacent space in memory C) Pointers store the next data element of a list D) Linked lists are collection of the nodes that contain information part and next pointer Q.7 struct node { int rollno; struct node *next; }; Which statement creates a new node for linked list whose structure is defined as above A) (int*)malloc (sizeof (struct node)) B) (struct node *)malloc (sizeof (struct node)) C) (void *)malloc (sizeof (struct node)) D) None of above Q.8 The memory address of the first element of an array is called A) floor address B) foundation address C) first address D) base address Q.9 Abstract Data Type (A D T) represents 1. Set of complex data objects 2. Set of operations to be performed on objects 3. How the data objects are organized A)1,2 B)1,2,3 C)2,3 D)none of the above Q.9 Which of the following are operations performed on Data structures 1. Insertion 2.Search 3. Sorting 4. Emerging A) 1,2,3 B) 2,3,4 C) All of above D) None of above Q.10 A variable P is called pointer if A) P contains the address of an element in DATA. B) P points to the address of first element in DATA C) P can store only memory addresses D) P contain the DATA and the address of DATA Q.10 which of the following are limitations of array 1.Wastage of space 2Possibility of underflow 3.Difficulty in insertion and deletion 4.Fixed in size A) 1, 2, 3 B) 1, 3, 4 C) All of above D) None of above Q.11 finding the location of the element with a given value is: A) Traversal B) search C) sort D) None of above Q.12 Linked list implementation,a node carries information regarding A)Data and Link B)data C)link D)pointer
• 16.
  Q.13 A linkedlistinwhich the last node of linkedlistpoints to the firstis calleda A)singlylinkedlist B)Doublylinkedlist C)Circularlinkedlist D)none of these Q.14 Doubly linkedlistperformstraversal in__________ A)anydirection B)eitherdirection C)circulardirection D)none of these Q.15 linkedlistdata structure usage offersconsiderable savingin A)computationaltime B)space utilization C)bothA and B D)none of these Q.16 considerlinkedlist isused to implementthe stack then which ofthe followingnode isconsiderdas top of the stack? A)anynode B)first node C)middle node D)lastnode Q.17 the linkedfieldinthe last node of the linkedlist contains_______ A)Zerovalue B)Linkto the firstnode C)pointertothe nextelementlocation D)none of these Unit III: Data Structure Using Linked Organization QUIZ II Q.18 When new elements is added in the middle of singly linked list then_____ A)only elements that apper before the new element need to be moved B) only elements that apper after the new element and before need to be moved C)no need to move element D) only elements that apper after the new element need to be moved Q.19 Which of the following operation is perfomed more efficiently in doubly linked list? A)Deleting a node at given position B)searching a noe at a given position C)Inserting a node at a given position D)none of these
• 17.
  Q.20 If ina linked list address of first node is 1020 then what will be the address of node at 5th position? A)1038 B)none of these C)1036 D)1028 Q.21 in a circular linked list insertion of a node involves the modification of_______links. A)3 B)1 C)4 D)2 Q.22 the linked list is not suitable for____ A)insertion sort B)binary search C)radix sort D)polynomial function Q.23 linked list uses null pointer to signal____ A)beginning of the listB)end of the list C)both A and B D)neither A and B Q.24 which of the following linked list has no NULL links in A)singly linked list B) circular linked list C)doubly linked list D)none of these Q.25 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. Q.26 The minimum number of multiplications and additions required to evaluate the polynomial P = 4x3+3x2-15x+45 is A . 6 & 3 B 4 & 2 C 3 & 3 D 8 & 3 Q. 27 In a linked list with n nodes, the time taken to insert an element after an element pointed by some pointer is A. 0 (1) B. 0 (log n) C. 0 (n) D. 0 (n 1og n) Q.28 A linear collection of data elements where the linear node is given by means of pointeris called A. linked list B. node list C. primitive list D. None of these
• 18.
  Q. 29 Linkedlist uses which type of memory allocation A. Dynamic B. Static C. Temporary D. None of Above Q. 30 Deletion of a node from an empty linked list will cause………. a) Underflow b)overflow c)run time error d))all of the above Q. 31 Insertion in a linked list requires modification of …… pointers. A) 1 B) 2 C) 3 D) 4 Q.32 A singly linked list can be used to represent a…. A) Stack B)Queue C)Both A And B D)None Of Them Q. 33 a linked list with a header node a) Reduces number of cases for insertion b) Reduces number of cases for deletion c) Both a and b d) None of these Q.34 A Linked list can be sorted using…… a) Bubble sort b) Selection sort c) Insertion sort d) Both a and b Q. 35 An array is referenced by its name. similarly, a linked list is referenced a) Address of the first node b) Address of the last node c) Both a and b d) None of these Q. 36 In a circular linked list,……. a) Last node points to first node. b) First node points to last node c) A or b d) None of these Q. 37 One will select …….loop to traverse all the nodes of a circular linked list. a) While loop b) For loop c) Do while loop
• 19.
  d) All ofthe above. Q. 38 Which function initializes memory to zero? a) Malloc b) Calloc c) Both a and b d) None of these Q. 39 which function returns a void pointer a) Malloc b) Calloc c) Both a and b d) None of these Q. 40 Select the correct statement a) Free is used to release memory allocated by malloc b) Free is used to release memory allocated by calloc c) Both a and b d) Only a but not b Q.41 The …..linked list can be processed in either direction. a) Singly b) Singly circular c) Doubly d) None of these Q.42 A polynomial in single variable should be handled using …… a) An array of structure b) Singly linked list c) GLL d) Both a and b Q. 43 A polynomial in 2 variables can be handled using a) An array of structure b) Singly linked list c) 2-d array d) All of the above Q. 44 A node of doubly linked contains a) Pointer to predecessor b) Pointer to successor c) Both a and b d) Only a Q. 45 The applications of a linked list are…….. a) Stack
• 20.
  b) Queue c) List d)All Q 46 A multivariable polynomial is best represented using …… a) Simply linked list b) One dimensional array c) A GLL d) All of the above