일당백 [一當百] ::

개발자 구인 메일 - 인도

Computer Engineering/Programming 2007/05/11 21:17

구글 모 그룹으로부터 메일 한통이 도착했다. 확인 해보니 여러 포지션이 오프닝되어서 구인을 하고 있다는 내용이다. 프로페셔널한 테스터, QA, 개발자 등 많이 있지만, 개발자 포지션을 긁어다 놨다.
요즘과 같이 어려운 시기에 이러한 정보라도 공유하고자 공개한다.
(요청한 분에 한하여 담당자 메일 주소를 알려드립니다. 기본적으로 영어로 의사소통하는데 문제가 없어야 하며, 영문 이력서 1부를 깔끔하게 준비해야된다고 생각합니다.)

Job Code: EJD_19 Software Developers - Linux Kernel/Firmware Engineer

Location : Chennai

Job Description :

Candidate should have BSEE/MSEE with 3-8 recent years of relevant experience in development and testing of Embedded Systems development preferably in networking domain

Experience with low level programming with development of Device Drivers, networking protocols * Experience with embedded RTOS(Real Time OS) i.e. Embedded Linux, VxWorks, pSoS or any other RTOS Very good programming skills in C/Unix/Linux, C++ experience are a
plus

Good experience on multi-process, multi-thread programming.
Experience or knowledge of OPEN systems GNU tools, make file, build file, version controls is plus

Experience with networking topologies and devices i.e. Routers, Switches, SAN switches. Ethernet, LAN, WAN etc.

Mandatory Skills: 3 to 8 years of C Programming experience in a Linux;
Kernel; Driver; Layer2; Layer3; TCP/IP; Network Management; Strong
Debugging skills GDB; C Application

Job Code: EJD_29 Cold Fusion Developer

Location : Chennai

Job Description:

1) Minimum 2 to 4 yrs of good, relevant exp in Cold Fusion in IT Industry
2) Experience in Cold Fusion with .NET exposure in IT industry is preferable
3) Excellent Communication & Interpersonal Skills
4) Should be an excellent team player
5) Ability to work under rigid deadlines

Mandatory Skills : Experience in Cold Fusion with .NET exposure in IT industry is preferable

Experience: 2-4YRS

Posted by 피넛

TAG developer, 개발자, 구인

트랙백 0개, 댓글 0개가 달렸습니다

Bitwise Operators

Computer Engineering/Programming 2006/11/08 21:42

The C Programming Language 2nd Edition - 2.9 Bitwise Operators

실무에서 자주 쓰이는 것이 bit 연산이다.
잘 사용하면 1byte만으로 여러가지 일을 할 수 가 있을 것이다.

책에 나온 Exercise 2-6, 2-7 을 소스 코드로 적어봤다.
getbits()는 이미 책에서 예제로 나와 있다.

Exercise 2-6. Write a function setbits(x,p,n,y) that returns x with the n bits that begin at position p set to the rightmost n bits of y, leaving the other bits unchanged.

Exercise 2-7. Write a function invert(x,p,n) that returns x with the n bits that begin at position p inverted (i.e., 1 changed into 0 and vice versa), leaving the others unchanged.

[code]
/* getbits: get n bits from position p */
unsigned int GetBits(unsigned x, int p, int n)
{
/*gets the right-adjusted n bits of integer x starting from position p*/
return (x >> (p-n+1)) & ~(~0 << n);
}

unsigned int SetBits(unsigned x, int p, int n, unsigned y)
{
/*set n bits of integer x starting from position p to the right-most n bits in integer y*/
return (x & ((~0 << (p + 1)) | (~(~0 << (p + 1 - n))))) | ((y & ~(~0 << n)) << (p + 1 - n));
}

unsigned Invert(unsigned x, int p, int n)
{
/*Inverts n bits in x starting from position p*/
unsigned temp = GetBits(x, p, n);
temp = ~temp;
return SetBits(x, p, n, temp);
}
[/code]