test page

Hot Topics

Topics

Introduction
Time Complexity
Stack
Stack using Queue
Stack Using Single Linked List:
Stack Using Double Linked List:
Infix To Postfix
Queue
Queue using Stack
Queue Using Single Linked List:
Queue Using Double Linked List:
Dequeue
Circular Queue
Singular Linked List:
1. Insert First
2. Insert Last
3. Delete First
4. Delete Last
5. Insert After a Value
6. Insert Before a Value
7. Insert After Position
8. Insert Before Position
9. Delete After a Value
10. Delete Before Value
11. Delete Position
12. Display
13. Reverse Display
14. Physically Reverse Display
15. Free All Nodes
16. Node Count
17. Delete First nth Nodes
18. Delete Last nth Nodes
Double Linked List:
1. Insert First
2. Insert Last
3. Delete First
4. Delete Last
5. Insert After a Value
6. Insert Before a Value
7. Insert After Position
8. Insert Before Position
9. Delete After a Value
10. Delete Before Value
11. Delete Position
12. Display
13. Reverse Display
14. Physically Reverse Display
15. Free All Nodes
16. Node Count
17. Delete First nth Nodes
18. Delete Last nth Nodes
Circular Linked List
Searching
Linear Search
Binary Search
Jump Search
Interpolation Search
Exponential Search
“Sublist Search
(Search a linked list in another list)”
Fibonacci Search
The Ubiquitous Binary Search
“Recursive program to linearly search
an element in a given array”
Recursive function to do substring search
“Unbounded Binary Search Example
(Find the point where a monotonically increasing
function becomes positive first time)”
Sorting
Selection Sort
Bubble Sort
Recursive Bubble Sort
Insertion Sort
Recursive Insertion Sort
Merge Sort
Iterative Merge Sort
Quick Sort
Iterative Quick Sort
Heap Sort
Counting Sort
Radix Sort
Bucket Sort
ShellSort
TimSort
Comb Sort
Pigeonhole Sort
Cycle Sort
Cocktail Sort
Strand Sort
Bitonic Sort
Pancake sorting
Binary Insertion Sort
BogoSort or Permutation Sort
Gnome Sort
“Sleep Sort –
The King of Laziness / Sorting while Sleeping”
Structure Sorting (By Multiple Rules) in C++
Stooge Sort
Tag Sort (To get both sorted and original)
Tree Sort
Cartesian Tree Sorting
Odd-Even Sort / Brick Sort
QuickSort on Singly Linked List
QuickSort on Doubly Linked List
3-Way QuickSort (Dutch National Flag)
Merge Sort for Linked Lists
Merge Sort for Doubly Linked List
3-way Merge Sort
Polynomial Functions
Recursion
Factorial Using Recursion:
Fibonacci Using Recursion:
GCD Using Recursion:
Tower of Hanoi Using Recursion:
N Queen Problem
Knapsack Problem
Tree
Graph
BFS
DFS

Tata Consultancy Services

Technical Round

Write a program to execute a loop 10 times

#include <stdio.h>

int main()
{
    int n;
    printf("Enter the number of times you want to print lines\n");
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        printf("Line number %d\n",i);
    }

    return 0;
}
/*
INPUT:
n=10

OUTPUT:
Line number 1
Line number 2
Line number 3
Line number 4
Line number 5
Line number 6
Line number 7
Line number 8
Line number 9
Line number 10
*/

Explain any important feature of OOPs

Important features of OOPs are 
  • Inheritance: It is a concept of Object Oriented Programming in which a new class is created from the existing one.
  • Polymorphism: Poly means many and morph means form. A concept that enables programmers to assign a different meaning or usage to a variable, function or an object in different context.
 
Polymorphism can be of two types:
  1. Runtime Polymorphism
  2. Compile Time Polymorphism
  • Abstraction: Creating a new data type using encapsulated items that is well suited for an application.
  • Encapsulation: It is called data hiding and encapsulation is the way of packing data and function into a single unit to hide the implementation details of a class from outer world.
  • Method Overriding: In place of inheritance if the parent class and child class both have the same method signature then child class method overrides the parent class method.
  • Method Overloading: If a class has more than one method with the same method name with variety of parameter list then method will be overloaded.
  • Object: Object is the reality of a class.
  • Class: Class is a blue print of similar type of objects.
  • Constructor: Constructor is a special member function that is automatically invoked at the time of object creation and does not have any return type.

HR Round

Given an array of integers, return indices of the two numbers such that they add
up to a specific target.
You may assume that each input would have exactly one solution, and you may not
use the same element twice.
Example:
Given nums = [2, 7, 11, 15], target = 9,
Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].

What will you do when your girlfriend is getting married on the same day as an important client meeting?

Nagarro Solved

Automata Fixing

      

Popular Category

Hot Topics

Topics

Introduction
Time Complexity
Stack
Stack using Queue
Stack Using Single Linked List:
Stack Using Double Linked List:
Infix To Postfix
Queue
Queue using Stack
Queue Using Single Linked List:
Queue Using Double Linked List:
Dequeue
Circular Queue
Singular Linked List:
1. Insert First
2. Insert Last
3. Delete First
4. Delete Last
5. Insert After a Value
6. Insert Before a Value
7. Insert After Position
8. Insert Before Position
9. Delete After a Value
10. Delete Before Value
11. Delete Position
12. Display
13. Reverse Display
14. Physically Reverse Display
15. Free All Nodes
16. Node Count
17. Delete First nth Nodes
18. Delete Last nth Nodes
Double Linked List:
1. Insert First
2. Insert Last
3. Delete First
4. Delete Last
5. Insert After a Value
6. Insert Before a Value
7. Insert After Position
8. Insert Before Position
9. Delete After a Value
10. Delete Before Value
11. Delete Position
12. Display
13. Reverse Display
14. Physically Reverse Display
15. Free All Nodes
16. Node Count
17. Delete First nth Nodes
18. Delete Last nth Nodes
Circular Linked List
Searching
Linear Search
Binary Search
Jump Search
Interpolation Search
Exponential Search
“Sublist Search
(Search a linked list in another list)”
Fibonacci Search
The Ubiquitous Binary Search
“Recursive program to linearly search
an element in a given array”
Recursive function to do substring search
“Unbounded Binary Search Example
(Find the point where a monotonically increasing
function becomes positive first time)”
Sorting
Selection Sort
Bubble Sort
Recursive Bubble Sort
Insertion Sort
Recursive Insertion Sort
Merge Sort
Iterative Merge Sort
Quick Sort
Iterative Quick Sort
Heap Sort
Counting Sort
Radix Sort
Bucket Sort
ShellSort
TimSort
Comb Sort
Pigeonhole Sort
Cycle Sort
Cocktail Sort
Strand Sort
Bitonic Sort
Pancake sorting
Binary Insertion Sort
BogoSort or Permutation Sort
Gnome Sort
“Sleep Sort –
The King of Laziness / Sorting while Sleeping”
Structure Sorting (By Multiple Rules) in C++
Stooge Sort
Tag Sort (To get both sorted and original)
Tree Sort
Cartesian Tree Sorting
Odd-Even Sort / Brick Sort
QuickSort on Singly Linked List
QuickSort on Doubly Linked List
3-Way QuickSort (Dutch National Flag)
Merge Sort for Linked Lists
Merge Sort for Doubly Linked List
3-way Merge Sort
Polynomial Functions
Recursion
Factorial Using Recursion:
Fibonacci Using Recursion:
GCD Using Recursion:
Tower of Hanoi Using Recursion:
N Queen Problem
Knapsack Problem
Tree
Graph
BFS
DFS

We Love to Support you

Go through our study material. Your Job is awaiting.

Categories