Scribd
Upload
3 views

ADS JAVA

The document outlines the external examination requirements for the Data Structures using Java Lab course at Chaitanya Engineering College. It includes a series of programming tasks such as implementing searching methods, data structures like stacks and queues, tree traversals, and sorting algorithms. The tasks require the use of both recursive and non-recursive functions in Java.

Uploaded by

G Ravi Kumar
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
3 views

ADS JAVA

The document outlines the external examination requirements for the Data Structures using Java Lab course at Chaitanya Engineering College. It includes a series of programming tasks such as implementing searching methods, data structures like stacks and queues, tree traversals, and sorting algorithms. The tasks require the use of both recursive and non-recursive functions in Java.

Uploaded by

G Ravi Kumar
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

CHAITANYA ENGINEERING COLLEGE

Approved by AICTE, New Delhi, Affiliated to JNTU, Kakinada


Chaitanya Valley, Kommadi, Madhurawada, Visakhapatnam-48

Subject: DATA STRUCTURES USING JAVA LAB Section:III-1 B.TECH ECE

DATA STRUCTURES USING JAVA LAB LAB EXTERNAL EXAMINATION

1. Write Java programs that use both recursive and non-recursive functions for implementing the
following searching methods
(a) Linear search (b) Binary search
2. Write Java programs to implement the List ADT using arrays and linked lists.
3. Write Java programs to implement the following using an array.
(a) Stack ADT (b) Queue ADT
4. Write a java program that reads an infix expression, converts the expression to postfix form
and then evaluates the postfix expression (use stack ADT).
5. Write Java programs to implement the following using a singly linked list.
(a) Stack ADT (b) Queue ADT
6. Write Java programs to implement the deque (double ended queue) ADT using
(a) Array (b) Doubly linked list.
7. Write a Java program to implement priority queue ADT.
8. Write Java programs that use recursive and non-recursive functions to
traverse the given binary tree in
(a) Preorder (b) In order and (c) Post order.
9. Write a Java program that displays node values in a level order traversal
(Traverse the tree one level at a time, starting at the root node) for a binary tree.
10. Write a Java program that uses recursive functions.
(a) To create a binary search tree. (b) To count the number of leaf nodes.
(c) To copy the above binary search tree.
11. Write Java programs for the implementation of bfs and dfs for a given graph.
12. Write Java programs for implementing the following sorting methods:
(a) Bubble sort (b) Selection sort (c) Insertion sort (d) Radix sort
13. Write a Java program for implementing KMP pattern matching algorithm.

INTERNAL EXAMINER EXTERNAL EXAMINER

You might also like