Showing posts with label 2011 bpo aptitude questions. Show all posts
Showing posts with label 2011 bpo aptitude questions. Show all posts

Friday, February 12, 2016

Betty White’s Deadpool Review Is Hilarious

"I give it four Golden Girls. It's the best picture of the year"

Betty White’s seemingly innocent review of Deadpool is not quite what you would expect from everyones’ favorite Golden Girl.
The Marvel film, starring Ryan Reynolds, is described by White as something the whole family would love, before she launches in an explicit breakdown of the film.
“Plus, Ryan Reynolds looks so f—ing handsome in his red leather suit. I give it four Golden Girls. It’s the best picture of the year”White says as she sits on a Deadpool-themed throne

Monday, July 16, 2012

LINK LIST IN DATA STRUCTURE

LINK LIST IN DATA STRUCTURE



Linked list is the most basic form of a data structure. A linked list is more or less similar to an array in that it can hold a list of values. But the similarity ceases here. The major difference between a linked list and array is that an array can hold values belonging to the same data type only whereas there is no such restriction on a linked list. For example, if an array is declared with type as int in C language, it can hold only integer values. Coming to a linked list, as it is a data structure, there is seldom any type associated with it. Apart from the above difference, there is one more difference that makes linked lists more versatile. It is not only possible to create linear linked lists but also circular linked lists i.e., the last element of the list can be made to point to the first. Another difference is that the memory to be allocated to a linked list can be specified dynamically i.e., we need not mention the number of elements in the linked list at the time of compilation. This facility may also be available for arrays in some languages but is not widely used. The most basic form of a linked list is created by creating a structure with one data element and a pointer to point to the next element in the data structure. The pointer of the last element is intialised to null to avoid it to point to some junk value if its a linear linked list. On the contrary, if it is a circular linked list, the pointer of the last element is made to point to the first element in the list. The above type of list allows traversing in only one direction. If we want bi-directional traversal, then we can create a structure with two pointers where one pointer is made to point to the previous element and the other point to the next element in the list. Modifications are made as stated above for a simple linked list to convert this to a circular list. Accordingly the above two types of lists are sometimes called single linked list and double linked list. Instead of using a single data element, we can use any number of data elements with several different data types within the structure. We may also use arrays as data elements of the linked list. An element in a linked list is often called a node. It is possible to add/delete nodes from any position within the linked list. According to the operation selected, the pointers need to be updated appropriately. Giving a C program to create a linked list would make this response too big as the programs to create linked lists often run more than hundred lines. Nevertheless, they are simple and can be easily understood once the concept is known. For further information and programs, you can refer to standard text books like Data

The link list in computer data structure program consists of sequence of data records with reference data field in each record in order to link each data record to the subsequent data field.
The link list grows when data is added and shrinks when data is deleted in the list. Hence link list is known as dynamic data structure in conjunction with dynamic memory management techniques.
Link list in data structure have flexibility in adding, deleting or rearranging data at run time permitting additional memory space and releasing unused memory space in order to optimum use of storage space.



Linked List is a complex dynamic data structure which contains of nodes having two parts data and next. Next is just a pointer pointing to the next node in the list. If the list is empty next just point ot NULL. There are different types of linked list namely Singly, Doubly and Circular. Singly Linked List is the list which can be traversed in one direction only and whose last last node of the list points to NULL. Doubly Linked list has two pointers PREV and NEXT.This list can be traversed in both the directions. PREV of the first node of doubly linked list always points to NULL and also the NEXT of last node points to NULL. Circular Linked List is the one whose last node points to the first instead of to the NULL. The different operations that can be performed on list are. INSERT:- We can dynamically insert any node at any desired position into the list. DELETE:- Similar to insertion, deletion can also be accomplished dynamically. TRAVERSE:- Traversing is just trvelling through the list visiting each node. As each thing has pros and cons, the only drawback of linked list is randomly accessing of element which can be achieved through array index in array but not in linked list.The good thing about linked list is its run­time expand­abil­ity which proves its flexibility.

Linked List is a Data storage mechanism in which list of data is stored in linear order. Linked list contains collection of nodes, each node contains data part and address part in which the next node address is stored. Each node in link list contains address of next node except the last node because last node contains the NULL pointer which indicates the end of list. Linked list has following types: 1. Singly Link List 2. Doubly Link List 3. Circular Link List
Link list data structure is created using the Structure of C as given below: struct list { int data; struct list *next; }; The dynamic node is created using malloc() and calloc() functions available in C language and new operator is used in case of C++. The following Operation can be performed on link list: 1.Insert element 2.Delete Element 3.Find Sum of All elements 4.Count number of node in list 5.Search any element 6.Reverse the list 7.Make copy of list 8.Merger two list 9.Update element Link list is widely used by various real life applications.

Linked List is basically a linear list of Elements which are linked to one another with some means of links, and hence it is known as linked list.

Each element in the list is known as Node.
And each node in the have at least two parts:-
1. Data Part
2. Link part

Data Part:- This part of every node of the list contains the information stored in that node of the list

Link Part:- This part of the node contains the memory address of the next node in the linked list.

For Example:Implementation of linked list node in C Language

Struct Node
{
int RollNo;//Data Part
int Marks;//Data Part
struct Node *link;//Address of the next Node
}; 

Note that the linked list contains a special node called the START which contains the address of the first node in the linked list.

if START == NULL
then it means that the linked list is Empty.


Linked List is a structure in data structures having a number of nodes that stores information as well as the pointer field that points to the next record to be processed. The pointer is basically a address that is used to access the next information part within a linked list. The last pointer field is filled using NULL character means there is no way further. So, it indicates the end of the linked list. Various algorithms are there to insert or delete nodes in a linked list.
It may be:

Insert element at the starting of linked list,
Insert element at the end of linked list,
Insert element at the middle of linked list,
Delete element at the starting of linked list,
Delete element at the end of linked list,
Delete element at the middle of linked list,


linked list a data structure which stores data in the form of nodes.It does not require linear memory as arrays. Each node contains a data part and a pointer part(a pointer to the next data in the list)

link or node is object of a class.there are so many types of linked list 1) single linked list
2)doubly linked list 
3)circular linked list.

single linked list:
here links contains pointer to first data and last data in the list.As said earlier a pointer to the next data.
example of a linked list:


class node{// all nodes will be the objects of this class
public int data;
public link next_node;//a pointer to next data
}
public node(int data){
this.data=data;
}//end of constructor
public void showdata(){
System.out.println("data= "+data);
}
}//end of class node

After defining class for each node we need to define a class for link list. Link list contains a pointer to the first node in the list,Which should be initialized to null in the beginning. All the operations to be performed on the link list is defined as functions in this class. For example insert first,Delete,insert search etc.



class linkedlist{
private node first_node;//pointer to the first node is defined
public linkedlist(){
first_node=null;
}
public void add_DAta(int data1){
//create newnode in the memory and store data
node newnode= new node(data1);
//initially first data is null 
//set the current first as the next node of the new node
newnode.next_node=first;
//set newnode as the first node
first_node=newnode;
}
}//end of class


Doubly link list:
This allows us to traverse backward and forward through the list . Here this a pointer to previous node i.e the class node in our example will have one more pointer to the previous node.
There is pointer to the last node in the list i.e class linkedlist contains pointer to last node in the list.
Circular linklist:
As the name indicate we can traversethe list i circular fashion that from first node to last node and back to firat node in the same direction. Last node will have a pointer to first node.

Friday, September 23, 2011

The Top IT Company Solved Placement Papers 1

Interior of Ben Hill Griffin Stadium, also kno...Image via Wikipedia4 Sample CTS Type Interview Questions

Dear Reader, In CTS interviews, you can expect to be quizzed on conceptual questions. Below are four sample questions for your practice.

Interview Question 1

How inline functions are interpreted by the compilers ? What could be the main use ?

Answer 1

When inline functions are used compilers are expected to expand the function in every place of call. This approach saves time when there are lots of function calls.

Interview Question 2

Which among the following is preferred for embedded applications, microprocessors or microcontroller?

Answer 2

Microcontrollers are used for embedded applications.

Interview Question 3

In SDLC, what is black box testing (which comes under testing phase) ?

Answer 3

Black box testing is nothing but testing the actual functionality of a module/program at a high level. Here one may test different outputs for different sets of inputs. Also the one may not worry about the module/program internals under testing.

Interview Question 4

In SDLC, which is the testing phase that takes care that client requirements are actually met after installing the application on the site ?

Answer 4

UAT or User Acceptance Testing is the concerned testing phase.

Dear CV Reader, Are You Preparing Seriously For Your Placement Tests ?


3 TCS Sample Networks Related Interview Questions


Dear Reader, you can always expect questions from computer networks.Below are three sample Interview Questions.

Question 1

Which is the protocol used for communication between network managing computer and all other computers or devices within the same network ? Hint : This is an application layer level (in OSI) protocol.

Answer 1

Answer is SNMP - Simple Network Management Protocol.

Question 2

Say there are two similar programs installed on Unix and Windows systems in a network. If these programs require data to be passed back and forth across the network, Which of the OSI layers will be responsible for handling platform differences ? Hint : This layer is also capable of inclusion of encryption services.

Answer 2

Answer is Presentation Layer.

Question 3

Name a simple protocol that is very widely used in measuring time taken for a server to respond to a request in network ? Hint : With this protocol one can check if a remote server is actually connected/active.

Answer 3

Answer is Ping Protocol.

Dear CV Reader, Are You Preparing Seriously For Your Placement Tests ?


CTS 3 Sample Sequences Questions

In CTS you can expect few questions from sequences. Though generally easy to crack, these questions require good concentration on your part, else could get tricky.

Placement Question 1

Find the next pair in the sequence - AB CA FB JA

Options : 1) OB 2) OC 3) NA 4) NB

Answer 1

Answer is option 1) OB.

Reason.

Consider the first terms of the sequence A,C,F,J... Here C is one next A, F is two next C, J is three next F and so on. Hence next alphabet would be O (which is four next J). Consider second terms B,A,B,A... Hence this is an alternating sequence of Bs and As. Hence next alphabet would be B.

Based on the above two statements, the answer is OB.

Placement Question 2

Find the next pair of alphabets in the sequence - AB EC ID OE

Options : 1) LF 2) UF 3) UG 4) LE

Answer 2

Answer is option 2) UF.

Reason.

Consider the first terms of the sequence A,E,I,0... Have you seen this somewhere ? :). Yes, this is our good old sequence of vowels. Hence next vowel would be U.

Consider second terms B,C,D,E... This is a plain sequence of alphabets in order. Hence next one would be F. Combining above two statements answer is UF.

Placement Question 3

(Easy Question) Find the next alphabet in the sequence... A,Z,B,Y,_,X ?

Options : 1) D 2) C 3) F 4) G

Answer 3

You would had already guessed. Yes, it is option 2) C.

Reason

Consider the second, fourth and last alphabets. They are Z,Y and X which are the last three alphabets. Similarly consider the first and third terms - A and B. These are the first two alphabets. Hence logically the blank should be occupied by C which is the third alphabet from the start.

Wipro 3 Sample C Basics Interview Questions

During Wipro interviews, you can expect few questions touching the basics of C. These may not be difficult, but would require a good understanding of the basics. Let us discuss 3 sample questions which can help during your interviews.

Interview Question 1

Tell one good programming requirement that illustrates the fact that C is a strongly typed language ?

Answer 1

C involves variable declarations before their usage. This makes it clear that C is strongly typed.

Interview Question 2

Consider a weather report application in C where any change in temperature by +- 2 degrees will be constantly reported to the system and the application should store the times of the day when these changes took place. Which is a better data structure to be used in this scenario - an array or a linked list ?

Answer 2

Linked List would handle dynamically growing data very well when compared to arrays. Hence it would be a better choice.

Interview Question 3

Can one use arrays to implement stacks or queues over linked lists ? Is it feasible ?

Answer 3

Thought linked lists are commonly used for implementing stacks or queues, with good programming logic, arrays can also be used to implement those. However, as you would expect, linked lists are far more efficient in this scenario.


4 CTS Sample Interview Easy Questions

You can expect technical questions from various subjects like sql,microprocessors,algorithms and their complexities etc during CTS interviews. Below are few sample questions (easy) for your practice.

Interview Question 1

Can u tell a simple difference between candidate keys and primary key ?

Answer 1

Both candidate and primary keys uniquely identify a row in a table. However, only one can be chosen as primary key, while there can be many candidate keys.

Interview Question 2

Is semicolon mandatory at the end of a block statement in C ?

Answer 2

No, semicolon is not essential at the end of a block statement. For example, consider a statement of the form if(x==5){...some statements...}
In the above statement, there is no need for semicolon after the closing '}'.

Interview Question 3

Consider there are two programs written respectively using two algorithms A and B. Say A has a complexity of n^2 and the other has a complexity of n/2. Given the same number of inputs which would take longer time to run.

Answer 3

First program written using algorithm A will take longer time. Higher the order of complexity, longer the time taken for execution.

Interview Question 4

How microcontroller is different from microprocessor with respect to hardware and memory requirements ?

Answer 4

Microcontroller, unlike microprocessor, is self contained with necessary hardware like I/O, memory etc embedded to it.

Enhanced by Zemanta

Monday, August 8, 2011

2011 bpo aptitude questions

vector version of this imageImage via Wikipedia

Business process outsourcing (BPO) is a subset of outsourcing that involves the contracting of the operations and responsibilities of specific business functions (or processes) to a third-party service provider. Originally, this was associated with manufacturing firms,

Here are few steps/tips which will definitely help you in your Wipro Bpo interview process..

Lets start with rounds and then few interview questions asked in Wipro Bpo.

First round: English written test. (prepare articles, prepositions, sentence correction,
ordering of sentences.)

Second round: Personal Interview.

It is an elimination round.

Prepare questions like..

Tell me about yourself,

speak for 3 minutes on a topic ( life, friendship etc.)(Here your accent and grammar will be checked.)

Why Bpo? (If you are a B.Tech/B.E/MCA),

Tongue Twisters (around 15) etc.)

Third round: Technical test

Prepare networks, OS, basic computation) like…

a. what is NIC?

b. define ping/ipconfig/dhcp etc. they can ask you to explain with a scenario.

c. Basic Computer knowledge (Like – how to locate lan settings, how to get into internet or
hardware properties, how to check your domain and the computer name etc.)

d. Basic Internet knowledge.

e. How can you create a LAN?

f. Types of cables and which one is used where?

g. Network Layers/architecture. Types and related protocols (TCP/IP, FTP, SMTP..)

h. Basic file structure.

i. Win XP vs Win 98??

j. LAN / WAN / MAN.

k. Types of memory.

l. Router vs Hub vs Switch.

m. What is MODEM?
n. Types of movie file formats.

o. Broadband vs Baseband. etc.

Fourth round: Final HR

Just a formality ….

previous Wipro bpo interview questions..

Q.what do you know about customer service?

Customer service is an organization’s ability to supply their customers’ wants and needs. Customers and business managers alike like to talk about what good customer service is (and isn’t), but I think this definition sums up what excellent customer service is beautifully: “excellent customer service (is) the ability of an organization to constantly and consistently exceed the customer’s expectations.”

Q .why do you want to join bpo?

I want to see myself placed in a bpo as I am interested in this particular sector. Moreover I would love to have global exposure. Bpo has got a great boom and I believe that my communication skills and flexible nature suits the profile give needed for this job.

Q.How did you spend yester day?

Yesterday had happened good, I have gone to my friends room to collect the information related to this office and I have done reserch about this company, I found very good result about the company and I had very good time.

Q.why do u wnt to join Wipro only?

As you told Wipro is not an ordinory company. Its a one of fortune 500 companies. getting into wipro is getting into the world of opportunities. so, i want to make my career in wipro.

Q.what is headhunting in recruitment, how to do headhunting,what are the types?

Headhunting is recruiting the top management executives, who are highly skilled and resourcefull and whoes contribution to the organization leads to success or these employees are the competitive advantage of the organization. i.e. those employees who are competitive advantage of some company is offered the fancy designations and high salary package and made to join their company this process is called headhunting.

Headhunting can be done via ads, job portals referals etc.

There are three types these are direct, indirect and third party recruitment.

Enhanced by Zemanta

 
Design by Free WordPress Themes | Bloggerized by Lasantha - Premium Blogger Themes | Justin Bieber, Gold Price in India