jagomart
digital resources
picture1_Tutorial Pdf 196648 | Ds Lab 2010 2015


 139x       Filetype PDF       File size 0.24 MB       Source: vemanait.edu.in


File: Tutorial Pdf 196648 | Ds Lab 2010 2015
course data structures with c c laboratory scheme 2010 course code 10csl37 sem 3 course outcome pos cl class tutorial lab psos sessions hrs sessions approxi hrs mate co1 write ...

icon picture PDF Filetype PDF | Posted on 07 Feb 2023 | 2 years ago
Partial capture of text on file.
                     
                     
                       
                   Course:   DATA STRUCTURES WITH C/C++ LABORATORY                  Scheme:2010                               
                   Course Code:(10CSL37)                                                                                           Sem:3  
                                                     
                                                           
                      
                       
                            Course Outcome                                               POs/       CL      Class       Tutorial        Lab  
                                                                                         PSOs             Sessions        (Hrs)      Sessions   
                                                                                                          (approxi                      (Hrs)   
                                                                                                           mate)   
                   CO1    Write C programs using structures, unions,                                                                  
                            dynamic memory allocation functions and                      PO1       C         NA            NA            12   
                            command line arguments                                         
                               
                   CO2    Implement C/C++ linear data structures like                                                                 
                            stacks,  queues,  linked  lists  using  static  and         PO1,      AP         NA            NA            12   
                            dynamic allocation and their applications                    PO3   
                   CO3                                                                                                               
                            Implement C/C++ program for binary search  PO1,                                  NA            NA            08   
                            tree using nonlinear data structure.                         PO3    AP   
                   CO4    Gain knowledge in concepts of C++ like                                                                      
                            classes, operator overloading, friend   
                            functions, constructor overloading.                          PO1    AP           NA            NA            10   
                               
                                              Total Hours of instruction                                                                 42   
                      
                      
                      
                      
                      
                           
                      
                      
                      
                      
                      
                      
                     
                     
                     
                      
                      
                      
                     Course:   DATA STRUCTURES WITH C/C++ LABORATORY                Scheme:2015                               
                   Course Code:(10CSL38)                                                                                           Sem:3  
                                                     
                                                           
                    
                      
                      
                      
                            Course Outcome                                               POs/       CL      Class       Tutorial        Lab  
                                                                                         PSOs             Sessions       (Hrs.)      Sessions   
                                                                                                          (approxi                     (Hrs.)   
                                                                                                           mate)   
                   CO1    Write C programs using arrays, strings,                                                                    
                            dynamic memory allocation functions                          PO1                                         
                                                                                                  AP         NA            NA            12   
                   CO2    Implement C linear data structures like                                                                     
                            stacks,  queues,  linked  lists  using  static  and          PO1,   AP           NA            NA            12   
                            dynamic allocation and their applications                    PO3   
                   CO3                                                                                                               
                            Implement C program for binary search tree  PO1,                                 NA            NA            08   
                            and Graphs using nonlinear data structure.                   PO3    AP   
                   CO4     Understand and choose the appropriate data                                                                 
                            structure for solving real world   
                            problems.                                                    PO1    AP           NA            NA            08   
                               
                                              Total Hours of instruction                                                                 40   
                      
                      
                      
                      
                      
                      
                      
                              
                              
                              
                              
                             
                             
                             
                              
                              
                              
                              
                              
                              
                              
                              
                              
                                
                              
                              
                           Academic Year: 2016-17 (ODD)                               Scheme: 2015   
                           Course: Data Structures and Applications (15CS33)                        Sem: 3      
                              
                              
                                        Course Outcome                                                                      POs/  CL                 Class               Tutorial                  Lab  
                                                                                                                            PSOs                  Sessions                  (Hrs)             Sessions   
                                                                                                                                                   (approxi                                       (Hrs)   
                                                                                                                                                     mate)   
                           CO1    Understanding  the  linear  and  non-linear  data                                                                                                            
                                        structures, Sorting and searching operations,   
                                        File structures.                                                                    PO1            U            10                    NA                    NA   
                           CO2    Analyze the performance of - Stack, Queue,                                                                                                                   
                                        and Lists.                                                                          PO1            A            12                    NA                    NA   
                                                                                                                            PO2   
                           CO3                                                                                                                                                                
                                        Analyze  the  performance  of  Trees,  Graphs,  PO1                                                              8                    NA                    NA   
                                        Searching and Sorting techniques.                                                   PO2            A   
                           CO4    Implement all the applications of Data                                                                                                                       
                                        structures in a high-level language.                                                PO1    AP                   10                    NA                    NA   
                   CO5    Design and apply appropriate data structures                                                               
                            for solving computing problems                             PO1                10   
                                                                                       PO2   
                                                                                               AP                         NA             NA   
                                            Total Hours of instruction                                    50                                  
                         
                      
                     
                     
                     
                      
                      
                      
                      
                      
                      
                      
                      
                      
                      
                      
                      
                      
                   Course: Data Structures using C  (10CS35)                                     Scheme: 2010   
                   Academic Year:  2015-2016                                                                    Sem: 3   
                      
                          Course Outcome                                           POs/      CL        Class         Tutorial          Lab  
                                                                                   PSOs             Sessions          (Hrs)        Sessions   
                                                                                                     (approxi                         (Hrs)   
                                                                                                      mate)   
                 CO1    Understand pointer usage, data abstraction,                                                                  
                          arrays, structures, unions, dynamic memory  PO1                      U        10              NA             NA   
                          allocation and algorithms.   
                          Analyze            the      operations         of                                                          
                 CO2               stacks,   
                          conversion         of     expressions,         postfix  PO1         A          8              NA             NA   
                          evaluations and queues.   
                 CO3      Analyze Singly, Doubly, Circular Singly                                                                    
                          linked lists and its operations.                          PO1       A          9              NA             NA   
                 CO4    Understand the concept of tree, binary tree                                                                  
The words contained in this file might help you see if this file matches what you are looking for:

...Course data structures with c laboratory scheme code csl sem outcome pos cl class tutorial lab psos sessions hrs approxi mate co write programs using unions dynamic memory allocation functions and po na command line arguments implement linear like stacks queues linked lists static ap their applications program for binary search tree nonlinear structure gain knowledge in concepts of classes operator overloading friend constructor total hours instruction arrays strings graphs understand choose the appropriate solving real world problems academic year odd cs understanding non sorting searching operations file u analyze performance stack queue a trees techniques all high level language design apply computing...

no reviews yet
Please Login to review.