Lava

what is different between BCL (Base Class Library) and FCL (Framework Class Library) in Microsoft dot net (.net)?

2008-06-16T07:00:00.001-07:00

Base Class Library :

The Base Class Library (BCL) is a standard library available to all languages using the .NET Framework. In order to make the programmer's job easier, .NET includes the BCL in order to encapsulate a large number of common functions, such as file reading and writing, graphic rendering, database interaction, and XML document manipulation. It is much larger in scope than standard libraries for most other languages, including C++, and would be comparable in scope to the standard libraries of Java.

Framework Class Library:

The .NET Framework Class Library (FCL) consists of a series of classes, interfaces, and value types that can be used to program with. The .NET Framework has types that allow one to easily:

Create extravagant graphical user interface applications
(System.Windows.Forms)
Access and manipulate data in various database formats (System.Data and System.Xml)
Dynamically query type information (System.Reflection)
Perform basic Input/Output operations (System.IO)
Perform operating system security checks (System.Security)
Create internet enabled applications (System.Net and System.Net.Sockets)
Create dynamic web based applications – also known as ASP.NET (System.Web)
Access basic data types, event handlers, and exceptions (System)

what is different between BCL and FCL in dot net (.net)?

BCL , FCL both are not same. The Base Class Library (BCL), sometimes incorrectly referred to as the Framework Class Library (FCL) (which is a superset including the Microsoft.* namespaces), is a library of types available to all languages using the .NET Framework. The BCL provides classes which encapsulate a number of common functions such as file reading and writing, graphic rendering, database interaction, XML document manipulation, and so forth. The BCL is much larger than other libraries, but has much more functionality in one package. The BCL would include everything in mscorlib and system and possibly some additional assemblies. It includes all the type, assembly, reflection and collection classes of the framework (among others). It does not include ASP.NET, ADO.NET, WinForms, management namespace and other classes/namespaces that provide additional functionality.

FCL = All namespaces (entire framework).

BCL = Common namespaces (core framework).

FCL = BCL + everything else that ships as part of the .NET Framework.

Download the latest SQL Server 2008 trial software Today

2008-06-03T00:05:00.001-07:00

Download the latest SQL Server 2008 Community Technology Preview (CTP) and try out the latest features for 180 days! The SQL Server development team uses your feedback to help refine and enhance product features. Download the newest CTP today and share your feedback.

Select one of the options listed below. The CTP software for IT Professionals and Developers is exactly the same, but the supporting experience has been tailored to offer greater relevance for each profession

Download Eclipse Classic 3.3.2 eclipse-SDK-3.3.2-win32.zip - free

2008-05-12T05:14:00.001-07:00

Eclipse 3.3.2 :

Download eclipse -SDK-3.3.2-win32.zip just click on download button below.

You will need a Java 5 JRE recommended.

Eclipse Classic is the most recent release from the Eclipse top-level project (it is what has traditionally been the main download on this site). It contains what you need to build applications based on Eclipse technology, including integrated development environments (IDE), and rich client applications using the Eclipse Rich Client Platform (RCP). The Eclipse Classic provides superior Java editing with incremental compilation, the Plug-in Development Environment (PDE), complete source code for the Eclipse Platform, and much more.

click here to download

Download Visual Studio 2008 Professional Edition & Team System 2008 Trial Software – Free:

2008-05-12T03:37:00.001-07:00

Download Visual Studio 2008 Professional Edition 90-Day Trial – free:

You can Download Visual Studio Team System 2008 90-day trial software. Just click on Download button below

Download Visual Studio Team System 2008 Trial Software – Free:

You can Download Visual Studio Team System 2008 - Trial Software. . Just click on Download button below

Difference between String and StringBuilder

2008-05-08T07:57:00.001-07:00

C# and Java What is the difference between String and StringBuilder classes?

String is an object. Both String and StringBuilder class stores strings

String :

String is immutable i.e. Read only, non updatable.

Example: String somename = "Lavakumar";

We cannot change a String object after creating one.It means we can’t change the value internally.

If you want change the value of somename object a new object is created then the reference of somename object is changed to new object. The old object is collected by GC ( garbage collecter).

Example: String somename = "sangeetham";

New object with value “sangeetham” is created. Then the reference of somename variable changed from “Lavakumar” object to “sangeetham” object. And the old object “sangeetham” is collected by GC (garbage collector).

Example:

using System;

sing System.Text;

public class string

{

static void Main()

{

DateTime start = DateTime.Now;

string x = "";

for (int i=0; i < 100000; i++)

{

x += "~";

}

DateTime end = DateTime.Now;

Console.WriteLine ("Time taken: {0}", end-start);

}

It takes nearly 10 seconds. Double the number of iterations, and it takes over a minute.

The problem is that strings not changeable (immutable). Just because we're using "+=" here doesn't mean the runtime actually appends to the end of the existing string. In fact, x += "!"; is absolutely equivalent to x = x+"!";. The concatenation here is creating an entirely new string, allocating enough memory for everything, copying all the data from the existing value of x and then copying the data from the string being appended ("~"). As the string grows, the amount of data it has to copy each time grows too, which is why the time taken didn't just double when I doubled the number of iterations.

String Builder :

String Builder is mutable i.e. subject to change.(we can change the value, updatable)

Default some space is allocated for String Builder.

If you are using for loop definitely go to stringBuilder.

It gives better performance when we are adding more than 10 strings.

In this there is no object creation for each addition. So String Builder is faster than String.

String builder initially some default memory.

By using StringBuilder.Append() method we can append Strings.

Example:

using System;

using System.Text;

public class stringbuild

{

static void Main()

{

DateTime start = DateTime.Now;

StringBuilder builder = new StringBuilder();

for (int i=0; i < 100000; i++)

{

builder.Append("~");

}

string x = builder.ToString();

DateTime end = DateTime.Now;

Console.WriteLine ("Time taken: {0}", end-start);

}

It takes nearly 30-40ms only. The time taken is roughly linear in the number of iterations (i.e. double the iterations and it takes twice as long). It does this by avoiding unnecessary copying - only the data we're actually appending gets copied. StringBuilder maintains an internal buffer and appends to that, only copying its buffer when there isn't room for any more data. (In fact, the internal buffer is just a string - strings are immutable from a public interface perspective, but not from within the mscorlib assembly.) We could make the above code even more efficient by passing the final size of the string (which we happen to know in this case) to the constructor of StringBuilder to make it use a buffer of the right size to start with - then there'd be no unnecessary copying at all. Unless you're in a situation where you have that information readily to hand though, it's usually not worth worrying about - StringBuilder doubles its buffer size when it runs out of room, so it doesn't end up copying the data very many times anyway.

visualized comparison of both:

no of iterates

( blue)is the performance of the pure String approach.

(red) is StringBuilder at its basic settings.

(green) represents a StringBuilder initialized to the size of the final string.

StringBuilder performance can sometimes be a bit tricky because there’s kinda “break-even-point” you always keep in mind.

Conclusion:
If you have to concatenate a string more than 10 times, it’s better to use StringBuilder.

Java difference between thread start vs run methods

2008-05-02T23:12:00.001-07:00

It is very impotent to know the difference between thread start run methods. both will executes the same run method. There is some very small but important difference between using start() and run() methods. Look at two examples below:

The result of running examples will be different.

Example : 1

Thread one = new Thread(); Thread two = new Thread(); one.run(); two.run();

In This Example the threads will run sequentially: first, thread number one runs, when it exits the thread number two starts.

Example : 2

Thread one = new Thread(); Thread two = new Thread(); one.start(); two.start();

In This Example both threads start and run simultaneously.

Example : 3

public class TesTwo extends Thread {
    public static void main(String[] args) throws Exception{
        TesTwo t=new TesTwo();
        t.start();
        t.run();
        doIt();
    }
public void run()

{
System.out .println("Run");
}
private static void doIt()

{
System.out.println("doit. ");
}
}

Output:

Run
Run
doit.

In this example the start(public void run()) and run methods will executes simultaneously.Because after execution of start statement there are two simultaneous ways.

t.start();

t.run(); public void run()

the two lines will executes simultaneous . so the output will print Run Run in output. after completion of public void run method then controller will return to doIt method. At last the method do It will execute.

Example : 4

public class TesTwo extends Thread {
    public static void main(String[] args) throws Exception{
        TesTwo t=new TesTwo();
        t.run();
        t.start();
        doIt();
    }
public void run(){
    System.out .println("Run");
}
    private static void doIt() {
        // TODO Auto-generated method stub
        System.out.println("doit. ");
    }
}

Output:

Run
doit.
Run

In this example the run method will executes synchronously.so the in output it prints first line "Run". Next start and doit methods will executes simultaneously.Because after execution of start statement there are two simultaneous ways.

t.start();

doIt(); public void run()

the two lines will executes simultaneous . so the output will print " doit. Run" in output second and third line.

Conclusion: The start() method call run() method asynchronously does not wait for any result, just fire up an action), while we run run() method synchronously - we wait when it quits and only then we can run the next line of our code.

Start()--> asynchronous.

run() -->synchronous.

JNTU Btech Online Bits, Previous Question papers, all in one, Books Download

2008-04-27T03:20:00.001-07:00

Hi

i have collected all JNTU B.Tech (ECE, CSE,EEE,IT,MECH)Online Bits and Previous Question Papers of all years(1st year, 2nd year, 3rd year,4th year)

Jntu Btech 1ST year ECE ONLINE BITS

I year previous Question Papers:

R05AprilMay2007-IB.Tech

BEE ------ Click Here
CDS ------ Click Here
EDC ------ Click Here
NA ------ Click Here
AP ------- Click Here

I year Online Bits:

APPLIED PHYSICS ------> CLICK HERE TO DOWNLOAD
C & DS ------------------> CLICK HERE TO DOWNLOAD
EDC ---------------------> CLICK HERE TO DOWNLOAD
M 1----------------------> CLICK HERE TO DOWNLOAD
ENGLISH ----------------> CLICK HERE TO DOWNLOAD
MM ----------------------> CLICK HERE TO DOWNLOAd
NT -----------------------> CLICK HERE TO DOWNLOAD

New Physics
BEEE
EDC
C&DS
BEE
MM
ENGLISH
M1

OR DOWNLOAD FROM

Download Jawaharlal Technological University (JNTU) Online Bits 1st year 2007,,, all 60 sets
C & D S
http://share.urbangen.com/265199-cds.rar
Applied Physics
http://share.urbangen.com/874974-aphy.rar
English
http://share.urbangen.com/668771-english.rar
Mathematics1
http://share.urbangen.com/213248-Mathematics1.rar
Mathematical Methods
http://share.urbangen.com/362052-mm.zip
EDC,BEE&NA
http://share.urbangen.com/753520-Nabeeedc.rar

Jntu online bits for 2007-Mathematics1-set1

mathematics1/set1 in pdf (4284-16209-mathematics-1.pdf)
mathematics1/set2 in pdf (4284-162012-mathematics-2.pdf)
mathematics1/set3 in pdf (4284-162012-mathematics-3.pdf)

Jntu 2nd year Online Papers and bits

II year previous Question Papers:

E.C.E
A.C - Download
S.T.L.D - Download
E.M.T.L. - Download
E.T. - Download
JAVA - Download
C.S - Download

C.S.E and IT

DAA - Download
ES - Download

JAVA - Download
MP - Download
PC - Download
ET - Download
STLD - Download
ES - Download

2-2 CSE/IT

CSE 2-2

R05AprilMay2007-IIB.TechIISem

R05AugSept2007-IIB.TechIISem

CSE II yr Online-2 papers SendSpace Link
Password : jagan.co.nr
ECE II yr Online-2 papers SendSpace Link
EEE II yr Online-2 papers SendSpace Link
MECH II yr Online-2 papers SendSpace Link
IT II yr Onlie-2 papers SendSpace Link

2-1 ECE EXTERNAL PAPERS

external_examination_papers_IIyear_STUDENTSHANGOUT.COM.rar

II year Online Bits:

JNTU 2-2 online bits for CSE,IT,ECE
Download:
MP
POC
JAVA
ES
PTSP

Btech ECE 2yr - II sem Bits

2-2 jntu online bitss for ECE

2-2 jntu online bits single file

JNTU ONLINE BITS For 2-2 2nd mid exams cse

B.TECH 2-2 ONLINE BITS

2-2 CSE/IT

ET:-
CS:-
EMTL:-
AC:-
DAA:-
STLD:-
OOPS:-

ALL 2-2 2ND MID ONLINE BITS FOR CSE/IT ,ECE ALL SUBJECTS BY JUST ONE NEW CLICK

CSE&IT
ECE

2-2 2ND MID ONLINE BITS FOR CSE/IT ,REALLY ITS WORKING AFTER TESTING ONLY I KEPT HERE

SE
ES
JAVA
DAA
CG
MP

Jntu Btech 3rd year Online Papers and Bits

III year previous Question Papers:

RRAugSept2007-IIIB.TechIISems

RRAprilMay2007-IIIB.TechIISem

CSE
Unix - Download
CD - Download
CG - Download
ECE
M.W. - Download

EEE
CS - Download

MEFA - Download

CSE III yr Online-2 papers Direct Link (4 papers same for i.t. also)
ECE III yr Online-2 papers Direct Link
EEE III yr Online-2 papers Direct Link
MECH III yr Online-2 papers SendSpace Link

Password : jagan.co.nr

Old papers

CSE 3-2

ECE 3-2

EEE 3-2

MECH 3-2

III year Online Bits:

3-2IT
3-2 CSE

3-2 CSE 2ND MID ONLINE BITS,MORE THAN 15 SETS FOR
INFORMATION SECURITY
COMPUTER GRAPHICS
NEURAL NETWORKS
COMPILER DESIGN
STM

JNTU 3-2 ONLINE BITS FOR CSE & IT
25-30 PAPERS ARE AVAILABLE FOR EACH SUBJECT
UNIX:
STM
NEURAL NETWORKS:
INFORMATION SECURITY:
COMPILER DESIGN:

3-2 ECE ONLINE BITS BASED ON NEW ONLINE PATERN
TCSSN
MPI
MWE
VLSI
DSP

Jntu btech 4th year Online Papers

IV year previous Question Papers:

RRAprilMay2007-IVB.TechIISem

RRAugSept2007-IVB.TechIISems

Please click on ebooks and Video Tutorials which is realated to Jntu Btech books and video tutorials.

Core java 2 – Volume 1 Fundamentals and Volume II Advanced Features - Sun

2008-04-27T00:13:00.001-07:00

Core java 2 – Volume 1 Fundamentals - Sun

Download

Core java 2 - Volume II Advanced Features - sun

Download

Free SCJP Preparation Guide, Dump, Notes, Mock Exams and Practice Exams Download

2008-04-27T00:01:00.001-07:00

Java Programmer Exam Simulator for 1.4 (310-035) Exam by Marcus Green (60 questions)
Java Programmer Certification Mock Exam No 1 by Marcus Green (60 questions)
Java Programmer Certification Mock Exam No 2 by Marcus Green (60 questions)
Java Programmer Certification Mock Exam No 3 by Marcus Green (60 questions)
Java Programmer Certification Exam 1.4 (310-035) by Dan Chisholm (569 questions)
ePractice Sample Questions for 1.4 (310-035) Exam by Sun (10 questions)
ePractice Sample Questions for 1.2 (310-025) Exam by Sun (10 questions)
Java Certification Mock Exam by John Hunt (65 questions)
SCJP Mock Exams for 1.4 (310-035) Exam by JDiscuss.com (135 Questions)
SCJP Mock Exams for 1.2 (310-025) Exam by JDiscuss.com (135 Questions)
SCJP Mock Exam for 1.2 (310-025) Exam by Ashok Kumar Gupta (39 Questions)
Mock Exams for 1.2 (310-025)/1.4 (310-035) Exams for Java Certification by Jiris.com (244 Questions)
Java 5 (310-055) SCJP questions by Kathy Sierra and Bert Bates (11 Qustions)
Mock Exams for 1.2 (310-025)/1.4 (310-035) Exams by W. B. Brogden (141 Questions)
MindQ's Sun Certified Java Programmer Practice Test (60 Questions)
Mock exam engine for 1.4 (310-035) Exam by Khalid A. Mughal and Rolf W. Rasmussen (61 Questions)
Mock Exam by Sreenivasa Kumar Majji (30 Questions)
Java 5 (310-055) SCJP Mock Exam by Javabeat.net (14 Questions)
Sun's sample questions:
Java Ranch Rules Round Up Game: 36 questions. Basic questions, but important for certification.
Jaworski: Java quiz with answers. Very useful
Robert and Heller's Online Self Test: 10 questions.
Absolute Java's Test Your Java Knowledge: 17 questions on variety of topics
Java Prepare Questions: 59 questions.
John Hunt Mock exam: 65 questions, Simple
Java Caps Mock exam: 60 questions with answers
Marcus Green mock exam - 1: 60 questions.
Marcus Green mock exam - 2: 60 questions. Highly recommended
Marcus Green mock exam - 3: 60 questions.
MindQ exam: Good one.
Majji exam: 30 questions, Very good.
Amit Poddar's questions: 42 questions, related to Strings, Components and Layouts and Math class
IBM online exam tool: 30 questions
Barry Boone Exam: 70 questions.
Bill Brogden exam: Random 18 from 38 questions.
Bill Brogden's Hardest questions: 19 questions, If you want to waste your time
Jxam: 59 from 200 questions.
Sarga's Jargon Exam: 60 questions from 140 questions.
JQuest Exam simulator: 30 from 90 questions.
JDcert: 66 questions, Simple
Deepak exam site: 250 questions.
Applied Reasoning Exam: 77 questions, generated from a pool of 200 questions.
Boris's Exam Simulator: 40 questions from 64 questions.
Abhilash's Quiz: 80 questions with answers.
Java Exam Simulation - Test 1: 30 questions.
Java Exam Simulation - Test 2: 59 questions.
Java Exam Simulation - Test 3: 59 questions.
Java Exam Simulation - Test 4: 59 questions.
Java Exam Simulation - Test 5: 128 questions.
Exam Cram Pratice Exam 34 questions.
4tests.com's Java Exam: 40 questions.
JvalTest Exam Applet: 60 questions.
Mughal Khalid's Exam Simulator: 60 questions,
Tough in comparison to the actual certification exam.
JWhizTrial Exam
These are sample questions from the actual software. Need to download them to your computer.
Java Exam Simulator
Rahul Raje's Mock Exam Simulator : 60 questions. Needs downloading and extracting jar files
www.go4java.20m.com : 2 mock exams with 59 questions each.
Web Tech Frontier : 56 Questions.
Voodoo Exam by Ashish Hareet : At the time of writing this page, the mock exam has 60 questions related to SCJP.
Jxam by Eddie Mcnally (200 Questions)
Questions from The Complete Java 2 Certification Study Guide (10 Questions)
SCJP Mock Questions by Abhilash Koneri (80 Questions)
Mock Exam by Amit Poddar (42 Questions)
Sun Certified Programmer Practice Exam by Barry Boone Part I (1 - 19 Questions)
Sun Certified Programmer Practice Exam by Barry Boone Part II (20 - 39 Questions)
Sun Certified Programmer Practice Exam by Barry Boone Part III (40 - 70 Questions)
JDCert Mock Exam (131 Questions)
SCJP Mock Exam by Sarga (27 Questions)
SCJP Questions Part I collected by BMC88 (30 Questions)
SCJP Questions Part II collected by BMC88 (30 Questions)
SCJP Questions Part III collected by BMC88 (30 Questions)
SCJP Questions Part IV collected by BMC88 (10 Questions)
SCJP Questions Part I by BMC88 (10 Questions)
SCJP Questions Part II by BMC88 (10 Questions)
SCJP Questions Part III by BMC88 (7 Questions)
SCJP2 Mock Exam 1 by javaprepare.com (59 Questions)
SCJP2 Mock Exam 2 by javaprepare.com (38 Questions)
Sample questions by topic for Java Certification by javaprepare.com (130 Questions)
Java Certificatoin Exam by SinoTex (60 Questions)
JQPlus Trial for SCJP 1.4 (310-035) Exam by EnthuWare (59 Questions)
JQPlus Trial for SCJP 1.2 (310-025) Exam by EnthuWare (60 Questions)
SCJP 1.4 (310-035) Practice Exam by Whizlabs (29 Questions)
Mock Test for SCJP2 by Yogesh Shastri (29 Questions)
Mock Exam Engine for SCJP by Ashish Hareet (373 Questions)
SCJP 1.4 (310-035) Demo Mock Exam by javacertificate.com (10 Questions)
Whizlabs SCJP 5.0 (310-055) Exam Simulator Trial Version (87 Questions)
Whizlabs SCJP 1.4 (310-035) Exam Simulator Trial Version (70 Questions)
The JavaRanch Rules Round-up Game (144 Questions)
SCJP 1.4 (310-035) Practice Exam by ExamCram (30 Questions)
SCJP 1.2 (310-025) Practice Exam by ExamCram (59 Questions)
Sun Certified Programmer Practice Exam by Levteck.com (70 Questions)
SCJP Practice Questions by Anil Bachi (67 Questions)
Questions for SCJP Exam by CertCities.com (30 Questions)
Test Your Knowledge of Java Topics by CertMag.com (8 Questions)
SCJP 1.4 (310-055) Practice Tests by Giri Mandalika (268 Questions)
SCJP Mock Exam 1 by go4java (59 Questions)
SCJP Mock Exam 2 by go4java (59 Questions)
Mock Test by Debashish Chakrabarty (12 Questions)
Java Programming Assessment Test by javacamp.org (20 Questions)
Sun Java 2 Programmer Mock Exam by Natarajan Meghanathan (59 Questions)
Mock Test by Sahir Shah (100 Questions)
SCJP Mock Exam by Valentin Crettaz (59 Questions)
Java2 Certification Mock Exam by Siva Valiveru and Girija Valiveru (60 Questions)
Interactive Java Exam by tipsmart.com (27 Questions)
Sun Certified Java Programmer Practice Questions by 4Tests.com (40 Questions)
JSCP 1.4 Practice Questions by simulationexams.com (10 Questions)
J2 Exam Simulator by universalteacherpublications.com (600 Questions)
SCJP Mock Exam by rraje_2000 (60 Questions)
Test Your Java Knowledge by Richard Baldwin (130 Questions)
Java 5 Basic Exam by JavaBlackBelt.com (40 Questions)
Java SE Intermediate Exam by JavaBlackBelt.com (40 Questions)
Certification Exam Tool by IBM (30 Questions)
The SCJP Exam Challenge by zindell (118 Questions)

Core Java Volume I Fundamentals book

2008-04-26T01:29:00.001-07:00

This revised edition of the classic Core Java™, Volume I–Fundamentals, is the definitive guide to Java for serious programmers who want to put Java to work on real projects.
Fully updated for the new Java SE 6 platform, this no-nonsense tutorial and reliable reference illuminates the most important language and library features with thoroughly tested real-world examples. The example programs have been carefully crafted to be easy to understand as well as useful in practice, so you can rely on them as an outstanding starting point for your own code.

Download

Spoken English : Learn English with TELL ME MORE

2008-04-26T01:26:00.001-07:00

Now a days english is the most communicating language in world. TELL ME MORE addresses all the skills critical to learn English : reading, writing, listening, speaking, vocabulary, grammar, and culture.

Learn English with TELL ME MORE, THE international standard for language learning software:
This package includes all 3 levels: Beginner, Intermediate and Advanced and is the perfect solution to learning English. With more than 750 hours of learning, this is the most extensive offer on the market to help you learn English. The intelligent software version evaluates your progress as you learn English, and uses your results to suggest the activities and exercises best suited to your needs.

Download Here:

Password: shareislove

VTC - XML Course Video Tutorial

2008-04-26T01:19:00.001-07:00

Info: http://www.vtc.com/products/Introduction-To-XML-tutorials.htm

Duration: 5 hrs / 44 lessons
Download (15.14 MB):
http://rapidshare.de/files/35929085/v_t_c_x_m_l.rar

15 VTC Programing Video Tutorials Training

2008-04-26T00:54:00.001-07:00

1. C Programming Tutorial (97.7MBs)
http://www.megaupload.com/?d=NFOEPSB3

7. VTC Web Designing Tutorials

Code:

http://rapidshare.com/files/74960881/VTC_-_Web_Design_Fundamentals.part1.rar

http://rapidshare.com/files/74958332/VTC_-_Web_Design_Fundamentals.part2.rar

8. VTC Unix Basic and Advance Tutorials

Code:

http://rapidshare.com/files/74480707/Unixshell_Intro.part1.rar

http://rapidshare.com/files/74480940/Unixshell_Intro.part2.rar

http://rapidshare.com/files/74480779/Unixshell_Intro.part3.rar

http://rapidshare.com/files/74480203/Unixshell_Intro.part4.rar

http://rapidshare.com/files/74479774/UnixShell_Adv.part1.rar

http://rapidshare.com/files/74479835/UnixShell_Adv.part2.rar

http://rapidshare.com/files/74479828/UnixShell_Adv.part3.rar

9. VTC PHP Video utorials

Code:

http://rapidshare.com/files/74697737/PHP_Videos.part1.rar

http://rapidshare.com/files/74697708/PHP_Videos.part2.rar

http://rapidshare.com/files/74697334/PHP_Videos.part3.rar

10. VTC Perl Video utorials

Code:

http://rapidshare.com/files/74697062/Perl_vids.part1.rar

http://rapidshare.com/files/74697030/Perl_vids.part2.rar

11. VTC Ubuntu Video utorials

Code:

http://rapidshare.com/files/74436603/Chapter_01_Ubuntu_.rar

http://rapidshare.com/files/74436700/Chapter_02_Ubuntu.rar

http://rapidshare.com/files/74440331/Chapter_03_Ubuntu.rar

http://rapidshare.com/files/74439861/Chapter_04_Ubuntu.rar

http://rapidshare.com/files/74440296/Chapter_05_Ubtunu_.rar

http://rapidshare.com/files/74441463/Chapter_06_Ubuntu.rar

http://rapidshare.com/files/74441032/Chapter_07_Ubuntu.rar

http://rapidshare.com/files/74441557/Chapter_08_Ubuntu.rar

http://rapidshare.com/files/74472578/Chapter_09_Ubuntu.rar

http://rapidshare.com/files/74474314/Chapter_10_Ubuntu.rar

http://rapidshare.com/files/74475004/Chapter_11_Ubuntu.rar

http://rapidshare.com/files/74475158/Chapter_12_Ubuntu.rar

http://rapidshare.com/files/74475588/Chapter_13_Ubuntu.rar

12. VTC Ajax Video utorials

Code:

http://rapidshare.com/files/74901293/VTC_AJAX.part1.rar

http://rapidshare.com/files/74902640/VTC_AJAX.part3.rar

http://rapidshare.com/files/74902793/VTC_AJAX.part2.rar

13. VTC TCP/IP Video utorials

Code:

http://rapidshare.com/files/74700700/TCP_IP_Videos.part1.rar

http://rapidshare.com/files/74701152/TCP_IP_Videos.part2.rar

http://rapidshare.com/files/74700221/TCP_IP_Videos.part3.rar

14. VTC - Microsoft Windows Vista (Tutorials)

http://rapidshare.com/files/17517990/VTC.Microsoft.Windows.Vista.Tutorials.part1.rar
http://rapidshare.com/files/17533533/VTC.Microsoft.Windows.Vista.Tutorials.part2.rar
http://rapidshare.com/files/17529464/VTC.Microsoft.Windows.Vista.Tutorials.part3.rar
http://rapidshare.com/files/17530234/VTC.Microsoft.Windows.Vista.Tutorials.part4.rar

15. JAVA video tutorials

http://rapidshare.com/files/18312759/Introduction_to_Java.part1.rar
http://rapidshare.com/files/18310260/Introduction_to_Java.part2.rar

Design Patterns (VTC Video Tutorial) Training

2008-04-23T10:09:00.001-07:00

Design patterns let programmers avoid re-inventing the wheel. The original book (Design Patterns by the "Gang of Four": Erich Gamma, Richard Helm, Ralph Johnson, and John Vlissides) was phenomenally successful. When the programmer faces a particular problem, all they have to do is to look up the correct matching design pattern and use it to implement the solution. In this tutorial VTC author Steve Holzner guides you through the most popular and useful design patterns, so you can begin incorporating them into your own code.
Download

Rapidshare

Megaupload

VTC C++ Video Tutorials Training

2008-04-23T10:01:00.001-07:00

Author: Arthur L. Lee

Duration: 5 hrs / 43 lessons |

Video Format: .mov (VLC) |
C plus plus (C++) is a programming language that is both procedure-oriented and object-oriented.
Contents:
Intro to C++ & the Environment

* Intro to C/C++ (02:33)
* The C++ Environment (07:02)
* Completing the Sample Program (06:00)
* Compiling & Executing Programs (04:35)
* Common errors (04:53)
* Saving & Exiting; other errors (02:55)

Variables,Constants, & Math Statements

* Variables (04:09)
* Data Types (04:15)
* Declaration statements & Initializing variables (05:03)
* Declaring Constants (02:12)
* Assignment Statements vs. Prompting for user input (04:34)

The String Data Type; Equations

* Character vs. String data (04:12)
* Using the getline function and the strcpy function (04:30)
* Writing equations and Type casting (04:32)
* Putting it all Together: Demo of complete program (03:34)
* Debugging Demo (04:28)

Programmer-Defined Functions

* Creating Programmer-Defined Functions (04:28)
* Details of Function prototypes, definition and the calling statement (04:10)
* Scope & Lifetime issues; Passing data with functions (06:10)
* Passing Variables by Value and by Reference (05:15)
* Functions that Return Values (04:47)
* Debugging Demo (02:44)

Creating Output (formatting and creating files)

* Stream Manipulators (formatting output) (03:56)
* The Output File Stream: Accessing the Output File (05:40)
* Demo Program (Demo 12) to Illustrate (03:17)
* Debugging Demo (04:03)

Using the if Statement

* Syntax of a Conditional Statement (03:39)
* Relational Operators (02:11)
* Executing if Logic (one statement vs. block) (04:50)
* Assignment Operator vs. Equality Operator (02:19)
* Logical Operators (symbols for: and, or, not) (05:36)

Other Functions; Nested if Statements

* Converting to Upper/Lower Case (04:50)
* Comparing Strings (strcmp and stricmp functions) (04:43)
* The Strlen Function (02:32)
* Nested if Statement Structure (03:33)
* Demo of Complete Program (04:00)

Looping

* Overview of the Looping Structures (07:08)
* Demo of the While Loop (03:23)
* Demo of the Do-While Loop (05:57)
* Demo of the For Loop (03:25)
* Counters and Accumulators in Loops (01:27)
* Demo of Complete Program (05:41)
* Increment/Decrement Operator (what does C++ mean?)* (02:38)

Download

Sony Vegas Training Videos (VTC)

2008-04-23T09:51:00.001-07:00

Virtual Training Company's Sony Vegas Tutorials and online training course videos offer the user an accelerated way to master this application from the comfort of their own desktop.

Password : bbshare

18 Rapidshare Hack Methods, Tips and Tricks

2008-04-11T05:18:00.001-07:00

Method - 1: Rapidshare software

1) Rapidown: This software is working Great. You can download multiple files at the same time, download files with unlimited connection, pause the download, and download files without time limit & unlimited download in rapidshare server. But, this software did not use english languange, its little confuse. The overall of this software is excellent.

Download Rapidown

2) Rapidshare Ultimate 2007 : This software download files from Rapidshare, based on the source code donated by previous RapidLeecher author this version automatically decodes the image code allowing you to use the service without any hassle in a more easy way, RapidLeecher 2007 can run into fully automatic mode residing into system tray using minimal system resources monitoring user clipboard and autostart file download from rapidshare in background as soon as a rapidshare link is copied into the clipboard. The free software has support for proxy servers so that you can download many files at the same time (using different proxy) and multiple instance of the software.

3) USDownloader V5: This software is the newer version of USdownloader. You can select the rapidshare server to download file. This software has been working fine. This file include openssl, you must install this to get usdownloader working. Download USDownloader V5 by nemesis63

Password for all archives: www.zepy.net

readmore....

Method - 2: Free Rapidshare Premium Account (Cookie Based)

Follow the steps carefully. If you succeed in the following 2 steps, you can have a lifetime account from Rapidshare.

Step 1: Identify where the premium cookie will be stored. To do this,

I. Go to www.rapidshare.com and click under Premium, the Login tab and enter “Check” for both username and password. You’re doing this to trick your computer to store a cookie, so you can find out the exact location where Rapidshare hides its Premium Cookies, and calls them whenever you login to the premium zone.

II. Then go to your browser’s Tools tab, click Internet Options. Under “general” tab, you’ll see the Temporary Internel Files - here click “Settings”, and click “View Files”. A Window will open. MAKE A NOTE OF THE LOCATION OF THIS FOLDER. THIS IS WHERE YOU’LL INSTALL THE PREMIUM COOKIE.

III. Then, in this folder click on “Last Modified” tab, and look for a text file that was modified on today’s date, and named “Cookie:’XXXX’@rapidshare.com/”. (Replace XXXX with your login name on this your PC). TAKE A NOTE OF THIS FILE. YOU HAVE TO DELETE THIS FILE BEFORE YOU INSTALL THE PREMIUM COOKIE.

http://rapidshare.com/files/49904211/RapSha_PreCoo.part1.rar

http://rapidshare.com/files/49904338/RapSha_PreCoo.part2.rar

http://rapidshare.com/files/49904442/RapSha_PreCoo.part3.rar

http://rapidshare.com/files/49904776/RapSha_PreCoo.part4.rar

http://rapidshare.com/files/49904968/RapSha_PreCoo.part5.rar

http://rapidshare.com/files/49905235/RapSha_PreCoo.part6.rar

Password: - rspac.blogger.com

Step -2: Download all the parts of the file from the links above, and extract the setup file named PremiumCookie.exe and install the Premium Cookie in your Temporary Internet Folder. When propmpted for the folder to be installed, remember to enter the folder name you noted down in Step 1.

After installing the Premium Cookie, depending on your computer setup, you may want to restart the computer. After that, when you enter www.rapidshare.com, you will automatically be taken to the premium zone, since your computer will be able to recognize the premium cookie.

And remember to use Downloader Managers to download files from your Rapidhshare Premium Account because Premium Account supports resume too.

Method - 3: Rapidshare Download without Limits - 100% WORKING

Just install this tiny but very handy software and copy-paste the rapidshare download link. There is no download limits and you can download multiple files at the same time. FULLY TESTED TO BE WORKING!
ZIP PASSWORD: www.symbianize.com
Rapidown-205.9-20SE.zip

Method - 4: Bypass 1 Hour Download Limit

You don’t need to wait until the next hour to download a second part of a file. Try this trick (if you are using static ip address, doesn’t use this method). It doesn’t work if u use a proxy though.

For Windows XP:

1. Launch Command Prompt: Start > All Programs > Accessories > Command Prompt. (Or Start > Run… and type in cmd)

2. When Command Prompt is opened, Copy and Paste this in the Command Prompt:

@echo off
echo ipconfig /flushdns
ipconfig /flushdns
echo ipconfig /release
ipconfig /release
echo ipconfig /renew
ipconfig /renew
exit

3. Command Prompt does the rest from here.

Method - 5: Short-Out the JavaScript

1. Goto the page you want to download
2. Select FREE button
3. In the address bar put the following: javascript:alert(c=0)
4. Click OK
5. Click OK to the pop-up box
6. Enter the captcha
7. Download Your File

Method - 6: Request a new IP address from your ISP server

Here's how to do it in windows:
1. Click Start
2. Click run
3. In the run box type cmd.exe and click OK
4. When the command prompt opens type the following. ENTER after each new line.

ipconfig /flushdns
ipconfig /release
ipconfig /renew
exit
5. Erase your cookies in whatever browser you are using.
6. Try the rapidshare download again.
Frequently you will be assigned a new IP address when this happens. Sometime you will, sometimes you will not. If you are on a fixed IP address, this method will not work. To be honest, I do not know how to do this in linux/unix/etc. If this works for you, you may want to save the above commands into a batch file, and just run it when you need it.

Method – 7: Use a proxy with SwitchProxy and Firefox

1. Download and install Firefox if you have not already
2. Download and install SwitchProxy
3. Google for free proxies
4. When you hit your download limit, clean your cookies and change your proxy

Method - 8: Use an anonymous service

Running your system through the tor network should in theory work; however, it is difficult to use and setup. Plus, you allow others to run their evil deeds through your system as well by using this system. Anonymizer 2005 is inexpensive, easy to use, but not free. Other pay services would likely work as well.

Method - 9: You can use a bookmarklet to stop your wait times

1. Open IE
2. Right Click On This Link
3. Select Add to Favorites
4. Select Yes to the warning that the bookmark may be unsafe.
5. Name it "RapidShare No Wait"
6. Click on the Links folder (if you want to display it in your IE toolbar)
7. Click OK
8. You may need to close and reopen IE to see it
9. Goto rapidshare and click the bookmarklet when you are forced to wait

Method - 10: RapidCheck

It is a tool that checks whether any free accounts are available at rapidshare.de. It stays at system tray area and checks for free acounts at speciefied intervals. When free acounts detected, you will be notified by the program with an information baloon tooltip. Then you can directly go to free account registration page by clicking the tooltip.

Click here to download RapidCheck installer.

Method - 11: Rapidshare Free Account Notifier

Use Rapidshare Free Account Notifier to get free accounts as soon as they are released

Main features:

Checks availability of free Premium RapidShare Accounts
Manual Check
Programmable timer
Starts with Windows
Runs in system tray
Popups balloon/plays sound/opens RS page when there are free accounts
Proxy support
Extreme fast (uses GZIP)

Method - 12: Rapidshare Premium Link Generator

90 Rapidshare Premium Link Generator Websites to download freely with out account (id and password) click below. Go to any one the site past the rapidshere link. Then u can freely download multiple times with out premium id and password.
50 Rapidshare Premium Link Generator with out account (id and password)
40 Websites Rapidshare Premium Link Generator with out account (id and password)

Method

Method - 13: RapidShare DeCoder 0.2

Rapid DeCoder is java decoder. Works great on Rapid Share website, just disable JavaScript in your browser, open source code
and copy everything in unescape(’?) to this utilitie and click decode.It will show you real path to the file. You can also
use this for any website that has this similar encryption.

Requirements: .NET Framework

Download
ZIP-Password: www.webxposed.de

Method - 14: Switch Off Your Router

1.Just switch off your router(or modem) and switch it back on.
2.This may work for some users(Mtnl and Bsnl) and maybe some others too.
Actually these methods generally work for those people whose ISP gives them dynamic ip. If these dont work then one more thing that can be done is to use proxies.

Method - 15: Software to Hide Ip

1.Donwload the software Hide ip platinum from here
Hide IP platinum.
Password : www.ddlorigin.com .
2.Run it,then it will automatically chose a proxy(ip of a different country) for you.So you can easily download without any restrictions.You just have to change the proxy each time you download. Rapidshare Premium acc. Generator
http://rapidshare.com/files/15167278/Premium_Acc_Generator.rar.html

Method - 16: Anonymous Clients
They are nothing but the clients that support you to be annonymous on the internet so as to prevent your identity by using proxies. But you on your part have to enter the IP and Port for the proxies.

1. JAP-is a program that can help you to prevent yout IP address by providing you to connect through proxies.

Get it * to use this you must know about proxies and to use it.

2. Ulrasurf- is a good program which can select proxies from itself also and you can do it mannually also and can have upto 3 parallel downloads from Rapidshare.

Get it

3. Get Proxy List-List of IP and Port numbers of the proxy servers.

Rapidshare.com Files Renew Tool

2008-04-10T05:56:00.001-07:00

This tool will help you bypass the 90 days no download files deletion by Rapidshare system. It works by downloading 1MB for each file. This will cause the file to be marked as “Downloaded” and it won’t expire for next 90 days.

Download: Rapidshare.com Files Renew Tool
click here read more

RapidShare Manager (RSM)

2008-04-10T05:52:00.001-07:00

It is an official all in one (AIO) tool to upload and download files from RapidShare.com. It’s free, guaranteed Adfree and does not contain any malicious software, hidden Ad-Programs or things like that.

More info and download: https://ssl.rapidshare.com/en/rsm.html

java Difference between LinkedList ArrayList TreeList:

2008-04-02T09:01:00.000-07:00

There are some differences between an java.util.ArrayList and java.util.LinkedList. These differences are not so important for any small applications that processes small amount of data. Then they can very important for any small application that processes huge amount of data. These do affect the performance of a application if not analyzed properly.

An empty LinkedList takes 2-3 times less memory than an empty ArrayList. This becomes important if you plan to keep an adjacency list of nodes for each node in the graph (graph can be like a TreeSet. Tree is a type of graph) and you know beforehand that the nodes will have at most one or two adjacent nodes and the total number of nodes in the graph can be quite large.

Although both ArrayList and LinkedList allow insertion/deletion in the middle through similar operations (ie; by invoking add(int index) or remove(index)), these operations do not offer you the advantage of O(1) insertion/deletion for a LinkedList. For that, you must work through a ListIterator.

The important thing to remember when comparing LinkedList and ArrayList is that linked lists are more faster when inserting and removing at random locations in the list multiple times. If you want to add to the end of the list then an ArrayList would be the best choose.

I will try to supply an answer for the LinkedList vs ArrayList issue. The first thing to do is to look at what interfaces these two implement. This might hint us at their purpose, as Sun usually bound purposes into interfaces.

// lang java
public class ArrayList
extends AbstractList
implements List, RandomAccess, Cloneable, Serializable

public class LinkedList
extends AbstractSequentialList
implements List, Queue, Cloneable, Serializable
We can ignore Cloneable and Serializable as all of the JCF implement those. It’s also quite obvious that both of them implement the List interface, as they need to provide list functionability (backwards iteration, sub listing, etc).
Now for the differences: ArrayList is implementing RandomAccess while LinkedList implementing Queue. You could already tell something about the usage of the two classes.
ArrayList:
Now for some implementation notes. The ArrayList is actually encapsulating an actualy Array, an Object[]. When you instanciate ArrayList, an array is created, and when you add values into it, the array changes its size accordingly. This gives you strengths and weaknesses:
• Fast Random Access
You can perform random access without fearing for performence. Calling get(int) will just access the underlying array.
• Adding values might be slow When you don’t know the amount of values the array will contain when you create it, a lot of shifting is going to be done in the memory space when the ArrayList manipulates its internal array.
• Slow manipulation When you’ll want to add a value randomly inside the array, between two already existing values, the array will have to start moving all the values one spot to the right in order to let that happen.
LinkedList
The LinkedList is implemented using nodes linked to each other. Each node contains a previous node link, next node link, and value, which contains the actual data. When new data is inserted, a node is inserted and the links of the surrounding nodes are updated accordingly. When one is removed, the same happens - The surrounding nodes are changing their links and the deleted node is garbage collected. This, as well, gives strengths and weaknesses:
• Fast manipulation As you’d expect, adding and removing new data anywhere in the list is instantanious. Change two links, and you have a new value anywhere you want it.
• No random access Even though the get(int) is still there, it now just iterates the list until it reaches the index you specified. It has some optimizations in order to do that, but that’s basically it.
Conclusion:
ArrayList is very useful when a well defined set of data is needed in a List interface as opposed to an array. It can be dynamically changed, but try not to do so frequently throughout the life of the application. LinkedList is there for you to do just that: Manipulating it is very easy, and as long as its used for iteration purposes only and not for random accessing, it’s the best solution. Further, if you need random accessing from time to time, I suggest toArray for that specific moment.
Another point I didn’t raise here is the Queue issue. LinkedList implements extended abilities to the normal List interface which allows it to add and remove elements from its beginning and end. This makes the LinkedList perfect for Queue and Stack purposes - Although in Java 5 they already added a Stack class.

Java Collections Lists (ArrayList LinkedList TreeList) and difference:

2008-04-02T09:00:00.000-07:00

The list Interface extends Collection and it stores a sequence of elements as in list , all these elements can be easily accessed with their serial numbers or sequences and any element can be inserted to the list. But we have the situations when we get UnsupportedOperationException if the collection can’t be modified. List interface is implemented by three concrete classes

1) Array List

2) Linked List

3) Tree List

1. ArrayList

This class extends AbstractList and implements the List interface.This class can be said to be the improved version of the arrays as in arrays we have the limitation of the fixed size which has to be known and defined well in advance and the n nothing much can be done with respect to the increase and decrease in the size of the array , so we have got the extended class from collections framework whch gives us the flexibility of having the variable array structure which can be dynamically increased or reduced as per the programmers need. An ArrayList is a variable-length array of object references.

ArrayList has three constructors shown here:

a) Array list ():
This constructor builds an empty array list.

b) ArrayList(Collection c):
This constructor builds an array list that is initialized with the elements of the collection c.

c) ArrayList (int capacity):
This constructor builds an array list that has the specified initial capacity. The capacity grows automatically as elements are added to an array list.

import java.util.ArrayList;
import java.util.List;

public class CreateArrayList {

public static void main(String args[]) {
List list = new ArrayList();
list.add("1");
list.add("2");
list.add("3");
}
}The above code will create an ArrayList object and store three String objects in the ArrayList object.

import java.util.ArrayList;
import java.util.List;

public class DisplayArrayList {

public static void main(String args[]) {
List list = new ArrayList();
list.add("1");
list.add("2");
list.add("3");

for(int i = 0; i < 3; i++) {
System.out.println(list.get(i));
}
}
}Output of the above code

1
2
3
Below code is an example where the arraylist contains many Employee objects. Try this code a see how it works.

import java.util.ArrayList;
import java.util.List;

public class Employees {

public static void main(String args[]) {
List employeesList = new ArrayList();
employeesList.add(new Employee("Sam", 100000));
employeesList.add(new Employee("Rohan", 200000));
employeesList.add(new Employee("John", 300000));
employeesList.add(new Employee("Willey", 400000));

int size = employeesList.size();
for (int i = 0; i < size; i++) {
Employee employee = (Employee) employeesList.get(i);
System.out.println(employee.toString());
}
}
}

class Employee {

private String name;

private long sal;

public Employee(String name, long sal) {
this.name = name;
this.sal = sal;
}

public String getName() {
return name;
}

public long getSal() {
return sal;
}

public String toString() {

return "Name : " + getName() + "\n" + "Salary of " + getName() + ": "
+ getSal();
}
}

2. LinkedList :

LinkedList Class: This Class extends AbsractSequentialList and implements the List Interface. It as it defines automatically by it’s term provides a Linked-list structure.
It has two constructors which are mentioned below:

LinkedList ( ) LinkedList(Collection c)

LinkedList ( ): This constructor builds an empty Linked List. LinkedList(Collection c): This builds a linked list which is initialized with elements of collection .

Try the below code

import java.util.LinkedList;
import java.util.List;

public class LinkedListExample {

public static void main(String args[]) {

List linkedList = new LinkedList();
linkedList.add("1");
linkedList.add("2");
linkedList.add("3");
}
}
3. TreeList :

public class TreeList extends AbstractList (Code)
A List implementation that is optimised for fast insertions and removals at any index in the list.
This list implementation utilises a tree structure internally to ensure that all insertions and removals are O(log n). This provides much faster performance than both an ArrayList and a LinkedList where elements are inserted and removed repeatedly from anywhere in the list.

The following relative performance statistics are indicative of this class:

get add insert iterate remove
TreeList 3 5 1 2 1
ArrayList 1 1 40 1 40
LinkedList 5800 1 350 2 325

ArrayList is a good general purpose list implementation. It is faster than TreeList for most operations except inserting and removing in the middle of the list. ArrayList also uses less memory as TreeList uses one object per entry.
LinkedList is rarely a good choice of implementation. TreeList is almost always a good replacement for it, although it does use sligtly more memory.

Difference between LinkedList ArrayList TreeList:
There are some differences between an java.util.ArrayList and java.util.LinkedList. These differences are not so important for any small applications that processes small amount of data. Then they can very important for any small application that processes huge amount of data. These do affect the performance of a application if not analyzed properly.

An empty LinkedList takes 2-3 times less memory than an empty ArrayList. This becomes important if you plan to keep an adjacency list of nodes for each node in the graph (graph can be like a TreeSet. Tree is a type of graph) and you know beforehand that the nodes will have at most one or two adjacent nodes and the total number of nodes in the graph can be quite large.

Although both ArrayList and LinkedList allow insertion/deletion in the middle through similar operations (ie; by invoking add(int index) or remove(index)), these operations do not offer you the advantage of O(1) insertion/deletion for a LinkedList. For that, you must work through a ListIterator.

The important thing to remember when comparing LinkedList and ArrayList is that linked lists are more faster when inserting and removing at random locations in the list multiple times. If you want to add to the end of the list then an ArrayList would be the best choose.

I will try to supply an answer for the LinkedList vs ArrayList issue. The first thing to do is to look at what interfaces these two implement. This might hint us at their purpose, as Sun usually bound purposes into interfaces.

// lang java
public class ArrayList
extends AbstractList
implements List, RandomAccess, Cloneable, Serializable

public class LinkedList
extends AbstractSequentialList
implements List, Queue, Cloneable, Serializable
We can ignore Cloneable and Serializable as all of the JCF implement those. It’s also quite obvious that both of them implement the List interface, as they need to provide list functionability (backwards iteration, sub listing, etc).
Now for the differences: ArrayList is implementing RandomAccess while LinkedList implementing Queue. You could already tell something about the usage of the two classes.
ArrayList:
Now for some implementation notes. The ArrayList is actually encapsulating an actualy Array, an Object[]. When you instanciate ArrayList, an array is created, and when you add values into it, the array changes its size accordingly. This gives you strengths and weaknesses:
• Fast Random Access
You can perform random access without fearing for performence. Calling get(int) will just access the underlying array.
• Adding values might be slow When you don’t know the amount of values the array will contain when you create it, a lot of shifting is going to be done in the memory space when the ArrayList manipulates its internal array.
• Slow manipulation When you’ll want to add a value randomly inside the array, between two already existing values, the array will have to start moving all the values one spot to the right in order to let that happen.
LinkedList
The LinkedList is implemented using nodes linked to each other. Each node contains a previous node link, next node link, and value, which contains the actual data. When new data is inserted, a node is inserted and the links of the surrounding nodes are updated accordingly. When one is removed, the same happens - The surrounding nodes are changing their links and the deleted node is garbage collected. This, as well, gives strengths and weaknesses:
• Fast manipulation As you’d expect, adding and removing new data anywhere in the list is instantanious. Change two links, and you have a new value anywhere you want it.
• No random access Even though the get(int) is still there, it now just iterates the list until it reaches the index you specified. It has some optimizations in order to do that, but that’s basically it.
Conclusion:
ArrayList is very useful when a well defined set of data is needed in a List interface as opposed to an array. It can be dynamically changed, but try not to do so frequently throughout the life of the application. LinkedList is there for you to do just that: Manipulating it is very easy, and as long as its used for iteration purposes only and not for random accessing, it’s the best solution. Further, if you need random accessing from time to time, I suggest toArray for that specific moment.
Another point I didn’t raise here is the Queue issue. LinkedList implements extended abilities to the normal List interface which allows it to add and remove elements from its beginning and end. This makes the LinkedList perfect for Queue and Stack purposes - Although in Java 5 they already added a Stack class.

Set

2008-04-02T08:15:00.000-07:00

Set:
A Set represents a mathematical set.
It is a Collection that, unlike List, does not allow duplicates.
There must not be two elements of a Set, say e1 and e2, such that e1.equals(e2).
The add method of Set returns false if you try to add a duplicate element.

import java.util.HashSet;
import java.util.Set;
public class MainClass {
public static void main(String[] a) {
Set set = new HashSet();
set.add("Hello");
if (set.add("Hello")) {
System.out.println("addition successful");
} else {
System.out.println("addition failed");
}
}
}

This tutorial is about Sets (java.util.Set interface). I assume that the audience have mathematical background of set theory.

Sets cannot contain duplicate elements and you cannot add elements at a certain position unlike List. The classes implementing the Set interface are:AbstractSet, HashSet, LinkedHashSet, TreeSet

Set has 3 general purpose implementations:

- HashSet
- TreeSet
- LinkedHashSet

HashSet does not offer any ordering of elements. So HashSet is not the right choice if you value oriented operations are required. For that, TreeSet is proffered. But it is true to say that HashSet is used more often than TreeSet because HashSet is more faster and the reason is obvious i.e no ordering of elements. LinkedHashSet is something in between HashSet and TreeSet. It is as fast as HashSet and is implements using HashSet and LinkedList. The benefit of LinkedHashSet is that it provides ordering feature but the cost of ordering is not even close to what provided by TreeSet.

HashSet

HashSet implement Cloneable, Collection, Serializable and Set interface.
Since HashSet implements Cloneable interface, it means that HashSet can use clone() method to make a copy (field to field) of its object. HashSet is also serializable, so it can be saved on disk and then retrieved later for use.
JobStateReasons and LinkedHashSet are direct subclasses of HashSet.

HashSet has 4 constructors:

HashSet()
HashSet(Collection c)
HashSet(int initialCapacity)
HashSet(int initialCapacity, float loadFactor)

If you use default HastSet constructor, it will create an empty HashSet of default initial capacity (16) and load factor (0.75).

Add() method of the HashSet add the object into the storage if it is not already present. Duplicates are not allowed as it’s a set.

Lets review the code below. We will just add unique values to a HashSet and will display the contents of HashSet.
Code:
String [] strArray = new String[10];

for loop strArray.length with i
strArray[i] = "Element" + i;

HashSet s = new HashSet();

for loop strArray.length with i{
if(!s.add(strArray[i]))
System.out.println("Duplicate found : " + strArray[i]);
}

System.out.println(s.size() + " distinct words detected : " + s );
}
Output:
Code:
10 distinct words detected : [Element6, Element7, Element1, Element9,
Element3, Element8, Element2, Element0, Element5, Element4]
As you know, HashSet does not allow duplicates, so lets try this in the following example.
Code:
String [] strArray = new String[10];
for loop strArray.length with i
strArray[i] = "Element" + i;

strArray[1] = "Element2";
strArray[7] = "Element3";
strArray[8] = "Element4";

HashSet s = new HashSet();

for loop strArray.length with i{
if(!s.add(strArray[i]))
System.out.println("Duplicate found : " + strArray[i]);
}

System.out.println(s.size() + " distinct words detected : " + s );
}
Output:
Code:
Duplicate found : Element2
Duplicate found : Element3
Duplicate found : Element4
7 distinct words detected : [Element6, Element9, Element3, Element2, Element0, Element5, Element4]
We tried to add duplicates into the HastSet which is not allowed. Thing to note is, that no exception will be raised in case of duplicates. Also note the order of entries in HashSet. The order of elements is not maintained.

Creating a HashSet through a Collection

HashSet(Collection c) constructor is used to store a collection as a HastSet. It is very useful in scenarios where you have some collection (it can be a List (e.g. Vector/ArrayList) and you want to store it into a HashSet. Lets review the following example where a HashSet is created using a Vector.
Code:
Vector vec = new Vector();
vec.add("String1");
vec.add("String2");
vec.add("String3");
HashSet hs = new HashSet(vec);
Writing/Retriving HashSet to disk

Since HashSet implements Serializable interface, its objects can be written and retrieved from the disk. In other words, we can save the state of a HashSet and can retrieve it when needed.
Code:
HashSet hs = new HashSet();
hs.add("String1");
hs.add("String2");
hs.add("String3");

FileOutputStream f_out = new FileOutputStream("C:\\hashset.data");
ObjectOutputStream obj_out = new ObjectOutputStream (f_out);

obj_out.writeObject (hs);
System.out.println("HashSet written on the disk.");

FileInputStream f_in = new FileInputStream("C:\\hashset.data");
ObjectInputStream obj_in = new ObjectInputStream (f_in);
HashSet hashset =
new HashSet((HashSet)obj_in.readObject());

System.out.println("HashSet fetched from the disk.");

Iterator it = hashset.iterator();

while(it.hasNext())
System.out.println(it.next().toString());
Union and Intersection Example

Following is an interesting example of union and intersection. I assume that you are familiar with basics of set theory and know what union and intersection are.
Code:
public static void main(String[] args) {
Set s1 = new HashSet();
s1.add("Australia");
s1.add("Sweden");
s1.add("Germany");

Set s2 = new HashSet();
s2.add("Sweden");
s2.add("France");

Set union = new TreeSet(s1);
union.addAll(s2);

print("union", union);

Set intersect = new TreeSet(s1);
intersect.retainAll(s2);

print("intersection", intersect);
}

protected static void print(String label, Collection c) {

System.out.println("--------------" + label + "--------------");

Iterator it = c.iterator();
while (it.hasNext()) {
System.out.println(it.next());
}
}
Output:
Code:
--------------union--------------
Australia
France
Germany
Sweden
--------------intersection--------------
Sweden
TreeSet

Treeset implements Cloneable, Collection, Serializable, Set and SortedSet interfaces. This class maintains order of the elements in it according to the natural order of the elements which was missing in the HashSet.

TreeSet is not synchronized so if a TreeSet is concurrently accessed by threads then thread modifying the contents must be synchronized externally.

TreeSet provides following constructors:

TreeSet()
TreeSet(Collection c)
TreeSet(Comparator c)
TreeSet(SortedSet s)
Lets dig deep into TreeSet using example. In the following example, we created an empty TreeSet using default constructor. Then we added some values into it.
Code:
TreeSet ts = new TreeSet();
ts.add("String1");
ts.add("String3");
ts.add("String2");

Iterator it = ts.iterator();

while(it.hasNext())
System.out.println(it.next().toString());
Output:
Code:
String1
String2
String3
We used iterator to print the contents of the TreeSet. Thing to note is the order of storage. Order of storage is ascending one.

We cannot insert element at a particular index and also cannot fetch element from a particular index. This is done in List. Also duplicates are not allowed in TreeSet. This is a property of Sets. If you try to add duplicate value, no exception will be thrown. Lets do this with an example:
Code:
TreeSet ts = new TreeSet();
ts.add("Australia");
ts.add("Germany");
ts.add("Zambia");
ts.add("Australia");
ts.add("Zambia");

Iterator it = ts.iterator();

while(it.hasNext())
System.out.println(it.next().toString());
Output:
Code:
Australia
Germany
Zambia
Output suggests two things. The objects are stored in sorted order and duplicates are not allowed.

Contents of TreeList can be cleared using clear() method. Following example creates a TreeSet from a Vector and then clears the contents.
Code:
Vector vec = new Vector();
vec.add("String3");
vec.add("String1");
vec.add("String3");

TreeSet ts = new TreeSet(vec);
Iterator it = ts.iterator();

while(it.hasNext())
System.out.println("TreeSet: " + it.next().toString());
ts.clear();
while(it.hasNext())
System.out.println("TreeSet_Cleared: " + it.next().toString());
Output:
Code:
TreeSet: String1
TreeSet: String3
Creating a TreeSet through a Collection

A TreeSet can be created using any collection. TreeSet(Collection c) is the constructor to use in such condition. Any collection for example: Vector, ArrayList, HashSet or any can be used to create a TreeSet. Following is an interesting example:
Code:
Vector vec = new Vector();
vec.add("String3");
vec.add("String1");
vec.add("String3");

Iterator it = vec.iterator();

while(it.hasNext())
System.out.println("Vector: " + it.next().toString());

TreeSet ts = new TreeSet(vec);
it = ts.iterator();

while(it.hasNext())
System.out.println("TreeSet: " + it.next().toString());
Output:
Code:
Vector: String3
Vector: String1
Vector: String3
TreeSet: String1
TreeSet: String3
Vector is List that can contain duplicates and its not ordered. In the example above, we created a TreeSet from a Vector that contained an unordered list of objects along with duplicates. Some of you might thing that its not possible to create a TreeSet from it but it is possible. The output of the above example shows that a TreeList is created from the Vector with all the duplicated removed. Furthermore, contents of newly created TreeList are ordered.

Can we create a TreeList from an exiting HashSet? Since HashSet is also a collection, so answer is yes. The following example first creates a HashSet, populates it and then creates a TreeSet using already created HashSet.
Code:
HashSet hs = new HashSet();
hs.add("String2");
hs.add("String3");
hs.add("String1");
hs.add("String2");

TreeSet ts = new TreeSet(hs);

Iterator it = ts.iterator();

while(it.hasNext())
System.out.println("TreeSet: " + it.next().toString());
Output:
Code:
TreeSet: String1
TreeSet: String2
TreeSet: String3
TreeSet with generics

Java 5 introduced generics which adds more power to Java. TreeSet stores objects in it, but that object can be of any type. It can be a String, Integer, Float or even a custom object. With generics, you can specify the type of objects that are allowed to be stored in a TreeSet. In the following example, I tried to store an integer into a Vector that is bounded by String.
Code:
TreeSet ts = new TreeSet();
ts.add(1);
ts.add(2);
ts.add(3);
ts.add("String2");
Output:
Code:
The method add(Integer) in the type TreeSet is not applicable for the arguments (String)
TreeSet Example

You now will have some understanding of TreeSet. Review the example below. It has some interesting lines of code.
Code:
SortedSet sortedSet = new TreeSet(Arrays
.asList("one two three four five six seven eight".split(" ")));
System.out.println(sortedSet);
Object low = sortedSet.first();
Object high = sortedSet.last();
System.out.println(low);
System.out.println(high);
Iterator it = sortedSet.iterator();

System.out.println("low: " + low);
System.out.println("high: " + high);
System.out.println(sortedSet.subSet(low, high));
System.out.println(sortedSet.headSet(high));
System.out.println(sortedSet.headSet(low));
System.out.println(sortedSet.tailSet(low));
System.out.println(sortedSet.tailSet(high));
Output:
Code:
[eight, five, four, one, seven, six, three, two]
eight
two
low: eight
high: two
[eight, five, four, one, seven, six, three]
[eight, five, four, one, seven, six, three]
[]
[eight, five, four, one, seven, six, three, two]
[two]
As we already know, ordering is important in TreeList. This is shown in the example below. We also see methods like first, last, headset, tailSet which produced interesting results.

Method headSet() returns a view of the portion of this set whose elements are strictly less than toElement.
Method tailSet() returns a view of the portion of this set whose elements are greater than or equal to fromElement.

Differences between HashSet and TreeSet

Many developer are confused about sets and ask when to use HashSet and when to use TreeSet. Keep following points in mind for deciding the right set.
- HashSet is much faster than TreeSet.
- HashSet offers no ordering guarantees.
- TreeSet is preffered when performing operations in the SortedSet.
- HashSet can be tuned by specifying the right initial capacity using the constructor HashSet(int initialCapacity).
- HashSet can also be tuned used load factor parameter. If you choose right value for this, it can boost the performance a bit but there there won't be a big difference.
- TreeSet has no tuning parameters.

LinkedHashSet

LinkedHashSet handles collisions by using hash-bucket approach to avoid linear probing and rehashing. It uses doubly-linked list to maintain the insertion order. LinkedHashSet can accept the null entry and it is not synchronized.

LinkedHashSet implements Cloneable, Collection, Serializable and Set interface. It’s a set to no duplicates are allowed. LinkedHashSet has following 4 constructors:

LinkedHashSet()
LinkedHashSet(Collection c)
LinkedHashSet(int initialCapacity)
LinkedHashSet(int initialCapacity, float loadFactor

Thing will become obvious when you start using LinkedHashSet. Lets take an example to make things easier to understand.
Code:
LinkedHashSet lhs = new LinkedHashSet();

lhs.add("String1");
lhs.add("String9");
lhs.add("String7");
lhs.add("String6");
lhs.add("String7");

Iterator it = lhs.iterator();

while(it.hasNext())
System.out.println("LinkedHashSet: " + it.next().toString());
Output:
Code:
LinkedHashSet: String1
LinkedHashSet: String9
LinkedHashSet: String7
LinkedHashSet: String6
We declared a LinkedHashSet and populated it. Then we used iterator to print the contents of LinkedHashSet. The output suggests that the order of insertion is maintained and duplicates are not allowed.

Set Example

Now we know what HashSet, TreeSet and LinkedHashSet are and when to use these. Lets review the following example that will use all of the 3 sets and will clear a lot of confusions:
Code:
package set;

import java.util.Arrays;
import java.util.HashSet;
import java.util.LinkedHashSet;
import java.util.Set;
import java.util.TreeSet;

public class HastSetTest {

static void fillSet(Set set) {
set.addAll(Arrays.asList("Zambia Australia Germany France".split(" ")));
}

public static void testSet(Set set) {
System.out.println(set.getClass().getName().replaceAll("\\w+\\.", ""));
fillSet(set);
fillSet(set);
fillSet(set);
System.out.println(set);
set.addAll(set);
set.add("Germany");
set.add("Germany");

System.out.println(set);
System.out.println("s.contains(\"Zambia\"): " + set.contains("Zambia"));
}

public static void main(String[] args) {
testSet(new HashSet());
testSet(new TreeSet());
testSet(new LinkedHashSet());
}
}
Output:
Code:
HashSet
[Germany, France, Zambia, Australia]
[Germany, France, Zambia, Australia]
s.contains("Zambia"): true
TreeSet
[Australia, France, Germany, Zambia]
[Australia, France, Germany, Zambia]
s.contains("Zambia"): true
LinkedHashSet
[Zambia, Australia, Germany, France]
[Zambia, Australia, Germany, France]
s.contains("Zambia"): true
The output suggests that no duplicate is added in any set. The order of elements is all of the 3 sets is different. LinkedList maintained the order of insertion. TreeSet maintained alphabetic order whereas HashSet does not kept any order. This is what we talked about above and this example confirms what we discussed.

50 Rapidshare Premium Link Generator with out account (id and password)

2008-03-29T04:56:00.000-07:00

HI,

All of us know Rapidshare is the very good to uploading files and it is very costly to get the premium accounts. I have tried from so long time, but I did not fount at least one password till now. Rapid share is highly protected. We did not download with out Premium account.

We have can download this premium files by the following websites. It will generate the download links. I have collected the following links. I think this will help you to download rapidshare links with out any premium account (id and password).

http://rapidshit.com/
http://3rs.dr.ag/
http://rapidshare.da.ru/
http://rapid4all.com/ http://www.rapidcheat.com/ http://www.rapiddownloader.info/ http://rapidcrack.fosi.eu.org/
http://elitehacks.blogspot.com/2007/07/rapidshare-premium-link-generator.html http://rapidhood.dr.ag/
http://rapidshare.premium.link.generator.googlepages.com/rs.htm http://www.nobakwaas.com/premium/ http://www.nopremium.org/ http://jsbi.blogspot.com/2007/06/free-rapidshare-premium-link-generator.html http://www.mymegalink.net/
http://rs43.com/
http://rapidshot666.dr.ag/
http://flinke-keule.dr.ag/
http://www.rapidsharepremium.org/index.php
http://www.yourpremiums.com/
http://megaez.com/
http://khongbiet.com/
http://mymegalink.net/
http://rapid-hook.com/
http://www.rapidl.com/
http://www.rapidrip.com/
http://computeraxes.com/rapid
http://rapid-hook.com/
http://www.rapidsharepremiumlinkgenerator.com/
http://rapidlysharing.com/
http://www.rapidshareplus.com/
http://www.fastlister.net/rs/
http://www.lcheat.com/rs7/
http://rapid-ripping.com/
http://x92.org/
http://www.rapidshare.co.in/
http://www.rapidleechers.com/
http://www.rapidshare-premium-downloader.com/
http://www.premium4me.com/rapid.html
http://www.premiumrapid.com/rapid.html
http://www.download-crazy.com/rapid
http://www.grab-w.net/
http://rapid.lin.co.il/
http://rapidlysharing.com/
http://rapidlysharing.com/
http://easyrapidsharepremium.blogspot.com/ http://www.t5f.net/
http://www.rapid-premium.wb.st/
http://www.premium4me.com/
http://www.premiumrapid.com/ http://adverbux.com/register.php?ref=20778
http://bux.to/?r=siongfai
http://www.bugonptc.com/index.php?ref=siongfai
http://inspiremarrow.com/pages/index.php?refid=siongfai
other 40 link genrators click

40 Websites Rapidshare Premium Link Generator with out account (id and password)

Rapid share id and passwords

2008-03-29T04:49:00.000-07:00

hi all

Do not required to wait so long to to download rapidshare links.It is very easy to download rapidshare links with out wait lot of time.

he is the link that will take rapidshare link and download 10 links per day . it is very useful to download rapidsahre links with free accounts with out premium id and password.

http://www.rapidsharepremium.org/index.php

enjoy downloading by rapid share.

Vbscript Code Copy / Move Data MS Access To MS Excel

2008-01-21T03:59:00.001-08:00

I have written vbscript code that can copy data from access to excel and also copy data from one excel sheet to other excel sheet (Copy data from sheet 1 to 2) in same workbook. i have created the Ms access database with some data and named as Db.mdb in D:/ (D: drive). i have created Microsoft excel with empty.

I have created one Excel Application object and named it as XLobj. Open the existing excel workbook from D drive. Enabled the excel application Visible property to true, to know the data is coped or not.

I have created ADODB Connection and ADODB Recordset objects and named it as objConn , resultSet respectively. i have opened the connection by setting Provider name Microsoft.Jet.OLEDB.4.0 and Data Source to my Ms access. By using Recordset object i have copied data from emp table to resultSet. i have changed the resultSet object to fist location.

By default excel Worksheets sheet-1 is Activate. I have changed default Worksheets sheet-1 to Worksheets sheet-2 .By using Range i have set excel shell to A1. By using CopyFromRecordset method i have data from Recordset to Excel sheet. The word Offset indicates the starting position of filed to copy data from access to excel.

I have also copy the data from Worksheets sheet-2 to Worksheets sheet-1 (copy data sheet 1 to sheet 2). First I have taken Worksheets sheet-2 and selected all the data from sheet. Then I have copied the selected data by using XLobj.Selection.Copy methode.

I have selected data in Worksheets sheet-1. i pasted data from Worksheets sheet-2 to Worksheets sheet-1. I have closed the Connection, Recordset objects and Save the workbook.

VB CODE FOR COPY DATA FROM ACCESS TO EXCEL :

Dim XLobj,objConn,resultSet,TargetRange,xlSheet,xlSheet1

Set XLobj = CreateObject("Excel.Application")
XLobj.Workbooks.Open "D:\db.xls"
XLobj.Visible = True

Set objConn = CreateObject("ADODB.Connection")
set resultSet = CreateObject("ADODB.Recordset")
objConn.Open "Provider=Microsoft.Jet.OLEDB.4.0;Data Source=D:\Db.mdb"
Set resultSet = objConn.Execute("SELECT * FROM emp")
resultSet.MoveFirst

XLobj.Worksheets(2).Activate
Set TargetRange =XLobj.Range("A1")
TargetRange.Offset(1, 1).CopyFromRecordset resultSet

Set xlSheet = XLobj.Worksheets(2)
xlSheet.Select
XLobj.Selection.Copy

Set xlSheet1 = XLobj.Worksheets(1)
xlSheet1.Select
xlSheet1.Paste

resultSet.Close
objConn.Close
Set resultSet = Nothing
Set objConn = Nothing

XLobj.ActiveWorkbook.Save
XLobj.Quit