In linked list,a node contain

  1. Home

Question:
 In linked list,a node contain

1. node,adrees field and data field

2.node number and data field

3.next adress field and information field

4.None of the above

Posted Date:-2022-07-08 05:17:33

More MCQS Questions and answers

  1. . #include <stdio.h> #include <string.h> int main(){ int i=0; for(;i<=2;) printf(" %d",++i); return 0; }
  2. A ________ linked list is a linked list structure in which each node has a pointer to both its successor and predecessor.
  3. A declaration "short int" is used for variables
  4. A node in a linked list must contain at least
  5. In a circularly linked list organisation ,insertion of a record involves the modifications of
  6. In a linked list, the pointer of the last node contains a special value, called the ______ pointer.
  7. In C, if you pass an array as an argument to a function, what actually gets passed?
  8. In linked list,a node contain
  9. In linked list,the logical order of elements
  10. List pointer variable in linked list contains address of the
  11. The declaration "unsigned u" indicates u is a/an
  12. The members of the union are accessed by____
  13. To insert a node in a circular list at rear end it should be inserted at …...of the queue
  14. What is the maximun number of dimensions an array in C may have?
  15. What is true about linked kist?
  16. What will be output if you will compile and execute the following c code? #include<stdio.h> int main(){ int i=4,x; x=++i + ++i + ++i; printf("%d",x); return 0; }
  17. Which of the following data structure is linear type ?
  18. ___ attacks the problem of fragmentation by moving all the allocated blocks to one end of memory, thus combining all the holes.
  19. ____ header list combines the advantages of a two-way list and a circular header list.
  20. _____ attacks the problem of fragmentation by moving all the allocated blocks to one end of memory, thus combining all the holes.
  21. _____ list is a special list that is maintained, which consists of unused memory cells.
  22. ______ is a technique using which a computer periodically collects all the deleted space onto the free storage list.
  23. ______ refers to situation where one wants to delete data form a data structure that is empty
  24. ________ is an organization that provides faster request and return time response.
  25. A _______ list structure can be traversed in two directions-- in the forward direction from beginning of the list to end, or in the backward direction, from the end of the list to the beginning.
  26. A ________ linked list is a linked list which always contains a special node, called the header node.
  27. A circular list can be used to represent
  28. A node of linked list contains_______
  29. A polynomial can be represented in a _______ by just storing the coefficient and exponent of each term.
  30. A variable which is visible only in the function in which it is defined, is called
  31. An external variable
  32. Are *ptr++ and ++*ptr are same?
  33. Because of linear structure of linked list having linear ordering,there is similarity between linked list and array in
  34. C language was invented by
  35. Consider that n elements are to be sorted. What is the worst case time complexity of Bubble sort?
  36. Deletion of a node from an empty linked list will cause________
  37. How many bits are absolutely necessary to store an ASCII character ?
  38. How many times the program will print "Amrutvahini" ? #include<stdio.h> int main() { printf("Amrutvahini"); main(); return 0; }
  39. If the characters 'D', 'C', 'B', 'A' are placed in a queue (in that order), and then removed one at a time, in what order will they be removed?
  40. In a ________ linked list, the last node's link field points to the first node of the list.
  41. Insertion in a linked list requires modification of____pointers
  42. Null pointer is used to tell
  43. One difference between a queue and a stack is:
  44. Queue is a -------------- List .
  45. Searching of linked list requires linked list to be created
  46. The complexity of linear search algorithm is
  47. The data type created by the data abstraction process is called
  48. The keyword used to transfer control from a function back to the calling function is
  49. The link list also contains a list pointer variable called start or ________.
  50. The main measures of efficiency of an algorithm are
  51. The most significant bit is lost in following operation
  52. The program fragment int i = 263 ; putchar (i) ; prints
  53. The result of 0001 1010 & 0000 1000 is ___
  54. The result of 0001 1010 << 2 is____
  55. The result of 0001 1010^0001 0000 is____
  56. The second part of the node, is called _______ field, and contains the address of the next node in the list.
  57. the terms push and pop are related to
  58. The variables which can be accessed by all modules in a program, are called
  59. The worst case occures in linear search algorithms when
  60. Unsigned integers occupies
  61. Unsigned integers occupies
  62. What additional requirement is placed on an array, so that binary search may be used to locate an entry?
  63. What is the similarity between structure,union and enum?
  64. What term is used to describe an O(n) algorithm
  65. What will be output if you will compile and execute the following c code? #include<stdio.h> #define max 5; int main(){ int i=0; i=max++; printf("%d",i++); return 0; }
  66. What will be output if you will compile and execute the following c code? #include<stdio.h> int main(){ char c=125; c=c+10; printf("%d",c); return 0; }
  67. What will be output if you will compile and execute the following c code? #include<stdio.h> int main(){ double far* p,q; printf("%d",sizeof(p)+sizeof q); return 0; }
  68. What will be output if you will compile and execute the following c code? #include<stdio.h> int main(){ int a=2; if(a==2){ a=~a+2<<1; printf("%d",a); } else{ break; } return 0; }
  69. What will be output if you will compile and execute the following c code? #include<stdio.h> int main(){ int i=10; static int x=i; if(x==i) printf("Equal"); else if(x>i) printf("Greater than"); else printf("Less than"); return 0; }
  70. What will be output if you will compile and execute the following c code? #include<stdio.h> int main(){ int array[]={10,20,30,40}; printf("%d",-2[array]); return 0; }
  71. What will be the output of the following code? Void main(){int a=10;int *b=&a;int **c=&b;printf("%d %d %d",a,*b,**c);}
  72. What will be the output of the program? #include<stdio.h> int i; int fun(); int main() { while(i) { fun(); main(); } printf("Hello "); return 0; } int fun() { printf("Hi"); }
  73. What will be the output of the program? #include<stdio.h> int main() { int X=40; { int X=20; printf("%d ", X); } printf("%d ", X); return 0; }
  74. Which data structure allows deleting data elements from front and inserting at rear?
  75. Which nodes contains a null pointer in a linked list?
  76. Which of the following 'C' type is not a primitive data structure?
  77. Which of the following data structure is linear data structure?
  78. Which of the following formulas in big-O notation best represent the expression n²+35n+6?
  79. Which of the following is a collection of different data type elements?
  80. Which of the following statement is true about char ****a ?
Search
R4R Team
R4Rin Top Tutorials are Core Java,Hibernate ,Spring,Sturts.The content on R4R.in website is done by expert team not only with the help of books but along with the strong professional knowledge in all context like coding,designing, marketing,etc!