Explanations for Questions Asked by Students

A binary search tree contains values 7, 8, 13, 26,, 35, 40, 70, 75 Which one of the following is a valid post order sequence of a tree provided the pre order sequence as 35, 13, 7, 8, 26, 70, 40, 75.

lossy and lossless decomposition examples

Simplify Y=AB'+(A+B)C

C program code explanation

C program code explanation

Consider an array of length 5, arr[5] = {9,7,4,2,1}. the steps of insertions done insertion sort

Divide the binary numbers 111101 ÷ 1001 and find the remainder.

Given i=0, j=1, k=-1, x=0.5, y=0.0 what is the value of x*3&&3||j|k

Boolean Product of Two Matrices

using transposition ciphers keyword LAYER. Encrypt the message WELCOME TO NETWORK SECURITY!

RSA Algorithm Example

Important Questions Part-1

Important Questions Part-2

Important Questions Part-3

Important Questions Part-4

Important Questions Part-5

Part-A Reasoning Part-1 Video

Part-A Reasoning Part-2 Video