DTU Associate Professor Syllabus 2021 Assistant Professor Exam Pattern

By | August 3, 2021


DTU Associate Professor Syllabus 2021 Delhi Technological University Assistant Professor Screening Test Syllabus 2021 DTU Delhi Associate Professor Interview Details 2021 Delhi DTU Assistant Professor Selection Process 2021 DTU Assistant Professor Exam Pattern

DTU Associate Professor Syllabus 2021

Advertisement No. F.DTU/Rectt./SE/2021/F-909/1848

About DTU Associate Professor Recruitment :

Delhi Technological University (DTU) has Recently Announced and Invited the Online Applications from the Eligible Candidates for the Posts of Associate Professor & Assistant Professor. The total number of Vacancies for these Posts were 26 Posts. Many Interested and Eligible Candidates applied for these Posts online. The Process of Submission of Online Applications for these Posts was commenced from 12.07.2021 and Last Date to Apply for these Posts was 09.08.2021. Check the other details from below.

About Exam :

Candidates who applied online will be called for examination. The dates of examination will be notified soon.

Nowadays Competition Level become very high so Competitive Exams gets too tougher. Candidates facing critical problem of “What to prepare” and “How to prepare” to give their best in their exams. So, here we are providing the latest Syllabus & Exam Pattern.

Selection Process :

Name of Post Selection Process
Associate Professor Interview
Assistant Professor Screening Test
Interview

Exam Pattern :

Exam Pattern for the Written Exam is as Follows:-

  • Exam Will be Objective Type.
  • Detailed Exam Pattern Will be Provided Separately.

Exam Syllabus :

Exam Syllabus for Examination is given below :-

Detailed Syllabus Will be Provided Soon.

Assistant Professor (Software Engineering)

Section1: Software Engineering

Software development life cycle, software requirements elicitation, software design, maintenance, software quality
and metrics.
Software Testing: Black and white box testing, levels of testing, regression testing, software verification.

Section 2: Digital Logic and Discrete Mathematics

Boolean algebra. Combinational and sequential circuits. Minimization. Number representations and computer
arithmetic (fixed and floating point).
Propositional and first order logic. Sets, relations, functions, partial orders and lattices. Monoids, Groups. Graphs:
connectivity, matching, coloring. Combinatorics: counting, recurrence relations, generating functions.

Section 3: Computer Organization and Architecture

Machine instructions and addressing modes. ALU, data‐path and control unit. Instruction pipelining, pipeline
hazards. Memory hierarchy: cache, main memory and secondary storage; I/O interface (interrupt and DMA mode).

Section 4: Programming and Data Structures

Programming in C. Recursion. Arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs.

Section 5: Algorithms

Searching, sorting, hashing. Asymptotic worst case time and space complexity. Algorithm design techniques:
greedy, dynamic programming and divide‐and‐conquer. Graph traversals, minimum spanning trees, shortest path

Section 6: Theory of Computation

Regular expressions and finite automata. Context-free grammars and push-down automata. Regular and contexfree languages, pumping lemma. Turing machines and undecidability.

Section 7: Compiler Design

Lexical analysis, parsing, syntax-directed translation. Runtime environments. Intermediate code generation. Local
optimisation, Data flow analyses: constant propagation, liveness analysis, common subexpression elimination.

Section 8: Operating System

System calls, processes, threads, inter‐process communication, concurrency and synchronization.
Deadlock. CPU and I/O scheduling. Memory management and virtual memory. File systems.

Section 9: 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.

Section 10: Computer Networks

Concept of layering: OSI and TCP/IP Protocol Stacks; Basics of packet, circuit and virtual circuit-switching; Data
link layer: framing, error detection, Medium Access Control, Ethernet bridging; Routing protocols: shortest path,
flooding, distance vector and link state routing; Fragmentation and IP addressing, IPv4, CIDR notation, Basics of
IP support protocols (ARP, DHCP, ICMP), Network Address Translation (NAT); Transport layer: flow control and
congestion control, UDP, TCP, sockets; Application layer protocols: DNS, SMTP, HTTP, FTP, Email.

Final Words :

All the Candidates are Advised to be in touch with the Official Website to got the Information Regarding Exam Syllabus, Admit Card & Other Related Information. Also the Candidates Can Bookmark us (www.jobriya.com) by Pressing Ctrl+D.

Important Link Area of DTU Associate Professor Syllabus:

!!..Wish You All The Best..!!

Candidates can leave your comments in the comment box. Any query & Comment will be highly welcomed. Our Panel will try to solve your query. Keep Updating Yourself.



Source link

Spread the love