Global Edge Software Junior Data Analyst Interview Questions and Answers

Binary heap is used to implement a priority queue.

• Binary heap is a complete binary tree where each node has a value greater than or equal to its children.

• It can be implemented using arrays, where the parent of node at index i is at index (i-1)/2.

• Insertion and deletion operations have time complexity of O(log n) in a binary heap.

A binary tree can have any number of nodes, but the maximum number of trees with n nodes is 2^n.

• A binary tree can have 0 nodes, 1 node, 2 nodes, or any number of nodes.

• The maximum number of binary trees with n nodes is 2^n.

• For example, a binary tree with 3 nodes can have up to 8 different structures.

Use a SQL query to find the second highest marks in a student database.

• Use the ORDER BY clause to sort the marks in descending order

• Use the LIMIT clause to limit the result to the second row

Program to check if two strings are anagrams

• Create a function that takes in two strings as input

• Remove any spaces and convert both strings to lowercase for consistency

• Sort the characters in both strings and compare if they are equal to determine if they are anagrams

• Example: 'listen' and 'silent' are anagrams