KTR-CTECH-AN -18.04.2024

Which of the following algorithms is the best approach for solving Huffman codes?

• exhaustive search
• greedy algorithm
• brute force algorithm
• divide and conquer algorithm

How many printable characters does the ASCII character set consists of?

• 120
• 128
• 100
• 98

Which bit is reserved as a parity bit in an ASCII set?

• first
• Seventh
• eighth
• tenth

In Huffman coding, data in a tree always occur?

• Roots
• leaves
• left sub trees
• right sub trees

The type of encoding where no character code is the prefix of another character code is called?

• optimal encoding
• prefix encoding
• frequency encoding
• trie encoding

Which of the following is NOT a Catalan number?

• 1
• 5
• 14
• 43

Which of the following numbers is the 6th Catalan number?

• 14
• 429
• 132
• 42

Which of the following is not an application of Catalan Numbers?

• Counting the number of Dyck words
• Creation of head and tail for a given number of tosses
• Counting the number of ways in which a convex polygon can be cut into triangles by connecting vertices with straight lines
• Counting the number of expressions containing n pairs of parenthesis

The recursive formula for Catalan number is given by Cn = ∑Ci*C(n-i). Consider the following dynamic programming implementation for Catalan numbers: #include<stdio.h> int cat_number(int n) { int i,j,arr[n],k; arr[0] = 1; for(i = 1; i < n; i++) { arr[i] = 0; for(j = 0,k = i - 1; j < i; j++,k--) ______________________; } return arr[n-1]; } int main() { int ans, n = 8; ans = cat_number(n); printf("%d\n",ans); return 0; } Which of the following lines completes the above code?

• arr[i] = arr[j] * arr[k];
• arr[j] += arr[i] * arr[k];
• arr[i] += arr[j] * arr[k].
• arr[j] = arr[i] * arr[k];

If a, b, c, d are distinct prime numbers with an as smallest prime then a * b * c * d is a ___________

• Odd number
• Even number
• Prime Number
• all of the above