Sie sind auf Seite 1von 2

APRCET

Andhra University
Visakhapatnam

PART-B will cover 90 Objective Type Questions (Multiple Choice, Matching


type, True/False, Assertion – Reasoning type) carrying 90 marks of 90 minutes
duration. Each question carries 1 mark. There will be negative marks for
wrong answers. Each wrong answer will be penalized @ 1/6th of the marks
prescribed for the question.

(62) COMPUTER SCIENCE AND ENGINEERING, INFORMATION TECHNOLOGY

Section1: Engineering Mathematics

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.

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: 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


Ma hi e i st u tio s a d add essi g odes. ALU, data‐path a d o t ol u it. Instruction
pipelining. 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
te h i ues: g eedy, dy a i p og a i g a d divide‐a d‐ o ue . G aph sea h, i i u
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.

Section 8: Operating System


P o esses, th eads, i te ‐p o ess o u i atio , o u e y a d sy h o izatio . Deadlo k.
CPU scheduling. Memory management and virtual memory. File systems.

Section 9: Databases
ER‐ odel. Relatio al odel: elatio al alge a, tuple al ulus, SQL. I teg ity o st ai ts, o al
forms. File organization, indexing (e.g., B and B+ trees). Transactions and concurrency control.

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