Department: Computer Science and Engineering Subject Code/Name: CS – Theory of Computation Document Type: Question Bank Website: niceindia. Theory of Computation Anna university Question paper Month/year Subject Download link May / June QP: TOC. Anna University B E /B Tech Examination May/June Department of CSE Fifth Semester CS Theory of Computation Question paper.

Author: Tujin Brazil
Country: Antigua & Barbuda
Language: English (Spanish)
Genre: Personal Growth
Published (Last): 25 October 2015
Pages: 16
PDF File Size: 7.44 Mb
ePub File Size: 3.46 Mb
ISBN: 946-8-37460-647-8
Downloads: 49316
Price: Free* [*Free Regsitration Required]
Uploader: Kajikora

Topics include cs13033-theory lists, stacks, queues, linked structures, trees, binary trees; sorting techniques, including heap sort, quick sort, merge sort, shell sort; searching techniques including binary search, binary search trees, red-black trees, hashing. Specific topics include priority queues, sorting, dictionaries, data structures for text processing.

NFA or Non Deterministic Finite Automaton is the one in which there exists many paths for a specific input from current state to next state.

Unprovability of formulae in certain systems.

Topics include elementary number theory gcd, lcm, Euclidean algorithm, congruences, Chinese remainder theorem and graph theory connectedness, complete, regular and bipartite graphs; trees and spanning trees, Eulerian and Hamiltonian graphs, planar graphs; vertex, face and edge colouring; chromatic polynomials. Name of the College: There are first year courses, but they’re weird, e. Depending on the current state and input symbol read from the input tape it changes state.

Introduction to graph theory. I An introduction to algorithm design and analysis. Machines and Algorithms The first part develops and analyzes some standard techniques for algorithm development which are widely coputation to computer science problems.


CR: Survey of theory requirements in other Canadian Honours programs – Soma-notes

Introduction to parallel computational models and algorithms. Simple methods of complexity analysis. Boolean algebra and combinations logic circuits; proof techniques; functions and sequential circuits; sets and relations; finite state machines; sequential instruction execution. CMPT Data Structures and Algorithms A nalysis and design of data structures for lists, cs1303-theoory, trees, dictionaries, and priority queues.

Whenever possible applications from computing and information technology will be included. Context-free languages, derivation trees, normal form grammars, pumping lemma, pushdown automata, determinism. Introduction to complexity theory: Correctness and analysis of those algorithms using specific data structures.

Views Read View source View history.

CS1303 Theory of Computation Syllabus

The existence of intractable problems, heuristics. There’s a summary, followed by a complete listing of courses for the chosen institutes. Finite automata and formal language theory. A regular expression is a string that describes the whole set of strings according to certain syntax rules.

COMP – Analysis of Algorithms and Data Structures Fundamental algorithms for sorting, searching, storage management, graphs, databases and computational geometry. Soundness and completeness and their implications.

Strassen’s methodNP-completeness. Average case and worst case analysis. Their advising material says those who want to do an honours degree but don’t have any specialty in mind should take this option. Interpretations, validity, and satisfiability. Algorithm design paradigms like divide-and-conquer, dynamic programming, greedy, external sorting, B-trees.

V and T are disjoint. Analysis of recursive programs using recurrence relations. Use and development of precise formulations of mathematical ideas. Leave a Reply Cancel reply How to add comment: Introduction to lower bounds. Applications to program specification and verification. Covers advanced techniques for analyzing recursive algorithms, examines major algorithm-design approaches including greedy, divide and conquer, dynamic programming, and graph-based approaches.


CS 303 | CS 1303 | CS2303 Theory of Computation

What are the uses of Context free compuhation Review of proof techniques; application of induction to computing problems. CS Data Structures and Data Management Introduction to widely used and effective methods of data organization, focusing on data structures, their algorithms, and the performance of these algorithms.

Topics in graph theory: Each step is satisfying some logical principle. Intermediate Data Structures and Algorithms Formal abstract data types; tree representations and searching: CSI Discrete Structures 3,1.

NP- hardness and NP- completeness. Ds1303-theory, using and developing precise expressions of mathematical ideas, including definitions and theorems. Topics include abstract data types, lists, stacks, queues, trees and graphs.

The concept of computtaion data types. Topics covered include graph theory, trees, inclusion-exclusion, generating functions, recurrence relations, and optimization and matching. Programs where the choice was not counted: Introduction to soundness, completeness and decidability. What are the components of Finite automaton model? Program design with emphasis on pragmatic and mathematical aspects of program efficiency. Choice of one of three: