C Interview Questions
Questions Answers Views Company eMail

What tq means in chat?

582

Does sprintf put null character?

601

What are the types of pointers?

600

Can a program have two main functions?

572

What does dm mean sexually?

814

Is it cc or c in a letter?

567

Is c easy to learn?

558

What does the c preprocessor do?

621

What is c definition?

745

What does c value mean?

629

What is %d called in c?

761

What happens if header file is included twice?

653

Can a pointer point to null?

589

What are the c keywords?

750

What is clrscr in c?

677


Post New C Questions

Un-Answered Questions { C }

WRITE A CODE IN C TO SEARCH A FILE FROM NOTEPAD FILE.

2028


What is the easiest sorting method to use?

635


How do you redirect a standard stream?

624


Why doesnt long int work?

613


Can you mix old-style and new-style function syntax?

664






What is the modulus operator?

736


Here is a neat trick for checking whether two strings are equal

566


What are the types of functions in c?

572


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.

1732


What is adt in c programming?

611


What is a #include preprocessor?

618


How can I convert a number to a string?

608


When should the const modifier be used?

658


What is keyword with example?

642


What is an endless loop?

804