nielit.gov.in : C Level Course Digital Image Processing & Computer Vision Question Paper 2018

Name of the Organisation : National Institute of Electronics & Information Technology – NIELIT
Examination : C Level Course Examination 2019
Document Type : Question Paper
Subject : Digital Image Processing & Computer Vision
Subject Code : C7-R4
Year : January 2018 – 2019
Website : http://nielit.gov.in/content/old-question-papers-0

NIELIT Digital Image Processing & Computer Vision Paper

Question Paper of C Level Course Examination Digital Image Processing & Computer Vision Question Paper January 2018 is now available in the official website of Directorate Of Economics And Statistics

Related / Similar Question Paper :
CCAC Exam Question and Answer

Instructions for Candidate

** Carefully read the instructions given on Question Paper, OMR Sheet and Answer Sheet.
** Question Paper is in Hindi and English language. Candidate can choose to answer in any one of the language (i.e., either Hindi or English)

** There are TWO PARTS in this Module/Paper. PART ONE contains FOUR questions and PART TWO contains FIVE questions.
** PART ONE is Objective type and carries 40 Marks. PART TWO is subjective type and carries 60 Marks.

** PART ONE is to be answered in the OMR ANSWER SHEET only, supplied with the question paper, as per the instructions contained therein. PART ONE is NOT to be answered in the answer book for PART TWO.

** Maximum time allotted for PART ONE is ONE HOUR. Answer book for PART TWO will be supplied at the table when the answer sheet for PART ONE is returned. However, candidates who complete PART ONE earlier than one hour, can collect the answer book for PART TWO immediately after handing over the answer sheet for PART ONE.

** Candidate cannot leave the examination hall/room without signing on the attendance sheet or handing over his Answer sheet to the invigilator. Failing in doing so, will amount to disqualification of Candidate in this Module/Paper.
** After receiving the instruction to open the booklet and before answering the questions, the candidate should ensure that the Question booklet is complete in all respect.

Download Question Paper :
2018 : https://www.pdfquestion.in/uploads/nieitC7-R4.pdf
2019 : https://www.pdfquestion.in/uploads/pdf2019/29792-C7R4.pdf

Model Questions

Note :
1. Answer question 1 and any FOUR from questions 2 to 7.
2. Parts of the same question should be answered together and in the same sequence.

1. a) What is dithering? What is/are the advantage(s) of dithering?
b) Explain the use of discrete and continuous wavelet transforms.
c) Discuss the problem of median filter with even number of points in the window.
d) Define Weber’s law? How it can be used for visual modalities?
e) What’s the effect of setting the lowest bit of all the pixels to zero on the histogram of an image?
f) What are the advantages of using B frames for motion compensation?
g) How can an image be converted from a square grid to hexagonal grid? (7×4)

2. a) Explain the characteristics of 8 bit GIFF images? What are the different methods for converting a 24 bit image into an equivalent 8 bit color image? Explain any two in detail.
b) Describe contrast stretching on an image. What’s the effect of increasing brightness and contrast on the level graph the original image? (12+6)

3. a) Write the condition(s) for distance function or distance metric for pixels p, q and r with coordinates as (x, y), (s, t) and (z, w). Write an expression for Euclidean, city block and chessboard distances between two points’ p and q.
b) Discuss the effect of smoothening on an image. How it is done?
c) Explain homomorphic filtering? What are the advantages of homomorphic filtering? (8+6+4)

4. a) What is HSI color model? How can an image represented through HSI model be converted into corresponding RGB represented image?
b) What is JPEG image format? What are the special features of progressive JPEG?
c) Explain any one wavelet transform, such as Harr Transform. Elaborate how wavelets are used for Multi-resolution Image Processing. (8+4+6)

5. a) What is variable length encoding? Discuss the advantages of variable length encoding over fixed length encoding. Give two schemes where variable length encoding is used.
b) Encode the sequence AAABBCCDDABBA using LZW transform. The initial Dictionary is having symbols A, B, C and D with code as 1, 2, 3 and 4 respectively. c) Calculate the compression achieved for the above sequence when encoded through LZW transform. (6+8+4)

6. a) Explain the three fundamental steps performed in edge detection. Why is edge detection useful?
b) List the advantages of Sobel operator over Laplacian edge operator for edge detection.
c) List the properties of opening and closing operation for morphological image processing. (6+6+6)

7. a) What is an active contour model? How contours are represented using this model?
b) What are the weaknesses of traditional snakes?
c) What is Gradient Vector Flow? How the weaknesses of traditional snakes are overcome using Gradient Vector Flow (GVF)? (6+6+6)

Subject Code : C4-R4
Subject : Advanced Algorithms
1. a) i) Prove that A??(B) A: 5n 2 + 100n B: 3n2 + 2, where A & B are the functions over n.
ii) O(n4) , O(1) , O(n) , O(nlogn) , O(n2logn) , O(n0.5) , O(n2logn) , O(log2n). Arrange the given terms in increasing order of their time complexity.
b) Solve the following recurrence using recurrence tree method T(n) = 3T(n/4) + cn2.
c) State the Masters theorem for solving recurrence. Apply the Masters theorem to solve the following recurrence : T(n) = 9T(n/3) + n
d) Define P, NP, NP-Complete and NP-Hard Problems.
e) Explain the elements of dynamic programming in brief.
f) What is Radix Sort? Sort the following elements in increasing order using radix sort technique. 459 254 472 534 649 239 432 654 477
g) Show that the Travelling Salesman Problem is NP-Complete. (7×4)

2. a) Define and differentiate BFS and DFS. What are the advantages of one over other?
b) What is Minimum Spanning Tree? Mention few application of Minimum Spanning Tree. Apply Prim’s Algorithm to find the Minimum Spanning Tree of following weighted graph:
c) Whether, Dynamic Programming is a top-down approach or it is a bottom up approach? Justify your answer with suitable example. (8+5+5)

3. a) How to find Longest Common Subsequence of two strings using Dynamic Programming Method? Find the Longest Common Subsequence of following two strings: S1: president, S2: providence
b) Apply dynamic programming based approach to solve the O/I Knapsack problem for following:
c) Sort the following list in increasing order using quick sort technique. Always consider first element as pivot element. 40, 20, 10, 80, 60, 50, 7, 30, 100 (8+6+4)

4. a) Explain Floyd Warshall algorithm. Apply Floyd Warshall algorithm for computing the shortest path from all vertices to other vertices in following graph:
b) How many exact match and spurious hits does the Rabin-Karp matcher encounter in the text T = 31415926535 when looking for pattern P = 26? Take value of modulo q = 11. c) What is Huffman Coding? Give advantages of Huffman coding. Create Huffman Tree from given input characters a, b, c, d, e and f whose frequencies are respectively 5, 9, 12, 13, 16 and 45. (7+5+6)

5. a) For the following six matrices find the order of parenthesization for optimal chain multiplication.
A1: 30 × 35, A2: 35 × 15, A3: 15 × 5, A4: 5 × 10, A5: 10 × 20, A6: 20 × 25.
b) Define Binary Search? Write and analyze Binary Search Algorithm. Solve recurrence equation of binary search using Master theorem.
c) Write the 2-approximation algorithm for Vertex Cover Problem. Discuss, how it is 2-approximation? (8+6+4)

6. a) Explain Dijkstra’s algorithm. Apply Dijkstra’s algorithm to find shortest paths from source vertex B to all other vertices in following graph:
b) Write the algorithm to search a graph using Breadth First Search (BFS). Explain BFS using an example.
c) Is P = NP? Justify your answer. (6+8+4)

7. a) A sequence of n operations is performed on a data structure. The ith operation costs i, if i is an exact power of 2, otherwise 1. Use aggregate analysis to determine the amortized cost per operation.
b) What is Starssen’s algorithm? How Starssen’s matrix multiplication can be done efficiently by using divide and conquer technique?
c) Show that for any real constants a and b, where b > 0, (n+a)b = T (nb) (5+8+5)