Got it You want only Technical CS/IT concepts (without

aptitude) for Daimler’s online assessment & interviews. I’ll give FIFO → enqueue(), dequeue()
you a complete structured handbook that covers all the core
CS/IT areas: Variants: Circular queue, Deque, Priority Queue

Trees
Daimler Technical CS/IT Concepts Handbook
Binary tree → Max nodes = 2^h – 1

Binary Search Tree (BST): left < root < right

1. Programming (C, Java, Python Basics) Traversals: Inorder, Preorder, Postorder

Core Concepts
Graphs
Data Types: int, float, char, string, boolean
Representation: Adjacency Matrix / List
Control Structures: if-else, switch, loops (for, while, do-while)
Traversal: BFS (queue), DFS (stack/recursion)
Functions: Parameter passing (by value, by reference), recursion

OOP Principles:

Encapsulation = Bundling data & methods

3. Algorithms
Inheritance = Reusability (IS-A relationship)
Sorting
Polymorphism = Compile-time (overloading), Run-time
Bubble/Insertion/Selection → O(n²)
(overriding)
Merge/Quick → O(n log n)
Abstraction = Hiding implementation using abstract classes /
interfaces
Heap Sort → O(n log n)
Memory
Searching
Stack = Function calls, local variables
Linear Search → O(n)
Heap = Dynamic memory (malloc, new)
Binary Search → O(log n)
Static = Global / static variables

Recurrence

T(n) = T(n/2) + O(1) → O(log n)

2. Data Structures
T(n) = 2T(n/2) + O(n) → O(n log n)
Arrays & Strings

Fixed-size, contiguous memory

Searching: Linear O(n), Binary O(log n)

4. Operating Systems (OS)

Process Management
Linked List
Process = Program in execution
Dynamic, non-contiguous memory
Thread = Lightweight process
Types: singly, doubly, circular
CPU Scheduling:
Stack
FCFS (First Come First Serve)
LIFO → push(), pop()
SJF (Shortest Job First)
Applications: recursion, expression evaluation
Round Robin (time quantum)

Priority Scheduling
Queue
 TCP → Reliable, connection-oriented

UDP → Faster, connectionless

Deadlock

Conditions (Coffman): IP Addressing

1. Mutual Exclusion IPv4 = 32-bit, IPv6 = 128-bit

Subnet formula: 2^(host bits) – 2

2. Hold & Wait

Networking Terms
3. No Preemption
Bandwidth × Time = Data transferred

4. Circular Wait Latency = Propagation + Transmission + Queuing + Processing

Avoidance: Banker’s Algorithm

6. Database Management (DBMS & SQL)
Memory Management Keys
Paging → Fixed-size blocks Primary Key = Unique, Not NULL
Segmentation → Variable-size blocks Candidate Key = Minimal unique set
Virtual Memory → Demand Paging Foreign Key = Reference key

Synchronization Normalization
Race Condition → Shared resource conflict 1NF → Atomic values
Solutions: Semaphores, Monitors 2NF → Remove partial dependency

3NF → Remove transitive dependency

5. Computer Networks (CN) Transactions (ACID)

OSI Model (7 Layers) Atomicity, Consistency, Isolation, Durability

1. Physical → Cables, signals

SQL Basics

2. Data Link → MAC, framing SELECT, WHERE, ORDER BY, GROUP BY, HAVING

Aggregate Functions: COUNT, SUM, AVG, MIN, MAX

3. Network → IP addressing, routing
Joins: INNER, LEFT, RIGHT, FULL

4. Transport → TCP/UDP

5. Session → Communication setup 7. Software Engineering

SDLC Models
6. Presentation → Encryption, compression
Waterfall, Agile, Spiral, V-Model
7. Application → HTTP, FTP, SMTP
Testing

Unit → Module testing

TCP vs UDP
Integration → Interaction between modules
SaaS → Software (Google Docs)
System → Full system test

Regression → Re-test after changes Big Data & Tools

Hadoop → Distributed storage (HDFS)

Software Metrics
Spark → In-memory computation
Cyclomatic Complexity = E – N + 2P (Edges, Nodes,
Components)
Cybersecurity

Symmetric Encryption → Single key (AES, DES)

8. Theory of Computation (TOC) Asymmetric Encryption → Public & private key (RSA)

DFA/NFA → Finite Automata Hashing → One-way (SHA, MD5)

Regular Expressions → Describe regular languages

Context Free Grammar (CFG) → Used in compilers

This now covers all major CS/IT subjects:
Turing Machine → Most powerful model of computation
Programming & OOP

DSA & Algo

9. Compiler Design OS

Phases: Networks

1. Lexical Analysis → Tokens DBMS

Software Engg
2. Syntax Analysis → Parse tree
TOC & Compiler

3. Semantic Analysis → Meaning check Cloud & Security

4. Intermediate Code → IR

Do you want me to turn this into a structured “Technical CS/IT

5. Optimization → Speed/memory improvements Revision PDF” (2–3 pages) so you can print/read just before
Daimler’s test & interview?

6. Code Generation → Machine code

Excellent question, Satish . You’re asking for a full bank of
100–200 technical CS/IT questions that Daimler (or similar
companies) could ask in online assessments or interviews. I’ll give
Parsing: you a complete structured set of questions across all core subjects
(Programming, DSA, OS, DBMS, CN, SE, TOC, Compiler,
Top-down (LL) Cloud, Cybersecurity).

Bottom-up (LR) This will act as a mock Q-bank for you.

Daimler Technical CS/IT Question Bank (150+ Questions)

10. Miscellaneous CS Concepts

Cloud Computing 1. Programming & OOP (20 Qs)

IaaS → Infrastructure (AWS EC2) 1. What are the four pillars of OOP? Explain with
examples.
PaaS → Platform (Heroku)
2. Difference between overloading and overriding.
23. Implement a queue using two stacks.

3. Shallow copy vs Deep copy.

24. Applications of stack in real life.

4. Explain static keyword in Java/C++.

25. Time complexity of binary search.

5. Why is Python dynamically typed?

26. Explain BFS and DFS with example.

6. Difference between pass by value and pass by reference.

27. Difference between tree and graph.

7. Explain garbage collection in Java.

28. What is a binary search tree?

8. What is a constructor? Can constructors be inherited?

29. Inorder traversal of BST gives which sequence?

9. Difference between interface and abstract class.

30. What is a heap? Applications of heaps.

10. Can you achieve multiple inheritance in Java? How?

31. Explain Dijkstra’s algorithm.

11. What is exception handling? Explain try-catch-finally.

32. Difference between Prim’s and Kruskal’s algorithm.

12. Explain immutable objects in Java (e.g., String).

33. What is dynamic programming? Give examples.

13. Difference between == and equals() in Java.

34. What is greedy algorithm? Example.

14. Write a function to reverse a string without using

library functions. 35. Implement factorial using recursion.

15. Difference between C and C++. 36. Find 2nd largest element in an array.

16. What is multithreading? Give an example. 37. Detect cycle in a linked list.

17. Explain dynamic binding with example. 38. What is hashing? Explain collision handling.

18. What is method hiding in Java? 39. HashMap vs HashSet.

19. Difference between compile-time error and runtime 40. Explain merge sort with time complexity.
error.

41. QuickSort worst-case complexity.

20. Python: Difference between list, tuple, set, dict.

42. Difference between stable and unstable sorting.

43. What is Big-O, Big-Ω, Big-Θ?

2. Data Structures & Algorithms (25 Qs)

21. Difference between array and linked list. 44. Which data structure is used in recursion?

22. Implement a stack using an array. 45. Difference between adjacency matrix and adjacency list.
 4. Computer Networks (20 Qs)

66. Explain OSI 7-layer model.

3. Operating Systems (20 Qs)

46. What is the difference between process and thread? 67. TCP vs UDP.

47. Explain context switching. 68. Difference between IPv4 and IPv6.

48. CPU scheduling algorithms with examples. 69. What is subnetting? Example.

49. Difference between preemptive and non-preemptive 70. ARP vs RARP.

scheduling.

71. Explain DNS.

50. Explain Round Robin scheduling with example.

72. HTTP vs HTTPS.

51. What is starvation? How to avoid it?

73. What is DHCP?

52. Deadlock: 4 necessary conditions.

74. Explain 3-way TCP handshake.

53. Banker’s algorithm with example.

75. Difference between switch, hub, and router.

54. Difference between paging and segmentation.

76. What is MAC address?

55. What is virtual memory?

77. Explain IP addressing classes.

56. Explain page replacement algorithms (FIFO, LRU).

78. What is ICMP protocol?

57. What is thrashing in OS?

79. What is congestion control in TCP?

58. Semaphore vs Mutex.

80. Difference between unicast, multicast, broadcast.

59. Difference between kernel mode and user mode.

81. Explain stop-and-wait ARQ.

60. Monolithic vs Microkernel OS.

82. Sliding window protocol.

61. Explain producer-consumer problem.

83. What is MTU (Maximum Transmission Unit)?

62. What is critical section?

84. Explain CSMA/CD vs CSMA/CA.

63. What is a system call? Example.

85. What is NAT (Network Address Translation)?

64. Explain demand paging.

65. What is multithreading? Benefits?

5. Database Management (20 Qs)

 107. Agile vs Scrum.
86. Difference between DBMS and RDBMS.

108. Explain black-box vs white-box testing.

87. ACID properties in transactions.

109. Unit vs Integration testing.

88. What is a primary key?

110. Regression testing.

89. Difference between candidate key and super key.

111. What is a use-case diagram?

90. What is a foreign key?

112. Explain functional vs non-functional requirements.

91. Explain normalization up to 3NF.

113. Explain coupling and cohesion.

92. What is denormalization?

114. What is version control? Example.

93. Difference between inner join and outer join.

115. What is software maintainability?

94. Explain cross join.

116. Difference between verification and validation.

95. What is indexing? Types?

117. Cyclomatic complexity formula.

96. Difference between clustered and non-clustered index.

118. Explain SRS (Software Requirement Specification).

97. Explain SQL injection attack.

119. Spiral vs V-Model.

98. Difference between DELETE, TRUNCATE, DROP.

120. Difference between load testing and stress testing.

99. Difference between UNION and UNION ALL.

100. What is a view in SQL?

7. Theory of Computation (10 Qs)

101. Stored procedure vs function.
121. DFA vs NFA.
102. Difference between OLTP and OLAP.
122. What is a regular language?
103. Explain ER diagram with example.
123. Difference between regular grammar and context-free
grammar.
104. What is a transaction log?

124. Example of a language not regular.

105. Difference between WHERE and HAVING.

125. Pumping Lemma for regular languages.

126. Pushdown Automata (PDA) definition.

6. Software Engineering (15 Qs)

106. SDLC models – Waterfall, Agile. 127. Difference between CFL and CSL.
128. Explain Turing Machine.

148. What is encryption? Types?

129. Halting Problem in computation.

149. Difference between symmetric and asymmetric

130. Applications of automata theory. encryption.

150. Explain RSA algorithm.

8. Compiler Design (10 Qs) 151. Explain AES.

131. Phases of compiler.

152. What is hashing?

132. Lexical analysis – definition.

153. MD5 vs SHA.

133. Difference between token, lexeme, pattern.

154. Firewall vs IDS vs IPS.

134. Role of parser.

155. What is SSL/TLS?

135. Explain LR parsing.

136. Difference between top-down and bottom-up parsing.

That’s 155 core questions across CS/IT subjects – enough to
simulate Daimler’s technical assessment & interviews.
137. Intermediate code generation.

138. Code optimization techniques. Do you want me to now create a practice set (MCQs + coding
+ SQL queries + short answers) from these questions (like a real
mock test), or should I keep them in theory/interview style Q&A
139. Explain symbol table. format?

140. Explain semantic analysis.

Perfect, Satish
Here’s the full 155+ Q&A bank with clear answers (not PDF, just
full text here). You can later decide if you want me to generate a
final handbook-style PDF.

9. Cloud Computing & Security (15 Qs)

141. Difference between IaaS, PaaS, SaaS.

Daimler CS/IT Technical Q&A Bank (Full 155+ with
Answers)
142. Public vs Private vs Hybrid cloud.

143. Virtualization in cloud computing. 1. Programming & OOP (20 Qs)

Q1. What are the four pillars of OOP?

144. Advantages of cloud computing. A: Encapsulation, Inheritance, Polymorphism, Abstraction.

Q2. Difference between overloading and overriding?

145. Explain Hadoop & HDFS. A: Overloading – Same method name, different parameters
(compile-time).
Overriding – Same method signature in subclass (runtime).
146. What is Apache Spark?
Q3. Shallow copy vs Deep copy?
A: Shallow – Copies references only. Deep – Creates a new
147. MapReduce basics. independent object.
Q4. What is a constructor? Can it be inherited?
A: Special method to initialize objects. It is not inherited but can Q23. Queue using two stacks?
be invoked using super(). A: Push into stack1, pop from stack2; if empty, transfer.

Q5. Difference between interface and abstract class? Q24. Applications of stack?
A: Interface – Only method declarations. Abstract class – Can A: Undo, expression evaluation, recursion.
have both abstract and concrete methods.
Q25. Binary search complexity?
Q6. What is static keyword? A: O(log n).
A: Used for variables/methods that belong to the class, not
instance. Q26. BFS vs DFS?
A: BFS – Level-wise, uses queue. DFS – Depth-first, uses
Q7. Why is Python dynamically typed? stack/recursion.
A: Type of variable determined at runtime, not compile-time.
Q27. Tree vs Graph?
Q8. Pass by value vs Pass by reference? A: Tree – Connected, no cycles. Graph – Can be cyclic or
A: Value – Copy is passed. Reference – Actual reference passed. disconnected.

Q9. What is garbage collection in Java? Q28. BST?

A: Automatic memory management via JVM removing unused A: Binary tree with left < root < right property.
objects.
Q29. Inorder traversal of BST?
Q10. Immutable objects in Java? A: Produces sorted order.
A: Objects whose state cannot change after creation (e.g., String).
Q30. Heap?
Q11. Difference between == and equals()? A: Complete binary tree. Min-heap: parent < child.
A: == compares references, equals() compares values.
Q31. Dijkstra’s algorithm?
Q12. Exception handling in Java? A: Finds shortest path in weighted graphs (non-negative edges).
A: Done using try-catch-finally; ensures safe execution.
Q32. Prim vs Kruskal?
Q13. Multithreading? A: Prim – Builds tree, adds nearest vertex. Kruskal – Adds lowest
A: Running multiple threads (lightweight processes) edge, avoids cycle.
concurrently.
Q33. Dynamic programming?
Q14. Dynamic binding? A: Solves problems by storing subproblem solutions (e.g.,
A: Method call resolved at runtime (polymorphism). Fibonacci, Knapsack).

Q15. Method hiding in Java? Q34. Greedy algorithm?

A: When a subclass defines a static method with same name as A: Makes locally optimal choice (e.g., Huffman coding).
superclass.
Q35. Factorial recursion?
Q16. Compile-time vs Runtime error? A: n * fact(n-1) until base case.
A: Compile-time: Syntax/semantic errors. Runtime: Occurs
during execution. Q36. 2nd largest element array?
A: Track max, second max in one pass.
Q17. Python collections difference (list, tuple, set, dict)?
A: List – Ordered, mutable. Tuple – Ordered, immutable. Set – Q37. Detect cycle in linked list?
Unordered, unique. Dict – Key-value pairs. A: Floyd’s cycle detection (tortoise-hare).

Q18. Reverse string without library? Q38. Hashing?

A: Loop from end → start OR recursion. A: Map keys to indices using hash function. Collisions →
chaining/linear probing.
Q19. C vs C++?
A: C – Procedural, no OOP. C++ – Supports OOP and templates. Q39. HashMap vs HashSet?
A: HashMap stores key-value pairs, HashSet stores only keys.
Q20. Multiple inheritance in Java?
A: Achieved using interfaces, not classes. Q40. Merge sort complexity?
A: O(n log n).

Q41. QuickSort worst-case?

2. Data Structures & Algorithms (25 Qs) A: O(n²) when pivot chosen poorly.

Q21. Array vs Linked List? Q42. Stable vs Unstable sorting?

A: Array – Fixed size, random access. Linked list – Dynamic size, A: Stable – Maintains relative order (Merge Sort). Unstable –
sequential access. Does not (QuickSort).

Q22. Stack implementation? Q43. Big-O, Big-Ω, Big-Θ?

A: LIFO using array or linked list. Operations: push, pop. A: O – Upper bound, Ω – Lower bound, Θ – Tight bound.
Q44. Which DS used in recursion? Q65. Benefits of multithreading?
A: Stack. A: Better resource use, responsiveness, parallelism.

Q45. Adjacency matrix vs list?

A: Matrix – O(1) edge check, O(V²) space. List – O(V+E) space.
4. Computer Networks (20 Qs)

Q66. OSI 7 layers?

3. Operating Systems (20 Qs) A: Physical, Data Link, Network, Transport, Session,
Presentation, Application.
Q46. Process vs Thread?
A: Process – Independent execution, own memory. Thread – Q67. TCP vs UDP?
Lightweight, shared memory. A: TCP – Reliable, connection-oriented. UDP – Faster, no
reliability.
Q47. Context switching?
A: Saving process state and switching CPU to another process. Q68. IPv4 vs IPv6?
A: IPv4 – 32-bit, IPv6 – 128-bit, more addresses.
Q48. CPU scheduling algorithms?
A: FCFS, SJF, Priority, Round Robin. Q69. Subnetting?
A: Dividing network into smaller networks.
Q49. Preemptive vs Non-preemptive scheduling?
A: Preemptive – Can interrupt. Non-preemptive – Runs till Q70. ARP vs RARP?
completion. A: ARP – IP → MAC. RARP – MAC → IP.

Q50. Round Robin example? Q71. DNS?

A: Each process gets fixed time quantum, cycle repeats. A: Converts domain names to IP addresses.

Q51. Starvation? Q72. HTTP vs HTTPS?

A: Process waits indefinitely; prevented by aging. A: HTTPS – Secure (TLS/SSL).

Q52. Deadlock conditions? Q73. DHCP?

A: Mutual exclusion, Hold & wait, No preemption, Circular wait. A: Assigns IP automatically.

Q53. Banker’s algorithm? Q74. 3-way handshake?

A: Avoids deadlock by checking safe state. A: SYN → SYN-ACK → ACK.

Q54. Paging vs Segmentation? Q75. Switch vs Hub vs Router?

A: Paging – Fixed size blocks. Segmentation – Variable size. A: Switch – MAC-based. Hub – Broadcast. Router – IP-based.

Q55. Virtual memory? Q76. MAC address?

A: Memory abstraction combining RAM + disk. A: Unique hardware address (48-bit).

Q56. Page replacement algorithms? Q77. IP address classes?

A: FIFO, LRU, Optimal. A: A (0–127), B (128–191), C (192–223).

Q57. Thrashing? Q78. ICMP?

A: Excessive paging, performance drops. A: Error-reporting (e.g., ping).

Q58. Semaphore vs Mutex? Q79. TCP congestion control?

A: Semaphore – Counting sync tool. Mutex – Binary lock. A: Slow start, AIMD, Fast Retransmit.

Q59. Kernel mode vs User mode? Q80. Unicast vs Multicast vs Broadcast?

A: Kernel – Full access. User – Restricted. A: One-to-one, one-to-many, one-to-all.

Q60. Monolithic vs Microkernel? Q81. Stop-and-wait ARQ?

A: Monolithic – Large, faster. Micro – Modular, secure. A: Sender waits for ACK after each frame.

Q61. Producer-consumer problem? Q82. Sliding window?

A: Solved using semaphores/buffers. A: Allows multiple frames in transit.

Q62. Critical section? Q83. MTU?

A: Code accessing shared resources. A: Maximum Transmission Unit (max packet size).

Q63. System call? Q84. CSMA/CD vs CSMA/CA?

A: Interface between user program and OS (e.g., open, read). A: CD – Detect collisions (Ethernet). CA – Avoid collisions (Wi-
Fi).
Q64. Demand paging?
A: Load pages only when required. Q85. NAT?
A: Network Address Translation – maps private → public IP.
Q105. WHERE vs HAVING?
A: WHERE – Filters rows. HAVING – Filters groups.

5. Database Management (20 Qs)

Q86. DBMS vs RDBMS? 6. Software Engineering (15 Qs)

A: DBMS – Stores data. RDBMS – Table-based, supports
relations. Q106. SDLC models?
A: Waterfall – Sequential. Agile – Iterative.
Q87. ACID properties?
A: Atomicity, Consistency, Isolation, Durability. Q107. Agile vs Scrum?
A: Agile – Methodology. Scrum – Framework within Agile.
Q88. Primary key?
A: Uniquely identifies row. Q108. Black-box vs White-box testing?
A: Black-box – Test functionality only. White-box – Test internal
Q89. Candidate vs Super key? code.
A: Candidate – Minimal key. Super – Any key that identifies row.
Q109. Unit vs Integration testing?
Q90. Foreign key? A: Unit – Smallest components. Integration – Combined modules.
A: Refers to primary key of another table.
Q110. Regression testing?
Q91. Normalization up to 3NF? A: Ensures new changes don’t break old features.
A: 1NF – Atomic values, 2NF – No partial dependency, 3NF – No
transitive dependency. Q111. Use-case diagram?
A: UML diagram for user interactions.
Q92. Denormalization?
A: Adding redundancy for performance. Q112. Functional vs Non-functional requirements?
A: Functional – What system does. Non-functional –
Q93. Inner join vs Outer join? Performance, security.
A: Inner – Matching rows. Outer – Includes unmatched rows too.
Q113. Coupling vs Cohesion?
Q94. Cross join? A: Coupling – Dependency. Cohesion – Internal strength.
A: Cartesian product of tables.
Q114. Version control?
Q95. Indexing? A: Tracks changes (e.g., Git).
A: Improves query speed. Clustered – Rearranges rows. Non-
clustered – Separate index. Q115. Software maintainability?
A: Ease of updating software.
Q96. Clustered vs Non-clustered index?
A: Clustered – One per table, physical order. Non-clustered – Q116. Verification vs Validation?
Multiple possible. A: Verification – Building right product. Validation – Product
meets needs.
Q97. SQL injection?
A: Malicious SQL input to exploit queries. Q117. Cyclomatic complexity?
A: M = E – N + 2P (edges, nodes, connected components).
Q98. DELETE vs TRUNCATE vs DROP?
A: DELETE – Row-wise. TRUNCATE – All rows, keeps table. Q118. SRS?
DROP – Deletes table. A: Software Requirement Specification – document of
requirements.
Q99. UNION vs UNION ALL?
A: UNION – Removes duplicates. UNION ALL – Keeps Q119. Spiral vs V-Model?
duplicates. A: Spiral – Risk-driven. V-Model – Verification/Validation
mapping.
Q100. View in SQL?
A: Virtual table based on query. Q120. Load vs Stress testing?
A: Load – Expected workload. Stress – Beyond capacity.
Q101. Stored procedure vs Function?
A: Procedure – Doesn’t return value, can return multiple.
Function – Returns value.
7. Theory of Computation (10 Qs)
Q102. OLTP vs OLAP?
A: OLTP – Transactions. OLAP – Analytics. Q121. DFA vs NFA?
A: DFA – Single transition. NFA – Multiple/ε transitions.
Q103. ER diagram?
A: Entity-relationship diagram modeling database. Q122. Regular language?
A: Language recognized by DFA/NFA.
Q104. Transaction log?
A: Records all transactions for recovery.
Q123. Regular vs Context-Free grammar?
A: Regular – Simple rules. CFG – Nested structures. Q142. Public vs Private vs Hybrid cloud?
A: Public – Shared, Private – Dedicated, Hybrid – Mix.
Q124. Non-regular language example?
A: {a^n b^n | n ≥ 0}. Q143. Virtualization?
A: Running multiple virtual OS instances on hardware.
Q125. Pumping Lemma?
A: Proof tool for non-regular languages. Q144. Advantages of cloud computing?
A: Scalability, Cost-saving, Accessibility.
Q126. PDA?
A: Pushdown Automata – Recognizes context-free languages. Q145. Hadoop & HDFS?
A: Hadoop – Big Data framework. HDFS – Distributed storage.
Q127. CFL vs CSL?
A: CFL – Recognized by PDA. CSL – Recognized by Linear Q146. Apache Spark?
Bounded Automata. A: Fast, in-memory big data processing engine.

Q128. Turing Machine? Q147. MapReduce?

A: Abstract machine recognizing recursive enumerable A: Splits tasks into Map (parallel) + Reduce (aggregate).
languages.
Q148. Encryption types?
Q129. Halting problem? A: Symmetric, Asymmetric.
A: No algorithm can decide if a program halts for all inputs.
Q149. Symmetric vs Asymmetric encryption?
Q130. Applications of Automata? A: Symmetric – One key. Asymmetric – Public/Private keys.
A: Regex, compiler design, parsing.
Q150. RSA algorithm?
A: Asymmetric encryption using prime factorization.

8. Compiler Design (10 Qs) Q151. AES?

A: Advanced Encryption Standard, symmetric, secure.
Q131. Phases of compiler?
A: Lexical → Syntax → Semantic → IR → Optimization → Code Q152. Hashing?
generation. A: One-way function mapping input to fixed size (MD5, SHA).

Q132. Lexical analysis? Q153. MD5 vs SHA?

A: Converts source code into tokens. A: MD5 – 128-bit, less secure. SHA – 256/512-bit, more secure.

Q133. Token, lexeme, pattern? Q154. Firewall vs IDS vs IPS?

A: Token – Category, Lexeme – Instance, Pattern – Rule. A: Firewall – Blocks

Q134. Parser role?

A: Checks syntax according to grammar.
Perfect That way you can revise in manageable chunks.
Q135. LR parsing? I’ll generate 10 detailed Q&A at a time until we reach all 155+
A: Bottom-up parsing method. questions.

Q136. Top-down vs Bottom-up parsing?

A: Top-down – From root to leaves. Bottom-up – From leaves to
root. Daimler CS/IT Technical Q&A Bank

Q137. Intermediate code generation? Set 1: Q1 – Q10

A: Converts to platform-independent code.

Q138. Code optimization techniques?

A: Constant folding, Dead code elimination, Loop unrolling.
Q1. What are the four pillars of OOP? Explain with examples.
Q139. Symbol table?
Answer:
A: Stores identifiers, scope, type info.
1. Encapsulation – Wrapping variables & methods in a
Q140. Semantic analysis?
class.
A: Checks meaning (type checking).
Example: private variables with public getters/setters in Java.

9. Cloud Computing & Security (15 Qs)

2. Inheritance – One class acquires properties of another.
Q141. IaaS vs PaaS vs SaaS?
A: IaaS – Infra, PaaS – Platform, SaaS – Software. Example: class Dog extends Animal.
 Q4. What is a Constructor? Types of Constructors.
3. Polymorphism – Same interface, different
implementations. Answer:

Example: Method overloading & overriding. Constructor → Special method used for object initialization.

Types:

4. Abstraction – Hiding implementation details, showing Default constructor → Provided automatically if not defined.
only essentials.
Parameterized constructor → Accepts arguments.
Example: Interfaces & abstract classes.
Copy constructor (C++ only) → Creates object as copy of
another.

Q2. Difference between Overloading and Overriding with

examples. Q5. Shallow Copy vs Deep Copy.

Answer: Answer:

Overloading (Compile-time): Same method name but different Shallow Copy: Copies object reference (changes in one reflect in
parameter list. other).

Class MathUtil { Deep Copy: Creates a new independent object with actual values
Int add(int a, int b) { return a+b; } copied.
Double add(double a, double b) { return a+b; }
}

Overriding (Runtime): Subclass redefines a method with the

same signature. Q6. Exception Handling in Java.
Class Animal { Answer:
Void sound() { [Link](“Animal sound”); }
} Mechanism to handle runtime errors.
Class Dog extends Animal {
Void sound() { [Link](“Bark”); } Uses try-catch-finally.
}
Example:

Try {
Int x = 5/0;
Q3. Abstract class vs Interface. } catch(ArithmeticException e) {
[Link](“Error: “ + e);
Answer: } finally {
[Link](“Always executes”);
Abstract class: }

Can have abstract & concrete methods.

Supports inheritance using extends.

Q7. Garbage Collection in Java.
Can have constructors & instance variables.
Answer:
Interface: Automatic memory management (frees unused objects).
Pure abstraction (till Java 7). Algorithm: Mark-and-Sweep.
From Java 8, supports default and static methods. Invoked using [Link]().
Supports multiple inheritance using implements.
Q8. Difference between Stack and Heap Memory. Heavyweight; context switching is slow.

Answer:
Thread:
Stack: Stores local variables, function calls. Managed
automatically. Lightweight unit of a process.

Heap: Stores objects, dynamic memory. Managed by Garbage Shares memory of parent process.
Collector.
Faster context switching.

Example: A browser (process) → multiple tabs (threads).

Q9. Pass by Value vs Pass by Reference.

Answer:

Java: Always pass by value (object references passed by value). Q12. Deadlock in Operating System.

C++: Supports pass by reference using &. Answer:

Void change(int &x) { x = 10; } // Pass by reference Deadlock: Condition where processes are stuck waiting for
resources held by each other.

Necessary conditions (Coffman’s):

Q10. Static Keyword in Java. 1. Mutual Exclusion

Answer:
2. Hold and Wait
Static variable: Shared among all objects.

Static method: Belongs to class, not objects. 3. No Preemption

Static block: Executes once when class loads.

4. Circular Wait

Prevention: Break one condition (e.g., order resources).

That’s Q1–Q10 done.
Avoidance: Banker’s Algorithm.
Do you want me to continue directly with Q11–Q20 now (next
batch), or do you want to revise/test yourself on these before I
send the next set?

Q13. Paging vs Segmentation.

Great Let’s move to the next 10 detailed questions (Q11–
Q20). Answer:

Paging:

Daimler CS/IT Technical Q&A Bank Memory divided into fixed-size blocks (pages/frames).

Set 2: Q11 – Q20 No external fragmentation.

Example: Virtual memory systems.

Q11. Difference between Process and Thread.

Segmentation:
Answer:
Memory divided into variable-size segments (code, data, stack).
Process:
External fragmentation possible.
Independent program in execution.

Has its own memory (address space).

Q14. Difference between Primary Key and Foreign Key.

Answer:

Primary Key: Unique identifier of records in a table. Cannot be Q17. OSI Model Layers.
NULL.
Answer:
Foreign Key: Refers to a primary key in another table; enforces
referential integrity. 1. Physical – Transmission of bits.

Example: 2. Data Link – Error detection, framing (Ethernet).

CREATE TABLE Department (

Dept_id INT PRIMARY KEY, 3. Network – Routing, IP addressing.
Dept_name VARCHAR(50)
);
4. Transport – End-to-end communication (TCP/UDP).
CREATE TABLE Employee (
Emp_id INT PRIMARY KEY,
Emp_name VARCHAR(50), 5. Session – Manages sessions.
Dept_id INT,
FOREIGN KEY(dept_id) REFERENCES Department(dept_id)
); 6. Presentation – Data encryption, compression.

7. Application – User services (HTTP, SMTP).

Q15. Normalization in DBMS.

Answer:

Normalization: Organizing data to reduce redundancy &

improve integrity. Q18. Difference between Compiler and Interpreter.

Forms: Answer:

1NF: Atomic values (no repeating groups). Compiler:

2NF: 1NF + No partial dependency. Translates entire code into machine code at once.

3NF: 2NF + No transitive dependency. Faster execution, slower compilation.

BCNF: Stronger form of 3NF. Example: C, C++.

Interpreter:

Translates code line by line.

Q16. Difference between TCP and UDP.
Slower execution, faster start.
Answer:
Example: Python, JavaScript.
TCP (Transmission Control Protocol):

Connection-oriented.

Reliable (error checking, retransmission).

Q19. What is Dynamic Programming? Give an example.
Slower (used in HTTP, FTP, Email).
Answer:

UDP (User Datagram Protocol): Dynamic Programming (DP): Breaking problems into
overlapping subproblems, storing results to avoid recomputation.
Connectionless.
Example: Fibonacci Series
No guarantee of delivery.
Def fib(n, memo={}):
Faster (used in DNS, VoIP, Streaming). If n in memo: return memo[n]
If n <= 1: return n
 Memo[n] = fib(n-1, memo) + fib(n-2, memo)
Return memo[n] Stores programs, OS, files permanently.

Used in: Shortest path, Knapsack, Matrix chain multiplication.

Q22. Explain the different types of Operating Systems.

Q20. Difference between BFS and DFS.
Answer:
Answer:
1. Batch OS – Executes jobs in batches without user
BFS (Breadth-First Search): interaction.

Uses Queue.
2. Multiprogramming OS – Runs multiple programs
Explores level by level. simultaneously.

Good for shortest path in unweighted graphs.

3. Multitasking OS – Allows multiple tasks for a single
user (Windows, macOS).
DFS (Depth-First Search):

Uses Stack/Recursion. 4. Real-time OS (RTOS) – Immediate processing (aircraft,

medical systems).
Explores depth before backtracking.

Good for detecting cycles, topological sort. 5. Distributed OS – Runs on multiple interconnected
systems.

That’s Q11–Q20 completed.

Q23. Difference between SQL and NoSQL Databases.
Do you want me to continue with Q21–Q30 in the same
detailed format? Answer:

SQL (Relational):
Awesome Let’s keep going with the next 10 detailed questions
(Q21–Q30).
Structured schema.

Uses SQL language.

Daimler CS/IT Technical Q&A Bank Examples: MySQL, PostgreSQL, Oracle.

Set 3: Q21 – Q30

NoSQL (Non-relational):

Flexible schema (document, key-value, graph).

Q21. Difference between Primary Memory and Secondary
Memory. Suitable for Big Data and real-time apps.

Answer: Examples: MongoDB, Cassandra.

Primary Memory (RAM, Cache):

Volatile (data lost when power is off).

Faster access speed. Q24. ACID Properties in DBMS.

Used for immediate execution. Answer:

A – Atomicity: Transaction is all-or-nothing.

Secondary Memory (Hard disk, SSD):
C – Consistency: Database moves from one valid state to another.
Non-volatile (data retained).
I – Isolation: Multiple transactions don’t interfere.
Slower access compared to RAM.
D – Durability: Changes persist even after crashes.

Example: Bank transaction → Debit & Credit must both succeed.

Q28. What is Virtualization?

Answer:
Q25. Difference between Join types in SQL.
Virtualization: Creating a virtual version of computing resources
Answer: (server, OS, storage, network).

INNER JOIN: Returns matching records in both tables. Example: VMware, VirtualBox, Docker.

LEFT JOIN: Returns all records from left table + matched Benefits: Efficient resource usage, isolation, scalability.
records from right.

RIGHT JOIN: All records from right + matched from left.

FULL OUTER JOIN: All records from both tables, matched or Q29. What is Cloud Computing? Service Models.
not.
Answer:

Cloud Computing: Delivery of IT resources (servers, databases,

software) over the internet.
Q26. Difference between Process Scheduling Algorithms.
Service Models:
Answer:
IaaS: Infrastructure as a Service (AWS EC2).
1. FCFS (First Come First Serve): Simple, non-
preemptive, high waiting time. PaaS: Platform as a Service (Google App Engine).

SaaS: Software as a Service (Gmail, Office 365).

2. SJF (Shortest Job First): Picks smallest job first, can
cause starvation.

3. Round Robin (RR): Each process gets equal time slice,

fair for time-sharing. Q30. What is Big Data? Characteristics of Big Data.

Answer:
4. Priority Scheduling: Higher priority process first. Risk
of starvation. Big Data: Large, complex datasets that traditional DBs can’t
handle.

5. Multilevel Queue: Separate queues for different process 5 V’s:

types.
1. Volume – Huge amount of data.

2. Velocity – Speed of generation.

Q27. Difference between Multiprocessing and Multithreading.

3. Variety – Different formats (text, image, video).
Answer:

Multiprocessing: 4. Veracity – Data reliability.

Multiple CPUs executing multiple processes simultaneously.

5. Value – Insights gained.
Example: Servers handling multiple users.

Multithreading:

Single process with multiple threads.

That’s Q21–Q30 done.
Example: Browser downloading + playing video + rendering
page.
 Shall I continue with Q31–Q40 next in the same detailed Random access using index.
style?
Contiguous memory.
Perfect Let’s continue with the next 10 detailed questions
(Q31–Q40).
Linked List:

Dynamic size.
Daimler CS/IT Technical Q&A Bank Sequential access only.

Set 4: Q31 – Q40 Nodes connected via pointers.

Use case: Array for frequent access, Linked List for frequent
Q31. Difference between Machine Learning, Deep Learning, and insert/delete.
AI.

Answer:

Artificial Intelligence (AI): Broad concept of machines mimicking Q34. Explain Stack and its applications.
human intelligence.
Answer:
Machine Learning (ML): Subset of AI; systems learn from data
(e.g., classification, regression). Stack: Linear data structure, follows LIFO (Last In First Out).

Deep Learning (DL): Subset of ML; uses neural networks with Operations: push(), pop(), peek().
many layers for complex tasks like image recognition, NLP.
Applications:

Example: Expression evaluation (infix → postfix).

AI → Self-driving car. Undo operations in editors.

ML → Predict traffic patterns. Function call management (recursion).

DL → Detect pedestrians using CNN.

Q35. Explain Queue and its types.

Q32. Explain Hashing in Data Structures.
Answer:
Answer:
Queue: Linear data structure, follows FIFO (First In First Out).
Hashing: Technique to map keys to indexes in a hash table using
a hash function. Types:

Collision Handling: 1. Simple Queue – Insert at rear, delete from front.

Chaining: Linked list at same index.

2. Circular Queue – Wraps around to save space.
Open Addressing: Linear probing, quadratic probing, double
hashing.
3. Priority Queue – Elements dequeued by priority.

Applications: Databases, password storage, caching.

4. Deque (Double Ended Queue) – Insert/delete at both
ends.

Q33. Difference between Array and Linked List.

Applications: Scheduling, buffering in printers, CPU task
Answer: management.

Array:

Fixed size.
Q36. Explain Binary Search Tree (BST).
 Example (Factorial):
Answer:
Def fact(n):
BST: Binary tree with property – left child < parent < right child. If n == 0: return 1
Return n * fact(n-1)
Operations:
Applications: Tower of Hanoi, Fibonacci, tree traversal,
Insertion: O(log n) (avg). backtracking.

Search: O(log n).

Deletion: Requires replacing node with inorder

predecessor/successor. Q40. Difference between Static Binding and Dynamic Binding.

Answer:
Applications: Searching, sorting, databases, dictionaries.
Static Binding (Compile-time):

Resolved during compilation.

Q37. Explain HashMap vs Hashtable in Java. Example: Method overloading, private/final methods.

Answer:
Dynamic Binding (Runtime):
HashMap:
Resolved at runtime based on object type.
Non-synchronized (faster).
Example: Method overriding.
Allows one null key and multiple null values.

Hashtable:

Synchronized (thread-safe). That’s Q31–Q40 covered.

Doesn’t allow null key or value.
Do you want me to roll out the next set Q41–Q50 right away?

Use case: HashMap for single-thread, Hashtable for multi- Alright Satish here comes the next 10 detailed questions
threaded apps. (Q41–Q50).

Daimler CS/IT Technical Q&A Bank

Q38. Difference between Class and Object.
Set 5: Q41 – Q50
Answer:

Class: Blueprint/template that defines properties & methods.

Q41. Explain Operating System Kernel.
Object: Instance of a class created using new.
Answer:

Example: Kernel: Core part of the OS that manages system resources.

Class Car { Functions:

String brand;
Void start() { [Link](“Car starts”); } Process management (scheduling, multitasking).
}
Car obj = new Car(); // object Memory management (allocation, paging, segmentation).

Device management (drivers, interrupts).

Q39. What is Recursion? Give example. System calls (interface between OS and apps).

Answer:
Types:
Recursion: Function calling itself until base condition is met.
Monolithic Kernel → All services in one kernel (Linux).
 Binary Semaphore (Mutex): Only 0/1, acts as a lock.
Microkernel → Minimal kernel, rest in user space (Minix).
Counting Semaphore: Holds multiple resource instances.

Example (Pseudo-code):

Q42. Difference between Preemptive and Non-Preemptive Wait(S):

Scheduling. While (S <= 0);
S--;
Answer:
Signal(S):
Preemptive Scheduling: S++;

CPU can be taken away from a process.

Examples: Round Robin, Preemptive Priority.

Q45. Explain Paging in OS with example.
Ensures responsiveness, avoids starvation.
Answer:

Non-Preemptive Scheduling: Paging: Memory management scheme that eliminates external

fragmentation.
Once CPU is allocated, process runs till completion.
Logical memory divided into pages, physical memory into
Examples: FCFS, Non-preemptive SJF. frames.

Simpler but less responsive. Page table maps pages → frames.

Example: If page size = 1KB, logical address 2049 → page 2,

offset 1.

Q43. Explain Critical Section Problem.

Answer: Q46. Difference between IPv4 and IPv6.

Critical Section: Code segment where shared resources are Answer:

accessed.
IPv4:
Problem: Ensure that only one process accesses critical section at
a time. 32-bit address, ~4.3 billion addresses.

Solution Requirements: Written in decimal ([Link]).

1. Mutual Exclusion – Only one process at a time. Uses NAT for address conservation.

2. Progress – If no process in CS, one must enter. IPv6:

128-bit address, almost infinite addresses.

3. Bounded Waiting – Limit waiting time for each process.
Written in hex ([Link]).

Built-in security (IPSec).

Solutions: Locks, Semaphores, Monitors.

Q44. What are Semaphores? Q47. Explain DNS and its working.

Answer: Answer:

Semaphore: Synchronization tool to control access to shared DNS (Domain Name System): Translates domain names → IP
resources. addresses.

Types: Working:
 1. User enters [Link].
Malloc(), calloc(), realloc(), free().

2. Query goes to DNS Resolver.

In C++:

3. Resolver asks Root DNS → TLD (.com) → New and delete.

Authoritative DNS.

In Java/Python:
4. IP address returned to user.
Handled automatically by Garbage Collector.

Uses: Website access, email routing.

That’s Q41–Q50 done.

Q48. Explain Deadlock Detection and Recovery. Satish, do you want me to keep going with Q51–Q60, or do
you want me to pause here so you can revise a bit before I load
Answer: more?
Detection: Use Resource Allocation Graph (RAG). If cycle exists
Great Let’s keep building. Here are the next 10 detailed
→ deadlock.
questions (Q51–Q60).
Recovery:

1. Terminate processes.
Daimler CS/IT Technical Q&A Bank

2. Preempt resources. Set 6: Q51 – Q60

3. Rollback processes.
Q51. Difference between Linear Search and Binary Search.

Answer:

Linear Search:

Q49. Difference between Heap and Stack Data Structures. Sequentially checks each element.

Answer: Time Complexity: O(n).

Stack: Works on unsorted arrays.

Follows LIFO.
Binary Search:
Used for function calls, expression evaluation.
Repeatedly divides sorted array in half.

Heap: Time Complexity: O(log n).

Complete binary tree (min-heap, max-heap). Works only on sorted data.

Used in priority queues, heap sort, memory allocation.

Example (Binary Search in Python):

Def binary_search(arr, target):

L, r = 0, len(arr)-1
Q50. What is Dynamic Memory Allocation? While l <= r:
Mid = (l+r)//2
Answer: If arr[mid] == target: return mid
Elif arr[mid] < target: l = mid+1
Allocating memory during runtime. Else: r = mid-1
Return -1
In C:
 Finds shortest path in weighted graphs (non-negative weights).
Q52. Explain Merge Sort Algorithm.
Time Complexity: O(V²) or O((V+E) log V) with heap.
Answer:

Divide and Conquer Algorithm.

Steps:
Q55. Difference between Greedy Algorithm and Dynamic
1. Divide array into halves. Programming.

Answer:
2. Recursively sort each half.
Greedy:

3. Merge sorted halves. Makes locally optimal choice at each step.

Doesn’t always guarantee global optimum.

Time Complexity: O(n log n). Example: Coin change, Huffman coding.

Space Complexity: O(n).

Dynamic Programming:

Solves overlapping subproblems using memoization/tabulation.

Q53. Explain Quick Sort Algorithm. Always guarantees optimal solution.

Answer: Example: Knapsack, Matrix chain multiplication.

Divide and Conquer Algorithm.

Steps:

1. Pick a pivot. Q56. Explain Hash Functions and Properties.

Answer:
2. Partition array into < pivot and > pivot.
Hash Function: Maps input of arbitrary size → fixed-size output
(hash value).
3. Recursively sort partitions.
Properties:

Deterministic (same input → same output).

Time Complexity:
Fast to compute.
Average: O(n log n).
Uniform distribution (avoid collisions).
Worst: O(n²) (when pivot poorly chosen).
Irreversible (hard to guess input from hash).

Faster in practice than Merge Sort (in-place).

Uses: Passwords, digital signatures, blockchain.

Q54. Difference between BFS and Dijkstra’s Algorithm.

Q57. Difference between Symmetric and Asymmetric Encryption.
Answer:
Answer:
BFS:
Symmetric Encryption:
Finds shortest path in unweighted graphs.
Same key for encryption & decryption.
Time Complexity: O(V+E).
Fast but key distribution problem.

Dijkstra’s Algorithm: Example: AES, DES.

 Acceptance Testing: Final validation with client.
Asymmetric Encryption:
White-box Testing: Internal code structure.
Public key for encryption, private key for decryption.
Black-box Testing: Functionality without code knowledge.
Slower but more secure.

Example: RSA, ECC.

That’s Q51–Q60 completed.

Satish, should I keep rolling with Q61–Q70, or do you want

me to stop here for a quick recap before diving deeper?
Q58. Explain Public Key Infrastructure (PKI).
Great Let’s continue with the next 10 questions (Q51–Q60)
Answer:
with detailed explanations.
PKI: Framework that manages digital keys & certificates.

Components:
Q51. Explain Deadlock in Operating Systems. What are the
Certificate Authority (CA) – issues certificates. necessary conditions?

Registration Authority (RA) – verifies identity. Deadlock occurs when a set of processes are blocked because each
process is holding a resource and waiting for another resource
Public/Private Keys. acquired by another process.

Necessary conditions (Coffman’s conditions):

Uses: HTTPS, digital signatures, secure email.
1. Mutual Exclusion → At least one resource must be held
in a non-shareable mode.

2. Hold and Wait → A process holding at least one

Q59. Explain Agile vs Waterfall Model.
resource is waiting to acquire additional resources.
Answer:
3. No Preemption → A resource cannot be forcibly taken
Waterfall Model:
away.
Sequential phases: Requirement → Design → Implementation →
Testing → Deployment.
4. Circular Wait → A cycle exists in the resource allocation
graph.
Rigid, difficult to change.

Best for projects with fixed requirements.

Deadlocks can be prevented, avoided, detected, or recovered.
Agile Model:

Iterative, incremental development.

Frequent customer feedback. Q52. What is Virtual Memory?

Best for dynamic projects (Scrum, Kanban). Virtual memory is a memory management technique that
provides an “illusion” of a large main memory by using both
RAM and disk storage.

Pages of memory are swapped between RAM and disk when

required.
Q60. Explain Software Testing Types.
Advantages:
Answer:
Allows execution of large programs.
Unit Testing: Test smallest components (functions).
Provides isolation between processes.
Integration Testing: Test modules together.
Techniques: Paging, Segmentation.
System Testing: Complete system testing.
 Normalization is a process to organize data in a database to
Example: If a computer has 4 GB RAM but runs a program reduce redundancy and improve consistency.
needing 6 GB, extra memory is allocated on the disk (swap
space). Normal Forms:

1NF: Atomic values (no repeating groups).

2NF: 1NF + no partial dependency.

Q53. Explain the OSI Model and its 7 layers.
3NF: 2NF + no transitive dependency.
OSI Model (Open Systems Interconnection) is a conceptual
framework for communication. BCNF: Stronger form of 3NF.

1. Physical → Transmission of raw bits (cables, NIC).

Example:

2. Data Link → Frames, error detection (MAC, Ethernet). Table with student info + course info → split into Student and
Course tables.

3. Network → Routing, IP addressing (IP).

Benefits: Avoid anomalies (insertion, deletion, update).

4. Transport → Reliable data transfer (TCP, UDP).

5. Session → Establishes/manages sessions (APIs, sockets). Q56. What is ACID in DBMS transactions?

ACID Properties ensure reliable database transactions:

6. Presentation → Data translation, encryption (SSL,
JPEG). 1. Atomicity: All or nothing (rollback if failure).

7. Application → End-user services (HTTP, FTP, SMTP). 2. Consistency: Ensures DB moves from one valid state to
another.

Helps understand how data moves across networks. 3. Isolation: Concurrent transactions do not interfere.

4. Durability: Changes persist even after crash.

Q54. What is the difference between TCP and UDP?

TCP (Transmission Control Protocol): Example: Bank transfer (withdraw + deposit) → must be atomic.

Connection-oriented, reliable.

Ensures packet delivery (ACK, retransmission).

Q57. Explain Primary Key vs Foreign Key.
Used in web browsing (HTTP), email (SMTP).
Primary Key:

UDP (User Datagram Protocol): Unique identifier for a row in a table.

Connectionless, unreliable but fast. Cannot be NULL.

No guarantees for delivery/order. Example: StudentID in Student table.

Used in video streaming, gaming, DNS.

Foreign Key:

Example: Downloading a file → TCP; Watching YouTube live → Refers to Primary Key in another table.
UDP.
Ensures referential integrity.

Example: Course table has StudentID as Foreign Key.

Q55. Explain Normalization in DBMS.

Q58. What are Indexes in DBMS?
That’s Q51–Q60 explained in detail.
Indexes speed up data retrieval at the cost of extra storage and
slower inserts/updates. Do you want me to keep continuing in batches of 10 (Q61–Q70
next) until we reach all 155+ Q&A?
Types:
Perfect Let’s move on with the next 10 questions (Q61–Q70)
Primary Index → On primary key. in detail.
Secondary Index → On non-primary attributes.

Clustered Index → Rearranges table based on index.

Q61. Explain Paging and Segmentation in Memory Management.
Non-clustered Index → Stores separate lookup table.
Paging:

Divides physical memory into fixed-size blocks called frames.

Example: Index on “Name” column in Employee table speeds up
search.
Divides logical memory into pages of the same size.

Eliminates external fragmentation but may cause internal

fragmentation.
Q59. Explain Cloud Computing Service Models. Example: 4 KB page size → a 10 KB process takes 3 pages (2 full,
1 partially filled).
IaaS (Infrastructure as a Service):

Provides virtualized computing resources. Segmentation:

Example: AWS EC2, Google Compute Engine. Divides memory into variable-sized segments based on logical
units (functions, arrays, etc.).
PaaS (Platform as a Service): Eliminates internal fragmentation but causes external
fragmentation.
Provides platform + runtime environment for developers.
Example: Code segment, Data segment, Stack segment.
Example: Heroku, Google App Engine.

SaaS (Software as a Service):

Software delivered over the internet.

Q62. Explain Thrashing in OS.
Example: Gmail, Office 365.
Thrashing happens when a process spends more time swapping
pages between RAM and disk than executing instructions.
Benefits: Scalability, cost-efficiency, flexibility.
Occurs due to:

Too many processes.

Insufficient frames.
Q60. What is Big Data and Hadoop?

Big Data: Large volumes of structured + unstructured data, Symptoms: CPU utilization drops sharply.
difficult to process using traditional methods.
Solution:
Hadoop: Open-source framework for distributed storage and
processing of big data. Reduce degree of multiprogramming.
HDFS: Distributed file system. Use working set model.
MapReduce: Processing model.

YARN: Resource manager.

Q63. What is RAID in storage systems?

Example: Social media analysis, fraud detection.
RAID (Redundant Array of Independent Disks): Combines
multiple disks for performance and reliability. Counting Semaphore (multiple resources).

Levels:
Monitors: High-level synchronization construct.
RAID 0 → Striping (performance, no redundancy).

RAID 1 → Mirroring (high reliability).

RAID 5 → Striping + Parity (balance of performance & fault

tolerance). Q67. Explain DNS (Domain Name System).

RAID 6 → Double parity. DNS translates domain names (e.g., [Link]) into IP addresses
(e.g., [Link]).

Example: Servers use RAID 5 for balancing speed & fault Working:
tolerance.
1. User enters domain in browser.

2. DNS resolver queries root server.

Q64. Explain Process vs Thread.

Process: Independent program with its own memory and 3. Then TLD server (.com, .org, etc.).
resources.

Thread: Lightweight execution unit inside a process; shares 4. Then authoritative name server returns IP.
memory and resources.

Example:
Example: [Link] → DNS → [Link].
Process → MS Word.

Threads inside → Spell check, typing, autosave.

Q68. Explain ARP (Address Resolution Protocol).

Advantage of Threads: Faster context switch, efficient
communication. ARP maps an IP address to a MAC address in a local network.

Working:

Host broadcasts “Who has IP [Link]?”

Q65. What is a Race Condition?
Device with that IP responds with its MAC address.
Race Condition: Occurs when multiple threads/processes access
shared data concurrently and final result depends on the order of
execution. ARP Table: Maintains IP-to-MAC mapping.

Example: Two processes updating a bank account simultaneously

may cause inconsistent balance.

Solution: Synchronization using mutex, semaphores, locks. Q69. What is a Firewall in Networking?

Firewall: Security system that monitors and filters

incoming/outgoing traffic based on rules.

Q66. Explain Mutual Exclusion and Synchronization Types:

Mechanisms.
Packet Filtering Firewall → Blocks based on IP, port.
Mutual Exclusion: Ensures only one process/thread enters a
critical section at a time. Stateful Firewall → Tracks active sessions.

Mechanisms: Application Firewall → Monitors application-level traffic.

Mutex: Lock that allows one thread at a time.

Example: Blocks all traffic except port 80 (HTTP) and 443
Semaphore: Integer variable used for signaling. (HTTPS).

Binary Semaphore (like mutex).

 SELECT * FROM users WHERE username=’admin’ OR ‘1’=’1’
AND password=’pass’;
Q70. Explain HTTP vs HTTPS.
This bypasses login authentication.
HTTP (Hypertext Transfer Protocol):
Prevention:
Application layer protocol.
Use prepared statements.
Data is in plaintext (not secure).
Input validation.

HTTPS (HTTP Secure): Use ORM frameworks.

HTTP + SSL/TLS encryption.

Protects data from sniffing and MITM attacks.

Q73. Difference between OLTP and OLAP.

Example:
OLTP (Online Transaction Processing):
[Link] (insecure).
Handles day-to-day transactions.
[Link] (secure).
Example: Banking, Railway booking.

Characteristics: High concurrency, real-time updates.

That’s Q61–Q70 fully detailed. OLAP (Online Analytical Processing):

Do you want me to continue with Q71–Q80 next (covering Used for decision-making, analysis.
advanced DBMS, networking, and OS)?
Example: Sales forecasting, Business Intelligence.
Got it I’ll continue without asking. Here are Q71–Q80 in
Characteristics: Complex queries, data aggregation.
detail.

Q71. Explain Two-Tier vs Three-Tier Architecture in DBMS.

Q74. What is a Deadlock in DBMS?
Two-Tier Architecture:
Occurs when two or more transactions wait indefinitely for
Client directly communicates with the database.
resources held by each other.
Example: Java application directly accessing Oracle DB.
Example:
Drawback: Poor scalability, maintenance issues.
Transaction T1 → waits for row locked by T2.

Transaction T2 → waits for row locked by T1.

Three-Tier Architecture:

Client → Application Server → Database.

Solutions:
Example: Web app (browser → backend server → DB).
Deadlock prevention (ordering, locking rules).
Advantage: Scalability, security, abstraction.
Deadlock detection (wait-for graph).

Deadlock recovery (rollback transactions).

Q72. What is SQL Injection?

SQL Injection is a security attack where malicious SQL queries

Q75. Explain CAP Theorem in Distributed Systems.
are inserted into input fields.
CAP Theorem (Consistency, Availability, Partition Tolerance): In
Example:
a distributed system, only 2 out of 3 can be guaranteed.
Consistency: Same data across nodes.
Hypervisors:
Availability: System always responds.
Type 1 (Bare Metal, e.g., VMware ESXi).
Partition Tolerance: System continues even if communication
fails. Type 2 (Hosted, e.g., VirtualBox).

Example:

CP: Traditional RDBMS.

Q79. Explain MapReduce in Hadoop.
AP: DynamoDB, Cassandra.
MapReduce: Programming model for distributed processing of
CA: Rare, possible in single-node systems. big data.

Steps:

Map: Input split into key-value pairs.

Q76. What is Load Balancing? Shuffle & Sort: Groups by key.

Load Balancing distributes incoming traffic across multiple Reduce: Aggregates results.
servers to ensure no single server is overloaded.

Types: Example: Counting word occurrences in large files.

Hardware Load Balancers.

Software Load Balancers (HAProxy, NGINX).

Q80. What is Spark and how is it different from Hadoop?

Algorithms: Round Robin, Least Connections, IP Hash. Apache Spark: Big data processing framework faster than
Hadoop.
Example: Cloudflare balancing web traffic.
Difference:

Hadoop uses disk-based MapReduce → slower.

Q77. What is Containerization (Docker)? Spark uses in-memory computation → much faster.

Containerization: Packaging applications with all dependencies

so they can run anywhere. Spark Components: Spark SQL, MLlib, GraphX, Spark
Streaming.
Docker: Most popular container platform.
Example: Real-time fraud detection → Spark; Batch processing
Lightweight (uses OS kernel, not separate OS like VM). → Hadoop.

Portable, scalable.

Example: Running Python app in Docker without worrying That’s Q71–Q80 covered in detail.
about system libraries. Now continuing with Q81–Q90 next.

Alright Let’s continue with Q81–Q90 in detail.

Q78. Explain Virtualization.

Q81. Explain the difference between Process Scheduling
Virtualization: Creating virtual versions of hardware/software.
Algorithms (FCFS, SJF, RR, Priority).
Types:
FCFS (First Come First Serve):
Server Virtualization: Multiple VMs on one server.
Jobs executed in arrival order.
Network Virtualization: Virtual LANs, SDN.
Non-preemptive.
Storage Virtualization: Pooling storage.
Simple but causes convoy effect.
 Optimal: Replace page that won’t be used for longest time
(theoretical best).
SJF (Shortest Job First):

Process with the smallest burst time executed first. Example: LRU used in caching (like browser cache).

Can be preemptive (SRTF) or non-preemptive.

Optimal for waiting time but requires knowledge of burst time.

Q84. Explain Distributed Systems.

Round Robin (RR): Distributed System: A system where components are located on
networked computers and communicate via messages.
Each process gets a fixed time quantum.
Characteristics:
Preemptive, fair for time-sharing systems.
Transparency (location, replication, concurrency).
Performance depends on time slice.
Fault tolerance.

Priority Scheduling: Scalability.

Each process has a priority. Higher priority runs first.

Examples: Google File System, Blockchain, Kubernetes clusters.
Can cause starvation (solved using aging).

Q85. Explain RPC (Remote Procedure Call).

Q82. What is a Context Switch in OS? RPC: Allows a program to execute a function on a remote
machine as if it were local.
Context Switch: Saving the state of a running process and
loading the state of another. Steps:

Steps: Client makes a function call.

1. Save PCB (Program Control Block) of current process. Stub converts call into network message.

Server receives and executes, then returns result.

2. Load PCB of next process.

Example: Microservices communication.

3. Update CPU registers, program counter.

Overhead: More context switching → less CPU utilization. Q86. What is Multithreading and its Benefits?
Example: Switching between browser and music player. Multithreading: Ability of CPU to execute multiple threads
concurrently.

Benefits:

Q83. Explain the difference between Paging and Page Better CPU utilization.
Replacement Algorithms.
Faster execution.
Paging: Divides memory into fixed-size pages.
Responsiveness (UI threads).
Page Replacement: When no free frame is available, OS must
replace an existing page.
Example: Web server handling multiple client requests
Algorithms: simultaneously.

FIFO: Replace oldest page.

LRU (Least Recently Used): Replace least used page.

Q87. Explain Deadlock Prevention and Avoidance.
Prevention: Ensure at least one of Coffman’s conditions doesn’t Advantages: Scalability, schema-less, faster reads/writes.
hold.

Example: Deny “hold and wait” by requiring processes to request

all resources at once.
That’s Q81–Q90 done in detail.
Continuing next with Q91–Q100.
Avoidance: System checks resource requests dynamically.
Awesome Let’s keep going with Q91–Q100 in detail.
Example: Banker’s Algorithm ensures safe state before granting.

Q91. What are Database Anomalies?

Anomalies occur due to poor database design (redundancy, bad

Q88. What is a Database Transaction?
normalization).
Transaction: A sequence of operations performed as a single
Types:
logical unit of work.
Insertion Anomaly: Cannot insert data due to missing other info.
Must follow ACID properties.
Example: Can’t add a new course unless a student is enrolled.
Example: Bank transfer transaction → Debit + Credit
operations.
Deletion Anomaly: Deleting one record removes unintended data.
Types:
Example: Deleting a student also deletes course info.
Read-only transactions.

Read-write transactions.
Update Anomaly: Updating one record requires multiple
changes.

Example: Changing professor’s phone in multiple rows.

Q89. What is Database Locking?

Solution: Normalization.
Locking: Mechanism to ensure concurrency control in DBMS.

Types:

Shared Lock: Multiple transactions can read.

Q92. Explain JOINs in SQL.
Exclusive Lock: Only one transaction can read/write.
JOIN combines rows from two or more tables.

Types:
Granularity: Row-level, table-level.
INNER JOIN: Returns rows with matching values.
Prevents issues like dirty read, lost updates.
LEFT JOIN: All rows from left + matched rows from right.

RIGHT JOIN: All rows from right + matched from left.

Q90. Explain NoSQL Databases and Types. FULL OUTER JOIN: All rows from both sides.
NoSQL Databases: Non-relational DBs designed for unstructured
and semi-structured data. Example:
Types: SELECT [Link], Courses.course_name
FROM Students
Key-Value Stores: Redis, DynamoDB. INNER JOIN Courses
ON [Link] = Courses.student_id;
Document Stores: MongoDB, CouchDB.

Column Stores: Cassandra, HBase.

Graph Databases: Neo4j.

Q93. What is a View in SQL?
View: A virtual table created from a query. 2. SYN-ACK: Server → Client: “Okay, let’s connect.”

Advantages:
3. ACK: Client → Server: “Connection established.”
Simplifies queries.

Provides security (restricts column access).

After this, data transfer starts.
Logical independence.

Example:
Q97. Explain TCP Congestion Control.
CREATE VIEW TopStudents AS
SELECT name, marks FROM Students WHERE marks > 90; Prevents network overload.

Phases:

1. Slow Start: Window grows exponentially.

Q94. What is Normalization vs Denormalization?

Normalization: Organizing data to reduce redundancy (1NF, 2. Congestion Avoidance: Grows linearly.
2NF, 3NF).

Advantage: Integrity, avoids anomalies. 3. Fast Retransmit & Recovery: Detects packet loss and
recovers quickly.

Denormalization: Combining tables to improve query speed.

Advantage: Faster reads (used in data warehouses). Ensures fair bandwidth usage.

Example: E-commerce system may keep “customer + order”

together for fast access.
Q98. What is DHCP?

Dynamic Host Configuration Protocol: Automatically assigns IP

addresses to devices.
Q95. What are ACID vs BASE Properties?
Working:
ACID (RDBMS):
1. DHCP Discover.
Atomicity, Consistency, Isolation, Durability.

2. DHCP Offer.
BASE (NoSQL):

Basically Available, Soft state, Eventually consistent. 3. DHCP Request.

Example: 4. DHCP Acknowledge.

Banking DB → ACID (strict).

Social media likes → BASE (eventually consistent). Example: When you connect to WiFi, DHCP assigns your IP.

Q99. Explain VPN (Virtual Private Network).

Q96. Explain TCP 3-Way Handshake.
VPN: Secure tunnel over public internet.
Used to establish TCP connection.
Benefits:
Steps:
Privacy (IP masking).
1. SYN: Client → Server: “I want to connect.”
Security (encryption).
Remote access to private networks. [Link]/26 → 64 addresses.

Example: Employee accessing office intranet securely from home.

Formula: 2^n subnets, where n = borrowed bits.

Q100. What is SDN (Software Defined Networking)?

Q103. What is IPv4 vs IPv6?
SDN: Networking approach where control plane is separated
from data plane. IPv4:

Features: 32-bit address, ~4.3 billion addresses.

Centralized control. Example: [Link].

Programmable networks.
IPv6:
Scalability.
128-bit address, almost unlimited.

Example: OpenFlow protocol in data centers. Example: [Link].

Difference:

That’s Q91–Q100 completed. IPv6 supports auto-configuration, better security (IPSec), and no
Now moving forward with Q101–Q110 next. NAT needed.

Continuing with Q101–Q110 in detail.

Q104. Explain Difference Between Static and Dynamic Routing.

Q101. What is DNS Caching and its Types?
Static Routing:
DNS Caching: Temporary storage of DNS query results to speed
up future lookups.
Routes manually configured by admin.
Types:
Simple, but not scalable.
Browser Cache: Stored in browser (Chrome, Firefox).
Dynamic Routing:
OS Cache: Maintained by operating system.
Routes automatically updated using protocols.
Resolver Cache: Maintained by ISP’s DNS server.
Examples: RIP, OSPF, BGP.
Example: If you visit [Link], the next request is faster due to
cache.
Example: ISP routers use BGP for internet routing.

Q102. Explain Subnetting in Networking.

Q105. What is BGP (Border Gateway Protocol)?
Subnetting: Dividing an IP network into smaller networks
BGP: Routing protocol used to exchange routing info between
(subnets).
autonomous systems (AS) on the internet.
Benefits: Efficient IP usage, improves security, reduces broadcast
Type: Path vector protocol.
traffic.
Features:
Example:
Scalability for global internet.
IP: [Link]/24 → can be split into:
Policy-based routing.
[Link]/26 → 64 addresses.
Example: Google, AWS use BGP to advertise their networks
globally.

Q109. Explain REST vs SOAP.

REST (Representational State Transfer):

Q106. Explain SSL/TLS Handshake.
Lightweight, stateless, uses HTTP.
Purpose: Establish secure connection over HTTPS.
Data in JSON/XML.
Steps:
Example: GET /users/1.
1. Client Hello (supported ciphers, random number).

SOAP (Simple Object Access Protocol):

2. Server Hello (chooses cipher, sends certificate).
Protocol, strict rules, XML-based.

3. Key exchange + verification. More secure (WS-Security).

4. Session keys established, encrypted communication Example: Banking APIs use SOAP, web apps use REST.
begins.

Example: Used in banking, e-commerce. Q110. What is an API Gateway?

API Gateway: Manages and routes requests between clients and

microservices.

Q107. Explain Load Testing vs Stress Testing. Functions:

Load Testing: Authentication & Authorization.

Tests system under expected workload. Rate limiting.

Example: E-commerce site tested for 10k users. Logging & monitoring.

Stress Testing: Examples: Amazon API Gateway, Kong, NGINX.

Tests system beyond limits to find breaking point.

Example: Same site tested for 100k users.

That’s Q101–Q110 explained.
Continuing next with Q111–Q120.
Goal: Ensure reliability and performance.
Alright continuing with Q111–Q120 in detail.

Q111. What is RAID in Storage Systems?

Q108. What is a Microservices Architecture?
RAID (Redundant Array of Independent Disks): Technique to
Microservices: Software design where application is broken into
combine multiple hard drives for performance and/or
independent services.
redundancy.
Advantages:
Levels:
Scalability.
RAID 0: Striping, fast but no redundancy.
Independent deployment.
RAID 1: Mirroring, redundancy but less storage.
Fault isolation.
RAID 5: Striping + Parity, balance of performance and safety.

RAID 10: Combines RAID 1 + RAID 0.

Example: E-commerce → Cart Service, Payment Service,
Recommendation Service.
Example: Data centers use RAID 5/10 for fault tolerance. Data Warehouse: Centralized storage system optimized for
analytics and reporting.

Features:

Q112. What is Virtualization in Cloud Computing? Stores historical data.

Virtualization: Process of creating virtual versions of resources Uses OLAP (Online Analytical Processing).
(servers, storage, network).

Types: Examples: Amazon Redshift, Google BigQuery, Snowflake.

Hardware Virtualization (VMware, Hyper-V). Use Case: Business Intelligence dashboards.

OS Virtualization (Docker, Kubernetes).

Example: One physical server runs multiple Virtual Machines Q116. Explain Normalization in DBMS.
(VMs).
Normalization: Process of structuring data to reduce redundancy.
Benefit: Cost efficiency, resource utilization, scalability.
Forms:

1NF: Atomic values only.

Q113. Explain Containerization vs Virtualization. 2NF: Remove partial dependencies.

Virtualization: Runs multiple OS on a single machine using 3NF: Remove transitive dependencies.
hypervisors.
BCNF: Stronger version of 3NF.
Containerization: Uses OS-level virtualization, lightweight, faster
(Docker).
Example: Student table split into Student Info + Course Info to
Example: avoid duplication.

VM: Runs full Ubuntu + app.

Container: Runs just app + dependencies.

Q117. What is Deadlock in DBMS?

Use Case: Containers best for microservices deployment. Deadlock: Situation where two or more transactions wait for each
other, causing a standstill.

Example:

Q114. What is CAP Theorem in Distributed Systems? T1 locks A, waits for B.

CAP Theorem: A distributed system can only guarantee 2 of 3: T2 locks B, waits for A.

Consistency ©: Same data everywhere.

Handling:
Availability (A): System always responsive.
Prevention (lock ordering).
Partition Tolerance (P): Works despite network failures.
Detection (wait-for graph).

Examples: Recovery (abort transaction).

MongoDB → CP (Consistency + Partition).

Cassandra → AP (Availability + Partition).

Q118. What are ACID Properties in DBMS?

ACID ensures reliability of transactions:

Q115. What is a Data Warehouse? Atomicity: All or nothing.

Consistency: Maintain rules and constraints. Working:

Isolation: Transactions run independently. Logical memory → divided into pages.

Durability: Changes persist after commit. Physical memory → divided into frames.

Page table maps pages to frames.

Example: Bank transfer must debit & credit together (atomic).

Example: If process requests page 5, OS checks page table →

finds corresponding frame in RAM.

Q119. Explain Difference Between SQL and NoSQL. Advantage: Avoids external fragmentation.

SQL Databases:

Relational, structured schema.

Q122. What is Segmentation in OS?
Examples: MySQL, PostgreSQL.
Definition: Memory management technique dividing memory
Best for transactions. into variable-sized segments based on program’s structure (code,
data, stack).

NoSQL Databases: Comparison with Paging:

Non-relational, flexible schema. Paging → fixed-size blocks.

Types: Document (MongoDB), Key-Value (Redis), Column Segmentation → logical units of varying sizes.
(Cassandra).

Best for scalability & unstructured data. Example: Program may have Segment 1 = Code, Segment 2 =
Data, Segment 3 = Stack.

Q120. What is Indexing in DBMS? Q123. Explain Demand Paging.

Indexing: Technique to speed up retrieval of rows using pointers. Definition: A technique where pages are loaded into memory only
when needed.
Types:
Benefits: Saves memory, allows running larger programs.
Primary Index.
Disadvantage: Page faults may occur, slowing performance.
Secondary Index.
Example: When a program starts, only required pages are
Clustered/Non-clustered Index. loaded.

Example: Searching name in phonebook faster with index.

Tradeoff: Faster reads, but slower writes due to index updates. Q124. What is a Page Fault?

Definition: When a program tries to access a page not currently

in physical memory.

That’s Q111–Q120 in detail. Handling Steps:

Shall I move on with Q121–Q130 (more DBMS + OS concepts)?
1. Check if page is valid.
Perfect Continuing with Q121–Q130 in detail.
2. If valid → bring it from disk to RAM.

Q121. What is Paging in Operating Systems?

3. Update page table.
Definition: Memory management scheme that eliminates
fragmentation by dividing memory into fixed-size blocks (pages).
4. Resume process.
 Advantages: Better CPU utilization, responsiveness.

Example: Opening a large file may trigger multiple page faults. Example: Web browser → one thread for UI, one for network,
one for rendering.

Q125. Explain Thrashing in OS.

Q129. What is Synchronization in OS?
Definition: Condition when the system spends more time
swapping pages in/out of memory than executing instructions. Definition: Coordination of processes/threads to ensure correct
execution in shared environments.
Cause: Overcommitment of memory, too many page faults.
Problems solved: Race conditions, data inconsistency.
Solution: Increase RAM, reduce multiprogramming, use better
replacement algorithms. Techniques:

Mutex (mutual exclusion).

Semaphores.
Q126. What are Page Replacement Algorithms?
Monitors.
Used when page fault occurs & memory is full.

Common Algorithms: Example: Banking system ensuring two users don’t withdraw
same balance simultaneously.
FIFO (First In First Out).

LRU (Least Recently Used).

Optimal (replace the page not needed for longest time). Q130. What is a Semaphore in OS?

Definition: Synchronization primitive used to control access to

Example: LRU often used as it balances performance & shared resources.
implementation complexity.
Types:

Binary Semaphore (mutex): Only 0/1, like lock.

Q127. What is Context Switching in OS? Counting Semaphore: Allows multiple processes (like pool of
resources).
Definition: Process of storing the state of a CPU process and
loading another process’s state.
Operations:
Steps: Save registers, program counter, stack pointer → load next
process state. Wait() → decrements, blocks if <0.

Overhead: Time is wasted in switching, but necessary for Signal() → increments, allows waiting process.
multitasking.

Example: Running multiple apps on your phone involves Example: Printer queue where multiple processes wait for one
frequent context switches. printer.

Q128. What is Multithreading? That’s Q121–Q130 in detail (focused on OS Memory

Management + Synchronization).
Definition: Ability of CPU to execute multiple threads of a
process concurrently. Do you want me to continue straight into Q131–Q140 (more OS +
CPU Scheduling + File Systems)?
Types:

User-level threads.
Great Continuing with Q131–Q140 in detail.
Kernel-level threads.
Q131. What is CPU Scheduling in OS? Time quantum = 4ms.

Definition: CPU scheduling decides which process gets CPU P1(6ms), P2(8ms), P3(10ms).
when multiple processes are ready.
Execution: P1(4) → P2(4) → P3(4) → P1(2) → P2(4) → P3(6).
Goal: Maximize CPU utilization, throughput, and fairness while
minimizing waiting and turnaround time.
Best for: Time-sharing systems.
Types of Scheduling Algorithms:

FCFS (First Come First Serve): Simple, non-preemptive.

SJF (Shortest Job First): Picks process with least burst time. Q135. What is Priority Scheduling?

Round Robin (RR): Each process gets fixed time quantum. Working: CPU assigned to process with highest priority.

Priority Scheduling: Based on process priority. Type: Can be preemptive or non-preemptive.

Problem: Starvation (low-priority process may never execute).

Solution: Aging (increase priority over time).

Q132. Explain First Come First Serve (FCFS) Scheduling. Example: Real-time systems use priority scheduling.

Type: Non-preemptive.

Working: The process that arrives first is executed first.

Q136. What is Multilevel Queue Scheduling?
Example:
Definition: Processes classified into queues (e.g., system,
Processes: P1(5ms), P2(3ms), P3(8ms). interactive, batch), each with its own scheduling algorithm.

Execution order: P1 → P2 → P3. Example:

Foreground (interactive) → Round Robin.

Problem: “Convoy effect” (long process delays shorter ones).
Background (batch) → FCFS.

Benefit: Separates process types.

Q133. What is Shortest Job First (SJF) Scheduling?
Problem: Rigid (processes fixed in one queue).
Type: Can be preemptive (SRTF) or non-preemptive.

Working: Process with smallest CPU burst is chosen.

Example: Q137. Explain Multilevel Feedback Queue (MLFQ).

Processes: P1(8ms), P2(4ms), P3(2ms). Improvement of Multilevel Queue.

Execution order: P3 → P2 → P1. Feature: A process can move between queues depending on
behavior.

Advantage: Minimum average waiting time. Example:

Problem: Requires knowing burst times in advance. New process → high priority queue (RR).

If it uses too much CPU, it moves to lower queue (FCFS).

Q134. Explain Round Robin (RR) Scheduling. Benefit: Reduces starvation, adapts to process type.

Type: Preemptive.

Working: Each process gets a fixed CPU time slice (quantum).

After quantum expires, CPU switches to next process. Q138. What are Real-Time Scheduling Algorithms?

Example: Used in: Real-time systems (aircraft, medical devices).

Types:
Q141. What is a Directory in File System?
Hard real-time: Deadline must be met (miss = failure).
Definition: A directory is a special file that stores metadata
Soft real-time: Deadlines flexible. (names, locations, attributes) of files.

Functions:
Algorithms:
Organizes files.
Rate Monotonic Scheduling (RMS).
Provides hierarchical structure (tree).
Earliest Deadline First (EDF).

Types:

Single-level directory.

Q139. What is a File System in OS? Two-level directory.

Definition: Method used by OS to store, organize, and manage Tree-structured directory.

files on storage devices.
Acyclic-graph directory (files shared).
Functions:

File naming, storage, access, permissions. Example: /home/user/docs/[Link] → directories help organize
data.

Types:

FAT32, NTFS (Windows).

Q142. What is Journaling in File Systems?
Ext3/ext4 (Linux).
Definition: Technique where changes are first written to a log
APFS (macOS). (journal) before being applied to the main file system.

Benefit: Prevents corruption during crashes.

Example: ext4 is common in Linux servers.
Examples: ext4 (Linux), NTFS (Windows).

Use Case: Ensures data consistency after power failures.

Q140. Explain File Allocation Methods.

How files are stored on disk:

Q143. What are File Permissions in OS?
Contiguous Allocation: Files stored in continuous blocks. Fast but
fragmentation. Definition: Rules defining who can read/write/execute a file.

Linked Allocation: Each block points to the next block. Easy but Example in Linux:
slow for random access.
Rwxr-xr-- → Owner: read/write/execute, Group: read/execute,
Indexed Allocation: Uses index block to store addresses of file Others: read only.
blocks. Efficient but overhead of index.

Permissions Levels:
Example: NTFS uses indexed allocation.
Owner.

Group.

That’s Q131–Q140 in detail (CPU Scheduling + File Systems). Others.

Do you want me to continue with Q141–Q150 (more File Systems

+ Security + Networking)? Commands: chmod, chown.

Alright Continuing with Q141–Q150 in detail.

Q144. What is an Inode in File System? Q148. Explain Symmetric vs Asymmetric Encryption.

Definition: Data structure in Unix/Linux storing metadata about Symmetric:

a file.
Fast, one shared secret key.
Stored Info: File size, owner, permissions, timestamps, pointers to
data blocks. Example: AES, DES.

Not stored: File name (stored in directory entry). Problem: Key distribution.

Example: ls -I shows inode number.

Asymmetric:

Uses public & private key pair.

Q145. What is File Fragmentation? Example: RSA, ECC.

Definition: When file data is scattered across disk instead of Problem: Slower but more secure.
being stored contiguously.

Causes: Repeated file creation, deletion, modification. Example Use Case: HTTPS uses both (hybrid encryption).

Problems: Slower access.

Solution: Defragmentation tools (Windows Disk Defrag).

Q149. What is a Firewall?
Modern SSDs: Less affected, but still maintain logical
optimization. Definition: Security system that monitors and controls
incoming/outgoing network traffic based on rules.

Types:

Q146. What is Information Security (InfoSec)? Packet-filtering firewall.

Definition: Protecting information systems from unauthorized Stateful firewall.

access, disclosure, modification, or destruction.
Application firewall.
Principles (CIA Triad):

Confidentiality: Only authorized access. Example: Blocking port 23 (Telnet) for security.

Integrity: Data accuracy and reliability. Modern: WAF (Web Application Firewall) used in cloud.

Availability: System accessible when needed.

Example: Encryption ensures confidentiality. Q150. What is Intrusion Detection System (IDS) vs Intrusion
Prevention System (IPS)?

IDS (Detection): Monitors traffic, raises alerts if suspicious

activity.
Q147. What is Cryptography?
IPS (Prevention): Monitors traffic and blocks suspicious activity
Definition: Study of securing communication through encoding. automatically.

Types: Example:

Symmetric encryption: Same key for encryption/decryption IDS: Snort.

(AES).
IPS: Cisco Firepower.
Asymmetric encryption: Public & private keys (RSA).

Use Case: Enterprise networks deploy both for defense-in-depth.

Applications: SSL/TLS, digital signatures, secure messaging.
 That’s Q141–Q150 in detail (File Systems + Security Basics).

Shall I continue with Q151–Q160 (Security, Networking, and

Software Engineering concepts)? Q154. What is Cross-Site Scripting (XSS)?

Great Let’s move on with Q151–Q160 in detail. Definition: Attack where malicious scripts are injected into web
pages viewed by others.

Types:
Q151. What is Malware and its Types?
Stored XSS.
Malware (Malicious Software): Software intentionally designed
to harm, exploit, or disrupt systems. Reflected XSS.

Types: DOM-based XSS.

Virus: Attaches to files and spreads when files are executed.

Example: <script>alert(‘Hacked’);</script> injected in
Worm: Self-replicates without user action. comments.

Trojan Horse: Appears harmless but malicious inside. Prevention: Input sanitization, Content Security Policy (CSP).

Ransomware: Encrypts files and demands ransom.

Spyware: Steals user information secretly.

Q155. What is Cross-Site Request Forgery (CSRF)?

Example: WannaCry ransomware (2017). Definition: Attack where user is tricked into submitting
unwanted requests on a website where they are authenticated.

Example: Attacker makes user click a malicious link that

transfers money from their bank account.
Q152. What is Phishing?
Prevention: Anti-CSRF tokens, SameSite cookies.
Definition: Social engineering attack where attackers trick users
into revealing sensitive info (passwords, bank details).

Types:
Q156. What is Public Key Infrastructure (PKI)?
Email phishing.
Definition: Framework for managing digital certificates and
Spear phishing (targeted). encryption keys.

Smishing (SMS phishing). Components:

Certificate Authority (CA).

Example: Fake bank email asking for login credentials.
Registration Authority (RA).
Defense: Awareness, spam filters, MFA.
Public & Private keys.

Example: Websites using HTTPS have SSL/TLS certificates

Q153. What is SQL Injection Attack? issued by CAs like DigiCert.

Definition: Attack where malicious SQL queries are injected into

input fields to access/modify database.

Example: Q157. What is a Digital Signature?

SELECT * FROM users WHERE username=’admin’ OR Definition: Cryptographic technique for verifying authenticity
‘1’=’1’; and integrity of data.

→ Always returns true, bypassing authentication. How it Works:

Prevention: Use prepared statements, parameterized queries, 1. Sender hashes the message.
input validation.
 2. Encrypts hash with private key → digital signature. Used in web browsing, emails, file transfer.

3. Receiver decrypts with public key and verifies. UDP (User Datagram Protocol):

Connectionless, faster, no guarantee of delivery.

Use Case: Electronic contracts, secure emails. Used in video streaming, online gaming.

Example: Watching YouTube → UDP (speed preferred), Sending

email → TCP (reliability preferred).
Q158. What is a VPN (Virtual Private Network)?

Definition: Technology that creates a secure encrypted connection

(tunnel) over a public network.
That’s Q151–Q160 in detail (Security + Networking basics).
Benefits:
Do you want me to go ahead with Q161–Q170 (deep Networking
Privacy (hides IP). + Software Engineering concepts)?

Security (encrypts traffic). Awesome Let’s continue with Q161–Q170 in detail.

Remote access to internal resources.

Q161. What is a Subnet Mask?

Example: Employees accessing company network securely from
home.
Definition: A 32-bit number used to divide an IP address into
network and host portions.

Example:
Q159. Explain OSI Model Layers. IP: [Link]
7 Layers: Subnet Mask: [Link] → Network: [Link], Host: 10.
1. Physical: Transmission of raw bits (cables, WiFi).
CIDR Notation: /24 = [Link].
2. Data Link: Error detection, MAC addresses. Use Case: Efficient IP allocation.

3. Network: Routing, IP addressing.

Q162. Explain ARP (Address Resolution Protocol).

4. Transport: Reliable delivery (TCP/UDP).
Definition: Protocol used to map an IP address (logical) to a
MAC address (physical).
5. Session: Establish, maintain sessions.
Process:
6. Presentation: Encryption, compression.
1. Device sends ARP request: “Who has IP [Link]?”

7. Application: User interaction (HTTP, FTP).

2. Device with that IP replies with MAC address.

Example: Sending an email uses all layers.

Example: Used in LAN communication.

Q160. Explain TCP vs UDP.

Q163. What is DHCP (Dynamic Host Configuration Protocol)?
TCP (Transmission Control Protocol):
Definition: Protocol that automatically assigns IP addresses and
network configuration to devices.
Connection-oriented, reliable, error-checking, slower.
Process (DORA): Example: NGINX as reverse proxy for load balancing.

Discover → Offer → Request → Acknowledge.

Example: When you connect your phone to WiFi, DHCP gives it Q167. What is Load Balancing in Networking?
an IP address.
Definition: Technique to distribute network traffic across
multiple servers.

Benefits:
Q164. Explain NAT (Network Address Translation).
Prevents server overload.
Definition: Technique to map private IP addresses to a public IP
address before accessing the internet. Increases reliability & performance.

Types:
Algorithms: Round Robin, Least Connections, IP Hash.
Static NAT.
Example: Cloudflare load balancer for web apps.
Dynamic NAT.

PAT (Port Address Translation).

Q168. What is a CDN (Content Delivery Network)?

Example: Your home router uses NAT so multiple devices share
one public IP. Definition: Distributed network of servers that deliver web
content from locations closer to users.

Benefits:

Q165. What is a VLAN (Virtual LAN)? Faster page load.

Definition: Logical grouping of devices in different LAN Reduces latency.

segments as if they are in the same network.
Handles high traffic.
Benefits:

Increases security. Example: Netflix, YouTube use CDNs to stream video globally.

Reduces broadcast traffic.

Example: HR dept. and Finance dept. on separate VLANs even if Q169. Explain SDN (Software Defined Networking).
they share same switch.
Definition: Networking approach where control plane is
separated from data plane and controlled by software.

Benefits:
Q166. What is a Proxy Server?
Centralized control.
Definition: An intermediary server between client and internet.
Easier configuration.
Types:
Dynamic network management.
Forward proxy (for clients).

Reverse proxy (for servers). Example: OpenFlow is a common SDN protocol.

Use Cases:

Content filtering. Q170. What is DevOps?

Caching. Definition: Culture and set of practices combining development

and operations.
Anonymity.
Goals:
 Containerization: Runs lightweight, isolated applications sharing
Faster software delivery. the same OS kernel. Example: Docker, Kubernetes.

Continuous Integration (CI). Analogy: VM = house with separate utilities; Container =

apartments sharing utilities.
Continuous Deployment (CD).

Tools: Jenkins, Docker, Kubernetes, Ansible.

Q174. What is Kubernetes?
Example: An app updated multiple times daily using CI/CD
pipelines. Definition: Open-source platform to automate deployment,
scaling, and management of containerized applications.

Components:

That’s Q161–Q170 in detail (Networking + DevOps basics). Master node.

Shall I continue with Q171–Q180 (Software Engineering + Cloud Worker nodes.

+ Emerging Tech)?
Pods.
Perfect Let’s wrap this up properly. We already covered Q1–
Q170 in detail. Now I’ll give you the remaining Q171–Q200, each
fully explained. Benefits: Self-healing, load balancing, scalability.

Q171 – Q200 (Final Set)

Q175. What is Docker?

Definition: Platform that packages applications with

dependencies into containers for consistency across
Q171. What is Cloud Computing? environments.
Definition: Delivery of computing services (servers, storage, Benefits:
databases, networking, software) over the internet (“the cloud”).
Portability.
Models:
Isolation.
IaaS (Infrastructure as a Service) → AWS EC2.
Faster deployment.
PaaS (Platform as a Service) → Google App Engine.

SaaS (Software as a Service) → Gmail, Office 365. Example: Running same app on developer’s laptop and
production server without issues.
Benefits: Scalability, cost efficiency, accessibility.

Q176. What is a Data Warehouse?

Q172. What is Virtualization? Definition: Centralized storage system optimized for query and
analysis of large datasets.
Definition: Creating virtual versions of hardware resources like
servers, OS, or storage. Example: Amazon Redshift, Snowflake.
Example: Running multiple virtual machines (VMs) on a single Difference from DBMS: DBMS is for transactions; Data
physical server using VMware or VirtualBox. warehouse is for analytics.
Benefits: Efficient hardware utilization, isolation, easy backups.

Q177. Explain Big Data.

Q173. Difference between Virtualization and Containerization. Definition: Data too large/complex for traditional databases.
Virtualization: Runs entire OS inside VM. Heavy. Example: Characteristics (5 Vs): Volume, Velocity, Variety, Veracity, Value.
VMware, Hyper-V.
Technologies: Hadoop, Spark.
Image recognition.
Use Case: Social media analytics, fraud detection,
recommendation engines. Natural Language Processing (NLP).

Self-driving cars.

Q178. What is Hadoop? Frameworks: TensorFlow, PyTorch.

Definition: Open-source framework for distributed storage and

processing of big data.

Core Components: Q182. What is Artificial Intelligence (AI)?

HDFS (Hadoop Distributed File System). Definition: Simulation of human intelligence by machines.

MapReduce (processing). Subfields: ML, NLP, Robotics, Expert Systems.

YARN (resource manager). Applications: Chatbots, recommendation systems, speech

recognition.

Example: Storing petabytes of logs for analysis.

Q183. Explain Internet of Things (IoT).

Q179. Explain Apache Spark. Definition: Network of physical devices connected to the internet,
collecting and sharing data.
Definition: In-memory big data processing engine faster than
Hadoop MapReduce. Examples: Smart homes, wearable devices, industrial IoT.

Features: Protocols: MQTT, CoAP.

Batch + Stream processing.

Libraries: SparkSQL, MLlib, GraphX.

Q184. What is Edge Computing?

Example: Real-time fraud detection in banking. Definition: Processing data closer to where it is generated (edge
devices) rather than central cloud.

Benefits: Reduced latency, lower bandwidth usage.

Q180. What is Machine Learning? Example: Autonomous cars analyzing sensor data in real time.

Definition: Subset of AI where systems learn patterns from data

without being explicitly programmed.

Types: Q185. What is Blockchain?

Supervised (classification, regression). Definition: Distributed, immutable ledger technology.

Unsupervised (clustering, dimensionality reduction). Features:

Reinforcement learning. Decentralization.

Transparency.
Example: Spam email detection.
Security.

Applications: Cryptocurrency (Bitcoin), supply chain, digital

Q181. Explain Deep Learning. contracts.

Definition: Advanced ML using multi-layered neural networks.

Applications:
Q186. Explain Cybersecurity.
Example: Payment gateway APIs like Razorpay, Stripe.
Definition: Practice of protecting systems, networks, and data
from attacks.

Types of Attacks:
Q191. Explain REST vs SOAP APIs.
Phishing.
REST: Lightweight, stateless, uses JSON, faster.
DDoS.
SOAP: Heavy, XML-based, built-in security, used in enterprise
Malware. apps.

Example: REST = Twitter API, SOAP = Banking services.

Tools: Firewalls, IDS/IPS, encryption.

Q192. What is Microservices Architecture?

Q187. What is Ethical Hacking?
Definition: Application design approach where software is built
Definition: Authorized attempt to gain access to a system to find as independent services communicating via APIs.
vulnerabilities.
Benefits: Scalability, flexibility, fault isolation.
Types: White Hat, Black Hat, Grey Hat.
Example: Netflix uses microservices for streaming, payments,
Tools: Nmap, Metasploit, Wireshark. user management.

Q188. Explain Cloud Security. Q193. What is Monolithic Architecture?

Definition: Measures to protect cloud-based systems, data, and Definition: Traditional approach where all modules are tightly
infrastructure. integrated into a single application.

Practices: Pros: Easy initial development.

Data encryption. Cons: Difficult to scale, update, and maintain.

Identity and Access Management (IAM).

Regular audits.
Q194. What is Agile Methodology?
Example: AWS IAM for secure access control. Definition: Iterative software development approach with focus
on collaboration and flexibility.

Frameworks: Scrum, Kanban.

Q189. What is DevSecOps? Principles: Customer collaboration, adaptive planning,

continuous improvement.
Definition: Extension of DevOps that integrates security practices
throughout the software development lifecycle.

Benefits: Faster detection of vulnerabilities, compliance.

Q195. Explain Scrum Framework.
Tools: Snyk, SonarQube.
Roles: Product Owner, Scrum Master, Development Team.

Artifacts: Product backlog, sprint backlog, increment.

Q190. What is API (Application Programming Interface)? Events: Sprint planning, daily stand-up, sprint review, sprint
retrospective.
Definition: A set of rules for communication between software
components.

Types: REST, SOAP, GraphQL.

Q196. What is CI/CD Pipeline? Mock Tests: Time management is key (60 mins → ~1 min per Q).

CI (Continuous Integration): Code changes are automatically Tip: Daimler often mixes aptitude (60%) + CS technical (40%).
tested and integrated.

CD (Continuous Deployment/Delivery): Code is automatically

deployed to production.
That’s the full Q1–Q200 set complete with detailed answers.
Tools: Jenkins, GitHub Actions, GitLab CI. You now have a comprehensive prep guide for Daimler (and
similar IT/CS online assessments).

Do you also want me to bundle all Q1–Q200 in one structured

study plan (topic-wise revision) so you can review quickly before
Q197. Explain API Gateway. the test?

Definition: Server that acts as entry point for microservices.

Functions:

Routing requests.

Authentication.

Rate limiting.

Example: AWS API Gateway.

Q198. What is Serverless Computing?

Definition: Execution model where cloud provider manages

infrastructure and scaling.

Example: AWS Lambda, Azure Functions.

Benefits: Pay-per-use, no server management.

Q199. What is Quantum Computing?

Definition: Uses principles of quantum mechanics (qubits,

superposition, entanglement) to perform computations.

Advantage: Can solve problems classical computers can’t (e.g.,

cryptography, drug discovery).

Examples: IBM Q, Google Sycamore.

Q200. Final – How to Crack Daimler/Similar Online

Assessments?

Aptitude Prep: Revise quantitative aptitude, reasoning, data

interpretation.

Technical Prep: Cover OS, DBMS, CN, OOPs, DSA, Software

Engineering basics.

Coding Practice: LeetCode, HackerRank (arrays, strings,

recursion, DP).