Integral university Entrance Test ( IUET )

MCA | IUET MCA | M.TECH - Computer Science And Engineering syllabus

Integral University, a seat of educational excellence, is a premier university in Lucknow, the Capital of Uttar Pradesh, India. The university had been established under the Act number 9 of 2004 by the U. P. State Government. It is rather historic that, within a span of six years the Institute of Integral Technology on account of its educational excellence, credibility and value based education in a highly disciplined and decorous environment was recognized as a noted seat of learning all across the country and thus was granted a University status in 2004. Integral University has announced admission to MCA First year and Lateral entry courses for the year 2015. Admissions are based on combined Entrance Test of IUET-2015 in the order of merit of the Entrance Test.

IUET MCA 2021 M.TECH - Computer Science And Engineering syllabus

Integral University Entrance Test ( IUET ) Entrance Examination syllabus for M.TECH. Computer Science And Engineering -2015

UNIT 1:

Mathematical Logic: Propositional Logic; First Order Logic. Set Theory & Algebra: Sets; Relations; Functions; Groups; Partial Orders; Lattice; Boolean Algebra. Graph Theory: Connectivity; spanning trees; Cut vertices & edges; covering; matching; independent sets; Coloring; Planarity; Isomorphism.

UNIT 2:

Digital Logic: Logic functions, Minimization, Design and synthesis of combinational and sequential circuits; Number representation and computer arithmetic (fixed and floating point). Computer Organization and Architecture: Machine instructions and addressing modes, ALU and data-path, CPU control design, Memory interface, I/O interface (Interrupt and DMA mode), Instruction pipelining, Cache and main memory, Secondary storage.

Operating System: Processes, Threads, Inter-process communication, Concurrency, Synchronization, Deadlock, CPU scheduling, Memory management and virtual memory, File systems, I/O systems, Protection and security.

UNIT 3:

Programming and Data Structures: Programming in C: Functions, Recursion, Parameter passing, Scope, Binding; Abstract data types, Arrays, Stacks, Queues, Linked Lists, Trees, Binary search trees, Binary heaps. Algorithms: Analysis, Asymptotic notation, Notions of space and time complexity, Worst and average case analysis; Design: Greedy approach, Dynamic programming, Divide-and-conquer; Tree and graph traversals, Connected components, Spanning trees, Shortest paths; Hashing, Sorting, Searching. Asymptotic analysis (best, worst, average cases) of time and space, upper and lower bounds, Basic concepts of complexity classes – P, NP, NP-hard, NP-complete.

UNIT 4:

Theory of Computation: Regular languages and finite automata, Context free languages and Push-down automata, Recursively enumerable sets and Turing machines, Un-decidability. Compiler Design: Lexical analysis, Parsing, Syntax directed translation, Runtime environments, Intermediate and target code generation, Basics of code optimization. Databases: ER-model, Relational model (relational algebra, tuple calculus), Database design (integrity constraints, normal forms), Query languages (SQL), File structures (sequential files, indexing, B and B+ trees), Transactions and concurrency control.

UNIT 5:

Information Systems and Software Engineering: information gathering, requirement and feasibility analysis, data flow diagrams, process specifications, input/output design, process life cycle, planning and managing the project, design, coding, testing, implementation, maintenance. Computer Networks: ISO/OSI stack, LAN technologies (Ethernet, Token ring), Flow and error control techniques, Routing algorithms, Congestion control, TCP/UDP and sockets, IP(v4), Application layer protocols (ICMP, DNS, SMTP, POP, FTP, HTTP); Basic concepts of hubs, switches, gateways, and routers. Network security – basic concepts of public key and private key cryptography, digital signature, firewalls. Web Technologies: HTML, XML, basic concepts of client-server