Question

Q1)(20p)Write a static member function called removeLongestRepeatingSegment that takes a String argument. The method will return a new String by removing the logest segment that contains consequtively repeating characters.

public static void main(String []args){

String s=”1111222223333311111111444455552222”;

String res= removeLongestRepeatingSegment(s); will return “11112222233333444455552222”

}

public static String removeLongestRepeatingSegment(String s){

---------------

Q2)15p)Given a list of objects stored (in ascending order) in a sorted linked list, implement member method which performs search as efficiently as possible for an object based on a key. (Note that the key type matches the field type by whichthe linked list is sorted.). The method returns refenence to the node containing the key, otherwise null is returned.

--------------------

that returns true if two singly linked lists are intersecting Q3) 25p)Write a member function for a LList class isIntersects t (as shown below int the figure), otherwise, the method would return false. Do not make any assumption on the number of nodes of each linked list

-----------------------

Q4)
a)(5p)Evaluate the postfix expression 30   16 6 2 - / * 8 +   using postfix evaluation algorithm by writing necessary pop push operation. (Do not write implementation)

b)(5p)Write the prefix form of expression A + B * D + E / (F + A) * D + C   using paranthesis method.

c) (10p)Write a method called moveNthFront that takes as a parameter a positive integer n and Queue. The function moves the nth element of the queue to the front while keeping the other items in their placeses.

     f             r
q={4 6 8 9 47 5 12} n=4                     f              r            
after call to the function queue becomes q={9 4 6 8 47 5 12}            

---------------------------------

Q5)(20p) Linked list contains consecutive repeated int numbers as illustreded in example. Write a method shrink()what removes repeated numbers and leave one copy for each sequence of repeated number.

L: 6->6->6->6->5->5->5->10->10->10->10->5->5->5->5->3->null

Resultant List after shrink() method

L: 6->5->10->5->3->null

Answer 1

Q3)

CODE

public boolean isIntersects(LList headA, LList headB) {

int len1 = 0;

int len2 = 0;

ListNode p1=headA, p2=headB;

if (p1 == null || p2 == null)

return false;

while(p1 != null){

len1++;

p1 = p1.next;

}

while(p2 != null){

len2++;

p2 = p2.next;

}

int diff = 0;

p1=headA;

p2=headB;

if(len1 > len2){

diff = len1-len2;

int i=0;

while(i<diff){

p1 = p1.next;

i++;

}

}else{

diff = len2-len1;

int i=0;

while(i<diff){

p2 = p2.next;

i++;

}

}

while(p1 != null && p2 != null){

if(p1.val == p2.val){

return true;

}

p1 = p1.next;

p2 = p2.next;

}

return false;

}

NOTE: As per HOMEWORKLIB POLICY, I am allowed to answer only 1 coding question (including sub-parts) on a single post. Kindly post the remaining questions separately and I will try to answer them. Sorry for the inconvenience caused.