HSST Computer Science 111/2010 Syllabus

FURTHER DETAILS REGARDING MAIN TOPICS OF PROGRAMME NO.11/2011 – ITEM 1 HIGHER SECONDARY SCHOOL TEACHER – COMPUTER SCIENCE / COMPUTER APPLICATION & HIGHER SECONDARY SCHOOL TEACHER – COMPUTER SCIENCE / COMPUTER APPLICATION (JUNIOR) HIGHER SECONDARY EDUCATION (CATEGORY NO. 111/2010) 1. Discrete Structures Sets, Relations, Functions. Pigeonhole Principle, Inclusion-Exclusion principle, Equivalence and Partial Orderings. Elementary Counting Techniques. Computability : Models of computation - Finite Automata, Pushdown Automata, Non-determinism and NFA, DPDA and PDA s and Languages accepted by these structures. Grammars - types of grammars - type 0 , type I, type 2 and type 3. The relationship between types of grammars, Languages, Non-computability, Non-computable problems. Groups : Finite fields and Error correcting / detecting codes. Propositional logic. Predicate logic. Well-formed formulae (WFF). Satisfiability and Tautology. 2. Computer Arithmetic 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, identifiers, data types in C, Control constructs in C, Sequence, selection and iteration. Structured data types in C - arrays, structs, unions, strings and pointers. Object-Oriented programming Concepts : Class - object, instantiation, Inheritance -polymorphism and overloading, aggregation, abstract classes, generalization as extension and restriction. Object oriented design. Multiple inheritance 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. Wireless Networks. Greedy method. Network administration. . Relational Database Design and Query Languages E-R diagrams. data dictionary. Light wave transmission. wireless transmission. Dynamic programming. 3NF. Graphs : Definition. TCP/IP model. Spanning trees. Tunnelling. Polling. Design of Algorithms (Divide and Conquer. Telephones . Asymptotic notations . records and files.twisted pair. graphs. Security. Back tracking. stacks. index-sequential and relative files. trees. Composite objects. Normalization . Data Structures and Algorithms Data. High speed LANs. Information. Asynchronous and Synchronous transmission. fibre-optic cables. ATM. omega and theta. Local Area Networks (LAN). coaxial cables.Views. microwave and infrared waves. trunks. Eccentricity of a vertex radius and diameter of a graph. Channel capacity. Data Manipulation Language (DML).4. Topologies. Branch and Bound). Interpolation and Binary Search. linked lists. connected graphs. Object Oriented Database Management Systems – Concepts. walks. Wide Area Networks (WAN). Hashing. Reference Models : The OSI model. File Structures : Fields. broadband ISDN. Tree and rooted tree. Definition of data structure. Centralised and Distributed Database. Embedded SQL. QBE Query Processing and Optimisation. narrowband ISDN. Metropolitan Area Networks (MAN). Sorting and Searching Algorithms. switching. synonyms. Transformation of E-R models to relational design. Bridge. Firewalls. Networks security. 2NF. 5. Concurrency and Recovery in Centralised and Distributed Database Systems. Fragmentation. multiplexing. Arrays. Communication satellitesgeosynchronous and low-orbit. Internetworking : Switch/Hub. paths. direct. priority queues and heaps. Cellular Radio. B-trees and B+ trees. Protocols for . regular and bipartite graphs. Switching techniques. 6. Planar graphs. Router. Data Control Language (CDL) Commands.local loop.big oh. Average case analysis of simple programs like finding of a maximum of n elements. Quick sort. Concentrated virtual circuits. Transmission media. sequences. Analysis of Algorithms. TCP/IP protocols. Hamiltonian and Eulerian graphs.(i ) Data link layer (ii) Network layer. SQL : Data Definition Language (DDL). Integration with RDBMS applications. Networking Devices. indexes. Inter Networks. BCNF and 4NF.INF. Gateways. inverted list and multi-lists. Transmission media . and (iii) Transport layer. Sequential. queues. Database objects like. Recursion. Multiplexing and Concentration. cycles and circuits.radio. Data Communication and Computer Networks Data Communication : Analog and Digital transmission. Domain Name System (DNS) . Operating Systems Main functions of operating systems. Context free grammars. fragmentation. LEX. Indirect Triples. M . Memory management . shell variables. Routing Algorithms. linking. program relocatability. multiprocessing and multitasking. Bottom up parsers . Triples. Assembly language fundamentals (8085 and 8088 based assembly language programming). process management. Intermediate code generation. Intermediate codes . chmod. Scheduling : CPU scheduling.public key. system. System software and Compilers. fstat. close. Bootstrapping. Code generation. Iseek. Banker's algorithm for deadlock handling. 8. Parsing and parse trees. Virtual memory.Routing : Virtual circuits and datagrams. Name servers. open. The DNS. Bourne shell. Systems Calls : Creat. E-mail architecture and E-mail Servers. operator precedence and LR. Congestion control.Electronic Mail and World Wide Web {WWW).shift-reduce. stat. Lexical analysis. Deadlock and scheduling algorithms. Compilation and Interpretation. unlink. umask. Recursive descent parser. secret key. Top down parsers . exec. Programming Environments. I/O Scheduling. lock and unlock. Representation of parse trees and rightmost and leftmost derivations. Resource scheduling. Multiprogramming. Debuggers and program generators. 7.2-pass and single-pass. Code optimization. Concurrent processing : Mutual exclusion. YACC. wait. Resource Records. Linkage editing. command line programming.Quadruples. Assemblers . Predictive parser. Loading. Network Security : Cryptography . The Unix system : File system. Critical regions. relocation. Macros and macro processors. write. paging.left recursion and its removal. link. fork. Text editors. read. Phases of compilation. types and polymorphism. view ports. they include : Parallel computing Parallel virtual Machine (PVM) and message passing interface (MPI) libraries and calls. equations and pattern matching. Animation. example programs in Prolog. Graphic operations for transformations .i n functions. 2D Geometry . Software Metrics . windows. Operators. reference semantics and their implementation. 3D Graphics. Files. Expressions. Storage Devices. data structures. Current Trends and Technologies The topics of current interest in Computer Science and Computer Applications shall be covered. Software Project Management. I/O structures. user interface design. Prototypes. polymorphism. Coding and Testing : Testing level metrics. paradigms. Software Engineering System Development Life Cycle (SDLC) : Steps. function oriented design. Principles.9. Graphics standard. The experts shall use their judgement from time to time to include the topics of popular interest which are expected to be known by an ardent follower of the field. Programming Language Theory Programming language concepts. lists. models. object-oriented design. program development in Prolog. Software quality and reliability. Flow of Control . Water fall model. 12. clipping and windowing. detailed design. logical variables. Authoring Tools. Application. Assignment. Data types. relations.Control structures. Computer Graphics Display systems. Spiral model. dynamic binding. User-Defined and bui l t. lazy evaluation. Today's fastest computers . I/O statements. horn clauses and their execution.Algorithms for drawing primitives. Clean room approach. classes. software engineering 10. Currently. Principles. Data. implementation of Prolog. 11. functions.. Software Design : System design. inheritance. Design level metrics. Principles. class hierarchies. higher order functions. controlling the search order. Applications. Input devices. Input Tools. Advanced architectures. Parameter passing. design. mobile information access devices. mobile data internetworking standards. Parallel Virtual Machine (PVM) and Message Passing Interface (MPI) routines and calls. Parallel programs in PVM paradigm as well as MPl paradigm for simple problems like matrix multiplication.Mobile Computing Mobile connectivity . co routines. (Legal. Data Warehousing : Data Warehouse environment.protocols. EDI Envelope for Message Transport. clustering. mobile computing applications. Credit Cards. wireless delivery technology and switching methods. classification. Risks in Electronic Payment System. Smart Cards. scope. Electronic Data Interchange (EDI) : Concepts. data mining techniques. internet-based EDI. construction and administration. mining scientific and business data. Data Mining : Extracting models and patterns from large databases. Principles of parallelism. Electronic Payment Systems : Digital Token. cellular data communication protocols. link analysis. E-Technologies Electronic Commerce : Framework.Cells. architecture of a data warehouse methodology. sequencing analysis. Organisation applications. EDI Software Implementation. analysis. regression. Framework. Media convergence of Applications.It may be noted that apart from the topics detailed above. Security and Privacy) issues. Standardisation and EDI. questions from other topics prescribed for the educational qualification of the post may appear in the question paper. communication and execution. dependency modelling. NOTE: . Consumer Applications. . There is no undertaking that all the topics above may be covered in the question paper. tools and technology. Applications. EDI and Electronic Commerce. Mobile databases . Designing Electronic Payment Systems. summarization. Documents Similar To HSST Computer Science 111/2010 SyllabusSkip carouselcarousel previouscarousel nextLecture 7 VBASchema Johorcryptolog_18C Language Super Notes 2EP03-440-200_v_1_01574623 - Incorrect Quantity in the SO on Changing the Date in POC Programming Noteslesson 2 - variables and data types part 206-Computer Science EngieeringUntitledMIT6_096IAP11_lec01Structues in cX137daE560_IEC61850_Host_R1cs11_12.pdfAllen Bradley - SLC 500 - Address Referencing Manual03 Deep ParsingJava 2Java Phase 1 Object Oriented Programming Through JavaUntitledC10 - Managing International Iss s Chapter Wise NotesM.Tech(Computer Science & Engineering) Syllabus, JIS College of EngineeringSupplier Selection WorksheetManual Pre Implementation NFEinLesson Plan for Ictl(Form1)Code NoCUDNN_Library_UserGuide.pdfcomputerThe Ring programming language version 1.5.1 book - Part 173 of 180 ABINIT Build System GuideFooter MenuBack To TopAboutAbout ScribdPressOur blogJoin our team!Contact UsJoin todayInvite FriendsGiftsLegalTermsPrivacyCopyrightSupportHelp / FAQAccessibilityPurchase helpAdChoicesPublishersSocial MediaCopyright © 2018 Scribd Inc. .Browse Books.Site Directory.Site Language: English中文EspañolالعربيةPortuguês日本語DeutschFrançaisTurkceРусский языкTiếng việtJęzyk polskiBahasa indonesiaSign up to vote on this titleUsefulNot usefulMaster your semester with Scribd & The New York TimesSpecial offer for students: Only $4.99/month.Master your semester with Scribd & The New York TimesRead Free for 30 DaysCancel anytime.Read Free for 30 DaysYou're Reading a Free PreviewDownloadClose DialogAre you sure?This action might not be possible to undo. Are you sure you want to continue?CANCELOK