Scribd
Upload
185 views2 pages

EC243 Programming and Data Structures Nov Dec 2006

The document is an exam paper for an Electronics and Communication Engineering degree course. It contains 15 questions testing knowledge of programming and data structures. The questions cover topics such as pseudocode, functions vs procedures, algorithmic techniques, the knapsack problem, escape sequences, recursion, internal fragmentation, minimal spanning trees, directed trees, deque, top-down design, modularity, structured programming, Big O notation, greedy algorithms, merge sort, the 8-queens problem, control statements, functions, structures, fseek, file copying, Tower of Hanoi, lists, doubly linked lists, circular queues, binary trees, binary search, and storage management. Students are required to answer 10 out of 15 questions in detail.

Uploaded by

Monky Sonky
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
185 views2 pages

EC243 Programming and Data Structures Nov Dec 2006

The document is an exam paper for an Electronics and Communication Engineering degree course. It contains 15 questions testing knowledge of programming and data structures. The questions cover topics such as pseudocode, functions vs procedures, algorithmic techniques, the knapsack problem, escape sequences, recursion, internal fragmentation, minimal spanning trees, directed trees, deque, top-down design, modularity, structured programming, Big O notation, greedy algorithms, merge sort, the 8-queens problem, control statements, functions, structures, fseek, file copying, Tower of Hanoi, lists, doubly linked lists, circular queues, binary trees, binary search, and storage management. Students are required to answer 10 out of 15 questions in detail.

Uploaded by

Monky Sonky
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
Download as pdf or txt
You are on page 1/ 2

s 9119

2006' NOVEMBER/DECEMBER DEGREEEXAMINATION, B.E./B.TECh.


Fourth Semester Electronics and Communication Engineering F,C 243 - PROGRAMMING AND DATA STRUCTURES Time : Three hours Answer ALL questions. PARTA-(10 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. What is a pseudocode? x2=20 marks) Maximum: 100 marks

Distinguish between function and procedure. List out the various algorithmic techniques. What is knapsack problem?

List any four escapesequences with their uses. What is recursion? Give an example.

Define : internal frasmentation. PARTB-(5x16=80marks)

11.

(a)

ww

What is minimal cost spanning tree?

(i) (ii)

w.

What is directed tree?

What is deque?

aa na

va

N.

co m
(8) (8)

Explain about top down design approachin programming. Give the need of modularity and explain it. Or

(b)

(i) (ii)

What is structured programming and give its structure explain it.(8) What is a function and explain how the function calling is done in a (8) program with example.

L2. (a)

(i) (ii)

Explain about Big Oh and Theta notations. Explain about greedy algorithm with example. Or

(6) (10)

(b)

(i)

Write a merge sort algorithm. And trace the algorithm and conclude (10) how the divide and conquer is used? Explain about the 8-queens problem. Explain about various control statements with example'

(ii) 13. (a) (i) (ii)

(6) (8)

What is function? Explain about the categories of function and (8) write a C program to merging of two arrays using functions. Or

(b)

(i) (ii)

What is structure? Explain about structure with an example.

(8) (8) (6)

What is FSEEK? and write a C program to copy a file. How the Tower of Hanoi problem is solved?Explain.

14.

(a)

(i) (ii)

(b)

(i)

What is list? Give its types and explain doubly linked list deletion (8) with example.

aa na

va
Or

Write algorithm for circular queue insertion and deletion and (10) explain.

N.

co m

(ii) 15. (a) (i) (ii)

Explain about binary tree traversal with example.

(8) (6) (10)

ww

Describein detail about the structure of sequential frle. Or

w.

Explain about Quick sort with example.

(b)

(i) (ii)

Write a algorithm to binary search and explain it. Discuss in detail about storagemanagement.

(6) (10)

s 9119

You might also like