ITM311
Data Structures, Algorithms & Programming
Assignment - I
Assignment Code: 2015ITM311A1 Last Date of Submission: 15th April 2015
Maximum Marks: 100
Attempt all the questions. All the questions are compulsory and carry equal marks.
Section-A
1. What is a linear queue? Write algorithms to insert and delete an item to a linear queue.
2. What is Object-Oriented programming? How is it different from the Procedural- Oriented programming? What are the advantages of an Object -Oriented programming paradigm?
3. Explain following the following terms with illustrations:
a. Linked List
b. Stack & Queues
c. Java Data Base Connectivity
d. Swings & AWT
4. Write a note on features of advanced features of java. What are the applications of collections? Write a program to implement collections.
Section-B
Case Study
5. Write a program to insert, delete, and locate an element on a sorted list using
- array
- pointer, and
- Cursor implementation of lists.
ITM311
Data Structures, Algorithms & Programming
Assignment - II
Assignment Code: 2015ITM311A2 Last Date of Submission: 15th May 2015
Maximum Marks: 100
Attempt all the questions. All the questions are compulsory and carry equal marks.
Section-A
1. Describe the following terms with illustrations:
a) Recursion
b) Threaded trees
c) Breadth First Search
2. Explain list data structures with illustrations.
3. What is Directed Graph? How to represent the directed graphs?
4. What are Huffman codes in binary trees?
Section-B
Case Study
5. Here are sixteen integers: 22, 36, 6, 79, 26, 45, 75, 13, 31, 62, 27, 76, 33, 16, 62, and 47. Sort them using
- quick sort
- insertion sort,
- heap-sort, and
- bin sort,
treating them as pairs of digits in the range 0-9.
Data Structures, Algorithms & Programming
Assignment - I
Assignment Code: 2015ITM311A1 Last Date of Submission: 15th April 2015
Maximum Marks: 100
Attempt all the questions. All the questions are compulsory and carry equal marks.
Section-A
1. What is a linear queue? Write algorithms to insert and delete an item to a linear queue.
2. What is Object-Oriented programming? How is it different from the Procedural- Oriented programming? What are the advantages of an Object -Oriented programming paradigm?
3. Explain following the following terms with illustrations:
a. Linked List
b. Stack & Queues
c. Java Data Base Connectivity
d. Swings & AWT
4. Write a note on features of advanced features of java. What are the applications of collections? Write a program to implement collections.
Section-B
Case Study
5. Write a program to insert, delete, and locate an element on a sorted list using
- array
- pointer, and
- Cursor implementation of lists.
ITM311
Data Structures, Algorithms & Programming
Assignment - II
Assignment Code: 2015ITM311A2 Last Date of Submission: 15th May 2015
Maximum Marks: 100
Attempt all the questions. All the questions are compulsory and carry equal marks.
Section-A
1. Describe the following terms with illustrations:
a) Recursion
b) Threaded trees
c) Breadth First Search
2. Explain list data structures with illustrations.
3. What is Directed Graph? How to represent the directed graphs?
4. What are Huffman codes in binary trees?
Section-B
Case Study
5. Here are sixteen integers: 22, 36, 6, 79, 26, 45, 75, 13, 31, 62, 27, 76, 33, 16, 62, and 47. Sort them using
- quick sort
- insertion sort,
- heap-sort, and
- bin sort,
treating them as pairs of digits in the range 0-9.
No comments:
Post a Comment