i
Techdefence
Filter interviews by
I applied via Naukri.com and was interviewed in Mar 2024. There were 2 interview rounds.
SQL injection is a type of cyber attack where malicious SQL code is inserted into input fields to manipulate a database.
SQL injection occurs when an attacker inserts malicious SQL code into input fields on a website.
This code can then manipulate the database, steal data, or perform other unauthorized actions.
Example: Entering ' OR '1'='1' into a login form to bypass authentication.
XSS attack is a type of cyber attack where attackers inject malicious scripts into web pages viewed by other users.
XSS stands for Cross-Site Scripting.
Attackers inject malicious scripts into web pages viewed by other users.
These scripts can steal sensitive information, deface websites, redirect users to malicious sites, etc.
There are three types of XSS attacks: stored, reflected, and DOM-based.
Preventing XSS attacks in...
OTP flooding is a type of cyber attack where a large number of one-time passwords are sent to a target in order to overwhelm them.
OTP flooding is a form of denial-of-service attack.
Attackers flood the target with numerous OTPs, making it difficult for the target to use their legitimate OTP.
This type of attack can be used to disrupt services or gain unauthorized access to accounts.
Examples of OTP flooding include sendin...
Resource flooding is a type of cyber attack where an attacker overwhelms a system with excessive requests, causing it to become slow or unresponsive.
Resource flooding is a type of denial of service (DoS) attack.
Attackers flood a system with excessive requests, such as HTTP requests or network traffic, to overwhelm its resources.
This can lead to the system becoming slow or unresponsive, disrupting normal operations.
Comm...
I applied via Approached by Company and was interviewed in Jan 2023. There were 3 interview rounds.
I applied via Referral and was interviewed before Feb 2023. There were 2 interview rounds.
I prefer using a combination of COBIT and ISO 27001 frameworks for IT compliance audits.
I prefer COBIT for its comprehensive coverage of IT governance and control objectives.
I choose ISO 27001 for its focus on information security management best practices.
Combining both frameworks provides a holistic approach to IT compliance audits.
Active Directory is a directory service developed by Microsoft for Windows domain networks, providing centralized management of network resources.
Active Directory stores information about objects on the network such as computers, users, groups, and printers.
It allows administrators to manage and secure resources within the network by assigning permissions and policies.
Active Directory uses a hierarchical structure with...
I applied via Campus Placement and was interviewed in Apr 2023. There were 4 interview rounds.
It was related to the Soc analyst and vapt medium to hard level
Techdefence interview questions for popular designations
I applied via Naukri.com and was interviewed before Mar 2017. There were 2 interview rounds.
I applied via Recruitment Consultant and was interviewed before Jul 2020. There was 1 interview round.
I appeared for an interview before Sep 2020.
Round duration - 60 minutes
Round difficulty - Easy
Round duration - 50 minutes
Round difficulty - Easy
Round duration - 60 minutes
Round difficulty - Easy
At the beginning of this round, the interviewer asked me about the data structures I knew. Linked lists, trees, graphs, arrays etc. was my answer. He asked me how well I knew Dynamic Programming. I said I wasn’t strong in that and he said that he would ask me a question on dynamic programming for sure.
Round duration - 40 minutes
Round difficulty - Easy
The interviewer asked me if I was comfortable with the interview process so far and how the previous interviews were. I said it was good and he gave me the first problem to solve.
Round duration - 60 minutes
Round difficulty - Easy
The interviewer asked me some Computer Science fundamentals in this round as well as some behavioural questions.
Implement a Trie data structure with insert and search functions.
Create a TrieNode class with children and isEndOfWord attributes.
Implement insert function to add words by iterating through characters.
Implement search function to check if a word exists by traversing the Trie.
Example: Insert 'apple', 'banana', 'orange' and search for 'apple' and 'grape'.
Do lot of hard work and practice of Data Structures and Algorithms based questions. I personally recommend you Coding Ninjas and Geeks For Geeks for interview preparation.
Application resume tips for other job seekersMake your resume short and try to make it of one page only and do mention all your skills which you are confident of in your resume.
Final outcome of the interviewSelectedI applied via Naukri.com
I appeared for an interview in Aug 2017.
Merge Sort is a divide and conquer algorithm that sorts an array by dividing it into two halves, sorting them separately, and then merging the sorted halves.
Divide the array into two halves
Recursively sort the two halves
Merge the sorted halves
Find pairs of integers in a BST whose sum is equal to a given number.
Traverse the BST and store the values in a hash set.
For each node, check if (X - node.value) exists in the hash set.
If yes, add the pair (node.value, X - node.value) to the result.
Continue traversal until all nodes are processed.
Merge overlapping time intervals into mutually exclusive intervals.
Sort the intervals based on their start time.
Iterate through the intervals and merge overlapping intervals.
Output the mutually exclusive intervals.
Example: [(1,3), (2,6), (8,10), (15,18)] -> [(1,6), (8,10), (15,18)]
Different types of hashing and alternative for Linear Chaining
Different types of hashing include division, multiplication, and universal hashing
Alternative for Linear Chaining is Open Addressing
Open Addressing includes Linear Probing, Quadratic Probing, and Double Hashing
An AVL tree is a self-balancing binary search tree where the heights of the left and right subtrees differ by at most one.
AVL tree is a binary search tree with additional balance factor for each node.
The balance factor is the difference between the heights of the left and right subtrees.
Insertion and deletion operations in AVL tree maintain the balance factor to ensure the tree remains balanced.
Rotations are performed ...
Find the minimum number of squares whose sum equals to a given number n.
Use dynamic programming to solve the problem efficiently.
Start with finding the square root of n and check if it is a perfect square.
If not, then try to find the minimum number of squares required for the remaining number.
Repeat the process until the remaining number becomes 0.
Return the minimum number of squares required for the given number n.
Insertion sort for a singly linked list.
Traverse the list and compare each node with the previous nodes
If the current node is smaller, swap it with the previous node
Repeat until the end of the list is reached
Time complexity is O(n^2)
I applied via Naukri.com and was interviewed in May 2019. There were 4 interview rounds.
based on 4 interviews
Interview experience
based on 47 reviews
Rating in categories
Security Analyst
13
salaries
| ₹1.8 L/yr - ₹8.2 L/yr |
SOC Analyst
7
salaries
| ₹1 L/yr - ₹4 L/yr |
Soc Analyst 2
4
salaries
| ₹3.4 L/yr - ₹8.2 L/yr |
Soc Analyst 1
4
salaries
| ₹2.4 L/yr - ₹4 L/yr |
Senior Human Resource Manager
4
salaries
| ₹5 L/yr - ₹7 L/yr |
Amazon
Flipkart
Indiamart Intermesh
JustDial