Interested to Buy Any Domain ? << Click Here >> for more details...
which is the best site or book for learning C...and i need the content for C..how to get the good programming skills....? can plz suggest me....
- 2 Answers
- 5291 Views
- I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / shrikantauti
I would suggest you to read 'Let Us C' by Yashwant Kanetkar.
It includes all the things required for beginners.
| Is This Answer Correct ? | 8 Yes | 1 No |
Answer / nitish
There are number of books and tutorials to learn C language. I visited a site that have all the materials for all programming languages...
Try these Links :
http://123techbooks.blogspot.com/search/label/C%20BOOKS
http://123techbooks.blogspot.com/2010/12/c-tutorials.html
I think this may give you maximum materials for your Courses..
Thanking You,
Nitish
| Is This Answer Correct ? | 5 Yes | 0 No |
how to make c program without a libary? e.g.#include<stdio.h> libary is not in c progaram.
Is null valid for pointers to functions?
Explain built-in function?
list the no of files created when c source file is compiled
What is a const pointer?
What is the use of sizeof () in c?
where does it flourished?
Here is alphabets : abcdefgh 1) how to reverse. as hgfedcba 2) after reversal, how to group them in a pair hg fe dc ba.
Is c an object oriented programming language?
How would you rename a function in C?
Can you explain what keyboard debouncing is, and where and why we us it? please give some examples
At a shop of marbles, packs of marbles are prepared. Packets are named A, B, C, D, E …….. All packets are kept in a VERTICAL SHELF in random order. Any numbers of packets with these names could be kept in that shelf as in this example: bottom of shelf ---> [AAAJKRDFDEWAAYFYYKK]-----Top of shelf. All these packets are to be loaded on cars. The cars are lined in order, so that the packet could be loaded on them. The cars are also named [A, B, C, D, E,………….]. Each Car will load the packet with the same alphabet. So, for example, car ‘A’ will load all the packets with name ‘A’. Each particular car will come at the loading point only once. The cars will come at the loading point in alphabetical order. So, car ‘B’ will come and take all the packets with name ‘B’ from the shelf, then car ‘C’ will come. No matter how deep in the shelf any packet ‘B’ is, all of the ‘B’ packets will be displaced before the ‘C’ car arrives. For that purpose, some additional shelves are provided. The packets which are after the packet B, are kept in those shelves. Any one of these shelves contains only packets, having the same name. For example, if any particular shelf is used and if a packet with name X is in it, then only the packets having names X will be kept in it. That shelf will look like [XXXXXXX]. If any shelf is used once, then it could be used again only if it is vacant. Packets from the initial shelf could be unloaded from top only. Write a program that finds the minimum total number of shelves, including the initial one required for this loading process.
C 
