Accenture Technical interview Questions for Freshers

Accenture Technical Interview Questions and Answers 2022

Find the most recent Accenture Technical Interview questions and answers for the years 2021-22.
Accenture technical Interview Questions

Accenture Technical Interview Questions

Question 1: Is SQL-based programming possible?

Answer:

SQL is essentially a command-based programming language that lacks control flow statements.

Question 2:- What is the difference between a Primary Key and Unique Key in SQL?

Primary KeyUnique Key
A primary key is an identifier that is unique for each row of a table.A Unique Key acts as a unique identifier for table rows in the absence of a Primary Key.
It is not permitted to use a null or duplicate value.It can only have one NULL value, but it cannot have two NULL values.
Only one primary key is permitted in a table.In a table, there can be several Unique Keys.
The primary key is clustered index by default, and data in the database table is physically organized in clustered index order.A unique non-clustered index is the default unique key.

Question 3: What is call by value and call by reference in C Programming language?

Answer:

We can pass value to function in two ways: 

  • call by value 
  • call by reference

Call by value:

The function receives a copy of the value, so the original value is not altered during the call by value.

Call by reference:

The function is given a value address, so the original value is changed in the call by reference.

Questions 4: What are the features of the C language?

Answer:

  • C programs are efficient and quick. This is due to the wide range of data types and powerful operators available.
  • The C programming language is the most widely used in today’s operating systems and embedded system development.

Question 5: Define encapsulation in C++.

Answer: 

Encapsulation is an Object-Oriented Programming concept that connects data and the functions that manipulate it, keeping them safe from outside interference and misuse. The important OOP concept of data hiding arose from data encapsulation.

Question 6: What is meant by Inheritance and what are its advantages?

Answer:

Inheritance is the process of obtaining all of the characteristics of a class. 

The benefits of inheritance include code reusability, access to variables, and methods of the super class by subclasses.

Question 7: What are method overloading and method overriding?

Answer:

Method overloading: Method overloading occurs when two methods in the same class have the same method name but different arguments. 

Method overriding: Method overriding occurs when two methods in the same class have the same method name and arguments.

Question 8: Define recursion in C and its types.

Answer:

Recursion is the process by which a function calls itself an infinite number of times.

Types of recursion:

  • Direct Recursion
  • Indirect Recursion
  • Tree Recursion
  • Linear Recursion
  • Tail Recursion
  • Head Recursion

Questions 9: Write a program in C++ for the Fibonacci series up to nth term.

Code:

// Write a program to print Fibonacci series in C++

#include <iostream>

using namespace std;

int main()

{

    int num = 15;

    int a = 0, b = 1;

    // Here we are printing 0th and 1st terms

    cout << a << ", " << b << ", ";

    int nextTerm; 

    // printing the rest of the terms here

    for(int i = 2; i < num; i++){

        nextTerm = a + b;

        a = b;

        b = nextTerm;

        cout << nextTerm << ", ";

    }

    return 0;

}

Question 10: What are semaphores in Operating systems? What are the different types of Semaphores?

Answer

Semaphores are integer variables that are used to fix the critical section problem using two atomic operations, wait as well as signal, which is used for process synchronization.

Types of Semaphores:

  • Counting Semaphores
  • Binary Semaphores

Question 11: What are the different types of Keys in Database Management Systems?

Answer:

In DBMS, keys are classified into seven broad categories:

  • Candidate Key
  • Primary Key
  • Foreign Key
  • Super Key
  • Alternate Key
  • Composite Key
  • Unique Key

Question 12: List the Coffman's conditions that result in a deadlock.

Answer:

  1. Mutual Exclusion: A critical resource can only be used by one process at a time.
  2. Hold & Wait: Some resources may be assigned to a process while others are awaiting allocation.
  3. No Pre-emption: No resource can be forcibly removed from a process that is holding it.
  4. Circular Wait: A closed chain of processes exists when each process has at least one resource that another process in the chain requires.

Question 13: What is the significance of the AVL tree?

Answer:

The AVL tree is a self-balancing Binary Search Tree (BST) in which the difference in heights between the left and right subtrees cannot be greater than one for any node. The above tree is AVL because the difference in heights between the left and right subtrees for each node is less than or equal to one.

Question 14: Write a function to reverse a linked list using C++.

Code:

#include 

using namespace std;

struct node 

{

    int num;                

    node *nextptr;             

}*stnode; //node constructed

void listBanao(int n);                 

void reverse(node **stnode);             

void listDhikhao(); 

int main()

{

    int n,num,item;

    cout<<"Enter the number of nodes: ";

    cin>>n;

    listBanao(n);

    cout<<"\nLinked list data: \n";

    listDhikhao();

    cout<<"\nAfter reversing\n";

    reverse(&stnode);

    listDhikhao();

   return 0;

}

void listBanao(int n) //function to create linked list.

{

    struct node *frntNode, *tmp;

    int num, i;

    stnode = (struct node *)malloc(sizeof(struct node));

    if(stnode == NULL)        

    {

        cout<<" Memory can not be allocated";

    }

    else

    {

                                  

        cout<<"Enter the data for node 1: ";

        cin>>num;

        stnode-> num = num;      

        stnode-> nextptr = NULL; //Links the address field to NULL

        tmp = stnode;

        for(i=2; i<=n; i++)

        {

            frntNode = (struct node *)malloc(sizeof(struct node)); 

            if(frntNode == NULL) //If frntnode is null no memory cannot be allotted

            {

                cout<<"Memory can not be allocated";

                break;

            }

            else

            {

                cout<<"Enter the data for node "<<i<<": "; // Entering data in nodes.

                cin>>num;

                frntNode->num = num;         

                frntNode->nextptr = NULL;    

                tmp->nextptr = frntNode;     

                tmp = tmp->nextptr;

            }

        }

    }



void reverse(node **stnode) //function to reverse linked list

{

    struct node *temp = NULL;

    struct node *prev = NULL;

    struct node *current = (*stnode);

    while(current != NULL) {

        temp = current->nextptr;

        current->nextptr = prev;

        prev = current;

        current = temp;

    }

    (*stnode) = prev;

}

void listDhikhao()//function to display linked list

{

    struct node *tmp;

    if(stnode == NULL)

    {

        cout<<"List is empty";

    }

    else

    {

        tmp = stnode;

        while(tmp != NULL)

        {

            cout<num<<"\t";   

            tmp = tmp->nextptr;                 

        }

    }

}

Question 15: Why there are no global variables in Java?

Answer:

Global variables can be accessed from anywhere on the globe. Java does not support globally accessible variables for the following reasons:

  • The global variables compromise referential transparency.
  • In namespace, global variables cause collisions.

Question 16: What are short, long, and medium-term scheduling?

Answer:

Long-Term Scheduler: Long term scheduler determines which programs are admitted to the system for processing. It controls the degree of multiprogramming. Once admitted, a job becomes a process.

Medium-Term Scheduler: Medium-term scheduling is part of the swapping function. This relates to processes that are in a blocked or suspended state. They are swapped out of real memory until they are ready to execute. The swapping-in decision is based on memory-management criteria.

Short-Term Scheduler: A short-term scheduler, also known as a dispatcher executes most frequently and makes the finest-grained decision of which process should execute next. This scheduler is invoked whenever an event occurs. It may lead to the interruption of one process by preemption.

Question 17: What is normalization? What are its types?

Answer:

Normalization is the process of organizing data in a database in order to reduce redundancy and achieve data integrity. It is also known as data normalization or database normalization.

By normalizing the data, we can arrange it in tables and columns and define a relationship between these tables or columns.

There are several types of normalization that are commonly used:

  • First normal form (1NF)
  • Second normal form (2NF)
  • Third normal form( 3NF)
  • Boyce & Codd normal form (BCNF)
  • Fourth normal form(4NF)

Question 18: Define list interface in the collection.

Answer:

The List interface is a Java Collection Framework interface. The List interface adds to the Collection interface’s functionality.

  • It is a well-organized collection of objects.
  • It has elements that are duplicates.
  • It also allows for element access at random.

Syntax:

public interface List extends Collection

Question 19: Define the Deadlock condition in multithreading?

Answer:

When multiple threads are active, a deadlock condition occurs. When one thread is waiting for an object lock that has already been acquired by another thread and the second thread is waiting for a lock object that has already been taken by the first thread, this is referred to as a deadlock condition in Java.

Question 20: Can we compile a program without the main () function.

Answer:

Yes, a program can be compiled without the main () function, but it cannot be executed.

Question 21: Define the following terms: DBMS, query, SQL?

Answer:

Database Management System:

A database management system (DBMS) is a group of programs that allow users to create and manage databases. It organizes incoming data and manages it so that users can access it in a more efficient and straightforward manner. In a nutshell, a database management system (DBMS) gives us an interface or tool to perform various tasks like creating a database, inserting data into it, deleting data from it, updating data, and so on. When compared to a file-based system, a database management system (DBMS) stores data in a more secure manner. We can solve a variety of issues with DBMS, including data redundancy, data inconsistency, easy access, better organization, and so on.

Query: 

A query is a data request. A database query is a piece of code that retrieves data from a database. You ask the database for something, and it responds with data as a result of a query in the best way it knows how.

Question 22:- Write a program to find whether a number is a palindrome or not.