Ima li ko kakvu preporuku odakle uciti OOP (znam da postoje brojni tutorijali i google bla bla)? Mislim na neki savjet, kako ste vi ucili? Trenutno ucim Javu, i ulazimo u OP pa me zanima, kako to da sto bolje savljadam, jer do sada se nisam susretao sa objektima, klasama, a i vidim da to vecinom predstavlja problem pocetnicima. Do sada sam samo radio klasicne programe. Kada koristiti stack, mapu, array .. kako nauciti takve stvari? Bio bi zahvalan ako bi neko od iskusnijih podijelio svoje stavove i misljenja s nama pocetnicima. :)
OOP Java preporuke
Zaključano
Zakačeno
Ja kad sam krenuo koristio sam knjigu - http://www.deitel.com/Books/Ja...bjects/tabid/3656/Default.aspx
Naravno to je bila neka druga verzija 2003 godine.
Skoro sam video da codeacademy ima javu - https://www.codecademy.com/learn/learn-java
A najbolje ucenje je
1. Pogledas neku knjigu
2. Smislis neki projekat - npr - adresar, album, "spomenar" i slicno
3. I krenes da radis
Naravno to je bila neka druga verzija 2003 godine.
Skoro sam video da codeacademy ima javu - https://www.codecademy.com/learn/learn-java
A najbolje ucenje je
1. Pogledas neku knjigu
2. Smislis neki projekat - npr - adresar, album, "spomenar" i slicno
3. I krenes da radis
Ja sam procitao ovu knjigu
http://www.cet.rs/knjige/item/...o-orijentisani-nacin-misljenja
http://www.cet.rs/knjige/item/...o-orijentisani-nacin-misljenja
Potpis
http://i.imgur.com/V3feW.jpg
http://on.wsj.com/H9yjz6 -- India Graduates Millions, but Too Few Are Fit to Hire
http://on.wsj.com/H9yjz6 -- India Graduates Millions, but Too Few Are Fit to Hire
Ja bih preporučio učenje jezika u kome je OOP jednostavniji nego u Javi. Na kraju tako ubiješ dve muve jednim udarcem - lakše savladaš Javin OOP i naučiš još jedan programski jezik. :)
Hvala Jablan, ali sada trenutno nemam vremena da radim u drugom jeziku. Imam malo iskustva u c++ ali se nikad nisam bavio objektima. Trenutno mi samo Java prolazi, zato nemam kad da ucim neki drugi jezik.
Ok, možda nekom drugom bude od koristi, evo moja preporuka za knjigu:
http://www.amazon.com/Seven-La...ming-Programmers/dp/193435659X
http://www.amazon.com/Seven-La...ming-Programmers/dp/193435659X
Jel mogu da se porucuju knjige sa Amazona u Srbiju? Znam da razni predmeti ne mogu. Interesuje me papir a ne pdf tako da preduhitrim savete da nadjem pdf.
Mogu. Postarina je malo veca nego za EU i severnu ameriku.
1Sviđa mi se :thumbsup: 1
izmenjeno 1 put, poslednji put Bond123 25.11.2015. u 16:26
Izmene poruke
- Bond12325.11.2015. u 16:26zapis iz teksta poruke
Moze asistencija pri programu. Pokusavam ovaj kod iz knjige da implementiram ali mi izbacuje 4 errora. Ako moze neko da mi objasni zasto ne radi, i sta da ispravim da bi radilo? Evo kod:
To je simulacija jedne kase, recimo, u kojoj se unose cijene i broje se proizvodi. Uostalom shvaticete kad procitate kod, jer cak ni meni nije tezak za shvatiti. Hvala
To je simulacija jedne kase, recimo, u kojoj se unose cijene i broje se proizvodi. Uostalom shvaticete kad procitate kod, jer cak ni meni nije tezak za shvatiti. Hvala
Code:
public class klasa{
public static void main(String []args){
CashRegister register1 = new CashRegister();
register1.addItem(1.95);
System.out.println(register1.getCount());
}
}
class cashRegister{
private int itemCount;
private double totalPrice;
public CashRegister(){
itemCount=0;
totalPrice=0;
}
public void addItem(double price){
itemCount++;
totalPrice=totalPrice + price;
}
public double getTotal(){
return totalPrice;
}
public int getCount(){
return itemCount;
}
public void clear(){
itemCount=0;
totalPrice=0;
}
}
public class klasa{
public static void main(String []args){
CashRegister register1 = new CashRegister();
register1.addItem(1.95);
System.out.println(register1.getCount());
}
}
class cashRegister{
private int itemCount;
private double totalPrice;
public CashRegister(){
itemCount=0;
totalPrice=0;
}
public void addItem(double price){
itemCount++;
totalPrice=totalPrice + price;
}
public double getTotal(){
return totalPrice;
}
public int getCount(){
return itemCount;
}
public void clear(){
itemCount=0;
totalPrice=0;
}
}
c treba da bude veliko - znaci NE - class cashRegister{ vec class CashRegister{
Code:
public class ES {
public static void main(String []args){
CashRegister register1 = new CashRegister();
register1.addItem(1.95);
System.out.println(register1.getCount());
}
}
class CashRegister {
private int itemCount;
private double totalPrice;
public CashRegister() {
itemCount = 0;
totalPrice = 0;
}
public void addItem(double price) {
itemCount++;
totalPrice = totalPrice + price;
}
public double getTotal() {
return totalPrice;
}
public int getCount() {
return itemCount;
}
public void clear() {
itemCount = 0;
totalPrice = 0;
}
}
public class ES {
public static void main(String []args){
CashRegister register1 = new CashRegister();
register1.addItem(1.95);
System.out.println(register1.getCount());
}
}
class CashRegister {
private int itemCount;
private double totalPrice;
public CashRegister() {
itemCount = 0;
totalPrice = 0;
}
public void addItem(double price) {
itemCount++;
totalPrice = totalPrice + price;
}
public double getTotal() {
return totalPrice;
}
public int getCount() {
return itemCount;
}
public void clear() {
itemCount = 0;
totalPrice = 0;
}
}
1. Koristi CODE tag kad kačiš kod
2. Poštuj pravila pisanja jezika koji koristiš (klase se pišu velikim slovom, promenljive i metode malim)
http://ideone.com/g8FlGm
2. Poštuj pravila pisanja jezika koji koristiš (klase se pišu velikim slovom, promenljive i metode malim)
http://ideone.com/g8FlGm
Hvala na pomoci momci :)
Jedno pitanje : Ucim implementirati ove Stacks, Queues and Dequeus, i naisao sam na jedan kod u kojem mi je sve jasno osim jedne stvari
ono sto meni nije jasno je, zbog cega u metodi insertFront stoji deque.add(0,item) ? Ova nula mi nije jasna, pokusao sam staviti bez nule, ali mi pri testiranju zadnji broj koji upisem pozivom metode insertFront (4999) npr. upise na kraju, ovako : insertFront(4999) - [23,45,4999] umjesto [4999,23,45], dok u prethodnim redovima izvrsavanja metode upisuje normalno broj na pocetak? o.O (ovi brojeve 23 i 45 sam random stavio cisto da vam pokazem na sta mislim)
Code:
public class DoubleEndedQueueImpl {
private List<Integer> deque = new ArrayList<Integer>();
public void insertFront(int item){
//add element at the beginning of the queue
System.out.println("adding at front: "+item);
deque.add(0,item);
System.out.println(deque);
}
public void insertRear(int item){
//add element at the end of the queue
System.out.println("adding at rear: "+item);
deque.add(item);
System.out.println(deque);
}
public void removeFront(){
if(deque.isEmpty()){
System.out.println("Deque underflow!! unable to remove.");
return;
}
//remove an item from the beginning of the queue
int rem = deque.remove(0);
System.out.println("removed from front: "+rem);
System.out.println(deque);
}
public void removeRear(){
if(deque.isEmpty()){
System.out.println("Deque underflow!! unable to remove.");
return;
}
//remove an item from the beginning of the queue
int rem = deque.remove(deque.size()-1);
System.out.println("removed from front: "+rem);
System.out.println(deque);
}
public int peakFront(){
//gets the element from the front without removing it
int item = deque.get(0);
System.out.println("Element at first: "+item);
return item;
}
public int peakRear(){
//gets the element from the rear without removing it
int item = deque.get(deque.size()-1);
System.out.println("Element at rear: "+item);
return item;
}
public static void main(String a[]){
DoubleEndedQueueImpl deq = new DoubleEndedQueueImpl();
deq.insertFront(34);
deq.insertRear(45);
deq.removeFront();
deq.removeFront();
deq.removeFront();
deq.insertFront(21);
deq.insertFront(98);
deq.insertRear(5);
deq.insertFront(43);
deq.removeRear();
}
}
public class DoubleEndedQueueImpl {
private List<Integer> deque = new ArrayList<Integer>();
public void insertFront(int item){
//add element at the beginning of the queue
System.out.println("adding at front: "+item);
deque.add(0,item);
System.out.println(deque);
}
public void insertRear(int item){
//add element at the end of the queue
System.out.println("adding at rear: "+item);
deque.add(item);
System.out.println(deque);
}
public void removeFront(){
if(deque.isEmpty()){
System.out.println("Deque underflow!! unable to remove.");
return;
}
//remove an item from the beginning of the queue
int rem = deque.remove(0);
System.out.println("removed from front: "+rem);
System.out.println(deque);
}
public void removeRear(){
if(deque.isEmpty()){
System.out.println("Deque underflow!! unable to remove.");
return;
}
//remove an item from the beginning of the queue
int rem = deque.remove(deque.size()-1);
System.out.println("removed from front: "+rem);
System.out.println(deque);
}
public int peakFront(){
//gets the element from the front without removing it
int item = deque.get(0);
System.out.println("Element at first: "+item);
return item;
}
public int peakRear(){
//gets the element from the rear without removing it
int item = deque.get(deque.size()-1);
System.out.println("Element at rear: "+item);
return item;
}
public static void main(String a[]){
DoubleEndedQueueImpl deq = new DoubleEndedQueueImpl();
deq.insertFront(34);
deq.insertRear(45);
deq.removeFront();
deq.removeFront();
deq.removeFront();
deq.insertFront(21);
deq.insertFront(98);
deq.insertRear(5);
deq.insertFront(43);
deq.removeRear();
}
}
ono sto meni nije jasno je, zbog cega u metodi insertFront stoji deque.add(0,item) ? Ova nula mi nije jasna, pokusao sam staviti bez nule, ali mi pri testiranju zadnji broj koji upisem pozivom metode insertFront (4999) npr. upise na kraju, ovako : insertFront(4999) - [23,45,4999] umjesto [4999,23,45], dok u prethodnim redovima izvrsavanja metode upisuje normalno broj na pocetak? o.O (ovi brojeve 23 i 45 sam random stavio cisto da vam pokazem na sta mislim)
Jesi čitao dokumentaciju?
https://docs.oracle.com/javase...il/ArrayList.html#add(int,%20E)
Citat:
Inserts the specified element at the specified position in this list.
https://docs.oracle.com/javase...il/ArrayList.html#add(int,%20E)