Hi,
I want to take an SCJP exam, but I am unable to decide which one should I take - SCJP 5(Java 1.5) or SCJP 6(Java 1.6). It would be great if anyone could help me in this regard.
Thanks,
Rakesh.
Are Delphi/Pascal being taught in any high schools/colleges/universities, particularly in Canada and the US?
I was surprised how many schools in the UK are teaching Delphi. Their largest exam board is even dropping PHP/C#/C in 2011 and encouraging Delphi. I also remember that CodeGear was going to provide development tool licenses to Russian schools a couple of years ago.
I'd like to know if it's being taught closer to (my) home.
Hi,
I'm thinking of a serious training in j2ee and found there are too many books to choose from. Could you kindly share your insights as a practicing professional in this respect?
For example, some people in other post recommend "SCWCD Exam Study Kit Second Edition
Java Web Component Developer Certification Hanumant Deshmukh, Jignesh Malavia, and Matthew Scarpino"
by quickly looking at Amazon, I found Enterprise JavaBeans 3.0 (5th Edition) [Paperback]
Richard Monson-Haefel received 141 reviews....
thanks
Cannot convert from "void" to "int" in C++ - anyone know why? is there a function i have to use?
int calc_tot,go2;
go2=calculate_total(exam1,exam2,exam3);
calc_tot=read_file_in_array(exam);
Every so often on here I see someone's code and what looks to be a 'one-liner', that being a one line statement that performs in the standard way a traditional 'if' statement or 'for' loop works.
I've googled around and can't really find what kind of ones you can perform? Can anyone advise and preferably give some examples?
For example, could I do this in one line:
example = "example"
if "exam" in example:
print "yes!"
Or:
for a in someList:
list.append(splitColon.split(a))
Hello...This code produces a mess... What am i doing wrong???
cell=$("<td>");
if(normal.exam_type=="Exam_Boolean")
{
var input=cell.append("<input>").last();
input.attr("type","hidden");
input.attr("name","exam.exam_Normal['" +normal_id_unique + "'].boolean_v");
input.attr("value",normal.normal_boolean);
In books I have seen that it exists but MSDN says it does not???
What do you guys have to say on this subject???
Might load up VS later on and see if it appears in 3.5 .Net. I;m asking as some of you lot know I am lsowly revising for the exam and I don't want little nougets like this to suprise me.
TIA
Hi,
Is there a sexy way to get a web page with Google Maps (in fullscreen), and just a small div#header on the top and a small div#container on the middle?
I had make some research and I had found this example: http://koti.mbnet.fi/ojalesa/exam/index.html ... but this is not exactly what I would like to do.
If you have a thin code example of a nice website example, this would help me a lot.
Many Thanks.
i'm working for my exam. i didn't resolved this question. does anyone help me?
assume that there are two block, BLOCK1 AND BLOCK2. every block has 50 bytes. write a program to add BLOCK1 with BLOCK2 , and store result to BLOCK2 using LODS, STOS and LOOP etc. assembly commands?
We are designing an online application (college admission form) which mandates the user to upload a scanned copy of his photo along with his signature, so that this information can be used to cross verify the applicant when he appears for a exam + personal interview at a later point in time. This entire process requires a scanner for the applicant to scan his photo / signature into an appropriate size. Is there a better way to capture user identity for such purposes as usage of scanner for capturing signature, photo is a painful process.
The certification's cost between $300-400 per exam which is pretty expensive.
I'm still a java newb but eventually I would like to get a job in the field of computer programming and I'm wondering if the Sun Java certifications would help.
Especially considering that I do not have the time or money to get a degree.
on Linux ext3 filesystem, what happens if mv() is called on the same file (file descriptor) while reading the file? It is actually an exam question and I can only say something like:
CPU traps OS for interrupt handling
etc, etc.
I would appreciate if OS guys out there can help me out, please :D
I'd like to get some help in the following exam problem, i have no idea how to do this:
Input: a list of numbers, eg.: [1,2,3,4]
Output: every possible correct bracketing. Eg.: (in case of input [1,2,3,4]):
((1 2) (3 4))
((1 (2 3)) 4)
(1 ((2 3) 4))
(1 (2 (3 4)))
(((1 2) 3) 4)
Bracketing here is like a method with two arguments, for example multiplication - then the output is the possible multiplication orders.
Please help, i'm stuck with this one. Any help is appreciated, thanks!
i have an exam and i would like to print my java (in netbeans project) files as fast as possible. i was wondering is there a way to print an entire project/project in netbeans with one click? or do you have a better suggestion? (i will be using windows xp and there is no nice editor like gedit installed)
This is a quesiton taken from a java exam,
How many objects are eligible for gabage collection at #1 ?
public class Main {
Integer x = 32768;
public static void main(String[] args)
{
Main m = new Main();
m = null;
// #1
}
}
I thought it just collect Integer x, does GC even collect the Main object m?
plz help me i need to make asimple calculator using c
for example (1+2-44)/7
but it requiers reverse polish notation which i cant under stand
if any one could help me giving me the code i'll be greatfull cause i have an exam after 2 days
Hello guys.
I have a problem. how i can run my hava-aplet directly without embendend in my web page?
If i answer on this question in a few minutes i will pass exam else i going out from university!!! please guys help!!
I am trying to write a pre-qualification programming exam, hopefully using Google Forms... however they seem to be unable to do new-lines in both the questions and the section headers...
My current format is new page for each question, with a "section header" as the main question (because it has a textarea for the "code snippet") and a "multiple choice question" as the ummm... question answer...
Help much appreciated...
I have a realy hard task here. I am working on an AngularJS web app, which is capable of sending different HTTP methods to our project's Restful Web Service and receiving responses in JSON. Basicaly it looks like this:
You can create some REST resource from this application. Let's say an exam. To create an exam - you pick a resource from a list of available resources. This triggers a function, that sends a request to localhost:8080/STEP/api/explain/resorceName and gets a description for this resource. Description looks like this:
http://jsonblob.com/534fc022e4b0bb44248d6460
After receiving a response - I start building input fields like follows (allFields - array of field objects for this resource, enumValues - enum values for resource's field if it's property isEnum = true):
<div ng-repeat="field in allFields">
<div ng-show={{!field.isEnum}}>
<p ng-show={{field.isRequired}}>{{field.name}}*: </p>
<p ng-show={{!field.isRequired}}>{{field.name}}: </p>
<input type="text" ng-model="updateEntityResource[field.name]" ng-change="getUpdateEntityAsText()"
class="form-control" placeholder="{{parseClassName(field.type)}}">
</div>
<div ng-show={{field.isEnum}}>
<p ng-show={{field.isRequired}}>{{field.name}}*: </p>
<p ng-show={{!field.isRequired}}>{{field.name}}: </p>
<select ng-model="updateEntityResource[field.name]" ng-change="getUpdateEntityAsText()" class="form-control">
<option></option>
<option ng-repeat="enumValue in field.enumValues" label={{enumValue.name}}>{{enumValue.ordinal}}</option>
</select>
</div>
</div>
Now, the problem. I need to create a recursive directive, which would be capable of generating fields in such maner as described above for every resource's field that has "restResourceName" not null. To get all it's fields you just send a request to localhost:8080/STEP/api/explain/restResourceName and get similar JSON response as shown above, which is then used to build HTML elements for inputing values into model.
Does anyone know how this can be achieved using angular recursive directive? Every useful answer is highly appreciated and evaluated. The correct answer will get +50 or I will start a bounty, because I'm realy stuck with this for 2 days.
If you need any additional info - let me know.
Thank you.
Even if I have made a certification exam on Sql Server Design and implementation , I have no clue about how to trace/debug/optimise performance in Sql Sever.
Now the database I built is really business critical, and getting big, so it is time for me to dig into optimisation, specially regarding when/where to add indexes.
Can you recommend a good book on this subject ? (smaller is better :)
Just in case: I am using Sql Server 2008.
Thanks
Hi,
I have an exam tomorrow and I need some help with these programs. Or if you can tell me where I can get these.
Write a program which uses grep to search a file for a pattern and display search patterns on standard output
Write an awk program to print only odd numbered lines of a file.
Write a program to open the command ls and give the output to the command through which we count the number of files
Thank You :)
Hey SO
Doing a some practice questions for exam tomorrow can't figure out this one
What is the minimum number of socket port(s) required for a TCP server to connect a TCP client for communication?
Surely its just two right? one for the server one for the client, but this seems to obvious. My mates thinks TCP uses two ports at the server end for for data in and one for data out.
thanks in advance
Hi! This was a question in our old C++ exam. This code is driving me crazy, could anyone explain what it does and - especially - why?
int arr[3]={10,20,30};
int *arrp = new int;
(*(arr+1)+=3)+=5;
(arrp=&arr[0])++;
std::cout<<*arrp;
I am busy preparing for exams, just doing some old exam papers. The question below is the only one I can't seem to do (I don't really know where to start). Any help would be appreciated greatly.
Use the O(nlogn) comparison sort bound, the theta(n) bound for bottom-up heap construction, and the order complexity if insertion sort to show that the worst-case number of inversions in a heap is O(nlogn).