VECII.BLOGSPOT.COM

mustafasoyvural.blogspot.com

Mustafa Veysi Soyvural: March 2009

http://mustafasoyvural.blogspot.com/2009_03_01_archive.html

Friday, 27 March 2009. WHICH ONE JAVA DOES SUPPROT? CALL BY REFERENCE or CALL BY VALUE. Many developers know that Java supports " call by references. When a method is invoked. They claim that java only use " call by value. When parameters are primitive types. And what about the truths :) the truth is absolutely different then this myth. EVERYTHNG IN JAVA PASSED BY VALUE SO JAVA SUPPORTS ONLY " CALL BY VALUE. C also supports both of call by reference and call by value methods. Using namespace std;. I also...

mustafasoyvural.blogspot.com

Mustafa Veysi Soyvural: April 2008

http://mustafasoyvural.blogspot.com/2008_04_01_archive.html

Tuesday, 8 April 2008. Click here to download. Her türlü sorularınız için: soyvural@gmail.com. Ayrıca comment yazarak da anlamadığınız şeyleri sorabilirsiniz böylece diğer arkadaşlar da faydalanmış olur. NOT: Geliştirme ortamı olarak Eclipse 3.2 veya 3.3 kullanmanız tavsiye edilir. Turkcell Teknoloji'de geliştirme ortamı olarak bu ürünü kullandığımızdan staj döneminde sizin için daha iyi olur. GELEN SORULAR ÜZERİNE CEVAPLAR. Input dosyasındaki gate sayısının output dosyasına etkisi nedir? Tam olarak anla...

mustafasoyvural.blogspot.com

Mustafa Veysi Soyvural: December 2007

http://mustafasoyvural.blogspot.com/2007_12_01_archive.html

Sunday, 23 December 2007. Rotation of a String. Given a string s1 and a string s2, write a snippet to say whether s2 is a. Rotation of s1 using only one call to strstr routine? Eg given s1 = ABCD and s2 = CDAB, return true,. Given s1 = ABCD, and s2 = ACBD , return false). If you add s1by itself then you will get s1=AB CDAB. CD, as you can see now you will be able to make a decision whether s2 is a rotation or not. Both s1 and s2 are NULL. S1 = " 0", s2 = " 0" ( the rotation of empty string is itself:) ).

mustafasoyvural.blogspot.com

Mustafa Veysi Soyvural: WHICH ONE JAVA DOES SUPPROT? CALL BY REFERENCE or CALL BY VALUE

http://mustafasoyvural.blogspot.com/2009/03/which-one-java-does-supprot-call-by.html

Friday, 27 March 2009. WHICH ONE JAVA DOES SUPPROT? CALL BY REFERENCE or CALL BY VALUE. Many developers know that Java supports " call by references. When a method is invoked. They claim that java only use " call by value. When parameters are primitive types. And what about the truths :) the truth is absolutely different then this myth. EVERYTHNG IN JAVA PASSED BY VALUE SO JAVA SUPPORTS ONLY " CALL BY VALUE. C also supports both of call by reference and call by value methods. Using namespace std;. I also...

mustafasoyvural.blogspot.com

Mustafa Veysi Soyvural: November 2007

http://mustafasoyvural.blogspot.com/2007_11_01_archive.html

Tuesday, 27 November 2007. Reverse a stack "in-place". While i am searchig data structure questions on. The net, i encountered a very nice question. About stacks.Thanks Gowri Kumar for this. Write a C Program to reverse a stack "in place". You can only use the following ADT functions. What we require is:. Before : A B C D. After : D C B A. Before : A B C D. Step 1 : D A B C. Step 2 : D C A B. Step 3 : D C B A. Basically, at each step I am bringing the. Bottom most element to the top of the. Push(b) D B C.

mustafasoyvural.blogspot.com

Mustafa Veysi Soyvural: October 2007

http://mustafasoyvural.blogspot.com/2007_10_01_archive.html

Tuesday, 30 October 2007. I wanna just talk about binary search tree which is also familiar among most of the software engineers. BST (Binary Search Tree) has a few simple rules:. Each node must have a value. All the left subtree nodes must have values less than the node's value. All the right subtree nodes must have values greater or equal than the node's value. After this introductory definition, and now it is the best time to do some exercises on BST. First of all, lets start with traversals of BST.

mustafasoyvural.blogspot.com

Mustafa Veysi Soyvural: January 2008

http://mustafasoyvural.blogspot.com/2008_01_01_archive.html

Monday, 28 January 2008. Regular Expressions with Finite State Machines. Let's make a "Finite State Machine" which is used to check "a*b" regular expression. At first we must design the FSM. State * const nextState;. State( State and next, bool isFinal ) : nextState( &next ) { isFinal = isFinal; }. Virtual State * transition( char in ) = 0;. Bool isFinalState { return isFinal; }. State { isFinal = false; }. Class State1 : public State {. State * transition( char in );. If( in = '0' & in. Else return NULL;.