AO* algorithm Game playing algorithms: min-max algorithm C12 Game playing algorithms: alpha beta pruning. Assignment 1

Transcription

1 Lecture Planning Starting w.e.f January 2018 Name of the Institute : Aravali College of Engineering & Management Name of teacher with designation: Ms. Ekta Dagar, Assistant Professor Department: Computer Science Subject: Intelligent Systems Month Class Topic/ Chapter to be covered Academic Activity SECTION-A January C01 Foundational issues in intelligent systems: foundation and history of AI, AI problem, techniques- AI progrmming languages Problem space and searchs -C04 Blind search strategies: bfs, dfs, depth limited Test / Assignment Blind search strategies: unidirectional, bidirectional search techniques - Heuristic search strategies: hill climbing, steepest ascent hill climbing algorithm Best first searching algorithm February A* algorithm Case Study on the Scope of Artificial Intelligence in the next 10 years in India C10 AO* algorithm Game playing algorithms: min-max algorithm C12 Game playing algorithms: alpha beta pruning. Assignment 1 SECTION B knowledge representation issues, predicate logic logic programming, constraint propagation Propositional Calculus Rule based deduction system Test 1 C17 knowledge representation using rules C18 Semantic nets Frames C20 Inheritance Presentation-1 SECTION C March C21 Reasoning under uncertainty, probability Baye's probabilistic interferences Dempster shafer theory, heuristic methods Symbolic reasoning under uncertainity Reasoning: statistical, fuzzy Temporal reasoning C27 Non-monotonic reasoning Assignment 2 SECTION D Planning, Planning in situational calculus Representation for planning, partial order planing algorithm C30 Learning: learning from examples, discovery as learning Learning by analogy, explanation based learning April C32 Neural nets, genetic algorithms C33 Priciples of natural language processing, rule based system architecture Expert system architecture C35 Knowledge acquisition concepts Presentation-2 AI aplication to robotics, current trends in intelligent systems Test 2

2 Name of teacher with designation: Seema Rawat ( Assistant Professor) Department: Computer Science Engineering Subject : principal of software engineering Month Class Topic/ Chapter to be covered Academic Activity Test / Assignment Jan Feb C01 C04 C10 The process, software products, emergence of software engineering, evolving role of software, software life cycle models software life cycle models Software Characteristics, Applications, Software crisis. Project management concepts:- software process and project metrics Project planning, project size estimation metrics, project estimation Techniques, empirical estimation techniques, COCOMO- A Heuristic estimation techniques Staffing level estimation, team structures, staffing, risk analysis and management, project scheduling and tracking. Requirements engineering, system modeling and simulation Analysis principles modeling, partitioning Software, prototyping:, Prototyping methods and tools; Specification principles, Representation, the software requirements specification and reviews Analysis Modeling: Data Modeling, Functional modeling and information flow: Data flow diagrams, Behavioral Modeling; The mechanics of structured analysis: Creating entity/ relationship diagram, data flow model, control flow model, the control and process specification; The data dictionary; Other classical analysis methods. Presentation on SDLC Presentation on Project Scheduling MCQ Related to SDLC SRS documentation C12 System Design: Design concepts and principles: the design process: Design and software quality, Design principles; Design concepts: Abstraction, refinement, modularity Software architecture, control hierarchy, structural partitioning, data structure, software procedure, information hiding; Effective modular design: Functional independence, C17 C18 Cohesion, Coupling; Design Heuristics for effective modularity; The design model; Design documentation. Software architecture, Data Design: Data modeling, data structures, databases and the data warehouse, Analyzing alternative Architectural Designs,architectural complexity Mapping requirements into a software architecture; Transform flow, Transaction flow; Transform mapping: Refining the architectural design. March C20 C21 C27 Software Testing Techniques, software testing fundamentals: objectives, principles, testability; Test case design white box testing Black box testing Software Testing Strategies: Verification and validation, Unit testing, Integration testing,; Validation testing, alpha and beta testing; System testing: Recovery testing, security testing, stress testing, performance testing; The art of debugging, the debugging process debugging approaches Software re-engineering, reverse engineering,restructuring, forward engineering. Software re-engineering, reverse engineering,restructuring, forward engineering. :Quality concepts, Software quality assurance, SQA activities; Software reviews cost impact of software defects, defect amplification and removal; formal technical reviews Assignment on Software Testing Techniques April C30 C32 The review meeting, review reporting and record keeping, review guidelines; Formal approaches to SQA; Statistical software quality assurance; software reliability Measures of reliability and availability,the ISO 9000 Quality standards: The ISO approach to quality assurance systems, The ISO 9001 standard, Software Configuration Management Computer Aided software Engineering: CASE, building blocks Integrated case environments Architecture, repository: CASE Assignment on Software Reengineering concept

3 Name of teacher with designation: RAJESH ADHANA Asst. Prof Department: CSE Subject : Coputer Network Month Class Topic/ Chapter to be covered Academic Activity Test / Assignment C01 SECTION A-Introduction to Computer Networks, Introduction to Computer Networks, Example networks ARPANET, Internet, Private Networks Network Topologies: Bus-, Star-, Ring-, Hybrid, Tree -, Complete -, Irregular Topology C04 Types of Networks : Local Area Networks, Metropolitan Area Networks, Wide Area Networks Layering architecture of networks, OSI model, Functions of each layer, Services and Protocols of each layer SECTION B Introduction, History of TCP/IP, Layers of TCP/IP, Protocols Internet Protocol, Transmission Control Protocol, User Datagram Protocol, IP Addressing, IP address classes C10 Subnet Addressing, Internet Control Protocols ARP, RARP, ICMP C12 Application Layer, Domain Name System SMTP, POP,IMAP, FTP NNTP, HTTP, Overview of IP version 6. SECTION C Introduction to LANs, Features of LANs, Components of LANs, Usage of LANs C17 LAN Standards, IEEE 802 standards C18 Channel Access Methods, Aloha CSMA, CSMA/CD, Token Passing C20 Ethernet, Layer 2 & 3 switching, Fast Ethernet and Gigabit Ethernet, Token Ring C21 LAN interconnecting devices: Hubs, Switches,Bridges, Routers, Gateways SECTION D Introduction of WANs, Routing, Congestion Control WAN Technologies, Distributed Queue Dual Bus (DQDB) Synchronous Digital Hierarchy (SDH)/ Synchronous Optical Network (SONET) C27 Asynchronous Transfer Mode (ATM) Frame Relay, Wireless Links SECTION E Remote Monitoring Techniques: Polling, Traps C30 Performance Management Class of Service, Quality of Service C32 Security management, Firewalls C33 VLANs, Proxy Servers Introduction to Network Operating Systems: Client- Server infrastructure C35 Windows NT/2000

4 Name of teacher with designation: RAJESH ADHANA Asst. Prof Department: Subject : SPSA CSE Month Class Topic/ Chapter to be covered Academic Activity C01 Section -A Evolution of Components Systems Programming, Assemblers, Loaders, Linkers, Macros, Compilers. Software tools C04 Text editors, Interpreters and program generators Debug Monitors, Programming environment. Compiler: Brief overview of compilation process, Incremental compiler, loader, overlays Assembler: Problem statement, single phase and two phase assembler, symbol table; Loader schemes, compile and go Loader, general loader schemes, absolute loader, Subroutine linkage, Reallocating loader, C10 Direct linkage Loader, Binders, Linking C12 Section -B Macro language and macro-processor, macro instructions, features of macro facility, Macro instruction arguments, conditional macro expansion, macro calls with macro instruction,defining macros. Theoretical Concept of UNIX Operating System: Basic features of operating system; File structure: CPU scheduling; Memory management: swapping, demand paging; C17 file system: block and fragments, inodes, C18 directory structure; User to user communication Section-C Getting Started with Unix: User names and groups, logging in; Format of Unix commands; C20 Changing your password; Characters with special meaning; Unix documentation; C21 Files and directories; Current directory, looking at the directory contents, absolute and relative pathnames, some Unix directories and files; Looking at the file contents; File permissions; basic operation on files; changing permission modes; Standard files, standard output; Standard input, standard error; filters and pipelines; Processes; finding out about processes; C27 Stopping background process; Unix editor vi. Test Manipulation: Inspecting files; File statistics; Searching for patterns; Comparing files; Operating on files; Printing files; Rearranging files; Sorting files; C30 Splitting files; Translating characters; AWK utility C32 C33 C35 C37 Section -D Shell Programming: Programming in the Borne and C- Shell; Wild cards; Simple shell programs; Shell variables; Shell programming constructs; interactive shell scripts; Advanced features. System Administration: Definition of system administration; Booting the system; Maintaining user accounts; File systems and special files; Backups and restoration; Role and functions of a system manager. Overview of the Linux operating system Revision TE TE TE TE

5 Name of teacher with designation Department Subject: ADA :S P Awasthi, Assistant Professor : Computer Science & Engineering Month Class Topic/Chapter covered Academic activity Test/assignment January C01 Brief review of graph January Sets and disjoint sets, union Sorting and searching algorithms and their analysis in January terms of space and time complexity January C04 Divide and Conquer: General method, binary search January binary search January merge sort, qick sort January selection sort Strassen s matrix multiplication algorithms and analysis January of algorithms for these problems. Feburary Greedy Method: General method Feburary C10 knapsack problem Feburary job sequencing with dead lines Feburary C12 Minimum spanning trees Assignment Feburary Single souce paths and analysis of these problems Feburary Single souce paths and analysis of these problems Feburary Dynamic Programming: General method Feburary optimal binary search trees Feburary C17 O/I knapsack Feburary C18 the traveling salesperson problem March 8 queen s problem March C20 graph colouring March C21 Hamiltonian cycles, analysis of these problems March Branch and Bound: Method March O/I knapsack March efficiency considerations March Techniques for algebraic problems March Techniques for algebraic problems March C27 traveling salesperson problem March some lower bounds on parallel computations April NP Hard problems April C30 NP Complete Problems April Basic concepts Assignment April C32 NP hard graph April C33 NP scheduling problems April NP scheduling problems April C35 Some simplified NP hard problems. April Cook s theorem April C37