Introduction To Data Structures - Practice Test

(A) O(nlogn)

(B) O(logn)

(C) O(n)

(D) O(n 2 )

(C) O(n)

(A) 0

(B) -1

(C) 2

(D) 1

(A) 0

(A) *AB/CD+

(B) AB*CD/+

(C) A*BC+/D

(D) ABCD+/*

(B) AB*CD/+

(A) A parentheses balancing program

(B) Tracking of local variables at run time

(C) Compiler Syntax Analyzer

(D) Data Transfer between two asynchronous process

(D) Data Transfer between two asynchronous process

(A) In push operation, if new nodes are inserted at the beginning of linked list, then in pop operation, nodes must be removed from end

(B) In push operation, if new nodes are inserted at the beginning, then in pop operation, nodes must be removed from the beginning

(C) In push operation, if new nodes are inserted at the end, then in pop operation, nodes must be removed from end

(D) In push operation, if new nodes are inserted at the end, then in pop operation, nodes must be removed from beginning

(A) In push operation, if new nodes are inserted at the beginning of linked list, then in pop operation, nodes must be removed from end

Introduction To Data Structures - Study Mode