• Create LinearArray class
  • 2 instance variables (array of integers and integer)
  • method to insert an element at the beginning of the array
  • method to insert an element at the end of the array
  • method to delete an element from an array
  • method to search for an element in an array
  • method to display all array elements

• Create Students class
  • 3 instance variables (String firstName, String lastName and integer ID)
• Create LinearArrayStudents class
  • 2 instance variables (array of integers and integer)
  • method to insert a student at the beginning of the array
  • method to insert a student at the end of the array
  • method to delete a student from an array
  • method to search for an element in an array
  • method to display all array elements

• Create LinearSortedArray class
  • 2 instance variables (array of integers, integer)
  • method to insert an element in an ordered array
  • method to display all array elements
  • method to search for an element in an ordered array
    • iteratively
    • recursively
    • classic
  • method to delete an element from the ordered array

• Method to check the parenthese are matching or not

• Search in a stack internal method
• Search in a stack external method
• display all stack elements

• Stack decompose method into stack of even no. and other for odd no.

• stack sorting asc

• Cube game check, if the first half is equal to 2nd half of stack

• Reverse a stack internally
• Reverse a stack externally
  • destroy original stack
  • keep original stack
  • return original stack reversed

• Remove elements starting from nth element
• Remove elements the nth element

• Sort a stack desc

• Method to calculate average gpa for stack of students

• transform infix expression to postfix expression [failed to implement]

• Evaluate a postfix expression [failed to implement]

• Remove nth element implemented earlier

• Browsing history
  • delete url
  • insert url
  • get most viewed url
  • remove last url
  • remove urls on date
  • get no. of urls
  • print all urls

• method to duplicate stack enteries depending upon another stack integers

• method to check if a word/sentence is palindrome or not

• Implement a class called MySet

• reverse a string
• check if a word is palindrome

• Mirror a queue (reversed + original)

• prefix evaluation of expressions

• implement a queue using stack

• shift zeros in queues to the end

• Extract every 3rd element

• check if word is an anagram

• check if a word is palindrome

• Implement a Deque class

• implement YoghutProduct.class & SuperMarket.class
• YoghurtProduct 3 instance vars (date[key], id, price)
• SuperMarket insert new yoghurt, calculate discount depending upon its priority

• implement University.class
• 2 instance vars (Name, Rank)
• Key is [rank], if ranks are equal then key is [name]

• Implement Patient.class & EmergencyRoom.class
• patient instance vars (name, severity [desc])
• key is severity

• implement method to insertLast (external method, internal recursive)
• implement method to removeLast (external method)

• reverse a LinkList (internal, external)

• reverse in place (external)

• remove duplicates from linklist (external method)

• method to get size of linklist (internal recursive, iterative)

• mix elements of a linklist (external)

• cut a link list (external, internal)

• splitting a list (external)

• alternating split (external)

• get max of a list (external)

• check if linklist contains an obj (external, internal recursive)

• implement a method to merge two lists (external, internal)
• implement a method to unite two lists (external, internal)
• implement a method to get difference between two lists (external, internal)
• implement a method to get intersection between two lists (external, internal)
• implement a method to check if two lists are equal or not (external, internal)

1st exercise

• implement a circular linked list class
• implement a method to append a circular linked list to "this"

2nd exercise

• implement a method to insert after a key
• implement a method to insert before a key
• implement a method to delete a certain key
• apply insertion sort on a doubly linked list (iterative, external)
• implement a method to reverse a doubly linked list (iterative, recursive)
• implement a method to get count (iterative, recursive, external)

3rd exercise

• implement Queues using DoublyLinkedLists

1st exercise

• implement a method to create a BST of an array

2nd exercise

• implement a method to get max of a BST (recursive, iterative)

3rd exercise

• implement a method to get max of a BT (recursive, iterative)

4th exercise (recursive)

• implement a method to get size of a BST
• implement a method to get num of leaves of a BST
• implement a method to get sum of nodes of BST
• implement a method to check if the tree is a BST
• implement a method to number of left nodes of a BST
• implement a method to number of occurences of a key in BST
• implement a method to get number of duplicates of a key in BST
• implement a method to mirror a BST
• implement a method to get the number of odd nodes in BST

5th exercise

• implement a method to get level of a key in BST

6th exercise

• implement a method to double value of nodes of a BST (recursive)

7th exercise

• implement a method to check if two BSTs are identical (recursive)

• print a certain level of a BT (recursive)

• breadth first traversal of a BT (recursive)

• print elements of a BT in descending order (recursive, iterative)

• print range of elements of a BT (recursive)

• preOrder traversal of a BT (iterative)

• get path of an element in a BT (recursive, iterative)

• getting the height of a BT (recursive, iterative)

• remove duplicates from an unsorted array

• create class my hash table
  • insert an element
  • find an element
  • is full & is Empty
  • size
  • toString

• get systematic difference { (A - B) union (B - A) } of 2 arrays