일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
1 | 2 | |||||
3 | 4 | 5 | 6 | 7 | 8 | 9 |
10 | 11 | 12 | 13 | 14 | 15 | 16 |
17 | 18 | 19 | 20 | 21 | 22 | 23 |
24 | 25 | 26 | 27 | 28 | 29 | 30 |
31 |
- Programming
- programming_book
- history
- AI
- Italy
- RFID
- Linux
- essay
- Book
- Book review
- django
- MySQL
- agile
- management
- Java
- hadoop
- leadership
- web
- Python
- comic agile
- Malaysia
- erlang
- Kuala Lumpur
- Software Engineering
- QT
- program
- Artificial Intelligence
- ubuntu
- France
- hbase
- Today
- Total
목록Programming (347)
http://www.careercup.com/question?id=58132 1. Implement memcopy considering the overlap 2. Given a linked list: a->b->c->d.... Write a function to swap the each node pair , such that output will be as follows: b->a->d->c->... void reversePair(Node** p_ppstrHead) { Node* z_pstr1st = *p_ppstrHead; Node* z_pstr2nd = (*p_ppstrHead)->next; Node* z_pstr3rd = z_pstr1st; *p_ppstrHead = z_pstr2nd; while ..
http://www.careercup.com/question?id=58086 Given a function int strcspn(char * source, char * search) code the most efficient way to return the index of first character that matches in the source string. eg# source ="ttbbcca" search ="ggabba" the returned value is 6 since the first match "a" occurs at 6th index in source string. * 실제 strcspn 함수의 동작은 문제와는 다름 size_t strcspn (const char *string, co..
http://doc.trolltech.com/4.4/tutorials-addressbook-part7.html
http://doc.trolltech.com/4.4/tutorials-addressbook-part6.html
http://doc.trolltech.com/4.4/tutorials-addressbook-part5.html
http://doc.trolltech.com/4.4/tutorials-addressbook-part4.html
http://doc.trolltech.com/4.4/tutorials-addressbook-part3.html
http://doc.trolltech.com/4.4/tutorials-addressbook-part2.html
http://doc.trolltech.com/4.4/tutorials-addressbook-part1.html