#1
23rd August 2014, 11:59 AM
| |||
| |||
SET Exam Syllabus for Computer Science and Application
Will you please provide me the detailed syllabus for Himachal Pradesh SET (Computer Science and Applications) Exam????
|
#2
23rd August 2014, 12:09 PM
| |||
| |||
Re: SET Exam Syllabus for Computer Science and Application
As per your request here I am sharing the detailed syllabus for Himachal Pradesh SET (Computer Science and Applications) Exam Syllabus for Himachal Pradesh SET (Computer Science and Applications) Exam Discrete Structures Pigeonhole Principle Non-determinism and NFA Inclusion-Exclusion Principle Models of computation-Finite Automata Functions Probability Pushdown Automata Elementary Counting Techniques Equivalence and Partial Orderings Relations Programming in C and C++ Elements of C-Tokens Structures in C. Sequence, selection and iterations Operators Programming Concepts Tokens identifiers Identifiers Data types Functions parameter Control statements Data types in C. Control Elements of C++ Variables and constants Computer Arithmetic Satisfiability and Tautology Flip-flops-types Boolean algebra and Minimization of Boolean functions Representation of Integers Race condition and comparison Design of combinational and sequential circuits Relational Database Design and SQL E-R diagrams and their transformation Data Definition Language Data Manipulation Language Data Control Language Normalization Limitations of 4NF and BCNF Data and File structures File Structures Fields, records and files Hashing, inverted lists and multi-lists Data, information Definition of data structure Computer Networks Network fundamentals Data Communication Internetworking Routing Local Area Networks Wireless Networks, Inter Networks Network Security Metropolitan Area Networks Wide Area Networks System Software and Compilers Loading, linking, relocation, program relocatability Compilation and Interpretation Assembly language fundamentals Operating Systems Concurrent Processing The Unix System Multiprogramming, multiprocessing, and multitasking Memory Management Software Engineering Software Metrics Software Design Coding and Testing System Development life Cycle Current Trends and Technologies Parallel Computing Digital Libraries and Data Warehousing Broadband Telecommunications Data Warehousing Data Mining Mobile Computing E-Technologies Electronic Payment Systems Windows programming Simple Applications Advanced Windows Programming Documents and views Introduction to Windows programming Part 3 will contains questions from the following topics Theory of Computation Deterministic Finite Automation Complexity of simplex algorithm Assignment and Transportation Problems Data Compression Techniques Neural Networks Models for Information Channel Fuzzy Systems Windows environment Unicode, Documents and Views Error Correcting and Detecting codes Pushdown Automaton Context free Grammars Linear Bounded Automata Variable Length codes Image Processing Linear Programming Problem |
#3
23rd March 2015, 12:15 PM
| |||
| |||
Re: SET Exam Syllabus for Computer Science and Application
I want to crack SET Computer Science and Application exam . Will you please provide the syllabus for preparation?
|
#4
23rd March 2015, 01:05 PM
| |||
| |||
Re: SET Exam Syllabus for Computer Science and Application
As you are looking for the SET Computer Science and Application exam syllabus , here I am providing same for you . 1. Discrete Structures Sets, Relations, Functions, Pigeonhole Principle, Inclusion-Exclusion Principle, Equivalence and Partial Orderings, Elementary Counting Techniques. Probability, Measure(s) for information and Mutual information. Computability : Models of computation-Finite Automata, Pushdown Automata. Non-determinism and NFA, DPDA and PDAs and Languages accepted by these structures. Grammars, Languages, Non-computability and Examples of non-computable problems. Graph : Definition, walks, paths, trails, connected graphs, regular and bipartite graphs, cycles and circuits. Tree and rooted tree. Spanning trees. Eccentricity of a vertex radius and diameter of a graph. Central Graphs. Centre(s) of a tree. Hamiltonian and Eulerian graphs, Planar graphs. Groups : Finite fields and Error correcting/detecting codes. 2. Computer Arithmetic Propositional (Boolean) Logic, Predicate Logic, Well-formed-formulae (WFF), Satisfiability and Tautology. Logic Families : TTL, ECL and C-MOS gates. Boolean algebra and Minimization of Boolean functions, Flip-flops-types, race condition and comparison, Design of combinational and sequential circuits. Representation of Integers : Octal, Hex, Decimal and Binary. 2’s complement and 1’s complement arithmetic, Floating point representation. 3. Programming in C and C++ Programming in C : Elements of C-Tokens, identitiers, data types in C. Control structures in C. Sequence, selection and iteration(s), Structured data types in C arrays, struct, union, string and pointers. O-O Programming Concepts : Class, object, instantiation, Inheritance, polymorphism and overloading. C++ Programming : Elements of C++-Tokens, identifiers, Variables and constants, Data types, Operators, Control statements, Functions parameter passing, Class and objects, Constructors and destructors, Overloading, Inheritance, Templates, Exception handling. 4. Relational Database Design and SQL E R diagrams and their transformation to relational design, normalization-1NF, 2NF, 3NF, BCNF and 4NF. Limitations of 4NF and BCNF. SQL : Data Definition language (DDL), Data Manipulation Language (DML), Data Control language (DCL) commands. Database objects like-Views, indexes, sequences, synonyms, data dictionary. 5. Data and File structures Data, Information, Definition of data structure, Arrays, stacks, queues, linked lists, trees, graphs, priority queues and heaps. File Structures : Fields, records and files, Sequential, direct, index-sequential and relative files, Hashing, inverted lists and multi-lists B trees and B+ trees. 6. Computer Networks Network fundamentals : Local Area Networks (LAN), Metropolitan Area Networks (MAN),Wide Area Networks (WAN), Wireless Networks, Inter Networks. Reference Models : The OSI model, TCP/IP model. Data Communication : Channel capacity, Transmission Media-twisted pair, coaxial cables, fibre-optic cables, wireless transmission-radio, microwave infrared and millimeter waves. Lightwave transmission, Thelephones-local loop, trunks, multiplexing, switching, narrowband ISDN, broadband ISDN, ATM, High speed LANS, Cellular Radio. Communication satellitesgeosynchronous and low-orbit. Internetworking : Switch/Hub, Bridge, Router, Gateways, Concatenated virtual circuits,Tunnelling, Fragmentation, Firewalls. Routing : Virtual circuits and datagrams, Routing algorithms, Conjestion control. Network Security : Cryptography-public key, secret key, Domain Name System (DNS)-Electronic Mail and Worldwide Web (WWW), The DNS, Resource Records, Name servers, E-mailarchitecture and Serves. For detailed syllabus , here is the attachment SET Computer Science and Application exam syllabus ![]() ![]() ![]() ![]() |