© Copyright Our Wall
Programming assignments can be daunting for many students, especially when it comes to complex languages like Eiffel. However, with the right guidance and resources, tackling these assignments can become a rewarding experience. At programminghomeworkhelp.com, we understand the challenges students face, which is why we specialize in offering top-notch assistance with programming assignments, including eiffel programming assignment help.
Let's delve into a couple of master-level programming questions in Eiffel along with their solutions, completed by our seasoned experts:
Question 1: Implementing a Stack in Eiffel
You've been tasked with implementing a stack data structure in Eiffel. The stack should support the following operations:
1. `push`: Adds an element to the top of the stack.
2. `pop`: Removes and returns the top element from the stack.
3. `peek`: Returns the top element of the stack without removing it.
4. `isEmpty`: Returns true if the stack is empty, false otherwise.
Solution:
class STACK
feature
make
-- Initialize an empty stack
do
create items.make
end
push (item: INTEGER)
-- Add an element to the top of the stack
do
items.extend(item)
end
pop: INTEGER
-- Remove and return the top element from the stack
do
if not is_empty then
Result := items.last
items.remove_tail
end
end
peek: INTEGER
-- Return the top element of the stack without removing it
do
if not is_empty then
Result := items.last
end
end
is_empty: BOOLEAN
-- Check if the stack is empty
do
Result := items.is_empty
end
private
items: LINKED_LIST[INTEGER]
end
Question 2: Implementing a Binary Search Algorithm in Eiffel
You need to implement a binary search algorithm in Eiffel to search for a given element in a sorted array. The algorithm should return the index of the element if found, otherwise -1.
Solution:
class BINARY_SEARCH
feature
binary_search (arr: ARRAY[INTEGER]; target: INTEGER): INTEGER
-- Perform binary search on a sorted array
-- Return the index of the target element if found, else -1
local
l, r, mid: INTEGER
do
l := 1
r := arr.count
Result := -1
from
until l > r
loop
mid := (l + r) // 2
if arr[mid] = target then
Result := mid
exit
elseif arr[mid] < target then
l := mid + 1
else
r := mid - 1
end
end
end
end
These solutions demonstrate the elegance and simplicity of implementing fundamental data structures and algorithms in Eiffel. If you find yourself struggling with similar assignments or need assistance with any aspect of Eiffel programming, don't hesitate to reach out to our expert team for reliable Eiffel programming assignment help.
The Wall