Posts
 
Reputation
Joined
Last Seen
0 Reputation Points
100% Quality Score
Upvotes Received
1
Posts with Upvotes
1
Upvoting Members
1
Downvotes Received
0
Posts with Downvotes
0
Downvoting Members
0
2 Endorsements
Ranked #621
~23.4K People Reached
Favorite Tags
Member Avatar for Roger_2

**below is the problem i am given, after this i explain where i am at so far and the code i have created, **Write the following functions in Scheme: 1.a "digitinc4" -takes as input a 4-digit integer, and returns another 4-digit integer constructed of the original input integer's digits, each …

Member Avatar for Taywin
0
454
Member Avatar for Roger_2

i cannot find a reliable source online that explains the proper syntax and my instructor's help is negligible. Please any insight is greatly appreciated. This is my last study guide question for my final later today! the problem is identified with arrows below. i was provided source code to a …

Member Avatar for JamesCherrill
0
545
Member Avatar for Roger_2

part of my program includes my boolean 2d array: `boolean[][] matrix = new boolean[V][V];`i want to iterate through the vertex and check if it is true but am getting error: cannot convert from boolean[] to boolean. casting `(boolean)` does not help. i have also tried `boolean[v][w] == true`. here is …

Member Avatar for JamesCherrill
0
257
Member Avatar for Roger_2

I am having trouble implementing a solution using a binary search tree that returns the key of the node based on it's rank in O(N) worst case running time. Every idea i have (listed below) results in O(N^2) or sends me to a dead end. This almost seems impossible. i …

Member Avatar for AssertNull
0
1K
Member Avatar for Roger_2

i have created a recursive method that returns the size of a binary search tree, i would like to analyze the running time of my implementation but i dont know how. I know the best case is O(1) if node is null but what about worst case? my researches online …

Member Avatar for Mickey_2
0
419
Member Avatar for Roger_2

What should happen is when i click the log in button, the container for the log in form should become hidden and the sidebar, search bar, tiles and log out button should appear. I sometimes experience that if i have to click the log in button twice for it to …

Member Avatar for broj1
0
409
Member Avatar for Roger_2

the source of the line is provided below, i understand what v.compareTo(w) does but i am curious as to what influence the < 0 has, does it not allow it to return if compareTo returns 1 which is greater than 0? does it not return if anything if compareTo returns …

Member Avatar for rubberman
0
176
Member Avatar for Roger_2

i am working on an infix to postfix project and have reached a troubling point. one by one i must extract a string token from the string being inputted to the method infixtopostfix and one by one input them to the front of the deque named postfix. i dont understand …

Member Avatar for Roger_2
0
541
Member Avatar for Roger_2

this is my latest class assignment, i would really appreciate some assistence with my pseudo code to help me in the right direction. my code skeleton is provided at the end of this post. Deque A double-ended queue, often abbreviated deque and pronounced deck, is an object with the following …

Member Avatar for JamesCherrill
0
364
Member Avatar for Roger_2

hello everyone! my program is nearing completion and is due tommrow. However i have identified the source of an issue. i am cycling through a few functions which roll a dice 1-6 and add that result to a buffer to keep score.Then when i want to print, i am only …

0
106
Member Avatar for Roger_2

thank you all of you for the help i really appreciate it. i have a hopefully quick question, is this the correct syntax for adding an integer to a buffer: " add dword [userScore], 6 " or do i have to convert the userScore buffer to integer then add and …

Member Avatar for Roger_2
0
240
Member Avatar for Roger_2

my objective is to create a simple game called Pig. The rules are 2 players (you and the computer) are racing to reach 100 points. Each turn, the active player faces a decision: a) Hold, take your turn total and add it to the player's overall total. The next player …

Member Avatar for Roger_2
0
343
Member Avatar for Roger_2

I have tried with the algorithm below but it does not generate the results i am looking for and i am a bit stumped. I have tried swapping the elements in the array, unless you know there is a less trouble sum alternative example: 1,2,3,4,5 becomes 5,4,3,2,1. i have searched …

Member Avatar for nullptr
0
1K
Member Avatar for Roger_2

Generally, my professor's assignments are vague with limited constraints. while this allows the opportunity to become resourceful and creative, there are some like i who are blindly lost without a push in the right direction, this is my assignment please any insight is much appreciated. We are going to work …

Member Avatar for sbesch
0
954
Member Avatar for Roger_2

please help me, i need to print my array in nasm. this is what i have so far, section .bss section .data array dd 1,2,3,4,5 arraylen equ $ - array section .text global _start: _start: mov edx, arraylen mov ecx, array mov ebx, 1 mov eax, 4 int 80h exit: …

Member Avatar for Roger_2
0
13K
Member Avatar for Roger_2

my assignment involves creating a grading program. my program must accept a number from the user within the 0 - 100 range and return the corresponding letter grade based on this rubric: 90 to 100 = A 80 to 89 = B 70 to 79 = C 60 to 69 …

Member Avatar for sbesch
0
3K
Member Avatar for Roger_2

I am attempting to reverse an array2 however my program seg faults and ends right at `mov eax, dword [edi]` . theoretically this should work just fine. please any insight or alternative method/recommendations, my professor and pupils are equally stumped. Anything is much appreciated, this is my code: global _start: …

Member Avatar for sbesch
0
269