Search Results

Search found 1805 results on 73 pages for 'interview preparation'.

Page 10/73 | < Previous Page | 6 7 8 9 10 11 12 13 14 15 16 17  | Next Page >

  • Crazy interview question

    - by benjamin button
    I was asked this crazy question. I was out of my wits. Can a method in base class which is declared as virtual be called using the base class pointer which is pointing to a derived class object? Is this possible?

    Read the article

  • An interview question on conditional operator

    - by nthrgeek
    I recently encountered with this question: How to reduce this expression: s73?61:60;. The hint given was that Instead of using conditional operator we could use a simple comparison which will work fine. I am not sure but I think it is possible with some GCC extension,although I am unable to figure it out myself. EDIT:The whole expression is this : s-=s73?61:60

    Read the article

  • "Oracle Certified Expert, Java Platform, Enterprise Edition 6 Java Persistence API Developer" Preparation

    - by Matt
    I have been working with Hibernate for a fews years now, and I want to solidify and demonstrate my knowledge by taking the Oracle JPA certification, also known as: "Oracle Certified Expert, Java Platform, Enterprise Edition 6 Java Persistence API Developer (CX-310-094)" There is a training course provided by Oracle: "Building Database Driven Applications with JPA (SL-370-EE6)" But this costs $1800 and I think it would be overkill for my needs. Ideally, I would like a self study guide that will cover everything in the exam. I have looked for books and these seem like possibilities: Pro JPA 2: Mastering the Java Persistence API (Expert's Voice in Java Technology) and Beginning Java EE 6 with GlassFish 3 2nd Edition (Expert's Voice in Java Technology) But these aren't checklist type study guides as far as I am aware. I found the official SCJP study guide very useful, but I think the equivalent text for the JPA exam isn't out yet. If anyone has taken this exam, I would be grateful to hear how you prepared for it. Thanks!

    Read the article

  • Weird interview question from MS

    - by didxga
    There are two numbers, which are both between 1 and 30 inclusive. Person A knew the addition of the two numbers; Person B knew the multiplication of the two numbers; A said:"do you know what numbers are they?" B replied:"I don't know, do you know?" A:"I don't know either" then B said:"so, I knew already" then A said:"I knew either" What are the two numbers?

    Read the article

  • ASP.net Interview Question

    - by Amutha
    Recently i was asked (1) "How will you do performance optimization over your jQuery in ASP.net ?" (2) "How many script manager can we have in ASP.net Application?" why? (Ajax related). I have no ideas on both.Help me to grow.

    Read the article

  • Online interview quiz

    - by Deano
    I am currently interviewing for a developer role in my company and I have had a lot of poor candidates come in so far. One of the things we have discussed is providing an online test for the candidates to fill in. Has anyone ever used an online service like this? Even if the service charges a fee that is not a problem. I would prefer if the candidates quiz results were confidential.

    Read the article

  • Interview Romain Linsolas, un Devoxxien passionné et membre de Developpez.com, par Thierry Leriche-Dessirier

    Bonjour à tous,Voici une interview de Romain Linsolas : http://thierry-leriche-dessirier.dev...per-devoxxien/On croise régulièrement Romain Linsolas dans les conférences françaises et européennes en tant que simple spectateur, mais également comme orateur. Avec quatre interventions sur les précédentes éditions de Devoxx et de nombreuses apparitions dans des Users Groups, Romain est devenu une figure dans le petit monde du développement.Dans cette interview, Romain nous décrit sa vision des conférences...

    Read the article

  • Recursion Interview Questions [closed]

    - by halivingston
    Given a string, "ABC", print all permutations Given a dollar bill, fill out possible ways it can summed up using .25, .10, .5, etc. Given a phone number (123-456), print out all it's word counter parters like (ADG-XYZ) A B C D E F G H I J K L M N O P In the above 2D matrix, print all possible words (just literally all words, and sure we could check if it's exists in a dictionary). The base case is I think here is that reaching the same i, j positions. Any others you can think of?

    Read the article

  • Préparation à la certification programmeur Java 6, déclaration et contrôle d'accès, par Fabrice Ndjobo

    Bonjour à tousJe viens par le présent message vous annoncer la publication de l'article Déclaration et contrôle d'accès. Il a pour but de présenter de façon concise les notions fondamentales du langage Java (les énumérations, les classes et les interfaces) et s'inscrit dans la suite Le Mémo du certifié Java 6.A terme, l'ensemble des articles de cette suite devra permettre à tout développeur Java d'avoir sensiblement le même niveau de connaissance qu'un titulaire d'une certification Java SE 6.Je vous invite donc non seulement à prendre connaissance du conten...

    Read the article

  • Website creation preparation [closed]

    - by Loki
    I am in the pre-coding phase of creating a website. I know that it will be account based (users have to register/login to use the features). I also know that the server will have to do certain operations that are timer based, that is to say that user will have events that will trigger at a point chosen by the user and do something. I am searching for a good choice in server-side technology, and was wondering what my options are and what the best choice is. I would prefer open technology and something that doesn't use interpreted languages (Java, .net). My first thought is PHP + PGSQL for serverside and HTML+CSS+JS for clients, but I am still looking at my options.

    Read the article

  • Interview Programming Questions - In house Exam

    - by David McGraw
    I have a company that would like to bring me in to serve me an hour long exam. No resources other than a pencil and paper. I really couldn't get any sort of feedback on the type of exam (implementation or generic) beside that it would test a few specific areas. Have you done anything like this? What sort of questions did they ask? What's a good way to prepare? I'll probably go in a couple weeks before school starts back up. A time sensitive exam structure is a weak point for me, so what should I absolutely focus down on? If they like the exam, that's when I'll get a face-to-face meeting. An advance thanks goes to everybody who provide their time.

    Read the article

  • Interview question: C program to sort a binary array in O(n)

    - by Zacky112
    I've comeup with the following program to do it, but it does not seem to work and goes into infinite loop. Its working is similar to quicksort. int main() { int arr[] = {1,1,0,1,0,0,0,1,0,1,0,1,0,1,0,1,0,1}; int N = 18; int *front, *last; front = arr; last = arr + N; while(front <= last) { while( (front < last) && (*front == 0) ) front++; while( (front < last) && (*last == 1) ) last--; if( front < last) { int temp = *front; *front = *last; *last = temp; front ++; last--; } } for(int i=0;i<N;i++) printf("%d ",arr[i]); return 0; }

    Read the article

  • simple interview question

    - by calvin
    Input integer array: a[8] = { a1, a2, a3, a4, b1, b2, b3, b4 } Output array: a[8] = { a1, b1, a2, b2, a3, b3, a4, b4 } Forget all corner cases, make sure your solution works for any int array of size 2n. You can use one or two temp variables for looping or anything, but you shouldn't use any temp arrays/stacks/queues etc to store entire array or part of array. I'm able to get answer in O(n*log n), but I'm looking for better solution.

    Read the article

< Previous Page | 6 7 8 9 10 11 12 13 14 15 16 17  | Next Page >