SSC IMD SA Mock 03 – Question 6
Question: A person walks north, turns right twice and left once. Which direction is he facing? एक व्यक्ति उत्तर की
1. General Intelligence & Reasoning, SSC IMD Scientific Assistant - Full Length Mock 03
1. General Intelligence & Reasoning, SSC IMD Scientific Assistant - Full Length Mock 03
SSC IMD SA Mock 03 – Question 1
Question: Find the odd one out. विषम युग्म का चयन कीजिए। Options: PQ25-RS625 UV36-WX1296 AB49-CD2401 EF64-GH4098 PQ25-RS625 UV36-WX1296 AB49-CD2401 EF64-GH4098
1. General Intelligence & Reasoning, SSC IMD Scientific Assistant - Full Length Mock 03
SSC IMD SA Mock 03 – Question 7
Question: A bike travels 40 km/hr for 3 hours and 60 km/hr for 2 hours. Find the average speed. एक
1. General Intelligence & Reasoning, SSC IMD Scientific Assistant - Full Length Mock 03
SSC IMD SA Mock 03 – Question 3
Question: Find the next number:45, 150, 315, 540, 825, ? अगली संख्या ज्ञात कीजिए:45, 150, 315, 540, 825, ? Options:
5. Computer Science Discipline, SSC IMD Scientific Assistant - Full Length Mock 02
SSC IMD SA Mock 02 – Question 198
Question: What is the capacity (in bytes) of an IPv4 packet header without options? बिना किसी विकल्प (options) के एक
5. Computer Science Discipline, SSC IMD Scientific Assistant - Full Length Mock 02
SSC IMD SA Mock 02 – Question 194
Question: Which algorithm finds the Minimum Spanning Tree of a connected graph by maintaining a single growing tree and adding
5. Computer Science Discipline, SSC IMD Scientific Assistant - Full Length Mock 02
SSC IMD SA Mock 02 – Question 199
Question: In relational algebra, what does the natural join \(R \bowtie S\) do? रिलेशनल बीजगणित में नेचुरल जॉइन \(R \bowtie
5. Computer Science Discipline, SSC IMD Scientific Assistant - Full Length Mock 02
SSC IMD SA Mock 02 – Question 200
Question: In compiler design, what is the output of the Lexical Analyzer passed to the Syntax Analyzer? कंपाइलर डिज़ाइन में,
5. Computer Science Discipline, SSC IMD Scientific Assistant - Full Length Mock 02
SSC IMD SA Mock 02 – Question 195
Question: What is the time complexity of the Floyd-Warshall all-pairs shortest paths algorithm on a graph with \(V\) vertices? \(V\)
5. Computer Science Discipline, SSC IMD Scientific Assistant - Full Length Mock 02
SSC IMD SA Mock 02 – Question 196
Question: In an OS using paging, if the memory access time is 100 ns and a page fault takes 8