-
Jul 27th, 2004, 05:30 AM
#1
Thread Starter
Member
How difficult would this job be?
Hi, i am just looking through a few VB related jobs.
I would say i'm intermediate at VB, know SQL, SQL server , MS Access and a bit of ASP/ASP.NET and HTML.
But i have no idea what you would be expected to do in the type of jobs i'm looking at.
Could somebody please give me advice as to what level of coder you should be to survive in one of these jobs.
TIA.
http://jobs.beginners.co.uk/portal/q...sic/id/3063481
http://jobs.beginners.co.uk/portal/q...sic/id/3064186
-
Jul 27th, 2004, 06:12 AM
#2
KING BODWAD XXI
Just apply. If you get an interview you will find out more if not then its just like ignoring it and saying you couldnt do it. AKA you have nothing to lose
-
Jul 27th, 2004, 06:17 AM
#3
I've taken COBOL contracts with very, very little COBOL experience. Sitting quieting with a manual got me through those job. Same with DIBOL...
Act aggresive - I've never met a challenge that I couldn't overcome...
-
Jul 27th, 2004, 06:20 AM
#4
KING BODWAD XXI
The challenge is what makes it fun. I am no longer challenged and I am fed up
-
Jul 27th, 2004, 06:23 AM
#5
Originally posted by BodwadUK
The challenge is what makes it fun. I am no longer challenged and I am fed up
That's a shame. I've been programming for 25 years now - only 3 years on PC's with VB.
Nearly 20 years ago I stopped working for others - giving up my proprietary rights to lizards who only cashed in on you.
I truly love my work.
-
Jul 27th, 2004, 06:25 AM
#6
I wonder how many charact
That first one would be a cake-walk for you.... its sounds like investigative troubleshooting (tech support on a higher level).
The second one is easy too.....
Employment ads always make themselves sound like you need a phd from Harvard or Oxford to get a job... (business analyst = listen to our needs and model a program to meet them)
-
Jul 27th, 2004, 08:36 AM
#7
You just need confidence to get a job (it seems). If you can convince the manager you do know what you are on about (and look it up at high speed if you don't) then you are more likely to be hired.
How do I know??
Because I don't have confidence, and I could probably do 80% of the jobs I've applied for, instead I'm a temp lazing away the days (atm) being bored.
Gutting.
Vince
Feeling like a fly on the inside of a closed window (Thunk!)
If I post a lot, it is because I am bored at work! ;D Or stuck...
* Anything I post can be only my opinion. Advice etc is up to you to persue...
-
Jul 27th, 2004, 10:46 AM
#8
Fanatic Member
Originally posted by Ecniv
You just need confidence to get a job (it seems). If you can convince the manager you do know what you are on about (and look it up at high speed if you don't) then you are more likely to be hired.
How do I know??
Because I don't have confidence, and I could probably do 80% of the jobs I've applied for, instead I'm a temp lazing away the days (atm) being bored.
Gutting.
Vince
I am a temp too =) But cause I have to go back to school august 10th >=(
-
Jul 27th, 2004, 11:24 AM
#9
Thread Starter
Member
Originally posted by Ecniv
You just need confidence to get a job (it seems). If you can convince the manager you do know what you are on about (and look it up at high speed if you don't) then you are more likely to be hired.
How do I know??
Because I don't have confidence, and I could probably do 80% of the jobs I've applied for, instead I'm a temp lazing away the days (atm) being bored.
Gutting.
Vince
hmm well i've seen quite a few of your posts in the db forum, and i'd say your were more advanced than me so....
So your saying you've applied for a lot of VB jobs but didn't get them. What do yuo think was your losing point?
-
Feb 24th, 2020, 07:09 AM
#10
Re: How difficult would this job be?
Originally Posted by Ecniv
You just need confidence to get a job (it seems). If you can convince the manager you do know what you are on about (and look it up at high speed if you don't) then you are more likely to be hired.
How do I know??
Because I don't have confidence, and I could probably do 80% of the jobs I've applied for, instead I'm a temp lazing away the days (atm) being bored.
Gutting.
Vince
Interesting Video:
-
Feb 24th, 2020, 11:44 AM
#11
Re: How difficult would this job be?
Yeah, I like that point of view.
And I've been trying to think of how to reply in this thread for the last 16 years, and today is the day!
My usual boring signature: Nothing
-
Feb 24th, 2020, 11:50 AM
#12
Re: How difficult would this job be?
Originally Posted by Shaggy Hiker
Yeah, I like that point of view.
And I've been trying to think of how to reply in this thread for the last 16 years, and today is the day!
He might of retired by now...
Please remember next time...elections matter!
-
Feb 24th, 2020, 05:32 PM
#13
Re: How difficult would this job be?
Gee, I hope not. Perhaps I'll have given him the gumption to finally apply.
Seeing these old threads is always interesting. Some classic old characters participated in some of these threads, like Bodwad, Ecniv, Nemaroller, szlamany....where have they all gotten off to?
What's fairly novel about this thread is that there are several participants, and not one of them was perma-banned. Lots of those old threads are populated by folks who walked the plank for one reason or another.
My usual boring signature: Nothing
-
Feb 24th, 2020, 06:36 PM
#14
I wonder how many charact
Re: How difficult would this job be?
Yes, just the other day I was looking for a fast quick solution to some problem and came across this: https://github.com/mendhak/docker-http-https-echo
I thought to myself, what's the possibility it is the same mendhak from vbforums?
I now just thought to myself, how is it possible vbforums is still running? And that ShaggyHiker is still moderating? Almost on the 20th anniversary of joining.
Last edited by nemaroller; Feb 25th, 2020 at 09:32 AM.
-
Feb 25th, 2020, 06:27 AM
#15
Re: How difficult would this job be?
Still moderating, still don't have clue about the avatar image and still not asking
ἄνδρα μοι ἔννεπε, μοῦσα, πολύτροπον, ὃς μάλα πολλὰ
πλάγχθη, ἐπεὶ Τροίης ἱερὸν πτολίεθρον ἔπερσεν·
-
Feb 25th, 2020, 08:15 AM
#16
Re: How difficult would this job be?
Vase of Fish, I believe. Although more convincing as a palm tree with a weight problem.
The best argument against democracy is a five minute conversation with the average voter - Winston Churchill
Hadoop actually sounds more like the way they greet each other in Yorkshire - Inferrd
-
Feb 25th, 2020, 08:33 AM
#17
Re: How difficult would this job be?
I believe we were talking about Mendhak's amazon-box-wally...
-
Feb 25th, 2020, 10:27 AM
#18
Re: How difficult would this job be?
I find it hard to believe that there would be two Mendhak. Perhaps I just don't WANT to believe that....
My usual boring signature: Nothing
-
Feb 25th, 2020, 10:38 AM
#19
Re: How difficult would this job be?
Originally Posted by FunkyDexter
Vase of Fish, I believe. Although more convincing as a palm tree with a weight problem.
You just had to ruin it for me didn't you?
ἄνδρα μοι ἔννεπε, μοῦσα, πολύτροπον, ὃς μάλα πολλὰ
πλάγχθη, ἐπεὶ Τροίης ἱερὸν πτολίεθρον ἔπερσεν·
-
Feb 25th, 2020, 02:05 PM
#20
Re: How difficult would this job be?
Originally Posted by FunkyDexter
Vase of Fish, I believe. Although more convincing as a palm tree with a weight problem.
For years I thought it was a Pineapple.
-
Feb 26th, 2020, 10:35 AM
#21
Re: How difficult would this job be?
Speaking of old threads, jobs, and other odds and ends... has anyone heard of the fizzbuzz test? I'd never heard of it until yesterday in a reddit thread, but apparently it's a common litmus test for weeding out potential candidates that can't program themselves out of a wet paper bag.
-tg
-
Feb 26th, 2020, 11:59 AM
#22
Re: How difficult would this job be?
That was new to me...
I did it in about twenty-five minutes. I made a couple of mistakes, had to look up how to check for a whole number, and had the order I checked the conditions mixed up. Here is my solution...it is not as clean as the ones in the article (I didn't look first)
https://wiki.c2.com/?FizzBuzzTest
Code:
Dim i As Integer
Dim Check3 As Double
Dim Check5 As Double
Dim output As Double
For i = 1 To 100
Check3 = i / 3
Check5 = i / 5
If (Integer.TryParse(Check3, output)) And (Integer.TryParse(Check5, output)) Then
Debug.Print(i & " FizzBuzz")
ElseIf (Integer.TryParse(Check5, output)) Then
Debug.Print(i & " Buzz")
ElseIf (Integer.TryParse(Check3, output)) Then
Debug.Print(i & " Fizz")
Else
Debug.Print(i.ToString)
End If
Next
Last edited by TysonLPrice; Feb 26th, 2020 at 12:22 PM.
Please remember next time...elections matter!
-
Feb 26th, 2020, 12:23 PM
#23
Re: How difficult would this job be?
Yeah, that resorts to the floating point math that people were talking about in the reddit post... according to them, you'd get partial points for it.
How about this for a "cleaner" approach:
Code:
Dim i As Integer
Dim Check3 As Integer
Dim Check5 As Integer
Dim output As Double
For i = 1 To 100
Check3 = i Mod 3
Check5 = i Mod 5
If (Check3 = 0) AndAlso (Check5 = 0) Then
Debug.Print(i & " FizzBuzz")
ElseIf Check5 = 0 Then
Debug.Print(i & " Buzz")
ElseIf Check3 = Then
Debug.Print(i & " Fizz")
Else
Debug.Print(i.ToString)
End If
Next
That's basically what they are looking for... a loop and the use of a modulo operand and the proper use of the 3, 5, and 3&5 checking...
I think the biggest thing that trips people up is the divisible by 3 and 5 people try to d a check by 3 then then by 5, then by 3 and 5.... and then wonder why FizzBuzz never happens, not realizing it needs to be checked for first.
Apparently there's a number of people out there that can't get this even with Google and 45 minutes.
-tg
-
Feb 26th, 2020, 12:31 PM
#24
Re: How difficult would this job be?
I think the biggest thing that trips people up is the divisible by 3 and 5 people try to d a check by 3 then then by 5, then by 3 and 5.... and then wonder why FizzBuzz never happens, not realizing it needs to be checked for first.
I did that the first iteration
Please remember next time...elections matter!
-
Feb 26th, 2020, 04:01 PM
#25
Re: How difficult would this job be?
Originally Posted by TysonLPrice
I did that the first iteration
But you at least ran it, checked it, and figured it out... right? The thread I was reading, people weren't even doing that.... they were googling the answer, finding the first one, copying that - and it was HEAVILY documented to be the WRONG answer too - and then submitting that... It reminds me a lot of some of the threads around here, where people blindly copy/pasta code with out ever understanding once single iota of it.
-tg
-
Feb 26th, 2020, 04:59 PM
#26
Re: How difficult would this job be?
Originally Posted by techgnome
It reminds me a lot of some of the threads around here, where people blindly copy/pasta code with out ever understanding once single iota of it.
-tg
I really like that sentence. I hope it was intentional. Nothing like that spaghetti code.
My usual boring signature: Nothing
-
Feb 26th, 2020, 08:03 PM
#27
Re: How difficult would this job be?
Originally Posted by techgnome
Yeah, that resorts to the floating point math that people were talking about in the reddit post... according to them, you'd get partial points for it.
How about this for a "cleaner" approach:
Code:
Dim i As Integer
Dim Check3 As Integer
Dim Check5 As Integer
Dim output As Double
For i = 1 To 100
Check3 = i Mod 3
Check5 = i Mod 5
If (Check3 = 0) AndAlso (Check5 = 0) Then
Debug.Print(i & " FizzBuzz")
ElseIf Check5 = 0 Then
Debug.Print(i & " Buzz")
ElseIf Check3 = Then
Debug.Print(i & " Fizz")
Else
Debug.Print(i.ToString)
End If
Next
That's basically what they are looking for... a loop and the use of a modulo operand and the proper use of the 3, 5, and 3&5 checking...
I think the biggest thing that trips people up is the divisible by 3 and 5 people try to d a check by 3 then then by 5, then by 3 and 5.... and then wonder why FizzBuzz never happens, not realizing it needs to be checked for first.
Apparently there's a number of people out there that can't get this even with Google and 45 minutes.
-tg
I See the improvements...cool
Please remember next time...elections matter!
-
Feb 27th, 2020, 09:25 AM
#28
Re: How difficult would this job be?
With FizzBuzz, there aren't really any rules about how you solve it as long as the algorithm's correct. Beyond that, particular employers might be looking for particular gotchas, approaches, want it in a specific language etc. but that's not really part of FizzBuzz.
So, while I also prefer TG's approach, Tyson's was perfectly correct. Unless the interviewer says it isn't.
The best argument against democracy is a five minute conversation with the average voter - Winston Churchill
Hadoop actually sounds more like the way they greet each other in Yorkshire - Inferrd
-
Feb 28th, 2020, 04:49 AM
#29
Re: How difficult would this job be?
Originally Posted by FunkyDexter
With FizzBuzz, there aren't really any rules about how you solve it as long as the algorithm's correct. Beyond that, particular employers might be looking for particular gotchas, approaches, want it in a specific language etc. but that's not really part of FizzBuzz.
So, while I also prefer TG's approach, Tyson's was perfectly correct. Unless the interviewer says it isn't.
We used to use this with constraints. Some of our favourites were:
1) No nested if and no else (or equivalent) and use of the words fizz buzz only once
2) No if/else (or equivalent)
3) left/right justify output in 40 chars with equal spacing as far as possible.
All advice is offered in good faith only. You are ultimately responsible for the effects of your programs and the integrity of the machines they run on. Anything I post, code snippets, advice, etc is licensed as Public Domain https://creativecommons.org/publicdomain/zero/1.0/
C++23 Compiler: Microsoft VS2022 (17.6.5)
-
Feb 28th, 2020, 10:59 AM
#30
Re: How difficult would this job be?
No nested if and no else (or equivalent) and use of the words fizz buzz only once
That one was specified the one time I had to do it. Two separate Ifs and a Concatenation was the solution I used.
I've got a (possibly false) memory of friend telling me he used recursion to solve it once. Though as I sit here now I can't imagine how that would be useful.
The best argument against democracy is a five minute conversation with the average voter - Winston Churchill
Hadoop actually sounds more like the way they greet each other in Yorkshire - Inferrd
-
Feb 29th, 2020, 04:55 AM
#31
Re: How difficult would this job be?
Code:
Though as I sit here now I can't imagine how that would be useful.
For an interview, the issue isn't that the solution is useful, but whether the person can think that way
All advice is offered in good faith only. You are ultimately responsible for the effects of your programs and the integrity of the machines they run on. Anything I post, code snippets, advice, etc is licensed as Public Domain https://creativecommons.org/publicdomain/zero/1.0/
C++23 Compiler: Microsoft VS2022 (17.6.5)
-
Feb 29th, 2020, 02:53 PM
#32
Re: How difficult would this job be?
I'm not sure that I could do a recursive solution for an interview, but if they'd be willing to settle for plain old cursing, I could manage that.
My usual boring signature: Nothing
-
Feb 29th, 2020, 11:15 PM
#33
Re: How difficult would this job be?
Dunno where I read this - but a few "hardcases of interviewers" seem to give extra-points for:
- recognizing the "math-simplification" (when the product of 3*5 is used in the modulo-tests)
- and when the problem got "split-up" into a "description"- and "generic-solver"-part
Something like in this (VB6-based) example:
Code:
Dim Result, colDiv As New cSortedDictionary 'describe "the problem"
colDiv.Add 3, "is Dividable by 3 (Fizz)"
colDiv.Add 5, "is Dividable by 5 (Buzz)"
colDiv.Add 3 * 5, "is Dividable by 3 and 5 (FizzBuzz)"
For Each Result In DivCheckOnInterval(1, 100, colDiv, True) 'solve the problem generically
Debug.Print Result
Next
Function DivCheckOnInterval(First, Last, Divisors As cSortedDictionary, ByVal LargestHitOnly As Boolean) As cCollection
Set DivCheckOnInterval = New_c.Collection 'set our function-result (to a yet empty List-Object)
Dim Number As Long, i As Long
For Number = First To Last
For i = Divisors.Count - 1 To 0 Step -1 'reverse loop over the (automatically sorted) divisors-list
If Number Mod Divisors.KeyByIndex(i) = 0 Then 'Ok, it's dividable...
DivCheckOnInterval.Add Number & " " & Divisors.ItemByIndex(i) 'add the Number + "friendly text"
If LargestHitOnly Then Exit For
End If
Next
Next
End Function
Olaf
-
Mar 1st, 2020, 04:52 AM
#34
Re: How difficult would this job be?
Originally Posted by Shaggy Hiker
I'm not sure that I could do a recursive solution for an interview, but if they'd be willing to settle for plain old cursing, I could manage that.
Of curse they would...
Please remember next time...elections matter!
-
Mar 1st, 2020, 05:37 AM
#35
Re: How difficult would this job be?
"hardcases of interviewers" seem to give extra points
for the shortest code . I'm C++ not VB, but for C++ for the shortest code consider:
Code:
auto fizzbuzz(size_t i)
{
static array<string, 4> fb {"0", "fizz", "buzz", "fizzbuzz"};
return (string)(itoa(i, (char*)fb.data(), 10) + (!(i % 3) + !(i % 5) * 2) * sizeof(string));
}
int main()
{
for (int i = 1; i < 40; ++i)
cout << fizzbuzz(i) << " ";
}
with a bonus points for using static and having just one non-definition statement.
Last edited by 2kaud; Mar 1st, 2020 at 06:51 AM.
All advice is offered in good faith only. You are ultimately responsible for the effects of your programs and the integrity of the machines they run on. Anything I post, code snippets, advice, etc is licensed as Public Domain https://creativecommons.org/publicdomain/zero/1.0/
C++23 Compiler: Microsoft VS2022 (17.6.5)
-
Mar 1st, 2020, 10:36 AM
#36
Re: How difficult would this job be?
Originally Posted by 2kaud
for the shortest code ...
Code:
auto fizzbuzz(size_t i)
{
static array<string, 4> fb {"0", "fizz", "buzz", "fizzbuzz"};
return (string)(itoa(i, (char*)fb.data(), 10) + (!(i % 3) + !(i % 5) * 2) * sizeof(string));
}
int main()
{
for (int i = 1; i < 40; ++i)
cout << fizzbuzz(i) << " ";
}
Hah, never underestimate the Power of VBs runtime-functions...
The two below are barely used (not widely known) - but they're there ... not sure if still in VB.NET though)
First, the Choose-Function (which basically does the same thing as the above C++ code).
Code:
For i = 1 To 100
Print i & Choose(IIf(i Mod 3, 0, 1) + IIf(i Mod 5, 0, 2), " Fizz", " Buzz", " FizzBuzz")
Next
Next one is the Switch-function (which reads a bit more "straight to the point" IMO):
Code:
For i = 1 To 100
Print i & Switch(i Mod 15=0, " FizzBuzz", i Mod 5=0, " Buzz", i Mod 3=0, " Fizz")
Next
Olaf
-
Mar 1st, 2020, 11:39 AM
#37
Re: How difficult would this job be?
Originally Posted by Schmidt
The two below are barely used (not widely known) - but they're there ... not sure if still in VB.NET though)
Yeah, it's either there, or something essentially the same is there. I've never liked them. Ternary operators and those IIF and If() methods are things that can be quite compact, but you can write some horrible spaghetti with them. I would expect that somebody would come up with a LINQ/Lambda approach that would be a total pain to read, too.
My usual boring signature: Nothing
-
Mar 1st, 2020, 11:56 AM
#38
Re: How difficult would this job be?
Originally Posted by nemaroller
Fairly certain that is him. The domain name on the profile page is mendhak.com which I recall was linked to his flikr account. And it still is!
Good find!
My usual boring signature: Something
-
Mar 1st, 2020, 02:30 PM
#39
Re: How difficult would this job be?
Originally Posted by Shaggy Hiker
I would expect that somebody would come up with a LINQ/Lambda approach that would be a total pain to read, too.
As for "painful to read"...
I'd say that the above given "Switch-Function-based" OneLiner describes the problem in a succinct and nicely readable way...
(can't find anything I'd like to improve there, syntax-wise - once you get the "paired pattern" of "condition, value, condition, value, ...").
Olaf
Posting Permissions
- You may not post new threads
- You may not post replies
- You may not post attachments
- You may not edit your posts
-
Forum Rules
|
Click Here to Expand Forum to Full Width
|