BDL Management Trainee Computer Science & Engineering Syllabus 2023 | Bharat Dynamics Limited MT Computer Science & Engineering Syllabus 2023
Bharat Dynamics Limited have released the Hall ticket for the recruitment exam for the post of Management Trainee in different discipline viz Electronics, Mechanical, Computer Science & Engineering, Civil, Electrical, Optics, Business Development, Finance and Human Resource. The BDL Management Trainee exam will be held on 9th & 10th Dec 2023 on various exam centre. The exam centre list is available on official website at bdl-india.in
Here, the ceptam.in portal’s team is providing the Bharat Dynamics Management Trainee Computer Science & Engineering Syllabus in detailed. You may go through this syllabus for preparation of BDL MT Exam 2023
| Engineering Mathematics | |
| Linear Algebra | Matrices, determinants, system of linear equations, eigenvalues and eigen vectors, LU decomposition. |
| Calculus | Limits, continuity and differentiability. Maxima and Minima, Mean Value theorem, Integration. |
| Discrete Mathematics | Propositional and first order logic. Sets, relations, functions, partial orders and lattices. Groups, Graphs : connectivity, matching, coloring.
Combinatorics : counting, recurrence relations, generating functions. |
| Probability | Random variables. Uniform, normal, exponential, poisson and binomial distributions. Mean, median, mode and standard deviation. Conditional probability and Bayes theorem. |
| Digital Logic | Boolean algebra. Combinational and sequential circuits. Minimization. Number representations and computer arithmetic (fixed and floating point) |
| Computer Organization & Architecture | Machine instructions and addressing modes. ALU, data-path and control unit. Instruction pipelining. Memory Hierarchy : Cache, main memory and secondary storage; I/O interface (interrupt and DMA mode) |
| Programming and Data Structures | Programming in C. Recursion. Arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs. |
| Algorithms | Searching, sorting, hashing. Asymptotic worst case time and space complexity.
Algorithm design techniques : greedy, dynamic programming and divide-and-conquer. Graph search, minimum spanning trees, shortest paths. |
| Theory of Computation | Regular expressions and finite automata. Context-free grammars and push-down automata. Regular and contex-free languages, pumping lemma. Turing machines and undecidability. |
| Complier Design | Lexical analysis, parsing, syntax-directed translation. Runtime environments. Intermediate code generation. |
| Operating System | Processes, threads, inter-process communication, concurrency and synchronization. Deadlock. CPU scheduling. Memory management and virtual memory. File systems. |
| Databases | ER-model. Relational Model : relational algebra, tuple calculus, SQL. Integrity constraints, normal forms. File organization, indexing (e.g. B and B+ trees). Transactions and concurrency control. |
| Computer Networks | Concept of layering. LAN technologies (Ethernet). Flow and error control techniques, switching. IPv4/ IPv6, routers and routing algorithms (distance vector, link state). TCP/ UDP and sockets, congestion control. Application layer protocols (DNS, SMTP, POP, FTP, HTTP). Basics of Wi-Fi. Network security : authentication, basics of public key and private key cryptography, digital signatures and certificates, firewalls. |
| Data Collected By | K. Jeyanthi |
| Published On | 11th April 2022 |
Leave a Reply