Interview Questions For All

Cobol Interview Questions Part-11

2008-10-02T01:48:00.000-07:00

151. What are the few advantages of VS COBOL II over OS/VS COBOL?

Ans: The working storage and linkage section limit has been increased. They are 128 megabytes as supposed to 1 megabytes in OS/VS COBOL.

Introduction of ADDRESS special register.

31-bit addressing. In using COBOL on PC we have only flat files and the programs can access only limited storage, whereas in VS COBOL II on M/F the programs can access up to 16MB or 2GB depending on the addressing and can use VSAM files to make I/O operations faster

152. What are the steps you go through while creating a COBOL program executable?

Ans: DB2 pre-compiler (if embedded SQL is used), CICS translator (if CICS program), Cobol compiler, Link editor. If DB2 program, create plan by binding the DBRMs.

153. Name the divisions in a COBOL Program

Ans: Identification / Environment/ Data/ Procedure Divisions

154. What are the different data types available in COBOL?

Ans: Alpha-numeric (X) , Alphabetic (A) and numeric (9).

155. What does the INITIALIZE verb do?

Ans: Alphabetic, Alphanumeric fields & alphanumeric edited items are set to SPACES. Numeric, Numeric edited items set to ZERO. FILLER , OCCURS DEPENDING ON items left untouched

156. What is the difference between a 01 level and 77 levels?

Ans: 01 level can have sublevels from 02 to 49. 77 cannot have sublevel.

157. What are 77 levels used for?

Ans: Elementary level item. Cannot be subdivisions of other items (cannot be qualified), nor can they be subdivided themselves.

158. What is 88 level used for?

Ans: For condition names.

159. What is level 66 used for?

Ans: For RENAMES clause.

160. What does the IS NUMERIC clause establish?

Ans: IS NUMERIC can be used on alphanumeric items, signed numeric & packed decimal items and unsigned numeric & packed decimal items. IS NUMERIC returns TRUE if the item only consists of 0-9. However, if the item being tested is a signed item, then it may contain 0-9, + and - .

161. Is compute w=u a valid statement?

Ans: Yes, it is. It is equivalent to move u to w.

162. In the above example, when will you prefer compute statement over the move statement?

Ans: When significant left-order digits would be lost in execution, the COMPUTE statement can detect the condition and allow you to handle it. The MOVE statement carries out the assignment with destructive truncation. Therefore, if the size error is needs to be detected, COMPUTE will be preferred over MOVE. The ON SIZE ERROR phrase of COMPUTE statement, compiler generates code to detect size-overflow.

163. What happens when the ON SIZE ERROR phrase is specified on a COMPUTE statement?

Ans: If the condition occurs, the code in the ON SIZE ERROR phrase is performed, and the content of the destination field remains unchanged. If the ON SIZE ERROR phrase is not specified, the assignment is carried out with truncation. There is no ON SIZE ERROR support for the MOVE statement.

164. How will you associate your files with external data sets where they physically reside?

Ans: Using SELECT clause, the files can be associated with external data sets. The SELECT clause is defined in the FILE-CONTROL paragraph of Input-Output Section that is coded Environment Division. The File structure is defined by FD entry under File-Section of Data Division for the OS.

165. How will you define your file to the operating system?

Ans: Associate the file with the external data set using SELECT clause of INPUT-OUTPUT SECTION. INPUT-OUTPUT SECTION appears inside the ENVIRONMENT DIVISION.

166. Explain the use of Declaratives in COBOL?

Ans: Declaratives provide special section that are executed when an exceptional condition occurs. They must be grouped together and coded at the beginning of procedure division and the entire procedure division must be divided into sections. The Declaratives start with a USE statement. The entire group of declaratives is preceded by DECLARIVES and followed by END DECLARITIVES in area A. The three types of declaratives are Exception (when error occurs during file handling), Debugging (to debug lines with 'D' coded in w-s section) and Label (for EOF or beginning...) declaratives.

167. How do you define a table/array in COBOL?

Ans:

01 ARRAYS.

05 ARRAY1 PIC X(9) OCCURS 10 TIMES.

05 ARRAY2 PIC X(6) OCCURS 20 TIMES INDEXED BY WS-INDEX.

168. Can the OCCURS clause be at the 01 level?

Ans: No

169. A statically bound subprogram is called twice. What happens to working-storage variables?

Ans:The working-storage section is allocated at the start of the run-unit and any data items with VALUE clauses are initialized to the appropriate value at the time. When the subprogram is called the second time, a working-storage items persist in their last used state. However, if the program is specified with INITIAL on the PROGRAM-ID, working-storage section is reinitialized each time the program is entered.

170. Significance of the COMMON Attribute ?

Ans:COMMON attribute is used with nested COBOL programs. If it is not specified, other nested programs will not be able to access the program. PROGRAM-ID. Pgmname is COMMON PROGRAM.

171. In which division and section, the Special-names paragraph appears?

Ans: Environment division and Configuration Section.

172. What is the LOCAL-STORAGE SECTION?

Ans:Local-Storage is allocated each time the program is called and is de-allocated when the program returns via an EXIT PROGRAM, GOBACK, or STOP RUN. Any data items with a VALUE clauses are initialized to the appropriate value each time the program is called. The value in the data items is lost when the program returns. It is defined in the DATA DIVISION after WORKING-STORAGE SECTION

173. What does passing BY REFERENCE mean?

Ans:When the data is passed between programs, the subprogram refers to and processes the data items in the calling program's storage, rather than working on a copy of the data. When

CALL . . . BY REFERENCE identifier. In this case, the caller and the called share the same memory.

174. What does passing BY CONTENT mean?

Ans:The calling program passes only the contents of the literal, or identifier. With a CALL . . . BY CONTENT, the called program cannot change the value of the literal or identifier in the calling program, even if it modifies the variable in which it received the literal or identifier.

175. What does passing BY VALUE mean?

Ans:The calling program or method is passing the value of the literal, or identifier, not a reference to the sending data item. The called program or invoked method can change the parameter in the called program or invoked method. However, because the subprogram or method has access only to a temporary copy of the sending data item, those changes do not affect the argument in the calling program. Use By value, If you want to pass data to C program. Parameters must be of certain data type.

176. What is the default, passing BY REFERENCE or passing BY CONTENT or passing BY VALUE?

Ans: Passing by reference (the caller and the called share the same memory).

177. Where do you define your data in a program if the data is passed to the program from a Caller program?

Ans: Linkage Section

Core Java Interview Questions Part-7

2008-10-02T01:47:00.000-07:00

91 Q What is java byte code?

Byte code is an sort of intermediate code. The byte code is processed by virtual machine.

92 Q What is method overloading?

Method overloading is the process of creating a new method with the same name and different signature.

93 Q What is method overriding?

Method overriding is the process of giving a new definition for an existing method in its child class.

94 Q What is finalize() ?

Finalize is a protected method in java. When the garbage collector is executes , it will first call finalize( ), and on the next garbage-collection it reclaim the objects memory. So finalize( ), gives you the chance to perform some cleanup operation at the time of garbage collection.

95 Q What is multi-threading?

Multi-threading is the scenario where more than one threads are running.

96 Q What is deadlock?

Deadlock is a situation when two threads are waiting on each other to release a resource. Each thread waiting for a resource which is held by the other waiting thread.

97 Q What is the difference between Iterator and Enumeration?

Iterator differ from enumeration in two ways Iterator allow the caller to remove elements from the underlying collection during the iteration with well-defined semantics. And , method names have been improved.

98 Q What is the Locale class?

A Locale object represents a specific geographical, political, or cultural region

99 Q What is internationalization?

Internationalization is the process of designing an application so that it can be adapted to various languages and regions without changes.

100 Q What is anonymous class ?

A An anonymous class is a type of inner class that don't have any name.

101 Q What is the difference between URL and URLConnection?

A URL represents the location of a resource, and a URLConnection represents a link for accessing or communicating with the resource at the location.

102 Q What are the two important TCP Socket classes?

ServerSocket and Socket. ServerSocket is useful for two-way socket communication. Socket class help us to read and write through the sockets. getInputStream() and getOutputStream() are the two methods available in Socket class.

103 Q Strings are immutable. But String s="Hello"; String s1=s+"World" returns HelloWorld how ?

Here actually a new object is created with the value of HelloWorld

104 Q What is classpath?

Classpath is the path where Java looks for loading class at run time and compile time.

105 Q What is path?

It is an the location where the OS will look for finding out the executable files and commands.

106 Q What is java collections?

Java collections is a set of classes, that allows operations on a collection of classes.

107 Q Can we compile a java program without main?

Yes, we can. In order to compile a java program, we don't require any main method. But to execute a java program we must have a main in it (unless it is an applet or servlet). Because main is the starting point of a java program.

108 Q What is a java compilation unit.

A compilation unit is a java source file.

109 What are the restrictions when overriding a method ?

Overridden methods must have the same name, argument list, and return type (i.e., they must have the exact signature of the method we are going to override, including return type.) The overriding method cannot be less visible than the method it overrides( i.e., a public method cannot be override to private). The overriding method may not throw any exceptions that may not be thrown by the overridden method

110 Q What is static initializer block? What is its use?

A static initializer block is a block of code that declares with the static keyword. It normally contains the block of code that must execute at the time of class loading. The static initializer block will execute only once at the time of loading the class only.

Core Java Interview Questions Part-8

2008-10-02T01:43:00.000-07:00

111 Q How does a try statement determine which catch clause should be used to handle an exception?

When an exception is thrown , the catch block of the try statement are examined in the order in which they appear. The first catch block that is capable of handling the exception is executed. The remaining catch blocks are ignored

112 Q How parameters are passed to methods in java program ?

All java method parameters in java are passed by value only. Obviously primitives are passed by value. In case of objects a copy of the reference is passed and so all the changes made in the method will persist.

113 Q If a class doesn't have any constructors, what will happen?

If a class doesn't have a constructor, the JVM will provide a default constructor for the class.

114 Q What will happen if a thread cannot acquire a lock on an object?

It enters to the waiting state until lock becomes available.

115 Q How does multithreading occurring on a computer with a single CPU?

The task scheduler of OS allocates an execution time for multiple tasks. By switching between different executing tasks, it creates the impression that tasks execute sequentially. But actually there is only one task is executed at a time.

116 Q What will happen if you are invoking a thread's interrupt method while the thread is waiting or sleeping?

When the task enters to the running state, it will throw an InterruptedException.

117 Q What are the different ways in which a thread can enter into waiting state?

There are three ways for a thread to enter into waiting state. By invoking its sleep() method, by blocking on I/O, by unsuccessfully attempting to acquire an object's lock, or by invoking an object's wait() method.

118 Q What are the the different ways for creating a thread?

A thread can be created by subclassing Thread, or by implementing the Runnable interface.

119 Q What is the difference between creating a thread by extending Thread class and by implementing Runnable interface? Which one should prefer?

When creating a thread by extending the Thread class, it is not mandatory to override the run method (If we are not overriding the run method , it is useless), because Thread class have already given a default implementation for run method. But if we are implementing Runnable , it is mandatory to override the run method. The preferred way to create a thread is by implementing Runnable interface, because it give loose coupling.

120 Q What is coupling?

Coupling is the dependency between different components of a system

121 Q How is an interface?

An interface is a collection of method declarations and constants. In java interfaces are used to achieve multiple inheritance. It sets a behavioral protocol to all implementing classes.

122 Q What is an abstract class?

An abstract class is an incomplete class. An abstract class is defined with the keyword abstract . We cannot create an object of the abstract class because it is not complete. It sets a behavioral protocol for all its child classes.

123 Q How will you define an interface?

An interface is defined with the keyword interface. Eg:
public interface MyInterface { }

124 Q How will you define an abstract class?

An abstract class is defined with the keyword abstract Eg:
public abstract class MyClass { }

125 Q What is any an anonymous class?

A An anonymous class is a local class with no name.

126 Q What is a JVM heap?

The heap is the runtime data area from which memory for all class instances and arrays is allocated. The heap may be of a fixed size or may be expanded. The heap is created on virtual machine start-up.

127 Q What is difference between string and StringTokenizer?

StringTokenizer as its name suggests tokenizes a String supplied to it as an argument to its constructor and the character based on which tokens of that string are to be made. The default tokenizing character is space " ".

128 Q What is the difference between array and ArrayList ?

Array is collection of same data type. Array size is fixed, It cannot be expanded. But ArrayList is a growable collection of objects. ArrayList is a part of Collections Framework and can work with only objects.

129 Q What is difference between java.lang .Class and java.lang.ClassLoader? What is the hierarchy of ClassLoader ?

Class 'java.lang.Class' represent classes and interfaces in a running Java application. JVM construct 'Class' object when class in loaded. Where as a ClassLoader is also a class which loads the class files into memory in order for the Java programs to execute properly. The hierarchy of ClassLoaders is:

Bootstrap ClassLoaders
Extensive ClassLoaders
System Classpath ClassLoaders
Application ClassLoaders

130 Q What is daemon thread?

Theards which are running on the background are called deamon threads. daemon thread is a thread which doesn't give any chance to run other threads once it enters into the run state it doesn't give any chance to run other threads. Normally it will run forever, but when all other non-daemon threads are dead, daemon thread will be killed by JVM

131 Q What is a green thread?

Native threads can switch between threads preemptively. Green threads switch only when control is explicitly given up by a thread ( Thread.yield(), Object.wait(), etc.) or a thread performs a blocking operation (read(), etc.). On multi-CPU machines, native threads can run more than one thread simultaneously by assigning different threads to different CPUs. Green threads run on only one CPU. Native threads create the appearance that many Java processes are running: each thread takes up its own entry in the process table. One clue that these are all threads of the same process is that the memory size is identical for all the threads - they are all using the same memory. The process table is not infinitely large, and processes can only create a limited number of threads before running out of system resources or hitting configured limits.

TANCET entrance exam 2008 Syllabus online Interview question

2008-08-15T07:06:00.000-07:00

Analytical Written Whole Testpaper for Intergraph India.
Total 20 Questions - time limit 20 minutes

1. complete the diagram :
four fig will be given , you have to draw the final one

triangle fig :

2. draw venn diagram relating rhombus, quadrilateral & polygon

3.in a group of 5 persons a,b,c,d,e one of the person is advogate, one is doctor, one businesss man, one shop keeper and one is professor. three of them a,c,and professor prefer playing cricket to foot ball and two of them b and businessman prefer playing foot ball to cricket. the shop keeper and b and a are friends but two of these prefer playing foot ball to cricket. the advogate is c's brother and both play same game . the doctor and e play cricket.

(a) who is advogate ?
a, b, c, d
(b) who is shop keeper ?
a, b, c, d
(c) which of the following group include persons who like playing cricket
but doesn't include professor ?
ab,bc,cd, none
(d) who is doctor ?
a,b,c,d.

{ same model problem is asked in question paper but professions can be different such as horticulturist, physicst, journalist, advocate and other one. Instead of football and cricket they can give tea and coffee }

4. they will give some condition's and asked to find out farthest city in the west (easy one )?

5. travelling sales man problem. some condition will be given we have to find out the order of station the sales man moves
( three Questions )

6. +,-,*, /, will be given different meaning
example : take + as * and so on .
they will give expression and we have to find the value of that.

7. 3+5-2 =4
which has to be interchange to get the result ?

8. we don't no exact problem .
ex : 8a3b5c7d.....
a wiil be given + sign.
b will be given - sign.
find the value of expression ?

9. find the total number of squares in 1/4 of chess board ?
Too easy.

10. 6 face of a cube are painted in a manner ,no 2 adjacent face have same colour. three colurs used are red blue green. cube is cut in to 36 smaller cube in such a manner that 32 cubes are of one size and rest of them bigger size and each bigger side have no red side. following this
three ques will be asked . { in ques paper colors will be different }

11. two ladies ,two men sit in north east west south position of rectancular table. using clues identify their position ?

TANCET entrance exam 2008 Syllabus online ..... Interview question

2008-08-12T23:06:00.000-07:00

SYLLABUS FOR ENTRANCE TEST & EVALUATION SCHEME FOR MBA DEGREE PROGRAMME (Regular & Self-supporting)

The Question paper will have 5 parts with the following topics:

TANCET 2008 PART 1. To evaluate the candidate's ability to pick out critically the data and apply the data to business decisions from given typical business situations.

TANCET 2008 PART 2. To evaluate the skill of the candidate in answering questions based on the passages in the comprehension.

TANCET 2008 PART 3. To evaluate the skill on solving mathematical problems of graduate level including those learnt in plus two or equivalent level.

TANCET 2008 PART 4. To test on determining data sufficiency for answering certain questions using data given plus the knowledge of Mathematics and use of day - to - day facts.

TANCET 2008 PART 5. To test the knowledge on written English with questions on errors in usage, grammar, punctuation and the like.

Candidates are required to answer 100 objective type questions in 2 hours. Each question will be followed by five alternate answers. The candidate has to choose the correct answer and shade the appropriate circle against the question in the answer sheet with pencil/ball point pen (black or blue).

TANCET 2008 SYLLABUS FOR ENTRANCE TEST FOR MCA DEGREE PROGRAMME (Regular & Self-supporting)

The Question Paper will be designed to test the capability of the candidates in the following areas:

i) Quantitative Ability (ii) Analytical reasoning iii) Logical reasoning (iv) Computer awareness

There may also be few questions on verbal activity, basic science etc.

The Question Paper will have 100 objective type questions. Each question will be followed by four alternate answers. The Candidate has to choose the correct answer and shade the appropriate circle against the question in the answer sheet with pencil/ ball point pen (black or blue).

ENTRANCE TEST SYLLABUS FOR M.E./M.Tech./M.Arch./M.Plan.- Non-Gate Degree Programmes (Regular & Self- Supporting):

The following are the topics of the syllabus for the various parts. The questions will be set at the corresponding degree level.

Part 1 - Mathematics (Common to all Candidates)

(i) Vector calculus (ii) Determinants and Matrics (iii) Analytic function theory (iv) Calculus and ordinary Differential Equations (v) Numerical Methods (vi) Probability and Statistics.

Part 2 - Basic Engg. and Sciences (Common to all Candidates)

(i) Fundamental of Applied Mech. (ii) Fundamentals of Material Science (iii) Basic Civil Engg. (iv) Basic Electrical Engg. (v) Basic Mechanical Engg. (vi) Fundamentals of Computers (vii) Fundamentals of Mathematics (viii) Fundamentals of Physics (ix) Fundamentals of Chemistry.

Part 3 - Civil Engg. & Geo. Informatics

(i) Mechanics of Solids and Structural Analysis (ii) Concrete and Steel Structure (iii) Soil Mechanics and Geo Technical Engineering (iv) Fluid Mechanics and Water Resources Engineering (v) Environmental Engineering (vi) Surveying (vii) Transportation Engineering (viii) Remote Sensing (ix) Geographic Information Systems (GIS).

Part 4 - Mechanical, Automobile and Aeronautical Engineering

(i) Mechanics and Machine Design (ii) Material Science and Metallurgy (iii) Thermo dynamics (iv) Refrigeration and Air Conditioning (v) Production Technology (vi) Automotive Engines (vii) Automotive Transmission (viii) Aerodynamics (ix) Aerospace Propulsion. (x) Strength of Materials

Part 5 - Electrical, Electronics & Communication, Instrumentation and Avionics

(i) Circuit Theory (ii) DC & AC Machines (iii) Control Systems (iv) Communication Systems (v) Power Electronics (vi) Network Analysis (vii) Microprocessors, Computer Applications (viii) Transducers and Instrumentation (ix) Avionics

Part 6 - Earth Sciences

(i) Physical Geology and Geo Morphology (ii) Petrology (iii) Structural Geology (iv) Economic Geology (v) Geo Physics and Engineering Geology (vi) Remote Sensing (vii) Hydro Geology.

Part 7 - Production and Industrial Engineering

(i) Casting, metal forming and metal joining processes (ii) Tool Engineering, Machine tool operation, Metrology and inspection (iii) Engineering Materials, Processing of Plastics and Computer Aided Manufacturing (iv) Product Design, Process Planning, Cost Estimate, Design of Jigs and Fixtures and Press Tools (v) Operations Research (vi) Operations Management (vii) Quality Control Reliability and Maintenance.

Part 8 - Computer Science and Engineering

(i) Discrete Mathematical Structures, Formal Language and Automatia (ii) Micro Processor and Hardware Systems (iii) Computer Organization and Architecture (iv) System Programming including Assemblers, Compilers and Operating Systems (v) Programming Methodology, Data Structures and Algorithms including A1 Algorithm (vi) Database Systems (vii) Computer Networks.

Part 9 - Chemistry, Chemical Engg. & Ceramic Tech.

(i) Thermo dynamics and Kinetics (ii) Heat and Mass Transfer (iii) Fluid Flow (iv) Chemical Process Industries (v) IR, NMR and Mass Spectrometry (vi) Polymer Chemistry and Polymerisation Processes (vii) Fine Ceramics (viii) Glass & Cement (ix) Refractory Materials.(x) Organic reactions (xi) Electro Chemistry.

Part 10 - Textile Technology

Textile Fibers - Production and Properties (ii) Spinning (iii) Fabric Production (iv) Textile Physics (v) Chemical Processing of Textile Materials (vi) Process and Quality Control in Textile Materials.

Part 11 - Leather Technology

(i) Chemistry of Proteins - Collagen and keratin (ii) Principles of various pre-tanning, tanning and post-tanning finishing operations (iii) Technologies aspects of various leather manufacture (iv) Environmental & Management in Leather Industries - Animal and Tannery by-products Utilisation (v) Leather Machinery (vi) Analysis and Testing of Materials used in Leather Processing as well as Leather (vii) Designing and Construction of Footwear and Leather Goods.

Part 12 - Architecture

Building Materials, Building Construction and Technology, History of Architecture, Principles of Architecture, Building Services, Housing, Urban Design and Renewal, Town Planning, Landscape Architecture, Climatology.

Part 13 - Physics and Material Science

(i) Crystal Physics (ii) Electricity and Magnetism (iii) Optics and Quantum Mechanics (iv) Modern Physics (v) Mechanical and Electronic Properties of Materials (vi) Chemical and Thermal properties of materials (vii) Traditional and advanced ceramics.

Part 14 - Applied Probabilities and Statistics

(i) Probability - Introductory ideas (ii) Measures of central tendency and Dispersion (iii) Random variable (one and dimensional) (iv) Standard Probability distributions (v) Sampling and sampling distribution, Estimation (vi) Regression and Correlation analysis (vii) Time series.

Part 15 - Social Sciences

Settlement Geography, Economic Geography, Industrial locations, Regional Planning, Information Systems, Urban Sociology, Community Development, Social Development and Change, Public Participation, Rural Development, Agglomeration Economics, Economic base of settlements, Development Economics and Planning, Land Economics and Industrialization Policy.

Also see whole TANCET 2008 admission, form, entrance exam dates prospectus online information

HP Placement Paper Questions ..... Interview question

2008-08-12T23:02:00.000-07:00

HP PLACEMENT PAPER
Paper PART- 1 –> 40 questions (Fundamental computer Concepts, includes OS,N/w , protocols)
Paper PART-2 –> 20 questions (Purely C )
Paper PART-3 –> 20 questions (Analytical)
Question : What is not a part of OS ?
O : swapper,compiler,device driver,file system.
A : compiler.
Q : what is the condition called when the CPU is busy swapping in and out pages of memory without doing any useful work ?
O : Dining philosopher’s problem,thrashing,racearound,option d
A: thrashing.
Q : How are the pages got into main memory from secondary memory?
DMA, Interrupts,option3, option 4
A : as far as i know its Interrupts –by raising a page fault exception.
Q : What is the use of Indexing ?
O : fast linear access, fast random access, sorting of records , option 4
A : find out….
Q : in terms of both space and time which sorting is effecient.(The question isrephrased .)
O : merge sort, bubble sort, quick sort, option 4
A : find out
which case statement will be executed in the following code ?
main()
{ int i =1; switch(i)
{ i++; case 1 : printf (”"); break;
ase 2 : printf(”"); break;efault : printf(”"); break;
Answer : Case1 will only be executed.
Q : In the given structure how do you initialize the day feild?
struct time {
char * day ;
int * mon ;
int * year ;
} * times;
Options : *(times).day, *(times->day), *times->*day.
Answer : *(times->day) — after the execution of this statement compiler generates
error.i didn’t understand why.can anybody explain.
Q: The char has 1 byte boundary , short has 2 byte boundary, int has 4 byte boundary.
what is the total no: of bytes consumed by the following structure:
struct st {char a ; char b; short c ; int z[2] ; char d ; short f; int q ;a

SBI Clerical Exam Current Affairs test Question Paper ..... Interview question

2008-08-12T03:00:00.000-07:00

. WHO IS THE PRESENT CHAIRMAN OF CII ?

ANS- K.V.KAMATHI

2. WHAT IS THE FULLFORM OF “BRIC” ?

ANS- BRAZIL,RUSSIA ,INDIA,CHINA

Completely detailed SBI Clerical Exam Question Paper / Job Placement Paper of State Bank Of India new job posts 2008. Fully detailed Current Affairs Test Paper Booklet latest with answer keys.

3. WHICH FILM HAS BAGGED THE BEST MOVIE AWARDS IN IIFA AWARDS WHICH WAS HELD IN BANGKOK ?

ANS- CHAK DE INDIA (YASH CHOPRA)

4. WHO IS THE WINNER OF FRENCH OPEN 2008 MEN’S TITLE ?

ANS- RAFAEL NADAL

5. WHO IS THE WINNER OF DLF IPL CRICKET TOUNAMENT 2008 ?

ANS- RAJASTHAN ROYALS

6. NATIONAL HUMAN RIGHTS COMMISSION CHAIRMAN?

ANS- JUSTICE RAJENDRA BABU

7. WHO IS THE INDIAN HOCKEY COACH ?

ANS- JOKIM KARVALO

8. WHICH FILM HAS BAGGED THE BEST FILM OF GOLDEN PALM AWARD IN CANNES FILM FESTIVAL 2008 ?

ANS- ENTRE LES MURS (THE CLASS)

9. WHO IS THE winner of IIFA Best Actor award 2008 ?

ANS- SHAHRUKH KHAN (CHAK DE INDIA)

10.WHO IS THE CHIEF OF INDIAN AIR FORCE ?

ANS- FALI HOMI MAJOR

11.WHO IS THE MISS UNIVERSE INDIA 2008 ?

ANS- SIMARAN KAUR MUNDI

12.WHO IS THE Miss INDIA WORLD 2008

ANS- PARVATHY OMNAKUTTAN

13.VENUE OF 15TH SAARC SUMMIT 2008?

ANS- COLOMBO (SRI LANKA)

14.WHO GOT DADA SAHEB PHALKE RATNA AWARD 2008?

ANS- B.R.CHOPRA

15.WHO IS THE WINNER OF WORLD CUP CRICKET 2007 ?

ANS- AUSTRALIA

16.WHO IS THE WORLD CUP CRICKET 2007 RUNNER UP ?

ANS- SRI LANKA

17.WHO IS THE WINNER OF FRENCH OPEN 2008 WOMENS TITLE ?

ANS- Ana Ivanovic

18.WHO COMPLETED 16000 RUNS IN ODI RECENTLY ?

ANS- SACHIN TENDULKAR

19.WHO IS THE PRESIDENT OF RUSSIA ?

ANS-DMITRI MEDWEDEV

20.WHO IS THE PRIME MINISTER OF RUSSIA ?

ANS- VLADIMIR PUTIN

21.WHO IS THE WORLD BANK PRESIDENT ?

ANS- ROBERT ZOELLICK

22.INDIA HAS SUCCESSFULLY TEST FIRED AGNI III IN THE MONTH OF MAY 2008. WHICH TYPE OF MISSILE BELONGS TO AGNI III -

ANS - SURFACE TO SURFACE INTERMEDIATE RANGE BALLISTIC MISSILE

Download free online SBI Clerical Exam Job Test Question Paper with answers and solutions. Also see SBI Officers exam question paper. See various HR and technical job interview questions free for top IT companies and Banks here.

SBI Clerical Exam Paper Pattern Latest ..... Interview question

2008-08-12T02:59:00.001-07:00

State Bank Of India Clerical Appointment test / Employment exam question paper Latest Pattern:
State bank of india is recruiting clerks about 20000 in number. The placement paper / job test paper pattern is given below for every subject. The number of questions for every subject / topic are given. The pattern is according to State bank of india sbi latest specifications.

General Awareness - 40 questions - 40 marks
English Language - 40 questions - 40 marks
Quantitative Aptitude - 40 questions - 40 marks
Reasoning Ability - 40 questions - 40 marks
Marketing Aptitude / Computer Knowledge - 40 questions - 40 marks
Total are 200 questions and 200 marks

Note: In this time psychometry is not included in examination. See free online SBI Clerical Jobs exam / Test Question Paper with answers and free solutions. Also Downlaod free SBI Officers exam question paper. See various HR and technical job interview questions free for top IT companies and Banks here.

State bank of india placement test paper questions: ..... Interview question

2008-08-12T02:58:00.000-07:00

SBI General Knowledge Placement Test Paper questions / recruitment test exam questions booklet with answer keys for State Bank of India free

1. The Kishenganga Power Project is in-
A. Orissa
B. Maharashtra
C. Gujarat
D. Jammu & Kashmir
Ans (D)

2. The late Nirmala Desh Pande was a famous
A. diplomat
B. astrologer
C. Social activist
D. film-star
Ans (C)

3. Who has been awarded the Prem Bhatia Award for the year 2008 ?
A. Nilanjana Bose
B. Rupashree Nanda
C. Nirupama Subramanian
D. None of these
Ans (C)

4. Microwave ovens cook dishes by means of
A. Ultraviolet rays
B. Infra-red rays
C. Convection
D. Conduction
Ans (D)

5. Most of the phenomena related to weather take place in
A. stratosphere
B. ionosphere
C. mesosphere
D. troposphere
Ans (D)

6. The current President of the World Bank is
A. Dominique Strauss-Kahn
B. James D. Wolfansen
C. Barbara Cartland
D. Robert Zoellick
Ans (D)

7. Amartya Sen, the NRI Nobel laureate got the honour for his work on
A. Game theory
B. Securities analysis
C. Poverty and famines
D.Impact of Industrialization
Ans (C)

8. The Quit India resolution was passed at the
A. Bombay session of I.N.C. in 1940
B. Bombay session of I.N.C. in 1941
C. Bombay session of I.N.C. in 1942
D. Bombay session of I.N.C. in 1945.
Ans (C)

9. Who among the following is not a ghazal singer?
A. Talat Aziz
B. Chandan Dass
C. Peenaz Masani
D. Jagdev Singh
Ans (D)

10. Nobel Prize for literature in 2007 was received by-
A. Doris Lessing
B. Albert Al Gore
C. Mohammad Yunus
D. None of these
Ans (A)

11. Meteorites are the heavenly bodies
A. between the Mars and the Jupiter
B. between the Saturn and the Neptune
C. between the Mars and the Venus
D. that burn brightly on entering the Earth’s atmosphere
Ans (D)

12. P-5 is a group of
A. highly developed countries
B. Highly populous countries
C. Permanent members of the Security Council
D. Established nuclear powers
Ans (C)

13. Arrange the following in chronological order:
a. Dandi March
b. McDonald Award
c. Hanging of Bhagat Singh
d. Meerut conspiracy case
A. a, b, c, d
B. b, a, c, d
C. d, c, a, b,
D. d, a, c, b
Ans (A)

14. Which of the following is a land-locked state?
A. Gujarat
B. Andhra Pradesh
C. Madhya Pradesh
D. Tamil Nadu
Ans (C)

15. Which of the following is not an official language as per the 8th schedule?
A. Konkani
B. Sindhi
C. Manipuri
D. English
Ans (D)

16. Which of the following used in making computer chips ?
A. Carbon
B. Uranium
C. Silicon
D. Rubidium
Ans (C)

17. In order to see an undersea object while in a ship, you would make use of a
A. telescope
B. periscope
C. marinoscope
D None of these
Ans (B)

18. Baan Ki-moon , the UNO Secretary-General belong to
A. Saudi Arab
B. Egypt
C. South Korea
D. Brazil
Ans (C)

19. The deepest ocean in the world is
A. The Indian ocean
B. The Atlantic ocean
C. The Pacific ocean
D. None of these
Ans (C)

20. The oldest mutual fund in India is the
A. SBI Mutual Fund
B. BOB Mutual Fund
C. PNB Mutual Fund
D. Unit Trust of India
Ans (D)

21. A candidate for elections to the Lok Sabha stands to lose his Deposit Money if he fails to get
A. 1/5 of the total valid votes
B. 1/8 of the valid votes
C. 1/6 of the valid votes polled
D. none of these
Ans (A)

22. The Varanasi–Kanyakumari National Highway is called
A. N.H. – 8
B. N. H. – 7
C. N.H. – 12
D. N.H. – 9
Ans (B)

23. Which of the following areas of output is witnessing a new revolution?
A. oilseeds
B. fisheries
C. fruits
D. cereals
Ans (A)

24. The W.T.O. came into being on
A. 1st April, 1995
B. 1st April, 1994
C. 1st Jan., 1995
D. 1st Jan., 1996
Ans (C)

25. Bangal was partitioned during the viceroyalty of
A. Lord Rippon
B. Lord Curzon
C. Lord Hardinge
D. Lord Minto
Ans (B)

26. Tata purchased Jaguar and Rover from-
A. Hyundai
B. Maruti-Suzuki
C. Ford Motor
D. General Motor
Ans (C)

See more State Bank of India Questions and answers from job placement test question paper / SBI exam paper free. Download free SBI Clerical Exam papers and Latest SBI Officers recruitment exam test paper questions as these are given free online here.

Capgemini India Placement Test Whole Question Paper ..... Interview question

2008-08-12T02:56:00.000-07:00

Capgemini Paper on 14th may held at kolkata, West Bengal
Time: 60 minutes
Set 2
Section A

Questions: (aptitude, technical and other questions)
1. Find min value of fn:
-5-x + 2-x+6-x+10-x; where x is an integer
0/17/23/19
2. units digit in expansion os 2 raised to 51 is:
2/4/6/8
3. 2 men at same tym start walking towards each other from A n B 72 kms apart. sp of A is 4kmph.Sp of B is 2 kmph in 1st hr,2.5 in 2nd, 3 in rd. n so on…when will they meet
i in 7 hrs
ii at 35 kms from A
iii in 10 hrs
iv midway

4. (8*76+19*?-60) / (?*7*12+3-52)=1
5/2/1/3

5. 45 grinders brought @ 2215/-.transpot expense 2190/-.2760/- on octroi . Find SP/piece to make profit of 20%
2585/2225/2670/3325

6. in a 2 digit no unit’s place is halved and tens place is doubled.diff bet the nos is 37.digit in unit’s place is 2 more than tens place.
24/46/42/none

7. if x-y + z = 19 , y + z =20 , x-z=3 , find d value of x+4y-5z
22/38/17/none

8. Find approx value of 39.987/0.8102+1.987*18.02
72/56/86/44

9. If the ratio of prod of 3 diff comp’s A B & C is 4:7:5 and of overall prod last yr was 4lac tones and if each comp had an increase of 20% in prod level this yr what is the prod of Comp B this yr?
2.1L/22.1L/4.1L/none

10. If 70% of a no. is subtracted from itself it reduces to 81.what is two fifth of that no.?
108/54/210/none

11. If a certain sum of money at SI doubles itself in 5 yrs then what is d rate?
5%/20%/25%/14.8%

12. If radius of cylinder and sphere r same and vol of sphere and cylinder r same what is d ratio betn the radius and height of the cylinder
i. R= H
ii. R= (3/4)H
iii. R = (4/3)H
iv. R=2/3H

13. Which one of the foll fractions is arranged in ascending order
i. 9/11,7/9,11/13,13/14
ii 7/8,9/11,11/13,13/14
iii 9/11,11/13,7/8,13/14
iv none
14. A is 4 yrs old and B is thrice A>when A is 12 yrs, how old will B be?
16/20/24/28
15. Boat goes downstream from P to Q in 2hrs, upstream in 6hrs and if speed of stream was ½ of boat in still water. Find dist PQ
6/4/10/none
16. Fresh Grapes contain 90% water by wt. Dried grapes contain 20% water by %age. What will b wt of dried grapes when we begin with 20 kg fresh grapes?
2kg / 2.4kg / 2.5kg /none
17. How many 5 digit no. can b formed wit digits 1, 2, 3,4,5,6 which r divisible by 4 and digits not repeated
144 / 168 / 192 / none
18. Asish was given Rs. 158 in denominations of Rs 1 each. He distributes these in diff bags, such that ne sum of money of denomination betn 1 and 158 can be given in bags. The min no. of such bags reqd
10 / 17 / 15 / none
19.There is a rectangular Garden whose length and width are 60m X 20m.There is a walkway of uniform width around garden. Area of walkway is 516m^2. Find width of walkway
1/2/3/4
20. In a race from pt. X to pt Y and back, Jack averages 0 miles/hr to pt Y and 10 miles/hr back to pr X.Sandy averages 20 miles/hr in both directions. If Jack and Sandy start race at same tym, who’ll finish 1st
Jack/Sandy/they tie/Impossible to tell
21. A man engaged a servant on a condn that he’ll pay Rs 90 and also give him a bag at the end of the yr. He served for 9 months and was given a turban and Rs 65. So the price of turban is
i. Rs 10 / 19 / 0 / 55
22. Three wheels make 36, 24, 60 rev/min. Each has a black mark on it. It is aligned at the start of the qn. When does it align again for the first tym?
14/20/22/5 sec

23. If 1= (3/4)(1+ (y/x) ) then
i. x=3y
ii. x=y/3
iii. x=(2/3)y
iv. none
24. The sum of six consecutive odd nos. is 888. What is the average of the nos.?
i. 147
ii. 148
iii. 149
iv. 146
25. 1010/104*102=10?
i. 8
ii. 6
iii. 4
iv. none

Capgemini Placement Paper Section B
Direction for Qn 1-8

Ans A using I only
Ans B using II only
Ans C using both I and II
Ans D not solvable

Raman and Gaurav Brought eggs from a vendor. How many eggs were bought by each of them
i. Raman bought half as many as Gaurav
ii. The dealer had a stock of 500 eggs at the beginning of day
What is the age of Ramprakash?
i. Ramprakash was born when his father was 26 yrs old
ii. Ramprakash’s mothers age is 3yrs less than his father’s
How much time is reqd for downloading the software?
i. The Data transfer rate is 6 kbps
ii. The size of the software is 4.5 megabytes
Sanjay and Vijay started their journey from Mumbai to Pune. Who reached Pune first?
i. Sanjay overtakes two times Vijay and Vijay overtakes Sanjay two times
ii. Sanjay started first
Is the GDP of country X higher than Country Y?
i. GDP’s of X and Y has been increasing at a compounded annual growth rate of 5% and 6% over he past 5 yrs
ii. 5 yrs ago GDP of X was 1.2 times Y
A boat can ferry 1500 passengers across a river in 12 hrs. How many round trips does it make during the journey?
i. The boat can carry 400 passengers at a time
ii. During its journey, the boat takes 40 mins time each way and 20 mins waiting time at each end.
What are the values of m and n?
i. n is an even integer, m is odd integer and m is greater than n.
ii. The product of m and n is 30
How much is the weight of 20 mangoes and 30 oranges?
i. 1 orange weighs twice that of 1 mango
ii. 2 mangoes and 3 oranges weigh 2 kg

Direction for Qn 9-12
Five teams participated in Pepsi Cup. Each team played against each other. The top teams played finals. A win fetched 2 pts and a tie 1 point

1) South Africa were in the finals
2) India defeated SA but failed to reach the finals
3) Australia lost only one match in the tournament
4) The match between India and Sri Lanka was a tie
5) The undefeated team in the league matches lost in the finals
6) England was one of the best teams that did not qualify

Who were the finalists?
i. SA & India
ii. Aus & SL
iii. SA & SL
iv. none
Who won the finals?
i. Aus
ii. SL
iii. SA
iv. Can’t be determined
How many matches did India Win?
i. 0
ii. 1
iii. 2
iv. can’t be determined
What was the outcome of the India England Match
i. India won
ii. England won
iii. It was a tie
iv. Can’t be determined

Direction for Qn 13-14
These qns are based on situations given below:
7 Uni crick players are to be honored at a special luncheon. The players will be seated on a dais along one side of a single rectangular table.
A and G have to leave the luncheon early and must be seated at the extreme right end of table, which is closest to exit.
B will receive Man of the Match and must be in the centre chair
C and D who are bitter rivals for the position of Wicket keeper dislike one another and should be seated as far apart as possible
E and F are best friends and want to seat together.

Which of the foll may not be seated at either end of the table?
i. C
ii. D
iii. G
iv. F
Which of the foll pairs may not be seated together?
i. E & A
ii. B & D
iii. C & F
iv. G & D

Direction for Qn 15-18
An employee has to allocate offices to 6 staff members. The offices are no. 1-6. the offices are arranged in a row and they are separated from each other by dividers>hence voices, sounds and cigarette smoke flow easily from one office to another
Miss R needs to use the telephone quite often throughout the day. Mr. M and Mr. B need adjacent offices as they need to consult each other often while working. Miss H is a senior employee and his to be allotted the office no. 5, having the biggest window.
Mr D requires silence in office next to his. Mr. T, Mr M and Mr. D are all smokers. Miss H finds tobacco smoke allergic and consecutively the offices next to hers are occupied by non-smokers. Unless specifically stated all the employees maintain an atmosphere of silence during office hrs.

The ideal candidate to occupy office farthest from Mr. B will be
i. Miss H
ii. Mr. M
iii. Mr. T
iv. Mr. D
The three employees who are smokers should be seated in the offices
i. 1 2 4
ii. 2 3 6
iii. 1 2 3
iv. 1 2 3
The ideal office for Mr. M would be
i. 2
ii. 6
iii. 1
iv. 3
In the event of what occurrence within a period of one month since the assignment of the offices would a request for a change in office be put forth by one or more employees?
i. Mr D quitting smoking
ii. Mr. T taking over duties formally taken care of by Miss R
iii. The installation of a water cooler in Miss H’s office
iv. Mr. B suffering from anemia

Direction for Qn 19-20
A robot moves on a graph sheet with x-y axes. The robot is moved by feeding it with a sequence of instructions. The different instructions that can be used in moving it, and their meanings are:
Instruction Meaning
GOTO(x,y) move to pt with co-ord (x,y) no matter where u are currently
WALKX(P) move parallel to x-axis through a distance of p, in the +ve direction if p is +ve and in –ve if p is –ve
WALKY(P) move parallel to y-axis through a distance of p, in the +ve direction if p is +ve and in –ve if p is –ve

The robot reaches point (5,6) when a sequence of 3 instr. Is executed, the first of which is GOTO(x,y) , WALKY(2), WALKY(4). What are the values of x and y??
i. 2,4
ii. 0,0
iii. 3,2
iv. 2,3
The robot is initially at (x.y), x>0 and y<0. The min no. of Instructions needed to be executed to bring it to origin (0,0) if you are prohibited from using GOTO instr. Is:
i. 2
ii. 1
iii. x + y
iv. 0

Direction for Qn 21-23
Ten coins are distr. Among 4 people P, Q, R, S such that one of them gets a coin, another gets 2 coins,3rd gets 3 coins, and 4th gets 4 coins. It is known that Q gets more coins than P, and S gets fewer coins than R

If the no. of coins distr. To Q is twice the no. distr. to P then which one of the foll. is necessarily true?
i. R gets even no. of coins
ii. R gets odd no. of coins
iii. S gets even no. of coins
iv. S gets odd no. of coins
If R gets at least two more coins than S which one of the foll is necessarily true?
i. Q gets at least 2 more coins than S
ii. Q gets more coins than P
iii. P gets more coins than S
iv. P and Q together get at least five coins
If Q gets fewer coins than R, then which one of the foll. is not necessarily true?
i. P and Q together get at least 4 coins
ii. Q and S together get at least 4 coins
iii. R and S together get at least 5 coins
iv. P and R together get at least 5 coins

Direction for Qn 24-25
Elle is 3 times older than Zaheer. Zaheer is ½ as old as Waheeda. Yogesh is elder than Zaheer.

What is sufficient to estimate Elle’s age?
i. Zaheer is 10 yrs old
ii. Yogesh and Waheeda are both older than Zaheer by the same no of yrs.
iii. Both of the above
iv. None of the above
Which one of the foll. statements can be inferred from the info above
i. Yogesh is elder than Waheeda
ii. Elle is older than Waheeda
iii. Elle’s age may be less than that of Waheeda
iv. None of the above

In the placement Papers sets, the questions were the same. Just the question numbers were changed. See other Capgemini India Latest Placement Papers here with technical hr interview questions here.

Capgemini India Latest 2008 July Placement Paper ..... Interview question

2008-08-12T02:55:00.000-07:00

CAPGEMINI PAPER ON 22ND JULY, 2008

Here are the written test aptitude and other multiple choice questions from the Capgemini IT company placement exam test paper 2008:

1.Fresh Grapes contain 90% water by wt. Dried grapes contain 20% water by %age. What will b wt of dried grapes when we begin with 20 kg fresh grapes?
2kg / 2.4kg / 2.5kg /none
2.How many 5 digit no. can b formed wit digits 1, 2, 3,4,5,6 which r divisible by 4 and digits not repeated
144 / 168 / 192 / none
3.There is a rectangular garden whose length and width are 60m X 20m.There is a walkway of uniform width around garden. Area of walkway is 516m^2. Find width of walkway
1/2/3/4
4. In a race from pt. X to pt Y and back, Jack averages 0 miles/hr to pt Y and 10 miles/hr back to pr X. Sandy averages 20 miles/hr in both directions. If Jack and Sandy start race at same tIme, who’ll finish 1st
Jack/Sandy/they tie/Impossible to tell
5. A man engaged a servant on a condition that he’ll pay Rs 90 and also give him a bag at the end of the yr. He served for 9 months and was given a turban and Rs 65. So the price of turban is
i. Rs 10 / 19 / 0 / 55
6. Three wheels make 36, 24, 60 rev/min. Each has a black mark on it. It is aligned at the start of the qn.When does it align again for the first time?
14/20/22/5 sec
7. If 1= (3/4)(1+ (y/x) ) then
i. x=3y
ii. x=y/3
iii. x=(2/3)y
iv. none
8. The sum of six consecutive odd nos. is 888. What is the average of the nos.?
i. 147
ii. 148
iii. 149
iv. 146
9.An employee has to allocate offices to 6 staff members. The offices are no. 1-6. the offices are arranged in a row and they are separated from each other by dividers>hence voices, sounds and cigarette smoke flow easily from one office to another
Miss R needs to use the telephone quite often throughout the day. Mr. M and Mr. B need adjacent offices as they need to consult each other often while working. Miss H is a senior employee and his to be allotted the office no. 5, having the biggest window.
Mr. D requires silence in office next to his. Mr. T, Mr. M and Mr. D are all smokers. Miss H finds tobacco smoke allergic and consecutively the offices next to hers are occupied by non-smokers. Unless specifically stated all the employees maintain an atmosphere of silence during office hrs.
a. The ideal candidate to occupy office farthest from Mr. B will be
i. Miss H
ii. Mr. M
iii. Mr. T
iv. Mr. D
b. The three employees who are smokers should be seated in the offices
i. 1 2 4
ii. 2 3 6
iii. 1 2 3
iv. 1 2 3
c. The ideal office for Mr. M would be
i. 2
ii. 6
iii. 1
iv. 3
d. In the event of what occurrence within a period of one month since the assignment of the offices would a request for a change in office be put forth by one or more employees?
i. Mr D quitting smoking
ii. Mr. T taking over duties formally taken care of by Miss R
iii. The installation of a water cooler in Miss H’s office
iv. Mr. B suffering from anemia
10.Ten coins are distr. Among 4 people P, Q, R, S such that one of them gets a coin, another gets 2 coins,3rd gets 3 coins, and 4th gets 4 coins. It is known that Q gets more coins than P, and S gets fewer coins than R
a. If the no. of coins distr. To Q is twice the no. distr. to P then which one of the following. is necessarily true?
i. R gets even no. of coins
ii. R gets odd no. of coins
iii. S gets even no. of coins
iv. S gets odd no. of coins
b. If R gets at least two more coins than S which one of the following is necessarily true?
i. Q gets at least 2 more coins than S
ii. Q gets more coins than P
iii. P gets more coins than S
iv. P and Q together get at least five coins
c. If Q gets fewer coins than R, then which one of the following is not necessarily true?
i. P and Q together get at least 4 coins
ii. Q and S together get at least 4 coins
iii.R and S together get at least 5 coins
iv.P and R together get at least 5 coins
11.Elle is 3 times older than Zaheer. Zaheer is ½ as old as Waheeda. Yogesh is elder than Zaheer.
a. What is sufficient to estimate Elle’s age?
i.Zaheer is 10 yrs old
ii.Yogesh and Waheeda are both older than Zaheer by the same no of yrs.
iii.Both of the above
iv.None of the above
b. Which one of the following statements can be inferred from the info above
i.Yogesh is elder than Waheeda
ii.Elle is older than Waheeda
iii.Elle’s age may be less than that of Waheeda
iv.None of the above

See other Capgemini Placement Test papers, latest 2008 exam papers, call centres, bpo, kpo, executives, voice caller, developers, software engineers, b.tech electronics and communications ece, computer science engineering cse, it information technology freshers placement papers and technical hr interview questions. Download and save free test papers here.

Tech Mahindra Latest Placement Test Paper ..... Interview question

2008-08-12T02:54:00.000-07:00

Here is the Tech Mahindra India placement test held on 18th April at Deen Bandhu Chhotu Ram University of Science and Technology Murthal Haryana.
Statistics:

Total Appeared - 135
Written test cleared by - 68
Technical Cleared by - 37
HR Interview - 32

In the multiple choice Written Exam there will be 5 Sections:

2 sections of verbal and non verbal :
Questions like find the missing term, series completion, some logical reasoning questions

3 sections of English Language Test:
General fill in the blanks like prepositions and verbs
Easy synonyms
Reading comprehension part
Its easy one but requires preparation. The questions are expected one.

There are 75 questions in 5 sections to be done in 60 minutes. So the time is short.
There is no negative marking. And there is sectional cutoff.

Tech Mahindra Technical Interview:

Me: Enter the room and good afternoon sir
Int: Good afternoon have your seat.

Then the questions asked were:
Tell me about yourself your background
Keep moving from one company to another?
About low class 10th and 12th scores.
Why the 1 year gap?
About pointers and link list
Can u print fibbonacci series recursively?
Ok do u want to ask anything?

Then the Tech Mahindra Basic HR Interview:

Have your seat.

Describe Yourself.

What is your biggest achievement till now?

1 year gap?

How will your friends describe you?

Can u relocate?

Are you ready to sign a bond and salary?
Then i was asked to go and when the result was declared, i was selected.

Watch other detailed Tech mahindra India and other it companies latest placement exam test papers here free online. You can download or save them here. See actual candidate experiences for tech mahindra technical tech hr interviews.

Tech Mahindra Placement Paper on 21st July at PES Mandya ..... Interview question

2008-08-12T02:53:00.000-07:00

Here is the Tech Mahindra Placement test paper held at mandya on 21st july 2008. Its the latest test paper.

Tech Mahindra visited our campus on 21st July 2008. Out of the 185 students, who were eligible for the test, 37 got short listed for the interviews and 19 got placed. The cutoff was 60% with one backlog allowed and it was only for CS, IS, EC and EE engineering b.tech departments.

The Selection Procedure:

Online Test: Written Multiple Choice Type Questions:

100 questions and the time was 60 minutes.

The questions were divided into 6 parts. Three of them were English sections. One was for non-verbal reasoning, one was for verbal reasoning and the other was of quantitative aptitude. There was a sectional cut off for all the sections.

First attempt the english section as it takes less time, then go for logical reasoning / aptitude sections questions.

2. Interviews:

There were 3 interviews for us:

HR cum technical interview, Technical interview and HR interview again.

In the first interview they asked simple questions like the stack concept, use of "%d", use of getch() and the command to drop a table in DBMS - database management systems. One popular question like "Why Tech mahindra?" Here quote some facts about TM company itself.

Technical interview: Asked questions from DBMS (favorite subject as written in resume), normalization, RDBMS, trigger and the use of null pointer.

Final Part - HR Interview:

The first question was "Tell me about your family in brief?"

Other questions were:

Tell me about your hobbies and interests?

Are you ready to go to any place?

Why tech mahindra?

Why did you choose computer science?

What are your short term and long term goals?

So this was the final tech mahindra hr interview. See other latest 2008 placement papers and tech mahindra technical hr interview questions with solutions, tips, tricks and hr interview / group discussion guide free online here for freshers, engineers, developers, etc. Good Luck for your own placement test.

Birlasoft Placement Paper on 28th February ..... Interview question

2008-08-12T02:52:00.000-07:00

Here is the latest birlasoft india placement paper held on 28th of February. Here is the account of the paper.

It was a two day campus placement drive. First there was an aptitude test and GD.
In the Aptitude test, there were 50 questions. First 20-25 were technical. First three questions were on conversion from hexadecimal to octal, binary, etc. There were ques on dbms like what is denormalization, questions on java, c language, c++ These were simple questions. The quantitative questions were on alligation, speed and distance, profit and loss, probability, time and work.
Next were questions on English Language. Choose the wrong sentence, synonyms and associate the meanings with the phrases given. Cutoff for the paper was arnd 40.

Group Discussion Round: GD

Topics for gd were future of it industry in india, should ganguly be the captain of indian cricket team, shilpa shetty vs jade goody at big brother, love marriages vs arranged marriages, etc.

Next day there was first a ppt and then the hr cum technical interview:

Questions: Me being an ece student they asked me about the communication system, how does commnication happen, etc.
what are analog and digital signals, advantages of digital over analog - explain in layman's language, examples of where are we using these signals, some questions on optical fibres, their advantages. Then he asked some questions on C language then what are data structures, what is block, what is page statement, explain float

HR Questions:

How do you define success?

How many friends do you have?

What are your positives

Do you read newspaper?

Few more questions:

Finally out of the 1600 students who appeared for the aptitude test 24 were finally selected.

See other latest Birlasoft and other IT MNC placement question papers - download free other entrance exam test papers here with hr interview questions, solutions, tips, answers and tricks here. Good luck! see engineering, electronics and communication, computer science, information technology IT, electrical engineering EE, CSE, ECE, IT related technical / tech interview questions with real candidate experiences for your exam help. Good luck!

Tech Mahindra Placement Paper at SGGS Nanded ..... Interview question

2008-08-12T02:51:00.000-07:00

Tech Mahindra India Placement Test Paper on 18th April 2007 at SGGS Nanded engineering college.

Tech Mahindra came to our college on April 18,2007. About 210 candidates appeared for the aptitude test and finally 30 cleared the aptitude test out of which 12 were selected.

1. Tech mahindra PPT:- First there was the paper presentation. They can ask questions abou ti in HR and Technical interview.

2. Online Aptitude Test:

There are 100 questions and time allowed is 1 hour. Listen the instructions from the HR carefully before solving the test. Solve all the questions as there is no negative marking.

There were total 6 sections:-

1.Verbal Ability(35 questions)

2.Analytical(20 q)

3.Quanti.(15 q)

4.English I(10 q)

5.English II(10 q)

6.English III(10 q)

Solve the english section first and then solve the other sections.

3. Technical Interview:

Tell me about yourself?

Tell me about mouse programming in C (As I used mouse programming in my project)

Difference between C and C++

Few basic questions regarding DBMS - database management systems

Asked about my strengths and weakness.

Where do you want to see yourself after 5 years?

They ask tricky questions related to your projects - the project interview questions can be difficult sometimes.

Next was the HR Interview:

Questions:

Tell me about yourself.

How will you sell the drinking bottle?

Why should I select you?

They asked some candidates to talk on a subject for 2 minutes.

In MBT, if you clear Technical interview - the hr is normally easy and just a formality.
There was no Group discussion / GD in the whole test. SO finally 12 persons were selected.

See related Tech Mahindra Sample Placement Test papers 2008 and related technical hr interview questions for computer science, electronics, IT (Cse, ece, it branch) and other IT or engineering graduates. Good luck..

Tech Mahindra Recent Placement Paper at Bangalore ..... Interview question

2008-08-12T02:49:00.000-07:00

Tech Mahindra Placement Test Paper on 9th May at

535 students appeared for the TM Placement test. It was a campus placement test held at BMSIT Bangalore. 168 candidates cleared the aptitude round and finally 63 were selected.

Placement Paper Pattern:
General Paper( 5- Sections) 75 Questions in 60 minutes

1. QUANTITATIVE : Percentage, Ratio and Proportion, Series, Numbers, Train Problems, Time and Work, Boat and stream speed / time, etc.

2. Verbal and Non Verbal:

Blood Relations, Puzzles, etc.

3. English Passage

4. English Section: Fill in the blanks, Synonyms, phrases replacement questions.

The english part is easy. First you should do the quantitative part. You have to manage time very well. The results will be declared few hours after the written test / exam.

After 2 days, we had the Technical and HR Interview Round:

TM Tech HR Questions were like: Introduce yourself

What is the difference between Windows XP and Windows 98? (they ask questions according to your resume)

A binary search algorithm

Logical gates - or gates, nand, and, nor, not, etc. structures and conversion of gates

Conversion to Binary

Structures and Pointers

Data Structures & Arrays related technical interview questions

(See the technical interview questions here)

Next was the HR Interview round. As usual it was simple.. thank god. We had 2.9 lacs salary / package. Good luck.. see you at tech mahindra..

See other related Tech mahindra Placement Test Papers, sample papers, latest technical / tech hr interview questions and gd - group discussion topics here for freshers / b.tech engineers ece ee it me cse ones, developers or IT graduates for reputed IT companies - MNC exams: Tech Mahindra Placement Paper on 21st July at PES ..., Tech Mahindra Latest Placement Test Paper, Tech Mahindra Placement Paper at SGGS Nanded and other latest IT Companies placement papers here. Keep watching PreviousPapers.blogspot.com for more free exam preparation resources.

Interview question Capgemini India Latest 2008 July Placement Paper

2008-08-08T06:37:00.000-07:00

Interview question Tech Mahindra Latest Placement Test Paper

2008-08-08T06:36:00.000-07:00

Tech Mahindra Placement Paper on 21st July at PES Mandya

2008-08-08T06:35:00.000-07:00

Birlasoft Placement Paper on 28th February Interview question

2008-08-08T06:33:00.000-07:00

Tech Mahindra Placement Paper at SGGS Nanded Interview question

2008-08-08T06:32:00.000-07:00

Tech Mahindra Recent Placement Paper at Bangalore Interview question

2008-08-08T06:30:00.000-07:00

Yahoo Interview

2008-07-24T09:28:00.000-07:00

1) There is a n x n grid of 1's and 0's. Find the i , where i is the row
containing all 1's and all 0's(except the intersection point). Should do
it in less than 25 comparisons
..
2) Use 2 stacks to implement a queue. Followed up with making the
access to the Data structure concurrently.

3) C++ question was good, implement a c++ class such that it allows us
to add data members at runtime.

4)Implement a transaction manager in a database server. The discussion
involved a lot of stuff about transaction logs.

5) How do you tune an application. Creating indexes.

6) Some SQL performance tuning questions on creating indexes.

7) can you write a foo() in c? If so how can u do it?

8) vector implementation questions.

9) Almost everyone asked about my language.(except ppl who attended my talk).

Yahoo Interview Questions

2008-07-24T09:27:00.000-07:00

Yahoo Telephonic Round:

Design classes for the following problem. (C++)

A Customer Can have multiple bank accounts A Bank account can be owned by multiple customers When customer logs in he sees list of account, on clicking on an account he sees list of transactions.

Solution :

Customer class, Account class, Transaction class
Customer class contains an array of pointers to the account classes
Account class contains an array of pointers to its owner customer classes
Account class also contains an array of transactions associated to it.
Transaction class contains id or pointer the customer who did that transaction
In customer class write a function with prototype

for (i in Accounts )
{
cout << i.AccountName << endl;
}
cin >> id;
for(i in Accounts[id].transactions )
{
cout << i.TransDetails << endl;
}

Yahoo Interview Round 1:

1. How to call a C++ function which is compiled with C++ compiler in C code?

Solution: The C++ compiler must know that f(int,char,float) is to be called by a C compiler using the extern "C"construct:

The extern "C" line tells the compiler that the external information sent to the linker should use C calling conventions and name mangling (e.g., preceded by a single underscore). Since name overloading isn't supported by C, you can't make several overloaded functions simultaneously callable by a C program.

// This is C++ code
// Declare f(int,char,float) using extern "C":
extern "C" void f(int i, char c, float x);
...
// Define f(int,char,float) in some C++ module:
void f(int i, char c, float x)
{
.....
}

2. When you deliver your C++ headers and C++ library of a class (what all can you change in the class so that application using your class does not need to recompile the code)
3. How do you initialize a static member of a class with return value of some function?

Solution :

Static data members are shared by all object instances of that class. Each class instance sees and has access to the same static data. The static data is not part of the class object but is made available by the compiler whenever an object of that class comes into scope. Static data members, therefore, behave as global variables for a class. One of the trickiest ramifications of using a static data member in a class is that it must be initialized, just once, outside the class definition, in the source file. This is due to the fact a header file is typically seen multiple times by the compiler. If the compiler encountered the initialization of a variable multiple times it would be very difficult to ensure that variables were properly initialized. Hence, exactly one initialization of a static is allowed in the entire program.

Consider the following class, A, with a static data member, _id:

//File: a.h
class A
{
public:
A();
int _id;
};

The initialization of a static member is done similarly to the way global variables are initialized at file scope, except that the class scope operator must be used. Typically, the definition is placed at the top of the class source file:

// File: a.cc
int A::_id;

Because no explicit initial value was specified, the compiler will implicitly initialize _id to zero. An explicit initialization can also be specified:

// File: a.cc
int A::_id = 999;

In fact, C++ even allows arbitrary expressions to be used in initializers:

// File: a.cc
int A::_id = GetId();

4. How can one application use same API provided by different vendors at the same time?
5. If you are given the name of the function at run time how will you invoke the function?

Solution :
* Compile your program with --export-dynamic on the gcc command line
* Link with -ldl (dynamic library handling, needed for dlopen and dlsym
* Call dlopen() with a null parameter, meaning you aren't loading symbols from a file but from the current executable
* Call dlsym() with the name of the function you'll be calling. Note that C++ modifies function names, so If you're trying this with C++, you'd have to either declare this function as extern "C", or figure out what name the function has after compiling. (On unix, you could run nm -s on the object file for this).
* If dlsym() returns non-null, use the returned value as a function pointer to invoke your function.

Yahoo Interview Round 2:

1. When will you use shell script/Perl ahead of C/C++?
2. How does yahoo handles billions of requests, does it create a thread per request or a process?
3. How does HTTP works?

Solution :HTTP Is a request-response protocol.

For example, a Web browser initiates a request to a server, typically by opening a TCP/IP connection. The request itself comprises o a request line, o a set of request headers, and o an entity. The server sends a response that comprises o a status line, o a set of response headers, and o an entity. The entity in the request or response can be thought of simply as the payload, which may be binary data. The other items are readable ASCII characters. When the response has been completed, either the browser or the server may terminate the TCP/IP connection, or the browser can send another request.

4. How to count number of unique music titles downloaded from a log file which contains an entry of all music title downloaded?
5. What is the difference between COM and CORBA?

Solution :COM is linked to Microsoft and CORBA to UNIX,Moreover, COM objects require installation on the machine from where it is being used .CORBA is ORB (Object request broker) , and also its a specification owned by OMG, which is open. Not owned by a company. So we cannot say that it only belongs to Unix. Corba servers can run on windows NT, and CORBA clients can run on Unix.

6. What is web service?

Solution :Web Service is defined as "a software system designed to support interoperable Machine to Machine interaction over a network." Web services are frequently just Web APIs that can be accessed over a network, such as the Internet, and executed on a remote system hosting the requested services.

I got only these two Rounds as of now, if I get any more I will post them here. If you have attended yahoo interview please share your experience and questions with us. You can mail them at kchaitanyya@gmail.com or you can comment here.Solutions for rest of questions will be provided later.if you know any of the questions which are unsolved please comment the solution. we will include.

Yahoo Interview Questions-1

2008-07-24T09:25:00.000-07:00

# A modified insertion sort uses binary search to find the position of insertion. What would be the improvement in order realized?

# class a{};
main()
{
count <<>
}
What is the output?

# The linked list size is unknown and it is very large. Find out the N th element from the back end.

# What happens in the following code?
char x[10],y[10];
x=y;

# Design a stack which supports push, pop, min and max operations in O(1).

# Design an NFA to accept a string of 0s and 1s.

# Given a balanced BST tree, write a function to replace the root with a node that belongs to the original tree.

# Explain what this function does

char *mystrcpy(char *s)
{
char des=char [MAXLEN];
char * t=des;
while(*s)
{
*++t=*++s;
}
return t;
}

# Given that you have a server hit by around 400 million users, and you have log files that contain the user ids of all of them. How do you find the frequency of login of each user. (The log files are very huge!!)

# Explain Polymorphism, Encapsulation, Inheritance, operator overloading?

Yahoo Interview Questions-2

2008-07-24T09:24:00.000-07:00

# Design a data structure such that given a stream of numbers, you can find the maximum of the numbers at any point and also all the numbers.

# Given an array of 1s and 0s arrange the 1s together and 0s together in a single scan of the array. Optimize the boundary conditions.

# Find the common ancestor of two given nodes in a binary tree, how do you exploit the properties of a given BST for the same problem.

# Given a function getsort(data),that sorts the data given. The function sorts in place and does not use any extra memory. How do you validate the function with respect to 1)it sorts 2) it does not use extra memory

# Explain the Traveling Salesman problem? What is an NP-complete problem? What is the Hamiltonian cycle problem?

# Find out the least common ancestor in a binary tree.

Visual Basic Interview Questions -7

2008-07-24T09:23:00.000-07:00

91. What is Dataware Control?

Any control bound to Data Control.
Ex:- Textbox, Check Box, Picture Box, Image Control, Label, List box, Combo Box, DB Combo,

92. What is the default model of the form? And what is it number?

93. Why we need OLE-Automation? Advantages?

94. What methods are used for DBGrid in unbound mode?

AddData, EditData, Readdata, WriteData.

95. What is ADO? What are its objects ?

ActiveX Data Object. ADO can access data from both flat files as well as the databases. I.e., It is encapsulation of DAO, RDO, and OLE that is why we call it as OLE-DB Technology. Objects are Connection, Record Set, Command, Parameter, field, Error, Property.

96. What is the max size allowed for Max Text box length.

32,000

97. Record set types and Number available in VB?

3.
1- Dynaset, 0 Table, 2 Snap Shot.

98. What is the max size allowed for Max Control Names length?

255.

99. How many procedures are in VB?

2.
function and sub procedures

100. What is the max size allowed for Max label caption length.?

2,048

101. what will be the result for 15/4 and 154 ?

15/4 = 3.75 and 154 = 3

102. What is the max size allowed for Msgbox Prompt and Input Box?

1024

103. Calling Stored Procedures in VB?

1. Calling Simply the Procedure with out Arguments "Call ProcedureName}"
2. If it is with Arguments Means then
Declare the Query Def qy
Set Qy as New Query def
Qy.SQL = "{Call ProcedureName(?

104. DSN Less Connection?

"Server=Oracle; Driver={Microsoft ODBC for Oracle};"

105. Visual Basic Interview Questions only

1. 3 main differences between flexgrid control and dbgrid control
2. ActiveX and Types of ActiveX Components in VB
3. Advantage of ActiveX Dll over Active Exe
4. Advantages of disconnected recordsets
5. Benefit of wrapping database calls into MTS transactions
6. Benefits of using MTS
7. Can database schema be changed with DAO, RDO or ADO?
8. Can you create a tabletype of recordset in Jet - connected ODBC database engine?
9. Constructors and distructors
10. Controls which do not have events
11. Default property of datacontrol
12. Define the scope of Public, Private, Friend procedures?
13. Describe Database Connection pooling relative to MTS
14. Describe: In of Process vs. Out of Process component. Which is faster?
15. Difference between a function and a subroutine, Dynaset and Snapshot,early and late binding, image and picture controls,Linked Object and Embedded Object,listbox and combo box,Listindex and Tab index,modal and moduless window, Object and Class,Query unload and unload in form, Declaration and Instantiation an object?
16. Draw and explain Sequence Modal of DAO
17. How can objects on different threads communicate with one another?
18. How can you force new objects to be created on new threads?
19. How does a DCOM component know where to instantiate itself?
20. How to register a component?
21. How to set a shortcut key for label?
22. Kind of components can be used as DCOM servers
23. Name of the control used to call a windows application
24. Name the four different cursor and locking types in ADO and describe them briefly
25. Need of zorder method, no of controls in form, Property used to add a menus at runtime, Property used to count number of items in a combobox,resize a label control according to your caption.
26. Return value of callback function, The need of tabindex property
27. Thread pool and management of threads within a thread pool
28. To set the command button for ESC, Which property needs to be changed?
29. Type Library and what is it's purpose?
30. Types of system controls, container objects, combo box
31. Under the ADO Command Object, what collection is responsible for input to stored procedures?
32. VB and Object Oriented Programming
33. What are the ADO objects? Explain them.
34. What are the different compatibility types when we create a COM component?
35. What do ByVal and ByRef mean and which is the default?
36. What does Option Explicit refer to?
37. What does the Implements statement do?
38. What is OLE and DDE? Explain.
39. What is the difference between Msgbox Statement and MsgboxQ function?
40. What keyword is associated with raising system level events in VB?
41. What methods are called from the ObjectContext object to inform MTS that the transaction was successful or unsuccessful?
42. What types of data access have you used.
43. What was introduced to Visual Basic to allow the use of Callback Functions?
44. Which controls can not be placed in MDI?
45. Which controls have refresh method, clear method
46. Which Property is used to compress a image in image control?
47. Which property of menu cannot be set at run time?
48. Which property of textbox cannot be changed at runtime and What's the maximum size of a textbox?
49. Which tool is used to configure the port range and protocols for DCOM communications?
50. What is Dll?
51. Question How many images can be placed in the image list?
52. What is the result of Null * Any value = 0 (Zero)?

Visual Basic Interview Questions -6

2008-07-24T09:21:00.000-07:00

76. What are the type of validation available in VB?

Field, Form

77. How to trap Data Base Error?

Dim x as RDOError
X(0).Des
X(1).Number

Setting the Cursors.
Default Cursor 0
ODBC Cursor (Client side) 1
ServerSide Cursors (More Network traffic) - 2

78. How to declare Dll Procedure?

Declare function "" lib ""
Alias "" (Arg, ..) as Return type.

79. Referential Integrity (Take care By jet database Engine). Cascade Delete, Cascade Update is done setting property of Attributes.?

DbRelationDeleteCascade, DbRelationUpdateCascade.

80. How to increase the Date corresponding with month,date,year?

DateSerial(year(Now),Month(Now)+1,1)
Hour, min, sec, month, year, DateSerial, dateadd, datediff, weekday, datevalue, timeserial,timevalue.

81. Name some date function?

Dateadd(), Datediff(), Datepart(), Cdate()

82. What is difference between datagrid and flexgrid?

Datagrid Editable. Flexigrid Non-Editable. (Generally used for Read only purpose.)

83. What are two validate with Data Control?

Data_Validate, Data_Error.

84. To connect the Data Control with Back end What are all the properties to be set?

Data source Name, Record Source Name

85. What are the Technologies for Accessing Database from Visual Basic?set?

DAO, Data Control, RDO, ODBCDIRECT, ADO, ODBC API , 0040.

86. What is the diff between the Create Object and Get object?

Create Object - To create an instance of an object.
Get Object To get the reference to an existing object.

87. What is Mask Edit and why it is used?

Control. Restricted data input as well as formatted data output.

88. What is RdExecDirect?

Bypasses the Creation of a stored procedure to execute the query. Does not apply to Oracle.

89. Different type of Passing Value?

By value, By ref, Optional, Param Array. Note:- Optional keyword cannot be used while declaring arguments for a function using param array.

90. What are types of binding?

Assigning variable with defined memory space.
Late Binding - Memory size is allotted in later stage.
Ex:- Dim x as object
Early Binding - Memory size is allotted while declaring itself. New Key word is important.
Ex:- Dim x as New Object

Visual Basic Interview Questions -5

2008-07-24T09:20:00.000-07:00

61. What is keyword used to compare to objects?

ISOperator Returns Boolean.

62. Suppose from form1 to form2 object property settings will arise to ?

Invalid procedure call or argument (Run time error 5)

63. What is the return type of Instr and Strcmp?

Instr integer (Numeric position)
Strcmp - integer ( if both the string are equal they result = 0)
Strcmp (Str1, Str2, Comparetype)
Comparing mode = 0 Binary Comparing
1 Textual Comparing

64. What is Implicit?

Instance of specific copy of a class with its own settings for the properties defined in that class.
Note: The implicitly defined variable is never equal to nothing.

65. What is Inprocess and Out of Process?

Inprocess It will run with in the memory. ( Local Machine). Out of Process It will run out of the memory Normally in the server side.

66. Where will we give the option explicit keyword and for what?

In the general declarations section. To trap undeclared variables.

67. How can we call Stored procedure of Back End in RDO and ADO ?

In RDO We can call using RDO Query Objects.
In ADO We can call using Command Objects.

68. What is Static Cursor?

In ADO Snap Shot is called so.

69. How to check the condition in Msgbox?

If(Msgbox("Do you want to delete this Record",VbYesNo)=VbYes)Then End if

70. What is control array and how many we can have it with in the form?

Group of control share the same name. Max 32, 767.

71. What is diff between the Generic Variable and Specific Variable?

Generic Variable:
Create Object Ex:-Ole-Automation . No need refer the object library.
Specific Variable:
Binding Procedure Early and Late Binding ( Can be Remove from the Memory).

72. What is the diff. Between function and sub procedures?

Function will return value but a sub procedure wont return values

73. What is the max size allowed for Extension in Visual Basic?

Frm, bas, cls, res, vbx, ocx, frx, vbp, exe

74. What is FireHouse Cursors?

Forward Only Some time Updateable

75. With in the form we want to check all the text box control are typed or not? How?

For each currentcontrol in controls
if typeof currentcontrol is TextBox then
end if
next

courtesy:DEVFYI - Developer Resource - FYI

Visual Basic Interview Questions -4

2008-07-24T09:18:00.000-07:00

46. What is Seek Method which type of record set is available this?

Only in DbOpenTables.
Syntax: rs.index = "empno"
rs.seek "=" , 10
If with our setting the rs.index then run time error will occur.

47. What is Zorder Method?

Object.Zorder = 1 or 0 Place a Specified mdiform form or control at the front or back of the z-order with n its Graphical Level.

48. Can us able to set Instancing properties like Singleuse, GlobalSingleuse to ActiveXDll?

No.

49. What are properties available in Clip Board?
No Properties Available. Only the methods they are SetText, GetText, Setdata(), Getformat(), Clear

50. What is the different between Microsoft ODBC Driver and Oracle OBDC Driver?

Microsoft ODBC driver will support all the methods and properties of Visual Basic. Where as the Oracle not.

51. What the RDO Methods and Events?

Methods Events
Begin Trans Validate
Commit Trans Reposition
Rollback Trans Error
Cancel Query Complied
Refresh
Update Controls
Update row

52. What is MAPI ?

Messaging Application programming Interface.

53. What is MDI form?

MDI Styles?

54. What are the locks available in Visual Basic?

Locking is the process by which a DBMS restricts access to a row in a multi-user environment 4 types of locks. They are
1. Batch Optimistic
2. Optimistic
3. Pessimistic
4. ReadOnly
Operations in a relational database act on a complete set of rows. The set of rows returned by a SELECT statement consists of all the rows that satisfy the conditions in the WHERE clause of the statement. This complete set of rows returned by the statement is known as the result set.
Applications, especially those that are interactive and online, cannot always work effectively with the entire result set as a unit.
These applications need a mechanism to work with one row or a small block of rows at a time. Cursors are an extension to result sets that provide that mechanism.
Cursor or lock type Advantages Disadvantages AdOpenForwardOnly (Default) Low resource requirements Cannot scroll backward No data concurrency AdOpenStatic Scrollable (Wont detect changes made at the same time by another application) No data concurrency AdOpenKeyset Some data concurrency Scrollable Higher resource requirements Not available in disconnected scenario AdOpenDynamic High data concurrency Scrollable Highest resource requirements Not available in disconnected scenario AdLockReadOnly Low resource requirements Highly scalable Data not updatable through cursor AdLockBatchOptimistic Batch updates Allows disconnected scenarios Other users able to access data Data can be changed by multiple users at once AdLockPessimistic Data cannot be changed by other users while locked Prevents other users from accessing data while locked AdLockOptimistic Other users able to access data Data can be changed by multiple users at once.

55. Diff type of Datatypes?

LOB (Large Object Data type).
CLOB (Stores Character Objects).
BLOB ( Store Binary Objects such as Graphic, Video Chips and Sound files).
BFILE(Store file pointers to LOB It may Contain filename for photo’s store on CD_ROM).

56. What is Tabstrip control?

Libraries of procedure external to the application but can be called from the application.

57. What is Static Variable?

Its Scope will be available through out the life time.

58. What is DBSqlPassThrough?

It will By Passing the Jet Query Processor.

59. What is the starting Index value? How to locate it?

It is tab control to place our controls with in the form in multiple sheets.
Index starts with 1.
And to identify If Tabstrip1.SelectedItem.
Index = 1 Then ..
End if

60. What is Parser Bug?

It is difficult to use database objects declared in a module from within a form.
courtesy:DEVFYI - Developer Resource - FYI

Visual Basic Interview Questions -3

2008-07-24T09:17:00.000-07:00

31. What are the Style Properties of Combo Box?

Simple, Dropdown list We can type and select. Dropdown Combo Only Drop Down.

32. What are the Style properties of List Box?

Simple Single Select , Extended. Multiple Select.

33. What is Collection Objects?

Similarly to arrays but is preferred over an array because of the following reasons.
1. A collection objects uses less Memory than an array.
2. It provides methods to add and delete members.
3. It does not required reason statement when objects are added or deleted.
4. It does not have boundary limitations.

34. What is the difference between Property Get, Set and Let?

Set Value is assigned to ActiveX Object from the form.
Let Value is retried to ActiveX Object from the form.
Get- Assigns the value of an expression to a variable or property.

35. How to change the Mouse Pointer?

Screen.MousePointer = VBHourGlass/VBNormal.

36. What is Friend Variable?

Scope sharable between projects.

37. What is DBFailError?
Rolls Back updates if any errors Occurs

38. What are the record set types?

RdOpenFowardOnly 0 (Default used only for the read only purpose)
RdOpenStatic 1
RdOpenDynamic 2
RdOpenKeySet 3 (Normally used for the live project)

39. What is the diff between RDO and ADO?

RDO is Hierarchy model where as ADO is Object model. ADO can access data from both flat files as well as the data bases. I.e., It is encapsulation of DAO, RDO , OLE that is why we call it as OLE-DB Technology.

40. Diff types of Lock Types?

RdConcurReadOnly 0 (Default)
RdConcurLock 1 (Pessimistic Locking)
RdConcurRowver 2 (Optimistic Lociking)
RdConcurValues 3
RdConcurBatch 4

41. What are the scopes of the class?

Public, private, Friend

42. Have you create Properties and Methods for your own Controls?

Properties Public variable of a Class
Method Public procedure of a class

43. Private Dim x as integer. Valid ?

Private cannot be used in front of DIM.

44. Different type of Instantiation?

Private Only for the Specific Module.
Public not creatable Private & Public
Multi Use - Variable we have to declare.
Single Use Not possible through dll.
Global Multiuse Have variable not Required to Declare.
Global Single Use - Only for exe.

45. What are the different types of Dialog Box?

Predefined, Custom, User Defined.

courtesy:DEVFYI - Developer Resource - FYI

Visual Basic Interview Questions -2

2008-07-24T09:16:00.000-07:00

6. What are the main components of the ADO object model? How are they used?

Connection: Used to make a connection between your app and an external data source, ie, sql server.Command: Used to build queries, including user-specific parameters, to access records from a data source (which are returned in a Recordset)Recordset:Used to access records returned from an SQL query. With a recordset, you can navigate returned records. You can also add, modify or delete records.

17. Can We create CGI scripts in VB??

Yes.

18. Dim x, y as integer. What is x and y data type?

X as variant and y as integer.

19. What is Centralization Error Handling?

Writing function and calling it when error occurs.

20. What is frx?

When some controls like grid and third party control placed in our application then it will create frx in run time.

21. What is the Dll required for running the VB?

Vbrun300.dll

22. Why we use Treeview Control?

To list the hierarchical list of the node objects. Such of files and Directories.

23. Handling Error in Calling chain.

This will call the top most error where the error is handled.

24. In project properties if we set Unattended what is it mean?

This cannot have user interface. This can be used for the COM creation.

25. What is the size of the variant data type?

The Variant data type has a numeric storage size of 16 bytes and can contain data up to the range of a Decimal, or a character storage size of 22 bytes (plus string length),and can store any character text.

26. What is view Port?

The area under which the container provides the view of the ActiveX Document is known as a view port.

27. What are the different types of error?

Syntax Errors, Runtime , Logic.

28. What is the diff between the Std and Class Module?

Std Global with in the project. Cls Global through out the all project only thing is we want to set the type lib. Class Modules can be Instantiated.

29. What is Mixed Cursors?

Static + Keyset

30. Drag and Drop state numbers and functions?

State 0 Source control is being dragged with the range of a target.
1 Out of the range of a target.
2 One position in the target to another.

Visual Basic Interview Questions -1

2008-07-24T09:09:00.000-07:00

1. How do you register a component?

Compiling the component, running REGSVR32 MyDLL.dll

2. Name and explain the different compatibility types when creating a COM component

No Compatibility ? New GUID created, references from other components will not workProject Compatibility ? Default for a new component Binary Compatibility ? GUID does not change, references from other components will work

3. Why iss it important to use source control software for source code?
Modification history.Code ownership: Multiple people can not modify the same code at the same time.

4. What two methods are called from the ObjectContext object to inform MTS that the transaction was successful or unsuccessful?

SetComplete and SetAbort.

5. What is the tool used to configure the port range and protocols for DCOM communications?

DCOMCONFIG.EXE

6. What does Option Explicit refer to?

All variables must be declared before use. Their type is not required.

7. What are the different ways to Declare and Instantiate an object in Visual Basic 6?

Dim obj as OBJ.CLASS with eitherSet obj = New OBJ.CLASS orSet obj = CreateObject(OBJ.CLASS?) orSet obj = GetObject( , OBJ.CLASS?)orDim obj as New OBJ.CLASS

8. Name the four different cursor types in ADO and describe them briefly.

The cursor types are listed from least to most resource intensive.Forward Only Fastest, can only move forward in recordset Static Can move to any record in the recordset. Data is static and never changes.KeySet Changes are detectable, records that are deleted by other users are unavailable, and records created by other users are not detectedDynamic ? All changes are visible.

9. Name the four different locking type in ADO and describe them briefly.

LockPessimistic Locks the row once after any edits occur.LockOptimistic Locks the row only when Update is called.LockBatchOptimistic Allows Batch Updates.LockReadOnly Read only. Can not alter the data.

10. Describe Database Connection pooling (relative to MTS )?

This allows MTS to reuse database connections. Database connections are put to sleep as opposed to being created and destroyed and are activated upon request.

11. What are the ADO objects?
Provide a scenario using three of them to return data from a database. Expected answer: Connection Connects to a data source; contains the Errors collectionCommand Executes commands to the data source. Is the only object that can accept parameters for a stored procedure.Recordset The set of data returned from the database.Scenario: There are many possibilities. The most likely is as follows:Dim conn As ADODB.ConnectionDim rs As ADODB.RecordsetDim Cmd As ADODB.Commandconn.ConnectionString = ?CONNECTION STRING?conn.OpenSet Cmd.ActiveConnection = connCmd.CommandText = ?SQL STATEMENT?Set rs = Cmd.ExecuteSet rs.ActiveConnection = Nothingconn.Close

12. Under the ADO Command Object, what collection is responsible for input to stored procedures?

The Parameters collection.

13. What are some benefits of using MTS?

Database Pooling, Transactional operations, Deployment, Security, Remote Execution.

14. What is the benefit of wrapping database calls into MTS transactions?

If database calls are made within the context of a transaction, aborting the transaction will undo and changes that occur within that transaction. This removes the possibility of stranded, or partial data.

15. Describe and In Process vs. Out of Process component. Which is faster?

An in-process component is implemented as a DLL, and runs in the same process space as its client app, enabling the most efficient communication between client and component.Each client app that uses the component starts a new instance of it.An out of process component is implemented as an EXE, and unlike a dll, runs in its own process space. As a result, exe’s are slower then dll’s because communications between client and component must be marshalled across process boundaries. A single instance of an out of process component can service many clients.

SQL Interview Questions -8

2008-07-24T09:08:00.000-07:00

121. What is the difference between file server and a database server ?

A file server just transfers all the data requested by all its client and the client processes the data while a database server runs the query and sends only the query output.

122. What is inheritance ?

Inheritance is a method by which properties and methods of an existing object are automatically passed to any object derived from it.

123. What are the two components of ODBC ?

1. An ODBC manager/administrator and
2. ODBC driver.

124. What is the function of a ODBC manager ?

The ODBC Manager manages all the data sources that exists in the system.

125. What is the function of a ODBC Driver ?

The ODBC Driver allows the developer to talk to the back end database.

126. What description of a data source is required for ODBC ?

The name of the DBMS, the location of the source and the database dependent information.

127. How is a connection establised by ODBC ?

ODBC uses the description of the datasource available in the ODBC.INI file to load the required drivers to access that particular back end database.

SQL Interview Questions -7

2008-07-24T09:06:00.000-07:00

101. What does the term downsizing refer to ?

A host based application is re-engineered to run in smaller or LAN based environment.

102. What is event trigger ?

An event trigger, a segment of code which is associated with each event and is fired when the event occurs.

103. Why do stored procedures reduce network traffic ?

When a stored procedure is called, only the procedure call is sent to the server and not the statements that the procedure contains.

104. What are the types of processes that a server runs ?

Foreground process and Background process.

105. What is a event handler ?

An event handler is a routine that is written to respond to a particular event.

106. What is an integrity constraint ?

An integrity constraint allows the definition of certain restrictions, at the table level, on the data that is entered into a table.

107. What are the various uses of database triggers ?

Database triggers can be used to enforce business rules, to maintain derived values and perform value-based auditing.

108. What is a transaction ?

A transaction is a set of operations that begin when the first DML is issued and end when a commit or rollback is issued. BEGIN COMMIT/ROLLBACK are the boundries of a transaction.

109. Why are the integrity constraints preferred to database triggers ?

Because it is easier to define an integrity constraint than a database trigger.

110. Why is it better to use an integrity constraint to validate data in a table than to use a stored procedure ?

Because an integrity constraint is automatically checked while data is inserted into a table. A stored has to be specifically invoked.

111. What are the three components of a client server model ?

A Client,
A Server and
A Network/Communication software.

112. What are the advantages of client/server model ?

Flexibility of the system, scalability, cost saving, centralised control and implementation of business rules, increase of developers productivity, portability, improved network and resource utilization.

113. What are the disadvantages of the client/server model ?

Heterogeneity of the system results in reduced reliablity. May not be suitable for all applications. Managing and tuning networks becomes difficult.

114. What are the different topologies available for network ?

Star,
Bus,
Ring.

115. What is the first work of Client process ?

A client process at first establishes connection with the Server.

115. What are the responsibilities of a Server ?

1. Manage resources optimally across multiple clients.
2. Controlling database access and security.
3. Protecting the databse and recovering it from crashes.
4. Enforcing integrity rules globally.

116. In a Client/Server context, what does API (Application Programming Interface) refer to ?

An API, in a Client/Server context, is a specification of a set of functions for communication between the client and the server.

117. Give some examples of standard API??s ?

Open Database Connectivity (ODBC),
Integrated Database Application Programming Interface (IDAPI),
XOpen
SQL/CLI

118. What is the main advantage of developing an application using an API ?

The application can be connected to any back end server that is supported by the API.

119. What is the main disadvantage of developing an application using an API ?

The application cannot use any special features of the backend server.

120. Why is an event driven program referred to a passive program ?

Because an event driven program is always waiting for something to happen before processing.

SQL Interview Questions -6

2008-07-24T09:04:00.000-07:00

81. Which procedure can be used to create a customized error message?
1. RAISE_ERROR
2. SQLERRM
3. RAISE_APPLICATION_ERROR
4. RAISE_SERVER_ERROR

82. The CHECK_THEATER trigger of the THEATER table has been disabled. Which command can you issue to enable this trigger?
1. ALTER TRIGGER check_theater ENABLE;
2. ENABLE TRIGGER check_theater;
3. ALTER TABLE check_theater ENABLE check_theater;
4. ENABLE check_theater;

83. Examine this database trigger
52. CREATE OR REPLACE TRIGGER prevent_gross_modification
53. {additional trigger information}
54. BEGIN
55. IF TO_CHAR(sysdate, DY) = MON
56. THEN
57. RAISE_APPLICATION_ERROR(-20000,Gross receipts cannot be deleted on Monday);
58. END IF;
59. END;

This trigger must fire before each DELETE of the GROSS_RECEIPT table. It should fire only once for the entire DELETE statement. What additional information must you add?
1. BEFORE DELETE ON gross_receipt
2. AFTER DELETE ON gross_receipt
3. BEFORE (gross_receipt DELETE)
4. FOR EACH ROW DELETED FROM gross_receipt

84. Examine this function:
61. CREATE OR REPLACE FUNCTION set_budget
62. (v_studio_id IN NUMBER, v_new_budget IN NUMBER) IS
63. BEGIN
64. UPDATE studio
65. SET yearly_budget = v_new_budget
WHERE id = v_studio_id;

IF SQL%FOUND THEN
RETURN TRUEl;
ELSE
RETURN FALSE;
END IF;

COMMIT;
END;

Which code must be added to successfully compile this function?
1. Add RETURN right before the IS keyword.
2. Add RETURN number right before the IS keyword.
3. Add RETURN boolean right after the IS keyword.
4. Add RETURN boolean right before the IS keyword.

85. Under which circumstance must you recompile the package body after recompiling the package specification?
1. Altering the argument list of one of the package constructs
2. Any change made to one of the package constructs
3. Any SQL statement change made to one of the package constructs
4. Removing a local variable from the DECLARE section of one of the package constructs

86. Procedure and Functions are explicitly executed. This is different from a database trigger. When is a database trigger executed?
1. When the transaction is committed
2. During the data manipulation statement
3. When an Oracle supplied package references the trigger
4. During a data manipulation statement and when the transaction is committed

87. Which Oracle supplied package can you use to output values and messages from database triggers, stored procedures and functions within SQL*Plus?
1. DBMS_DISPLAY 2. DBMS_OUTPUT 3. DBMS_LIST 4. DBMS_DESCRIBE

88. What occurs if a procedure or function terminates with failure without being handled?
1. Any DML statements issued by the construct are still pending and can be committed or rolled back.
2. Any DML statements issued by the construct are committed
3. Unless a GOTO statement is used to continue processing within the BEGIN section, the construct terminates.
4. The construct rolls back any DML statements issued and returns the unhandled exception to the calling environment.

89. Examine this code
71. BEGIN
72. theater_pck.v_total_seats_sold_overall := theater_pck.get_total_for_year;
73. END;

For this code to be successful, what must be true?
1. Both the V_TOTAL_SEATS_SOLD_OVERALL variable and the GET_TOTAL_FOR_YEAR function must exist only in the body of the THEATER_PCK package.
2. Only the GET_TOTAL_FOR_YEAR variable must exist in the specification of the THEATER_PCK package.
3. Only the V_TOTAL_SEATS_SOLD_OVERALL variable must exist in the specification of the THEATER_PCK package.
4. Both the V_TOTAL_SEATS_SOLD_OVERALL variable and the GET_TOTAL_FOR_YEAR function must exist in the specification of the THEATER_PCK package.

90 A stored function must return a value based on conditions that are determined at runtime. Therefore, the SELECT statement cannot be hard-coded and must be created dynamically when the function is executed. Which Oracle supplied package will enable this feature?

1. DBMS_DDL
2. DBMS_DML
3. DBMS_SYN
4. DBMS_SQL

91 How to implement ISNUMERIC function in SQL *Plus ?

Method 1:

Select length (translate (trim (column_name),' +-.0123456789',' ')) from dual ;

Will give you a zero if it is a number or greater than zero if not numeric (actually gives the count of non numeric characters)

Method 2:

select instr(translate('wwww',
'abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ',
'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX'),'X')
FROM dual;

It returns 0 if it is a number, 1 if it is not.

92 How to Select last N records from a Table?

select * from (select rownum a, CLASS_CODE,CLASS_DESC from clm)
where a > ( select (max(rownum)-10) from clm)

Here N = 10

The following query has a Problem of performance in the execution of the following query where the table ter.ter_master have 22231 records. So the results are obtained after hours.

Cursor rem_master(brepno VARCHAR2) IS
select a.* from ter.ter_master a
where NOT a.repno in (select repno from ermast) and
(brepno = 'ALL' or a.repno > brepno)
Order by a.repno

What are steps required tuning this query to improve its performance?

-Have an index on TER_MASTER.REPNO and one on ERMAST.REPNO

-Be sure to get familiar with EXPLAIN PLAN. This can help you determine the execution path that Oracle takes. If you are using Cost Based Optimizer mode, then be sure that your statistics on TER_MASTER are up-to-date. -Also, you can change your SQL to:

SELECT a.*
FROM ter.ter_master a
WHERE NOT EXISTS (SELECT b.repno FROM ermast b
WHERE a.repno=b.repno) AND
(a.brepno = 'ALL' or a.repno > a.brepno)
ORDER BY a.repno;

93 What is the difference between Truncate and Delete interms of Referential Integrity?

DELETE removes one or more records in a table, checking referential Constraints (to see if there are dependent child records) and firing any DELETE triggers. In the order you are deleting (child first then parent) There will be no problems.
TRUNCATE removes ALL records in a table. It does not execute any triggers. Also, it only checks for the existence (and status) of another foreign key Pointing to the table. If one exists and is enabled, then you will get The following error. This is true even if you do the child tables first.
ORA-02266: unique/primary keys in table referenced by enabled foreign keys
You should disable the foreign key constraints in the child tables before issuing the TRUNCATE command, then re-enable them afterwards.

94. What does preemptive in preemptive multitasking mean ?

Preemptive refers to the fact that each task is alloted fixed time slots and at the end of that time slot the next task is started.

95. What does the OLTP stands for ?

OLTP stands for On Line Transaction Processing

96. What is the most important requirement for OLTP ?

OLTP requires real time response.

97. In a client server environment, what would be the major work that the client deals with ?

The client deals with the user interface part of the system.

98. Why is the most of the processing done at the sever ?

To reduce the network traffic and for application sharing and implementing business rules.

99. What does teh term upsizing refer to ?

Applications that have outgrown their environment are re-engineered to run in a larger environment. This is upsizing.

100. What does one do when one is rightsizing ?

With rightsizing, one would move applications to the most appropriate server platforms.

SQL Interview Questions -5

2008-07-24T09:02:00.000-07:00

60.What is CYCLE/NO CYCLE in a Sequence?

CYCLE specifies that the sequence continue to generate values after reaching either maximum or minimum value. After pan-ascending sequence reaches its maximum value, it generates its minimum value. After a descending sequence reaches its minimum, it generates its maximum.
NO CYCLE specifies that the sequence cannot generate more values after reaching its maximum or minimum value.

61. What are the advantages of VIEW?

- To protect some of the columns of a table from other users.
- To hide complexity of a query.
- To hide complexity of calculations.

62. Can a view be updated/inserted/deleted? If Yes - under what conditions?

A View can be updated/deleted/inserted if it has only one base table if the view is based on columns from one or more tables then insert, update and delete is not possible.

63. If a view on a single base table is manipulated will the changes be reflected on the base table?

If changes are made to the tables and these tables are the base tables of a view, then the changes will be reference on the view.

64. Which of the following statements is true about implicit cursors?

1. Implicit cursors are used for SQL statements that are not named.
2. Developers should use implicit cursors with great care.
3. Implicit cursors are used in cursor for loops to handle data processing.
4. Implicit cursors are no longer a feature in Oracle.

65. Which of the following is not a feature of a cursor FOR loop?

1. Record type declaration.
2. Opening and parsing of SQL statements.
3. Fetches records from cursor.
4. Requires exit condition to be defined.

66. A developer would like to use referential datatype declaration on a variable. The variable name is EMPLOYEE_LASTNAME, and the corresponding table and column is EMPLOYEE, and LNAME, respectively. How would the developer define this variable using referential datatypes?

1. Use employee.lname%type.
2. Use employee.lname%rowtype.
3. Look up datatype for EMPLOYEE column on LASTNAME table and use that.
4. Declare it to be type LONG.

67. Which three of the following are implicit cursor attributes?

1. %found
2. %too_many_rows
3. %notfound
4. %rowcount
5. %rowtype

68. If left out, which of the following would cause an infinite loop to occur in a simple loop?

1. LOOP
2. END LOOP
3. IF-THEN
4. EXIT

69. Which line in the following statement will produce an error?

1. cursor action_cursor is
2. select name, rate, action
3. into action_record
4. from action_table;
5. There are no errors in this statement.

70. The command used to open a CURSOR FOR loop is

1. open
2. fetch
3. parse
4. None, cursor for loops handle cursor opening implicitly.

71. What happens when rows are found using a FETCH statement

1. It causes the cursor to close
2. It causes the cursor to open
3. It loads the current row values into variables
4. It creates the variables to hold the current row values

72. Read the following code:
10. CREATE OR REPLACE PROCEDURE find_cpt
11. (v_movie_id {Argument Mode} NUMBER, v_cost_per_ticket {argument mode} NUMBER)
12. IS
13. BEGIN
14. IF v_cost_per_ticket > 8.5 THEN
15. SELECT cost_per_ticket
16. INTO v_cost_per_ticket
17. FROM gross_receipt
18. WHERE movie_id = v_movie_id;
19. END IF;
20. END;
Which mode should be used for V_COST_PER_TICKET?
1. IN
2. OUT
3. RETURN
4. IN OUT

73. Read the following code:
22. CREATE OR REPLACE TRIGGER update_show_gross
23. {trigger information}
24. BEGIN
25. {additional code}
26. END;

The trigger code should only execute when the column, COST_PER_TICKET, is greater than $3. Which trigger information will you add?

1. WHEN (new.cost_per_ticket > 3.75)
2. WHEN (:new.cost_per_ticket > 3.75
3. WHERE (new.cost_per_ticket > 3.75)
4. WHERE (:new.cost_per_ticket > 3.75)

74. What is the maximum number of handlers processed before the PL/SQL block is exited when an exception occurs?

1. Only one
2. All that apply
3. All referenced
4. None

77. For which trigger timing can you reference the NEW and OLD qualifiers?

1. Statement and Row 2. Statement only 3. Row only 4. Oracle Forms trigger

78. Read the following code:
CREATE OR REPLACE FUNCTION get_budget(v_studio_id IN NUMBER)
RETURN number IS

v_yearly_budget NUMBER;

BEGIN
SELECT yearly_budget
INTO v_yearly_budget
FROM studio
WHERE id = v_studio_id;

RETURN v_yearly_budget;
END;
Which set of statements will successfully invoke this function within SQL*Plus?
1. VARIABLE g_yearly_budget NUMBER
EXECUTE g_yearly_budget := GET_BUDGET(11);
2. VARIABLE g_yearly_budget NUMBER
EXECUTE :g_yearly_budget := GET_BUDGET(11);
3. VARIABLE :g_yearly_budget NUMBER
EXECUTE :g_yearly_budget := GET_BUDGET(11);
4. VARIABLE g_yearly_budget NUMBER

31. CREATE OR REPLACE PROCEDURE update_theater
32. (v_name IN VARCHAR v_theater_id IN NUMBER) IS
33. BEGIN
34. UPDATE theater
35. SET name = v_name
36. WHERE id = v_theater_id;
37. END update_theater;

79. When invoking this procedure, you encounter the error:
ORA-000: Unique constraint(SCOTT.THEATER_NAME_UK) violated.
How should you modify the function to handle this error?
1. An user defined exception must be declared and associated with the error code and handled in the EXCEPTION section.
2. Handle the error in EXCEPTION section by referencing the error code directly.
3. Handle the error in the EXCEPTION section by referencing the UNIQUE_ERROR predefined exception.
4. Check for success by checking the value of SQL%FOUND immediately after the UPDATE statement.

80. Read the following code:
40. CREATE OR REPLACE PROCEDURE calculate_budget IS
41. v_budget studio.yearly_budget%TYPE;
42. BEGIN
43. v_budget := get_budget(11);
44. IF v_budget <>
45. THEN
46. set_budget(11,30000000);
47. END IF;
48. END;

You are about to add an argument to CALCULATE_BUDGET. What effect will this have?
1. The GET_BUDGET function will be marked invalid and must be recompiled before the next execution.
2. The SET_BUDGET function will be marked invalid and must be recompiled before the next execution.
3. Only the CALCULATE_BUDGET procedure needs to be recompiled.
4. All three procedures are marked invalid and must be recompiled.

SQL Interview Questions -4

2008-07-24T09:01:00.000-07:00

41. What is a join? Explain the different types of joins?

Join is a query, which retrieves related columns or rows from multiple tables.
Self Join - Joining the table with itself.
Equi Join - Joining two tables by equating two common columns.
Non-Equi Join - Joining two tables by equating two common columns.
Outer Join - Joining two tables in such a way that query can also retrieve rows that do not have corresponding join value in the other table.

42. What is the sub-query?

Sub-query is a query whose return values are used in filtering conditions of the main query.

43. What is correlated sub-query?

Correlated sub-query is a sub-query, which has reference to the main query.

44. Explain CONNECT BY PRIOR?

Retrieves rows in hierarchical order eg.
select empno, ename from emp where.

45. Difference between SUBSTR and INSTR?

INSTR (String1, String2 (n, (m)),
INSTR returns the position of the m-th occurrence of the string 2 in string1. The search begins from nth position of string1.
SUBSTR (String1 n, m)
SUBSTR returns a character string of size m in string1, starting from n-th position of string1.

46. Explain UNION, MINUS, UNION ALL and INTERSECT?

INTERSECT - returns all distinct rows selected by both queries. MINUS - returns all distinct rows selected by the first query but not by the second. UNION - returns all distinct rows selected by either query UNION ALL - returns all rows selected by either query, including all duplicates.

47. What is ROWID?

ROWID is a pseudo column attached to each row of a table. It is 18 characters long, blockno, rownumber are the components of ROWID.

48. What is the fastest way of accessing a row in a table?
Using ROWID.
CONSTRAINTS

49. What is an integrity constraint?

Integrity constraint is a rule that restricts values to a column in a table.

50. What is referential integrity constraint?

Maintaining data integrity through a set of rules that restrict the values of one or more columns of the tables based on the values of primary key or unique key of the referenced table.

51. What is the usage of SAVEPOINTS?

SAVEPOINTS are used to subdivide a transaction into smaller parts. It enables rolling back part of a transaction. Maximum of five save points are allowed.

52. What is ON DELETE CASCADE?

When ON DELETE CASCADE is specified Oracle maintains referential integrity by automatically removing dependent foreign key values if a referenced primary or unique key value is removed.

53. What are the data types allowed in a table?

CHAR, VARCHAR2, NUMBER, DATE, RAW, LONG and LONG RAW.

54. What is difference between CHAR and VARCHAR2? What is the maximum SIZE allowed for each type?

CHAR pads blank spaces to the maximum length.
VARCHAR2 does not pad blank spaces.
For CHAR the maximum length is 255 and 2000 for VARCHAR2.

55. How many LONG columns are allowed in a table? Is it possible to use LONG columns in WHERE clause or ORDER BY?

Only one LONG column is allowed. It is not possible to use LONG column in WHERE or ORDER BY clause.

56. What are the pre-requisites to modify datatype of a column and to add a column with NOT NULL constraint?

- To modify the datatype of a column the column must be empty.
- To add a column with NOT NULL constrain, the table must be empty.

57. Where the integrity constraints are stored in data dictionary?

The integrity constraints are stored in USER_CONSTRAINTS.

58. How will you activate/deactivate integrity constraints?

The integrity constraints can be enabled or disabled by ALTER TABLE ENABLE CONSTRAINT / DISABLE CONSTRAINT.

59. If unique key constraint on DATE column is created, will it validate the rows that are inserted with SYSDATE?

It won't, Because SYSDATE format contains time attached with it.

60. What is a database link?

Database link is a named path through which a remote database can be accessed.

60. How to access the current value and next value from a sequence? Is it possible to access the current value in a session before accessing next value?

Sequence name CURRVAL, sequence name NEXTVAL. It is not possible. Only if you access next value in the session, current value can be accessed.

SQL Interview Questions -3

2008-07-24T08:59:00.000-07:00

21. Which command executes the contents of a specified file?

START or @.

22. What is the value of comm and sal after executing the following query if the initial value of ‘sal’ is 10000
UPDATE EMP SET SAL = SAL + 1000, COMM = SAL*0.1;?

sal = 11000, comm = 1000.

23. Which command displays the SQL command in the SQL buffer, and then executes it?

RUN.

24. What command is used to get back the privileges offered by the GRANT command?

REVOKE.

25. What will be the output of the following query? SELECT DECODE(TRANSLATE('A','1234567890','1111111111'), '1','YES', 'NO' );? NO.

Explanation : The query checks whether a given string is a numerical digit.

26. Which date function is used to find the difference between two dates?

MONTHS_BETWEEN.

27. What operator performs pattern matching?

LIKE operator.

28. What is the use of the DROP option in the ALTER TABLE command?

It is used to drop constraints specified on the table.

29. What operator tests column for the absence of data?

IS NULL operator.

30. What are the privileges that can be granted on a table by a user to others?

Insert, update, delete, select, references, index, execute, alter, all.

31. Which function is used to find the largest integer less than or equal to a specific value?

FLOOR.

32. Which is the subset of SQL commands used to manipulate Oracle Database structures, including tables?

Data Definition Language (DDL).

33. What is the use of DESC in SQL?

DESC has two purposes. It is used to describe a schema as well as to retrieve rows from table in descending order.
Explanation :
The query SELECT * FROM EMP ORDER BY ENAME DESC will display the output sorted on ENAME in descending order.

34. What command is used to create a table by copying the structure of another table?

CREATE TABLE .. AS SELECT command
Explanation:
To copy only the structure, the WHERE clause of the SELECT command should contain a FALSE statement as in the following.
CREATE TABLE NEWTABLE AS SELECT * FROM EXISTINGTABLE WHERE 1=2;
If the WHERE condition is true, then all the rows or rows satisfying the condition will be copied to the new table.

35. TRUNCATE TABLE EMP;
DELETE FROM EMP;
Will the outputs of the above two commands differ?

Both will result in deleting all the rows in the table EMP..

36. What is the output of the following query SELECT TRUNC(1234.5678,-2) FROM DUAL;?

1200.

37. What are the wildcards used for pattern matching.?

_ for single character substitution and % for multi-character substitution.

38. What is the parameter substitution symbol used with INSERT INTO command?

&

39. What's an SQL injection?

SQL Injection is when form data contains an SQL escape sequence and injects a new SQL query to be run.

40. What is difference between TRUNCATE & DELETE

TRUNCATE commits after deleting entire table i.e., cannot be rolled back. Database triggers do not fire on TRUNCATE
DELETE allows the filtered deletion. Deleted records can be rolled back or committed. Database triggers fire on DELETE.

SQL Interview Questions -2

2008-07-24T08:57:00.000-07:00

1. The most important DDL statements in SQL are:

CREATE TABLE - creates a new database table

ALTER TABLE - alters (changes) a database table

DROP TABLE - deletes a database table

CREATE INDEX - creates an index (search key)

DROP INDEX - deletes an index

2. Operators used in SELECT statements.

= Equal
<> or != Not equal
> Greater than
<>= Greater than or equal
<= Less than or equal BETWEEN Between an inclusive range LIKE Search for a pattern

3. SELECT statements:

SELECT column_name(s) FROM table_name
SELECT DISTINCT column_name(s) FROM table_name
SELECT column FROM table WHERE column operator value
SELECT column FROM table WHERE column LIKE pattern
SELECT column,SUM(column) FROM table GROUP BY column
SELECT column,SUM(column) FROM table GROUP BY column HAVING SUM(column) condition value
Note that single quotes around text values and numeric values should not be enclosed in quotes. Double quotes may be acceptable in some databases.

4. The SELECT INTO Statement is most often used to create backup copies of tables or for archiving records.

SELECT column_name(s) INTO newtable [IN externaldatabase] FROM source
SELECT column_name(s) INTO newtable [IN externaldatabase] FROM source WHERE column_name operator value

5. The INSERT INTO Statements:

INSERT INTO table_name VALUES (value1, value2,....)
INSERT INTO table_name (column1, column2,...) VALUES (value1, value2,....)

6. The Update Statement:

UPDATE table_name SET column_name = new_value WHERE column_name = some_value

7. The Delete Statements:

DELETE FROM table_name WHERE column_name = some_value
Delete All Rows:
DELETE FROM table_name or DELETE * FROM table_name

8. Sort the Rows:

SELECT column1, column2, ... FROM table_name ORDER BY columnX, columnY, ..
SELECT column1, column2, ... FROM table_name ORDER BY columnX DESC
SELECT column1, column2, ... FROM table_name ORDER BY columnX DESC, columnY ASC

9. The IN operator may be used if you know the exact value you want to return for at least one of the columns.

SELECT column_name FROM table_name WHERE column_name IN (value1,value2,..)

10. BETWEEN ... AND

SELECT column_name FROM table_name WHERE column_name BETWEEN value1 AND value2 The values can be numbers, text, or dates.

11. What is the use of CASCADE CONSTRAINTS?

When this clause is used with the DROP command, a parent table can be dropped even when a child table exists.

12. Why does the following command give a compilation error?

DROP TABLE &TABLE_NAME; Variable names should start with an alphabet. Here the table name starts with an '&' symbol.

18. What will be the output of the following query?
SELECT REPLACE(TRANSLATE(LTRIM(RTRIM('!! ATHEN !!','!'), '!'), 'AN', '**'),'*','TROUBLE') FROM DUAL;?
TROUBLETHETROUBLE. p>

19. What does the following query do?

SELECT SAL + NVL(COMM,0) FROM EMP;?
This displays the total salary of all employees. The null values in the commission column will be replaced by 0 and added to salary.

20. What is the advantage of specifying WITH GRANT OPTION in the GRANT command?

The privilege receiver can further grant the privileges he/she has obtained from the owner to any other user.

SQl Job Interview Questions

2008-07-24T08:54:00.000-07:00

SQL
SQL is an English like language consisting of commands to store, retrieve, maintain & regulate access to your database.

SQL*Plus
SQL*Plus is an application that recognizes & executes SQL commands & specialized SQL*Plus commands that can customize reports, provide help & edit facility & maintain system variables.

NVL
NVL : Null value function converts a null value to a non-null value for the purpose of evaluating an expression. Numeric Functions accept numeric I/P & return numeric values. They are MOD, SQRT, ROUND, TRUNC & POWER.

Date Functions
Date Functions are ADD_MONTHS, LAST_DAY, NEXT_DAY, MONTHS_BETWEEN & SYSDATE.

Character Functions
Character Functions are INITCAP, UPPER, LOWER, SUBSTR & LENGTH. Additional functions are GREATEST & LEAST. Group Functions returns results based upon groups of rows rather than one result per row, use group functions. They are AVG, COUNT, MAX, MIN & SUM.

TTITLE & BTITLE
TTITLE & BTITLE are commands to control report headings & footers.

COLUMN
COLUMN command define column headings & format data values.

BREAK
BREAK command clarify reports by suppressing repeated values, skipping lines & allowing for controlled break points.

COMPUTE
command control computations on subsets created by the BREAK command.

SET
SET command changes the system variables affecting the report environment.

SPOOL
SPOOL command creates a print file of the report.

JOIN
JOIN is the form of SELECT command that combines info from two or more tables.
Types of Joins are Simple (Equijoin & Non-Equijoin), Outer & Self join.
Equijoin returns rows from two or more tables joined together based upon a equality condition in the WHERE clause.
Non-Equijoin returns rows from two or more tables based upon a relationship other than the equality condition in the WHERE clause.
Outer Join combines two or more tables returning those rows from one table that have no direct match in the other table.
Self Join joins a table to itself as though it were two separate tables.

Union
Union is the product of two or more tables.

Intersect
Intersect is the product of two tables listing only the matching rows.

Minus
Minus is the product of two tables listing only the non-matching rows.

Correlated Subquery
Correlated Subquery is a subquery that is evaluated once for each row processed by the parent statement. Parent statement can be Select, Update or Delete. Use CRSQ to answer multipart questions whose answer depends on the value in each row processed by parent statement.

Multiple columns
Multiple columns can be returned from a Nested Subquery.

Sequences
Sequences are used for generating sequence numbers without any overhead of locking. Drawback is that after generating a sequence number if the transaction is rolled back, then that sequence number is lost.

Synonyms
Synonyms is the alias name for table, views, sequences & procedures and are created for reasons of Security and Convenience.
Two levels are Public - created by DBA & accessible to all the users. Private - Accessible to creator only. Advantages are referencing without specifying the owner and Flexibility to customize a more meaningful naming convention.

Indexes
Indexes are optional structures associated with tables used to speed query execution and/or guarantee uniqueness. Create an index if there are frequent retrieval of fewer than 10-15% of the rows in a large table and columns are referenced frequently in the WHERE clause. Implied tradeoff is query speed vs. update speed. Oracle automatically update indexes. Concatenated index max. is 16 columns.

Data types
Max. columns in a table is 255. Max. Char size is 255, Long is 64K & Number is 38 digits.
Cannot Query on a long column.
Char, Varchar2 Max. size is 2000 & default is 1 byte.
Number(p,s) p is precision range 1 to 38, s is scale -84 to 127.
Long Character data of variable length upto 2GB.
Date Range from Jan 4712 BC to Dec 4712 AD.
Raw Stores Binary data (Graphics Image & Digitized Sound). Max. is 255 bytes.
Mslabel Binary format of an OS label. Used primarily with Trusted Oracle.

Order of SQL statement execution
Where clause, Group By clause, Having clause, Order By clause & Select.

Transaction
Transaction is defined as all changes made to the database between successive commits.

Commit
Commit is an event that attempts to make data in the database identical to the data in the form. It involves writing or posting data to the database and committing data to the database. Forms check the validity of the data in fields and records during a commit. Validity check are uniqueness, consistency and db restrictions.

Posting
Posting is an event that writes Inserts, Updates & Deletes in the forms to the database but not committing these transactions to the database.

Rollback
Rollback causes work in the current transaction to be undone.

Savepoint
Savepoint is a point within a particular transaction to which you may rollback without rolling back the entire transaction.

Set Transaction
Set Transaction is to establish properties for the current transaction.

Locking
Locking are mechanisms intended to prevent destructive interaction between users accessing data. Locks are used to achieve.

Consistency
Consistency : Assures users that the data they are changing or viewing is not changed until the are thro' with it.

Integrity
Assures database data and structures reflects all changes made to them in the correct sequence. Locks ensure data integrity and maximum concurrent access to data. Commit statement releases all locks. Types of locks are given below.
Data Locks protects data i.e. Table or Row lock.
Dictionary Locks protects the structure of database object i.e. ensures table's structure does not change for the duration of the transaction.
Internal Locks & Latches protects the internal database structures. They are automatic.
Exclusive Lock allows queries on locked table but no other activity is allowed.
Share Lock allows concurrent queries but prohibits updates to the locked tables.
Row Share allows concurrent access to the locked table but prohibits for a exclusive table lock.
Row Exclusive same as Row Share but prohibits locking in shared mode.
Shared Row Exclusive locks the whole table and allows users to look at rows in the table but prohibit others from locking the table in share or updating them.
Share Update are synonymous with Row Share.

Deadlock
Deadlock is a unique situation in a multi user system that causes two or more users to wait indefinitely for a locked resource. First user needs a resource locked by the second user and the second user needs a resource locked by the first user. To avoid dead locks, avoid using exclusive table lock and if using, use it in the same sequence and use Commit frequently to release locks.

Mutating Table
Mutating Table is a table that is currently being modified by an Insert, Update or Delete statement. Constraining Table is a table that a triggering statement might need to read either directly for a SQL statement or indirectly for a declarative Referential Integrity constraints. Pseudo Columns behaves like a column in a table but are not actually stored in the table. E.g. Currval, Nextval, Rowid, Rownum, Level etc.

SQL*Loader
SQL*Loader is a product for moving data in external files into tables in an Oracle database. To load data from external files into an Oracle database, two types of input must be provided to SQL*Loader : the data itself and the control file. The control file describes the data to be loaded. It describes the Names and format of the data files, Specifications for loading data and the Data to be loaded (optional). Invoking the loader sqlload username/password controlfilename .

Solutions to C programming questions

2008-07-24T08:52:00.000-07:00

1 solution) gives compiler error because of post increment on an expression and it it valid only on variable

2 solution) 9 9 56

3 solution) ans1: x*=y+1;
ans2:x*=++y,y--;

4 solution) emptystring or nthing

5 solution) First call can take an integer as input whether or not you put any spaces/newlines/white space characters before it.
But the second call expects at least one ' ' [ space ] character and then some/none white space characters and then an integer.

6 solution) 16

7 solution) 1111

8 solution) prints the numbers in 2 rows each containing 10 elements with in between spaces

9 solution) it won't because of overflow in the statement *a=*a+*b;

10 solution) 4 8

11 solution) 987641

12 solution) 2 1 2

13 solution) unsigned/**/int/**/p;

14 solution) 3 3 5 5

15 solution) output1:2 3
output2:2 4

16 solution) 111

17 solution) 82

18 solution) segmentation fault

19 solution) 15

20 solution) (nil)

21 solution) It prints the lower case letters present in the input

22 solution) 3 1

23 solution) 12
concatinate(1,2)

24 solution) *1 -> replacing '<' with '+' in the declaration of the loop #include
int main(){
int n = 42;
for(int i = 0; i + n; i-- )
printf("-");
return 0;
}
* 2 -> replacing n with i in the declaration of the loop
#include
int main(){
int n = 42;
for(int i = 0; i <> adding a '-' before i in the comparison in for loop
#include
int main(){
int n = 42;
for(int i = 0; -i < href="http://placementsindia.blogspot.com/2007/10/c-programming-questions.html">

Modified Array based QuickSort with respect to the Partition Strategy

2008-07-24T08:50:00.000-07:00

Recall that the linked-list version of quicksort() puts all items whose keys are equal to the pivot's key into a third queue, which doesn't need to be sorted. This can save much time if there are many repeated keys.

The array-based version of quicksort() does not treat items with equal keys specially, so those items are sorted in the recursive calls.

Is it possible to modify array-based quicksort() so that the array is partitioned into three parts (keys less than pivot, keys equal to pivot, keys greater than pivot) while still being in-place? (The only memory you may use is the array plus a constant amount of additional memory.)

Why or why not?

Solution:In the first place,whatever I put here is only my approach to solve this problem and much better solution might exist.Now getting on to the solution..

In linked list implementation,we simply modify the pointers so that we end up with 3 lists.One list L1 to contain all the keys less than pivot ,one L2 with keys equal to the pivot and the other L3 with keys greater than pivot.Hence what we require is only an additional head pointer which points to this list L3 containing all elements equal to the pivot.SO we do not require any significant additional memory !!

But this is not the case with array implementation wherein we are confronted by difficulties arising from fixed size of array .If at all we want to maintain a list of keys equal to the pivot, then we need to maintain a separate array and also need to remove all those from the original array,which means a herder's task.

We will do it in much simpler way.Whenever,a duplicate entry of pivot is encountered by the left pointer,swap it with some element ,smaller than pivot and positioned to its left.Hence we move all the pivots encountered by the left pointer to the left extreme of the array. Similarly move all the pivots encountered by the right pointer to the right side of the array.
Now we have all the elements equal to the pivot on either extreme ends of the array.
In the middle,we have remaining 2 sub-arrays.Now the array looks like this
L2-left L1 L3 L2-right
Now get all these pivot elements in the left extreme (L2-left) to occupy the positions preceding L3 by swapping with those elements on the right portion of the first list L1.Similarly do swaps to get L2-right next to L2-Left by swapping its elements with those elements on the left portion of 3rd list L3.Now we have array in the form L1,L2,L3 where L2-left and L2-right are joined into one.

Now we can recursively sort L2-left and L2-right.

I am also putting the code of normal array based quicksort and this modified version ,so that once can verify it.

int leftpivotcounter=0; //global variable
int rightpivotcounter=0; //global variable
// these 2 are the only additional space used to accomplish the task in modified quicksort.

void swap(int *a,int *b)
{
int temp=*a;
*a=*b;
*b=temp;
}
void normal_quicksort(int *arr,int left,int right)
{
if(left>=right)
return;
else if(right-left==1)
{
if(arr[left]>arr[right])
swap(arr+left,arr+right);
}
else
{
swap(arr+(left+right)/2,arr+right);
int rpos=right,lpos=left;
int pivot=arr[right--];
while(left {
while(left left++;
while(right>=lpos &&arr[right]>=pivot )
right--;
if(left <=right )
{
swap(arr+left,arr+right);
}
else if (left > right )
{

swap(arr+right+1,arr+rpos);

partition(arr,lpos,right);
partition(arr,right+2,rpos);
break;
}

}
}
}

void modified_quicksort(int *arr,int left,int right)
{
if(left>=right)
return;
else if(right-left==1)
{
if(arr[left]>arr[right])
swap(arr+left,arr+right);
}
else
{
swap(arr+(left+right)/2,arr+right);
int rpos=right,lpos=left;
leftpivotcounter=lpos-1;
rightpivotcounter=rpos;
int pivot=arr[right--];
while(left {
while(left {
if(arr[left]==pivot)
{
leftpivotcounter++;
swap(arr+leftpivotcounter,arr+left);
}
left++;
}
while(right>=lpos &&arr[right]>=pivot )
{
if(arr[right]==pivot)
{
rightpivotcounter--;
swap(arr+rightpivotcounter,arr+right);
}
right--;
}
if(left <=right )
{
swap(arr+left,arr+right);
}
else if (left > right )
{
swap(arr+right+1,arr+rpos);
for(int i=0;(i+lpos<=leftpivotcounter) &&((2*i) {
swap(arr+lpos+i,arr+right-i);
}
for(int i=0;(rpos-i-1>=rightpivotcounter) && (rpos > right+3+2*i) ;i++)
{
swap(arr+rpos-1-i,arr+right+2+i);
}
partition(arr,lpos,right-(leftpivotcounter-lpos+1));
partition(arr,right+2+(rpos-rightpivotcounter),rpos);
break;
}

}
}
}

Last Non Zero Digit of Factorial

2008-07-24T08:49:00.000-07:00

Question Write a program that can compute the last non-zero digit of any factorial for ( 0 <= N <= 10000). For example, if your program is asked to compute the last nonzero digit of 5!, your program should produce 2 because 5! = 120, and 2 is the last nonzero digit of 120.

Solution:Well if one has thoroughly gone through the post,
the answer is easy to arrive at.Since the question asks only about the last non Zero digit,we need not bother about calculating the whole factorial and can just keep track of last nonzero digit by writing nonzerodigit(N)=nonzerodigit(N* nonzerodigit(N-1)).

Here follows the last nonzero digits of first 5 numbers.
N factorial Last Non Zero Digit

1! 1
2! nonzerodigit(2*1)=2
3! nonzerodigit(3*2)=6
4! nonzerodigit(4*6)=4
5! nonzerodigit(4*5)=2!!!(one gets zero if only the last digit is tracked)

So ,it should be clear the mere tracking of last digit is not enough but we need to track some K digits in each factorial.
So we track the last K digits of factorial of each number and store them in a vector V.
At the same time we want to have minimum K.
A brief thought would suggest that we should track of that many no of digits such that for all numbers <=1000 we should never encounter a 0 in V.

This means K is 1+ maximum no of zeros one would encounter in N! for N<=1000.

In this particular case K is 1+5 (maximum no of zeros is 5 since 5^5=3125 and 5^6>10000).

So track the last 6 digits of each of the factorials.Thus we arrived at the solution!!

Question If you have already solved the above problem, then give a generalized method to find the last X non-zero digits of N factorial

Solution:This question is similar to the above one except that we need to track X-1 more digits of N! .
so answer to this is X+No of zeros in N! factorial.

Quick Sort routine to find the kth smallest element in an array

2008-07-24T08:48:00.000-07:00

Question Describe an efficient algorithm based on Quicksort that will find the element of a set that would be at position k if the elements were sorted.

Solution:We make slight modifications to the quicksort routine to find the kth smallest element.Like in normal quicksort,we choose a pivot and partition the remaining array in to 2 sub arrays.At this stage,we have 3 possibilities.

1)the size of the first sub array is k-1 ,in which case pivot itself is the kth smallest.
2)the size of the first sub array is greater than k ,in which case kth smallest element is to be recursively searched in the first sub-array.

3)the size of the first sub array is less than k-1 ,in which case reuired element is to be recursively searched in the second sub-array.

Hence unlike quicksort where each problem gives rise to 2 subproblems,here each problem gives rise to only 1 sub problem.

Pseudo Code:

QuickSelect(Array A, n, k)
pivot = A [Random(1, n)]
X={x | x belongs to A and x <=pivot}
Y={x | x belongs to A and x >=pivot}
if size(X) = k
return pivot;
else if size(X) < k
return QuickSelect(Y,n-size(X)-1,k-size(X)-1);
else
return QuickSelect(X,size(X),k);

Run time Analysis of QuickSort ,Nature of Input,Pivot strategies

2008-07-24T08:45:00.000-07:00

Question Determine the running time of QuickSort for

a.Sorted input
b.reverse -ordered input
c.random input
d. When all the elements are equal

Solution:This solution is being written with the assumption that middle element of the array is chosen as the pivot.The answers differ based on the pivot selection as well.
a.Sorted input
In the case of sorted input,the left and right pointers of the sub arrays pass each other with out a single swap in all the iterations.The problem is divided in to 2 equal problems in all but the base case of unit size array.Hence the recurrence relation for this case is T(N)=2*T(N/2)+O(N).Hence the complexity in this case is O(NlogN).

b.reverse-ordered input

This case is identical to the previous case except that we have so many swaps in each iteration.The left and right pointers swap the content on each increment in their directions.This effects only the O(N) part of the recurrence relation that we have in the previous case.But as the swap is of complexity O(1), the complexity of each iteration remains the same.And the division of the array is still even.So the complexity doesn't change.Hence it is still O(NlogN)

c.Random Input
Well there are theorems asserting that the complexity of quicksort on a random input is O(NlogN).We will prove it by considering evenly the chances of even and worst splits.
let's consider that good and bad splits alternate in the iterations, with good splits in the best case (N/2) and bad ones in the worst (N-1).
So every two levels, the array's been cut in half,which means, it's still exponential reduction -- O(NlogN ).

d. When all the elements are equal

It is as good as the sorted array.So the complexity is O(NlogN).

Question The ones who are familiar with QuickSort might also be well aware of the important phase of the algorithm-the pivot selection.Suppose we always choose the middle element as the pivot .Does this make it unlikely that QuickSort will require quadratic time?

Solution:Choosing the middle element never makes it unlikey that the QuickSort will require quadratic time.One might encounter an input in which the middle element is always the maximum in all iterations.Then the complexity will be quadratic.

example:a={1,3,2} choosing 3 as pivot produces 2 subproblems , one of size 0 and other of size 2.In the next iteration,with out loss of generality take 2 as the pivot.It produces a sub array of size 1 and another of size 0.Thus an input can always be generated in such a way that QuickSort routine always gives rise to 2 subarrays,one of them being of size 0.Hence quadratic time is not always avoidable.

Question What is the worst-case behavior (number of comparisons) for quick sort?
Solution:As we have seen in the previous question,because of a bad pivot selection we might at the worst run in to quadratic time complexity.

Question In selecting the pivot for QuickSort, which is the best choice for optimal partitioning:
a.The first element of the array
b.The last element of the array
c.The middle element of the array
d.The largest element of the array
e.The median of the array
f.Any of the above

Solution:while the choices a,b,c will always not guarantee O(NlogN) complexity,choice d always gives quadratic run time.choice e guarantees even partition of the array.Hence it is the optimal partition.
hence the sol is e.

Question In its worst case QuickSort behaves like:
a.Bubble sort
b.Selection sort
c.Insertion sort
d.Bin sort

Solution:In the worst ,the pivot selected will always be the maximum element leading to quadratic time complexity.In this case as it depicts the behaviour of bubble sort,where in maximum element always bubbles to the end.

Tree Arithmetic

2008-07-24T08:44:00.000-07:00

1)If a tree has N nodes, then how many are the edges?

Solution:Every node has a parent except the root.Each edge associates a node with its child.So the number of edges are N-1.

2)Prove that there exists only a single path from each node to the root?
Solution:If there are more than 1 paths from a node to the root,it means there are more than 1 parents for one of the ancestors of the node concerned, which is impossible in a tree.

3)Prove that the depth of a tree is always equal to the height of the tree?

Solution: Height of a tree is the height of the root.Depth of a tree is the depth of the deepest node, which is the number of edges from root to it.This should also be the node which defines the height of the root,otherwise we end up with a contradiction.

4)The structure of a typical tree is to have in each node ,besides it data, a pointer to each of its children.But this might be infeasible if there aren’t fixed number of children at each node.So how do modify this data structure to accommodate variable no of children at each node?

Solution:Well the answer to this is child sibling relationship.

5)What are the maximum and minimum depths of a binary search tree?

Solution:In a binary tree of N nodes,the maximum depth is N-1 when it develops only on 1 side and the minimum is floor(log(N)).

6)How many are the no of null pointers for a binary tree of N nodes?

Solution: Total no of pointer=2*N. And each edge is associated with 1 pointer.
So the no of null pointer is 2*N-(N-1)=N+1 .

7)Distinguish inorder , preorder and postorder traversals properly?
Solution: Inorder traversal:Left subtree is first processed ,followed by root and then by right subtree.

Preorder: root is first processed followed by left and right subtrees.There is no order defined between left and right children.Essentially left and right subtrees are traversed only after the root is traversed.

Postorder:Left and right children are traversed before traversing root.

8)How is a binary tree different from binary search tree?

Solution:In Binary search tree, all the elements in the left subtree are <= root and all the elements in the right subtree are >= root,which is not the case with all the binary trees.

9)Recursive calls have always been employed in the case of trees because of their recursive structural property.But linked lists aren’t that different .But why recursion is not that advisable in the case of lists?(A little theoretical …. Think in terms of limited stack size of your machine)

Solution:The depth of a well built tree of N nodes is log(N).So recursive calls are affordable most of the times as stack overflow is seldom possible.But if recursive calls are employed for lists, then the order of recursive call stack size is N which
is not feasible for large N.

10)What are the complexities of insertion,deletion on a binary search tree?

Solution:Insertion in a well built binary search tree is O(logN) and so is the deletion.This is under assumption that depth of tree is O(logN).

11)Show that the maximum number of nodes in a binary tree of height H is 2^(H+1) -1

Solution:In a binary tree of height H ,with maximum number of nodes,all the levels should be completely filled.At depth d, the number of nodes should be 2^d.
Therefore, the total number of nodes =1+2+4+....+2^H=2^(H+1)-1.

Number of ways to express a number as summation of consecutive numbers

2008-07-24T08:43:00.000-07:00

Question.All the positive numbers can be expressed as a sum of one, two or more consecutive positive integers. For example 9 can be expressed in three such ways, 2+3+4, 4+5 or 9. Given an integer ,you will have to determine in how many ways that number can be expressed as summation of consecutive numbers.

Solution:
2+3+4=(1+2+3+4)-(1)
=(1+2+3+4+5)-(1+2+3)
=(1+2+3+4+5+6+7+8+9)-(1+2+3+4+5+6+7+8)

This shows that the no of solutions to this problem is the no of tuples (n,m) such that
given number K can be expressed as K=(1+2+..........+n)-(1+2+3+...........+m)
and n > m

i.e K=n*(n+1)/2 -m*(m+1)/2
=(n-m)(n+m+1)/2
2*k=(n-m)*(n+m+1)
If we put the factor n-m=p and (n+m+1)=q,we get S=2*k=p*q
As p+q=2*n+1 is odd and S is even either n-m is odd otherwise n+m+1 is odd.
This leaves out with finding out the no of odd divisors of S,which can be easily done using prime factorization.
if S=(2^p)*(3^q)*(5^r)*(7^s)......

then the solution is (q+1)*(r+1)*(s+1)*.. i.e the no of odd divisors of S.

Solutions to Logical Puzzles-2

2008-07-24T08:41:00.000-07:00

)3
It is of the form 0^2+2,1^2+2,3^2+2,6^2+2,10^2+2,.....
The sequence of n is 0,1,3,6,10,... so the next n is 15 => 15^2+2

2)2
The function is S(n)=S(n-1)*(n+2) + 3 ,n>1
=6 ,n=1

3)1
It is of the form S(n)*3+2 for even and S(n)*2-3 for odd where S(n) is the nth element.
So 7th element = 239*2-3=475

4)2
The function is S(n)=(n+2)^3 -2

5)1
The numbers in the sequence is a combination of n^2 and n^3 and n is odd.

6)2
The function is S(n)=S(n-1)*n-n n>1
=3 n=1

7)

8)1
The function is S(n)=(S(n-1)-1)*(n-1) n>1
=8 n=1

9)

10)

Combinations

2008-07-24T08:38:00.000-07:00

Question:Computing the exact number of ways that N things can be taken M at a time can be a great challenge when N and/or M become very large.So given 5<=N<=100 5<=M<=100 and M<=N.Compute the EXACT value of: N!/(M!*(N-M)!) The final value of C will fit in a 32-bit Pascal LongInt or a C long. So deduce an approach based on this assumption given.

Solution:At a mere glance,this problem may seem to have a direct solution,though it isn't upon a long thought.The naive approach to calculate combination of N things taken M at a time is obtained by mere application of formula,which mean finding N! ,M! and (N-M)! and the putting them in the expression.But as N and M are independently large enough for overflows to occur in N! and M! calculations.
One of the approaches to solve this problem,based on prime factorization can be formulated in the following manner.

Consider a prime P whose exponents in N!,M! and (N-M)! are p1,p2 and p3 respectively.

therefore the exponent of P in N!/M!*(N-M)! is p1+p2-p3.

This way we can store the exponents of all primes <= the largest prime which divides N.

One this is done ,we can merely multiply all these primes each raised to its exponent to get the required answer.

Now getting on to the tricky part of finding the exponent of a prime P in N!

In general ,if P is any prime,then the no of P's in N! is given by
Sum (floor(n/P^i)) for P^i <= N This apparently weird formula can be explained with ease!! consider the numbers 1,2,3,.........,,N.Every Pth number is divisible by P.So all those multiples of P put together contribute floor(N/P) to the power of P. Similarly every P^2th number is divisible by P^2.And each of them have already contributed 1 to power of P in previous iteration,as each of them are divisible by P.So each of them contribute an additional 1, which means they all together contribute floor(N/P^2) to the already sum. These terms of contribution go on till we have P^i <= N,hence the summation Sum (floor(N/P^i)) for P^i <= N The Cpp implementation of above task is given below

#include
using namespace std;
#include
#include
#include
#include
typedef vector powers;
void insert(vector &P,int i,vector V,int size)
{
vector temp=P[i-1];
//calculation of exponent of each prime
for(int j=0;j {
while(i%V[j]==0)
{
temp[j]++;
i/=V[j];
}
}
P.push_back(temp);
}
int main()
{
vector V;
vector P;
V.push_back(2);
bool flag;
int N,R;
for(int i=3;i<100;i+=2)
{
flag=true;
for(int j=0;V[j]*V[j] <=i;j++)
{
if(i%V[j]==0)
{
flag=false;
break;
}
}
if(flag)
{
V.push_back(i);
}
}
int size=V.size();
vector temp(size,0);
P.push_back(temp);
P.push_back(temp);
for(int i=2;i<=100;i++)
{
insert(P,i,V,size);
}
while(cin >> N >>R)
{
if(N==0 && R==0)
{
return(0);
}
else
{
long sol=1;
for(int i=0;i {

sol*=(long)pow((double)V[i],P[N][i]-P[R][i]
-P[N-R][i]); //Pi^(p1-p2-p3)
}
cout< "< "<

}

}
return(0);
}

Solutions to Basic C Interview Questions

2008-07-24T08:37:00.000-07:00

Click here for the questions>

1)To check for it, create two pointers,and set each to the start of the list. Update each as follows:

while (pointer1) {
pointer1 = pointer1->next;
pointer2 = pointer2->next;
if (pointer2) pointer2=pointer2->next;
if (pointer1 == pointer2) {
print ("circular linked list\n");
}
}

2)Union x : 1101791232 21.500000
Union y : 100 d 0.000000

3)It is an object of some class whose purpose is to indicate that a real object of that class does not exist. One common use for a null object is a return value from a member function that is supposed to return an object with some specified properties but cannot find such an object.

4) Java,Smalltalk,Eiffel,Sather.

5)A container class is a class that is used to hold objects in memory or
external storage. A container class acts as a generic holder. A
container class has a predefined behavior and a well-known interface. A
container class is a supporting class whose purpose is to hide the
topology used for maintaining the list of objects in memory. When a
container class contains a group of mixed objects, the container is
called a heterogeneous container; when the container is holding a group
of objects that are all the same, the container is called a homogeneous
container.

6)fffffff0

7)C was the C++ predecessor. As it's name implies, a lot of C remains in C++. Although not actually being more powerful than C, C++ allows the programmer to more easily manage and operate with Objects, using an OOP (Object Oriented Programming) concept.

C++ allows the programmer to create classes, which are somewhat similar to C structures. However, to a class can be assigned methods, functions associated to it, of various prototypes, which can access and operate within the class, somewhat like C functions often operate on a supplied handler pointer.

Although it is possible to implement anything which C++ could implement in C, C++ aids to standarize a way in which objects are created and managed, whereas the C programmer who implements the same system has a lot of liberty on how to actually implement the internals, and style among programmers will vary a lot on the design choices made.

In C, some will prefer the handler-type, where a main function initializes a handler, and that handler can be supplied to other functions of the library as an object to operate on/through. Others will even want to have that handler link all the related function pointers within it which then must be called using a convention closer to C++.

To finish this discussion, C++ applications are generally slower at runtime, and are much slower to compile than C programs. The low-level infrastructure for C++ binary execution is also larger. For these reasons C is always commonly used even if C++ has alot of popularity, and will probably continue to be used in projects where size and speed are primary concerns, and portable code still required (assembly would be unsuitable then).

8)Incomplete types
refers to pointers in which there is non availability of the
implementation of the referenced location or it points to some location
whose value is not available for modification.

int *i=0x400 // i points to address 400
*i=0; //set the value of memory location pointed by i.

9)Printf : Call by value
Scanf : Call by reference

10)a const pointer means the pointer which represents the address of one value. so if you declare a pointer inside the function, it doesn't have scope outside the function. if it is also available to the outside function whenever we declare a pointer as const.

11)Type casting must be done wheneever the data type of the variable to which u r gonna assign some values is diff from the data type of the variable on the right side.

for instance;

float f;
int i = 10 , j = 5 ;

f = (float) ( i / j ) ;

f -------> left side variable.
i -------> right side variable.

but always make sure that the size of the var on the left is greater than that of the right. else there will be data loss.

A type cast should not be used to override a const or volatile declaration. Overriding these type modifiers can cause the program to fail to run correctly.
A type cast should not be used to turn a pointer to one type of structure or data type into another. In the
rare events in which this action is beneficial, using a union to hold the values makes the programmer.s
intentions clearer.

12)he answer is the standard library function qsort(). It.s the easiest sort by far for several reasons:
It is already written.
It is already debugged.
It has been optimized as much as possible (usually).
Void qsort(void *buf, size_t num, size_t size, int (*comp)(const void *ele1, const void *ele2));

13)The answer depends on what you mean by quickest. For most sorting problems, it just doesn't matter how quick the sort is because it is done infrequently or other operations take significantly more time anyway. Even in cases in which sorting speed is of the essence, there is no one answer. It depends on not only the size and nature of the data, but also the likely order. No algorithm is best in all cases.
There are three sorting methods in this author.s .toolbox. that are all very fast and that are useful in different situations. Those methods are quick sort, merge sort, and radix sort.

The Quick Sort
The quick sort algorithm is of the .divide and conquer. type. That means it works by reducing a sorting
problem into several easier sorting problems and solving each of them. A .dividing. value is chosen from the input data, and the data is partitioned into three sets: elements that belong before the dividing value, the value itself, and elements that come after the dividing value. The partitioning is performed by exchanging elements that are in the first set but belong in the third with elements that are in the third set but belong in the first Elements that are equal to the dividing element can be put in any of the three sets.the algorithm will still work properly.

The Merge Sort
The merge sort is a .divide and conquer. sort as well. It works by considering the data to be sorted as a
sequence of already-sorted lists (in the worst case, each list is one element long). Adjacent sorted lists are merged into larger sorted lists until there is a single sorted list containing all the elements. The merge sort is good at sorting lists and other data structures that are not in arrays, and it can be used to sort things that don.t fit into memory. It also can be implemented as a stable sort.

The Radix Sort
The radix sort takes a list of integers and puts each element on a smaller list, depending on the value of its least significant byte. Then the small lists are concatenated, and the process is repeated for each more significant byte until the list is sorted. The radix sort is simpler to implement on fixed-length data such as ints.

14)Both the merge sort and the radix sort are good sorting algorithms to use for linked lists.

15)The preprocessor is used to modify your program according to the preprocessor directives in your source code. Preprocessor directives (such as #define) give the preprocessor specific instructions on how to modify your source code. The preprocessor reads in all of your include files and the source code you are compiling and creates a preprocessed version of your source code. This preprocessed version has all of its macros and constant symbols replaced by their corresponding code and value assignments. If your source code contains any conditional preprocessor directives (such as #if), the preprocessor evaluates the condition and modifies your source code accordingly.
The C preprocessor is used to modify your program according to the preprocessor directives in your source code. A preprocessor directive is a statement (such as #define) that gives the preprocessor specific instructions on how to modify your source code. The preprocessor is invoked as the first part of your compiler program.s compilation step. It is usually hidden from the programmer because it is run automatically by the compiler.

16)The standard C library provides several functions for converting strings to numbers of all formats (integers, longs, floats, and so on) and vice versa.

The following functions can be used to convert strings to numbers:
Function Name Purpose
atof() Converts a string to a double-precision floating-point value.
atoi() Converts a string to an integer.
atol() Converts a string to a long integer.
strtod() Converts a string to a double-precision floating-point value and reports any .leftover. numbers that could not be converted.
strtol() Converts a string to a long integer and reports any .leftover. numbers that could not be converted.
strtoul() Converts a string to an unsigned long integer and reports any .leftover. numbers that could not be converted.

17)
The standard C library provides several functions for converting numbers of all formats (integers, longs, floats, and so on) to strings and vice versa

The following functions can be used to convert integers to strings:
Function Name Purpose
itoa() Converts an integer value to a string.
ltoa() Converts a long integer value to a string.
ultoa() Converts an unsigned long integer value to a string.

The following functions can be used to convert floating-point values to strings:
Function Name Purpose
ecvt() Converts a double-precision floating-point value to a string without an embedded decimal point.
fcvt() Same as ecvt(), but forces the precision to a specified number of digits.
gcvt() Converts a double-precision floating-point value to a string with an embedded decimal point.

18)The heap is where malloc(), calloc(), and realloc() get memory.
Getting memory from the heap is much slower than getting it from the stack. On the other hand, the heap
is much more flexible than the stack. Memory can be allocated at any time and deallocated in any order. Such
memory isn't deallocated automatically; you have to call free().
Recursive data structures are almost always implemented with memory from the heap. Strings often come
from there too, especially strings that could be very long at runtime. If you can keep data in a local variable (and allocate it from the stack), your code will run faster than if you put the data on the heap. Sometimes you can use a better algorithm if you use the heap.faster, or more robust, or more flexible. It's a tradeoff.
If memory is allocated from the heap, it.s available until the program ends. That's great if you remember to deallocate it when you.re done.

19)n++ takes more than one instruction, ++n is faster. n++ has to store n, increment the variable and return n, while ++n increment n and return without storing the previous value of n.

20) If a program is large, it is subdivided into a number of smaller programs that are called modules or subprograms. If a complex problem is solved using more modules, this approach is known as modular programming.

21)expression if (a=0) always return false
expression if (a=1) always return true

22)Malloc is dynamic memory allocation,it allocates the memory and initialize garbage value.Calloc is similar to malloc but only difference is initialize zero

23)A middle level language

24)Overloading is polymorphism which is one of the characteristics of Object oriented programming. C is not and object oriented language like C++ or Java. Therefore, no overloading, inheritance, etc.

25)Static int variable are accessed only inside the file where it is defined. Thus we can have same variable name in 2 files if the variable is defined as static. The scope of the variable is limited to the file in which it is defined.

On the other hand if the variable is not defined as static and defined globally then it can be accessed across the files. To access the variable which is global variable and declared and defined in file A, keyword "extern" is used in front of the variable in file B. This indicated to compiler while compiling that the variable is defined in some other file other than B and continues compiling and while linking the variable it search for the actual definition and links.

Solutions to Logical Puzzles-1

2008-07-24T08:34:00.000-07:00

Click here for the questions

We need 3 cuts to cut a cube into 6 equal pieces,with one cut in each dimension.Maximum identical pieces obtained with n cuts[if n is a factor of 3] = (n/3 + 1)^3, with n/3 cuts, we form n/3 + 1 equal pieces.If we need to get maximum number of identical cubes with some number of cuts then the number of cuts in all the dimensions should be equal if possible or almost equal.
The number of identical pieces formed with l,n,m cuts in the 3 demensions are (l+1)*(n+1)*(m+1).

1)3,Here there are 6,7,8 cuts in each dimension

2)2

3)4,Here the number of cuts are 7,7,6 in the 3 dimensions.

4)1

5)3

All the problems from 6-18 are based mostly on imagination.Note that 27 identical pieces have no color at all i.e they are inner pieces.

6)3

7)4

8)1

9)3

10)2

11)2

12)4

13)1

14)4

15)3

16)1

17)4

18)1

19)2

20)4

Solutions to Logical Puzzles-3

2008-07-24T08:33:00.000-07:00

Click here for the questions

1)

2)3,
The number obtained by dividing 48 with 4 is 12 which is even while all the others get odd number for the same.

3)4,
The sequence has to be AON,EWR,IEV,MMZ

4)2
The remaining 3 are input devices.

5)2
The remaining 3 represent an image.

6)3
Trousers can only take a plural form while others can also take a singular form.

7)

8)

9)4
All the other three lie inside a cell.

10)

11)4

12)3

13)1

14)2

15)3

16)3

17)1

18)3

19)3

20)4

C program to find the height of a binary search tree

2008-07-24T08:23:00.000-07:00

Question:Write a C program to find the depth or height of a binary tree

Solution:
#include

struct binarysearchtree
{
int data;
struct binarysearchtree* left;
struct binarysearchtree* right;
};
typedef struct binarysearchtree* tree;

int max(int a,int b)
{
if(a >=b)
return a;
else
return b;
}

int height(tree T)
{
if(T==NULL)
return 0;
else
{
int h1=height(T->left);
int h2=height(T->right);
return 1+max(h1,h2);
}
}

C program to determine the number of nodes in a binary tree

2008-07-24T08:21:00.000-07:00

Question:Write a C program to determine the number of elements(or size) in a binary tree?

Solution:

#include
struct binarysearchtree
{
int data;
struct binarysearchtree* left;
struct binarysearchtree* right;
};
typedef struct binarysearchtree* tree;

int tree_size(tree T)
{
if(T==NULL)
return 0;
else
{
return 1+tree_size(T->left)+tree_size(T->right);
}
}

C program to delete a tree

2008-07-24T08:19:00.000-07:00

Write a C program to delete a tree(i.e, free up its nodes)

#include
struct binarysearchtree
{
int data;
struct binarysearchtree* left;
struct binarysearchtree* right;
};
typedef struct binarysearchtree* tree;

void tree_free(tree T)
{
if (T==NULL)
return;
else
{
tree_free(T->left);
tree_free(T->right);
free(T);
}
}

Minimum Value of a Binary Search Tree

2008-07-24T08:18:00.000-07:00

Question:Write a C program to find the minimum value in a binary search tree.

Solution:

#include
struct binarysearchtree
{
int data;
struct binarysearchtree* left;
struct binarysearchtree* right;
};
typedef struct binarysearchtree* tree;

tree min(tree T)
{
if (T==NULL)
return NULL;
else
{
if(T->left==NULL)
return T;
else
return min(T->left);
}
}

Solutions to Questions on recursion

2008-07-24T08:15:00.000-07:00

Click here for the questions

1)
int Fibinocci(int n)
{
if(n==1)
return 1;
else
n+Fibinocci(n-1);
}

2)
void reverse(char*str)
{
if(*str != '\0')
reverse(str+1);
}

3)
int Factorial(int n)
{
if(n==1)
return 1;
else
return(n*Factorial(n-1);
}

4)
void MoveTower(int disk, int source, int dest, int spare):
{
if(disk == 1)
printf("Move top disc from %d to %d\n",source,desc);
else
{
MoveTower(disk - 1, source, spare, dest);
printf("Move top disc from %d to %d\n",source,desc);
// Step 2
MoveTower(disk - 1, spare, dest, source);
}
}

5)
int gcd(int a,int b)
{
if(b==0)
return(a);
else
return(gcd(b,a(mod)b);
}

6)
arr is an array containing N integers.You can also change the program by keeping characters.k is initially 0.

void permutation(int *arr, int N, int k)
{
static level = -1;
level = level+1;
arr[k] = level;

if (level == N)
{
if(arr!=0)
for(int i=0; i < N;i++)
printf("%d",arr[i]);
}
else
for (int i = 0; i < N; i++)
if (arr[i] == 0)
permutation(arr, N, i);
level = level-1;
arr[k] = 0;
}

7)void combinations(char*str,int no)
{
int temp1=0;
int i,count,n=1,num,len;

for(i=0;*(str+i)!='\0';i++);
len=i;

for(i=0;i < len;i++)
n=2*n;
temp=(int*)malloc(len*sizeof(int));
for(i=0;i < len;i++)
*(temp+i)=0;
for(num=0;num <= n;num=num+1)
{
temp1=num;
for(i=0;i < len;i++)
{
*(temp+i) = temp1%2;
temp1=temp1/2;
}
count=0;
for(i=0;i < len;i++)
{
if(*(temp+i)==1)
count++;
}
if(count==no)
{
for(i=0;i < len;i++)
{
if(*(temp+i)==1)
printf("%c",*(str+i));
}
printf("\n");

}
}

8)
Mergesort:a is an array of n intergers,temp is just a temporary array.low is initially 0 and high is n-1.

void mergesort(int *a,int *temp,int low,int hi)
{
int mid;
if(hi==low)
{
return;
}
else
{
mid=(low+hi)/2;
mergesort(a,temp,low,mid);
printf("1\n");
mergesort(a,temp,mid+1,hi);
printf("2\n");
merge(a,temp,low,mid+1,hi);
}
}

void merge(int a[],int temp[],int left,int rig,int r)
{
printf("%d %d %d\n",left,rig,r);
int i,l,n,k;
l=rig-1;
k=left;
n=r-left+1;
while(left<=l&&rig<=r)
{
if(a[left]<=a[rig])
temp[k++]=a[left++];
else
temp[k++]=a[rig++];
}
while(left<=l)
temp[k++]=a[left++];
while(rig<=r)
temp[k++]=a[rig++];
for(i=0;i < n;i++,r--)
a[r]=temp[r];
}

Quicksort:a is an array of n integers.left is initially 0 and right is n-1.

void quick(int *a, int left, int right)
{
int temp,i,k;
temp=left;
if (left>=right)
{
return;
}

k=(left+right)/2;
swap(a,left,k);
for (i=left+1;i<=right;i++)
{
if (a[i] < a[left])
{
swap(a,++temp,i);
}
}

swap(a,left,temp); //swap a[left] and a[temp]
quick(a,left,temp-1);
quick(a,temp+1,right);
}

C program to create mirror copy of a tree

2008-07-24T08:09:00.000-07:00

Question:Write a C program to create a mirror copy of a tree left nodes become right and right nodes become left)

Solution:

#include
struct binarysearchtree{
int data;
struct binarysearchtree* left;
struct binarysearchtree* right;
};
typedef struct binarysearchtree* tree;

tree mirror_copy(tree T)
{
if(T==NULL)
return T;
else
{
tree temp1=mirror_copy(T->left);
tree temp2=mirror_copy(T->right);
T->left=temp2;
T->right=temp1;
return T;
}
}

Solutions to Amazon Intern Interview Questions

2008-07-24T08:06:00.000-07:00

Click here for the questions

1)Place a red ball in a urn and all the further balls in the other urn.The probability for picking out the red ball is now greater than 0.5.

2)If v<=2V then the position is (v*L)/(2*V) from the starting point else it is 2*L -(v*L)/(2*V) from the starting point.

4)If we know the process then we can kill it by killall -9 "process name" else we can kill it using its process id obtained by the command ps -x by kill -9 "processid" .

5)Top command displays all the Linux tasks running at that particular time.It provides their running time and the resources used.

6)The number appearing 2 times is (sum of all the numbers in the array) - (sum of the numbers from 1 to n).
For floating numbers multiply it with 100 and proceed.

Traversals of a Binary Tree

2008-07-24T08:03:00.000-07:00

Write C code to implement the preorder(), inorder() and postorder() traversals. Whats their time complexities?

#include
struct binarysearchtree{
int data;
struct binarysearchtree* left;
struct binarysearchtree* right;
};
typedef struct binarysearchtree* tree;

void inorder_print(tree T)
{
if (T!=NULL)
{
printf("%d\n",T->data);
inorder_print(T->left);
inorder_print(T->right);
}
}

void postorder_print(tree T)
{
if (T==NULL)
{
return;
}
postorder_print(T->left);
postorder_print(T->right);
printf("%d\n",T->data);
}

void preorder_print(tree T)
{
if (T==NULL)
{
return;
}
printf("%d\n",T->data);
preorder_print(T->left);
preorder_print(T->right);

}

Each of them traverse all the nodes.
So the complexity is O(N).

Solutions to Google Top Interview Puzzles

2008-07-24T08:01:00.000-07:00

Solutions to problems in recursion analysis

2008-07-24T08:00:00.000-07:00

# Using the substitution method, we substitute the function recursively till we arrive at T(1).
i.e T(n)=T(n/2) + 1 = T(n/4) + 1 + 1 = ....

We get a total of lg(n) iterations
i.e T(n)=T(1) +lg(n)

Thus the complexity is O(lg n).

# Similar to the 1st problem, it takes lg(n) iterations to reach T(1).After final iteration:

T(n)=(2^lg(n))*(T(1) + lg(n)*17)

Thus the complexity is (2^lg(n))*(lg n) = n*lg(n)

# Let n=2^m,then T(2^m)=2*T(2^m/2) + 1
Now let S(m)=T(2^m).
=>S(m)=2*S(m/2) +1

This is the same as 2nd problem.
Thus the complexity is O(m*lg(m)),but m=lg(n)

Thus the final complexity is O(lg(n)*lg(lg(n)))