Programming Languages
Web Development
Data Structures
Code
Algorithms
100
This programming language is named after a type of Coffee
What is Java
100
This language is used to style the appearance of HTML elements on a webpage, including properties like color, size, and layout.
What is CSS (Cascading Style Sheets)
100
This data structure stores elements of the same type in contiguous memory locations.
What is an Array
100
The output of the following (Java) code segment:
int[] A = new int[10];
int[] B = new int[20];
A = B;
System.out.println(A.length);
What is 20
100
This algorithm efficiently locates an item in a sorted list by repeatedly dividing the search interval in half.
What is Binary Search
200
An extension of the C programming language, adding support for object-oriented programming
What is C++
200
This open-source front-end JavaScript library is used to build user interfaces based on components.
What is React
200
This type of tree has at most two children for each node.
What is a binary tree?
200
The node of a linked list that will cause an error when p is set to it in the following 'remove' method:
public void remove(Node p){
Node q = p.next;
p.item = q.item;
p.next = q.next;
}
What is the last node in the list
200
This elementary sorting algorithm iterates through an array, repeatedly taking each element and inserting it into its proper position in the sorted portion of the array to the left.
What is Insertion Sort
300
This programming language, originally developed by Apple Inc., is used for building software applications for macOS, iOS, watchOS, and tvOS.
What is Swift
300
This technology allows web browsers to store small pieces of data locally, enabling websites to remember user preferences and settings.
What are Cookies
300
This data structure follows the Last-In-First-Out (LIFO) principle.
What is a stack?
300
The error produced by compiling the following code:
arr = [1, 2, 3, 4]
for(i = 0; i <= len(arr); i++){
if arr[i]%2 == 0:
print(i)
else:
print(i * 2)
}
What is Index Out of Bounds
300
The time complexity of the fastest possible sorting algorithm (In the worst case)
What is nlog(n)
400
This programming language, developed by Dennis Ritchie at Bell Labs, is widely used for system programming and developing operating systems.
What is C
400
This protocol is used for transferring hypertext requests and information on the World Wide Web.
What is HTTP (Hypertext Transfer Protocol)
400
This type of heap ensures that the value of a parent node is less than or equal to the value of its children nodes.
What is a Min Heap
400
The number of times 'foo' is called in the following code segment with an input of 3 (including the initial call):
def foo(n):
if n==0
return 0
return foo(n-1) + foo(n-1)
What is 15
400
This algorithm is used to find the shortest path between two nodes in a weighted graph
What is Dijkstra's Algorithm
500
Created by Danish-Canadian programmer Rasmus Lerdorf in 1993, this general-purpose scripting language is geared towards web development.
What is PHP
500
This software development methodology emphasizes iterative development, collaboration, and continuous improvement.
What is Agile development
500
This technique resolves collisions in hashmaps by storing a linked list of elements at each index of the array.
What is Chaining
500
The value computed by the following bitwise operation in C code:
0x12345678 | 0xff000000
What is 0xff345678
500
The 'heapified' (converted to max-heap) array of the following binary tree:
What is {10, 5, 3, 4, 1}
