Fundamentals of data Structures & Linked list

Front

A data structure in which linear sequence is maintained by pointers is known as

Back

Linked list

Front

A ____ is a linear collection of self-referential structures, called nodes, connected by pointer links.

Back

Linked list

Front

Which of these best describes an array? Options: A data structure that shows a hierarchical behavior, Container of objects of similar types, Arrays are immutable once initialised, Array is not a data structure

Back

Container of objects of similar types

Front

When does the ArrayIndexOutOfBoundsException occur?

Back

Run-time

Front

Which of the following c code is used to create new node?
Options:
ptr = (NODE*)malloc(sizeof(NODE));
ptr = (NODE*)malloc(NODE);
ptr = (NODE*)malloc(sizeof(NODE*));
ptr = (NODE)malloc(sizeof(NODE));

Back

ptr = (NODE*)malloc(sizeof(NODE));

Front

Assuming int is of 4bytes, what is the size of int arr[15];?

Back

60

Front

Consider an implementation of unsorted singly linked list with a head pointer only. Which operations can be implemented in O(1) time? i) Insertion at the front of the linked list ii) Insertion at the end of the linked list iii) Deletion of the front node of the linked list iv) Deletion of the last node of the linked list

Back

Insertion at the front of the linked list and Deletion of the front node of the linked list.

Front

Which of the following c code is used to create new node? a) ptr = (NODE*)malloc(sizeof(NODE));, b) ptr = (NODE*)malloc(NODE);, c) ptr = (NODE*)malloc(sizeof(NODE*));, d) ptr = (NODE)malloc(sizeof(NODE));

Back

ptr = (NODE*)malloc(sizeof(NODE));

Front

What is the output of following function for start pointing to first node of following linked list? 1->2->3->4->5->6 void fun(struct node* start) { if(start == NULL) return; printf("%d ", start->data); if(start->next != NULL ) fun(start->next->next); printf("%d ", start->data); }

Back

1 3 5 5 3 1

Front

What is the functionality of the following code?
public void function(Node node)
{
if(size == 0)
head = node;
else
{
Node temp,cur;
for(cur = head; (temp = cur.getNext())!=null; cur = temp);
cur.setNext(node);
}
size++;
}

Back

Inserting a node at the end of the list