0% found this document useful (0 votes)
17 views3 pages

Interviewwipro

Uploaded by

pavanibanothu573
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
17 views3 pages

Interviewwipro

Uploaded by

pavanibanothu573
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 3

Technical Wipro Interview Questions

In this section, we will discuss the technical Wipro interview questions and
answers.

Q1. Why is macro faster than functions in the C programming language?


Ans. The execution of Macro is faster than function because, in function, more time
is used for taking control from function call to called function. More time is
spent in the process. In the case of macro, expressions are directly replaced in
the source code.

Q2. Explain precondition and postcondition to the member function in context of C+


+.
Ans. Precondition is a condition that needs to be met before a member function may
be called. When preconditions are not false, class is appropriately used. If the
precondition fails to hold, then the following function is not executed. Let us
consider an example. Before inserting an element into the stack, we will call the
isfull() to check whether the stack is full or not.

A postcondition is a condition that must always be true after the execution of a


part of code or after an operation in the formal specification. These are tested
sometimes using assertions within the code itself. Postconditions must never be
false to correctly implement the code. For example, isempty() must hold after
placing an element onto a stack. This is a push operation postcondition.

Q3. Explain Stack Unwinding in C++.


Ans. Stack unwinding is the elimination of function entries from the function call
stack during runtime. When an exception occurs in C++, there is a linear search in
the function call stack for the exception handler. Any entries before the function
with the exception handler will be deleted from the function call stack. In case
the exception is not handled in the same code, stack unwinding is needed.

Check out top C++ interview questions

Q4. State the advantages of time slicing in the CPU Scheduling in OS?
Ans. Time slicing is a feature that allows a task to run for a fixed time before
returning to a set of ready tasks. The scheduler determines executable jobs based
on priority and several other factors. The advantages of time slicing include:

The kernel of CPUs does not simply allocate every resource to a single task. It
equally prioritizes all processes. The CPU accomplishes it by running processes
slice by slice. A time slice is the brief period of time allotted to a process that
is executed by the CPU.
It can be very easily integrated into the system.
After a process is run for a fixed time, another process runs for the same amount
of time. To save the state of these preempted processes, the context switching
approach is utilised. This prevents losing the states of preempted processes.
Q5. State the advantages of indexing in DBMS.
Ans. Indexing in DBMS is a technique to improve database performance by reducing
the number of disc access that is required needed when a query is run. It is a data
structure strategy to quickly find and access data in a database. In terms of
advantages, it allows quick retrieval of data.

There is a dramatic improvement in performance whenever an index is used in a query

It is good for sorting. With indexing, the requirement for the post-fetch-sort
procedure can be eliminated. Indexing ensures that each record is uniquely
identified in the database.

Q6. What are the types of Shells in Linux?


Ans. There are different types of Shells including:

C Shell: It includes aliases and command history. It consists of features such as


built-in math and C-like expression syntax. This makes programming easier.
The Bourne Shell: It is the first UNIX shell which is convenient and faster.
Solaris operating system uses it as the default shell.
GNU Bourne-Again Shell: This shell can be used with the Bourne shell and includes
the features of Korn and Bourne shell.
The Korn Shell: The Bourne shell is the subset of Korn shell. This shell supports
everything in the Bourne shell. The shell includes interactive elements such as
built-in arithmetic and C-like arrays, string manipulation facilities, etc. It is
more efficient than C shell and works with scripts that are written in the C shell.
Check out top Linux interview questions

Q7. List some of the functionalities of EUCALYPTUS in cloud computing.


Ans. Eucalyptus is open-source software that is used for creating private and
hybrid cloud computing environments that are compatible with AWS.

With Eucalyptus, users can configure the network, and storage resources through the
Eucalyptus User Console. It can run virtual machine images such as Windows and
Linux. It supports storage area network devices and direct-attached storage.
The maintenance mode of Eucalyptus 3.3 allows cloud managers to do maintenance on
Eucalyptus clouds without any interruption to instances and cloud applications.
Eucalyptus 3.4 offers warm upgrade capabilities, better image management and
migrating tools as well as Identity and Access Management (IAM) roles.
Q8. What is the difference between DDL and DML commands in DBMS?
Ans. DDL is the data definition language that is used for defining data structures.
Through DDL, you can create a database scheme and can define constraints. DML is
the data manipulation language that is used for manipulating data. It is used for
adding, updating and retrieving the data. CREATE, DROP, RENAME and ALTER are some
of the basic commands in DDL. UPDATE, INSERT and MERGE are some of the basic
commands in DML.

Q9. Explain the Project Management Life Cycle.


Ans. The Project Management Life Cycle is a set of activities that must be
completed to achieve project objectives. Through this cycle, you can streamline the
efforts that are required to complete the project successfully. The Project
Management Life Cycle is completed into four simple phases:

Initiation: It is the first stage of the project’s life cycle. In this phase, we
determine the project’s initial scope and allocate resources.
Planning: At this stage, you need to gather details for the project to plan time,
cost, and resources. The amount of work required is also calculated to effectively
manages risk.
Execution: This step will involve processes to complete the project management
plan’s work. It includes monitoring, assessing, and regulating the progress of the
project. At this stage, you will be required to recognize issues in the project and
take necessary action.
Closure: At this stage, the aim will be the completion of all project activities,
disbanding the project team and closing the project with the customer through a
closure report.
Q10. What is Local storage in HTML 5?
Ans. Local storage is the type of HTML 5 offline storage that allows the user
string data to be save synchronously in the browser. It uses localStorage object
for storing data for the entire website on a permanent basis. This means that
stored local data will be available until you remove it.

Q11. Explain memory management in C.


Ans. The C language statically, automatically, or dynamically manage memory.
A static-duration variable is allocated in the main memory along with the
executable code of a program. It persists for the lifetime of a program

An automatic duration variables is allocated on the stack. It comes and goes as the
functions are called and returned.

For a static-duration and automatic-duration variable, the size of allocation is


needed to be compile-time constant.

Dynamic memory allocation is where memory is more explicitly and flexibly managed
by allocating it from the heap. It is an area of memory structured for this
purpose.

In C, the library function malloc allocates a block of memory on the heap. This
program accesses the block of memory through a pointer that the malloc returns.
When this memory is no longer needed, pointer is passed to free that deallocates
the memory and be used for other purposes.

Explore free C courses

Recently completed any professional course/certification from the market? Tell us


what liked or disliked in the course for more curated content.

You might also like