Scribd
Upload
108 views2 pages

CSE & AI Syllabus

The document outlines the syllabus for the written examination for the post of Assistant Professor Grade-II (Pay Level 10) for the Department of Computer Science and Engineering (CSE) / Artificial Intelligence (AI) at Sardar Vallabhbhai National Institute of Technology, Surat. The syllabus covers 10 sections - Engineering Mathematics, Digital Logic, Computer Organization and Architecture, Programming and Data Structures, Algorithms, Theory of Computation, Compiler Design, Operating System, Databases, and Computer Networks. Key topics include discrete mathematics, linear algebra, calculus, probability, Boolean algebra, CPU architecture, programming in C, algorithm analysis, automata theory, compilers, processes, file systems, relational databases

Uploaded by

janak
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
108 views2 pages

CSE & AI Syllabus

The document outlines the syllabus for the written examination for the post of Assistant Professor Grade-II (Pay Level 10) for the Department of Computer Science and Engineering (CSE) / Artificial Intelligence (AI) at Sardar Vallabhbhai National Institute of Technology, Surat. The syllabus covers 10 sections - Engineering Mathematics, Digital Logic, Computer Organization and Architecture, Programming and Data Structures, Algorithms, Theory of Computation, Compiler Design, Operating System, Databases, and Computer Networks. Key topics include discrete mathematics, linear algebra, calculus, probability, Boolean algebra, CPU architecture, programming in C, algorithm analysis, automata theory, compilers, processes, file systems, relational databases

Uploaded by

janak
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Sardar Vallabhbhai National Institute of Technology, Surat

Syllabus for Written Examination for the Post of Assistant Professor Grade-II (Pay Level 10)
for the Department of Computer Science and Engineering (CSE) / Artificial Intelligence (AI)

(Advertisement No. Estt. /2023/Faculty/3336/II/2475 dated September 18, 2023)

Section 1: Engineering Mathematics


Discrete Mathematics: Propositional and first order logic. Sets, relations, functions, partial orders and
lattices. Monoids, Groups. Graphs: connectivity, matching, coloring. Combinatorics: counting,
recurrence relations, generating functions.

Linear Algebra: Matrices, determinants, system of linear equations, eigenvalues and eigenvectors,
LU decomposition.

Calculus: Limits, continuity and differentiability. Maxima and minima. Mean value theorem.
Integration.

Probability and Statistics: Random variables. Uniform, normal, exponential, Poisson and binomial
distributions. Mean, median, mode and standard deviation. Conditional probability and Bayes
theorem.

Computer Science and Information Technology

Section 2: Digital Logic


Boolean algebra. Combinational and sequential circuits. Minimization. Number representations and
computer arithmetic (fixed and floating point).

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 paths

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

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.
Page 1 of 2
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.

-0-0-0-0-0-

Page 2 of 2

You might also like