- Upvotes Received
- 1
- Posts with Upvotes
- 1
- Upvoting Members
- 1
- Downvotes Received
- 0
- Posts with Downvotes
- 0
- Downvoting Members
- 0
10 Posted Topics
Hi to all of you! I'm using Eclipse Luna 4.4.1 for Mac. I have made a project for a Java seminar I am attending.My project consisits of several classes that runned perfectly fine...until today.That is , when I opened one of my classes and made some changes I started getting … | |
HI! I want to write a constructor that will make a window (a frame). I want to be able to insert the height, width, position and window color. This is what I've written: public Window(String name, int height, int width,String c,String isActive,int PointX, int PointY){ setTitle(name); setSize(height,width); getContentPane().setBackground(Color.c); setLocation(PointX,PointY); setVisible(isActive.equals("active")); … | |
Hi! I am supposed to write a programm for making a window.First of all, I must make a window with some given default values. Below is the code that I have been given as a template public class Window { private String name; private int height; private int width; private … | |
Hi! I'm having a project where I must give 2 integers and divide them. I must use the NumberFormatException to make sure that those two numbers are only integers( and display a message when they aren't) and the ArithmeticException to make sure that the can be divided (and display amessage … | |
Hi! I cannot figure out how to install and use a database that I am given for a project. I'm running Windows 7. Can anybody help me? | |
Hi! I've got an exercise regarding 8085 interrupts. I have a 8085 microprocessor whose memory addresses from 0024h to 003Fh are the following 24 C3 25 00 26 FF 27 00 28 C3 29 00 2A F5 2B 00 2C C3 2D 80 2E F5 2F 00 30 C3 31 … | |
Hi! I have some recursive functions to solve... 1) T(n)=5T(2n/3) + n^3 (lgn)^2 2)T(n)= 2T(n/8)+ n^1/3 3)T(n)= 2T(n^1/2)+n It's the first time that I'm dealing with those kind of things,so I would appreciate some help. I used the Master Theorem on the second function and the result is T(n)=Θ(n^2). However, … | |
Hi to all of you! I'm new to this,so I could use a little help! I've been given some algorithms and I've been asked to find an upper and lower bound of the time complexity of them. First of all, I would like to know if finding the upper and … | |
Hi! I've got this structure struct *cell{int row,int column,int distance, struct cell *next}. By calling a function, I fill a linked list . The problem is that I cannot find how to delete the nodes that have the same row and column.Let me provide an example. Let's say that the … | |
Re: let me do this for you,as it seems that we have the same exercise with cuckas. we have a structure struct *cell {int row, int column, int distance, struct cell *next}. Row and column refer to the position of a pawn on a game table. Distance refers to the distance … |
The End.